{"meta":{"query_hash":"ba5119847aeb","filters":{"venue":"Ars Combinatoria"},"cohort_total":2619,"direct_labels_cover":1,"predictions_cover":2619,"exported":2619,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/ba5119847aeb","api":"https://metacan.xera.ac/api/v1/cohort?venue=Ars+Combinatoria"},"results":[{"id":"W10019877","doi":"10.1103/physrevd.53.5891","title":"Cyclically decomposing the complete graph into cycles with pendent edges","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Graph; Wheel graph; Complete graph; Integer (computer science); Discrete mathematics; Graph power; Line graph; Computer science","score_opus":0.012203389694537608,"score_gpt":0.20142780540359354,"score_spread":0.18922441570905593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W10019877","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62566286,0.0010913984,0.3046329,0.0004421119,0.00021133383,0.0004349428,0.00078382867,0.00045257638,0.06628808],"genre_scores_gemma":[0.8765769,0.000825486,0.10065474,0.00048770584,0.00015143966,0.00032822494,0.002077423,0.00016867301,0.018729363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996761,0.00006431094,0.000016475038,0.00009092401,0.00006371111,0.000088487184],"domain_scores_gemma":[0.9995074,0.000102739876,0.00007338421,0.00017438564,0.00007349136,0.00006847268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020446519,0.0005093791,0.00028204347,0.0008629662,0.00070441875,0.00067329156,0.00043493783,0.00033092164,0.005122942],"category_scores_gemma":[0.0008079177,0.00028053415,0.0006153786,0.0006297505,0.0008650573,0.0009965374,0.0008726328,0.00068741635,0.0006099455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000640894,0.00020257916,0.0025339078,0.00037630898,0.000092969785,0.0010282733,0.0010284788,0.045280464,0.0947507,0.6521248,0.007959566,0.19398095],"study_design_scores_gemma":[0.00011237327,0.00033691735,0.002980681,0.00013485769,0.0001270766,0.0014151073,0.00064593874,0.07109136,0.042392623,0.8105779,0.07010826,0.00007684737],"about_ca_topic_score_codex":0.0017085489,"about_ca_topic_score_gemma":0.002780736,"teacher_disagreement_score":0.005122942,"about_ca_system_score_codex":0.00045737936,"about_ca_system_score_gemma":0.0006841727,"threshold_uncertainty_score":0.017137885},"labels":[],"label_agreement":null},{"id":"W100234480","doi":"","title":"Partitioning a strong tournament into k cycles.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tournament; Mathematics; Combinatorics","score_opus":0.0721396299871602,"score_gpt":0.36684516387593336,"score_spread":0.2947055338887732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W100234480","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4556986,0.0009896924,0.4850236,0.00079078984,0.00030600157,0.0007510926,0.00079919246,0.0007242301,0.05491688],"genre_scores_gemma":[0.8768242,0.00029636887,0.10712376,0.00021377666,0.00007881087,0.00020819099,0.00081630953,0.000115139555,0.014323414],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917006,0.0002739505,0.000051338666,0.00018040801,0.00008847133,0.0002357182],"domain_scores_gemma":[0.99865305,0.00055998814,0.00012847241,0.00026742675,0.00011988921,0.0002711864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007608051,0.00055746734,0.0005834272,0.0006114586,0.00087710045,0.001622098,0.001015316,0.000792768,0.010345196],"category_scores_gemma":[0.003193629,0.00025862484,0.0007049456,0.00093114655,0.0005155494,0.0013878497,0.0011104599,0.0005970946,0.00104289],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020857237,0.0009015802,0.009692417,0.00087784574,0.00041065246,0.0004569474,0.00031067667,0.3660159,0.027637817,0.19109079,0.027379721,0.37313983],"study_design_scores_gemma":[0.00034663372,0.0010162252,0.0038425524,0.0001017137,0.00019417779,0.00041199394,0.00033261479,0.72767264,0.007907312,0.2367971,0.021320304,0.00005670054],"about_ca_topic_score_codex":0.0014895713,"about_ca_topic_score_gemma":0.0027093207,"teacher_disagreement_score":0.010345196,"about_ca_system_score_codex":0.0007024291,"about_ca_system_score_gemma":0.0009368454,"threshold_uncertainty_score":0.034608126},"labels":[],"label_agreement":null},{"id":"W10043420","doi":"10.1103/physrevlett.66.2193","title":"Catalan Numbers, Lucas Numbers, and Circuits.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Catalan number; Lucas number; Arithmetic; Lucas sequence; Combinatorics; Fibonacci number; Fibonacci polynomials","score_opus":0.007480950295347841,"score_gpt":0.25294970692573576,"score_spread":0.24546875663038792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W10043420","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03832603,0.14248486,0.043909054,0.018897671,0.003040366,0.000030363934,0.00077216135,0.00024248085,0.75229704],"genre_scores_gemma":[0.7501419,0.054789275,0.022320189,0.0047294386,0.0050520864,0.000105819745,0.00095306814,0.00012717492,0.16178103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941754,0.00019232515,0.000022888315,0.000099562065,0.0001879418,0.0000797954],"domain_scores_gemma":[0.99912554,0.00042916782,0.00012540328,0.00007926989,0.00015472187,0.000085865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005622035,0.00073127996,0.00058853975,0.0023271989,0.0015875235,0.003988291,0.0007761894,0.0013441215,0.01253683],"category_scores_gemma":[0.0028954025,0.00031924012,0.00040225915,0.0027190412,0.0032722093,0.005488431,0.0014167157,0.0026299797,0.0019830763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006809331,0.0000045685,0.00007013456,0.00003229972,0.0000029172863,0.000016195874,0.00006388352,0.00016835146,0.00005874566,0.98642135,0.0073275943,0.0058271997],"study_design_scores_gemma":[0.0000026078947,0.0000037849845,0.00015446302,0.000022118957,0.000002766137,0.00003800449,0.00006513932,0.00036260355,0.000040642968,0.9765321,0.022771789,0.000003999918],"about_ca_topic_score_codex":0.0033697432,"about_ca_topic_score_gemma":0.005960461,"teacher_disagreement_score":0.01253683,"about_ca_system_score_codex":0.0022823948,"about_ca_system_score_gemma":0.00077714305,"threshold_uncertainty_score":0.041939855},"labels":[],"label_agreement":null},{"id":"W1005427","doi":"","title":"Tough-Maximum Graphs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01270387787674787,"score_gpt":0.22566655314735018,"score_spread":0.2129626752706023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1005427","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08120368,0.0042055235,0.19632232,0.012266874,0.0017760725,0.0002507057,0.009040593,0.0027659372,0.6921683],"genre_scores_gemma":[0.66439116,0.002806559,0.1235225,0.0042196764,0.0011709107,0.0003976645,0.01002599,0.0012670576,0.19219856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919194,0.00018207543,0.000030138595,0.00023304734,0.00018817537,0.00017459932],"domain_scores_gemma":[0.9975069,0.0010327325,0.00027341972,0.00053345656,0.00022299631,0.00043059283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006941867,0.0008459533,0.0007716571,0.0016676752,0.0026348825,0.003455406,0.0017017518,0.0016638736,0.052998785],"category_scores_gemma":[0.004673382,0.0007380106,0.0007736241,0.0019681267,0.001661757,0.0062456434,0.003365525,0.0032942926,0.0075590583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013322677,0.0000615272,0.00045189814,0.0002846362,0.0000221428,0.00008605689,0.0001786744,0.0013420506,0.0016203906,0.878874,0.07709737,0.039848074],"study_design_scores_gemma":[0.000022407741,0.000012931234,0.00047906616,0.00006000066,0.000017902154,0.0002002782,0.00014244157,0.0036053068,0.0011900548,0.9346325,0.059623983,0.000013144319],"about_ca_topic_score_codex":0.0012355332,"about_ca_topic_score_gemma":0.0033362363,"teacher_disagreement_score":0.052998785,"about_ca_system_score_codex":0.0015489727,"about_ca_system_score_gemma":0.0007224497,"threshold_uncertainty_score":0.1772986},"labels":[],"label_agreement":null},{"id":"W100606770","doi":"","title":"Some new bounds and exact results on the independence number of Cartesian product graphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Mathematics; Independence number; Independence (probability theory); Product (mathematics); Cartesian coordinate system; Discrete mathematics; Combinatorics; Statistics; Graph; Geometry","score_opus":0.013893191866972836,"score_gpt":0.23955949034871785,"score_spread":0.22566629848174502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W100606770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10167431,0.023408696,0.51707876,0.012464609,0.0022294798,0.00019722701,0.004788512,0.0023563106,0.33580214],"genre_scores_gemma":[0.7359433,0.015590765,0.18652149,0.0045008077,0.005419182,0.00079134933,0.0061502,0.0019156837,0.04316725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962339,0.00069979846,0.00021039763,0.0009272552,0.0012809192,0.0006477132],"domain_scores_gemma":[0.9768984,0.01714158,0.0011356381,0.0023972741,0.0011086224,0.001318473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035252725,0.0025815708,0.002136211,0.005633913,0.0023003027,0.0067098034,0.0051991525,0.0025185691,0.026524337],"category_scores_gemma":[0.02312053,0.001997457,0.0019111063,0.0075903507,0.0052150595,0.02118933,0.0059220823,0.012128428,0.004824991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033404207,0.00028518226,0.0018014145,0.00071795605,0.000088211156,0.00020256385,0.00054809777,0.01153218,0.003498905,0.8906647,0.037168596,0.053158112],"study_design_scores_gemma":[0.000027688619,0.000025652762,0.0010873127,0.00009720366,0.00005970883,0.00023741915,0.00011370666,0.017482657,0.0016767,0.967172,0.01197642,0.00004362571],"about_ca_topic_score_codex":0.0016950277,"about_ca_topic_score_gemma":0.0031958246,"teacher_disagreement_score":0.026524337,"about_ca_system_score_codex":0.003978782,"about_ca_system_score_gemma":0.0010018923,"threshold_uncertainty_score":0.08873272},"labels":[],"label_agreement":null},{"id":"W100654495","doi":"","title":"List coloring Halin graphs","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.018983832342762137,"score_gpt":0.28440059796351363,"score_spread":0.2654167656207515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W100654495","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26815376,0.0011690498,0.4030729,0.00948532,0.0008856678,0.00032155463,0.002482599,0.006674673,0.30775446],"genre_scores_gemma":[0.7427797,0.0007614982,0.098785914,0.0021829621,0.00035486266,0.00037658014,0.0027624741,0.0014070115,0.15058911],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893826,0.00031778234,0.000045465527,0.00020705505,0.00025610178,0.00023523552],"domain_scores_gemma":[0.9949846,0.0027455902,0.00024450262,0.00087022316,0.00064302166,0.0005120537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084244605,0.0008976681,0.0008862409,0.0014658665,0.0032765856,0.0041263876,0.0018066991,0.0012833929,0.03129135],"category_scores_gemma":[0.0036890935,0.0007427899,0.00070935366,0.0018215306,0.0015858043,0.0046198755,0.0029288854,0.003581626,0.004870044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044505,0.00015487183,0.0007363016,0.00021241777,0.000028377306,0.00015475151,0.00059409335,0.0048025534,0.00456364,0.91040045,0.038585756,0.039321765],"study_design_scores_gemma":[0.00006682929,0.000041300653,0.00026240892,0.000030838855,0.000031654865,0.00013995821,0.00025669127,0.020049946,0.0049690627,0.95413476,0.019994413,0.000022133185],"about_ca_topic_score_codex":0.001579694,"about_ca_topic_score_gemma":0.0037528742,"teacher_disagreement_score":0.03129135,"about_ca_system_score_codex":0.00236982,"about_ca_system_score_gemma":0.001137104,"threshold_uncertainty_score":0.10467994},"labels":[],"label_agreement":null},{"id":"W100886282","doi":"","title":"On the enumeration of noncrossing partitions with fixed points.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Enumeration; Mathematics; Combinatorics","score_opus":0.03131051712841669,"score_gpt":0.28968405949295134,"score_spread":0.25837354236453464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W100886282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3066337,0.0054957755,0.38092393,0.003361034,0.00097153,0.00017863531,0.0012605734,0.0006221247,0.30055273],"genre_scores_gemma":[0.8226506,0.0040464406,0.108737126,0.001027298,0.00069900654,0.000260905,0.0022503722,0.00042826752,0.059899848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897027,0.00033217488,0.000051884832,0.0001647793,0.00029116872,0.0001897195],"domain_scores_gemma":[0.99611413,0.002481338,0.0002801902,0.0005010985,0.00035676206,0.00026650808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012005492,0.0007405046,0.0010424157,0.0031649559,0.0025541442,0.0035564424,0.0018577697,0.0020955447,0.011539011],"category_scores_gemma":[0.009454791,0.0007079678,0.0007174887,0.0031002597,0.003009994,0.0058263806,0.0029417106,0.003229582,0.002355882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008043724,0.000035623343,0.00059280696,0.0000942396,0.000013290338,0.0001337263,0.00025227427,0.0026913167,0.0008185036,0.9621039,0.0055828416,0.027600985],"study_design_scores_gemma":[0.000011073905,0.000012620891,0.0002559006,0.000043733617,0.0000077874165,0.00018483776,0.00010407441,0.0062936,0.0003321522,0.9885666,0.0041788216,0.000008933606],"about_ca_topic_score_codex":0.001074423,"about_ca_topic_score_gemma":0.0019527995,"teacher_disagreement_score":0.011539011,"about_ca_system_score_codex":0.0011940565,"about_ca_system_score_gemma":0.0005837721,"threshold_uncertainty_score":0.038601816},"labels":[],"label_agreement":null},{"id":"W100921371","doi":"","title":"Realizability Results Involving Two Connectivity Parameters.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Realizability; Mathematics; Algorithm","score_opus":0.021915729100403198,"score_gpt":0.28322971006960185,"score_spread":0.26131398096919867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W100921371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11874141,0.0033437966,0.47089684,0.0041397284,0.0006341581,0.00009257101,0.0012417657,0.0005737572,0.400336],"genre_scores_gemma":[0.93941474,0.0018797126,0.03386493,0.00039581506,0.00057830213,0.00013117674,0.0011590092,0.00028090118,0.0222955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991792,0.00020518976,0.000048979036,0.00018063071,0.00026091392,0.00012509871],"domain_scores_gemma":[0.9950895,0.003267418,0.0003929665,0.0007097862,0.00026070955,0.00027963222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096449105,0.0009426528,0.0007541458,0.001793296,0.0014615343,0.0025651776,0.0013801608,0.0016051182,0.02236733],"category_scores_gemma":[0.0075915116,0.00051319407,0.0009543329,0.0017582697,0.0028900097,0.00802287,0.002327376,0.0040142643,0.0016413846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049539212,0.000026375948,0.0003130252,0.000097961914,0.0000142703675,0.00011540577,0.000085608575,0.005312345,0.0008469093,0.98437864,0.0026298214,0.0061300513],"study_design_scores_gemma":[0.000010146332,0.0000105592135,0.0001727429,0.000020078516,0.00001170467,0.00007269672,0.000044925837,0.009571802,0.00052616297,0.9869478,0.002603063,0.000008276868],"about_ca_topic_score_codex":0.0013826735,"about_ca_topic_score_gemma":0.0018067422,"teacher_disagreement_score":0.02236733,"about_ca_system_score_codex":0.0012987506,"about_ca_system_score_gemma":0.0006592888,"threshold_uncertainty_score":0.07482618},"labels":[],"label_agreement":null},{"id":"W101016380","doi":"","title":"The K-behaviour of p-trees.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.012089685359108678,"score_gpt":0.25906609948653836,"score_spread":0.24697641412742968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W101016380","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39394292,0.003976906,0.4867493,0.0076983487,0.0002602516,0.00009638774,0.0020368549,0.0017073465,0.10353179],"genre_scores_gemma":[0.934166,0.001138392,0.05236077,0.0005678514,0.00017452199,0.00008796556,0.00088424,0.00030002178,0.010320205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976922,0.000729434,0.00019358091,0.0005350961,0.00052552344,0.00032412735],"domain_scores_gemma":[0.98121405,0.012824033,0.0012902752,0.0023552952,0.001398101,0.0009181614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020043747,0.00044611335,0.000851059,0.002086696,0.0020749292,0.005422958,0.001536283,0.0017475421,0.006250813],"category_scores_gemma":[0.027847897,0.0006597115,0.0010102032,0.0028254234,0.0038316264,0.008158316,0.0023355968,0.0024060705,0.0023723012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001936772,0.000057687077,0.0070957704,0.0002140863,0.000058980848,0.0007619951,0.0013658497,0.006381926,0.0022041006,0.94099814,0.0071213725,0.033546448],"study_design_scores_gemma":[0.000013970847,0.000017914852,0.00069889164,0.00004450075,0.000019185585,0.00076387404,0.00018109173,0.018558415,0.00069795543,0.9745105,0.0044774814,0.000016257054],"about_ca_topic_score_codex":0.0018478779,"about_ca_topic_score_gemma":0.0013401641,"teacher_disagreement_score":0.006250813,"about_ca_system_score_codex":0.0015639166,"about_ca_system_score_gemma":0.00088600867,"threshold_uncertainty_score":0.020910978},"labels":[],"label_agreement":null},{"id":"W10105315","doi":"","title":"On Asymmetric Colorings of Integer Grids.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Van der Waerden's theorem; Combinatorics; Counterexample; Conjecture; Integer (computer science); Monochromatic color; Sequence (biology); Arithmetic progression; Infinity; Discrete mathematics; Integer sequence; Natural number; Mathematical analysis","score_opus":0.027451573705194077,"score_gpt":0.26118393112549837,"score_spread":0.2337323574203043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W10105315","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5585423,0.0020491458,0.3467971,0.0013531607,0.00029519183,0.00008664081,0.00041048822,0.00034632074,0.09011961],"genre_scores_gemma":[0.9413781,0.00075857877,0.047729243,0.00027968182,0.00018534878,0.000108556305,0.00027339926,0.00009524037,0.009191774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991714,0.00024564294,0.000044819797,0.00014768919,0.00021227264,0.00017822465],"domain_scores_gemma":[0.99684405,0.0016539983,0.00047504448,0.0005094035,0.00021825793,0.0002991911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091585587,0.0006464774,0.000569686,0.0013184915,0.0011238096,0.0014648157,0.0007323114,0.0005655718,0.0036255918],"category_scores_gemma":[0.00437708,0.00042158677,0.0005823858,0.0009600052,0.0031109154,0.0031512983,0.0020875013,0.0014246866,0.0005561284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007942196,0.000014095799,0.0006129561,0.000043003147,0.00000674272,0.00009577385,0.0001523594,0.0077102277,0.002170816,0.98127216,0.0007759614,0.0070664557],"study_design_scores_gemma":[0.000024515695,0.000044368022,0.0006060771,0.000031914115,0.000008068898,0.00024617248,0.00008346715,0.038379736,0.0020179704,0.9543493,0.0041901097,0.000018270002],"about_ca_topic_score_codex":0.0007304738,"about_ca_topic_score_gemma":0.000672127,"teacher_disagreement_score":0.0036255918,"about_ca_system_score_codex":0.0015006305,"about_ca_system_score_gemma":0.00037178554,"threshold_uncertainty_score":0.01212883},"labels":[],"label_agreement":null},{"id":"W101313907","doi":"","title":"On Incidence Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Incidence (geometry); Combinatorics; Geometry","score_opus":0.014924425206149176,"score_gpt":0.22301637166141647,"score_spread":0.2080919464552673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W101313907","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04896,0.010310248,0.31075954,0.01086674,0.002341019,0.00015211392,0.0032783246,0.0013264881,0.61200553],"genre_scores_gemma":[0.5688936,0.013619521,0.1338307,0.0053108344,0.0042506307,0.00050608255,0.0075596785,0.0012938821,0.26473507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988331,0.0003006573,0.00006610564,0.00027780706,0.00033583833,0.00018649091],"domain_scores_gemma":[0.9973774,0.0012106432,0.00023943638,0.0005982654,0.00031468694,0.00025958175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093909976,0.0010716721,0.0012436681,0.003696423,0.0025272523,0.0042913607,0.0015054984,0.0014024669,0.029498404],"category_scores_gemma":[0.0042088474,0.00076318614,0.0011545852,0.004468367,0.0024028223,0.008964676,0.003468679,0.0046886443,0.0073742084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016605041,0.000028241173,0.00034477314,0.000064745254,0.0000117361615,0.000042517706,0.00013705368,0.0006475533,0.00024952347,0.9560521,0.020172317,0.02223276],"study_design_scores_gemma":[0.000005197598,0.0000043379,0.00020494778,0.000026948317,0.00000864405,0.000103801984,0.0000760613,0.0023044029,0.00017017768,0.97430223,0.022787593,0.000005668355],"about_ca_topic_score_codex":0.0015267491,"about_ca_topic_score_gemma":0.0026135473,"teacher_disagreement_score":0.029498404,"about_ca_system_score_codex":0.002254568,"about_ca_system_score_gemma":0.0007475915,"threshold_uncertainty_score":0.09868199},"labels":[],"label_agreement":null},{"id":"W101537656","doi":"","title":"Distance Between Graphs Using Graph Labelings.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Edge-graceful labeling; Graph; Line graph; Discrete mathematics; Graph power","score_opus":0.020169486850561948,"score_gpt":0.2535486037510895,"score_spread":0.23337911690052757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W101537656","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025109166,0.0012888368,0.95350665,0.0010726068,0.0002797363,0.00013520652,0.002279424,0.0022849634,0.014043327],"genre_scores_gemma":[0.24755879,0.0015947495,0.7287124,0.00041118232,0.00036091317,0.00034368905,0.006701992,0.0010062743,0.013310014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99550205,0.0014285217,0.0004971546,0.0012568138,0.0011075244,0.00020789812],"domain_scores_gemma":[0.9828997,0.009069415,0.0015674884,0.004566289,0.001229068,0.0006679126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026223862,0.0009641144,0.0012693162,0.007974724,0.0017088816,0.00556206,0.0021754773,0.0019783974,0.0075108046],"category_scores_gemma":[0.026658198,0.0008465383,0.0011798588,0.009373926,0.0020643175,0.012864317,0.0043028267,0.0029698196,0.0032633722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002920111,0.0002033789,0.0035845505,0.0005859145,0.00012920573,0.00017053158,0.00075649074,0.025729084,0.002937822,0.65824276,0.019492626,0.28787568],"study_design_scores_gemma":[0.00003069555,0.000081507074,0.0009507076,0.00017088339,0.000068369685,0.00041269764,0.0002873441,0.09042323,0.004230952,0.86510354,0.038190797,0.0000493637],"about_ca_topic_score_codex":0.0018568895,"about_ca_topic_score_gemma":0.002565096,"teacher_disagreement_score":0.007974724,"about_ca_system_score_codex":0.0021765055,"about_ca_system_score_gemma":0.0014061012,"threshold_uncertainty_score":0.02512616},"labels":[],"label_agreement":null},{"id":"W101650661","doi":"","title":"A note on the total domination vertex critical graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Graph","score_opus":0.020847416150095426,"score_gpt":0.2936126408208226,"score_spread":0.27276522467072717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W101650661","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085358605,0.025482673,0.18340153,0.019481072,0.01197286,0.00014376163,0.0010182571,0.0007209522,0.6724204],"genre_scores_gemma":[0.79541945,0.021144992,0.06391316,0.0065985923,0.0067900093,0.00015874159,0.0007354276,0.0005973473,0.10464234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976784,0.0000542108,0.0000075567064,0.000049051985,0.000083816754,0.000037647893],"domain_scores_gemma":[0.9984553,0.0009080115,0.00008261025,0.00017246854,0.00022104172,0.00016061983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044664033,0.00047794153,0.00037914322,0.0020242108,0.0013379483,0.0012416176,0.00096484815,0.00058719784,0.0098484745],"category_scores_gemma":[0.003223517,0.0002243188,0.00041560052,0.0014992066,0.0016166737,0.0023211662,0.0013075406,0.0019805094,0.0011049886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002920046,0.000012062562,0.00032508947,0.00014163574,0.000016557275,0.00029738236,0.00014736228,0.0017605809,0.0013899537,0.9316237,0.04141278,0.022843609],"study_design_scores_gemma":[0.000006984964,0.0000122850215,0.0003486743,0.000041270778,0.000014703176,0.00032459333,0.0000758797,0.0024001074,0.0006359889,0.9414033,0.054725595,0.000010553501],"about_ca_topic_score_codex":0.0016094821,"about_ca_topic_score_gemma":0.0030536375,"teacher_disagreement_score":0.0098484745,"about_ca_system_score_codex":0.00077463983,"about_ca_system_score_gemma":0.0004656867,"threshold_uncertainty_score":0.032946408},"labels":[],"label_agreement":null},{"id":"W101946736","doi":"","title":"On Exact n-Step Domination.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.021644334553096722,"score_gpt":0.2227675887907469,"score_spread":0.20112325423765018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W101946736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21312237,0.0019093922,0.6050969,0.002050268,0.00038266674,0.00017901926,0.00083703117,0.00047303175,0.17594936],"genre_scores_gemma":[0.92305243,0.00074102206,0.045637447,0.00061974814,0.0001767341,0.00023286139,0.0004920136,0.00016209559,0.028885689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976968,0.0009492731,0.00009505491,0.00032560513,0.00039080592,0.000542497],"domain_scores_gemma":[0.99161845,0.005767454,0.0005365765,0.0010195068,0.00050339947,0.0005546379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020912047,0.0005786402,0.001238191,0.0013234144,0.0014379224,0.0020891172,0.0018849972,0.0012968626,0.015935767],"category_scores_gemma":[0.014771938,0.00038362315,0.0008818254,0.0011357096,0.0024469844,0.004585825,0.002503081,0.002207542,0.0019073426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007180232,0.000050552644,0.0006545584,0.00007620544,0.000027640344,0.00008020823,0.00011842662,0.015954187,0.00042531837,0.96283305,0.004371547,0.015336525],"study_design_scores_gemma":[0.000017950571,0.000010477268,0.00016638504,0.00001205572,0.000005087615,0.000053965974,0.000025934703,0.037828557,0.0001658015,0.96027225,0.0014334173,0.0000080180835],"about_ca_topic_score_codex":0.0018121247,"about_ca_topic_score_gemma":0.0028285203,"teacher_disagreement_score":0.015935767,"about_ca_system_score_codex":0.0014595969,"about_ca_system_score_gemma":0.0010206482,"threshold_uncertainty_score":0.053310513},"labels":[],"label_agreement":null},{"id":"W102350756","doi":"","title":"Binomial Identities Generated by Counting Spanning Trees.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spanning tree; Binomial (polynomial); Combinatorics; Statistics","score_opus":0.015787305228591796,"score_gpt":0.27779793510411105,"score_spread":0.26201062987551926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W102350756","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30789167,0.0017367052,0.3223695,0.0027662471,0.0017510976,0.00013566599,0.0009619266,0.0006464922,0.36174068],"genre_scores_gemma":[0.8840978,0.0011082545,0.051629193,0.0007809158,0.0012069975,0.00018093942,0.00089428964,0.000324826,0.059776776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871445,0.00037921654,0.00006493949,0.00016893008,0.000442926,0.00022964217],"domain_scores_gemma":[0.9967931,0.0016629273,0.00037180653,0.00027753014,0.00051467255,0.00037999154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012165924,0.0004613342,0.0008040372,0.0026314787,0.0018212852,0.002581981,0.0010591368,0.0009792504,0.012380332],"category_scores_gemma":[0.008215332,0.0004484904,0.00069314754,0.001750291,0.0015278261,0.003788915,0.0022618251,0.00194643,0.0030060946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022641596,0.000016726357,0.00026687593,0.000029638379,0.0000049770865,0.00012989735,0.00013119711,0.00034021505,0.0006700634,0.9881054,0.0034033873,0.0068788873],"study_design_scores_gemma":[0.000013419257,0.000008801671,0.00032281032,0.000026399312,0.000013404727,0.00045146933,0.00006413672,0.008180111,0.000774285,0.98395663,0.006176259,0.0000122390375],"about_ca_topic_score_codex":0.0005400983,"about_ca_topic_score_gemma":0.00094464794,"teacher_disagreement_score":0.012380332,"about_ca_system_score_codex":0.0009081803,"about_ca_system_score_gemma":0.00057749584,"threshold_uncertainty_score":0.041416347},"labels":[],"label_agreement":null},{"id":"W102410762","doi":"","title":"Long Paths and Cycles Through Specified Vertices in k-Connected Graphs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Chordal graph; Graph","score_opus":0.024117532862543152,"score_gpt":0.2860400059407764,"score_spread":0.26192247307823324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W102410762","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6111865,0.0043696873,0.29534355,0.0021583107,0.0003398689,0.00020951488,0.001975355,0.0010133083,0.08340383],"genre_scores_gemma":[0.90541166,0.0022626093,0.060154036,0.00034834773,0.00013499614,0.0002488608,0.0013875153,0.00027624198,0.029775836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938846,0.00018113885,0.0000548312,0.00015328154,0.000105713385,0.00011658988],"domain_scores_gemma":[0.9955048,0.0024096936,0.0009630169,0.00041881943,0.00032151345,0.0003821746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046601106,0.00049178395,0.0003923104,0.0019211695,0.0017168868,0.0024038956,0.00093590864,0.0015707703,0.008180076],"category_scores_gemma":[0.0059678284,0.00062584964,0.0005299834,0.0021446296,0.0020702523,0.00514165,0.002029622,0.0011588886,0.0014928678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021506335,0.00003886256,0.0017461082,0.00030109566,0.0000306606,0.00066789845,0.00086197554,0.0076711257,0.0030358513,0.94746596,0.003937361,0.034028098],"study_design_scores_gemma":[0.000019559622,0.000028118484,0.00056832517,0.000086263164,0.000026082442,0.0004598296,0.0003639328,0.009102816,0.0017943194,0.97705746,0.010469577,0.00002365471],"about_ca_topic_score_codex":0.001168316,"about_ca_topic_score_gemma":0.0027477082,"teacher_disagreement_score":0.008180076,"about_ca_system_score_codex":0.0010108603,"about_ca_system_score_gemma":0.00056651543,"threshold_uncertainty_score":0.027365088},"labels":[],"label_agreement":null},{"id":"W102778813","doi":"","title":"On regular cayley maps with alternating power functions","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Differential Equations and Dynamical Systems","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.015813496468458782,"score_gpt":0.27424119799893215,"score_spread":0.25842770153047334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W102778813","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6166609,0.0023072022,0.20213653,0.0023754085,0.0010451573,0.000097746815,0.0003213969,0.0006246751,0.1744309],"genre_scores_gemma":[0.9086631,0.0018636348,0.025408998,0.0006757792,0.0011205032,0.00011615272,0.00031813176,0.00024358695,0.06159016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994667,0.00015859507,0.000027778491,0.00010442592,0.00014500911,0.00009755739],"domain_scores_gemma":[0.9982603,0.00076608965,0.00025479167,0.00016091469,0.00023921952,0.00031865394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094132626,0.0014442751,0.0010575379,0.003281526,0.0019832775,0.0033826625,0.0011885212,0.001558208,0.006918569],"category_scores_gemma":[0.0035654285,0.0006664606,0.00089194905,0.0020814836,0.003908271,0.0054409727,0.0021403723,0.0024526978,0.0010425434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011554573,0.000008634059,0.00006854798,0.000012273906,0.0000035454655,0.000059757942,0.00012592798,0.0005577973,0.00030953964,0.9966372,0.00037854566,0.0018265896],"study_design_scores_gemma":[0.000008260252,0.000009145628,0.00006941665,0.000004876436,0.0000041394574,0.00006524207,0.00004128216,0.003515963,0.0001568734,0.9947784,0.0013385629,0.000007866135],"about_ca_topic_score_codex":0.001411258,"about_ca_topic_score_gemma":0.001593199,"teacher_disagreement_score":0.006918569,"about_ca_system_score_codex":0.0014973874,"about_ca_system_score_gemma":0.00055507396,"threshold_uncertainty_score":0.02314496},"labels":[],"label_agreement":null},{"id":"W102783733","doi":"","title":"Orthogonal Labeling of Constant Weight Gray Codes by Partitions With Blocks Of Size At Most Two.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Gray (unit); Constant (computer programming); Combinatorics; Computer science","score_opus":0.0070732105087022365,"score_gpt":0.23245894963254163,"score_spread":0.22538573912383938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W102783733","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45241225,0.0006287971,0.44573063,0.00087823084,0.00035963187,0.00016094757,0.0011334021,0.0010874431,0.09760868],"genre_scores_gemma":[0.79673153,0.0007147005,0.15856665,0.00044674575,0.000179476,0.00023387175,0.0017884696,0.0004956758,0.040842783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948597,0.00011918358,0.000028184155,0.00008458162,0.000118213124,0.0001638193],"domain_scores_gemma":[0.99855894,0.00041712972,0.00019906627,0.00044835836,0.00019769276,0.00017883794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031688553,0.0003901956,0.00034087978,0.00096552685,0.00088127353,0.0013948393,0.00048655027,0.00043880643,0.007266409],"category_scores_gemma":[0.0022152185,0.00027084173,0.0003088217,0.0011846968,0.0010001904,0.0013078183,0.0015844739,0.0008035073,0.0016568122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012026224,0.00017443163,0.001485015,0.00020844105,0.000029283383,0.00027075666,0.00035957934,0.008430957,0.050042886,0.777688,0.01690095,0.14320704],"study_design_scores_gemma":[0.00018079844,0.00026530094,0.0017756061,0.00009388711,0.00006215592,0.0006235467,0.00034933895,0.060578983,0.045625083,0.8395114,0.050868955,0.00006493076],"about_ca_topic_score_codex":0.00091166334,"about_ca_topic_score_gemma":0.0016261643,"teacher_disagreement_score":0.007266409,"about_ca_system_score_codex":0.0006147572,"about_ca_system_score_gemma":0.00061911397,"threshold_uncertainty_score":0.024308562},"labels":[],"label_agreement":null},{"id":"W102867763","doi":"","title":"Note on Indices of Convergence of Digraphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Meromorphic and Entire Functions","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Convergence (economics); Applied mathematics; Economics","score_opus":0.02406705651621692,"score_gpt":0.2680168528814269,"score_spread":0.24394979636520997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W102867763","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04793716,0.0038974178,0.19531439,0.0043951767,0.0019348969,0.000086622495,0.00069150416,0.0006917139,0.74505115],"genre_scores_gemma":[0.76544315,0.0071762307,0.10919904,0.0030547385,0.0022276202,0.00035843087,0.00089258497,0.0009474426,0.11070073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988512,0.00032488973,0.00007799606,0.0002316598,0.00036234874,0.0001518758],"domain_scores_gemma":[0.99253696,0.004320325,0.00030916295,0.001046237,0.0011378394,0.00064944266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022560735,0.00095687946,0.0011064869,0.0033069928,0.0019330464,0.004028037,0.0014579188,0.0013268845,0.01519557],"category_scores_gemma":[0.011031322,0.00040992352,0.00086876744,0.0025560241,0.0034153587,0.009567209,0.003857732,0.0051762196,0.0025374528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015860878,0.000008913172,0.00018480953,0.000028084185,0.0000041646113,0.000047868718,0.0000996464,0.00018193043,0.00026182423,0.99204755,0.0029701027,0.0041493294],"study_design_scores_gemma":[0.00001159403,0.000029041952,0.000535383,0.000041180763,0.0000136552835,0.00026106817,0.00012112292,0.002476765,0.0007573135,0.96774685,0.027987242,0.000018698893],"about_ca_topic_score_codex":0.0014761301,"about_ca_topic_score_gemma":0.0020873593,"teacher_disagreement_score":0.01519557,"about_ca_system_score_codex":0.0018332002,"about_ca_system_score_gemma":0.0008230876,"threshold_uncertainty_score":0.050834298},"labels":[],"label_agreement":null},{"id":"W103001999","doi":"","title":"Large Neighbourhood Unions and Edge-disjoint Perfect Matchings.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Neighbourhood (mathematics); Mathematics; Disjoint sets; Enhanced Data Rates for GSM Evolution; Combinatorics; Computer science; Mathematical analysis; Telecommunications","score_opus":0.012501938988027766,"score_gpt":0.2048596264232903,"score_spread":0.19235768743526255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W103001999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26422736,0.0026547674,0.5784597,0.0028467607,0.00023758766,0.00019140381,0.0011488523,0.00057244976,0.14966114],"genre_scores_gemma":[0.93238455,0.0006703718,0.043261915,0.0003134786,0.00017492063,0.00016918921,0.0006508658,0.00009748612,0.022277107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966113,0.0016175624,0.00016996861,0.00064228976,0.0005248064,0.0004340433],"domain_scores_gemma":[0.98484796,0.00952672,0.0019614776,0.0017779687,0.00067190314,0.00121401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025364454,0.0003934741,0.001471619,0.0017325841,0.0024140498,0.0039003284,0.002144804,0.0019341065,0.014187537],"category_scores_gemma":[0.021233652,0.00075061043,0.0009953555,0.0018443844,0.0031267982,0.007561487,0.0031453585,0.0018789191,0.0017512727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006488354,0.000030440127,0.0005028352,0.000049657305,0.000020989004,0.00006168182,0.000091051385,0.006144533,0.00022075881,0.98321116,0.0023238969,0.007278139],"study_design_scores_gemma":[0.000019829955,0.0000072788757,0.0002403874,0.000014723112,0.000009050176,0.00007906146,0.000047161517,0.01568506,0.00013219436,0.98191595,0.0018436135,0.0000057767106],"about_ca_topic_score_codex":0.0013970667,"about_ca_topic_score_gemma":0.0019289466,"teacher_disagreement_score":0.014187537,"about_ca_system_score_codex":0.0015341004,"about_ca_system_score_gemma":0.00084039674,"threshold_uncertainty_score":0.047462046},"labels":[],"label_agreement":null},{"id":"W103588595","doi":"","title":"Minimum length of cycles through specified vertices in graphs with wide-diameter at most d.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.02281584283864667,"score_gpt":0.2748316275715963,"score_spread":0.2520157847329496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W103588595","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9293687,0.0022340566,0.04310315,0.0017988783,0.0001332407,0.00011811207,0.0056029228,0.00051963265,0.017121231],"genre_scores_gemma":[0.9547111,0.0013911026,0.03242988,0.0002953037,0.000121004035,0.00019266333,0.004640831,0.0002940666,0.0059241713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992673,0.00018140954,0.00008245664,0.00021286045,0.00009394598,0.00016204786],"domain_scores_gemma":[0.99130744,0.004687497,0.0014991185,0.00072529877,0.0006714103,0.0011091696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007438308,0.0007078747,0.0008020194,0.0013647713,0.0013135818,0.0022926736,0.0013230087,0.0016406548,0.0039142417],"category_scores_gemma":[0.0091705015,0.0007285512,0.00050441886,0.0012114974,0.00096403586,0.0031124908,0.0015237463,0.0009626114,0.0010453006],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.010039216,0.0006604282,0.064108945,0.004920964,0.0006874908,0.0025398042,0.004616654,0.09827479,0.12193495,0.4172278,0.052636176,0.22235282],"study_design_scores_gemma":[0.000576157,0.0008532949,0.018705808,0.00060898456,0.0004629035,0.0036539652,0.0023437554,0.13014323,0.05832276,0.74555683,0.03860539,0.00016695244],"about_ca_topic_score_codex":0.0006708899,"about_ca_topic_score_gemma":0.001447271,"teacher_disagreement_score":0.0039142417,"about_ca_system_score_codex":0.0009498676,"about_ca_system_score_gemma":0.00060505676,"threshold_uncertainty_score":0.013094425},"labels":[],"label_agreement":null},{"id":"W103622900","doi":"","title":"On the Cordiality of the t-Uniform Homeomorphs - II (Complete Graphs).","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.03871894088679963,"score_gpt":0.25443287817724003,"score_spread":0.21571393729044042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W103622900","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42601165,0.004273788,0.10476994,0.0049697114,0.00076002144,0.00010830961,0.0006893352,0.00045871193,0.45795843],"genre_scores_gemma":[0.95803183,0.0013293711,0.011663976,0.0007101375,0.00040784138,0.00006048508,0.0002971782,0.00012218929,0.02737696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995332,0.00013510828,0.000026876703,0.00012748997,0.00007294776,0.00010437014],"domain_scores_gemma":[0.99843377,0.0006477576,0.00023258397,0.00023017392,0.00016061084,0.00029514838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000835308,0.00037137466,0.0004997386,0.001346994,0.0019484338,0.002964889,0.0006890636,0.00093855005,0.010553377],"category_scores_gemma":[0.0035226704,0.0004005162,0.0004920958,0.0009837511,0.004655711,0.0064986357,0.002827091,0.0020187737,0.0012469353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017109047,0.000006244169,0.00014106448,0.00001887969,0.000002102508,0.000030444291,0.00012639294,0.00013765278,0.00014566955,0.9954058,0.0011501637,0.0028184445],"study_design_scores_gemma":[0.000008627548,0.000010143016,0.0002579059,0.000013238098,0.0000053749022,0.00011330562,0.00010616199,0.0006846579,0.00019697426,0.99493825,0.0036596141,0.0000056552353],"about_ca_topic_score_codex":0.0010364619,"about_ca_topic_score_gemma":0.0012074923,"teacher_disagreement_score":0.010553377,"about_ca_system_score_codex":0.00087253057,"about_ca_system_score_gemma":0.00040462668,"threshold_uncertainty_score":0.035304606},"labels":[],"label_agreement":null},{"id":"W10372522","doi":"10.1016/s0730-725x(98)00221-5","title":"The Niche Category of Sparse Graphs.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Niche; Ecology; Biology","score_opus":0.01386635973582632,"score_gpt":0.22059377484711803,"score_spread":0.20672741511129172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W10372522","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0779937,0.008613197,0.82887715,0.009507002,0.0011938642,0.00032822794,0.0047219614,0.0012681974,0.06749676],"genre_scores_gemma":[0.49919948,0.010441409,0.40557158,0.003565454,0.0035476303,0.0010116769,0.01077342,0.00079855527,0.06509079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984865,0.00048233088,0.00009127669,0.00048046146,0.00032153522,0.00013785157],"domain_scores_gemma":[0.9950046,0.0024706377,0.00065513724,0.0011500143,0.00044113383,0.00027854912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011003331,0.0010401,0.0011330373,0.0024882487,0.0016985122,0.00299098,0.0016356612,0.0014648066,0.011236754],"category_scores_gemma":[0.005851675,0.00047673506,0.0012171181,0.0030286224,0.0020008686,0.004637206,0.00264752,0.001725386,0.0021584253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000766917,0.000047379694,0.0009104156,0.00045771067,0.00007680105,0.00017765752,0.00022538818,0.010395202,0.0009018967,0.8933327,0.020124426,0.07327369],"study_design_scores_gemma":[0.000020082294,0.00003118661,0.00037376443,0.000053273438,0.000018874982,0.00030248426,0.00008322761,0.022787523,0.00029032893,0.9281508,0.047874626,0.000013870037],"about_ca_topic_score_codex":0.0011344256,"about_ca_topic_score_gemma":0.001394012,"teacher_disagreement_score":0.011236754,"about_ca_system_score_codex":0.0014031068,"about_ca_system_score_gemma":0.00086249155,"threshold_uncertainty_score":0.037590683},"labels":[],"label_agreement":null},{"id":"W104414370","doi":"","title":"Stability Number and Fractional F-factors in Graphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Stability (learning theory); Combinatorics; Computer science; Machine learning","score_opus":0.016190147693617225,"score_gpt":0.2772819295661864,"score_spread":0.2610917818725692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W104414370","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.669935,0.003149155,0.12329006,0.00353573,0.00061602006,0.000060400984,0.0005804066,0.00042188924,0.19841127],"genre_scores_gemma":[0.9776145,0.00063551846,0.0076189744,0.00013227752,0.0002831771,0.00003131743,0.00013498451,0.000048420345,0.0135008665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996474,0.00006966573,0.000013821474,0.00009546181,0.00008882435,0.000084933024],"domain_scores_gemma":[0.99835193,0.00081873033,0.000212066,0.00012717512,0.00022133606,0.00026879334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053504563,0.00039680058,0.00041987238,0.0027111357,0.0019288228,0.002142606,0.00054083654,0.000875408,0.009007518],"category_scores_gemma":[0.0039893026,0.00023449147,0.0003945442,0.001182656,0.0023593768,0.0032406638,0.00078895653,0.0010327057,0.00094455294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009237322,0.000016424872,0.0007683724,0.00004054161,0.000008422899,0.00006180644,0.00019326275,0.0014648199,0.0017083916,0.98075414,0.0025999295,0.0122915255],"study_design_scores_gemma":[0.000011343176,0.000018742621,0.0005289305,0.000016787242,0.000008305495,0.00013193063,0.00011929367,0.0050432654,0.0013410241,0.9881593,0.0046087573,0.000012368073],"about_ca_topic_score_codex":0.0015747561,"about_ca_topic_score_gemma":0.0016051955,"teacher_disagreement_score":0.009007518,"about_ca_system_score_codex":0.0011987215,"about_ca_system_score_gemma":0.00041854143,"threshold_uncertainty_score":0.030133128},"labels":[],"label_agreement":null},{"id":"W10447511","doi":"","title":"Extremal properties of (1, f)-odd factors in graphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Mathematics; Combinatorics; Graph; Integer (computer science); Simple graph; Order (exchange); Discrete mathematics","score_opus":0.047090532514100086,"score_gpt":0.28114710867510534,"score_spread":0.23405657616100525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W10447511","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88889056,0.0011411234,0.07369677,0.000666052,0.00011010614,0.00006692902,0.00066546316,0.00028356953,0.034479383],"genre_scores_gemma":[0.98219436,0.00047929373,0.012952414,0.00007800526,0.00009811587,0.00004741507,0.00038021003,0.00008533369,0.0036848376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996061,0.00008765438,0.000021947037,0.0001030334,0.0000820645,0.000099207755],"domain_scores_gemma":[0.9976185,0.0012538297,0.0005446193,0.00017179825,0.00012736743,0.00028382905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005942514,0.00036439495,0.00045768375,0.0024566865,0.0011591988,0.0016149646,0.0004974877,0.00058871874,0.0052160616],"category_scores_gemma":[0.004410145,0.00037429074,0.0004699832,0.0010021696,0.0016390559,0.0019041316,0.00080153154,0.0005947718,0.000385677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042625645,0.000078925535,0.011287383,0.0003664433,0.000051662002,0.0009398005,0.00089641556,0.015063628,0.016015235,0.9146501,0.0051073027,0.03511698],"study_design_scores_gemma":[0.000039737915,0.00008231078,0.007224157,0.00005876195,0.00004047653,0.0012671428,0.00045572722,0.023427418,0.0033187352,0.95599365,0.008049458,0.000042426604],"about_ca_topic_score_codex":0.000758404,"about_ca_topic_score_gemma":0.0014441155,"teacher_disagreement_score":0.0052160616,"about_ca_system_score_codex":0.0006012795,"about_ca_system_score_gemma":0.00026281,"threshold_uncertainty_score":0.017449439},"labels":[],"label_agreement":null},{"id":"W104746231","doi":"","title":"A Note On The (g, f)-Chromatic Index Of Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Chromatic scale; Edge coloring; Combinatorics; Graph; Computer science; Line graph","score_opus":0.01608614467246147,"score_gpt":0.22223223616757776,"score_spread":0.20614609149511628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W104746231","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102684386,0.036188833,0.24743663,0.02737351,0.012189393,0.00014066098,0.0030770379,0.0014993997,0.56941015],"genre_scores_gemma":[0.77670276,0.018001271,0.14843448,0.005380021,0.007965686,0.00022049184,0.0013006062,0.00095599354,0.041038655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880946,0.00029603083,0.000060996736,0.00038794984,0.00028345443,0.00016214408],"domain_scores_gemma":[0.9939865,0.004124753,0.00031006004,0.00078967644,0.00036729634,0.0004215875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015176941,0.00078069547,0.0011450688,0.0036941445,0.0025841023,0.004126509,0.0022328014,0.0021406442,0.009888815],"category_scores_gemma":[0.009152677,0.0006318806,0.00083660876,0.004921551,0.0045878906,0.0077998303,0.0029776942,0.0064978143,0.0016233973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017446621,0.000044804452,0.0015589606,0.00020142489,0.000031279353,0.00014274365,0.00022258842,0.0029421628,0.0021669595,0.9072086,0.048019025,0.037287034],"study_design_scores_gemma":[0.000021579644,0.000038252852,0.001696393,0.00007649816,0.00003432733,0.00026373286,0.0001349281,0.0071402085,0.0012381545,0.94911975,0.040190898,0.000045375084],"about_ca_topic_score_codex":0.003829823,"about_ca_topic_score_gemma":0.005085839,"teacher_disagreement_score":0.009888815,"about_ca_system_score_codex":0.0029019422,"about_ca_system_score_gemma":0.00093017286,"threshold_uncertainty_score":0.033081412},"labels":[],"label_agreement":null},{"id":"W10487482","doi":"10.1016/s0021-9150(99)00121-5","title":"A Result of Erdos-Sos Cojecture.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematics and Applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.02856541279291415,"score_gpt":0.3004292659804332,"score_spread":0.27186385318751904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W10487482","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17959677,0.033343423,0.015019444,0.06442152,0.031686198,0.0014819463,0.015470657,0.0058586244,0.6531214],"genre_scores_gemma":[0.15767506,0.009653508,0.008798194,0.012755519,0.004026054,0.00051428325,0.011604466,0.0010786164,0.7938943],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99717724,0.00047356918,0.00030808212,0.00048180867,0.0011812991,0.00037788178],"domain_scores_gemma":[0.9955819,0.00051503937,0.0004993871,0.0011439968,0.0010887731,0.0011708701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025844872,0.00073611696,0.0005816888,0.001384314,0.000987378,0.002433603,0.0007673677,0.0017431041,0.09503384],"category_scores_gemma":[0.0054117898,0.00036433298,0.00088280695,0.001535233,0.0009089408,0.00080266583,0.0030281474,0.0021847372,0.0616838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019576282,0.00081896654,0.037879575,0.000682178,0.00016116537,0.004379778,0.0004947342,0.00036370772,0.008956082,0.022836477,0.35301858,0.56845117],"study_design_scores_gemma":[0.00008611253,0.00020612885,0.0069754943,0.000093731265,0.000027766715,0.0027088898,0.000101134465,0.00020452747,0.0022781226,0.0010258432,0.98628104,0.000011175125],"about_ca_topic_score_codex":0.0019656809,"about_ca_topic_score_gemma":0.002628617,"teacher_disagreement_score":0.09503384,"about_ca_system_score_codex":0.0013693188,"about_ca_system_score_gemma":0.0026726616,"threshold_uncertainty_score":0.31791985},"labels":[],"label_agreement":null},{"id":"W105452184","doi":"","title":"New graceful familes of bipartite graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Combinatorics; Graph","score_opus":0.011201572934480446,"score_gpt":0.2220134832688985,"score_spread":0.21081191033441804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W105452184","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38765693,0.0018138606,0.3215254,0.0038148616,0.00054397323,0.00017536659,0.0018785277,0.002285319,0.2803058],"genre_scores_gemma":[0.88951135,0.00093927677,0.054517988,0.0008660222,0.00045561107,0.0002183154,0.0013671116,0.00061723916,0.051507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919385,0.00022434139,0.000038134378,0.00020500968,0.00018112481,0.00015755031],"domain_scores_gemma":[0.99744546,0.0009957311,0.00031020748,0.0005431893,0.00021369205,0.0004916858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084642577,0.0005500396,0.0005392352,0.0021451274,0.0024794375,0.0026817648,0.0009786917,0.0010016542,0.01278285],"category_scores_gemma":[0.0033977572,0.0006046128,0.00088167086,0.0010748294,0.002205454,0.0042381505,0.0025936486,0.0020907004,0.0018221489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022971164,0.000014288266,0.00028179976,0.000021896652,0.000005063319,0.00006301087,0.00019487001,0.0009672357,0.0009472539,0.9882138,0.0039466014,0.0053212144],"study_design_scores_gemma":[0.000011698382,0.000013484365,0.00031838054,0.000017180297,0.000009882869,0.00022320666,0.00015525984,0.007585039,0.0008232116,0.97619814,0.014629535,0.000015000806],"about_ca_topic_score_codex":0.00085621147,"about_ca_topic_score_gemma":0.0014432672,"teacher_disagreement_score":0.01278285,"about_ca_system_score_codex":0.0011649416,"about_ca_system_score_gemma":0.00035961662,"threshold_uncertainty_score":0.042762876},"labels":[],"label_agreement":null},{"id":"W105752137","doi":"","title":"Second Order Randic Index of Benzenoid Systems.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Order (exchange); Topological index; Combinatorics; Computer science; Business; World Wide Web","score_opus":0.016136095966339675,"score_gpt":0.2634067333482611,"score_spread":0.24727063738192143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W105752137","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44826585,0.0028957808,0.050288565,0.0020093478,0.00084561965,0.00007298305,0.0008983951,0.0003957844,0.4943276],"genre_scores_gemma":[0.944737,0.0006898484,0.009278744,0.0002914649,0.0002968985,0.00005588777,0.0003296729,0.00008773132,0.044232722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955076,0.00008183965,0.00001800335,0.00007306671,0.00016664206,0.000109608736],"domain_scores_gemma":[0.9991505,0.00026259615,0.00013444986,0.00012521197,0.00014961322,0.0001775495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003777301,0.00035824007,0.00055469957,0.0028104805,0.0015226868,0.002311003,0.00061955367,0.00086254324,0.014773437],"category_scores_gemma":[0.0017835118,0.00023074816,0.00027561237,0.0009060787,0.0015851626,0.0022826295,0.0013263797,0.0013032798,0.0019707736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029935529,0.000010611755,0.00028797903,0.000027602346,0.0000038875996,0.000035361285,0.00009984392,0.00051215506,0.00080521917,0.9898857,0.0023774193,0.0059241895],"study_design_scores_gemma":[0.000012267205,0.000021092186,0.00073665,0.000018396353,0.0000060148395,0.00015476714,0.00010667619,0.004236244,0.00096495176,0.98458415,0.0091413045,0.000017386465],"about_ca_topic_score_codex":0.0011999159,"about_ca_topic_score_gemma":0.0020454368,"teacher_disagreement_score":0.014773437,"about_ca_system_score_codex":0.0011646143,"about_ca_system_score_gemma":0.0004337109,"threshold_uncertainty_score":0.049422026},"labels":[],"label_agreement":null},{"id":"W105843398","doi":"","title":"A Note of k-Rotation Graphs.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Rotation (mathematics); Combinatorics; Pure mathematics; Geometry","score_opus":0.01264707814507132,"score_gpt":0.2822236817423465,"score_spread":0.2695766035972752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W105843398","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035138115,0.035227142,0.10386139,0.02517078,0.02256744,0.00009003911,0.0007470384,0.0010240059,0.776174],"genre_scores_gemma":[0.63682306,0.048888963,0.10310424,0.011263589,0.014457371,0.00013253809,0.0010472758,0.0010643415,0.18321857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996679,0.00010415151,0.000012954136,0.00008593324,0.00006935493,0.000059677455],"domain_scores_gemma":[0.99898666,0.00047488682,0.00007285053,0.00021732003,0.00012868285,0.00011950637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043687064,0.0006305742,0.000533482,0.0012693355,0.002339035,0.0015499399,0.0010623888,0.00082181056,0.014661161],"category_scores_gemma":[0.0023306978,0.00037599393,0.0005913884,0.0018176525,0.0026119517,0.003864219,0.001991991,0.0027765566,0.004253672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005202054,0.000015923044,0.0002258482,0.00016802046,0.000014251833,0.0004446534,0.00019870038,0.0010805697,0.0010292344,0.8857808,0.07258566,0.038404293],"study_design_scores_gemma":[0.000008325822,0.000021952026,0.00045514712,0.00004495166,0.000012721116,0.00059460395,0.00015150006,0.0010681895,0.000540432,0.8034668,0.19361544,0.000019914902],"about_ca_topic_score_codex":0.0024592937,"about_ca_topic_score_gemma":0.004022627,"teacher_disagreement_score":0.014661161,"about_ca_system_score_codex":0.0008322206,"about_ca_system_score_gemma":0.0005236916,"threshold_uncertainty_score":0.049046457},"labels":[],"label_agreement":null},{"id":"W105849606","doi":"","title":"On the Toughness of the Total Graph of a Graph.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Toughness; Combinatorics; Composite material; Materials science","score_opus":0.011762932816759815,"score_gpt":0.21359655811035977,"score_spread":0.20183362529359997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W105849606","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47869724,0.0058803037,0.33343887,0.017873304,0.0009894016,0.00017230706,0.003100118,0.00058884156,0.15925963],"genre_scores_gemma":[0.92691076,0.0024453434,0.046719905,0.001239202,0.0011591915,0.00024558918,0.001425827,0.00033760717,0.019516636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980446,0.0007450891,0.00009934804,0.0004067924,0.00035146292,0.00035265536],"domain_scores_gemma":[0.974876,0.019122735,0.0014962464,0.0015323207,0.0009297404,0.0020429646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025838038,0.0009610833,0.0012580077,0.0035774016,0.0029057097,0.003865131,0.0024153844,0.0022198183,0.0126507],"category_scores_gemma":[0.01851595,0.001064629,0.0011716416,0.0026880878,0.0066082836,0.013021562,0.003813778,0.004515058,0.0011035947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010271401,0.000040786308,0.0013062233,0.00016581177,0.00003497712,0.00007815061,0.0003603234,0.007208713,0.0007831908,0.9704785,0.010039193,0.009401364],"study_design_scores_gemma":[0.000016213167,0.000022156924,0.0009780808,0.000047046975,0.000020007323,0.0001283292,0.00022710598,0.016344873,0.00030687638,0.97833705,0.0035523302,0.000020003221],"about_ca_topic_score_codex":0.0029998815,"about_ca_topic_score_gemma":0.0030389645,"teacher_disagreement_score":0.0126507,"about_ca_system_score_codex":0.0023689633,"about_ca_system_score_gemma":0.0007382797,"threshold_uncertainty_score":0.042320788},"labels":[],"label_agreement":null},{"id":"W106656638","doi":"","title":"3-flow Conjecture and Matchings in Bipartite Graphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Conjecture; Combinatorics; Strong perfect graph theorem; Flow (mathematics); Chordal graph; 1-planar graph; Graph; Geometry","score_opus":0.00948066044355914,"score_gpt":0.2595878085495363,"score_spread":0.2501071481059771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W106656638","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2842198,0.00698632,0.2712693,0.062097706,0.0032925121,0.00030112316,0.0038000213,0.0016998012,0.36633345],"genre_scores_gemma":[0.89167434,0.0044508753,0.046312265,0.00746501,0.0031847213,0.0003631465,0.0038022997,0.0004098403,0.04233752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99779403,0.00072431966,0.000110378955,0.00047884378,0.00047509014,0.00041735315],"domain_scores_gemma":[0.9879538,0.007989678,0.000975091,0.0015112762,0.00077362073,0.000796572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003135581,0.00088347634,0.0015007171,0.0024305265,0.0038071736,0.0046211323,0.0025668056,0.005145547,0.026242359],"category_scores_gemma":[0.01890561,0.0010382803,0.0018894459,0.0033965993,0.0054595335,0.019497205,0.0041539,0.005881205,0.0033725407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011919163,0.00006990035,0.00070315116,0.00015066686,0.00001816794,0.00010862534,0.00027156167,0.0015817237,0.00027503172,0.97023726,0.015899092,0.010565777],"study_design_scores_gemma":[0.000020639214,0.000007155081,0.0001566243,0.000029968023,0.000007958916,0.00006694916,0.00006846423,0.002386809,0.00013029788,0.99322623,0.0038920857,0.000006923979],"about_ca_topic_score_codex":0.002480688,"about_ca_topic_score_gemma":0.0019715785,"teacher_disagreement_score":0.026242359,"about_ca_system_score_codex":0.0020255868,"about_ca_system_score_gemma":0.0012474325,"threshold_uncertainty_score":0.08778942},"labels":[],"label_agreement":null},{"id":"W107184215","doi":"","title":"Hex-triangles with One Interior H-point.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematics and Applications","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Point (geometry); Geometry; Combinatorics","score_opus":0.031137491032237608,"score_gpt":0.2799784013323978,"score_spread":0.2488409103001602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W107184215","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11578095,0.001346647,0.2480284,0.0012731219,0.0018732108,0.0002525581,0.0051954836,0.0013735902,0.6248761],"genre_scores_gemma":[0.70354,0.0009512718,0.09811497,0.0007816837,0.00021486517,0.00014915843,0.004621101,0.00066563813,0.19096132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995654,0.00007325218,0.000020803513,0.00009408798,0.00013078231,0.00011557358],"domain_scores_gemma":[0.999453,0.00011185102,0.000060105467,0.0001557246,0.00012451457,0.00009486392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001867108,0.00054873497,0.0007204709,0.00063509593,0.0009837713,0.0014641414,0.0010156576,0.0008982829,0.059349645],"category_scores_gemma":[0.0011762314,0.00037729947,0.0004448415,0.00078300474,0.001127327,0.0016793198,0.0027104176,0.0019794852,0.01386417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010726133,0.00014688252,0.002016643,0.00069070095,0.00009799559,0.0026722616,0.000775993,0.0051777875,0.02117795,0.7345371,0.054105766,0.17752829],"study_design_scores_gemma":[0.00018850435,0.0001731926,0.0026444118,0.0001916126,0.00007327271,0.0034463557,0.0019947994,0.014213392,0.030796152,0.7252689,0.22094877,0.000060639228],"about_ca_topic_score_codex":0.00090824295,"about_ca_topic_score_gemma":0.0017280829,"teacher_disagreement_score":0.059349645,"about_ca_system_score_codex":0.00040246375,"about_ca_system_score_gemma":0.00033609493,"threshold_uncertainty_score":0.19854432},"labels":[],"label_agreement":null},{"id":"W107196105","doi":"","title":"On the Hall Number of a Graph.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.010567169687734653,"score_gpt":0.22593127934978857,"score_spread":0.2153641096620539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W107196105","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42425042,0.009202345,0.16373785,0.023050014,0.0027855595,0.0001553735,0.0039386344,0.0009523868,0.37192738],"genre_scores_gemma":[0.9299316,0.003136683,0.030926717,0.0013923341,0.0015701725,0.00018744399,0.0013317305,0.00027867404,0.031244667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986993,0.00042388382,0.000055703622,0.00028402903,0.00018747301,0.00034953462],"domain_scores_gemma":[0.99243176,0.0052350243,0.000612462,0.00059470924,0.00030459856,0.00082140113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013409646,0.00071830215,0.0011338515,0.002957419,0.0027862221,0.0036134922,0.0016487703,0.00201186,0.01660736],"category_scores_gemma":[0.008595719,0.00054943963,0.00057723635,0.0027151417,0.004941571,0.011617779,0.003235505,0.0035889307,0.0021581233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016292234,0.000048730697,0.0009211739,0.00015591338,0.000016342256,0.00006667141,0.0002274293,0.0040381546,0.000694838,0.9595092,0.018224364,0.015934227],"study_design_scores_gemma":[0.00002408951,0.000019825737,0.00050794746,0.000039683342,0.000014349346,0.000102949416,0.000198433,0.006266859,0.00051216845,0.9852232,0.0070711304,0.000019334493],"about_ca_topic_score_codex":0.0013153196,"about_ca_topic_score_gemma":0.0018526369,"teacher_disagreement_score":0.01660736,"about_ca_system_score_codex":0.00226855,"about_ca_system_score_gemma":0.0008066926,"threshold_uncertainty_score":0.05555719},"labels":[],"label_agreement":null},{"id":"W107313290","doi":"","title":"Classification Of Large Sets By Trades.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.017176328003992672,"score_gpt":0.2803211263112628,"score_spread":0.26314479830727017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W107313290","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5643894,0.008794455,0.34776688,0.005996216,0.000974949,0.00066807546,0.020631935,0.0031978993,0.04758018],"genre_scores_gemma":[0.8972444,0.0013514947,0.07620106,0.00035962436,0.00066609686,0.00031709118,0.01193408,0.00027189424,0.011654247],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997017,0.000542804,0.0003649215,0.0007002006,0.0010099472,0.00036521393],"domain_scores_gemma":[0.9826857,0.00953674,0.0018545097,0.0034497841,0.0014239429,0.001049378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035318078,0.0007015222,0.00171932,0.007864207,0.0016717806,0.0048420127,0.0021217403,0.0015039522,0.012307966],"category_scores_gemma":[0.02642146,0.00047918392,0.0020157374,0.008553938,0.002079092,0.007115774,0.0024109855,0.0021244728,0.0026720667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015961869,0.00083412376,0.15300989,0.001024019,0.00052493333,0.001085893,0.00050456164,0.04389684,0.0037262472,0.24774618,0.052720807,0.49333042],"study_design_scores_gemma":[0.00011839896,0.00030624002,0.025730666,0.0003323082,0.00018686411,0.0020083769,0.001017288,0.322484,0.003561845,0.6141486,0.030031927,0.00007351867],"about_ca_topic_score_codex":0.0014127817,"about_ca_topic_score_gemma":0.0017506492,"teacher_disagreement_score":0.012307966,"about_ca_system_score_codex":0.0015277555,"about_ca_system_score_gemma":0.0012560814,"threshold_uncertainty_score":0.041174293},"labels":[],"label_agreement":null},{"id":"W107410047","doi":"","title":"Pseudograceful Labelings of Cycles.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.010473612151783517,"score_gpt":0.23155276643571143,"score_spread":0.2210791542839279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W107410047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2788484,0.0027995599,0.4458373,0.0052920347,0.0006266498,0.00015991698,0.002558984,0.0013978916,0.2624793],"genre_scores_gemma":[0.8648225,0.0012639854,0.08631292,0.0011745325,0.0003949762,0.00018763954,0.0019497577,0.00046780397,0.043425858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882287,0.00039613174,0.00006636609,0.0002789032,0.00023542941,0.00020041055],"domain_scores_gemma":[0.9957943,0.0022438457,0.0003564406,0.0008655938,0.00037991517,0.0003599655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008204913,0.0004913032,0.00047918918,0.0014906909,0.0018909439,0.0033343819,0.0012562757,0.0011955479,0.014360114],"category_scores_gemma":[0.005049401,0.00054503116,0.0007253243,0.0018393978,0.0020969743,0.006499538,0.0023005446,0.0020521786,0.0016821448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035375066,0.000014895311,0.00020220786,0.000044880624,0.000004332873,0.0000296027,0.00011808557,0.0007411365,0.00054597633,0.98354095,0.0033911308,0.011331448],"study_design_scores_gemma":[0.000010377105,0.0000073651177,0.00013545886,0.000019844196,0.000005605646,0.0000823662,0.00009106054,0.0038235846,0.00073572417,0.98574096,0.009340085,0.00000761299],"about_ca_topic_score_codex":0.0011401073,"about_ca_topic_score_gemma":0.0019363093,"teacher_disagreement_score":0.014360114,"about_ca_system_score_codex":0.0014384792,"about_ca_system_score_gemma":0.0006116101,"threshold_uncertainty_score":0.048039317},"labels":[],"label_agreement":null},{"id":"W107778359","doi":"","title":"Note on Coloring the Square of an Outerplanar Graph.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Square (algebra); Combinatorics; Edge coloring; Graph coloring; Outerplanar graph; List coloring; Graph; Discrete mathematics; Pathwidth; Geometry; Graph power; Line graph","score_opus":0.018318325334799893,"score_gpt":0.2392375142984838,"score_spread":0.2209191889636839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W107778359","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017570995,0.028006718,0.19078687,0.06608372,0.091939785,0.00022465747,0.0016154672,0.0023283013,0.60144347],"genre_scores_gemma":[0.3453555,0.05441196,0.21283397,0.041407276,0.055391252,0.0003881971,0.0018200272,0.0014421334,0.28694966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995254,0.000095307536,0.000015821422,0.0001313097,0.00016605086,0.000065986],"domain_scores_gemma":[0.99829966,0.0011372106,0.00005566742,0.00018343265,0.00014284728,0.00018127813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006804415,0.0012357861,0.0008481168,0.0012173326,0.0020411324,0.0015292539,0.001893152,0.0014155748,0.015997935],"category_scores_gemma":[0.0024212408,0.00047266402,0.00078480167,0.0013607551,0.003007853,0.003275524,0.0024646607,0.0039528157,0.0037860095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031701237,0.00011979367,0.000740667,0.00074595737,0.000080163474,0.0014858155,0.000463517,0.0045663905,0.0067888815,0.4895177,0.41881078,0.07636325],"study_design_scores_gemma":[0.000028141692,0.000103797734,0.0013451173,0.000104557075,0.000053099346,0.0007713847,0.00026300538,0.0035408968,0.0030988283,0.5412352,0.44939265,0.00006323746],"about_ca_topic_score_codex":0.0075203907,"about_ca_topic_score_gemma":0.01607601,"teacher_disagreement_score":0.015997935,"about_ca_system_score_codex":0.0013629593,"about_ca_system_score_gemma":0.0008286013,"threshold_uncertainty_score":0.053518474},"labels":[],"label_agreement":null},{"id":"W107924583","doi":"","title":"New Classes of Graceful Graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.011244903636052746,"score_gpt":0.2271952440663401,"score_spread":0.21595034043028735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W107924583","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31915635,0.0038044555,0.28359085,0.009199823,0.0011390342,0.00024043956,0.0029656382,0.0034718078,0.37643164],"genre_scores_gemma":[0.8842908,0.002158034,0.04861961,0.0017814838,0.0011915152,0.0002798705,0.0022301169,0.00078725215,0.05866142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897766,0.0001858072,0.00005028566,0.00029551284,0.00028260786,0.00020821313],"domain_scores_gemma":[0.996197,0.0014383983,0.0004921898,0.00090037554,0.00024676337,0.0007252212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084154506,0.000797273,0.00062693015,0.0026979719,0.002130114,0.004851311,0.0015568867,0.0013588708,0.015976984],"category_scores_gemma":[0.0041089985,0.00060155237,0.0011097853,0.0017846691,0.0033182479,0.007619237,0.0033776928,0.0032284646,0.001589387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002600839,0.000018128303,0.00030835974,0.00003587977,0.000005197235,0.000049412567,0.00014096481,0.00073900085,0.00047461383,0.9848809,0.005958833,0.007362662],"study_design_scores_gemma":[0.000015371872,0.000010203883,0.00027863588,0.000019132645,0.000010242266,0.00018128382,0.0000948805,0.0039096577,0.00046388808,0.977238,0.017765833,0.000012816945],"about_ca_topic_score_codex":0.0011156459,"about_ca_topic_score_gemma":0.0020021715,"teacher_disagreement_score":0.015976984,"about_ca_system_score_codex":0.0020499767,"about_ca_system_score_gemma":0.0006868872,"threshold_uncertainty_score":0.05344838},"labels":[],"label_agreement":null},{"id":"W108063708","doi":"","title":"Subsquags and Normal Subsquags.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.010845959186554335,"score_gpt":0.22056343495027286,"score_spread":0.20971747576371852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W108063708","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050532077,0.0039876243,0.71234566,0.0025304975,0.0013207918,0.0003748265,0.0017752649,0.0030290438,0.2241042],"genre_scores_gemma":[0.50676924,0.00254518,0.36742815,0.0013288194,0.00046119615,0.000401861,0.003571539,0.0013346057,0.11615948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980488,0.0005305682,0.00023636597,0.00044145336,0.0004753044,0.00026742043],"domain_scores_gemma":[0.9973085,0.0011199893,0.00023020392,0.00055123173,0.0005591595,0.00023101324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012442542,0.00066731416,0.0006228571,0.0018263637,0.00225231,0.0045898203,0.0017263654,0.0012866479,0.01916389],"category_scores_gemma":[0.005262727,0.00063432223,0.0011502162,0.0019754404,0.0054999474,0.00760316,0.0029313834,0.0028043801,0.0051490483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003784569,0.000023805394,0.00031109367,0.0000741177,0.0000092449545,0.00017752954,0.00042163767,0.00077853404,0.00054533896,0.97074115,0.0047593247,0.022120384],"study_design_scores_gemma":[0.000006721913,0.000014686012,0.00018977791,0.000049606155,0.000013851643,0.00026331827,0.00029774342,0.0035795628,0.0008773221,0.9350089,0.05968492,0.000013663918],"about_ca_topic_score_codex":0.0059812316,"about_ca_topic_score_gemma":0.008030919,"teacher_disagreement_score":0.01916389,"about_ca_system_score_codex":0.0014638549,"about_ca_system_score_gemma":0.0012099255,"threshold_uncertainty_score":0.064109564},"labels":[],"label_agreement":null},{"id":"W108252396","doi":"","title":"A Sufficient Condition for Oriented Graphs to be Hamiltonian.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hamiltonian (control theory); Combinatorics; Mathematical optimization","score_opus":0.016509603998387756,"score_gpt":0.292884276763912,"score_spread":0.27637467276552424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W108252396","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46353287,0.0019231021,0.25347614,0.015294475,0.00493163,0.00081141124,0.013943014,0.0035819723,0.24250543],"genre_scores_gemma":[0.92334694,0.0008382673,0.0473525,0.002564346,0.0011919772,0.0005783515,0.008082408,0.0005002717,0.015544914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998314,0.0002785331,0.00017917679,0.00050971936,0.0002808826,0.0004376616],"domain_scores_gemma":[0.9826446,0.008711565,0.0014988761,0.0015223421,0.0029307723,0.0026918245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011053744,0.0006995382,0.0011533811,0.0012546255,0.002596144,0.002185022,0.0012652256,0.003949312,0.030409764],"category_scores_gemma":[0.01495271,0.0011443528,0.0012938639,0.0008989353,0.0025049187,0.004680554,0.0021798634,0.0032963161,0.0077419607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011735425,0.000827733,0.006861709,0.0012928736,0.00020026641,0.004455008,0.001402245,0.005280755,0.060833856,0.8309237,0.06326838,0.02348004],"study_design_scores_gemma":[0.0006073407,0.0004255238,0.007290303,0.0003804235,0.00018008398,0.004195332,0.0021169244,0.015708799,0.02407889,0.8865225,0.058287125,0.00020680486],"about_ca_topic_score_codex":0.0009677339,"about_ca_topic_score_gemma":0.0018582137,"teacher_disagreement_score":0.030409764,"about_ca_system_score_codex":0.0005779036,"about_ca_system_score_gemma":0.0016115168,"threshold_uncertainty_score":0.101730764},"labels":[],"label_agreement":null},{"id":"W108373764","doi":"","title":"On the Gracefulness of the Graph Cm U Pn.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.016821119483387822,"score_gpt":0.20224020637766946,"score_spread":0.18541908689428163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W108373764","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49468443,0.0033933916,0.2185302,0.011843413,0.00065566413,0.00010423425,0.0018384907,0.0011043354,0.26784593],"genre_scores_gemma":[0.9452081,0.001381003,0.024780957,0.0011773465,0.0005059432,0.000105376195,0.0008830684,0.00041427463,0.025544021],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918133,0.00024125974,0.000038608883,0.00021730788,0.00013356592,0.00018796531],"domain_scores_gemma":[0.99490476,0.0031331195,0.00041743802,0.0008221453,0.00022735572,0.0004951378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010867459,0.00051626394,0.0006926737,0.001444945,0.0027557611,0.002974075,0.001187324,0.0013613156,0.010393521],"category_scores_gemma":[0.005745761,0.0005921436,0.00073890906,0.0014469334,0.004965625,0.00750021,0.0031709294,0.0030388837,0.0014057665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009186195,0.000021705828,0.0005137654,0.000049479913,0.0000075451635,0.0000577333,0.00030232724,0.002044907,0.0007280988,0.98216474,0.0054556504,0.008562328],"study_design_scores_gemma":[0.000011282477,0.000011030057,0.0004043514,0.0000147028095,0.000008006145,0.00006672632,0.00012146083,0.003476415,0.00038938882,0.9914197,0.0040664384,0.000010559418],"about_ca_topic_score_codex":0.0033923874,"about_ca_topic_score_gemma":0.003555444,"teacher_disagreement_score":0.010393521,"about_ca_system_score_codex":0.0015305037,"about_ca_system_score_gemma":0.00071807526,"threshold_uncertainty_score":0.034769833},"labels":[],"label_agreement":null},{"id":"W108390543","doi":"","title":"On imp-sets, kernels by monochromatic paths of the duplication.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Monochromatic color; Mathematics; Gene duplication; Arithmetic; Optics; Physics; Biology; Genetics","score_opus":0.006482147157062837,"score_gpt":0.22893580515048087,"score_spread":0.22245365799341804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W108390543","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27601796,0.0025025557,0.57461846,0.001577573,0.00063418836,0.00015127906,0.0013251775,0.0018806659,0.14129211],"genre_scores_gemma":[0.8911979,0.00089339714,0.0712702,0.0006333352,0.00034597036,0.00017447739,0.00085776666,0.0004682796,0.034158673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864393,0.00032742048,0.00011588116,0.00035327705,0.0003052631,0.00025432432],"domain_scores_gemma":[0.99684346,0.0015429615,0.00030467816,0.00074178603,0.0002696363,0.00029752468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093459786,0.00050342316,0.0007918771,0.0015233598,0.0022732227,0.0031472086,0.0012335805,0.0012278815,0.00863214],"category_scores_gemma":[0.0050877356,0.00062356243,0.0011850365,0.0014664017,0.0031109066,0.008689493,0.0032300903,0.0018781377,0.0022392888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007179273,0.000023840716,0.00030351983,0.000055362278,0.000010335585,0.0003097974,0.00036317875,0.00091100816,0.0012336688,0.9855531,0.002024761,0.009139634],"study_design_scores_gemma":[0.000013347222,0.000018866993,0.00026017695,0.000023014341,0.000014278842,0.0004880496,0.00014750243,0.004027364,0.0010270125,0.9879981,0.0059657786,0.00001647788],"about_ca_topic_score_codex":0.0009945068,"about_ca_topic_score_gemma":0.0011668041,"teacher_disagreement_score":0.00863214,"about_ca_system_score_codex":0.0012486731,"about_ca_system_score_gemma":0.0005908464,"threshold_uncertainty_score":0.028877437},"labels":[],"label_agreement":null},{"id":"W108436809","doi":"","title":"Lexicographically Optimum Traffic Trees with Maximum Degree Constraints.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Lexicographical order; Mathematics; Degree (music); Statistics; Combinatorics","score_opus":0.02972746397389642,"score_gpt":0.26469563646203764,"score_spread":0.23496817248814122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W108436809","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07095589,0.00058961945,0.8483362,0.001322629,0.00018993736,0.00026526247,0.002360613,0.0013178596,0.07466209],"genre_scores_gemma":[0.585604,0.00073362596,0.3924142,0.0004135124,0.00010359206,0.00026461686,0.0019241017,0.0006159243,0.017926462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856204,0.00050882547,0.000088692635,0.00018623061,0.00038392193,0.0002703393],"domain_scores_gemma":[0.995928,0.0026976084,0.00033112062,0.00057131547,0.00031425155,0.00015769736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011695849,0.00054998614,0.0006654419,0.00090086804,0.0008306464,0.0025380226,0.0012732956,0.0011763788,0.0127572045],"category_scores_gemma":[0.00858247,0.00067164126,0.00057016057,0.0011827062,0.0011253378,0.0038227364,0.0013958346,0.0014118958,0.0019102751],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046056128,0.00016355816,0.0011393192,0.0004293673,0.000045691286,0.00030749006,0.00018543661,0.11604079,0.00999894,0.7924302,0.012813664,0.06598505],"study_design_scores_gemma":[0.00008367198,0.00006716503,0.00033262564,0.00010801143,0.000037341317,0.00031017518,0.00016263654,0.1881397,0.0077868574,0.7853273,0.017613754,0.000030744235],"about_ca_topic_score_codex":0.0014036,"about_ca_topic_score_gemma":0.004182695,"teacher_disagreement_score":0.0127572045,"about_ca_system_score_codex":0.0014924144,"about_ca_system_score_gemma":0.0019405956,"threshold_uncertainty_score":0.042677104},"labels":[],"label_agreement":null},{"id":"W108991171","doi":"","title":"The Binet Formulas for the Pell and Pell-Lucas p-Numbers.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Lucas sequence; Lucas number; Arithmetic; Combinatorics; Fibonacci polynomials; Fibonacci number; Classical orthogonal polynomials","score_opus":0.008855985715087444,"score_gpt":0.2761727875899793,"score_spread":0.2673168018748919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W108991171","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06534316,0.010163112,0.2954127,0.006692134,0.002687651,0.00014133612,0.002241102,0.00077887246,0.61653984],"genre_scores_gemma":[0.6999776,0.00812033,0.103876606,0.0020741299,0.0016238375,0.00032527413,0.0015936769,0.00056010956,0.18184856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950004,0.00011009765,0.00003434572,0.000069387475,0.00021289989,0.00007320842],"domain_scores_gemma":[0.9992293,0.00029812587,0.00008696733,0.000090927584,0.00021727997,0.00007737041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061170955,0.00082103454,0.0006011967,0.0025836406,0.0015753313,0.0045229793,0.0010380143,0.0013861088,0.023150267],"category_scores_gemma":[0.005718929,0.00038647142,0.0006207574,0.0024386237,0.002105069,0.008043153,0.0020586995,0.0032815682,0.0060181483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013003477,0.0000034728344,0.000053073585,0.000023359227,0.0000020005057,0.000035589164,0.000050491217,0.00013113147,0.0001069521,0.9885212,0.0037645581,0.0072951876],"study_design_scores_gemma":[0.0000061242254,0.0000049109767,0.0001135074,0.000023641625,0.0000047353647,0.00014534108,0.000053380158,0.0012405579,0.0003047664,0.9801894,0.017902715,0.000010816268],"about_ca_topic_score_codex":0.00150788,"about_ca_topic_score_gemma":0.0018775362,"teacher_disagreement_score":0.023150267,"about_ca_system_score_codex":0.0016499888,"about_ca_system_score_gemma":0.00083479274,"threshold_uncertainty_score":0.07744533},"labels":[],"label_agreement":null},{"id":"W109129173","doi":"","title":"(epsilon, epsilon ^ q)-Fuzzy ideals of K-algebras.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Fuzzy and Soft Set Theory","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Fuzzy logic; Pure mathematics; Algebra over a field; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.06506211722875797,"score_gpt":0.328053254458079,"score_spread":0.262991137229321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W109129173","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2605785,0.0059351204,0.44336465,0.0030725366,0.0011907367,0.00021003153,0.0012773747,0.00041278245,0.28395826],"genre_scores_gemma":[0.9036906,0.0011976173,0.059742883,0.00048352222,0.0004938466,0.00011634563,0.00039929844,0.000057381283,0.033818595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984806,0.0004168254,0.00015062562,0.00022769814,0.00048667178,0.0002376232],"domain_scores_gemma":[0.997797,0.0006532317,0.0004055849,0.00018256613,0.0005683711,0.00039331111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020906099,0.0005160602,0.00063659815,0.0025330393,0.0018384798,0.004016776,0.00075388927,0.00068770396,0.00799635],"category_scores_gemma":[0.0030951882,0.000387216,0.0008967192,0.0016084932,0.0038578822,0.0054707997,0.0018553503,0.0015797429,0.0014266308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004086242,0.000015490303,0.00018518379,0.000046590085,0.000017213162,0.00006614105,0.00013925528,0.00040510643,0.00060435245,0.99250776,0.00086439686,0.0051076226],"study_design_scores_gemma":[0.00001556114,0.000020238956,0.00022770459,0.000021480948,0.0000089447585,0.0001931947,0.000113485075,0.0021403367,0.0006467652,0.991418,0.0051785107,0.000015774853],"about_ca_topic_score_codex":0.0008174832,"about_ca_topic_score_gemma":0.00090659986,"teacher_disagreement_score":0.00799635,"about_ca_system_score_codex":0.0015659572,"about_ca_system_score_gemma":0.0008891256,"threshold_uncertainty_score":0.026750445},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.02084863889451242,"score_gpt":0.22194818326989638,"score_spread":0.20109954437538397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W109448701","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53816307,0.0065276306,0.39160657,0.0075480132,0.0003219208,0.00012364976,0.0034159392,0.0010629203,0.05123026],"genre_scores_gemma":[0.9260726,0.0015742938,0.068030834,0.00042717103,0.0003368946,0.0002031007,0.0010041934,0.0002232555,0.0021277028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950316,0.0015709623,0.00025593216,0.0012879715,0.00116909,0.0006843941],"domain_scores_gemma":[0.9602651,0.026542759,0.0030843832,0.005591721,0.0020612907,0.0024547628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033002982,0.0018152973,0.0017705864,0.0036342784,0.0020665545,0.004211962,0.002278591,0.0022948692,0.002886475],"category_scores_gemma":[0.029281951,0.0012087552,0.0010940701,0.003434665,0.004661749,0.01214126,0.0050504818,0.0040995185,0.000519122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005300927,0.00010689658,0.012736083,0.00037027936,0.000192246,0.0002481834,0.0008951053,0.0975213,0.008041568,0.8323274,0.010272985,0.03675785],"study_design_scores_gemma":[0.000041361498,0.00019425727,0.0071140714,0.000119602235,0.000084663196,0.0006591122,0.00033167598,0.22703123,0.0044077258,0.74713814,0.012721669,0.00015646897],"about_ca_topic_score_codex":0.0009902224,"about_ca_topic_score_gemma":0.0014473563,"teacher_disagreement_score":0.004211962,"about_ca_system_score_codex":0.0038727687,"about_ca_system_score_gemma":0.00086443895,"threshold_uncertainty_score":0.028099},"labels":[],"label_agreement":null},{"id":"W109768219","doi":"","title":"(t, k)-Geodetic Set of a Graph.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Geodetic datum; Mathematics; Graph; Combinatorics; Set (abstract data type); Geodesy; Computer science; Geography; Programming language","score_opus":0.01344245841610485,"score_gpt":0.25378482168323485,"score_spread":0.24034236326713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W109768219","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46356395,0.0005590179,0.38192216,0.0014491346,0.0007496322,0.00030464967,0.0085380925,0.0015986579,0.14131467],"genre_scores_gemma":[0.7553085,0.00046681368,0.16328561,0.00034426723,0.00013595835,0.00021700676,0.0090957,0.00044704066,0.07069914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967575,0.000049443046,0.000023188144,0.00008901768,0.0000880061,0.00007467029],"domain_scores_gemma":[0.99943835,0.00009435546,0.00008779376,0.0001482985,0.00012667042,0.0001045196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017635309,0.00039110205,0.00050945143,0.0018207185,0.0013577583,0.0013964343,0.000797737,0.000743957,0.01645279],"category_scores_gemma":[0.0009596802,0.00031894076,0.0006068144,0.0010779825,0.0010570815,0.0010064567,0.0014666651,0.0009818714,0.004403795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049883197,0.00015618246,0.0055594807,0.00045190845,0.0001267544,0.0017053797,0.0009990555,0.0110202925,0.040765036,0.8131732,0.028095903,0.09744795],"study_design_scores_gemma":[0.000108794535,0.00026438397,0.014005078,0.00019681067,0.00016865025,0.005575457,0.0021959262,0.04463724,0.035110887,0.7376257,0.15997857,0.00013245555],"about_ca_topic_score_codex":0.0016089397,"about_ca_topic_score_gemma":0.0027794377,"teacher_disagreement_score":0.01645279,"about_ca_system_score_codex":0.00060667616,"about_ca_system_score_gemma":0.00049318525,"threshold_uncertainty_score":0.05504006},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Stars; Mathematics; Star (game theory); Combinatorics; Group (periodic table); Astrophysics; Physics; Mathematical analysis","score_opus":0.013193417785829796,"score_gpt":0.22919929267255962,"score_spread":0.21600587488672982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W109780709","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6063265,0.0045466786,0.20561375,0.0025761772,0.0003288763,0.00007932884,0.0008714816,0.00044713548,0.17921004],"genre_scores_gemma":[0.9666127,0.0018746807,0.01750301,0.0003203395,0.00022167356,0.00006502911,0.00057370396,0.00006998937,0.01275886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976295,0.0000687471,0.000010622053,0.00005210458,0.00006175228,0.000043829074],"domain_scores_gemma":[0.99842864,0.00082075084,0.00025465875,0.0001374562,0.00015502973,0.00020332112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030604753,0.00025664183,0.00032498536,0.0010896915,0.0006662799,0.0010218921,0.00050886296,0.00060844695,0.0071942345],"category_scores_gemma":[0.0023314673,0.00032323366,0.00026877405,0.0010431535,0.0008805219,0.0032969585,0.0009755368,0.0008916096,0.00053431327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072532486,0.00002109761,0.0009587894,0.00010052118,0.000014232564,0.00027668162,0.00026662086,0.0052547795,0.0022412236,0.9675589,0.0058131004,0.017421499],"study_design_scores_gemma":[0.0000114317045,0.00001924177,0.00077256345,0.000021113286,0.000012397832,0.00035539223,0.00016366238,0.015456088,0.00058913906,0.97591317,0.006679724,0.0000060859584],"about_ca_topic_score_codex":0.000702399,"about_ca_topic_score_gemma":0.0014637245,"teacher_disagreement_score":0.0071942345,"about_ca_system_score_codex":0.00043952503,"about_ca_system_score_gemma":0.00026577886,"threshold_uncertainty_score":0.024067044},"labels":[],"label_agreement":null},{"id":"W109839048","doi":"","title":"P/d-Graphs of Tournaments.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.016228202504722577,"score_gpt":0.2944694120789967,"score_spread":0.2782412095742741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W109839048","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26208097,0.0018319016,0.22492638,0.0033451265,0.0007866144,0.00029493918,0.005540988,0.00168661,0.49950647],"genre_scores_gemma":[0.89413714,0.00095178426,0.043077618,0.0009599924,0.00025971918,0.00018964981,0.0035975606,0.00027511167,0.05655134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928063,0.00015880009,0.00004444411,0.00022298418,0.0001411405,0.00015202923],"domain_scores_gemma":[0.9982692,0.0005302725,0.00031529804,0.00027350732,0.00023575196,0.00037602705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003944265,0.00071362534,0.0005455587,0.0016670077,0.0021103765,0.0038742628,0.0011626701,0.0011088306,0.019465866],"category_scores_gemma":[0.0023523308,0.0006223417,0.00080456486,0.0018273636,0.0016404049,0.0028873933,0.0020628672,0.0019729233,0.0023713987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012952124,0.000049426322,0.000996826,0.00013322689,0.000034342076,0.00040401614,0.000147659,0.00134428,0.0018476774,0.96597886,0.012530497,0.016403653],"study_design_scores_gemma":[0.00005515489,0.000030581148,0.0012858401,0.00004159421,0.000037517184,0.0009603634,0.00019313177,0.0052305334,0.0018555428,0.96128494,0.029006273,0.000018462388],"about_ca_topic_score_codex":0.0017662285,"about_ca_topic_score_gemma":0.0022079214,"teacher_disagreement_score":0.019465866,"about_ca_system_score_codex":0.0012296553,"about_ca_system_score_gemma":0.00054219505,"threshold_uncertainty_score":0.0651198},"labels":[],"label_agreement":null},{"id":"W109875978","doi":"","title":"Detour index of TUC4C8(S) nanotube .","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graphene research and applications","field":"Materials Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Index (typography); Mathematics; Nanotube; Nanotechnology; Materials science; Computer science; Carbon nanotube; World Wide Web","score_opus":0.013515521007146283,"score_gpt":0.27972660304608804,"score_spread":0.2662110820389418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W109875978","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96228284,0.00044124734,0.0018528046,0.00016417068,0.000093009156,0.000008268883,0.000497576,0.00016028876,0.034499876],"genre_scores_gemma":[0.99639904,0.00010109149,0.00035308415,0.000016019269,0.0000048610477,0.000008967093,0.00019370318,0.000023493662,0.0028998093],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9999039,0.000009184891,0.000003560324,0.000019414358,0.000034142802,0.000029759754],"domain_scores_gemma":[0.9997396,0.000088634275,0.000041849264,0.000021695278,0.0000593501,0.0000488378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001044053,0.0002066653,0.00018224755,0.0007918163,0.000613364,0.000505026,0.00039359546,0.0005622984,0.009435915],"category_scores_gemma":[0.0004541111,0.000075667645,0.00006761629,0.00050704344,0.00029628177,0.0004887168,0.000243276,0.00026317258,0.0005964567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013547696,0.0001454997,0.0024398868,0.00037703596,0.00003826257,0.00077809446,0.00036828316,0.009012988,0.9075111,0.04661244,0.0083243195,0.023037221],"study_design_scores_gemma":[0.000036208952,0.00048242294,0.015076926,0.00009536569,0.000038984523,0.0003412126,0.0006566557,0.13071114,0.8301984,0.00983865,0.012417361,0.00010657191],"about_ca_topic_score_codex":0.0013605963,"about_ca_topic_score_gemma":0.0015382408,"teacher_disagreement_score":0.009435915,"about_ca_system_score_codex":0.0005721647,"about_ca_system_score_gemma":0.00014733593,"threshold_uncertainty_score":0.03156632},"labels":[],"label_agreement":null},{"id":"W110328050","doi":"","title":"On Deuber's partition theorem for (m, p, c)-sets.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Partition (number theory); Van der Waerden's theorem; Combinatorics; Conjecture; Discrete mathematics; Graph","score_opus":0.032919959704339155,"score_gpt":0.2787629024567095,"score_spread":0.24584294275237034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W110328050","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10937494,0.01305275,0.48747182,0.008970394,0.0015659378,0.00022365917,0.00095046125,0.00070575625,0.37768435],"genre_scores_gemma":[0.8214159,0.006323191,0.11389984,0.0049534566,0.0012966136,0.00046189193,0.0009918163,0.00044293486,0.050214235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885,0.00026243553,0.00004139689,0.00025544644,0.00039094096,0.00019979672],"domain_scores_gemma":[0.9978956,0.0013484719,0.00012277882,0.00024009463,0.00022930208,0.00016367692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017322585,0.0008431753,0.0009610164,0.002443711,0.003029606,0.0023795054,0.0013953582,0.0016544635,0.007000361],"category_scores_gemma":[0.005460375,0.00074141973,0.0013524501,0.0020722905,0.00576485,0.008787441,0.005044457,0.0044192197,0.0022158204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023537377,0.000009159361,0.00011059236,0.000034751938,0.000005896889,0.000046769863,0.00019234527,0.00039240677,0.000506259,0.99116313,0.0022483976,0.005266635],"study_design_scores_gemma":[0.000013237369,0.000015403166,0.00016015056,0.00002884763,0.0000074231543,0.00012886919,0.000051902767,0.0010501848,0.000729533,0.9863149,0.011485782,0.000013912337],"about_ca_topic_score_codex":0.0022118061,"about_ca_topic_score_gemma":0.0016199102,"teacher_disagreement_score":0.007000361,"about_ca_system_score_codex":0.0024271577,"about_ca_system_score_gemma":0.0006488523,"threshold_uncertainty_score":0.023418546},"labels":[],"label_agreement":null},{"id":"W110549108","doi":"","title":"A note on choosability with separation for planar graphs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Planar graph; Planar; Combinatorics; Separation (statistics); Graph; Computer science; Statistics; Computer graphics (images)","score_opus":0.01996082089592175,"score_gpt":0.314720412405843,"score_spread":0.2947595915099212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W110549108","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03963547,0.0115643805,0.6096071,0.011257352,0.0032380354,0.00021464612,0.0008006735,0.0010241986,0.32265812],"genre_scores_gemma":[0.56945807,0.023497155,0.30112508,0.0055323583,0.005345916,0.0004580137,0.0019653619,0.0012286704,0.091389425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873894,0.00023256098,0.000064916945,0.00029136904,0.00045849147,0.00021372626],"domain_scores_gemma":[0.99687696,0.0021819116,0.00012873604,0.00046861704,0.0001435297,0.00020025927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010623023,0.0009980168,0.0010911132,0.0011954597,0.0015407937,0.00244944,0.0021269822,0.00158146,0.01633422],"category_scores_gemma":[0.005034618,0.00080325536,0.0018187342,0.0022871634,0.0033603597,0.007685909,0.0044995504,0.006749483,0.0031572056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001970704,0.00008750051,0.0005372687,0.00052926457,0.00006710062,0.00040683814,0.00022292316,0.0053102854,0.005766204,0.88081574,0.02617008,0.07988973],"study_design_scores_gemma":[0.00003140599,0.000056276836,0.00044714095,0.00006228042,0.00004519927,0.00043424877,0.000083043145,0.0065116915,0.0026376967,0.9552987,0.034364678,0.000027727268],"about_ca_topic_score_codex":0.0016919256,"about_ca_topic_score_gemma":0.0022383726,"teacher_disagreement_score":0.01633422,"about_ca_system_score_codex":0.001267557,"about_ca_system_score_gemma":0.0008214422,"threshold_uncertainty_score":0.054643333},"labels":[],"label_agreement":null},{"id":"W110861836","doi":"","title":"Recursive Constructions of Balanced Incomplete Block Designs with Block Size of 7.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Optimal Experimental Design Methods","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Block (permutation group theory); Mathematics; Block size; Arithmetic; Combinatorics; Computer science; Operating system","score_opus":0.0795173013893631,"score_gpt":0.3721314229376046,"score_spread":0.2926141215482415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W110861836","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00824111,0.0001961565,0.9865073,0.00007888099,0.000039627215,0.0003815145,0.0003084701,0.0002931561,0.003953694],"genre_scores_gemma":[0.09567549,0.0002504344,0.89822716,0.00012933568,0.00004157677,0.0022056613,0.00045557387,0.00012330296,0.002891456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98666024,0.008931639,0.0006127314,0.0012361165,0.0018221098,0.00073718355],"domain_scores_gemma":[0.97488344,0.017248467,0.0017966597,0.0038737855,0.0017017133,0.0004958232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014049643,0.0011717041,0.001663766,0.0014016958,0.00063967623,0.0015790572,0.0021004246,0.0011516156,0.011272482],"category_scores_gemma":[0.031208474,0.0011425387,0.0014364319,0.0010887054,0.0016824492,0.0018698543,0.0019460393,0.0016916436,0.0027163532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019713673,0.00036276062,0.0013615431,0.000955781,0.00023714424,0.00017140091,0.00034856546,0.058494624,0.025450964,0.66029423,0.0041620526,0.24618943],"study_design_scores_gemma":[0.0016871439,0.0024864,0.0017008687,0.0004941676,0.00039204065,0.00028343473,0.00015158419,0.27203968,0.040178616,0.64259887,0.03784425,0.00014287872],"about_ca_topic_score_codex":0.00061600824,"about_ca_topic_score_gemma":0.0016526515,"teacher_disagreement_score":0.014049643,"about_ca_system_score_codex":0.0013701284,"about_ca_system_score_gemma":0.0030812307,"threshold_uncertainty_score":0.074302554},"labels":[],"label_agreement":null},{"id":"W110992842","doi":"","title":"A Construction of Layered Relative Difference Sets Using Galois Rings.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.014225800978947642,"score_gpt":0.23799301514880405,"score_spread":0.2237672141698564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W110992842","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11916555,0.00074336026,0.80316424,0.00048802598,0.0004386493,0.00012311758,0.00039984327,0.0015706641,0.07390653],"genre_scores_gemma":[0.7294308,0.0005755649,0.24407458,0.0002804103,0.00013899931,0.00014457638,0.000488484,0.00035444112,0.02451204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883956,0.00026647834,0.000082988845,0.0001926531,0.00044891675,0.00016948284],"domain_scores_gemma":[0.99907076,0.000298673,0.00007257387,0.00027671066,0.000115540184,0.00016573649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011789876,0.0005651313,0.00063764106,0.0014194065,0.0013894148,0.0030699696,0.0013080032,0.0005560981,0.00653082],"category_scores_gemma":[0.002337987,0.0006806283,0.00089322473,0.0011401637,0.002212665,0.0061078123,0.005575302,0.0022872428,0.0017732362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044040557,0.000023456869,0.0001966861,0.0000449799,0.000009599451,0.0000650072,0.00027542128,0.0006941231,0.002940229,0.9810042,0.00088165497,0.013820482],"study_design_scores_gemma":[0.000039125494,0.00011603241,0.0004286713,0.00007015769,0.00005234192,0.00046879653,0.00028512534,0.009512502,0.01444179,0.9392866,0.035238873,0.000059998343],"about_ca_topic_score_codex":0.0003815286,"about_ca_topic_score_gemma":0.00044770722,"teacher_disagreement_score":0.00653082,"about_ca_system_score_codex":0.0008932465,"about_ca_system_score_gemma":0.00045721568,"threshold_uncertainty_score":0.021847785},"labels":[],"label_agreement":null},{"id":"W111065268","doi":"","title":"Mutually Eccentric Vertices in Graphs.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Eccentric; Structural engineering","score_opus":0.014587191091620417,"score_gpt":0.27014149887450295,"score_spread":0.2555543077828825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W111065268","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37770602,0.0039763567,0.28296855,0.0025626873,0.00089456304,0.00012150488,0.00077694666,0.0009485173,0.3300449],"genre_scores_gemma":[0.8810037,0.0016791684,0.06709379,0.0004209748,0.00030437272,0.000074171665,0.00050786807,0.00021102335,0.048705004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906284,0.00030624686,0.000055608438,0.00020012022,0.0002274488,0.00014775949],"domain_scores_gemma":[0.9976845,0.001064299,0.00037773236,0.00037845894,0.0002871784,0.0002078068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005537001,0.00048669294,0.0005166538,0.0018607766,0.002011125,0.0022001383,0.0007231885,0.0014845437,0.011490068],"category_scores_gemma":[0.0049389834,0.0004995708,0.00031206195,0.0017480546,0.0018313663,0.0035242238,0.0029694608,0.0013148799,0.003184036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001068999,0.000021370255,0.0012638825,0.00014664419,0.000018830824,0.00049249653,0.00045597245,0.001463612,0.0029232556,0.9556483,0.004525313,0.032933485],"study_design_scores_gemma":[0.000016923168,0.000025450929,0.00066120096,0.00008753543,0.000034370467,0.0011985146,0.00044573197,0.0045124036,0.0031757539,0.96458024,0.025245195,0.000016745145],"about_ca_topic_score_codex":0.00038918588,"about_ca_topic_score_gemma":0.000978618,"teacher_disagreement_score":0.011490068,"about_ca_system_score_codex":0.00060342235,"about_ca_system_score_gemma":0.00035865267,"threshold_uncertainty_score":0.03843814},"labels":[],"label_agreement":null},{"id":"W111329175","doi":"","title":"A Note On Excellent Graphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.008920038021905137,"score_gpt":0.2185138398954584,"score_spread":0.20959380187355325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W111329175","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008445124,0.045314256,0.07128653,0.1012412,0.0524024,0.00007656163,0.0010721233,0.001029072,0.7191327],"genre_scores_gemma":[0.24878776,0.07396835,0.15010598,0.054967996,0.0565592,0.00026693588,0.0015997047,0.0016541595,0.41209],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993254,0.0002053347,0.000029215622,0.00013144352,0.00022307796,0.00008557209],"domain_scores_gemma":[0.99719703,0.0017789819,0.00008559055,0.00034611567,0.00031518147,0.00027709082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013040917,0.0007285033,0.0007708002,0.0018442728,0.002261366,0.0021516022,0.0014804305,0.0013129752,0.020919127],"category_scores_gemma":[0.003397899,0.00041997264,0.0007104084,0.0017734641,0.0027410656,0.0061056153,0.0026355693,0.0053286687,0.0049449066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003386895,0.000022545408,0.00018320262,0.00020481319,0.000013893162,0.0001767937,0.00013338905,0.000437544,0.0004651111,0.68267137,0.29057804,0.02507944],"study_design_scores_gemma":[0.0000065949453,0.00001580391,0.00036956844,0.00007426818,0.000010857518,0.00028045176,0.00012012145,0.00046793142,0.0002881057,0.52310944,0.47524232,0.00001467955],"about_ca_topic_score_codex":0.0020623666,"about_ca_topic_score_gemma":0.0058692964,"teacher_disagreement_score":0.020919127,"about_ca_system_score_codex":0.001370886,"about_ca_system_score_gemma":0.00062617986,"threshold_uncertainty_score":0.069981396},"labels":[],"label_agreement":null},{"id":"W111421868","doi":"","title":"Adding and Deleting Crossings in Drawings of Graphs.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Arithmetic","score_opus":0.0073801810679505675,"score_gpt":0.22934764672525917,"score_spread":0.2219674656573086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W111421868","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.121797726,0.00080573885,0.8230004,0.00056923,0.0005228662,0.00024665848,0.00065846706,0.002528582,0.04987031],"genre_scores_gemma":[0.36438036,0.0009202524,0.60032445,0.00019146327,0.00012326152,0.00012649556,0.001496028,0.00082301866,0.031614628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986677,0.0003490832,0.00010502661,0.00032270263,0.00037543778,0.00018003157],"domain_scores_gemma":[0.99642545,0.0013818587,0.00037427843,0.0011034678,0.00038896943,0.0003259142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009971447,0.00087514,0.0006531763,0.002131661,0.0015297543,0.002269893,0.0019631016,0.0016117232,0.011807788],"category_scores_gemma":[0.0075385845,0.00088579895,0.000989699,0.0025561166,0.0017293394,0.0034870529,0.002531651,0.0019049194,0.0029980382],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003554021,0.00020148761,0.002918778,0.00042692243,0.00006643228,0.0010823581,0.000918977,0.049700413,0.01883905,0.56025153,0.018733101,0.34650552],"study_design_scores_gemma":[0.00008337839,0.0001703908,0.0013749771,0.00021611166,0.000137703,0.0016382395,0.0007351787,0.12818289,0.02947868,0.7641542,0.07374482,0.00008342389],"about_ca_topic_score_codex":0.00096004456,"about_ca_topic_score_gemma":0.0022490444,"teacher_disagreement_score":0.011807788,"about_ca_system_score_codex":0.0006936524,"about_ca_system_score_gemma":0.00051026203,"threshold_uncertainty_score":0.03950101},"labels":[],"label_agreement":null},{"id":"W111494185","doi":"","title":"The total number of maximal k-independent sets in the generalized lexicographical product of graphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Lexicographical order; Mathematics; Product (mathematics); Combinatorics; Discrete mathematics; Geometry","score_opus":0.012366653337287141,"score_gpt":0.2557627499748185,"score_spread":0.24339609663753137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W111494185","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84603757,0.0016867451,0.10056873,0.0014813278,0.00017925035,0.00012066764,0.004238457,0.0004924296,0.045194853],"genre_scores_gemma":[0.93807185,0.0012978505,0.045958742,0.00021182676,0.00018184456,0.00019199488,0.002644212,0.000219437,0.011222324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998692,0.00036666257,0.00010780405,0.00028767274,0.00032226328,0.00022358767],"domain_scores_gemma":[0.99010897,0.0062817764,0.0009961595,0.0010162547,0.00081085647,0.00078596827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013894559,0.0006273139,0.00096406287,0.0021885869,0.0014436549,0.0045781606,0.0018035166,0.0010471311,0.008627868],"category_scores_gemma":[0.00849421,0.00069975783,0.0006937982,0.0023901558,0.002234036,0.005331755,0.0012726311,0.0010289792,0.0012314222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011776828,0.00018983123,0.01270799,0.0011406374,0.00029914713,0.0007803682,0.0010555823,0.0212556,0.021370867,0.8604686,0.014878611,0.06467501],"study_design_scores_gemma":[0.000084463805,0.0001168511,0.0046504717,0.00011377744,0.00018312164,0.0017394415,0.0005153451,0.046937454,0.010485293,0.9241102,0.011003023,0.00006057006],"about_ca_topic_score_codex":0.00058632623,"about_ca_topic_score_gemma":0.0010953498,"teacher_disagreement_score":0.008627868,"about_ca_system_score_codex":0.0009859415,"about_ca_system_score_gemma":0.000957511,"threshold_uncertainty_score":0.028863072},"labels":[],"label_agreement":null},{"id":"W111571758","doi":"","title":"Q-Analogue Of The Pascal Matrix.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Pascal (unit); Mathematics; Pascal matrix; Algebra over a field; Pure mathematics; Matrix function; Computer science; Programming language; Symmetric matrix; Physics","score_opus":0.01554864130113826,"score_gpt":0.2458505113631648,"score_spread":0.23030187006202654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W111571758","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0701453,0.0027563712,0.22865099,0.0066990624,0.0045143953,0.000121897974,0.0013134885,0.0008189461,0.68497956],"genre_scores_gemma":[0.7369666,0.0018856958,0.07995943,0.0035831435,0.0027216088,0.00018624502,0.0007938936,0.0006712668,0.17323211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992157,0.00018321512,0.000025195166,0.00015327771,0.00026247656,0.00015994639],"domain_scores_gemma":[0.9991404,0.00020093862,0.00010555449,0.00013763696,0.00027192826,0.00014358587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049166376,0.0006215945,0.0004960619,0.0013541062,0.0012329844,0.002109733,0.0008797898,0.00085590594,0.03745981],"category_scores_gemma":[0.0029158345,0.00024179352,0.0004715325,0.0010046713,0.002475419,0.0024605163,0.0013869017,0.002481101,0.008890965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003584433,0.000015861684,0.0000648935,0.000046191242,0.00000468152,0.00009617089,0.00006740563,0.0003646584,0.0007764336,0.974037,0.012241132,0.012249826],"study_design_scores_gemma":[0.000017507538,0.000029490922,0.00023616431,0.00002105351,0.0000045251554,0.00043694925,0.0000703151,0.0030995114,0.0011756097,0.9478136,0.047075234,0.00002005632],"about_ca_topic_score_codex":0.0015179146,"about_ca_topic_score_gemma":0.0013955096,"teacher_disagreement_score":0.03745981,"about_ca_system_score_codex":0.0007133268,"about_ca_system_score_gemma":0.0007778743,"threshold_uncertainty_score":0.1253156},"labels":[],"label_agreement":null},{"id":"W112249820","doi":"","title":"Uniform Step Magic Squares Revisited.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Magic square; Mathematics; MAGIC (telescope); Combinatorics; Astronomy; Physics","score_opus":0.010376747642955368,"score_gpt":0.22670393089011842,"score_spread":0.21632718324716305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W112249820","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13943371,0.004324158,0.35296693,0.0055051316,0.0012751791,0.00013652554,0.0010550118,0.0012759332,0.49402735],"genre_scores_gemma":[0.76251674,0.0017372492,0.1568581,0.001711115,0.00029128065,0.00016890539,0.0008207714,0.0004440466,0.07545183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992818,0.00022245236,0.000027993105,0.0001575164,0.00019069633,0.000119498705],"domain_scores_gemma":[0.99837,0.00080156303,0.00009808595,0.00041321258,0.00018504116,0.00013210846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006690357,0.00035948466,0.00052592286,0.00091992127,0.001345385,0.0015970052,0.0012775704,0.0010938669,0.019997694],"category_scores_gemma":[0.0038591267,0.00041855322,0.00046423273,0.0015305447,0.0020117222,0.003668427,0.002262949,0.0025230797,0.002675383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032231965,0.000009545112,0.00011889483,0.000045867862,0.0000054325083,0.00004153137,0.00005251635,0.0009788024,0.0004127667,0.97822535,0.0050096232,0.015067373],"study_design_scores_gemma":[0.00002132357,0.000011587036,0.00018425235,0.000025448158,0.000008554163,0.00014764456,0.00008833041,0.0060276333,0.0009346395,0.97894067,0.013602122,0.000007857292],"about_ca_topic_score_codex":0.001165315,"about_ca_topic_score_gemma":0.0028047026,"teacher_disagreement_score":0.019997694,"about_ca_system_score_codex":0.0008111788,"about_ca_system_score_gemma":0.00067237526,"threshold_uncertainty_score":0.06689894},"labels":[],"label_agreement":null},{"id":"W112478939","doi":"","title":"Nonplanar sequences of iterated r-jump graphs","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Jump; Iterated function; Combinatorics; Discrete mathematics; Pure mathematics; Mathematical analysis; Physics","score_opus":0.007000301445368651,"score_gpt":0.19267451901793306,"score_spread":0.18567421757256442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W112478939","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7545645,0.00031933407,0.17305087,0.0005018371,0.000102850994,0.00009783281,0.00031684685,0.0006561867,0.07038974],"genre_scores_gemma":[0.9378596,0.00028846916,0.037806444,0.00018227754,0.000058435846,0.000089547,0.00048325484,0.00019688066,0.023035163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957556,0.00010018285,0.00002457,0.00009758067,0.00010808038,0.00009408661],"domain_scores_gemma":[0.99682474,0.0016889378,0.00042726583,0.00027642422,0.00044864786,0.00033390825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033642462,0.0004666534,0.00035331328,0.0016220093,0.0010644089,0.0012782144,0.0011480886,0.0008889981,0.009216395],"category_scores_gemma":[0.0037862922,0.00036395853,0.00040336672,0.0009227924,0.0010032568,0.0016078111,0.0011142322,0.0012919442,0.0008334221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013584067,0.000078583915,0.001181181,0.00011428616,0.000016474061,0.00073213346,0.0007719213,0.0058937715,0.014020037,0.95318806,0.0019607455,0.021906905],"study_design_scores_gemma":[0.000040636707,0.00006528475,0.001847917,0.00005547476,0.0000284189,0.0006169014,0.0004939098,0.046161745,0.0061312653,0.9361123,0.008410507,0.00003561348],"about_ca_topic_score_codex":0.0011452542,"about_ca_topic_score_gemma":0.0022551012,"teacher_disagreement_score":0.009216395,"about_ca_system_score_codex":0.00088905444,"about_ca_system_score_gemma":0.00039925895,"threshold_uncertainty_score":0.030831933},"labels":[],"label_agreement":null},{"id":"W112535216","doi":"","title":"Large Chordal Rings for Given Diameter and Uniqueness Property of Minima.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Uniqueness; Chordal graph; Maxima and minima; Property (philosophy); Pure mathematics; Combinatorics; Mathematical analysis; Graph","score_opus":0.02660530475962283,"score_gpt":0.2798555484163703,"score_spread":0.2532502436567475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W112535216","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75238013,0.0029615494,0.14870296,0.0020743338,0.00020812287,0.00006023122,0.000855467,0.00059889845,0.092158325],"genre_scores_gemma":[0.9876201,0.00032575591,0.008277991,0.000120792305,0.00013073997,0.00003199762,0.00013852457,0.00005533783,0.0032988312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928635,0.0001479601,0.000037890266,0.0002599045,0.00011861872,0.00014925588],"domain_scores_gemma":[0.99509627,0.0025427637,0.000729158,0.00047785114,0.00034085667,0.0008131538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014380923,0.00030416407,0.0008665699,0.0009808728,0.0016012996,0.0031270743,0.0010351426,0.00093307946,0.0065256543],"category_scores_gemma":[0.008262023,0.00035480654,0.00045511368,0.00056337507,0.002432979,0.0065661157,0.0021636854,0.0010848835,0.00069984415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000147921,0.0000198311,0.0012893961,0.00009040928,0.000019319279,0.00011859202,0.00015870621,0.0013379777,0.0036699541,0.98711884,0.0016229036,0.004406132],"study_design_scores_gemma":[0.00006831215,0.00006493895,0.0021248793,0.000035386718,0.000043333894,0.0009050192,0.00027515783,0.008585191,0.0038185162,0.97857887,0.005469016,0.000031363455],"about_ca_topic_score_codex":0.00020006765,"about_ca_topic_score_gemma":0.000317313,"teacher_disagreement_score":0.0065256543,"about_ca_system_score_codex":0.00081326626,"about_ca_system_score_gemma":0.0003539049,"threshold_uncertainty_score":0.0218305},"labels":[],"label_agreement":null},{"id":"W112565541","doi":"","title":"Ramsey Numbers r(C5, G) for all Graphs G of Order Six.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Order (exchange); Ramsey's theorem; Discrete mathematics; Graph; Business","score_opus":0.019324165387974192,"score_gpt":0.2875337660461576,"score_spread":0.2682096006581834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W112565541","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61280054,0.0044107516,0.031976983,0.0024625503,0.00035556726,0.00010545433,0.0037145799,0.001355406,0.34281817],"genre_scores_gemma":[0.9597292,0.0011711225,0.014829855,0.00031388426,0.00009022288,0.00010740257,0.0016034445,0.00009900657,0.022055846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995654,0.00008174724,0.000026847674,0.000100010875,0.00010788332,0.00011817394],"domain_scores_gemma":[0.9982862,0.00062237884,0.00032801068,0.00025702256,0.0002381804,0.00026831825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000747308,0.0004542373,0.00030964398,0.0024963599,0.0013129871,0.0019640315,0.0005658102,0.0006796181,0.011282763],"category_scores_gemma":[0.0024723455,0.00018155896,0.00031728364,0.0008813517,0.0012535249,0.0023670527,0.0011317709,0.0010774308,0.0017805293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027621316,0.000048251215,0.0020498172,0.00022142618,0.00002748574,0.00014100083,0.00045682743,0.0008643116,0.0039737257,0.951137,0.015265743,0.025538016],"study_design_scores_gemma":[0.00003866265,0.00008211317,0.006060339,0.00012881726,0.00004666431,0.00091174495,0.0007894687,0.0038031568,0.007247544,0.9115386,0.06929477,0.00005800111],"about_ca_topic_score_codex":0.0010285734,"about_ca_topic_score_gemma":0.0018207212,"teacher_disagreement_score":0.011282763,"about_ca_system_score_codex":0.00080279435,"about_ca_system_score_gemma":0.0005882756,"threshold_uncertainty_score":0.03774464},"labels":[],"label_agreement":null},{"id":"W112758962","doi":"","title":"New determinantal identities on Stirling Numbers.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Stirling engine; Stirling numbers of the second kind; Stirling number; Stirling numbers of the first kind; Algebra over a field; Pure mathematics; Combinatorics; Physics","score_opus":0.040906832097152436,"score_gpt":0.3024085893966774,"score_spread":0.26150175729952496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W112758962","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15113138,0.004711951,0.15265174,0.0033575085,0.0043512457,0.00007328585,0.00056426733,0.0005405283,0.68261814],"genre_scores_gemma":[0.7963604,0.0033249892,0.043596108,0.0014531234,0.0027609647,0.000081303566,0.00059316977,0.0004266605,0.15140331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993357,0.00010674374,0.000035718753,0.00009867975,0.00031578512,0.00010724249],"domain_scores_gemma":[0.999092,0.00020760838,0.000102036065,0.00013778567,0.00023902823,0.00022158612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007018794,0.00056488224,0.00053441874,0.0024253295,0.0015009199,0.0033489938,0.000731655,0.00082517765,0.011729418],"category_scores_gemma":[0.0026629572,0.00036393045,0.0006820337,0.0012073818,0.002279837,0.004784954,0.0025522364,0.0023618236,0.003993979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008242523,0.000009620086,0.00008212891,0.000018883866,0.0000016527484,0.00004749269,0.00009359641,0.00012428612,0.000492686,0.992401,0.0021816313,0.004538761],"study_design_scores_gemma":[0.0000055597534,0.000009990172,0.00017717885,0.000013961246,0.000003912189,0.00026019747,0.00006291744,0.0013970182,0.00043922628,0.98569494,0.011922279,0.000012866032],"about_ca_topic_score_codex":0.00045789065,"about_ca_topic_score_gemma":0.0011822619,"teacher_disagreement_score":0.011729418,"about_ca_system_score_codex":0.00089574157,"about_ca_system_score_gemma":0.00067178597,"threshold_uncertainty_score":0.03923881},"labels":[],"label_agreement":null},{"id":"W11278350","doi":"10.1074/jbc.m007560200","title":"A Note on multicolor bipartite Ramsey numbers for K_{2, n}.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Institute of Diabetes and Digestive and Kidney Diseases; National Institute of General Medical Sciences","keywords":"Mathematics; Bipartite graph; Ramsey's theorem; Combinatorics; Arithmetic; Discrete mathematics","score_opus":0.02821047530836589,"score_gpt":0.3097200164003997,"score_spread":0.2815095410920338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W11278350","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012721497,0.007156031,0.52070034,0.025178866,0.017298821,0.00039060783,0.004207002,0.005122715,0.4072241],"genre_scores_gemma":[0.23925471,0.006277015,0.5134494,0.016103126,0.0059331437,0.0015201825,0.0042173183,0.0030716674,0.21017356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978992,0.0008703087,0.00012505718,0.00046127048,0.00039412075,0.00025008587],"domain_scores_gemma":[0.99631006,0.0020438682,0.00025954543,0.00070644467,0.00042130088,0.00025877726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026877746,0.0015079884,0.0010890845,0.0015778871,0.0022555206,0.002535731,0.002374052,0.0016004256,0.065736674],"category_scores_gemma":[0.008398447,0.00079032895,0.0009712791,0.0022369418,0.0025253452,0.00625682,0.003701243,0.003846408,0.021671917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013385598,0.000041782034,0.0001442031,0.00023957313,0.000016279742,0.00012441592,0.00012411147,0.0013535038,0.0012885451,0.818215,0.13985997,0.03845866],"study_design_scores_gemma":[0.000025730478,0.000030669267,0.00025605503,0.000065597764,0.000010027656,0.00028852478,0.000036882102,0.0062881676,0.000732403,0.7540975,0.23812686,0.000041575924],"about_ca_topic_score_codex":0.0018479212,"about_ca_topic_score_gemma":0.004207385,"teacher_disagreement_score":0.065736674,"about_ca_system_score_codex":0.0019434366,"about_ca_system_score_gemma":0.0008762255,"threshold_uncertainty_score":0.2199111},"labels":[],"label_agreement":null},{"id":"W112874490","doi":"","title":"A New Distance Measure between Graphs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Measure (data warehouse); Combinatorics; Computer science; Data mining","score_opus":0.016661389630604748,"score_gpt":0.2288441518363244,"score_spread":0.21218276220571963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W112874490","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057517327,0.005085009,0.8780891,0.003534174,0.001321018,0.00012505702,0.0016932492,0.0006849868,0.051950134],"genre_scores_gemma":[0.46288782,0.0032223428,0.50261587,0.0015081054,0.0014508123,0.00043510736,0.0027591367,0.00066574436,0.02445503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99671555,0.0009165335,0.00027324026,0.0008459945,0.0009817397,0.00026690078],"domain_scores_gemma":[0.99380493,0.0026680608,0.00074259855,0.0011618881,0.00080962013,0.0008129028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002134428,0.00075259333,0.0011066403,0.0053824177,0.002062296,0.005471114,0.0024097976,0.0024862315,0.0058636926],"category_scores_gemma":[0.011243119,0.00056159275,0.0009878235,0.0054315547,0.0033481237,0.012854008,0.0046584983,0.0043817353,0.0017842258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061636194,0.000047313708,0.00087194116,0.00013942113,0.00002744328,0.000046455207,0.00018954636,0.0023573202,0.0015223146,0.94183713,0.008152078,0.04474738],"study_design_scores_gemma":[0.00002225868,0.00006340328,0.00092926144,0.000104289065,0.00004081554,0.00043984244,0.00024146146,0.03183376,0.0018000592,0.92191786,0.042552114,0.00005481834],"about_ca_topic_score_codex":0.0008766339,"about_ca_topic_score_gemma":0.001207632,"teacher_disagreement_score":0.0058636926,"about_ca_system_score_codex":0.0027572396,"about_ca_system_score_gemma":0.00090088655,"threshold_uncertainty_score":0.020005226},"labels":[],"label_agreement":null},{"id":"W113348692","doi":"","title":"Mod sum number of wheels.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Arithmetic","score_opus":0.008855883404500739,"score_gpt":0.19606006397915307,"score_spread":0.18720418057465232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W113348692","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15519884,0.0016133954,0.15819173,0.0029625583,0.0027365969,0.000111004374,0.002031122,0.001301905,0.67585284],"genre_scores_gemma":[0.68654853,0.0011315724,0.039846785,0.0011636713,0.0008288628,0.00016170126,0.0013276837,0.00056305045,0.26842827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937195,0.00008781104,0.000030217017,0.0001716272,0.0001680938,0.0001702997],"domain_scores_gemma":[0.9990491,0.00025541865,0.000086194224,0.0001782831,0.000202229,0.00022871468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047651157,0.0005897122,0.0007420781,0.0019269445,0.0024647438,0.0029610293,0.0012278782,0.0007225733,0.044304203],"category_scores_gemma":[0.0019450726,0.00030943652,0.0005367064,0.00087149354,0.0016059452,0.0039337273,0.0024669783,0.0016813964,0.008706556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007124641,0.000029277748,0.00043282192,0.000070274735,0.00001241025,0.00007634174,0.00008043227,0.0006960641,0.0015352488,0.9573457,0.013568994,0.026081098],"study_design_scores_gemma":[0.00001535736,0.000034942575,0.0007016623,0.000037622936,0.000018890309,0.0003618416,0.00010781398,0.0049892277,0.0034509406,0.92822963,0.062029827,0.000022320379],"about_ca_topic_score_codex":0.0007431843,"about_ca_topic_score_gemma":0.001532782,"teacher_disagreement_score":0.044304203,"about_ca_system_score_codex":0.001069649,"about_ca_system_score_gemma":0.0008198723,"threshold_uncertainty_score":0.14821231},"labels":[],"label_agreement":null},{"id":"W113759710","doi":"","title":"Random mappings with a given number of cyclical points","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Random permutation; Permutation (music); Digraph; Joint probability distribution; Poisson distribution; Order (exchange); Section (typography); Distribution (mathematics); Dirichlet distribution; Random graph; Discrete mathematics; Statistics; Mathematical analysis; Symmetric group","score_opus":0.007285254594997016,"score_gpt":0.25104156829735746,"score_spread":0.24375631370236045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W113759710","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4203857,0.00045663476,0.56926304,0.00071860326,0.00008348589,0.00019643635,0.0003009889,0.0005054622,0.008089724],"genre_scores_gemma":[0.90546393,0.00039945202,0.0870485,0.00018860547,0.00009244951,0.00043665335,0.000395953,0.00010589558,0.0058687064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981047,0.0006082684,0.000072195,0.00061619794,0.0003983374,0.00020026646],"domain_scores_gemma":[0.990182,0.0055857333,0.0009531952,0.0020881472,0.00066390476,0.00052714464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003285657,0.0005478149,0.0010354364,0.0019671342,0.0012607115,0.0019060285,0.0019513199,0.002034113,0.0034556263],"category_scores_gemma":[0.020402944,0.0008009029,0.0009923881,0.0015602346,0.003353289,0.004391442,0.0015585204,0.0018453563,0.0005437287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027918338,0.00012265709,0.0057830773,0.00013654421,0.00008980838,0.0003678195,0.0003838858,0.14213602,0.00773496,0.8215606,0.0011012733,0.020304108],"study_design_scores_gemma":[0.00006670853,0.00009877327,0.0020016243,0.000045259192,0.000047087342,0.00034836648,0.00015228041,0.5477727,0.003894356,0.44166377,0.0038308676,0.00007814905],"about_ca_topic_score_codex":0.0016262045,"about_ca_topic_score_gemma":0.0017982423,"teacher_disagreement_score":0.0034556263,"about_ca_system_score_codex":0.0018841971,"about_ca_system_score_gemma":0.0008309722,"threshold_uncertainty_score":0.017376423},"labels":[],"label_agreement":null},{"id":"W113843839","doi":"","title":"A Note on Dominating Cycles in Tough Graphs.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.016523351454351676,"score_gpt":0.2947455400191361,"score_spread":0.2782221885647844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W113843839","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03547515,0.06254637,0.21783671,0.076199695,0.043341268,0.00020192962,0.0015491551,0.00088295474,0.5619668],"genre_scores_gemma":[0.4629981,0.087659985,0.17310612,0.03146357,0.043076884,0.00039062536,0.0015681472,0.0012900556,0.1984465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936384,0.00013867674,0.000032598175,0.0001499403,0.00021187117,0.00010313995],"domain_scores_gemma":[0.99529016,0.0033892973,0.00014054081,0.0003787241,0.00038932927,0.00041200072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009740508,0.0009278308,0.00096583634,0.0022170753,0.0028958004,0.002628292,0.0021181975,0.0018600391,0.014382924],"category_scores_gemma":[0.0062467624,0.00053566945,0.001011563,0.0028574646,0.0034703277,0.0072162654,0.0035055766,0.0054587647,0.002952297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074198324,0.000031879506,0.00046543335,0.00042949556,0.0000346851,0.0005844443,0.00036564333,0.0025399795,0.0015977209,0.8418926,0.11439369,0.03759023],"study_design_scores_gemma":[0.000009158454,0.000024887475,0.0004377527,0.00008382741,0.000021983025,0.00035935483,0.00017630645,0.0019016397,0.00042954768,0.88035244,0.11617833,0.000024810692],"about_ca_topic_score_codex":0.0026202768,"about_ca_topic_score_gemma":0.005226332,"teacher_disagreement_score":0.014382924,"about_ca_system_score_codex":0.0014713675,"about_ca_system_score_gemma":0.0006638988,"threshold_uncertainty_score":0.04811567},"labels":[],"label_agreement":null},{"id":"W114220418","doi":"","title":"The Domination Parameters of the Corona and its Generalization.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Research in Science and Engineering","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Generalization; Corona (planetary geology); Mathematical analysis; Physics; Astrobiology","score_opus":0.034925416224346265,"score_gpt":0.30934009566315424,"score_spread":0.274414679438808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W114220418","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33307093,0.0057608765,0.08064331,0.0056886836,0.00075388065,0.00006688424,0.0011778633,0.0005394514,0.57229817],"genre_scores_gemma":[0.9675994,0.0012327528,0.004168603,0.00043679276,0.00070662884,0.000056274344,0.00032667452,0.00015908196,0.025313731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938786,0.0001365545,0.000026830261,0.00015866198,0.00013516506,0.00015491237],"domain_scores_gemma":[0.99800617,0.0008023682,0.00026018915,0.00030658566,0.00025604907,0.00036861782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007603535,0.0005361218,0.00070537033,0.0023921838,0.0017666986,0.0033756031,0.0011108044,0.001546915,0.014610787],"category_scores_gemma":[0.0054810545,0.000367199,0.0004906808,0.001473054,0.0032547708,0.0074201184,0.0023086064,0.0028633522,0.0018064282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026922644,0.000009414314,0.0003209918,0.000024482248,0.000006171562,0.000039269988,0.0001262298,0.00056454627,0.00036369456,0.99174225,0.003132037,0.0036439921],"study_design_scores_gemma":[0.000014628025,0.000008043294,0.0006139105,0.000019287643,0.0000078906705,0.00019671634,0.0001072883,0.0030812062,0.00023029899,0.9877965,0.007909979,0.000014287996],"about_ca_topic_score_codex":0.0014449705,"about_ca_topic_score_gemma":0.00093439844,"teacher_disagreement_score":0.014610787,"about_ca_system_score_codex":0.0016124271,"about_ca_system_score_gemma":0.00051261863,"threshold_uncertainty_score":0.048878014},"labels":[],"label_agreement":null},{"id":"W114458668","doi":"","title":"3-Regular Hypergraphs that are Decomposable and Threshold.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.007924042138880443,"score_gpt":0.1845288132611205,"score_spread":0.17660477112224005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W114458668","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6399782,0.00081237464,0.17022167,0.0014972197,0.00026485024,0.00016513334,0.002553547,0.0018289451,0.18267807],"genre_scores_gemma":[0.9452811,0.0003715264,0.025604842,0.00037334673,0.00008820832,0.000082311926,0.0014647186,0.00020958357,0.026524335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939024,0.000092018796,0.00003954849,0.00015652565,0.00016642218,0.00015518838],"domain_scores_gemma":[0.99723756,0.0011099215,0.00048983475,0.00043634788,0.00032988223,0.0003965002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003509732,0.0004039191,0.00051808247,0.0013457284,0.0009965664,0.0028407695,0.0007172245,0.0009972493,0.011283711],"category_scores_gemma":[0.0032345946,0.0004903745,0.00048089804,0.0012158545,0.0011416945,0.0029479924,0.001201869,0.0013103267,0.0017797101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003478769,0.0001277792,0.0024740617,0.00018308082,0.00006643451,0.001538309,0.0006659719,0.006383704,0.020824768,0.93021137,0.008663525,0.028513204],"study_design_scores_gemma":[0.000040003066,0.000035593308,0.0015127178,0.000061202496,0.000042453,0.0013148373,0.0004789989,0.0200006,0.008052416,0.9537118,0.014718608,0.000030731902],"about_ca_topic_score_codex":0.0012455311,"about_ca_topic_score_gemma":0.0019136562,"teacher_disagreement_score":0.011283711,"about_ca_system_score_codex":0.000907554,"about_ca_system_score_gemma":0.00057400187,"threshold_uncertainty_score":0.0377478},"labels":[],"label_agreement":null},{"id":"W114833178","doi":"","title":"An addition structure on incidence matrices of a BIB design.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.0063139874599083224,"score_gpt":0.21114655383359515,"score_spread":0.20483256637368683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W114833178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09278709,0.0004919064,0.7255684,0.0006696198,0.00053659244,0.00018319601,0.00072501047,0.0011483103,0.17788985],"genre_scores_gemma":[0.69320667,0.000788095,0.2412714,0.00054404826,0.00031867131,0.00022864921,0.001135738,0.00036600608,0.06214068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993917,0.00012724832,0.000048088394,0.00008537917,0.00023418637,0.00011328316],"domain_scores_gemma":[0.99911946,0.00026746897,0.00012599613,0.00016874188,0.00022118176,0.00009719111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045773634,0.00050955877,0.00030122572,0.0011998323,0.0008271005,0.0019507972,0.0005175731,0.00039854992,0.018565565],"category_scores_gemma":[0.0018688962,0.00032953577,0.00032538062,0.0012572028,0.00079956383,0.0016637612,0.001024854,0.001033519,0.004287532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021635284,0.000095768606,0.00063430046,0.00018924536,0.000018583341,0.00034960546,0.00025418846,0.009289341,0.018165918,0.8611326,0.010528296,0.099125646],"study_design_scores_gemma":[0.00007654459,0.00032272053,0.00090832607,0.00013425604,0.000043460994,0.0010464395,0.00023123129,0.07051019,0.028475521,0.8317868,0.06640279,0.0000617296],"about_ca_topic_score_codex":0.0006476951,"about_ca_topic_score_gemma":0.0016243142,"teacher_disagreement_score":0.018565565,"about_ca_system_score_codex":0.0006116119,"about_ca_system_score_gemma":0.00062458246,"threshold_uncertainty_score":0.06210798},"labels":[],"label_agreement":null},{"id":"W1153974305","doi":"","title":"The absorbant number of generalized de Bruijn digraphs","year":2015,"lang":"nl","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"De Bruijn sequence; Mathematics; Combinatorics","score_opus":0.020482688134634705,"score_gpt":0.26444522987266283,"score_spread":0.24396254173802812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1153974305","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7527996,0.0010522148,0.105309084,0.0031439944,0.00032802063,0.0000749124,0.0006965704,0.00060141017,0.13599423],"genre_scores_gemma":[0.9632281,0.0006002328,0.013216205,0.0004202571,0.00037539302,0.0001110083,0.00042092134,0.00017170444,0.021456257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998809,0.0003440103,0.00005770472,0.0002229055,0.00029243567,0.0002739116],"domain_scores_gemma":[0.9934309,0.004316034,0.0005844259,0.0005922355,0.0002981004,0.0007782932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012358858,0.00096363685,0.0014037859,0.0033705058,0.002435299,0.005633085,0.0019421403,0.0017101452,0.009257407],"category_scores_gemma":[0.0057068975,0.0009938802,0.0008203936,0.00237574,0.0033332885,0.006424702,0.0021437337,0.0033644596,0.0011908057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011494181,0.000034813962,0.00025092842,0.000052424835,0.00001678125,0.00009146594,0.00020401736,0.0024640085,0.0017445997,0.9885915,0.0014375917,0.0049969917],"study_design_scores_gemma":[0.000034236138,0.000026692542,0.0003075754,0.000030525498,0.000027250979,0.00017342679,0.00006012275,0.014839243,0.0012834715,0.980112,0.0030816875,0.000023855226],"about_ca_topic_score_codex":0.0006052087,"about_ca_topic_score_gemma":0.0007115798,"teacher_disagreement_score":0.009257407,"about_ca_system_score_codex":0.0015613099,"about_ca_system_score_gemma":0.0007093692,"threshold_uncertainty_score":0.030969083},"labels":[],"label_agreement":null},{"id":"W115503190","doi":"","title":"Contractible Edges and Bowties in a k-Connected Graph.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Contractible space; Mathematics; Combinatorics; Graph","score_opus":0.021879418466877288,"score_gpt":0.2572238948136041,"score_spread":0.23534447634672678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W115503190","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7255126,0.0012534608,0.13006724,0.0030931411,0.00038744937,0.0001014052,0.0008742842,0.00039894375,0.1383114],"genre_scores_gemma":[0.89602023,0.0011217402,0.046976335,0.0005190278,0.00023979356,0.00011396828,0.00083360256,0.00018919315,0.053986102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994941,0.000092734845,0.000030229357,0.00014202774,0.00011630601,0.00012457148],"domain_scores_gemma":[0.99751663,0.0010888625,0.00040632373,0.00025011183,0.00020991747,0.0005282541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043755354,0.00043102028,0.00055682875,0.0017327392,0.0024706975,0.0027299125,0.0010931742,0.0016900637,0.013987519],"category_scores_gemma":[0.0039635277,0.0005700744,0.000538694,0.0020959857,0.0031649754,0.0071963696,0.0033478688,0.0030205487,0.0016082128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009763252,0.000033312168,0.0006159447,0.00007985041,0.000011991442,0.00027298334,0.00053616805,0.0011606257,0.0019307304,0.97917867,0.0027824298,0.013299592],"study_design_scores_gemma":[0.000024417193,0.000021548467,0.0007619659,0.000050633374,0.000021060401,0.0003779363,0.00049934426,0.0040246556,0.00096942496,0.983108,0.010119391,0.000021616122],"about_ca_topic_score_codex":0.0015606855,"about_ca_topic_score_gemma":0.0022360852,"teacher_disagreement_score":0.013987519,"about_ca_system_score_codex":0.00079812395,"about_ca_system_score_gemma":0.00042117684,"threshold_uncertainty_score":0.046792865},"labels":[],"label_agreement":null},{"id":"W115874132","doi":"","title":"Vertex-Disjoint Short Cycles Containing Specified Edges in a Graph.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Disjoint sets; Graph","score_opus":0.02408683008824998,"score_gpt":0.2769357215780593,"score_spread":0.2528488914898093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W115874132","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5750106,0.0026095498,0.33694342,0.0011037601,0.00084755674,0.00058882195,0.0058127916,0.0014149129,0.07566861],"genre_scores_gemma":[0.78928727,0.0013087477,0.162403,0.0006088561,0.00015759126,0.00071186974,0.0058234166,0.00047827553,0.039221022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993191,0.00017697047,0.000086059554,0.00015776404,0.00014070993,0.00011955674],"domain_scores_gemma":[0.99696475,0.0010698489,0.0006318002,0.00049701595,0.0005014977,0.00033503145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004030433,0.0007032332,0.00057857734,0.0015418021,0.0019039841,0.0015041219,0.0012533261,0.0012819489,0.008704733],"category_scores_gemma":[0.0038990243,0.0005298965,0.0006044576,0.0021927496,0.00083154446,0.0028277887,0.0017358327,0.000834545,0.0017222426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011774084,0.00020244863,0.004054212,0.0007964578,0.00020494874,0.0026684701,0.0011565335,0.008761061,0.048857532,0.8272234,0.01478578,0.09011169],"study_design_scores_gemma":[0.000092222625,0.00028099326,0.0026854882,0.00031318647,0.00022638513,0.0020326474,0.0011365033,0.027351249,0.040166475,0.82000977,0.1056093,0.00009572741],"about_ca_topic_score_codex":0.0009940104,"about_ca_topic_score_gemma":0.0029736664,"teacher_disagreement_score":0.008704733,"about_ca_system_score_codex":0.00063009927,"about_ca_system_score_gemma":0.0008070013,"threshold_uncertainty_score":0.029120207},"labels":[],"label_agreement":null},{"id":"W116172775","doi":"","title":"On Uniquely 4-List Colorable Complete Multipartite Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Multipartite; Mathematics; Combinatorics; Discrete mathematics; Physics","score_opus":0.026826195966154015,"score_gpt":0.22970003075531611,"score_spread":0.2028738347891621,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W116172775","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48754254,0.0023383978,0.25912502,0.005028348,0.0004604958,0.00021513617,0.0045455764,0.0014633243,0.23928124],"genre_scores_gemma":[0.85852534,0.0017059236,0.08495778,0.0013490103,0.00029805838,0.00024638113,0.003678791,0.0005577829,0.048681017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881846,0.00037150295,0.000052743864,0.00022532298,0.00021968858,0.00031231786],"domain_scores_gemma":[0.9954536,0.0026576237,0.0004944542,0.0006284575,0.0003021809,0.0004637076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083599036,0.00081475626,0.00086160685,0.0015292147,0.0023336334,0.003721491,0.0016778383,0.0015794112,0.016855847],"category_scores_gemma":[0.0042890958,0.0007669806,0.00076942454,0.00243927,0.0019415386,0.006679879,0.0030157622,0.0024533677,0.0023318632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016255325,0.000084917745,0.00080968556,0.00023721157,0.000027707396,0.00014906898,0.0003633101,0.01217669,0.0028101942,0.9381306,0.018743154,0.026304973],"study_design_scores_gemma":[0.000035753823,0.000023318744,0.00063313125,0.000060451006,0.000023245804,0.00023147045,0.00030759073,0.01825003,0.0018306333,0.965684,0.012892784,0.000027604156],"about_ca_topic_score_codex":0.0018695545,"about_ca_topic_score_gemma":0.0035147036,"teacher_disagreement_score":0.016855847,"about_ca_system_score_codex":0.0018729351,"about_ca_system_score_gemma":0.0008627853,"threshold_uncertainty_score":0.05638838},"labels":[],"label_agreement":null},{"id":"W116493043","doi":"","title":"Some Families of Elegant and Harmonious Graphs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.010731187205573462,"score_gpt":0.21494676707697435,"score_spread":0.2042155798714009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W116493043","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3018752,0.0042982823,0.2815704,0.0070646172,0.0004507801,0.00015638048,0.0017426629,0.0013178914,0.40152377],"genre_scores_gemma":[0.8462035,0.0020963508,0.083662085,0.0015121741,0.00036893817,0.00028753342,0.001292083,0.0003808965,0.06419652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909115,0.00028627124,0.000035352325,0.0002156771,0.00022127847,0.00015029388],"domain_scores_gemma":[0.99743843,0.0012900837,0.00027786504,0.0004990443,0.00024870347,0.00024577059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009935233,0.0004386789,0.00045448245,0.0016415806,0.0025301352,0.0025636677,0.0011381458,0.0012168486,0.012741085],"category_scores_gemma":[0.0046741255,0.00058263977,0.0007337147,0.001494389,0.0021045425,0.0049685542,0.0024213952,0.0018190242,0.0014170011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019289213,0.000011911196,0.0001892929,0.00003393964,0.000007853189,0.00007024615,0.00016991374,0.0006183548,0.0003251732,0.98603004,0.005121687,0.0074022943],"study_design_scores_gemma":[0.000016301885,0.000009751751,0.0002603699,0.000020422825,0.000012476296,0.0002809884,0.00015190197,0.002964634,0.00035021835,0.97577864,0.020144984,0.0000092322],"about_ca_topic_score_codex":0.00060236675,"about_ca_topic_score_gemma":0.0010238761,"teacher_disagreement_score":0.012741085,"about_ca_system_score_codex":0.0012538013,"about_ca_system_score_gemma":0.00038444964,"threshold_uncertainty_score":0.042623162},"labels":[],"label_agreement":null},{"id":"W116667574","doi":"","title":"Clique Graphs of Planar Graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Clique-sum; Clique; Combinatorics; Chordal graph; Pathwidth; Indifference graph; Planar graph; 1-planar graph; Discrete mathematics; Graph; Line graph","score_opus":0.014745689355016434,"score_gpt":0.27422351416090585,"score_spread":0.25947782480588943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W116667574","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2674714,0.0076141492,0.26300988,0.0070214802,0.0011239164,0.00030179895,0.0059246514,0.0016408032,0.445892],"genre_scores_gemma":[0.8587222,0.0044916905,0.055722352,0.00095054624,0.0009420156,0.00017452544,0.0051657027,0.00050613534,0.0733248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995652,0.00012294238,0.000013304497,0.00011164893,0.000104929684,0.00008189267],"domain_scores_gemma":[0.9980925,0.0010426166,0.00027413675,0.00024130385,0.00016365832,0.00018585498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029352336,0.0004900383,0.00049974985,0.0016388716,0.0014848285,0.002054204,0.0008984553,0.0010305238,0.018835561],"category_scores_gemma":[0.002854039,0.00052339985,0.0006038535,0.0019020992,0.0011227106,0.00349508,0.001147336,0.0016539838,0.00224415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008253228,0.00004752837,0.0008159188,0.00023189084,0.00003861502,0.00024626902,0.0002250976,0.003497009,0.0034213706,0.9354151,0.028981972,0.02699686],"study_design_scores_gemma":[0.000031945965,0.000021865724,0.0015435949,0.000053456075,0.000040807372,0.00047067716,0.00020218875,0.013199014,0.0017082022,0.9410726,0.04163709,0.000018498447],"about_ca_topic_score_codex":0.0023595754,"about_ca_topic_score_gemma":0.0043179854,"teacher_disagreement_score":0.018835561,"about_ca_system_score_codex":0.0008483435,"about_ca_system_score_gemma":0.00048313197,"threshold_uncertainty_score":0.06301129},"labels":[],"label_agreement":null},{"id":"W116778035","doi":"","title":"On the Geodetic Covers and Geodetic Bases of the Composition G[Km].","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Historical Geography and Cartography","field":"Social Sciences","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Geodetic datum; Composition (language); Geodesy; Mathematics; Geology; Linguistics","score_opus":0.005709395313256532,"score_gpt":0.20771634667876845,"score_spread":0.20200695136551192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W116778035","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17363039,0.009797192,0.40813577,0.006209848,0.001414277,0.00019450538,0.008788173,0.00090409984,0.39092577],"genre_scores_gemma":[0.7385263,0.0067944666,0.1513196,0.0016640705,0.0022823405,0.0003345052,0.008866295,0.0010208815,0.08919156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847645,0.00041563442,0.00016872016,0.00042617886,0.0003565088,0.00015663821],"domain_scores_gemma":[0.9967722,0.0014675688,0.00031772896,0.0006252694,0.0005272838,0.0002898102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017111567,0.000988053,0.0012498201,0.005367253,0.0026283294,0.006131083,0.0017434583,0.0010330579,0.020283092],"category_scores_gemma":[0.005586284,0.0007934598,0.0010368174,0.0061446815,0.0053137955,0.012017293,0.003936443,0.002929374,0.0046161055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029823774,0.000012611812,0.00042135845,0.000047364418,0.000012635071,0.00005977901,0.00019477167,0.0007443383,0.00022008808,0.9828655,0.004038298,0.011353274],"study_design_scores_gemma":[0.000012126319,0.000013735548,0.0011588929,0.000053058102,0.0000194407,0.00024170162,0.00025842394,0.0023878813,0.00024957894,0.95703644,0.038549762,0.000019069339],"about_ca_topic_score_codex":0.0039002262,"about_ca_topic_score_gemma":0.004680663,"teacher_disagreement_score":0.020283092,"about_ca_system_score_codex":0.0017636897,"about_ca_system_score_gemma":0.00077068637,"threshold_uncertainty_score":0.06785375},"labels":[],"label_agreement":null},{"id":"W116901816","doi":"","title":"Independent Sums of Arithmetic Progressions in Km-free Graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arithmetic; Discrete mathematics; Combinatorics","score_opus":0.015359571693553505,"score_gpt":0.2857425302751914,"score_spread":0.2703829585816379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W116901816","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5827581,0.0023547192,0.14154463,0.0021660298,0.00081839133,0.00013129886,0.00097599515,0.0009767801,0.26827404],"genre_scores_gemma":[0.92357194,0.00055622647,0.023363458,0.00036781267,0.00048079173,0.00012714829,0.0005608088,0.000226278,0.050745565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991673,0.00018924422,0.000056922465,0.00014546241,0.00025398386,0.0001870805],"domain_scores_gemma":[0.9975165,0.0013728538,0.00029272283,0.00022435344,0.0002555008,0.00033796814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069735025,0.0006320848,0.000739734,0.0026268647,0.00224379,0.0031376043,0.0013540805,0.00093523564,0.013199909],"category_scores_gemma":[0.004786571,0.0005823616,0.0007719594,0.0016937605,0.0020164798,0.0054870523,0.002850644,0.0022952612,0.0028299612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012268222,0.000056810815,0.00055737403,0.00013036237,0.000020114683,0.00028837682,0.00036408418,0.0016534248,0.0019991128,0.97376174,0.004536313,0.016509552],"study_design_scores_gemma":[0.000018327102,0.00001801336,0.00036204234,0.000030726675,0.000023679151,0.00030823663,0.00009832667,0.0041414886,0.0012814051,0.9890603,0.0046394924,0.000018048248],"about_ca_topic_score_codex":0.0005364259,"about_ca_topic_score_gemma":0.0011782696,"teacher_disagreement_score":0.013199909,"about_ca_system_score_codex":0.0008504713,"about_ca_system_score_gemma":0.00058577355,"threshold_uncertainty_score":0.04415804},"labels":[],"label_agreement":null},{"id":"W116960971","doi":"","title":"Four Colour Classes in Projective Planes with Non-Fano Quads.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fano plane; Mathematics; Projective test; Combinatorics; Pure mathematics","score_opus":0.006909749877575993,"score_gpt":0.2035340965721297,"score_spread":0.1966243466945537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W116960971","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7260065,0.00087323104,0.07336024,0.0016291465,0.00035138612,0.00009877961,0.0005817111,0.00037162504,0.19672734],"genre_scores_gemma":[0.9656479,0.00026789264,0.013403501,0.00017872459,0.000053679076,0.000035292745,0.0002993707,0.00008452156,0.020029213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994355,0.00012963536,0.000025747986,0.00009376012,0.000110686284,0.00020468999],"domain_scores_gemma":[0.99892575,0.0003719637,0.00014607956,0.00012842797,0.00013474008,0.00029305476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046442705,0.000602305,0.00044627686,0.0021749744,0.002341266,0.003943674,0.0008190075,0.0013996557,0.0119827],"category_scores_gemma":[0.0014782329,0.0004749609,0.00063705066,0.0012117346,0.0034450023,0.0026096946,0.0017966101,0.0014507517,0.0011668779],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009442244,0.000021533406,0.00068952295,0.000027312126,0.000007853434,0.0001659199,0.00023953337,0.0011134217,0.0013360442,0.9870394,0.0017784828,0.0074865143],"study_design_scores_gemma":[0.00006324234,0.000044494587,0.0018081965,0.00005190141,0.00002392177,0.00048788605,0.00059602835,0.0077526565,0.0023527257,0.97159564,0.015185148,0.000038139482],"about_ca_topic_score_codex":0.0029778995,"about_ca_topic_score_gemma":0.0034145373,"teacher_disagreement_score":0.0119827,"about_ca_system_score_codex":0.0016426936,"about_ca_system_score_gemma":0.00049677695,"threshold_uncertainty_score":0.04008615},"labels":[],"label_agreement":null},{"id":"W117081657","doi":"","title":"Some Identities Related to Ramanujan's Tau Function.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Ramanujan's sum; Mathematics; Ramanujan tau function; Function (biology); Pure mathematics; Combinatorics; Evolutionary biology","score_opus":0.023874831380233327,"score_gpt":0.29343753689958824,"score_spread":0.2695627055193549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W117081657","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12657525,0.016730983,0.116667,0.0082725175,0.003247031,0.00007776912,0.0004306087,0.00026873712,0.72773004],"genre_scores_gemma":[0.8107283,0.00871003,0.035204973,0.0019548445,0.0039454442,0.00012643368,0.00041250425,0.0002032196,0.13871424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994381,0.00016544915,0.000026054247,0.000059967388,0.00022705585,0.000083221785],"domain_scores_gemma":[0.9991954,0.00030735962,0.00009391333,0.00011006965,0.00018487194,0.00010845106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011591199,0.0006019601,0.00053952285,0.0023441545,0.0026452157,0.002869151,0.0009426972,0.0012565228,0.009745966],"category_scores_gemma":[0.0029475456,0.0003081065,0.0008129617,0.0015429226,0.0026533068,0.004717442,0.0017755554,0.0030170525,0.0022658026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027864942,0.000006279144,0.00003544069,0.000012186226,0.0000015142033,0.000038744147,0.0000711467,0.000088226225,0.00011632742,0.9958301,0.00152061,0.0022766478],"study_design_scores_gemma":[0.0000027835758,0.000004193889,0.00008089582,0.000011096852,0.000002594912,0.00009681657,0.000035345183,0.0007798115,0.00011186782,0.9933216,0.0055484795,0.0000044962503],"about_ca_topic_score_codex":0.0009329515,"about_ca_topic_score_gemma":0.0010393788,"teacher_disagreement_score":0.009745966,"about_ca_system_score_codex":0.0012403907,"about_ca_system_score_gemma":0.0007884886,"threshold_uncertainty_score":0.032603443},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Pure mathematics; Computer science; World Wide Web","score_opus":0.01437029627748487,"score_gpt":0.26014009830978607,"score_spread":0.2457698020323012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W117706154","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46460894,0.0010452507,0.03032821,0.001179912,0.0013325759,0.000060390576,0.0010744855,0.0006367282,0.49973348],"genre_scores_gemma":[0.94672656,0.00069670053,0.005914775,0.00034332462,0.0001689824,0.00011327428,0.00052755885,0.00016252721,0.045346368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998223,0.000020951775,0.000010079939,0.000030851115,0.000062245526,0.000053513864],"domain_scores_gemma":[0.9997826,0.00004035004,0.00004267158,0.000035875375,0.000042117284,0.00005637426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009996186,0.0003373615,0.00033857426,0.0014917857,0.0012864633,0.0021535174,0.0004610419,0.00090051064,0.02514483],"category_scores_gemma":[0.00050717493,0.00015876908,0.00012091108,0.0008277888,0.0006722619,0.0014073584,0.0010673896,0.0007335904,0.0030197576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015001131,0.000041661806,0.00041064373,0.00009591224,0.000007731629,0.00021965674,0.00012819332,0.00088481745,0.013594606,0.9559667,0.0071782228,0.021321803],"study_design_scores_gemma":[0.000026617805,0.00013482451,0.0023442463,0.000103230195,0.000023514134,0.00062160526,0.00049908366,0.023033218,0.030574718,0.8970405,0.045544,0.000054316017],"about_ca_topic_score_codex":0.00037411365,"about_ca_topic_score_gemma":0.00049932627,"teacher_disagreement_score":0.02514483,"about_ca_system_score_codex":0.0005152345,"about_ca_system_score_gemma":0.0003461805,"threshold_uncertainty_score":0.08411789},"labels":[],"label_agreement":null},{"id":"W117787552","doi":"","title":"Some results in step domination of graphs.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.01554785319413933,"score_gpt":0.27828929668305524,"score_spread":0.2627414434889159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W117787552","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15721135,0.01815489,0.22913161,0.01019194,0.0011980854,0.00018786873,0.001989839,0.00097506534,0.58095944],"genre_scores_gemma":[0.80818295,0.016126715,0.059471235,0.003448391,0.0022179992,0.00035284407,0.0028268716,0.0006586923,0.10671418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894553,0.00025530843,0.000056506815,0.000174685,0.0003674888,0.00020048238],"domain_scores_gemma":[0.9948376,0.0036400747,0.00023759539,0.00040868772,0.0004468325,0.00042928167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016762807,0.0008478319,0.00083098916,0.0031797271,0.0022739475,0.0027223353,0.0017810727,0.001402676,0.015495753],"category_scores_gemma":[0.005842556,0.0005558078,0.0014129989,0.004338487,0.0031129536,0.0063323234,0.0027072036,0.004529672,0.0025579336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007295155,0.0000788531,0.0010566852,0.0004003659,0.000051451036,0.00034579754,0.0006141558,0.0028365701,0.0011805502,0.95235926,0.015469936,0.025533382],"study_design_scores_gemma":[0.000020969888,0.000026552523,0.00076828356,0.000054583445,0.00004040591,0.00030663144,0.00016435386,0.004112612,0.0007513091,0.978725,0.015014265,0.000014940752],"about_ca_topic_score_codex":0.0021277454,"about_ca_topic_score_gemma":0.0025904533,"teacher_disagreement_score":0.015495753,"about_ca_system_score_codex":0.0016932421,"about_ca_system_score_gemma":0.00077040074,"threshold_uncertainty_score":0.051838458},"labels":[],"label_agreement":null},{"id":"W117982534","doi":"","title":"Inducing regularization of graphs, multigraphs and pseudographs.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Regularization (linguistics); Combinatorics; Artificial intelligence; Computer science","score_opus":0.009950917027663106,"score_gpt":0.1897302259514448,"score_spread":0.1797793089237817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W117982534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070534915,0.00081039744,0.8836663,0.0009538017,0.00015817648,0.00005724179,0.00030513792,0.0007589829,0.042755008],"genre_scores_gemma":[0.53248256,0.0011342376,0.41622868,0.0006615369,0.0002594903,0.00019296726,0.0009961434,0.0005733752,0.047471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993499,0.0002427203,0.000027740301,0.00013292329,0.00020050844,0.000046145582],"domain_scores_gemma":[0.99762446,0.0011732795,0.00027475605,0.000520057,0.00025481498,0.00015260426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059133203,0.0003470398,0.00033480418,0.0008508871,0.0006549369,0.0009900725,0.0006535371,0.00064080505,0.004670442],"category_scores_gemma":[0.0036898928,0.00039172065,0.000407831,0.00076208834,0.0009290273,0.0016129991,0.0015010844,0.0018509192,0.00087103614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065688735,0.00006290844,0.0008741359,0.0001674756,0.00002782784,0.00013745931,0.0002279037,0.024677759,0.010665477,0.8628935,0.010637056,0.089562766],"study_design_scores_gemma":[0.000018367891,0.000056943936,0.00080317183,0.00006336502,0.000023138839,0.00039058394,0.00015339463,0.12852325,0.009232201,0.8249036,0.03581084,0.00002120852],"about_ca_topic_score_codex":0.0005341575,"about_ca_topic_score_gemma":0.002292303,"teacher_disagreement_score":0.004670442,"about_ca_system_score_codex":0.00069193676,"about_ca_system_score_gemma":0.00047534838,"threshold_uncertainty_score":0.015624166},"labels":[],"label_agreement":null},{"id":"W118134238","doi":"","title":"The Forcing Domination Numbers Of Some Graphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Forcing (mathematics); Mathematical analysis","score_opus":0.011385634558625768,"score_gpt":0.28273845909241435,"score_spread":0.27135282453378856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W118134238","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53455865,0.0013829506,0.08208351,0.004481517,0.0003704126,0.00009984154,0.0020192775,0.00050477637,0.37449896],"genre_scores_gemma":[0.9637728,0.0005605375,0.013717292,0.00031163817,0.00026591512,0.00014132682,0.0004887838,0.00010391193,0.020637676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912316,0.00020509218,0.00004582072,0.00016904646,0.00023786414,0.00021897862],"domain_scores_gemma":[0.992297,0.005533112,0.00052085886,0.0005068995,0.000510653,0.00063148345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001317429,0.000424428,0.0005066743,0.0028146089,0.0023964285,0.0032616805,0.000776945,0.00078548025,0.012140208],"category_scores_gemma":[0.0072868625,0.0003784623,0.0006563675,0.0015975123,0.003404275,0.004631655,0.0016326862,0.0022082184,0.0011712355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067442226,0.000014486564,0.0007140221,0.000044586497,0.000010281785,0.000056063906,0.00023126087,0.0010083191,0.0011137923,0.98810685,0.0025019979,0.00613091],"study_design_scores_gemma":[0.000021010968,0.000013112803,0.0011452432,0.000023638524,0.000014612214,0.0001680245,0.00012218239,0.003873678,0.001426181,0.9866535,0.006523128,0.000015691963],"about_ca_topic_score_codex":0.0010185995,"about_ca_topic_score_gemma":0.0016036798,"teacher_disagreement_score":0.012140208,"about_ca_system_score_codex":0.0018935809,"about_ca_system_score_gemma":0.000793007,"threshold_uncertainty_score":0.040613055},"labels":[],"label_agreement":null},{"id":"W1185566510","doi":"","title":"CONDITIONAL MATCHING PRECLUSION FOR THE STAR GRAPHS","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Matching (statistics); Star (game theory); Graph; Discrete mathematics; Statistics","score_opus":0.026630135662144224,"score_gpt":0.2579758320319657,"score_spread":0.2313456963698215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1185566510","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45928088,0.00076485454,0.49654034,0.0020984833,0.00012257442,0.0003461836,0.0013167352,0.00046086617,0.03906918],"genre_scores_gemma":[0.9086555,0.0005886051,0.08234028,0.00041517586,0.0001790176,0.0003139157,0.0012688676,0.00011480281,0.0061237277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981651,0.00041583125,0.00013135302,0.00056985614,0.00043097514,0.00028686936],"domain_scores_gemma":[0.99069595,0.0052331192,0.0012530001,0.0011218835,0.00077220576,0.000923722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016637993,0.0006107541,0.00086154527,0.0013877075,0.0015566117,0.0017691744,0.001646897,0.0013174746,0.0102075655],"category_scores_gemma":[0.015994191,0.00046649732,0.0010590864,0.00164465,0.0022937057,0.0054826066,0.002996083,0.0033047178,0.0007549364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057070993,0.00018100052,0.0036995602,0.0004324042,0.00006950628,0.00031386712,0.000452278,0.079295024,0.009188928,0.8302376,0.008548387,0.06701067],"study_design_scores_gemma":[0.000057126825,0.00011183737,0.001710226,0.000050878214,0.000034347446,0.00043605204,0.0001649997,0.18077946,0.0061628376,0.805053,0.0053934045,0.000045888817],"about_ca_topic_score_codex":0.0010060914,"about_ca_topic_score_gemma":0.00089474436,"teacher_disagreement_score":0.0102075655,"about_ca_system_score_codex":0.0014251276,"about_ca_system_score_gemma":0.0012603081,"threshold_uncertainty_score":0.03414768},"labels":[],"label_agreement":null},{"id":"W118923382","doi":"","title":"A Note on Neighborhood Unions and Independent Cycles.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Labor Movements and Unions","field":"Social Sciences","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Mathematical economics","score_opus":0.01158166227158456,"score_gpt":0.2819985040007784,"score_spread":0.27041684172919384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W118923382","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024366016,0.030768607,0.14885512,0.07450964,0.008590291,0.000079867714,0.00117984,0.00025780484,0.7113929],"genre_scores_gemma":[0.57332724,0.050352257,0.12162356,0.02531897,0.020503027,0.00051019376,0.0014986909,0.00051909673,0.20634694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868613,0.00054118404,0.0000622442,0.0002555473,0.00030284777,0.00015196441],"domain_scores_gemma":[0.9945363,0.0038442116,0.00023177636,0.0006312821,0.00040504325,0.0003515236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018011592,0.0004808128,0.0010461026,0.001940879,0.0038691922,0.003564363,0.001956419,0.0019345788,0.03179627],"category_scores_gemma":[0.007876822,0.00035794542,0.001305202,0.0038941659,0.005045311,0.010039204,0.004637761,0.005375476,0.003722835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008451805,0.000008177627,0.00014018531,0.00003451529,0.0000048847837,0.000036681926,0.000103091406,0.00019889172,0.000033871245,0.9817821,0.012641157,0.0050081],"study_design_scores_gemma":[0.0000036885872,0.0000044251647,0.00023316224,0.000026723017,0.000005111147,0.000037373222,0.00007882584,0.0003418239,0.000028540908,0.9645676,0.03466853,0.000004190525],"about_ca_topic_score_codex":0.005445531,"about_ca_topic_score_gemma":0.008752948,"teacher_disagreement_score":0.03179627,"about_ca_system_score_codex":0.0020474857,"about_ca_system_score_gemma":0.0013533713,"threshold_uncertainty_score":0.10636914},"labels":[],"label_agreement":null},{"id":"W118937142","doi":"","title":"Evolutionary Graphs on Two Levels.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.02267969934936548,"score_gpt":0.2519833874877529,"score_spread":0.22930368813838742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W118937142","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052738775,0.001177972,0.8361,0.0019086759,0.0003709178,0.00014862325,0.0005275079,0.000574885,0.106452726],"genre_scores_gemma":[0.50263494,0.0009555728,0.42864972,0.00072537555,0.00014000012,0.000282109,0.00084049,0.00029954847,0.06547229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930084,0.00022352458,0.000038399554,0.00017612189,0.00016190838,0.00009926016],"domain_scores_gemma":[0.99823004,0.0006684121,0.00013366419,0.0004891914,0.00023010655,0.00024857657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006287349,0.00038521475,0.0005596736,0.0011582242,0.0013981962,0.0023798516,0.0012428067,0.0015802362,0.020760164],"category_scores_gemma":[0.004271626,0.00040955163,0.00091741484,0.001155746,0.0014351207,0.002839689,0.0021234641,0.0019126539,0.0021666586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038362705,0.000039829854,0.00050728704,0.0000816246,0.000033879904,0.00017392519,0.00014745335,0.018209487,0.0016651658,0.9395474,0.003327906,0.03622754],"study_design_scores_gemma":[0.000023762832,0.0000323722,0.00047064121,0.000052298903,0.000034600183,0.00024553027,0.0001058171,0.055894908,0.00090365444,0.91212577,0.030090561,0.000020075893],"about_ca_topic_score_codex":0.0012566694,"about_ca_topic_score_gemma":0.0023664325,"teacher_disagreement_score":0.020760164,"about_ca_system_score_codex":0.0011771477,"about_ca_system_score_gemma":0.0007201346,"threshold_uncertainty_score":0.0694496},"labels":[],"label_agreement":null},{"id":"W11914327","doi":"10.1093/ije/31.1.240","title":"Some NP-Completeness Results on Partial Steiner Triple Systems and Parallel Classes.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Completeness (order theory); Steiner tree problem; Combinatorics; Steiner system; Discrete mathematics; Mathematical analysis","score_opus":0.01615037672060516,"score_gpt":0.2279742945901348,"score_spread":0.21182391786952964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W11914327","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25230947,0.006211665,0.51198107,0.036380153,0.0012725536,0.00077026576,0.014151144,0.0016573335,0.17526636],"genre_scores_gemma":[0.82527244,0.00446431,0.1289726,0.0045359577,0.0019283595,0.00093962095,0.00928304,0.00054302934,0.024060752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976247,0.0005342469,0.00021359535,0.0005065962,0.00067347166,0.00044740454],"domain_scores_gemma":[0.9757868,0.019629557,0.0009938411,0.0017189903,0.0012156572,0.0006550962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024394614,0.0011466498,0.0014238891,0.0016412617,0.0035709927,0.0042373277,0.002417925,0.002145295,0.016999295],"category_scores_gemma":[0.016219556,0.0010326309,0.003114505,0.0033223585,0.003507,0.011010532,0.003585069,0.00614145,0.0016075929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033459387,0.00022155403,0.0020764414,0.0010880994,0.000206414,0.0007242417,0.0012217356,0.032839227,0.0020380076,0.87060875,0.050221935,0.03841895],"study_design_scores_gemma":[0.000057808244,0.000026631496,0.00037234448,0.000042947726,0.000041130137,0.0003149108,0.000176152,0.020057514,0.00032076344,0.97297466,0.0055932137,0.000021868836],"about_ca_topic_score_codex":0.003681852,"about_ca_topic_score_gemma":0.004226469,"teacher_disagreement_score":0.016999295,"about_ca_system_score_codex":0.0028364086,"about_ca_system_score_gemma":0.0018800659,"threshold_uncertainty_score":0.056868315},"labels":[],"label_agreement":null},{"id":"W119157955","doi":"","title":"The bounds of spectral radius of graphs with a given size of independent set.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; RADIUS; Set (abstract data type); Combinatorics; Physics; Computer science; Quantum mechanics; Eigenvalues and eigenvectors","score_opus":0.019379539123824067,"score_gpt":0.25622385202278847,"score_spread":0.2368443128989644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W119157955","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4203913,0.016599521,0.38854334,0.008263337,0.0009167511,0.00014705707,0.0027035468,0.0015817975,0.16085337],"genre_scores_gemma":[0.9581073,0.0030144972,0.03137108,0.0005255449,0.0007280075,0.00020626563,0.0006812348,0.00039337346,0.004972541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970487,0.001060121,0.000101100406,0.0006262721,0.00066158973,0.000502221],"domain_scores_gemma":[0.9579966,0.031212475,0.0022015919,0.0037905362,0.002130273,0.0026684622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035574601,0.0013374788,0.001557235,0.0034244284,0.0017347289,0.0033955362,0.0035470542,0.0020388172,0.00795905],"category_scores_gemma":[0.040927824,0.00092789147,0.0011828971,0.0019552743,0.0033930081,0.007658106,0.003195387,0.0029131146,0.0017912383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074769516,0.00011595375,0.002953463,0.0004981778,0.00015944708,0.00022554667,0.0006164184,0.045128528,0.008832,0.8993096,0.016611405,0.024801655],"study_design_scores_gemma":[0.000053885135,0.000102745755,0.003280979,0.00015007485,0.00012823075,0.00071503845,0.00032218796,0.15863189,0.0065388298,0.82113177,0.008870213,0.0000741989],"about_ca_topic_score_codex":0.0009891198,"about_ca_topic_score_gemma":0.00082060084,"teacher_disagreement_score":0.00795905,"about_ca_system_score_codex":0.0020949924,"about_ca_system_score_gemma":0.0007901633,"threshold_uncertainty_score":0.026625633},"labels":[],"label_agreement":null},{"id":"W11995151","doi":"","title":"Improved bounds for the product of the domination and chromatic numbers of a graph.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Graph; Product (mathematics); Combinatorics; Discrete mathematics; Geometry","score_opus":0.009365343003639942,"score_gpt":0.2594016022767104,"score_spread":0.25003625927307044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W11995151","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08525094,0.01981763,0.67483354,0.0073346044,0.001973125,0.00031589196,0.00475429,0.0033267583,0.20239323],"genre_scores_gemma":[0.66847986,0.007285534,0.27464503,0.0015014834,0.0030197396,0.00087074307,0.0039128414,0.0017262604,0.03855846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99310076,0.0015411992,0.00031171093,0.0014435822,0.0025765544,0.0010262126],"domain_scores_gemma":[0.9571693,0.031003999,0.0016802374,0.004986067,0.0032942095,0.001866109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069771106,0.0034608373,0.0019528163,0.007943351,0.002008882,0.0063447896,0.007483885,0.0027908126,0.025236987],"category_scores_gemma":[0.040118802,0.0015551939,0.0023174898,0.0051751425,0.004734432,0.018590003,0.008097548,0.009120241,0.0059816935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012688454,0.0003708856,0.0050456002,0.00095591147,0.00032427843,0.00038644712,0.00081476494,0.04732993,0.011819212,0.7631891,0.04412256,0.12437242],"study_design_scores_gemma":[0.00010589447,0.00019298753,0.003561255,0.0002771899,0.00031469172,0.0006608383,0.00019739123,0.1749654,0.007835254,0.78085876,0.030885523,0.00014491241],"about_ca_topic_score_codex":0.0031371673,"about_ca_topic_score_gemma":0.0064612674,"teacher_disagreement_score":0.025236987,"about_ca_system_score_codex":0.0054775807,"about_ca_system_score_gemma":0.0020258636,"threshold_uncertainty_score":0.084426165},"labels":[],"label_agreement":null},{"id":"W120353176","doi":"","title":"A Counterexample to a Conjecture on Packing Two Copies of a Tree into its Third Power.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Counterexample; Mathematics; Conjecture; Tree (set theory); Combinatorics; Power (physics); Discrete mathematics; Physics","score_opus":0.0077309406380179,"score_gpt":0.22308949051499274,"score_spread":0.21535854987697484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W120353176","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3897408,0.003345493,0.15455225,0.08695118,0.006680952,0.00027296797,0.003089269,0.0023616324,0.35300538],"genre_scores_gemma":[0.9165839,0.0015781084,0.035593133,0.007786148,0.001851076,0.00026209885,0.0023924953,0.00051054184,0.033442505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968477,0.000818281,0.00018427527,0.0007370203,0.00070127915,0.0007114625],"domain_scores_gemma":[0.98221415,0.011841538,0.001169302,0.0028849444,0.0008265397,0.0010636138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001782735,0.00085055275,0.0017093623,0.0013363499,0.0067491313,0.004741355,0.0029019269,0.0067432616,0.02069548],"category_scores_gemma":[0.018504094,0.0012119118,0.0014531846,0.0033699838,0.0063110203,0.012024418,0.00579394,0.0062696827,0.0031050604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060002727,0.00021153728,0.0013602901,0.00025787074,0.00005869429,0.0016621202,0.0015173649,0.0035415106,0.001668503,0.8828672,0.0911988,0.015055969],"study_design_scores_gemma":[0.0001570881,0.00006283167,0.00054610294,0.00008624134,0.000048727565,0.0017626544,0.00081276346,0.008303131,0.0014541879,0.95638174,0.03033629,0.00004809736],"about_ca_topic_score_codex":0.002117992,"about_ca_topic_score_gemma":0.0016289351,"teacher_disagreement_score":0.02069548,"about_ca_system_score_codex":0.0015754686,"about_ca_system_score_gemma":0.0008795086,"threshold_uncertainty_score":0.0692333},"labels":[],"label_agreement":null},{"id":"W120583540","doi":"","title":"Associated Graphs of p-dimensional (0, 1)-matrices.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.005177347561728064,"score_gpt":0.18968011858260153,"score_spread":0.18450277102087348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W120583540","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32983232,0.0014444374,0.37552536,0.0029340056,0.0008247454,0.00024858027,0.0023541495,0.00074845005,0.28608787],"genre_scores_gemma":[0.8913967,0.0010048411,0.044746038,0.000697497,0.00033036873,0.00025701945,0.0012141847,0.00017422614,0.06017919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994103,0.00017024258,0.000022141006,0.00011001209,0.00015822807,0.00012906859],"domain_scores_gemma":[0.9982998,0.00063960184,0.00036741572,0.00017956116,0.00028827478,0.00022552535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025054745,0.0005475231,0.0003585111,0.0018728835,0.0012232873,0.0018882935,0.0007470043,0.0010841871,0.01633183],"category_scores_gemma":[0.0029088918,0.0003080049,0.00036276624,0.00143003,0.00086123904,0.0019034983,0.0012823029,0.0013014216,0.002818734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058359536,0.000037021928,0.0003274259,0.00005987451,0.000011450826,0.00026163165,0.00014654497,0.0022706708,0.002371242,0.97701424,0.0055624484,0.011879108],"study_design_scores_gemma":[0.000022119735,0.000021374099,0.0006159081,0.000027443892,0.000010442128,0.00045282746,0.00012680794,0.015551287,0.0016824694,0.9696008,0.011867781,0.000020674841],"about_ca_topic_score_codex":0.00074917905,"about_ca_topic_score_gemma":0.0011308467,"teacher_disagreement_score":0.01633183,"about_ca_system_score_codex":0.0006848925,"about_ca_system_score_gemma":0.0005351703,"threshold_uncertainty_score":0.054635406},"labels":[],"label_agreement":null},{"id":"W120972193","doi":"","title":"A Combinatorial Proof of Wilson's Theorem.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorial proof; Discrete mathematics; Combinatorics; Calculus (dental); Pure mathematics; Medicine","score_opus":0.016318982024278783,"score_gpt":0.2819520470772014,"score_spread":0.2656330650529226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W120972193","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0435779,0.007399012,0.216033,0.01342988,0.0055330116,0.00009279811,0.0011221818,0.00087677897,0.7119356],"genre_scores_gemma":[0.742687,0.005649978,0.11610072,0.0048952335,0.0035556718,0.00027564258,0.0011663624,0.0006384426,0.12503095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995073,0.000116860014,0.000022047952,0.00008383528,0.00020926337,0.000060705905],"domain_scores_gemma":[0.99872404,0.0006287172,0.00010284927,0.00013973993,0.00026290896,0.00014175274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006475223,0.00079230993,0.0006492321,0.0019469098,0.0018009389,0.0020391284,0.001452304,0.0009932631,0.020456042],"category_scores_gemma":[0.0032381632,0.00040039097,0.0009234824,0.0016809193,0.0022325113,0.004050437,0.002257973,0.0025673197,0.0032863128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000108549875,0.000021633556,0.00008847134,0.00008579223,0.000011790746,0.0001270437,0.00006874553,0.0002354648,0.00038537328,0.9762274,0.014075467,0.008661841],"study_design_scores_gemma":[0.000016301812,0.0000072117464,0.00020198867,0.000040473242,0.000013561001,0.00022672478,0.00003874814,0.0011995286,0.00030698453,0.97442394,0.02351458,0.000010020457],"about_ca_topic_score_codex":0.0012286905,"about_ca_topic_score_gemma":0.0019902503,"teacher_disagreement_score":0.020456042,"about_ca_system_score_codex":0.0011024456,"about_ca_system_score_gemma":0.0006227384,"threshold_uncertainty_score":0.06843227},"labels":[],"label_agreement":null},{"id":"W121029182","doi":"","title":"Application of Upper and Lower Bounds for the Domination Number to Vizing's Conjecture.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Conjecture; Domination analysis; Combinatorics; Upper and lower bounds; Mathematical analysis","score_opus":0.011756391269372562,"score_gpt":0.28477292846113883,"score_spread":0.2730165371917663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W121029182","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.112520285,0.012522497,0.30020988,0.035453346,0.002849906,0.0001726938,0.0014537631,0.0011323846,0.5336852],"genre_scores_gemma":[0.90367925,0.0043881354,0.05937597,0.0028667815,0.0027250932,0.00032725264,0.0010379779,0.00037569503,0.025223816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966809,0.0010532805,0.00018328075,0.00063951046,0.00095057016,0.0004923373],"domain_scores_gemma":[0.9579508,0.032720286,0.0012411033,0.0043435,0.0023258163,0.0014185852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057116593,0.0009805135,0.0013597272,0.004406658,0.002890422,0.004849649,0.0035575903,0.0029722007,0.016739123],"category_scores_gemma":[0.05086816,0.0007048811,0.0013615392,0.0033813831,0.006608352,0.013201554,0.0059722005,0.007672381,0.0021556458],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010191259,0.00004752782,0.00064473215,0.0000836388,0.000015139144,0.000055087407,0.00018617693,0.004180997,0.00040254393,0.9744213,0.008604667,0.011256323],"study_design_scores_gemma":[0.0000097606635,0.000008072027,0.00016792012,0.0000239558,0.0000083791365,0.000047390884,0.000041998414,0.009883423,0.0002650056,0.9861826,0.0033518113,0.000009703131],"about_ca_topic_score_codex":0.0022591637,"about_ca_topic_score_gemma":0.002261621,"teacher_disagreement_score":0.016739123,"about_ca_system_score_codex":0.003575952,"about_ca_system_score_gemma":0.0014619888,"threshold_uncertainty_score":0.055997968},"labels":[],"label_agreement":null},{"id":"W121264847","doi":"","title":"An optimal algorithm for a parallel cutting problem.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Algorithm; Mathematical optimization","score_opus":0.009004668301635259,"score_gpt":0.23071513929540002,"score_spread":0.22171047099376476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W121264847","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006214993,0.00036648216,0.9753916,0.00036053295,0.00017062096,0.00015597075,0.00019642511,0.0015433619,0.015600035],"genre_scores_gemma":[0.03864518,0.0002908627,0.95462537,0.000109417415,0.000072044735,0.00029311015,0.00042039817,0.00028102956,0.00526254],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992767,0.00013895587,0.000048910857,0.00017864897,0.00024116613,0.00011555365],"domain_scores_gemma":[0.99933213,0.00032178513,0.000038217353,0.00015796632,0.00010883935,0.0000409652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077187817,0.0012566677,0.0009208925,0.0013041805,0.001017965,0.0014497559,0.0020580501,0.0019583595,0.019499738],"category_scores_gemma":[0.0037839208,0.0008179605,0.001213381,0.00210499,0.00073384837,0.002552993,0.0019284998,0.0021636062,0.0041614454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042748547,0.00039425152,0.00054302654,0.00043470986,0.00008523597,0.00015823988,0.00014386047,0.17122924,0.006521326,0.10373403,0.041332614,0.67499596],"study_design_scores_gemma":[0.0003655169,0.000120907585,0.00029625848,0.000068484536,0.00006012689,0.00028435013,0.00007146643,0.7954521,0.00275981,0.17802788,0.022467025,0.000026042382],"about_ca_topic_score_codex":0.0029861762,"about_ca_topic_score_gemma":0.0047580306,"teacher_disagreement_score":0.019499738,"about_ca_system_score_codex":0.0011447186,"about_ca_system_score_gemma":0.0018916792,"threshold_uncertainty_score":0.06523317},"labels":[],"label_agreement":null},{"id":"W121426693","doi":"","title":"Closest Approximations to Real Numbers.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Approximations of π; Applied mathematics","score_opus":0.016039097992457063,"score_gpt":0.28864665079401153,"score_spread":0.27260755280155446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W121426693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059619397,0.0038394276,0.9539614,0.0009943148,0.0014625556,0.000052573974,0.00028639217,0.00057392573,0.032867618],"genre_scores_gemma":[0.23411478,0.0060500004,0.7094604,0.00096839375,0.0013146495,0.00032736742,0.0011647415,0.0010982924,0.045501363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99518037,0.0019318933,0.00033005927,0.0006887934,0.0016380418,0.0002309758],"domain_scores_gemma":[0.989012,0.0052985516,0.0007813624,0.0032329345,0.0012890113,0.00038623106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002995975,0.0012049386,0.00152851,0.0032513833,0.0013888619,0.0051176194,0.0021667639,0.0021417863,0.018659571],"category_scores_gemma":[0.05140623,0.00071723614,0.0010689823,0.003254709,0.0026363565,0.005997512,0.004760174,0.0048830765,0.009301202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021329895,0.000052999603,0.0005833107,0.00034075213,0.00008054422,0.00008317867,0.00028189115,0.038715336,0.0009546205,0.80188,0.019957189,0.13685693],"study_design_scores_gemma":[0.000029427913,0.00003807899,0.0001654505,0.00016605672,0.000022640546,0.00017198289,0.00014026772,0.090039626,0.0011179989,0.855982,0.052101545,0.000025013664],"about_ca_topic_score_codex":0.0014096999,"about_ca_topic_score_gemma":0.0020807497,"teacher_disagreement_score":0.018659571,"about_ca_system_score_codex":0.0016339102,"about_ca_system_score_gemma":0.0012316393,"threshold_uncertainty_score":0.062422454},"labels":[],"label_agreement":null},{"id":"W1215136999","doi":"","title":"On 3-restricted edge connectivity of Cartesian product graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Enhanced Data Rates for GSM Evolution; Product (mathematics); Mathematics; Computer science; Combinatorics; Graph product; Discrete mathematics; Graph; 1-planar graph; Chordal graph; Geometry; Artificial intelligence","score_opus":0.0142915018899416,"score_gpt":0.23321566790385245,"score_spread":0.21892416601391085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1215136999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3557304,0.001031981,0.5285893,0.0005606312,0.000097676326,0.000092548136,0.0006576119,0.00044672954,0.11279312],"genre_scores_gemma":[0.9438958,0.00060359586,0.050154965,0.00018849786,0.00006410931,0.00010224844,0.0005058039,0.000079037774,0.0044059064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994618,0.00018698133,0.00003666089,0.00012138781,0.0001119219,0.00008128766],"domain_scores_gemma":[0.99856985,0.00075996306,0.00020869817,0.00018800459,0.00019321259,0.00008034499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004940096,0.00038700693,0.00031753027,0.0010131969,0.0006797095,0.00085560675,0.0005967256,0.00063027407,0.008007058],"category_scores_gemma":[0.0024627983,0.00027232827,0.0003887068,0.00090077927,0.0012976998,0.0028924677,0.0010779353,0.000983856,0.0006872919],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057824527,0.000017272921,0.00068070233,0.00010933139,0.000012240979,0.00046855805,0.00042285866,0.007178708,0.004177129,0.97359776,0.0015659863,0.011711657],"study_design_scores_gemma":[0.000018939056,0.000060084396,0.0015524976,0.00008021317,0.000039075963,0.001372281,0.00036323824,0.045866586,0.0031866545,0.9334854,0.013940075,0.000034926667],"about_ca_topic_score_codex":0.0007511074,"about_ca_topic_score_gemma":0.001015421,"teacher_disagreement_score":0.008007058,"about_ca_system_score_codex":0.0003469227,"about_ca_system_score_gemma":0.00020554595,"threshold_uncertainty_score":0.026786268},"labels":[],"label_agreement":null},{"id":"W122461578","doi":"","title":"On Sets of Orthogonal d-Cubes.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Pure mathematics","score_opus":0.018300753752118277,"score_gpt":0.25539563314410674,"score_spread":0.23709487939198845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W122461578","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.151291,0.0043257535,0.6607005,0.0016476259,0.0009896609,0.00016205193,0.0021588274,0.00054152345,0.17818302],"genre_scores_gemma":[0.60340476,0.005377249,0.31405172,0.0014319617,0.0009845465,0.0005397087,0.004849302,0.0005813003,0.06877947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844736,0.0003783649,0.00015015967,0.00025990978,0.0005401993,0.00022391247],"domain_scores_gemma":[0.9972933,0.0012243184,0.0003399537,0.00043037088,0.0004178917,0.00029421496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085183466,0.0008845073,0.0009632486,0.0033993267,0.0017972157,0.004005011,0.001177076,0.00072740513,0.011531954],"category_scores_gemma":[0.005112206,0.00057538773,0.0011670503,0.0031789325,0.0023434367,0.004565646,0.0057730605,0.0023530147,0.0030061216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006197267,0.000020193205,0.00036834722,0.000087168904,0.000021143718,0.000096691496,0.0001302948,0.0019339832,0.0008608585,0.96719736,0.004326836,0.024895186],"study_design_scores_gemma":[0.000014539874,0.00001954413,0.0002892726,0.000058520858,0.000012694342,0.00027763308,0.00014443527,0.01004931,0.00079916517,0.97264534,0.015674576,0.000014890923],"about_ca_topic_score_codex":0.0011666679,"about_ca_topic_score_gemma":0.0017200385,"teacher_disagreement_score":0.011531954,"about_ca_system_score_codex":0.0012665855,"about_ca_system_score_gemma":0.0005251394,"threshold_uncertainty_score":0.038578212},"labels":[],"label_agreement":null},{"id":"W122619311","doi":"","title":"Edge Labelings with a Condition at Distance Two.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Artificial intelligence; Computer science","score_opus":0.007497982961011388,"score_gpt":0.22061201837693925,"score_spread":0.21311403541592785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W122619311","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37648886,0.0012626717,0.2895401,0.009190193,0.0017138966,0.00033692524,0.0066578016,0.0033674168,0.31144217],"genre_scores_gemma":[0.8155928,0.0006019636,0.13211705,0.0023101328,0.00045247294,0.00022338514,0.0053926464,0.00069779,0.042611748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979328,0.0004938073,0.00018293766,0.0005362232,0.00038227165,0.00047198715],"domain_scores_gemma":[0.9905033,0.004858275,0.0007884168,0.0021642942,0.0007271525,0.00095857895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014190652,0.0006519949,0.00090981805,0.0014339001,0.0035757702,0.0036095094,0.0020145953,0.0030634953,0.025481254],"category_scores_gemma":[0.0119054485,0.00061572477,0.0009228575,0.0019630557,0.0023672555,0.00722119,0.003442721,0.0038271584,0.004196583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007931845,0.00029699324,0.0027003377,0.00031424937,0.00004317718,0.00037768233,0.00044754538,0.0039425874,0.008103656,0.8862545,0.04393321,0.052792896],"study_design_scores_gemma":[0.00011226447,0.00009583698,0.0013307277,0.00009358192,0.000054917524,0.0007387759,0.0007411321,0.013208927,0.008980276,0.9331441,0.04144348,0.000055985936],"about_ca_topic_score_codex":0.001499847,"about_ca_topic_score_gemma":0.0021042067,"teacher_disagreement_score":0.025481254,"about_ca_system_score_codex":0.0016390622,"about_ca_system_score_gemma":0.0013210324,"threshold_uncertainty_score":0.085243285},"labels":[],"label_agreement":null},{"id":"W122684963","doi":"","title":"Matricial construction of k-colourings on square lattice.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Square lattice; Square (algebra); Combinatorics; Lattice (music); Discrete mathematics; Geometry; Condensed matter physics; Physics","score_opus":0.005344730187852847,"score_gpt":0.1940213375665132,"score_spread":0.18867660737866038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W122684963","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26371768,0.00064713834,0.45086792,0.00234004,0.0013517789,0.00023315138,0.0010013081,0.0014411826,0.27839985],"genre_scores_gemma":[0.8341544,0.00037237635,0.11094132,0.00051557785,0.00021155276,0.0001229807,0.0005411042,0.00027697373,0.052863713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943167,0.00014183087,0.000025615558,0.00010819196,0.0001495533,0.00014318626],"domain_scores_gemma":[0.9993223,0.00016577033,0.00006367617,0.0001635089,0.000126043,0.00015861948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029866918,0.000355651,0.00034497963,0.00087287265,0.0013924695,0.001497973,0.0008864382,0.00069038355,0.0150407],"category_scores_gemma":[0.0011656805,0.00029776336,0.0005215324,0.0008104063,0.0014063851,0.0020156999,0.0019235305,0.0015365946,0.0029650596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036948615,0.000035152636,0.00009373089,0.000038632003,0.000005356164,0.00011569265,0.00019734504,0.0009892532,0.005059497,0.98119044,0.0035360751,0.00870188],"study_design_scores_gemma":[0.00003099462,0.000033588658,0.00024816408,0.000020434796,0.000009819441,0.00019492857,0.00016378086,0.008621174,0.0041539534,0.96869254,0.01780441,0.000026229816],"about_ca_topic_score_codex":0.0012197392,"about_ca_topic_score_gemma":0.002667793,"teacher_disagreement_score":0.0150407,"about_ca_system_score_codex":0.00080120773,"about_ca_system_score_gemma":0.0006142597,"threshold_uncertainty_score":0.050316155},"labels":[],"label_agreement":null},{"id":"W122717491","doi":"","title":"Nested Partially Balanced Incomplete Block Design.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Optimal Experimental Design Methods","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Block (permutation group theory); Combinatorics","score_opus":0.12638211415481782,"score_gpt":0.4114496631792185,"score_spread":0.2850675490244007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W122717491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010639943,0.00045597786,0.981087,0.00014279658,0.00015128149,0.002956398,0.00064931595,0.0002675813,0.0036496741],"genre_scores_gemma":[0.15533288,0.00039337773,0.82437044,0.00025661787,0.0000913916,0.014085127,0.0006380585,0.000102310114,0.0047298134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.94213307,0.04722311,0.0014215088,0.0038991023,0.004262325,0.0010608825],"domain_scores_gemma":[0.93108475,0.053820625,0.0039927615,0.0074589835,0.0026225091,0.0010204351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.040256336,0.0021452368,0.0040991623,0.0009052132,0.00076825154,0.0017031619,0.0023796866,0.0019295013,0.021394106],"category_scores_gemma":[0.09518063,0.0015524337,0.0016767635,0.0010796917,0.0024048965,0.0025342011,0.0020037766,0.0021177863,0.0024137648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.01833033,0.0017395557,0.0031160496,0.0035656027,0.0016848008,0.00019589347,0.0006137753,0.13580923,0.009073848,0.5532517,0.0058803195,0.2667389],"study_design_scores_gemma":[0.00664088,0.00940158,0.0025209961,0.00075870956,0.001307575,0.00017247313,0.00013748226,0.46232367,0.009974372,0.4736065,0.033003043,0.00015268297],"about_ca_topic_score_codex":0.0010874884,"about_ca_topic_score_gemma":0.0020521728,"teacher_disagreement_score":0.040256336,"about_ca_system_score_codex":0.0017944571,"about_ca_system_score_gemma":0.004774939,"threshold_uncertainty_score":0.21289837},"labels":[],"label_agreement":null},{"id":"W122819079","doi":"","title":"Cyclic and Rotational Decompositions of K_n into Stars.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematics and Applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Stars; Mathematics; Combinatorics; Astrophysics; Astronomy; Physics","score_opus":0.024408627905873642,"score_gpt":0.31141738908750927,"score_spread":0.28700876118163565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W122819079","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49117276,0.00196371,0.1710639,0.001839327,0.0008521922,0.00012938702,0.0016094684,0.0006416576,0.33072755],"genre_scores_gemma":[0.8717329,0.0008384535,0.050778672,0.0006126134,0.00023745219,0.00006885846,0.0016744053,0.00024679277,0.073809914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999567,0.00009076456,0.00003357206,0.000090506626,0.000082238665,0.00013594535],"domain_scores_gemma":[0.9992526,0.00013195304,0.00016342157,0.00016228798,0.00013626754,0.00015343548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035684797,0.00029273218,0.00026573677,0.0007404947,0.0010056735,0.0013474117,0.00048119013,0.00037692237,0.012896181],"category_scores_gemma":[0.0012394435,0.0002284753,0.0004939288,0.000726528,0.0013331459,0.0018456796,0.0017081536,0.0007485664,0.0026240016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016975284,0.00003664104,0.0008642858,0.00007240335,0.000012527781,0.00015964256,0.00035336232,0.0012495113,0.003819122,0.9518732,0.009144453,0.032245103],"study_design_scores_gemma":[0.000023770826,0.00004583074,0.0014186158,0.000037633497,0.000019594265,0.0004846398,0.00030982387,0.0046954453,0.0027054884,0.9510119,0.03922385,0.000023460618],"about_ca_topic_score_codex":0.0020941196,"about_ca_topic_score_gemma":0.003913063,"teacher_disagreement_score":0.012896181,"about_ca_system_score_codex":0.00073235715,"about_ca_system_score_gemma":0.0005895537,"threshold_uncertainty_score":0.04314202},"labels":[],"label_agreement":null},{"id":"W123065172","doi":"","title":"Restrained Domination Excellent Trees.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.024247903241052103,"score_gpt":0.2745094889075757,"score_spread":0.2502615856665236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W123065172","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35268044,0.0026915402,0.199644,0.0026004624,0.00039990037,0.00008551975,0.001576539,0.0015135149,0.43880802],"genre_scores_gemma":[0.9071052,0.0006719078,0.02060829,0.00044823086,0.00016011836,0.000038232032,0.0006567808,0.00016685965,0.070144385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994962,0.00009842105,0.000019363368,0.00009533111,0.00016308071,0.00012753015],"domain_scores_gemma":[0.9981463,0.0008513887,0.0001379645,0.00038686054,0.00025419056,0.000223402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049539993,0.00023269348,0.00044262083,0.0007924621,0.0011435237,0.0011239311,0.0006974961,0.00046624435,0.008093167],"category_scores_gemma":[0.002402356,0.00024187144,0.00035697457,0.0008475719,0.0011105108,0.0021393816,0.0016300225,0.0014744406,0.0014446354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007187935,0.000029243993,0.0008408225,0.00007276272,0.000017612223,0.00024460632,0.0003741716,0.0017926687,0.0030066867,0.96207243,0.0094304215,0.022046655],"study_design_scores_gemma":[0.000020574635,0.00002096995,0.00083925173,0.000023265939,0.000024351286,0.0005745205,0.00012565256,0.0063899904,0.0021736193,0.9531961,0.03659768,0.00001394762],"about_ca_topic_score_codex":0.0013725844,"about_ca_topic_score_gemma":0.0028297715,"teacher_disagreement_score":0.008093167,"about_ca_system_score_codex":0.00078827754,"about_ca_system_score_gemma":0.00039560214,"threshold_uncertainty_score":0.027074397},"labels":[],"label_agreement":null},{"id":"W123091349","doi":"","title":"On the nonexistence of Steiner t-(v, k) trades.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Steiner tree problem; Combinatorics; Mathematical economics; Discrete mathematics","score_opus":0.028520016594109538,"score_gpt":0.20375287027620964,"score_spread":0.1752328536821001,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W123091349","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6530231,0.0024300714,0.21706401,0.0042234994,0.00035871184,0.00009099728,0.0012060337,0.00043639366,0.12116708],"genre_scores_gemma":[0.96051544,0.0011757737,0.026524497,0.00040771728,0.00024237976,0.000094842726,0.00068916916,0.00016340848,0.010186712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981993,0.0005965677,0.00018334984,0.0003796388,0.0002857695,0.000355365],"domain_scores_gemma":[0.97912,0.013737717,0.0028221356,0.0021052626,0.00094249664,0.0012723407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025696272,0.0004912012,0.0017905708,0.001618495,0.0030889106,0.0052614887,0.0016856999,0.0022198246,0.013850877],"category_scores_gemma":[0.024820853,0.0009705242,0.001952283,0.0019926773,0.0041330103,0.010223191,0.003685814,0.0029394133,0.0017624468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105357656,0.000025425068,0.00121694,0.00007373628,0.00003299323,0.00027226997,0.00011643538,0.0048099617,0.000489029,0.98510134,0.0025115982,0.0052447766],"study_design_scores_gemma":[0.000022334469,0.000018296056,0.00041963827,0.00002657203,0.000010801089,0.0003751192,0.000080285594,0.011418178,0.00017703009,0.9862104,0.001229809,0.000011425044],"about_ca_topic_score_codex":0.00061952916,"about_ca_topic_score_gemma":0.00067626196,"teacher_disagreement_score":0.013850877,"about_ca_system_score_codex":0.0009160265,"about_ca_system_score_gemma":0.00082492223,"threshold_uncertainty_score":0.046335757},"labels":[],"label_agreement":null},{"id":"W123151599","doi":"","title":"Asymptotic Normality of the (r, beta)-Stirling Numbers.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Cold Atom Physics and Bose-Einstein Condensates","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; BETA (programming language); Stirling numbers of the first kind; Normality; Stirling engine; Stirling numbers of the second kind; Beta distribution; Stirling number; Combinatorics; Statistics; Computer science; Thermodynamics; Physics; Programming language","score_opus":0.005654705986215781,"score_gpt":0.20779562106177513,"score_spread":0.20214091507555934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W123151599","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43982118,0.005409629,0.26828837,0.0080609005,0.0010446801,0.000099804216,0.0018005898,0.0011423072,0.27433258],"genre_scores_gemma":[0.953568,0.0019103029,0.0151909515,0.00074537215,0.0012851601,0.00018406953,0.00081082404,0.00025647593,0.026048752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981968,0.00059885794,0.00008943699,0.0002521819,0.0005521165,0.0003105963],"domain_scores_gemma":[0.9832461,0.010296834,0.001615879,0.0013963957,0.0022684599,0.0011764058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031899333,0.0008422502,0.0012005749,0.0046219435,0.0016119451,0.0044107498,0.0014841111,0.0010422862,0.0133750625],"category_scores_gemma":[0.030458974,0.0004906064,0.00097576267,0.0019935737,0.004849382,0.006051797,0.0023237937,0.0031624115,0.0036782064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006519961,0.000026328476,0.0005757399,0.0000458245,0.000010989022,0.000063045714,0.00008891855,0.001252482,0.00049981376,0.98948854,0.0030271788,0.004855925],"study_design_scores_gemma":[0.00001939166,0.000020303998,0.00064501987,0.000029079589,0.000008293469,0.000197998,0.000051765077,0.011664761,0.0004266719,0.984544,0.002369134,0.000023605604],"about_ca_topic_score_codex":0.0012078477,"about_ca_topic_score_gemma":0.00094028015,"teacher_disagreement_score":0.0133750625,"about_ca_system_score_codex":0.001910786,"about_ca_system_score_gemma":0.0011541273,"threshold_uncertainty_score":0.044744074},"labels":[],"label_agreement":null},{"id":"W1231542496","doi":"","title":"A Family of Group Divisible Designs of Block Size Four and Three Groups With l1=2 and l2=1 Using MOLS.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Block (permutation group theory); Group (periodic table); Combinatorics; Block size; Arithmetic; Computer science; Chemistry; Organic chemistry","score_opus":0.012798856765436153,"score_gpt":0.18449992206033822,"score_spread":0.17170106529490206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1231542496","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80499506,0.0027874017,0.115203016,0.00089058,0.00022478309,0.00020950407,0.0012429142,0.0011349557,0.07331188],"genre_scores_gemma":[0.9305136,0.0005163616,0.05248233,0.0001808336,0.000040635576,0.00016470427,0.0005609935,0.000058440335,0.0154821575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995659,0.00012253465,0.000021812864,0.00009681232,0.000093638046,0.00009931443],"domain_scores_gemma":[0.9989219,0.00041944822,0.00019917054,0.00018094845,0.00013549622,0.00014300326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005303305,0.00044354773,0.00032182166,0.0007549378,0.0009861698,0.0007734947,0.0004732016,0.00063979084,0.004060051],"category_scores_gemma":[0.0019487824,0.00028376348,0.0004163607,0.0006264547,0.00064576586,0.00044742035,0.00048206587,0.00050135487,0.000675954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025338084,0.00026812637,0.0082421815,0.00063783274,0.00019141087,0.0028702724,0.0012088584,0.034788206,0.06506608,0.6653242,0.021597601,0.19727136],"study_design_scores_gemma":[0.0011860486,0.002315734,0.009014658,0.0006510807,0.00018845744,0.009153115,0.00071022514,0.19392927,0.06870701,0.4872054,0.2266155,0.00032344175],"about_ca_topic_score_codex":0.0006734087,"about_ca_topic_score_gemma":0.0008746194,"teacher_disagreement_score":0.004060051,"about_ca_system_score_codex":0.00074763596,"about_ca_system_score_gemma":0.0005585827,"threshold_uncertainty_score":0.01358223},"labels":[],"label_agreement":null},{"id":"W123155392","doi":"","title":"Hyper Wiener index of zigzag polyhex nanotorus.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Zigzag; Mathematics; Index (typography); Wiener index; Combinatorics; Geometry; Computer science; World Wide Web","score_opus":0.020621807279015122,"score_gpt":0.288662217977348,"score_spread":0.26804041069833284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W123155392","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7188261,0.0008738151,0.055907052,0.0007240256,0.0005813372,0.00005732751,0.00078875944,0.00026262086,0.22197902],"genre_scores_gemma":[0.95076627,0.00055526145,0.008059353,0.00022358575,0.00017283515,0.00008151364,0.0004947425,0.00016853656,0.03947782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99980015,0.000030454248,0.000009237255,0.000034775236,0.00005950127,0.00006584997],"domain_scores_gemma":[0.9997383,0.00005393748,0.000050252875,0.000034064302,0.0000409917,0.000082477956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015988555,0.00035203432,0.0004505277,0.0019389328,0.0012221042,0.0018485959,0.000445969,0.000632895,0.016131902],"category_scores_gemma":[0.0006196384,0.00022159907,0.00027468687,0.0006929051,0.0009407301,0.0018804058,0.0014261738,0.0008191972,0.0022212986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093275165,0.00002444336,0.00052159687,0.000049248556,0.000008537093,0.00017648499,0.00012806502,0.0010549396,0.004552791,0.98221403,0.0024174661,0.00875902],"study_design_scores_gemma":[0.00002721727,0.0000715417,0.0018716078,0.000047498736,0.000017262902,0.00046569257,0.0003967039,0.017040184,0.00512193,0.9619391,0.012967421,0.000033860426],"about_ca_topic_score_codex":0.0005718891,"about_ca_topic_score_gemma":0.0007254245,"teacher_disagreement_score":0.016131902,"about_ca_system_score_codex":0.0005921462,"about_ca_system_score_gemma":0.00030037426,"threshold_uncertainty_score":0.05396658},"labels":[],"label_agreement":null},{"id":"W123522458","doi":"","title":"Sums Of Generalized Fibonacci Numbers By Matrix Methods.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Mathematics; Pisano period; Fibonacci polynomials; Matrix (chemical analysis); Combinatorics; Lucas number; Orthogonal polynomials","score_opus":0.009561387967846786,"score_gpt":0.344086301323684,"score_spread":0.33452491335583723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W123522458","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027719885,0.0064604552,0.83864367,0.0009087147,0.0017998612,0.0001237559,0.00039115179,0.00058625167,0.12336616],"genre_scores_gemma":[0.3595695,0.004985828,0.5517657,0.00081375224,0.0018399213,0.0005321179,0.00056568405,0.0008971448,0.079030395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890554,0.0003613966,0.00006677614,0.00012145361,0.00045332944,0.00009145575],"domain_scores_gemma":[0.998877,0.00047939958,0.00007904449,0.00017288861,0.00031035778,0.000081281396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013502596,0.0013051983,0.0011099022,0.0039999858,0.001613562,0.003148798,0.0015283899,0.0010425941,0.0134574585],"category_scores_gemma":[0.004504525,0.0006155332,0.0012298598,0.0020192512,0.001827167,0.004518321,0.0020293389,0.0019216083,0.0038289262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010771158,0.000009160842,0.00004531368,0.00006177177,0.000010247432,0.000031973137,0.0000663014,0.0014727188,0.0004802576,0.98298806,0.0026623583,0.012161129],"study_design_scores_gemma":[0.000006098108,0.000009100654,0.00005961258,0.000033905413,0.000008846029,0.00010771882,0.00002530912,0.01968377,0.0005331352,0.97147655,0.008039748,0.000016167156],"about_ca_topic_score_codex":0.0008377583,"about_ca_topic_score_gemma":0.0028865314,"teacher_disagreement_score":0.0134574585,"about_ca_system_score_codex":0.0008413654,"about_ca_system_score_gemma":0.00072373834,"threshold_uncertainty_score":0.045019627},"labels":[],"label_agreement":null},{"id":"W124024561","doi":"","title":"Composite path algebras for solving path problems in graphs","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Path (computing); Mathematics; Mathematical proof; Longest path problem; Algebraic structure; Algebraic number; Mathematical optimization; Composite number; Algebra over a field; Computer science; Shortest path problem; Algorithm; Discrete mathematics; Graph; Pure mathematics; Geometry; Mathematical analysis","score_opus":0.015062549883796862,"score_gpt":0.2523109143564071,"score_spread":0.23724836447261027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W124024561","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004545987,0.00026724098,0.98948425,0.00019592998,0.000042914035,0.00011203644,0.00007815335,0.00024153435,0.0050318674],"genre_scores_gemma":[0.1687251,0.0010135532,0.82422024,0.00018010485,0.00013802694,0.00053005124,0.00037275805,0.00013748003,0.004682667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980179,0.00089610944,0.00015417584,0.00024776012,0.00055157836,0.0001325226],"domain_scores_gemma":[0.99798054,0.0011151164,0.00017436768,0.00035409862,0.00025892997,0.000116979434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031886355,0.0007046091,0.0005661044,0.0013437535,0.0013355777,0.0019752542,0.0015762637,0.0010049993,0.0067099086],"category_scores_gemma":[0.00455967,0.00043161135,0.0021173824,0.001602355,0.002809572,0.005664913,0.002366259,0.0034061603,0.0010939732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017076973,0.000023403307,0.00011302512,0.00011226433,0.000017428156,0.000043808155,0.00013352472,0.007807035,0.0008784389,0.9722177,0.0007243476,0.017912013],"study_design_scores_gemma":[0.000014053318,0.000031435597,0.00006156382,0.000044888908,0.000021465548,0.000075395976,0.000059039918,0.043007206,0.0017467112,0.94407463,0.010840799,0.000022818753],"about_ca_topic_score_codex":0.0011113966,"about_ca_topic_score_gemma":0.0020087499,"teacher_disagreement_score":0.0067099086,"about_ca_system_score_codex":0.0012130014,"about_ca_system_score_gemma":0.0020663913,"threshold_uncertainty_score":0.02244687},"labels":[],"label_agreement":null},{"id":"W124027644","doi":"","title":"A note on the complexity of computing cyclicity.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arithmetic; Theoretical computer science; Computer science","score_opus":0.05052226703837889,"score_gpt":0.26080830461380883,"score_spread":0.21028603757542993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W124027644","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037215024,0.030774143,0.5336132,0.07440255,0.010706326,0.0003251493,0.0025096005,0.002629172,0.30782473],"genre_scores_gemma":[0.48671713,0.027743632,0.38110638,0.01724207,0.020124324,0.00060053496,0.003194729,0.0019261685,0.06134497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995181,0.0012784488,0.00025709643,0.0010066606,0.0018145684,0.00046218082],"domain_scores_gemma":[0.9462191,0.044198144,0.0006603364,0.0058670435,0.0019547795,0.0011006347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042905686,0.0014335923,0.0018780901,0.0032046882,0.0041894154,0.009522711,0.0039435877,0.0025823617,0.023564478],"category_scores_gemma":[0.036258608,0.0009780402,0.0025775651,0.006177025,0.009848368,0.025441656,0.007303127,0.014231072,0.004349269],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023257396,0.00008782646,0.0009571867,0.0004727853,0.00008318241,0.00036044884,0.00038125052,0.0049828617,0.001336297,0.870113,0.07097569,0.05001693],"study_design_scores_gemma":[0.00002000626,0.000020895417,0.00034417768,0.00006846863,0.000026353693,0.00014223784,0.00009665002,0.0075218775,0.00073085044,0.9649128,0.02608126,0.000034431047],"about_ca_topic_score_codex":0.008887159,"about_ca_topic_score_gemma":0.010242984,"teacher_disagreement_score":0.023564478,"about_ca_system_score_codex":0.004391177,"about_ca_system_score_gemma":0.002781991,"threshold_uncertainty_score":0.07883108},"labels":[],"label_agreement":null},{"id":"W124154265","doi":"","title":"Finding The Chromatic Polynomial Of Cayley Graphs Using The Tutte Polynomial.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chromatic polynomial; Mathematics; Tutte polynomial; Combinatorics; Cayley graph; Chromatic scale; Polynomial; Discrete mathematics; Graph; Line graph; Mathematical analysis","score_opus":0.02017909732845418,"score_gpt":0.25637136288100865,"score_spread":0.23619226555255446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W124154265","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5281136,0.0025071388,0.40228236,0.0037217417,0.00034208948,0.0001517745,0.0026042347,0.0015351248,0.05874192],"genre_scores_gemma":[0.92600757,0.0010268694,0.06070971,0.00024514357,0.0001850748,0.00009455599,0.0020957896,0.00035375255,0.0092815235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929714,0.00020357835,0.000025301195,0.00018332056,0.000113667855,0.00017708122],"domain_scores_gemma":[0.9938599,0.0045216493,0.00032329396,0.00068244955,0.0003259163,0.00028668766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008282358,0.0006563215,0.0007920887,0.0014098308,0.0013496445,0.003056378,0.0013711335,0.0011627127,0.0077361274],"category_scores_gemma":[0.010098596,0.0005999031,0.0007197333,0.0023114425,0.0015901475,0.0055041923,0.0013804559,0.002266866,0.0010941937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006785322,0.00034982013,0.009721726,0.0005069347,0.00014865072,0.00018626654,0.0005805939,0.10203873,0.010188044,0.7132144,0.039969236,0.12241712],"study_design_scores_gemma":[0.00008153778,0.00007012411,0.0019961635,0.00006405928,0.00006579213,0.00016560231,0.00035713482,0.24876693,0.0045983517,0.7352941,0.008491154,0.00004907381],"about_ca_topic_score_codex":0.0070812954,"about_ca_topic_score_gemma":0.012185537,"teacher_disagreement_score":0.0077361274,"about_ca_system_score_codex":0.0019488716,"about_ca_system_score_gemma":0.0015438087,"threshold_uncertainty_score":0.02587986},"labels":[],"label_agreement":null},{"id":"W124187445","doi":"","title":"Cahit-Equitability of Coronas.","year":2004,"lang":"es","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.014257956042743361,"score_gpt":0.25799665734737043,"score_spread":0.24373870130462708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W124187445","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22236262,0.0035724626,0.14643076,0.0031653633,0.0008262318,0.00008995801,0.0016725489,0.0011183176,0.6207617],"genre_scores_gemma":[0.9041466,0.0009709215,0.015642615,0.00075381005,0.00047763818,0.000053375174,0.0011435299,0.00034895618,0.076462485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877626,0.00019230205,0.00007983239,0.00044972773,0.0002718354,0.00022996936],"domain_scores_gemma":[0.9974868,0.00083528727,0.00022750233,0.00053666235,0.0005735274,0.0003401857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008337406,0.0005157126,0.00081540673,0.0018629,0.0027107876,0.0043083606,0.00086451595,0.001205774,0.023700954],"category_scores_gemma":[0.004336778,0.000488916,0.000929838,0.0016202596,0.0030688143,0.010358083,0.0032956474,0.0027807476,0.0025011436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003520993,0.00001413034,0.0004036548,0.000046190733,0.000013609143,0.000073516676,0.00022344208,0.00019542193,0.00060007913,0.98786956,0.003638413,0.0068868673],"study_design_scores_gemma":[0.000014595398,0.000015813494,0.00064469106,0.000026151978,0.000021346028,0.00033234054,0.00020236504,0.001280733,0.00090335484,0.9752829,0.021260522,0.000015136758],"about_ca_topic_score_codex":0.0017171704,"about_ca_topic_score_gemma":0.0018096596,"teacher_disagreement_score":0.023700954,"about_ca_system_score_codex":0.0019116492,"about_ca_system_score_gemma":0.00050306483,"threshold_uncertainty_score":0.07928759},"labels":[],"label_agreement":null},{"id":"W124262862","doi":"","title":"l-Designs with Two Block Sizes.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Block (permutation group theory); Arithmetic; Combinatorics","score_opus":0.012000235474458165,"score_gpt":0.1957680972040253,"score_spread":0.18376786172956713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W124262862","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08288754,0.0010809358,0.7889822,0.0016356243,0.0005423533,0.00056977343,0.0015003352,0.002680318,0.120120816],"genre_scores_gemma":[0.6770357,0.0005747716,0.2821394,0.0013171183,0.00026224818,0.0010235453,0.00062040257,0.00029144317,0.036735423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99728835,0.0012938569,0.0001678536,0.00039034072,0.0004056473,0.00045402625],"domain_scores_gemma":[0.99319386,0.0030222598,0.00060341926,0.001819732,0.0009043675,0.00045633412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018689156,0.0007789083,0.0006565449,0.00092400564,0.0011531289,0.0020657897,0.0011129683,0.0014948964,0.022199072],"category_scores_gemma":[0.0072884182,0.00051713514,0.00051157596,0.0007380254,0.0011769056,0.0023911486,0.0016815668,0.0010961446,0.007478223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016559025,0.00036463884,0.0010898295,0.00059119705,0.00010829863,0.0003367335,0.00029758087,0.014529148,0.042551376,0.7857988,0.019380927,0.13329549],"study_design_scores_gemma":[0.0007355948,0.0012592293,0.00077138277,0.00029574172,0.00013896594,0.0009428476,0.00022527076,0.098587476,0.052459467,0.7658148,0.07860391,0.0001652906],"about_ca_topic_score_codex":0.0006441109,"about_ca_topic_score_gemma":0.0012598466,"teacher_disagreement_score":0.022199072,"about_ca_system_score_codex":0.0011405488,"about_ca_system_score_gemma":0.0014590999,"threshold_uncertainty_score":0.074263275},"labels":[],"label_agreement":null},{"id":"W124361772","doi":"","title":"A square-covering problem.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Square (algebra); Applied mathematics; Mathematical economics; Geometry","score_opus":0.010201964206524496,"score_gpt":0.24114374877150277,"score_spread":0.23094178456497827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W124361772","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26670402,0.004927321,0.5450049,0.014485827,0.0011797566,0.00033328138,0.005117396,0.0019740611,0.1602735],"genre_scores_gemma":[0.79283994,0.0021994258,0.15844235,0.001674207,0.00059013464,0.0002505765,0.0051165647,0.00044930156,0.038437452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987841,0.0003042358,0.00007523925,0.00029970877,0.0003462922,0.00019050122],"domain_scores_gemma":[0.99477226,0.0034287919,0.00023982432,0.0010105709,0.00029292091,0.00025572858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007929285,0.0004790109,0.0008124029,0.00068139704,0.00095389795,0.0025765516,0.0009917524,0.0015593895,0.015759068],"category_scores_gemma":[0.008187809,0.0003450969,0.0007056432,0.0022748692,0.0011126079,0.004385459,0.0020255127,0.0018772662,0.0025004975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006126223,0.00030665178,0.0020874296,0.00062948355,0.0001522223,0.00065840146,0.0005476871,0.03331702,0.005765615,0.5241034,0.09771122,0.33410823],"study_design_scores_gemma":[0.000097713266,0.00008283601,0.00088612165,0.00008879637,0.00006476636,0.0010721005,0.00038563952,0.09837218,0.005231075,0.8522412,0.041453592,0.000023987312],"about_ca_topic_score_codex":0.0008767546,"about_ca_topic_score_gemma":0.00094470097,"teacher_disagreement_score":0.015759068,"about_ca_system_score_codex":0.00076142815,"about_ca_system_score_gemma":0.0009120244,"threshold_uncertainty_score":0.052719355},"labels":[],"label_agreement":null},{"id":"W124382047","doi":"","title":"On the structure of a generalization of weakly associative lattices.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Antisymmetric relation; Mathematics; Associative property; Equivalence relation; Combinatorics; Integer (computer science); Upper and lower bounds; Pure mathematics; Relation (database); Discrete mathematics; Mathematical analysis; Computer science; Mathematical physics","score_opus":0.008104195425823812,"score_gpt":0.18725474881974102,"score_spread":0.17915055339391722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W124382047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11503541,0.007585305,0.6698635,0.0030929432,0.0013356062,0.0001882581,0.0009336225,0.00048378773,0.20148157],"genre_scores_gemma":[0.7666143,0.0032710745,0.18599999,0.0022526253,0.0013410577,0.0003709164,0.0007702597,0.00015158173,0.03922823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888974,0.00028490362,0.00007426345,0.00032905737,0.00029313198,0.00012888972],"domain_scores_gemma":[0.99884254,0.0003713486,0.00017481414,0.0002206118,0.00022745266,0.00016332336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001037767,0.00048077956,0.00045043085,0.001401068,0.0015760176,0.0024258324,0.0006672757,0.0009114979,0.0065642307],"category_scores_gemma":[0.0019507739,0.00035033823,0.000710121,0.0011932475,0.0048585446,0.005870969,0.002467849,0.0019183708,0.0012120894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009546878,0.0000052464607,0.00009283296,0.000027742291,0.0000042588836,0.000043573677,0.00017027227,0.000548452,0.0005892438,0.9928837,0.00075601944,0.0048692077],"study_design_scores_gemma":[0.000007723038,0.000026177055,0.00010371212,0.000017897004,0.0000035735102,0.00012532734,0.00006767799,0.0027471017,0.00036244752,0.976992,0.019536553,0.000009707556],"about_ca_topic_score_codex":0.00088696193,"about_ca_topic_score_gemma":0.0007360114,"teacher_disagreement_score":0.0065642307,"about_ca_system_score_codex":0.0012610279,"about_ca_system_score_gemma":0.0005702774,"threshold_uncertainty_score":0.021959543},"labels":[],"label_agreement":null},{"id":"W124402557","doi":"","title":"An Addressing Scheme On Complete Bipartite Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Scheme (mathematics); Combinatorics; Graph; Mathematical analysis","score_opus":0.07088800168607567,"score_gpt":0.3224054629053689,"score_spread":0.25151746121929325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W124402557","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111973,0.00069608487,0.7240379,0.002991736,0.0007871241,0.00056178804,0.0020930348,0.0045644618,0.15229481],"genre_scores_gemma":[0.5455053,0.0008604132,0.3524701,0.0012603764,0.00031052157,0.00073153706,0.0025634186,0.00072600896,0.09557239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856013,0.0003841809,0.00012042037,0.000285836,0.00037383608,0.0002755735],"domain_scores_gemma":[0.99665016,0.0009512972,0.00022656353,0.0014896288,0.0004017783,0.0002804907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001427266,0.0006548978,0.0007679233,0.0010795147,0.0025145388,0.0031564897,0.0022912691,0.001955251,0.019195043],"category_scores_gemma":[0.005084049,0.00041434416,0.0007218775,0.0020833,0.0013480971,0.008082888,0.007077738,0.0020011922,0.0058617694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032931057,0.00012863903,0.00027980335,0.00017380943,0.000021133892,0.00007837881,0.00036568524,0.003322419,0.005579582,0.8715551,0.01946372,0.09870247],"study_design_scores_gemma":[0.00008740063,0.0001220983,0.00024231944,0.00008705125,0.000045631237,0.00019389401,0.00023224518,0.026761191,0.006182099,0.91080296,0.05519753,0.000045571658],"about_ca_topic_score_codex":0.0008651162,"about_ca_topic_score_gemma":0.0011582103,"teacher_disagreement_score":0.019195043,"about_ca_system_score_codex":0.0014389113,"about_ca_system_score_gemma":0.0016047071,"threshold_uncertainty_score":0.06421381},"labels":[],"label_agreement":null},{"id":"W124588306","doi":"","title":"Enumeration for spanning forests of complete bipartite graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Enumeration; Combinatorics; Complete bipartite graph; Spanning tree; Graph","score_opus":0.030775711098023847,"score_gpt":0.3004455467256993,"score_spread":0.26966983562767544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W124588306","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11142991,0.0023881502,0.792665,0.0026498532,0.00034234682,0.00024206324,0.00347056,0.001517965,0.08529418],"genre_scores_gemma":[0.56622535,0.0025792366,0.37490106,0.0010935912,0.00046774212,0.0004527299,0.009817483,0.00062125345,0.043841515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909997,0.00029205505,0.00006241513,0.0001681189,0.00022927493,0.00014825181],"domain_scores_gemma":[0.99737906,0.0016358822,0.00019484051,0.00035786364,0.00025968195,0.00017271661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008193147,0.00046417475,0.0006075945,0.0014678745,0.0011166789,0.0020231022,0.0010335477,0.0011898011,0.011025055],"category_scores_gemma":[0.0060890657,0.0005224292,0.00087099633,0.00215403,0.00069889845,0.004601196,0.0016174004,0.0018898697,0.002301969],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016729505,0.0001988706,0.002104058,0.00058277056,0.0000643579,0.00027987728,0.0004897924,0.012554587,0.004617528,0.75663114,0.040029462,0.18228032],"study_design_scores_gemma":[0.00002050691,0.000019948862,0.0005184353,0.00008663498,0.000026587411,0.00040389167,0.00014224953,0.03843344,0.0011400674,0.94517845,0.014017352,0.000012383292],"about_ca_topic_score_codex":0.0009267896,"about_ca_topic_score_gemma":0.0025396033,"teacher_disagreement_score":0.011025055,"about_ca_system_score_codex":0.0007106616,"about_ca_system_score_gemma":0.00072554935,"threshold_uncertainty_score":0.03688246},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Geodetic datum; Mathematics; Graph; Combinatorics; Geodesy; Geography","score_opus":0.009437448856650828,"score_gpt":0.22815410607388853,"score_spread":0.2187166572172377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W125103475","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7835736,0.00206806,0.10671188,0.008296804,0.00039678946,0.000060474842,0.0012836419,0.00032662912,0.097282134],"genre_scores_gemma":[0.96064615,0.0014108198,0.019429412,0.00046643268,0.0004743279,0.000089526424,0.00072254916,0.00014806881,0.016612735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989396,0.00039349325,0.00004784597,0.00022159945,0.00019105343,0.00020646674],"domain_scores_gemma":[0.98732835,0.008950451,0.0012345898,0.00080119923,0.0004757957,0.0012097043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015116977,0.0010248311,0.0013312623,0.003780239,0.0030266147,0.0041369,0.0024188682,0.002350729,0.008577238],"category_scores_gemma":[0.008895075,0.0007617224,0.00071449263,0.0037008969,0.0051956126,0.008667857,0.002664969,0.0032009843,0.00087355037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022052113,0.00005852118,0.0022396876,0.000115563154,0.000022632026,0.00009177333,0.00038783174,0.0124934865,0.0014424904,0.9660234,0.004581419,0.012322746],"study_design_scores_gemma":[0.000036009948,0.000028190072,0.0011120178,0.000033518354,0.000022143571,0.00015091397,0.0002694307,0.023671895,0.0008086059,0.96934134,0.0044955853,0.000030449473],"about_ca_topic_score_codex":0.0024733548,"about_ca_topic_score_gemma":0.0028984756,"teacher_disagreement_score":0.008577238,"about_ca_system_score_codex":0.0024826212,"about_ca_system_score_gemma":0.0008151694,"threshold_uncertainty_score":0.028693676},"labels":[],"label_agreement":null},{"id":"W125126158","doi":"","title":"Cartesian Products and Edge Domination.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cartesian product; Enhanced Data Rates for GSM Evolution; Cartesian coordinate system; Combinatorics; Geometry; Computer science; Artificial intelligence","score_opus":0.010252911786325402,"score_gpt":0.22255594244867813,"score_spread":0.21230303066235273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W125126158","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12560089,0.019965094,0.34265453,0.0077278283,0.0008346321,0.00009124531,0.0011775644,0.00080085295,0.50114745],"genre_scores_gemma":[0.8526847,0.006135808,0.058443826,0.0011067993,0.00087012973,0.00011915623,0.0008354762,0.00024476447,0.07955935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985454,0.00044418845,0.0001067784,0.00036185267,0.00033804937,0.00020369446],"domain_scores_gemma":[0.99571335,0.0026711572,0.00032269198,0.000606968,0.00042740858,0.00025837575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014679212,0.00049926917,0.00068426196,0.0016428377,0.0018110996,0.00408966,0.000936691,0.0007846858,0.014846072],"category_scores_gemma":[0.0062104114,0.00049153465,0.000853079,0.0025304998,0.0048887474,0.008699164,0.0030518118,0.0024230487,0.002085897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017848126,0.000007549967,0.00024282654,0.000039113074,0.000008326892,0.000043915956,0.00015318733,0.0004133464,0.0001352646,0.98844856,0.0024576895,0.008032366],"study_design_scores_gemma":[0.0000066377584,0.00000617049,0.00020798302,0.0000208344,0.000011208618,0.00014496062,0.000083711675,0.0011248922,0.00020699088,0.9821268,0.01605367,0.0000061868827],"about_ca_topic_score_codex":0.002461337,"about_ca_topic_score_gemma":0.0030761259,"teacher_disagreement_score":0.014846072,"about_ca_system_score_codex":0.0016480138,"about_ca_system_score_gemma":0.0007764502,"threshold_uncertainty_score":0.049665034},"labels":[],"label_agreement":null},{"id":"W12542839","doi":"10.1186/1472-6920-3-1","title":"Decoding Goppa Codes with MAGMA.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Decoding methods; Mathematics; Magma; Algorithm; Geology; Geochemistry","score_opus":0.010724034832790583,"score_gpt":0.22322160053674717,"score_spread":0.2124975657039566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W12542839","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045969214,0.0016258992,0.8866868,0.0033255364,0.0008756894,0.00020210775,0.0006168767,0.0024257868,0.058272064],"genre_scores_gemma":[0.71858066,0.0008131367,0.24511868,0.0012999614,0.00041888154,0.00023951085,0.0006733,0.00040787066,0.03244799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99830306,0.00054297823,0.00008782811,0.00026589388,0.0004859643,0.00031431558],"domain_scores_gemma":[0.99714905,0.0009859515,0.00024374195,0.0011396206,0.00033680937,0.00014479099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015454913,0.00058689236,0.0006305712,0.001088932,0.0011322944,0.002481894,0.0009239136,0.001668617,0.005340155],"category_scores_gemma":[0.01113709,0.00032419068,0.0007383716,0.00093770714,0.0018256849,0.0032470466,0.003669023,0.0021399416,0.0035094435],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038068657,0.000050264596,0.0010920431,0.00012276665,0.000054408833,0.00019066985,0.00032401262,0.010003162,0.0060323644,0.8704016,0.012181417,0.09916666],"study_design_scores_gemma":[0.000042289732,0.000045771823,0.00028305617,0.00006348501,0.000026259293,0.00021161548,0.000059569073,0.07034699,0.009312477,0.9051396,0.014434158,0.000034701032],"about_ca_topic_score_codex":0.0014807788,"about_ca_topic_score_gemma":0.002367707,"teacher_disagreement_score":0.005340155,"about_ca_system_score_codex":0.0011920575,"about_ca_system_score_gemma":0.0018600072,"threshold_uncertainty_score":0.017864585},"labels":[],"label_agreement":null},{"id":"W125492227","doi":"","title":"On the nonexistence of perfect codes in J(2w+p2, w).","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Mathematical economics","score_opus":0.007774068949106711,"score_gpt":0.19750988146403622,"score_spread":0.18973581251492952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W125492227","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7238512,0.0018643385,0.0904154,0.009731197,0.000583387,0.00011515684,0.0010165594,0.00047940807,0.17194338],"genre_scores_gemma":[0.9766832,0.000655951,0.0102561535,0.0008292018,0.00025585497,0.00012892166,0.00036996417,0.000117331234,0.010703441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794954,0.00055571564,0.000106339816,0.00037480122,0.00044364703,0.00056999456],"domain_scores_gemma":[0.9801483,0.015167938,0.0012632435,0.0014078058,0.0008755457,0.0011372287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021891764,0.00037609917,0.0008767692,0.0017170127,0.003774307,0.0040292908,0.0013873641,0.0022545357,0.005874621],"category_scores_gemma":[0.02177001,0.0009967567,0.0005735983,0.0009365893,0.0046778847,0.007270841,0.0052451845,0.003792461,0.0011916835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022923219,0.000046609333,0.0014433414,0.00012393457,0.000029534898,0.0005789453,0.0005839668,0.002963413,0.0025198355,0.9781396,0.007154651,0.0061868853],"study_design_scores_gemma":[0.00004444943,0.000040679886,0.0007738158,0.000058628666,0.000016769543,0.000640275,0.00037863312,0.008530868,0.002017198,0.9840316,0.0034346087,0.00003249181],"about_ca_topic_score_codex":0.0008673072,"about_ca_topic_score_gemma":0.0010854106,"teacher_disagreement_score":0.005874621,"about_ca_system_score_codex":0.0008436876,"about_ca_system_score_gemma":0.0010221072,"threshold_uncertainty_score":0.019652605},"labels":[],"label_agreement":null},{"id":"W126448502","doi":"","title":"On The Combinatorics Of Multi-Restricted Numbers.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.0399091660770718,"score_gpt":0.3132552024165542,"score_spread":0.2733460363394824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W126448502","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050177775,0.027570352,0.20334879,0.016922263,0.002299091,0.00005790253,0.0007487204,0.0005084062,0.6983667],"genre_scores_gemma":[0.7922058,0.016703611,0.07209324,0.004829199,0.0038567288,0.00019573556,0.000834474,0.00038864327,0.10889251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986405,0.0004994385,0.000088065666,0.0002026006,0.00042323698,0.00014621009],"domain_scores_gemma":[0.99717724,0.001616683,0.00021551167,0.000504658,0.00028296612,0.0002029873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016826477,0.00069472275,0.0007943828,0.0026812865,0.0022553082,0.0039608367,0.0011139855,0.0011502753,0.010843129],"category_scores_gemma":[0.004446756,0.00050565123,0.000821852,0.0020847388,0.0072469763,0.012452157,0.003405361,0.0042268164,0.0023201595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053407057,0.000004331615,0.000053244403,0.000022996446,0.0000032247845,0.000028485354,0.000086655695,0.0001135966,0.00007115721,0.9950222,0.0020108863,0.002577983],"study_design_scores_gemma":[0.0000024444057,0.0000027839658,0.000091911636,0.000016557913,0.0000031406998,0.00006402175,0.00004761896,0.00030533512,0.000058403646,0.98960084,0.009803127,0.0000037023117],"about_ca_topic_score_codex":0.0011230498,"about_ca_topic_score_gemma":0.0018560233,"teacher_disagreement_score":0.010843129,"about_ca_system_score_codex":0.0014955648,"about_ca_system_score_gemma":0.0006324071,"threshold_uncertainty_score":0.036273897},"labels":[],"label_agreement":null},{"id":"W1270085542","doi":"","title":"The Frequency of Summands of a Particular Size in Palindromic Compositions.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Palindrome; Mathematics; Integer (computer science); Sequence (biology); Composition (language); Combinatorics; Enumeration; Palindromic sequence; Integer sequence; Arithmetic; Discrete mathematics; Generating function; Computer science; Chemistry; Linguistics","score_opus":0.020219065529109567,"score_gpt":0.28549764244384035,"score_spread":0.2652785769147308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1270085542","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8540617,0.0008730232,0.110813744,0.0007139951,0.00040309498,0.00011910578,0.0008365227,0.0008862362,0.031292576],"genre_scores_gemma":[0.9642451,0.00047803033,0.026297903,0.00012018924,0.0002571859,0.00020268817,0.00061734597,0.00025537462,0.007526317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983935,0.00028767288,0.00014764699,0.0003662071,0.00054625195,0.00025859923],"domain_scores_gemma":[0.9864144,0.008784116,0.0015376966,0.0014850802,0.0010378264,0.00074086123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00134482,0.0003411225,0.0005011456,0.0031318762,0.001987707,0.0018429145,0.00086588523,0.0011113844,0.006651335],"category_scores_gemma":[0.017088274,0.00042200575,0.00048199072,0.0018592408,0.0018109238,0.003257278,0.0018093822,0.0009606718,0.0012766424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002047739,0.00055214367,0.08723553,0.00072961865,0.00015734653,0.005738411,0.0060262727,0.0060522277,0.21899042,0.40404198,0.0064336383,0.26199466],"study_design_scores_gemma":[0.00018086389,0.000975768,0.058089413,0.0002979721,0.00048413273,0.025119837,0.0040722196,0.056978397,0.20883173,0.5755482,0.069058694,0.0003627654],"about_ca_topic_score_codex":0.00029077454,"about_ca_topic_score_gemma":0.00057548704,"teacher_disagreement_score":0.006651335,"about_ca_system_score_codex":0.00056489464,"about_ca_system_score_gemma":0.0003493182,"threshold_uncertainty_score":0.02225095},"labels":[],"label_agreement":null},{"id":"W127273840","doi":"","title":"The Lattice Polynomial of a Graph.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Lattice (music); Discrete mathematics; Physics","score_opus":0.017642012168922992,"score_gpt":0.2738716593323168,"score_spread":0.2562296471633938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W127273840","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16451865,0.0077591394,0.27971235,0.018020533,0.0033921297,0.00009739833,0.0034466342,0.000859999,0.5221932],"genre_scores_gemma":[0.8634456,0.0044024438,0.042092573,0.0014005397,0.0019308167,0.000099201476,0.0012567989,0.00034703,0.08502501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992617,0.0001962405,0.000023974339,0.00015289932,0.00021118103,0.00015402431],"domain_scores_gemma":[0.99857366,0.0006768847,0.00016434985,0.00017833902,0.0001920761,0.00021463858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061176374,0.00059225026,0.0008039085,0.0023008576,0.0015161869,0.003519809,0.0009047445,0.00090312614,0.01839519],"category_scores_gemma":[0.0034141121,0.00034548485,0.00075435214,0.0025258402,0.0038604122,0.0063609146,0.0020224631,0.00417235,0.0049962527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028005996,0.00001646978,0.00015221159,0.000053124553,0.000007006609,0.000037757956,0.00012762942,0.0006295673,0.00036673355,0.9811798,0.0066701667,0.010731569],"study_design_scores_gemma":[0.000009172883,0.00000974625,0.00016864028,0.000017236087,0.0000053138924,0.00012167641,0.00007039371,0.0025069595,0.00024119036,0.98374903,0.013090777,0.00000984426],"about_ca_topic_score_codex":0.0024758668,"about_ca_topic_score_gemma":0.0026439265,"teacher_disagreement_score":0.01839519,"about_ca_system_score_codex":0.0017670206,"about_ca_system_score_gemma":0.0009961183,"threshold_uncertainty_score":0.06153804},"labels":[],"label_agreement":null},{"id":"W12746167","doi":"10.1080/08880010390203125","title":"Vertex-Disjoint K1, t's in Graphs.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Disjoint sets; Combinatorics; Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.021898103047864267,"score_gpt":0.26131906849313136,"score_spread":0.2394209654452671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W12746167","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6156946,0.0077455323,0.2733652,0.0057208487,0.0011941402,0.0004901124,0.0061041126,0.0012485037,0.088436894],"genre_scores_gemma":[0.8960193,0.0033297832,0.06726746,0.00083013374,0.0002961634,0.00024070452,0.0042662234,0.00026054078,0.027489683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905974,0.0002553225,0.000082258885,0.00026806124,0.00016283673,0.0001717838],"domain_scores_gemma":[0.9959915,0.0019706653,0.0008922293,0.00037215935,0.00026442902,0.00050901563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008060472,0.00073990814,0.00081808126,0.0021500764,0.0023537793,0.0021206168,0.0010344185,0.0015179572,0.00773839],"category_scores_gemma":[0.0053034388,0.00050150446,0.00094426813,0.0023120267,0.001629094,0.0036321967,0.0018834162,0.001331644,0.0013540069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063930516,0.00017668698,0.0042381794,0.0010200841,0.00022159441,0.0022739805,0.0013333245,0.026897168,0.0065951273,0.8749829,0.022472417,0.059149273],"study_design_scores_gemma":[0.0000740349,0.00008043291,0.0017387124,0.00009018115,0.000074555035,0.0017057479,0.0003991799,0.023606956,0.0014094791,0.94667816,0.024116166,0.00002636769],"about_ca_topic_score_codex":0.0017994273,"about_ca_topic_score_gemma":0.0034041072,"teacher_disagreement_score":0.00773839,"about_ca_system_score_codex":0.0015253556,"about_ca_system_score_gemma":0.0007423363,"threshold_uncertainty_score":0.02588749},"labels":[],"label_agreement":null},{"id":"W128873098","doi":"","title":"The spectral radius of tricyclic graphs with n vertices and k pendant edges.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tricyclic; Mathematics; Combinatorics; RADIUS; Spectral radius; Stereochemistry; Chemistry; Physics; Quantum mechanics; Computer science; Computer network","score_opus":0.024983247294206985,"score_gpt":0.25476140904407985,"score_spread":0.22977816174987287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W128873098","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8420199,0.004676813,0.05150606,0.0017716896,0.00035724274,0.000057493635,0.0016738736,0.0004890348,0.09744789],"genre_scores_gemma":[0.9909779,0.0009700286,0.004027338,0.00010644228,0.000114888564,0.000049819082,0.0003805216,0.00007096681,0.003302078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993461,0.00023467826,0.00003616072,0.00011964723,0.00012098822,0.00014236508],"domain_scores_gemma":[0.99558157,0.0021556003,0.00093540666,0.00030555218,0.00037652065,0.0006451955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056666177,0.00049329834,0.0005647843,0.0024200801,0.0007359455,0.0015453295,0.0011470087,0.0009305852,0.0048275883],"category_scores_gemma":[0.0073158494,0.00033110497,0.00023481679,0.0010862258,0.0014875393,0.0018517015,0.0014448968,0.0006139945,0.0019243219],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016183547,0.00012112118,0.005383759,0.0006661455,0.0001244313,0.0007667778,0.00090878055,0.06848815,0.02082391,0.80759096,0.03876265,0.05474495],"study_design_scores_gemma":[0.00012079753,0.00015573096,0.006865267,0.00022271145,0.00009369659,0.0017665868,0.0012356603,0.19263302,0.008888053,0.7714781,0.016434604,0.0001057796],"about_ca_topic_score_codex":0.0008627439,"about_ca_topic_score_gemma":0.0006553883,"teacher_disagreement_score":0.0048275883,"about_ca_system_score_codex":0.00064522936,"about_ca_system_score_gemma":0.00030118323,"threshold_uncertainty_score":0.016149879},"labels":[],"label_agreement":null},{"id":"W129355805","doi":"","title":"On Closed and Upper Closed Geodetic Numbers of Graphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Geodetic datum; Mathematics; Combinatorics; Geodesy; Geology","score_opus":0.007574026678593303,"score_gpt":0.22569167916045052,"score_spread":0.21811765248185722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W129355805","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47961685,0.005993729,0.20527303,0.008569852,0.0008502083,0.00009327748,0.0019910594,0.0005156998,0.2970963],"genre_scores_gemma":[0.9262455,0.002083327,0.035184495,0.0008646228,0.0006749061,0.00015236567,0.0011235377,0.00017420897,0.033497166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985114,0.00043165087,0.00008738955,0.00032384173,0.00029969896,0.00034598226],"domain_scores_gemma":[0.9926334,0.0049653654,0.0006665289,0.00055788056,0.00040342464,0.0007734001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014541411,0.00068032154,0.00090676395,0.0034753822,0.0028936644,0.0053174966,0.0015607799,0.0016784333,0.009452938],"category_scores_gemma":[0.008093764,0.00064214395,0.00066148274,0.0035604532,0.005021064,0.01069,0.0033966673,0.003689984,0.0013327815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044552584,0.000017186267,0.00040321556,0.00003786917,0.000004282874,0.00002624512,0.00017009782,0.0010763926,0.00024379403,0.98786664,0.0027110945,0.007398609],"study_design_scores_gemma":[0.000010674476,0.0000076855085,0.00035423995,0.000023826302,0.00000493768,0.00007294562,0.00016740756,0.0028851929,0.0002504059,0.9915215,0.00469168,0.000009538455],"about_ca_topic_score_codex":0.0018532587,"about_ca_topic_score_gemma":0.0020969212,"teacher_disagreement_score":0.009452938,"about_ca_system_score_codex":0.0027022902,"about_ca_system_score_gemma":0.0007447954,"threshold_uncertainty_score":0.031623244},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Statistics","score_opus":0.011556288255116412,"score_gpt":0.23802469116809083,"score_spread":0.22646840291297443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W129481463","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3915231,0.0027953212,0.2006125,0.0016955126,0.002383093,0.00018193934,0.00050154875,0.0005561479,0.39975086],"genre_scores_gemma":[0.78773254,0.0016616778,0.0622793,0.0010144525,0.0014552668,0.00048944243,0.0006010314,0.00056071783,0.14420563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989729,0.00021356075,0.00009400065,0.00014042208,0.00035543917,0.00022365781],"domain_scores_gemma":[0.9984315,0.00060058036,0.00020063124,0.00019310956,0.00028504682,0.00028905258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010224968,0.0011540948,0.0011401719,0.0045348937,0.0043341145,0.004782965,0.001380099,0.0021013513,0.011417935],"category_scores_gemma":[0.003806206,0.0006760455,0.00094159093,0.004084061,0.0031987487,0.005010441,0.0024723187,0.0028695166,0.003145275],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017121454,0.000007397449,0.00005491074,0.000012881623,0.0000029880757,0.0000792012,0.0001318736,0.0001303074,0.00051346415,0.9958407,0.0006312941,0.00257784],"study_design_scores_gemma":[0.000008085313,0.000011406144,0.00012654375,0.000018415774,0.000008638752,0.00028271094,0.00009073487,0.0018513347,0.00067617535,0.98948216,0.007425508,0.00001824307],"about_ca_topic_score_codex":0.0006359923,"about_ca_topic_score_gemma":0.0008818662,"teacher_disagreement_score":0.011417935,"about_ca_system_score_codex":0.0013859721,"about_ca_system_score_gemma":0.00083909725,"threshold_uncertainty_score":0.038196743},"labels":[],"label_agreement":null},{"id":"W130025484","doi":"","title":"Extended Mendelsohn Triple Systems Having a Prescribed Number of Blocks in Common.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arithmetic","score_opus":0.011795918517392368,"score_gpt":0.21405103025219924,"score_spread":0.20225511173480687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W130025484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.356786,0.0011189177,0.47185788,0.00081242924,0.00058731856,0.00020102494,0.0011813422,0.0010304587,0.16642468],"genre_scores_gemma":[0.86087203,0.00041302544,0.10121205,0.00031087577,0.00012416075,0.00023034083,0.0005875893,0.00013029296,0.036119632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993024,0.00015365472,0.000046371282,0.0001569458,0.00017908105,0.00016162585],"domain_scores_gemma":[0.9983454,0.0004598561,0.00022401262,0.00036850793,0.00036990579,0.00023234988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050736446,0.0003503357,0.00071178394,0.0014251263,0.0019382548,0.001978404,0.00088812056,0.0010555997,0.013317171],"category_scores_gemma":[0.0028416908,0.0003763052,0.00053697993,0.0010630311,0.0010855037,0.0018677802,0.001461451,0.0009969529,0.002834083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023674557,0.000046791763,0.0006048474,0.00009205286,0.000033482305,0.0005739765,0.00025220355,0.0067228437,0.01028906,0.95593774,0.002863518,0.022346565],"study_design_scores_gemma":[0.00011555792,0.00012791877,0.000556002,0.00006325448,0.000049936923,0.0009118707,0.00026380026,0.047538254,0.008148797,0.9154734,0.026684593,0.00006659314],"about_ca_topic_score_codex":0.001124088,"about_ca_topic_score_gemma":0.0020745904,"teacher_disagreement_score":0.013317171,"about_ca_system_score_codex":0.0008131795,"about_ca_system_score_gemma":0.0007327705,"threshold_uncertainty_score":0.04455036},"labels":[],"label_agreement":null},{"id":"W130533876","doi":"","title":"Magic Squares, Finite Planes and Simple Quasilattices.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Magic square; Simple (philosophy); MAGIC (telescope); Geometry; Physics; Astrophysics","score_opus":0.012245092699127198,"score_gpt":0.22974198485979122,"score_spread":0.21749689216066403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W130533876","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3298452,0.015498806,0.3109066,0.0124034975,0.0011261607,0.00010159315,0.002070115,0.00071465404,0.32733348],"genre_scores_gemma":[0.86537594,0.0034655707,0.08329078,0.0011710795,0.00043734428,0.000100011144,0.0010593936,0.00014244087,0.044957478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994223,0.00018515672,0.000038476002,0.00012274345,0.0001393302,0.00009206133],"domain_scores_gemma":[0.99847883,0.00088716246,0.00017367091,0.0001754704,0.00011559007,0.00016925464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006044138,0.00042567414,0.00047825326,0.0010392849,0.0017122511,0.003281855,0.0007813359,0.0009698268,0.00981381],"category_scores_gemma":[0.0027296268,0.00049412565,0.0004902301,0.0016616114,0.0029444124,0.0065554427,0.0017997246,0.002003812,0.0011333611],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026602987,0.000011506408,0.00017208258,0.000044320408,0.0000056524905,0.00002924253,0.00008408514,0.00064903015,0.00036701915,0.9858642,0.0037385863,0.009007699],"study_design_scores_gemma":[0.000009687106,0.0000056654285,0.000121920166,0.000013039927,0.0000039489482,0.00008567397,0.00010109186,0.0014344221,0.000249498,0.9909689,0.007000146,0.0000060900934],"about_ca_topic_score_codex":0.0018632732,"about_ca_topic_score_gemma":0.003650164,"teacher_disagreement_score":0.00981381,"about_ca_system_score_codex":0.0013817943,"about_ca_system_score_gemma":0.0006525444,"threshold_uncertainty_score":0.032830477},"labels":[],"label_agreement":null},{"id":"W130582011","doi":"","title":"On Dudeney's Round Table Problem for p + 2.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematics and Applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Table (database); Arithmetic; Combinatorics; Computer science; Database","score_opus":0.05188723836033088,"score_gpt":0.2983532006843495,"score_spread":0.24646596232401863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W130582011","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32127124,0.0049610743,0.27068484,0.019784886,0.00191544,0.00060443615,0.0059877373,0.0022850265,0.37250528],"genre_scores_gemma":[0.7649666,0.0027283358,0.10602719,0.0017428099,0.00084125815,0.00029756123,0.004086308,0.00080525095,0.11850472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987336,0.00031625226,0.00007758644,0.00029536738,0.00022084852,0.00035627038],"domain_scores_gemma":[0.997072,0.0019585148,0.00017184338,0.00040215728,0.00016627161,0.00022916286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014001622,0.00094132626,0.0017290497,0.0010209082,0.0025567499,0.0038707233,0.0024924278,0.0024588082,0.032238144],"category_scores_gemma":[0.007483917,0.0006341666,0.00097373023,0.0019244987,0.0017787218,0.009497781,0.0037652424,0.0030030864,0.0046195444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011704145,0.00019887967,0.0011481997,0.00049504807,0.000067558496,0.000528084,0.0005639714,0.024660131,0.0018116466,0.77254224,0.09359652,0.103217304],"study_design_scores_gemma":[0.00015999835,0.00008709161,0.0005243953,0.00007439315,0.000037989168,0.00031577164,0.00031931108,0.03593093,0.0016909003,0.9356096,0.025189118,0.000060556238],"about_ca_topic_score_codex":0.0054047494,"about_ca_topic_score_gemma":0.0060537043,"teacher_disagreement_score":0.032238144,"about_ca_system_score_codex":0.001991426,"about_ca_system_score_gemma":0.001646791,"threshold_uncertainty_score":0.10784739},"labels":[],"label_agreement":null},{"id":"W130779696","doi":"","title":"Some results on mod (integral) sum graphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mod; Mathematics; Combinatorics; Discrete mathematics","score_opus":0.014993923481740027,"score_gpt":0.23965203163308585,"score_spread":0.22465810815134582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W130779696","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12517434,0.014788183,0.16887546,0.014201359,0.002113799,0.00012816164,0.0021523996,0.0013952046,0.6711711],"genre_scores_gemma":[0.7847683,0.018117284,0.08378691,0.006278851,0.0044168895,0.00029628043,0.003500952,0.0011040408,0.09773057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999099,0.00020214984,0.00004682436,0.00020249192,0.0002709799,0.0001785995],"domain_scores_gemma":[0.99612314,0.0024141537,0.0002733421,0.00050000654,0.00028162354,0.00040767528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013252452,0.0012264461,0.001126171,0.0034319567,0.0028388288,0.004417963,0.0020161548,0.0015136928,0.021801852],"category_scores_gemma":[0.0050366176,0.00083356985,0.00113965,0.0052579734,0.003273723,0.009274277,0.0034795299,0.004937439,0.0038610133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046086472,0.00007272975,0.00043206773,0.00026320395,0.000019648733,0.000087956025,0.00017624444,0.0014542124,0.000600234,0.95821095,0.01711899,0.021517646],"study_design_scores_gemma":[0.0000109523235,0.000011629592,0.00029878918,0.00003849644,0.000022004233,0.00017362325,0.000091926915,0.0021632784,0.00049345323,0.9802337,0.016451227,0.000010798607],"about_ca_topic_score_codex":0.0010636749,"about_ca_topic_score_gemma":0.0017307501,"teacher_disagreement_score":0.021801852,"about_ca_system_score_codex":0.0022890868,"about_ca_system_score_gemma":0.000841438,"threshold_uncertainty_score":0.07293451},"labels":[],"label_agreement":null},{"id":"W130781751","doi":"","title":"Some Characterizations of Harmonic Bergman Spaces in the Unit Ball.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Holomorphic and Operator Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Unit sphere; Ball (mathematics); Bergman kernel; Bergman space; Pure mathematics; Mathematical analysis; Bounded function","score_opus":0.04876669867102003,"score_gpt":0.27857966978258714,"score_spread":0.22981297111156712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W130781751","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3507043,0.0091138715,0.23355933,0.006964601,0.0008830411,0.00010824793,0.0011688124,0.0003669864,0.39713088],"genre_scores_gemma":[0.90872425,0.0033699966,0.023653157,0.0007972078,0.00090638583,0.000116244635,0.00074866787,0.00021248354,0.06147155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994752,0.00013574399,0.000031781838,0.000089134875,0.00016795189,0.00010015904],"domain_scores_gemma":[0.9989429,0.00038314355,0.00015450282,0.00007846012,0.0001644652,0.00027658293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083970034,0.00085780874,0.0006210553,0.0034991081,0.0015192132,0.003676568,0.0009983373,0.0010778748,0.014266328],"category_scores_gemma":[0.0025847526,0.00038544816,0.00057987147,0.0018210029,0.002637085,0.006049457,0.0025129607,0.002474681,0.0014350428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000602879,0.00000636,0.00007562053,0.000021551603,0.0000023794817,0.000030694984,0.000086919004,0.0001433208,0.0002029708,0.9961248,0.0011596674,0.002139621],"study_design_scores_gemma":[0.0000064135634,0.000012006547,0.00030435572,0.000016764232,0.0000045889556,0.00014750366,0.00019846723,0.002748554,0.00022601886,0.9905489,0.005776682,0.000009765481],"about_ca_topic_score_codex":0.00069256907,"about_ca_topic_score_gemma":0.0007524933,"teacher_disagreement_score":0.014266328,"about_ca_system_score_codex":0.0011349947,"about_ca_system_score_gemma":0.0004084399,"threshold_uncertainty_score":0.047725677},"labels":[],"label_agreement":null},{"id":"W131130404","doi":"","title":"Subgraphs orthogonal to a 1-factorization of complete bipartite graphs.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Combinatorics; Factorization; Complete bipartite graph; Discrete mathematics; Graph; Algorithm","score_opus":0.015412347984693804,"score_gpt":0.19371870108837577,"score_spread":0.17830635310368198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W131130404","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4427864,0.00082094374,0.36474112,0.0015600659,0.0006112978,0.00028727407,0.003574613,0.00078215153,0.18483621],"genre_scores_gemma":[0.8872316,0.00046724186,0.064439826,0.00059931114,0.00028259767,0.00019235407,0.0034269001,0.00020911581,0.043151073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993637,0.00015545133,0.000029705605,0.0001854622,0.00011570221,0.00015002939],"domain_scores_gemma":[0.9988102,0.00032480978,0.00026742902,0.00021579646,0.00020297582,0.00017875318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039667045,0.00042159157,0.00039940837,0.0010074025,0.0011310929,0.0013330353,0.0003526253,0.0006730869,0.013790566],"category_scores_gemma":[0.0018917369,0.00032223554,0.0004816738,0.0005815698,0.0008454174,0.0016555113,0.00077038235,0.00077948155,0.0017052639],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016960711,0.000087637105,0.000838669,0.00011361826,0.000024193952,0.0001706372,0.00019554546,0.0036794576,0.009035466,0.956293,0.011097435,0.01829467],"study_design_scores_gemma":[0.000039144186,0.000049765138,0.0014488546,0.00005187741,0.000020217147,0.00037706955,0.00024118624,0.01563926,0.0022722278,0.96384984,0.015990932,0.000019578543],"about_ca_topic_score_codex":0.0013105689,"about_ca_topic_score_gemma":0.003258721,"teacher_disagreement_score":0.013790566,"about_ca_system_score_codex":0.0006254069,"about_ca_system_score_gemma":0.0007058158,"threshold_uncertainty_score":0.046134055},"labels":[],"label_agreement":null},{"id":"W131723753","doi":"","title":"Maximal-clique Partitions of Different Sizes.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Clique; Combinatorics","score_opus":0.006993031492048129,"score_gpt":0.19831261128887817,"score_spread":0.19131957979683004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W131723753","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.638211,0.0015014716,0.17031035,0.0026591108,0.00050489476,0.00070439064,0.011422474,0.0018882082,0.17279816],"genre_scores_gemma":[0.9138122,0.00041754614,0.056214303,0.0004644304,0.000118585376,0.00037681538,0.004865711,0.00044935994,0.023280982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986406,0.0004099786,0.000046105,0.00026762747,0.0002988238,0.00033696333],"domain_scores_gemma":[0.9918826,0.0049435273,0.00033680015,0.0012663734,0.00081286626,0.00075778883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012673832,0.00054747745,0.0006734212,0.0017757558,0.0025737553,0.0028061154,0.0014254289,0.0013266469,0.024252884],"category_scores_gemma":[0.009390084,0.00058737356,0.0006215664,0.0015166771,0.0012653719,0.0032671045,0.0012813581,0.0010917287,0.0018539538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002484486,0.00054029835,0.0047974265,0.00063997257,0.00023510093,0.00046702544,0.0011747627,0.03364518,0.035778955,0.81371397,0.04985494,0.056667868],"study_design_scores_gemma":[0.0004517675,0.00016470083,0.009082546,0.00019909994,0.00021798683,0.0009546632,0.0015057962,0.14326034,0.030064547,0.7695735,0.04442518,0.00009996472],"about_ca_topic_score_codex":0.0019026471,"about_ca_topic_score_gemma":0.006130484,"teacher_disagreement_score":0.024252884,"about_ca_system_score_codex":0.0015830548,"about_ca_system_score_gemma":0.0010695547,"threshold_uncertainty_score":0.08113402},"labels":[],"label_agreement":null},{"id":"W13196732","doi":"10.1001/archinte.1954.00250030159019","title":"Minimal Enclosings of Triple Systems I: Adding One Point.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Triple point; Point (geometry); Geometry; Physics","score_opus":0.009213134216822294,"score_gpt":0.19176774308390987,"score_spread":0.18255460886708758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W13196732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2852162,0.0006732046,0.5788248,0.0007091391,0.00033683673,0.00013692414,0.0006722679,0.0013124468,0.13211812],"genre_scores_gemma":[0.77379876,0.00038372338,0.18701898,0.00030896676,0.00012671968,0.00017453876,0.00086261466,0.000519223,0.036806453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922335,0.00015878161,0.000061837134,0.00019340987,0.00020470862,0.00015785787],"domain_scores_gemma":[0.99774534,0.00085252104,0.00017401847,0.0006073013,0.00031611323,0.00030468495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047745317,0.0003701526,0.00065358414,0.0009192931,0.0015355101,0.001962419,0.0010159246,0.0010844861,0.011419287],"category_scores_gemma":[0.0032434345,0.0005769127,0.0007976901,0.0008882259,0.0016916896,0.0038118495,0.0038251088,0.0022040536,0.002123826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012363381,0.00005493652,0.0006625355,0.000113576396,0.000022387372,0.00027859554,0.0007844069,0.003097541,0.0067840205,0.9411166,0.004619674,0.042342123],"study_design_scores_gemma":[0.000025418934,0.00006952773,0.00036594036,0.00006973877,0.000037093054,0.00026603206,0.00045088204,0.009876357,0.0071688686,0.95418936,0.027455954,0.000024837447],"about_ca_topic_score_codex":0.00072201504,"about_ca_topic_score_gemma":0.0012391389,"teacher_disagreement_score":0.011419287,"about_ca_system_score_codex":0.0006809082,"about_ca_system_score_gemma":0.0004772748,"threshold_uncertainty_score":0.038201332},"labels":[],"label_agreement":null},{"id":"W132229103","doi":"","title":"On The Hamiltonian Decomposition of Special Product of Graphs.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Decomposition; Hamiltonian (control theory); Pure mathematics; Product (mathematics); Combinatorics; Geometry; Mathematical optimization; Chemistry","score_opus":0.014578783458912632,"score_gpt":0.27608336610827916,"score_spread":0.26150458264936655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W132229103","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36105633,0.0050278446,0.36443585,0.0028868667,0.0013689568,0.00011167336,0.00076036365,0.00044765425,0.26390445],"genre_scores_gemma":[0.8619061,0.0022414988,0.07072551,0.00095787377,0.0008599027,0.00010111134,0.0011169928,0.0004202387,0.06167087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996382,0.00012757952,0.000015284662,0.000063562795,0.00007482545,0.00008056344],"domain_scores_gemma":[0.999193,0.00027871458,0.00010566853,0.00011996719,0.000103374885,0.00019926336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050180714,0.0005074106,0.00051320577,0.0013956232,0.0011613232,0.0014471896,0.0007796112,0.0008348369,0.011117881],"category_scores_gemma":[0.001717419,0.0004608112,0.00067763095,0.00088706723,0.0018454636,0.0037732872,0.0018065573,0.0016655893,0.0017851382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031487736,0.00002213268,0.00021006995,0.000049690418,0.000010526752,0.000100517835,0.00023514022,0.00097604253,0.0007870839,0.98127675,0.005850397,0.010450237],"study_design_scores_gemma":[0.000006643804,0.000010450397,0.00019039285,0.000015332094,0.0000065921017,0.00010299713,0.00008715664,0.003948583,0.00020940119,0.99102414,0.0043935007,0.000004912223],"about_ca_topic_score_codex":0.0008223754,"about_ca_topic_score_gemma":0.0015728222,"teacher_disagreement_score":0.011117881,"about_ca_system_score_codex":0.00061115937,"about_ca_system_score_gemma":0.00028032745,"threshold_uncertainty_score":0.037193},"labels":[],"label_agreement":null},{"id":"W132247431","doi":"","title":"Graceful labelings of cyclic snakes.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.0123412337332058,"score_gpt":0.22917732223805584,"score_spread":0.21683608850485003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W132247431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3210734,0.001970391,0.4782087,0.002698436,0.00052491477,0.00012804495,0.0014500051,0.0019006104,0.1920455],"genre_scores_gemma":[0.83681756,0.001342986,0.10690931,0.000646676,0.00034133243,0.00014703574,0.001539509,0.0007267969,0.0515288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946266,0.00012638801,0.00003341133,0.00014157673,0.00013073694,0.00010531891],"domain_scores_gemma":[0.9982627,0.0006034848,0.00025437368,0.00045702938,0.0001407228,0.0002815773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004967966,0.00047066665,0.00046330434,0.0014117938,0.0017533537,0.002338434,0.0009871037,0.0009596431,0.01097231],"category_scores_gemma":[0.0025716128,0.0004811631,0.00074158644,0.0012995896,0.0020979403,0.003364004,0.002348146,0.0017289954,0.0018201545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003485572,0.0000146098655,0.0002178524,0.000039609527,0.0000060007787,0.00005127814,0.00019085694,0.0023991114,0.0015244723,0.97546786,0.0045493627,0.015504193],"study_design_scores_gemma":[0.000010419125,0.000016073653,0.00019570535,0.000021436595,0.000008724504,0.00013752058,0.000121468816,0.008888363,0.0014330014,0.971383,0.01777069,0.000013610592],"about_ca_topic_score_codex":0.0012814014,"about_ca_topic_score_gemma":0.0017976031,"teacher_disagreement_score":0.01097231,"about_ca_system_score_codex":0.0011535644,"about_ca_system_score_gemma":0.00039809657,"threshold_uncertainty_score":0.03670609},"labels":[],"label_agreement":null},{"id":"W132858928","doi":"","title":"Distance between two k-sets and Path-Systems Extendibility.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Path graph; Vertex (graph theory); Graph; Induced path; Disjoint sets; Path (computing); Connectivity; Bound graph; Discrete mathematics; Distance; Graph power; Shortest path problem; Line graph; Computer science","score_opus":0.01747837690461657,"score_gpt":0.2805900898952599,"score_spread":0.26311171299064334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W132858928","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81000173,0.001999161,0.12059123,0.0012702352,0.00018366768,0.0000954649,0.0014689751,0.00034376857,0.06404571],"genre_scores_gemma":[0.9690652,0.00041979906,0.025168182,0.00009820021,0.0001130547,0.000076974065,0.0007738093,0.00003371913,0.0042510745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99867946,0.0002879955,0.00013615534,0.00041083334,0.0003144884,0.00017093236],"domain_scores_gemma":[0.9941766,0.0033571075,0.000978005,0.00043533245,0.00040573927,0.0006471621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001018075,0.00048249456,0.0006153138,0.0032167197,0.0015973464,0.002292641,0.001160754,0.000965491,0.005499405],"category_scores_gemma":[0.006361611,0.00039072527,0.0007165249,0.0026322186,0.0031251826,0.0044657676,0.0031039729,0.0013493417,0.0006828272],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029532565,0.00006520516,0.0049085044,0.00023297012,0.000063615036,0.00045700162,0.0014921062,0.011726172,0.00190476,0.94686943,0.0018033588,0.030181488],"study_design_scores_gemma":[0.000039794286,0.0001586888,0.0027829285,0.000074174844,0.000035993682,0.0008158638,0.0004334171,0.019210422,0.0012502642,0.96479666,0.010357663,0.00004409243],"about_ca_topic_score_codex":0.00071132963,"about_ca_topic_score_gemma":0.00051500543,"teacher_disagreement_score":0.005499405,"about_ca_system_score_codex":0.0013269079,"about_ca_system_score_gemma":0.0004026186,"threshold_uncertainty_score":0.018397331},"labels":[],"label_agreement":null},{"id":"W132979487","doi":"","title":"The uniqueness of the generalized quadrangle of order 5 with an axis of symmetry.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Uniqueness; Quadrangle; Mathematics; Symmetry (geometry); Order (exchange); Pure mathematics; Geometry; Mathematical analysis; Geology; Geomorphology","score_opus":0.007763172392274823,"score_gpt":0.1928783009272191,"score_spread":0.18511512853494427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W132979487","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5995152,0.0010329606,0.13325605,0.0014308123,0.0011478554,0.00011711447,0.0006640246,0.00018739323,0.26264858],"genre_scores_gemma":[0.9388327,0.0002780282,0.02257677,0.00027355857,0.00016502578,0.000052237257,0.0004374047,0.00010466793,0.03727964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962425,0.00008981293,0.000016228214,0.000086187276,0.000084485124,0.00009905848],"domain_scores_gemma":[0.99945956,0.00013536296,0.000120568046,0.00007642918,0.00009023716,0.00011788622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002756636,0.00033676944,0.0003570222,0.0008132093,0.0014626886,0.0016577969,0.00056128344,0.00084593956,0.014309389],"category_scores_gemma":[0.0016930471,0.00032255394,0.00050575536,0.00039433365,0.0017555826,0.0018038566,0.0013509992,0.00113346,0.0023124393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007220461,0.000013284836,0.00040981904,0.000029985787,0.000006229441,0.00017860997,0.00012959685,0.00087893324,0.0022351153,0.986668,0.002635206,0.0067429207],"study_design_scores_gemma":[0.000047865648,0.00006215672,0.0010031069,0.00003190519,0.000009047489,0.0007525459,0.00039175764,0.006906517,0.0022055712,0.97296417,0.015598068,0.000027403146],"about_ca_topic_score_codex":0.001285344,"about_ca_topic_score_gemma":0.001369107,"teacher_disagreement_score":0.014309389,"about_ca_system_score_codex":0.00045170102,"about_ca_system_score_gemma":0.0005924688,"threshold_uncertainty_score":0.047869623},"labels":[],"label_agreement":null},{"id":"W133375184","doi":"","title":"The spectrum for self-converse directed BIBDs with block size four.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Optical Network Technologies","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Converse; Mathematics; Spectrum (functional analysis); Block (permutation group theory); Combinatorics; Geometry; Physics","score_opus":0.004920904878027225,"score_gpt":0.18477984442669784,"score_spread":0.1798589395486706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W133375184","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5139947,0.0015675846,0.19822648,0.0021143227,0.0004925892,0.00011162021,0.0010222851,0.0005059802,0.28196448],"genre_scores_gemma":[0.97431767,0.00044093805,0.012247398,0.00035656765,0.00009863478,0.00010093264,0.00017795607,0.000059915918,0.012200062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994685,0.00012929345,0.000026432606,0.000054076954,0.00016681866,0.00015491957],"domain_scores_gemma":[0.9985525,0.0007351984,0.00014091504,0.00015742893,0.00018189421,0.00023203135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006300807,0.00040220426,0.00039774907,0.0014018393,0.0012341293,0.0017421601,0.0006732332,0.0009524649,0.011679517],"category_scores_gemma":[0.002310105,0.00026541622,0.00026068452,0.00053408596,0.0012171315,0.0016000157,0.0014304094,0.0007152161,0.0016013546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027651832,0.000033050383,0.00019072222,0.00009646278,0.0000112458365,0.0001829535,0.00014650064,0.0031048295,0.007827142,0.97511965,0.0038314448,0.009179583],"study_design_scores_gemma":[0.0000977229,0.00007855034,0.00038981088,0.00008715235,0.00001391462,0.00051327026,0.00019293286,0.057358295,0.0050464957,0.9298651,0.006317205,0.000039520466],"about_ca_topic_score_codex":0.00035942384,"about_ca_topic_score_gemma":0.00041421602,"teacher_disagreement_score":0.011679517,"about_ca_system_score_codex":0.00076802395,"about_ca_system_score_gemma":0.0004874195,"threshold_uncertainty_score":0.039071918},"labels":[],"label_agreement":null},{"id":"W133616081","doi":"","title":"Maximum genus, Girth and Maximum non-adjacent edge set.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Genus; Girth (graph theory); Enhanced Data Rates for GSM Evolution; Combinatorics; Set (abstract data type); Biology; Zoology; Computer science; Artificial intelligence","score_opus":0.012424787092114708,"score_gpt":0.2552469536248937,"score_spread":0.242822166532779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W133616081","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6891091,0.00731185,0.12495866,0.005503532,0.00059497805,0.00009407602,0.0027069952,0.00088447606,0.16883643],"genre_scores_gemma":[0.9655655,0.0025829214,0.022075817,0.00027349664,0.0004989983,0.00008287313,0.0006834814,0.00016182564,0.008075171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922,0.00019225836,0.000038876628,0.00019520556,0.00018690132,0.00016673998],"domain_scores_gemma":[0.99411917,0.0035902257,0.00086809584,0.0005422312,0.00027810966,0.00060216116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082749274,0.00074788724,0.0010156778,0.003110754,0.0016474851,0.0026911125,0.0015710815,0.0014518428,0.0071069393],"category_scores_gemma":[0.008390505,0.00068729254,0.00063438655,0.0027875619,0.0038000057,0.0051196082,0.002590086,0.0020921174,0.001102188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003980997,0.000090826994,0.0064650727,0.0003135724,0.00007977119,0.00051053223,0.0007056496,0.010826934,0.006044445,0.9050519,0.015899558,0.05361375],"study_design_scores_gemma":[0.000022017399,0.00003539718,0.0025718915,0.000063002655,0.000053630632,0.0008658645,0.0002585803,0.008170929,0.0013367257,0.98049104,0.006110837,0.000020032641],"about_ca_topic_score_codex":0.0005138899,"about_ca_topic_score_gemma":0.0006966654,"teacher_disagreement_score":0.0071069393,"about_ca_system_score_codex":0.0010047355,"about_ca_system_score_gemma":0.00048189057,"threshold_uncertainty_score":0.023775041},"labels":[],"label_agreement":null},{"id":"W133646803","doi":"","title":"Special Kinds of Domination Parameters of Edge-Deleted Graphs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Artificial intelligence; Computer science","score_opus":0.018127951429485374,"score_gpt":0.2739325109925119,"score_spread":0.25580455956302656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W133646803","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4605972,0.0018736509,0.20644219,0.0020760144,0.0005444825,0.00020980934,0.0023766612,0.0024661464,0.3234139],"genre_scores_gemma":[0.9694196,0.00045057645,0.01213715,0.00034963212,0.00016727812,0.000120079596,0.00082997355,0.00045334882,0.016072504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982395,0.00037312598,0.00012884095,0.00044913724,0.0004406665,0.0003687128],"domain_scores_gemma":[0.99168724,0.003998148,0.0008250255,0.0022248884,0.00058155984,0.0006831041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001343767,0.0005663764,0.0006641488,0.0022795256,0.0018965013,0.005787019,0.0022985777,0.0023063251,0.014468371],"category_scores_gemma":[0.012909604,0.0007301512,0.000728293,0.0020176903,0.0030110104,0.011100218,0.0031024448,0.003232741,0.0016618328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096205775,0.000024740106,0.0009533287,0.000053884003,0.000013920583,0.0002377569,0.0004383591,0.0006053274,0.0018145446,0.98590523,0.0024881116,0.007368443],"study_design_scores_gemma":[0.000031935935,0.0000093355475,0.00043334477,0.000029804376,0.000019907953,0.00077074085,0.00028384867,0.0028217759,0.0022968042,0.9829853,0.010286531,0.000030600128],"about_ca_topic_score_codex":0.00041574278,"about_ca_topic_score_gemma":0.0006039836,"teacher_disagreement_score":0.014468371,"about_ca_system_score_codex":0.0015324493,"about_ca_system_score_gemma":0.00050374714,"threshold_uncertainty_score":0.048401535},"labels":[],"label_agreement":null},{"id":"W134149244","doi":"","title":"The Major Index Specialization of the q, t-Catalan.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Catalan; Index (typography); Statistics; Humanities; Computer science","score_opus":0.019318537652325007,"score_gpt":0.29437277512754806,"score_spread":0.27505423747522306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W134149244","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08341647,0.0017266164,0.05264848,0.0036825472,0.0024386619,0.00006399872,0.00069659523,0.00031384296,0.8550128],"genre_scores_gemma":[0.78026915,0.001331687,0.019167375,0.0026690227,0.0013973452,0.00009087805,0.0005924332,0.000361128,0.19412096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939704,0.00012817673,0.000029722069,0.00014478399,0.00017501747,0.00012529914],"domain_scores_gemma":[0.999463,0.00008642233,0.00005364504,0.000101745456,0.00016371325,0.00013154402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053709693,0.00046675882,0.00044829788,0.0011840453,0.0017450375,0.002158236,0.00070629956,0.0006801446,0.016692474],"category_scores_gemma":[0.0015139054,0.00019754858,0.00062449736,0.00089872215,0.0021077583,0.00249635,0.0017862344,0.0021231489,0.00445035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026817865,0.000009600773,0.00008621904,0.000026528289,0.0000032279997,0.000085343556,0.0001085844,0.00008797668,0.0009577671,0.9805015,0.008860293,0.009246277],"study_design_scores_gemma":[0.000016827653,0.000028651457,0.0005961911,0.0000187946,0.000006726001,0.00050374947,0.00011311271,0.0011712414,0.0010746485,0.94603366,0.050423842,0.000012653068],"about_ca_topic_score_codex":0.0022638384,"about_ca_topic_score_gemma":0.0019447764,"teacher_disagreement_score":0.016692474,"about_ca_system_score_codex":0.0014594718,"about_ca_system_score_gemma":0.0009324365,"threshold_uncertainty_score":0.055841923},"labels":[],"label_agreement":null},{"id":"W134387898","doi":"","title":"Adding evidence to the Erdos-Faber-Lovasz conjecture.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Italy: Economic History and Contemporary Issues","field":"Economics, Econometrics and Finance","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Conjecture; Combinatorics","score_opus":0.04057486339793834,"score_gpt":0.2382929888703281,"score_spread":0.19771812547238976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W134387898","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1335844,0.0334351,0.12251627,0.11288393,0.0055016438,0.00006444835,0.0022597357,0.00064366765,0.58911085],"genre_scores_gemma":[0.9200006,0.013854449,0.016318476,0.007872443,0.0066448953,0.00009147215,0.0011302432,0.00025774675,0.03382977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997875,0.00081571453,0.0000940453,0.00035941618,0.000625905,0.00022990584],"domain_scores_gemma":[0.9809536,0.011907644,0.0020241903,0.002591748,0.0018166739,0.00070618914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026366236,0.00058307365,0.0014689987,0.0027421308,0.002205943,0.0057412353,0.0018177493,0.0027826405,0.0296282],"category_scores_gemma":[0.03158858,0.0004332966,0.000872963,0.0034262205,0.005176856,0.014533873,0.003660808,0.005242081,0.0038941307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006754302,0.000026999449,0.00074261165,0.000081934486,0.000016612048,0.00008727073,0.00007871128,0.0006035631,0.00007359038,0.971991,0.0155647695,0.0106654],"study_design_scores_gemma":[0.000025356087,0.000008924214,0.0006310332,0.000044117165,0.000010875106,0.00010367728,0.000061939,0.0016748246,0.00006390588,0.98385274,0.013512411,0.000010144848],"about_ca_topic_score_codex":0.0014790919,"about_ca_topic_score_gemma":0.0012766083,"teacher_disagreement_score":0.0296282,"about_ca_system_score_codex":0.0016146655,"about_ca_system_score_gemma":0.0010040656,"threshold_uncertainty_score":0.09911615},"labels":[],"label_agreement":null},{"id":"W134620505","doi":"","title":"On a generalization of signed total dominating functions of graphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Generalization; Combinatorics; Discrete mathematics; Mathematical analysis","score_opus":0.012171298720965895,"score_gpt":0.2663995398700411,"score_spread":0.2542282411490752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W134620505","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1665596,0.0027786056,0.62822014,0.0033057956,0.0012721831,0.00014784849,0.00079571723,0.000626985,0.1962931],"genre_scores_gemma":[0.8187363,0.0042104814,0.09229762,0.0021813826,0.0015841635,0.00024567344,0.0010564848,0.0005815636,0.0791064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991899,0.00023364079,0.000045083336,0.00017594805,0.00022219743,0.00013328202],"domain_scores_gemma":[0.99659735,0.0017220238,0.0002453143,0.0005787331,0.00050552096,0.00035102575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014996884,0.00095023005,0.0007379295,0.0029121283,0.0014536115,0.0031915694,0.0013690582,0.001026636,0.006976367],"category_scores_gemma":[0.0086384015,0.00035226493,0.0012550175,0.002848154,0.0023686928,0.007789737,0.002723121,0.002679637,0.0011865026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018319026,0.000016275264,0.00020734502,0.000040783514,0.000008056124,0.000047761994,0.00011690653,0.0016863247,0.00042682307,0.9807083,0.0027510005,0.013972059],"study_design_scores_gemma":[0.000007710681,0.000019728237,0.00020161316,0.000026574375,0.0000137989955,0.00018752311,0.00007719249,0.00954597,0.00034245732,0.9793474,0.010219612,0.000010472814],"about_ca_topic_score_codex":0.0012343486,"about_ca_topic_score_gemma":0.0011755141,"teacher_disagreement_score":0.006976367,"about_ca_system_score_codex":0.0016816813,"about_ca_system_score_gemma":0.000733193,"threshold_uncertainty_score":0.023338258},"labels":[],"label_agreement":null},{"id":"W134708599","doi":"","title":"A note on integral sum crowns.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.006871076022382889,"score_gpt":0.2045657210963019,"score_spread":0.197694645073919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W134708599","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032222036,0.014624481,0.25373933,0.009296001,0.00767388,0.00007752358,0.00045322313,0.0005973224,0.68131626],"genre_scores_gemma":[0.59361184,0.024650207,0.20381698,0.0061124894,0.0072128125,0.00014285503,0.0005860917,0.00092698296,0.16293971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992453,0.00014625317,0.00003163837,0.00014672006,0.00029659586,0.00013345057],"domain_scores_gemma":[0.9980015,0.0009841995,0.00009149585,0.00042437165,0.00028163573,0.00021681689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008572298,0.00051445985,0.0008329394,0.0015176132,0.0027736877,0.0034727396,0.0014793187,0.0013818812,0.016443409],"category_scores_gemma":[0.005677263,0.0004577577,0.0007247212,0.0021631338,0.0026484418,0.0063804258,0.0036679527,0.004641987,0.0041658664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018752626,0.000011159859,0.00009572083,0.000046651767,0.0000051391266,0.000084474625,0.00008589145,0.0005289497,0.00042426575,0.96743023,0.012872334,0.018396415],"study_design_scores_gemma":[0.000004301699,0.000011784369,0.00013473113,0.00003747862,0.000010362316,0.00034945013,0.00007087229,0.0022507804,0.00053282577,0.9252099,0.071377754,0.000009818509],"about_ca_topic_score_codex":0.0013992557,"about_ca_topic_score_gemma":0.0027272722,"teacher_disagreement_score":0.016443409,"about_ca_system_score_codex":0.001287311,"about_ca_system_score_gemma":0.00061863556,"threshold_uncertainty_score":0.05500865},"labels":[],"label_agreement":null},{"id":"W134861336","doi":"","title":"On The Trees Whose 2-Step Competition Numbers Are Two.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Competition (biology); Biology; Ecology","score_opus":0.04567934963282414,"score_gpt":0.3360517443376116,"score_spread":0.29037239470478743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W134861336","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34329697,0.0022002473,0.35038784,0.006436157,0.000486382,0.00023613367,0.0024941997,0.00035622934,0.29410583],"genre_scores_gemma":[0.8883951,0.0015340364,0.06930285,0.0009007622,0.00027695688,0.00026859946,0.00090626866,0.000112365764,0.038303073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848515,0.0005578755,0.0000558554,0.00021339052,0.00024530903,0.00044252202],"domain_scores_gemma":[0.9944154,0.0039595906,0.00050074706,0.00023682824,0.00032036717,0.00056704367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012496255,0.00062589045,0.0010624268,0.0017427233,0.0016371219,0.0035158677,0.0013033741,0.002163726,0.018754018],"category_scores_gemma":[0.0064646294,0.00038983847,0.00075316435,0.0015244277,0.002634643,0.005763601,0.0015303092,0.0026283208,0.0020638579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075513264,0.00003860539,0.00038392126,0.0000782116,0.000019978079,0.0000852066,0.00008964643,0.008895164,0.0007120096,0.9748921,0.005351081,0.009378681],"study_design_scores_gemma":[0.000025833573,0.000019559096,0.000372668,0.000030164394,0.000011550116,0.000105748084,0.00007142592,0.02677141,0.00026395466,0.96813536,0.004176961,0.00001549449],"about_ca_topic_score_codex":0.0017656107,"about_ca_topic_score_gemma":0.0026024946,"teacher_disagreement_score":0.018754018,"about_ca_system_score_codex":0.0018056004,"about_ca_system_score_gemma":0.001212783,"threshold_uncertainty_score":0.06273842},"labels":[],"label_agreement":null},{"id":"W134865982","doi":"","title":"One Recursion Formula of Second-Order Recurrent Sequences.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Recursion (computer science); Mathematics; Order (exchange); Applied mathematics; Double recursion; Pure mathematics; Algorithm","score_opus":0.05517697584363832,"score_gpt":0.31439388082678565,"score_spread":0.2592169049831473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W134865982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14797084,0.0041535883,0.48964718,0.0027563658,0.001292974,0.00007728624,0.00069002167,0.00086518395,0.3525465],"genre_scores_gemma":[0.8731205,0.0012990244,0.052982673,0.0007469508,0.000644592,0.00007246814,0.0004710874,0.0003025484,0.070360176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999331,0.00013687843,0.000041956693,0.00012510305,0.0002499422,0.00011515639],"domain_scores_gemma":[0.99864715,0.0005637617,0.0001225482,0.0002001419,0.00033974467,0.00012667652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084924855,0.00060461485,0.00061206234,0.0013796096,0.0011877483,0.0026649067,0.0010654143,0.0012684399,0.008933343],"category_scores_gemma":[0.0041061016,0.00033113087,0.0009058987,0.00096591836,0.0018349855,0.004659562,0.0015231633,0.0023585854,0.002104271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000127782305,0.00001078584,0.00014382025,0.000028241131,0.000004334632,0.000070598486,0.00011696708,0.00024137786,0.00064725004,0.9903116,0.0012806932,0.007131521],"study_design_scores_gemma":[0.000008169343,0.000015642883,0.00015001003,0.000021274138,0.000011159003,0.00024345942,0.000038901788,0.0045565506,0.00077922875,0.98721945,0.0069418824,0.000014268541],"about_ca_topic_score_codex":0.0009913812,"about_ca_topic_score_gemma":0.0014411816,"teacher_disagreement_score":0.008933343,"about_ca_system_score_codex":0.0014254304,"about_ca_system_score_gemma":0.0007484497,"threshold_uncertainty_score":0.029884994},"labels":[],"label_agreement":null},{"id":"W135015279","doi":"","title":"Classification of Optimal Linear Z4 Rate 1/2 Codes of Length <= 8.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01200983823082374,"score_gpt":0.22912365217522115,"score_spread":0.2171138139443974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W135015279","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7262555,0.011170926,0.09744914,0.0047974996,0.00044131378,0.0003710869,0.004086761,0.0013644685,0.15406331],"genre_scores_gemma":[0.9228071,0.0037637705,0.041246302,0.0008681375,0.00034169998,0.0003276165,0.0045597944,0.00034663343,0.025738928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992131,0.00014008743,0.00005516852,0.00009762653,0.0002730093,0.00022094636],"domain_scores_gemma":[0.9971521,0.0013602247,0.00066387176,0.00028201716,0.00032101516,0.00022068163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005324338,0.00083927554,0.0007696955,0.0023371608,0.0009440832,0.002589113,0.0010408052,0.0018114081,0.009626181],"category_scores_gemma":[0.004628993,0.00053546834,0.00056464213,0.0015753253,0.001268612,0.0013889214,0.0012231091,0.0013030153,0.0018295646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013329006,0.0003134096,0.005397215,0.0009746851,0.00007642475,0.00052255165,0.0004676606,0.042768802,0.019345986,0.67016584,0.05159879,0.20703578],"study_design_scores_gemma":[0.0004856485,0.00056706654,0.0055062524,0.00050035,0.000107439235,0.0016395538,0.00044611725,0.16015162,0.012850186,0.7670411,0.05057646,0.0001282816],"about_ca_topic_score_codex":0.00093513675,"about_ca_topic_score_gemma":0.0011961994,"teacher_disagreement_score":0.009626181,"about_ca_system_score_codex":0.0015575472,"about_ca_system_score_gemma":0.0015432796,"threshold_uncertainty_score":0.03220278},"labels":[],"label_agreement":null},{"id":"W135019761","doi":"","title":"Complete bipartite free graphs.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Complete bipartite graph; Cograph; Chordal graph; 1-planar graph; Graph","score_opus":0.025079521374824644,"score_gpt":0.27375007785731814,"score_spread":0.2486705564824935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W135019761","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13004683,0.0039649997,0.18012545,0.00588108,0.00078412646,0.00024359909,0.009324768,0.0013384434,0.6682906],"genre_scores_gemma":[0.7161739,0.0025207994,0.039594118,0.0020443075,0.0005759287,0.00027784487,0.0103114275,0.000394388,0.2281073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993568,0.0001450074,0.00002196803,0.00016450556,0.0001754767,0.00013631007],"domain_scores_gemma":[0.9983449,0.0006678263,0.00016476726,0.0002755832,0.00028100092,0.0002660184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004442986,0.00050279254,0.0006064409,0.0011457977,0.0014801346,0.0017908334,0.0009182478,0.001007118,0.030653294],"category_scores_gemma":[0.0023528815,0.0003686687,0.00045644728,0.0014700784,0.00085918256,0.0027430735,0.0014854026,0.0015288908,0.0052576563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118703494,0.00007551775,0.00053912256,0.00022606322,0.000039018618,0.00013891458,0.00020039137,0.0016009483,0.0021289268,0.896534,0.05634958,0.04204864],"study_design_scores_gemma":[0.000028845245,0.000016383008,0.00065346085,0.000045695575,0.00002746567,0.00024917113,0.00009914916,0.0050178953,0.0012023589,0.9334585,0.059188146,0.000012942969],"about_ca_topic_score_codex":0.0014769455,"about_ca_topic_score_gemma":0.0031052448,"teacher_disagreement_score":0.030653294,"about_ca_system_score_codex":0.0009600789,"about_ca_system_score_gemma":0.0007484982,"threshold_uncertainty_score":0.1025455},"labels":[],"label_agreement":null},{"id":"W135039823","doi":"","title":"Minimal Enclosings of Triple Systems II: Increasing The Index By 1.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Statistics; Computer science","score_opus":0.0051966860520873195,"score_gpt":0.1834440522645888,"score_spread":0.17824736621250148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W135039823","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.612032,0.0005572829,0.3014746,0.00044084515,0.00017619265,0.00012264423,0.0007982218,0.0011384275,0.08325975],"genre_scores_gemma":[0.87574565,0.00032137628,0.102591604,0.00016369257,0.00006677816,0.00014059868,0.00088438555,0.00042299385,0.019662876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994424,0.000111680994,0.000050628016,0.00011621285,0.000130184,0.00014885327],"domain_scores_gemma":[0.99736625,0.0010102546,0.00028900037,0.0005667545,0.0003492772,0.0004184317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037249154,0.00029710942,0.0004683196,0.000830948,0.0010473646,0.0014849309,0.00070214196,0.0006593158,0.007600476],"category_scores_gemma":[0.0030447633,0.00037873554,0.00041758936,0.0007759735,0.00082744774,0.002202018,0.0020759858,0.0012384056,0.0013141481],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006214088,0.00022053884,0.0033112015,0.00034711036,0.000048981972,0.000649932,0.0016015243,0.01327934,0.06162268,0.77365655,0.011932085,0.13270867],"study_design_scores_gemma":[0.00007483764,0.0002844777,0.0020070125,0.00015831331,0.000079138365,0.00074189104,0.0007690928,0.052401833,0.05455407,0.8475431,0.041334953,0.000051158026],"about_ca_topic_score_codex":0.00055028475,"about_ca_topic_score_gemma":0.0012402921,"teacher_disagreement_score":0.007600476,"about_ca_system_score_codex":0.0005575845,"about_ca_system_score_gemma":0.0003928407,"threshold_uncertainty_score":0.02542615},"labels":[],"label_agreement":null},{"id":"W13527032","doi":"","title":"Norms of circulant and semicirculant matrices and Horadams sequence.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Circulant matrix; Mathematics; Sequence (biology); Combinatorics; Genetics; Biology","score_opus":0.008280693447397824,"score_gpt":0.20718506679663845,"score_spread":0.19890437334924063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W13527032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2870264,0.0033207783,0.5114308,0.0018757316,0.0013443131,0.00009780613,0.0009916495,0.000501211,0.19341128],"genre_scores_gemma":[0.86459905,0.0018871046,0.06556655,0.0006547163,0.0009105921,0.00016232346,0.0006367117,0.00024855215,0.06533438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991998,0.00024201683,0.00003502994,0.00014121739,0.00025862624,0.00012335808],"domain_scores_gemma":[0.9963367,0.0013261627,0.0005458201,0.0002690527,0.0010230594,0.0004990965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078505225,0.00052435615,0.00039790096,0.0020774137,0.0007412265,0.0016502064,0.0008113474,0.00061624165,0.009271043],"category_scores_gemma":[0.0053676344,0.00017177926,0.0002588555,0.000917109,0.0017304783,0.0022460737,0.00089093234,0.0010697641,0.001885821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004393865,0.00001751403,0.00015936437,0.000027737988,0.0000044291014,0.000053586587,0.000105521925,0.0013748027,0.0015022906,0.9831254,0.002279552,0.011305924],"study_design_scores_gemma":[0.000011692188,0.000040883915,0.00038704256,0.000025245157,0.000004743488,0.00020749026,0.0001287231,0.023647934,0.0015557822,0.96600324,0.007958623,0.000028609074],"about_ca_topic_score_codex":0.0010818265,"about_ca_topic_score_gemma":0.0016297316,"teacher_disagreement_score":0.009271043,"about_ca_system_score_codex":0.0006852846,"about_ca_system_score_gemma":0.00066654885,"threshold_uncertainty_score":0.03101474},"labels":[],"label_agreement":null},{"id":"W135314135","doi":"","title":"Two Classes of Graceful Graphs.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.01052636086573362,"score_gpt":0.23531244286965577,"score_spread":0.22478608200392217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W135314135","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42008337,0.002383849,0.19306636,0.008763963,0.00071100745,0.00032278197,0.00432726,0.0021369925,0.36820444],"genre_scores_gemma":[0.9207299,0.0011117146,0.025946654,0.001470535,0.00041380394,0.00025028002,0.0026189482,0.0002892408,0.04716896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989103,0.00016101441,0.00005009049,0.00034131348,0.00024517463,0.00029199934],"domain_scores_gemma":[0.9967368,0.0011058324,0.00049187307,0.0008076682,0.00020949928,0.00064831093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006308702,0.00064661296,0.0005017211,0.0019872028,0.0017970453,0.0044212085,0.0012974067,0.0014859013,0.015236533],"category_scores_gemma":[0.0039396356,0.00048051908,0.00084825896,0.0015937027,0.0028885328,0.0047454587,0.0025151824,0.0022427102,0.001287159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049524853,0.000025872181,0.00048561746,0.0000355845,0.0000052585538,0.00005994428,0.00018073453,0.00062859757,0.0005148039,0.98401445,0.005837436,0.008162079],"study_design_scores_gemma":[0.000027133925,0.000016282615,0.0007515479,0.000028502194,0.000013277677,0.00021770799,0.00017588763,0.0041842368,0.0007946153,0.97257125,0.021201205,0.00001830405],"about_ca_topic_score_codex":0.0017160256,"about_ca_topic_score_gemma":0.0021478585,"teacher_disagreement_score":0.015236533,"about_ca_system_score_codex":0.001993516,"about_ca_system_score_gemma":0.0008604853,"threshold_uncertainty_score":0.05097127},"labels":[],"label_agreement":null},{"id":"W135324672","doi":"","title":"{K (1, 3) , Z 2 }-Free Graphs of Low Connectivity.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.010826840453081158,"score_gpt":0.22267370441509307,"score_spread":0.2118468639620119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W135324672","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7501452,0.0010081044,0.08992382,0.0028464857,0.00023835398,0.00010634709,0.003218795,0.0012275744,0.15128542],"genre_scores_gemma":[0.95695627,0.00031095694,0.014595804,0.00040616075,0.00004552988,0.00007632029,0.0017214855,0.000115144416,0.025772305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997557,0.0000535446,0.000012108117,0.00005015756,0.000042230175,0.00008628275],"domain_scores_gemma":[0.9986092,0.0006063097,0.00028572822,0.00015069704,0.00012940238,0.0002186588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019417779,0.0003500481,0.00035562165,0.0010453565,0.0013082119,0.0015065644,0.00077125133,0.0007307686,0.014479779],"category_scores_gemma":[0.0018708523,0.00034217647,0.00027742248,0.0007672394,0.0007747355,0.001731196,0.0010379426,0.0010448208,0.0015331928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054566027,0.00009218825,0.0022584337,0.00037867896,0.00006675296,0.0007528238,0.0003845937,0.0079714935,0.015132972,0.9097896,0.030789481,0.03183728],"study_design_scores_gemma":[0.00009486451,0.000059565227,0.0031301172,0.00007350485,0.000056359033,0.00068994315,0.00025930276,0.015165974,0.00589788,0.95111114,0.023421254,0.000040106457],"about_ca_topic_score_codex":0.0014429999,"about_ca_topic_score_gemma":0.0034174884,"teacher_disagreement_score":0.014479779,"about_ca_system_score_codex":0.00069393375,"about_ca_system_score_gemma":0.0004713044,"threshold_uncertainty_score":0.04843968},"labels":[],"label_agreement":null},{"id":"W135381368","doi":"","title":"Isomorphisms of Connected Cyclic Abelian Covers of Symmetric Digraphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"advanced mathematical theories","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Abelian group; Combinatorics; Pure mathematics","score_opus":0.017102414652965185,"score_gpt":0.2706759823088288,"score_spread":0.2535735676558636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W135381368","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6720135,0.0010842142,0.071330525,0.0010454302,0.0003815637,0.00009855383,0.00081808446,0.0005118128,0.25271636],"genre_scores_gemma":[0.9688063,0.00042080853,0.006341177,0.00020083971,0.00019622469,0.000053325286,0.00061959936,0.00008779822,0.023273876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993167,0.00016076499,0.000037772497,0.0001357543,0.00017391646,0.00017514866],"domain_scores_gemma":[0.9988003,0.00057126983,0.00015104316,0.0001632509,0.00009939189,0.00021462732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032512326,0.00037365133,0.00038473596,0.002429246,0.0014690701,0.002197002,0.00050614093,0.0006558698,0.01100828],"category_scores_gemma":[0.0016978962,0.00040121685,0.000575696,0.0011953926,0.0015409567,0.003590534,0.0023681384,0.0012257858,0.0008999488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024887355,0.00002227801,0.00037497078,0.000021567317,0.000007769338,0.00017196809,0.00029366804,0.00027377726,0.00090518687,0.99197,0.0010839481,0.0048499815],"study_design_scores_gemma":[0.000015675227,0.000016872034,0.00085569266,0.000016880387,0.000018151475,0.00038009085,0.00028347824,0.002227062,0.0011876519,0.9866996,0.008287397,0.000011623239],"about_ca_topic_score_codex":0.0008994494,"about_ca_topic_score_gemma":0.0011143183,"teacher_disagreement_score":0.01100828,"about_ca_system_score_codex":0.0009919759,"about_ca_system_score_gemma":0.0003552672,"threshold_uncertainty_score":0.03682643},"labels":[],"label_agreement":null},{"id":"W135964657","doi":"","title":"The Expectation of Independent Domination Number Over Random Binary Trees.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Binary number; Random binary tree; Binary tree; Combinatorics; Statistics; Arithmetic","score_opus":0.009152291672543507,"score_gpt":0.2763003681278505,"score_spread":0.267148076455307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W135964657","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40903023,0.0050872723,0.5092967,0.013168082,0.0011251137,0.00028055988,0.005214712,0.0021685953,0.05462873],"genre_scores_gemma":[0.95204127,0.0022290049,0.025345368,0.0012583673,0.00097287365,0.00040326742,0.0017134394,0.00040575716,0.01563071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956417,0.0017760092,0.00016218801,0.00087718916,0.0008285401,0.00071438996],"domain_scores_gemma":[0.9290604,0.057764325,0.0035959426,0.0048306924,0.0019934343,0.0027552766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00882974,0.001144614,0.0024057408,0.0029218004,0.0011070837,0.0040307776,0.004381769,0.0028935391,0.011720224],"category_scores_gemma":[0.0650362,0.0012260554,0.0010664541,0.0025809642,0.0047025126,0.011336071,0.0023994995,0.0036110345,0.0016649337],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006469951,0.0001522281,0.004109746,0.00054249447,0.00016042669,0.00024432887,0.00028658478,0.047497954,0.0029768613,0.9118019,0.0138412425,0.017739195],"study_design_scores_gemma":[0.00009534675,0.00008201207,0.0029957301,0.00015309209,0.00006848438,0.00046328845,0.0001061559,0.24989651,0.002345598,0.7408327,0.0028830394,0.0000780012],"about_ca_topic_score_codex":0.0010225372,"about_ca_topic_score_gemma":0.0010181449,"teacher_disagreement_score":0.011720224,"about_ca_system_score_codex":0.0027675154,"about_ca_system_score_gemma":0.0013583377,"threshold_uncertainty_score":0.046696723},"labels":[],"label_agreement":null},{"id":"W136393546","doi":"","title":"The Basis Number of The Composition of Theta Graphs with Some Graphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Basis (linear algebra); Composition (language); Indifference graph; Graph; Geometry; Linguistics","score_opus":0.005473289516366835,"score_gpt":0.20217956937168396,"score_spread":0.19670627985531713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W136393546","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6809602,0.0006144761,0.12708256,0.0025135716,0.0005755409,0.000080397556,0.0014524341,0.0006637,0.18605718],"genre_scores_gemma":[0.9412787,0.00035339157,0.031351134,0.0002696655,0.00017676226,0.00010274712,0.00085900567,0.00029535365,0.025313344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993536,0.00018457651,0.000028450946,0.0001382082,0.00011374193,0.0001813593],"domain_scores_gemma":[0.99798656,0.000920962,0.00023209299,0.00029253782,0.00022328064,0.00034456854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075206603,0.0004315566,0.00060891977,0.0017333993,0.002331717,0.0032147479,0.0009781562,0.0011425149,0.013315985],"category_scores_gemma":[0.0033903297,0.00041529478,0.00060674036,0.0011013414,0.0023230973,0.0039612916,0.0015559915,0.0020808557,0.0025008342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001570962,0.000032128424,0.0008907289,0.000053736272,0.000009535424,0.00005460207,0.00015933851,0.0011241339,0.0032841498,0.9805279,0.004029302,0.0096773645],"study_design_scores_gemma":[0.000024158999,0.000031525684,0.0010083568,0.000033773646,0.000020394034,0.00022667342,0.00028846794,0.009550291,0.0054166312,0.9737787,0.009598191,0.00002277346],"about_ca_topic_score_codex":0.0009107058,"about_ca_topic_score_gemma":0.0011005632,"teacher_disagreement_score":0.013315985,"about_ca_system_score_codex":0.0010467173,"about_ca_system_score_gemma":0.00068576285,"threshold_uncertainty_score":0.044546366},"labels":[],"label_agreement":null},{"id":"W136420999","doi":"","title":"Some Theorems on Generalized Stirling Numbers.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematical Inequalities and Applications","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Stirling engine; Stirling numbers of the first kind; Stirling number; Stirling numbers of the second kind; Pure mathematics; Applied mathematics; Thermodynamics; Physics","score_opus":0.0663120543958205,"score_gpt":0.33606560359132737,"score_spread":0.26975354919550687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W136420999","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04905273,0.047134526,0.30500793,0.009175234,0.0061232126,0.00013179539,0.0019401299,0.00072736,0.580707],"genre_scores_gemma":[0.6206395,0.04554213,0.1599235,0.0069827195,0.009692004,0.0005916515,0.0020115469,0.00071646966,0.15390044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992323,0.00018920924,0.000055004093,0.00013061857,0.00028380632,0.00010905258],"domain_scores_gemma":[0.9980281,0.0012015856,0.00016390954,0.00020703238,0.00025786934,0.00014152704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019195252,0.0012753967,0.0007440793,0.0039131376,0.0012197184,0.003030659,0.0013755307,0.00097414263,0.015831433],"category_scores_gemma":[0.005448838,0.00044691883,0.0012540062,0.0031308685,0.0026559732,0.005555805,0.002003732,0.003563618,0.003384766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013992272,0.000006539597,0.00006396444,0.00009795938,0.000009315228,0.00006224024,0.00007683694,0.00035568164,0.0003276424,0.9839225,0.0058987387,0.009164616],"study_design_scores_gemma":[0.0000069626926,0.000010658411,0.00016620522,0.000042752006,0.000010608883,0.00015945463,0.00004134398,0.0012071057,0.00037820372,0.97612214,0.021843396,0.0000111222025],"about_ca_topic_score_codex":0.0008947405,"about_ca_topic_score_gemma":0.0013546126,"teacher_disagreement_score":0.015831433,"about_ca_system_score_codex":0.0015336177,"about_ca_system_score_gemma":0.0006643812,"threshold_uncertainty_score":0.05296147},"labels":[],"label_agreement":null},{"id":"W13645353","doi":"","title":"On defining numbers of k-chromatic k-regular graphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics; Discrete mathematics","score_opus":0.007702880638844047,"score_gpt":0.21827958512117943,"score_spread":0.21057670448233537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W13645353","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39595193,0.0034866899,0.25200525,0.004842348,0.0010332948,0.000196522,0.0015153978,0.0005955105,0.340373],"genre_scores_gemma":[0.8742165,0.0016137299,0.09007449,0.001021414,0.0005145942,0.0003786859,0.0010043622,0.00032439147,0.030851806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859697,0.00042986093,0.00008845862,0.00034255884,0.0002614125,0.00028074236],"domain_scores_gemma":[0.99540544,0.0026786616,0.00049503375,0.0003758132,0.0004392809,0.00060580194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014935959,0.0007958403,0.0007125251,0.0030059603,0.0023920962,0.0048732986,0.0019606694,0.0015524116,0.0093358075],"category_scores_gemma":[0.006458497,0.0006669333,0.0007146292,0.0027352495,0.0048125014,0.008941926,0.0032767323,0.003315103,0.0017492382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021253514,0.000013040287,0.00025559188,0.000030388064,0.0000024615988,0.000013830981,0.00017358256,0.0005298275,0.0003301456,0.9920402,0.0016956007,0.0048940578],"study_design_scores_gemma":[0.000010069554,0.000010715489,0.00030148024,0.000027628113,0.0000049609835,0.000076235665,0.00019022555,0.0027450859,0.00038474414,0.98955005,0.0066850698,0.000013703987],"about_ca_topic_score_codex":0.0011990075,"about_ca_topic_score_gemma":0.0020392654,"teacher_disagreement_score":0.0093358075,"about_ca_system_score_codex":0.0025392552,"about_ca_system_score_gemma":0.0006660253,"threshold_uncertainty_score":0.031231403},"labels":[],"label_agreement":null},{"id":"W136510902","doi":"","title":"The k-exponents of Primitive, Nearly Reducible Matrices.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Exponent; Pure mathematics; Linguistics; Philosophy","score_opus":0.008956943327975558,"score_gpt":0.27092653502814573,"score_spread":0.2619695917001702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W136510902","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63144684,0.0041844463,0.07267156,0.0033091204,0.0015818895,0.00008931037,0.0008162224,0.0003932033,0.28550747],"genre_scores_gemma":[0.95887315,0.0011801117,0.010075657,0.00034449427,0.0006628583,0.000036595466,0.00019452811,0.00008967715,0.02854286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961877,0.000076807315,0.000025335807,0.000061328356,0.00013338463,0.00008437837],"domain_scores_gemma":[0.9988433,0.00033239851,0.00028464082,0.00015779784,0.00018793094,0.00019389151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042951177,0.00069354265,0.00044575415,0.0015574539,0.0010905048,0.0025091865,0.00051511935,0.0006470522,0.009271845],"category_scores_gemma":[0.003522558,0.00040279632,0.00030952206,0.0005918285,0.0023440644,0.0038293612,0.0013445453,0.0017475096,0.0025002751],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006131446,0.000014260914,0.00030057013,0.000047505062,0.000005900494,0.00019120857,0.00024073466,0.0004372984,0.002210138,0.9882173,0.0020608346,0.0062130056],"study_design_scores_gemma":[0.000019618197,0.000022547869,0.0004901337,0.000037719292,0.000005224701,0.00040640644,0.00013128942,0.0021432908,0.001130565,0.98882127,0.006777247,0.000014682999],"about_ca_topic_score_codex":0.0003941568,"about_ca_topic_score_gemma":0.0005634986,"teacher_disagreement_score":0.009271845,"about_ca_system_score_codex":0.0005325457,"about_ca_system_score_gemma":0.00048314666,"threshold_uncertainty_score":0.031017363},"labels":[],"label_agreement":null},{"id":"W136527168","doi":"","title":"Dynamical Behavior of Symmetric Weighted Median mapping on Two-dimensional Real Sequences Space Rs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Space (punctuation); Weighted median; Combinatorics; Artificial intelligence; Computer science; Median filter","score_opus":0.03561116448043333,"score_gpt":0.29111937180113323,"score_spread":0.2555082073206999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W136527168","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8683533,0.0005468746,0.11796516,0.00041599345,0.00007650994,0.000032549397,0.00017473662,0.00018342372,0.012251479],"genre_scores_gemma":[0.9893405,0.00016015586,0.005538094,0.000026342972,0.000027786864,0.000022809078,0.00009228563,0.000024114956,0.0047678603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998739,0.000033272412,0.000005464867,0.000025530806,0.000030792035,0.000031027474],"domain_scores_gemma":[0.9993986,0.00019243122,0.00013459203,0.000041778654,0.00009129605,0.00014133198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034099794,0.00028657334,0.00038876763,0.00092888036,0.0004647991,0.0009572406,0.00057492725,0.0005229608,0.0038154472],"category_scores_gemma":[0.0018880211,0.00016771686,0.00036692695,0.0003434637,0.00072305615,0.0014194504,0.00063836586,0.00035882316,0.0003233101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032408882,0.00007522829,0.0033365483,0.00010093892,0.0000779015,0.00053718366,0.0004111162,0.11370105,0.01868523,0.8431601,0.0025604365,0.017030304],"study_design_scores_gemma":[0.000022435926,0.00009449112,0.0025230492,0.000017756676,0.000013473288,0.0002914045,0.00018950952,0.7634071,0.0020832685,0.22965813,0.0016607164,0.00003868935],"about_ca_topic_score_codex":0.0012227736,"about_ca_topic_score_gemma":0.0006673211,"teacher_disagreement_score":0.0038154472,"about_ca_system_score_codex":0.00059417175,"about_ca_system_score_gemma":0.00025151006,"threshold_uncertainty_score":0.012763917},"labels":[],"label_agreement":null},{"id":"W136895249","doi":"","title":"On the existence of trades of large volumes.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Mathematical economics","score_opus":0.024418349749612024,"score_gpt":0.2129313307500885,"score_spread":0.18851298100047648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W136895249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4071101,0.018063044,0.41144016,0.015586441,0.00096873066,0.00013205806,0.0024836594,0.0009324583,0.1432834],"genre_scores_gemma":[0.95265734,0.0058090216,0.02424634,0.00058358465,0.0009476087,0.000114045426,0.00082363875,0.00016098682,0.014657458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99779344,0.0007806285,0.00018818046,0.00046594435,0.00045918496,0.00031266813],"domain_scores_gemma":[0.9575905,0.029829862,0.0056658597,0.003286648,0.0017904437,0.0018365283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003487434,0.00062730286,0.001825723,0.0039406517,0.0023794568,0.0070362235,0.0015766353,0.0024506792,0.01426472],"category_scores_gemma":[0.036245383,0.0010950806,0.0016374601,0.00420305,0.0053374707,0.016062219,0.00392492,0.0028764384,0.0014059398],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066385044,0.000026392705,0.0019471517,0.00010723997,0.000040614745,0.00019918107,0.00010786728,0.0041444474,0.0001947748,0.9824615,0.002574832,0.008129564],"study_design_scores_gemma":[0.00001671548,0.000011972179,0.0009195707,0.00004604925,0.00001855329,0.0002418902,0.00006765987,0.011792109,0.000102604994,0.98414236,0.0026284605,0.000011978997],"about_ca_topic_score_codex":0.0011593932,"about_ca_topic_score_gemma":0.0011833964,"teacher_disagreement_score":0.01426472,"about_ca_system_score_codex":0.0012757495,"about_ca_system_score_gemma":0.00086469186,"threshold_uncertainty_score":0.047720313},"labels":[],"label_agreement":null},{"id":"W137453216","doi":"","title":"On the Girth of Digraphs with High Connectivity.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Girth (graph theory); Mathematics; Combinatorics","score_opus":0.013045838375878383,"score_gpt":0.2476699812188061,"score_spread":0.2346241428429277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W137453216","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69866073,0.0053896457,0.1602122,0.0055122245,0.00055969786,0.0000949614,0.0016344131,0.00065565493,0.1272805],"genre_scores_gemma":[0.9581765,0.0030417636,0.025634678,0.00066057785,0.00065833866,0.000106545645,0.0008027538,0.0002537013,0.010665183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992163,0.000292534,0.000031852152,0.00012804482,0.00017445811,0.00015675413],"domain_scores_gemma":[0.987773,0.009110474,0.00084254256,0.00080770656,0.0004858368,0.0009804748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008922283,0.0005919433,0.0008961009,0.0030923325,0.0013135106,0.0021066153,0.0012947257,0.0013186679,0.008927098],"category_scores_gemma":[0.011897778,0.0007121959,0.00053101266,0.0021818993,0.0027232014,0.0051107826,0.0029399332,0.0027556666,0.0012806625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023137903,0.00006885147,0.0030014336,0.0002833891,0.000059412007,0.0002807403,0.0006914966,0.01898433,0.00333391,0.9280331,0.014386671,0.030645344],"study_design_scores_gemma":[0.00002697377,0.000043765507,0.0012040074,0.000056537912,0.000030249752,0.0003073249,0.00020135014,0.017691065,0.00068536913,0.97532755,0.0044079036,0.000017912083],"about_ca_topic_score_codex":0.00077480014,"about_ca_topic_score_gemma":0.0012540944,"teacher_disagreement_score":0.008927098,"about_ca_system_score_codex":0.0010414366,"about_ca_system_score_gemma":0.0003851569,"threshold_uncertainty_score":0.029864132},"labels":[],"label_agreement":null},{"id":"W137471786","doi":"","title":"New Families of Graceful Graphs.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.010258783317897638,"score_gpt":0.21646209522684115,"score_spread":0.2062033119089435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W137471786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2935198,0.0040774764,0.4104072,0.006314431,0.00079640414,0.00021524815,0.002325961,0.0030703458,0.27927318],"genre_scores_gemma":[0.8515653,0.0024343878,0.07259661,0.0014678162,0.000658907,0.00036960858,0.0019231878,0.0008728268,0.06811139],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989454,0.00025229255,0.000046979203,0.00028068075,0.00028165703,0.0001929611],"domain_scores_gemma":[0.99585295,0.0017133116,0.0004772461,0.0008970115,0.0003498632,0.0007096743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011288357,0.00070053554,0.0005817982,0.0026421354,0.002741084,0.0034512249,0.0015073875,0.0011830826,0.015165201],"category_scores_gemma":[0.005461033,0.0007053945,0.0010593382,0.0016954223,0.0027560322,0.0069231736,0.003527665,0.0023773862,0.0016871192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029146924,0.000013887719,0.00030380746,0.00003578281,0.0000062398976,0.000083124796,0.00021264468,0.00094222074,0.00066221977,0.98533046,0.0050813295,0.007299053],"study_design_scores_gemma":[0.00001623713,0.000014406402,0.00026377983,0.000025363117,0.000014183064,0.0003006301,0.00014961378,0.0054273903,0.0007314853,0.9677922,0.025249008,0.00001566575],"about_ca_topic_score_codex":0.0009774826,"about_ca_topic_score_gemma":0.001667753,"teacher_disagreement_score":0.015165201,"about_ca_system_score_codex":0.0017236039,"about_ca_system_score_gemma":0.00066217093,"threshold_uncertainty_score":0.050732672},"labels":[],"label_agreement":null},{"id":"W137609861","doi":"","title":"The spectra for two classes of graph designs.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics; Discrete mathematics","score_opus":0.017811495597468672,"score_gpt":0.2180627641014866,"score_spread":0.20025126850401792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W137609861","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22518277,0.002014104,0.41120538,0.0039572013,0.0008010204,0.00029210158,0.00190149,0.001012451,0.35363343],"genre_scores_gemma":[0.9015046,0.0011606669,0.052950174,0.0011583498,0.000472473,0.00046687815,0.00089331117,0.00021384128,0.041179795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826306,0.00038888227,0.00008652438,0.00040906842,0.0005084539,0.0003439956],"domain_scores_gemma":[0.99585176,0.0018172916,0.00049434375,0.00081788463,0.00046564962,0.0005531018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001045893,0.0006567029,0.00054518646,0.003294703,0.0016207186,0.0044208774,0.00094959664,0.002309961,0.017561212],"category_scores_gemma":[0.0065752664,0.00045272996,0.00079897005,0.0014233488,0.0025041623,0.004334351,0.0018185904,0.0019064524,0.0026138606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029897117,0.000017032931,0.00011460868,0.000024715784,0.0000034791065,0.000048175294,0.00010194597,0.0003048058,0.0005114558,0.990846,0.0019055598,0.0060923793],"study_design_scores_gemma":[0.000019981842,0.000020276893,0.00022420438,0.000036367557,0.000005853891,0.00028002763,0.0001340279,0.003668981,0.0005833956,0.98715127,0.007861882,0.000013731787],"about_ca_topic_score_codex":0.00043298962,"about_ca_topic_score_gemma":0.00040681657,"teacher_disagreement_score":0.017561212,"about_ca_system_score_codex":0.0013987003,"about_ca_system_score_gemma":0.00070433284,"threshold_uncertainty_score":0.058748186},"labels":[],"label_agreement":null},{"id":"W137797140","doi":"","title":"Multiplicity of triangles in 2-edge coloring of a family of graphs.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Edge coloring; Multiplicity (mathematics); Enhanced Data Rates for GSM Evolution; Combinatorics; Graph coloring; Graph; Geometry; Computer science; Line graph; Artificial intelligence","score_opus":0.026968470004223616,"score_gpt":0.28860468504711323,"score_spread":0.2616362150428896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W137797140","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84361595,0.0011463872,0.07659429,0.0018829379,0.000532393,0.000056064273,0.0012906755,0.00048585967,0.074395455],"genre_scores_gemma":[0.970801,0.00036151757,0.01567063,0.00017709422,0.00017959492,0.00006693522,0.0006325347,0.00011764213,0.011993097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991359,0.00020611205,0.000044509055,0.00020607215,0.00021383427,0.00019355972],"domain_scores_gemma":[0.99384683,0.002974176,0.0010660749,0.0005181377,0.00067564397,0.00091917766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073874387,0.0005388532,0.00060613925,0.0023192733,0.0023521148,0.0021190092,0.0014241983,0.0015468458,0.010836037],"category_scores_gemma":[0.0068063773,0.0005789729,0.0006648372,0.0015533032,0.0014774188,0.002449424,0.0013168374,0.0013158809,0.001040434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046764023,0.00009253428,0.01302153,0.00019359474,0.000060398514,0.0015642378,0.0014729793,0.009422973,0.011460367,0.9226272,0.01394396,0.025672581],"study_design_scores_gemma":[0.00008489756,0.00010443943,0.010776451,0.000085561864,0.000064437714,0.0042563807,0.0006941704,0.045890253,0.0047443276,0.91565084,0.017577099,0.00007119339],"about_ca_topic_score_codex":0.0014434397,"about_ca_topic_score_gemma":0.001832785,"teacher_disagreement_score":0.010836037,"about_ca_system_score_codex":0.0011505575,"about_ca_system_score_gemma":0.0004294661,"threshold_uncertainty_score":0.036250174},"labels":[],"label_agreement":null},{"id":"W13813071","doi":"","title":"The intersection problem for twin bowtie and near bowtie systems.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Intersection (aeronautics); Mathematics; Geography; Cartography","score_opus":0.006539774111095832,"score_gpt":0.193649324619739,"score_spread":0.18710955050864317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W13813071","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28800738,0.0037507063,0.3802661,0.0054960046,0.00090977474,0.0002286037,0.0016283805,0.0010608314,0.31865218],"genre_scores_gemma":[0.8763231,0.0014087956,0.057735268,0.00085149636,0.00048992195,0.00019842823,0.0015127235,0.00038669788,0.06109354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99714464,0.0007941892,0.0001420332,0.00057646265,0.00063529384,0.00070739933],"domain_scores_gemma":[0.99226356,0.004453747,0.00060929544,0.0011876931,0.0007653046,0.0007203695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015997308,0.00060892967,0.0015817515,0.0024619154,0.0057576858,0.0071983156,0.0024995867,0.0043000923,0.036702536],"category_scores_gemma":[0.0141515555,0.0009936203,0.0011494714,0.003195776,0.0031707878,0.01569973,0.006467827,0.005097878,0.0043775043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009896173,0.000042560478,0.00034537876,0.00007002282,0.000017693656,0.00009636415,0.00024412785,0.0023431848,0.00040716623,0.97761256,0.0069993115,0.011722704],"study_design_scores_gemma":[0.000019578116,0.000015299307,0.00012409902,0.000026286281,0.00001453574,0.00018801166,0.00026601323,0.01189475,0.000591014,0.97917867,0.0076636956,0.00001800146],"about_ca_topic_score_codex":0.0018429785,"about_ca_topic_score_gemma":0.0017161148,"teacher_disagreement_score":0.036702536,"about_ca_system_score_codex":0.002121822,"about_ca_system_score_gemma":0.0014094589,"threshold_uncertainty_score":0.12278223},"labels":[],"label_agreement":null},{"id":"W138264765","doi":"","title":"Notes on Two Properties of the Generalized Sequences {Wn} Relevant to Recurring Decimal.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Decimal; Arithmetic","score_opus":0.06016413565983174,"score_gpt":0.31835362211067986,"score_spread":0.2581894864508481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W138264765","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11675628,0.0041829175,0.17375493,0.015306372,0.0036943804,0.000117607364,0.0005456666,0.0005292642,0.6851126],"genre_scores_gemma":[0.87642443,0.0026954724,0.041296996,0.004539758,0.0022129044,0.00013328985,0.00039900126,0.0002683163,0.07202984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946743,0.00014082117,0.000047626854,0.00010195203,0.00014272143,0.000099422716],"domain_scores_gemma":[0.99799746,0.0010574374,0.00019167422,0.00039017113,0.00018211706,0.00018103965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009238445,0.00045768448,0.00046233775,0.000993202,0.0017945135,0.0022860374,0.0009951787,0.0015403683,0.013755434],"category_scores_gemma":[0.0045909947,0.00024483036,0.00061276864,0.0013920798,0.0052258736,0.004329413,0.0016347824,0.0028980745,0.0016107493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000124965245,0.0000069444204,0.0000500388,0.000032528405,0.0000015334477,0.00009872605,0.00014581668,0.000105721716,0.0005052769,0.994083,0.001860264,0.0030975675],"study_design_scores_gemma":[0.0000062854087,0.000010745701,0.0001945017,0.000012756091,0.0000029772111,0.00023337599,0.00009514187,0.00034671262,0.0005657842,0.98695195,0.011570624,0.000009155286],"about_ca_topic_score_codex":0.00063149346,"about_ca_topic_score_gemma":0.001008233,"teacher_disagreement_score":0.013755434,"about_ca_system_score_codex":0.00078548625,"about_ca_system_score_gemma":0.00048705377,"threshold_uncertainty_score":0.046016514},"labels":[],"label_agreement":null},{"id":"W139336693","doi":"","title":"Nested BIBDs from affine planes.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Affine transformation; Nested set model; Pure mathematics; Computer science; Data mining","score_opus":0.010893721262640994,"score_gpt":0.22368034522890867,"score_spread":0.21278662396626769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W139336693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036418833,0.0015331899,0.82747,0.00041554242,0.0005628614,0.00015921601,0.0011312852,0.0018549195,0.13045411],"genre_scores_gemma":[0.46444923,0.0015518845,0.44236124,0.00041647864,0.00024948703,0.0002091747,0.0035685482,0.0018814183,0.08531258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993042,0.00010737399,0.00005043078,0.00011084729,0.0003447132,0.00008240976],"domain_scores_gemma":[0.9993999,0.00017591305,0.00005621243,0.00017145531,0.00012393256,0.0000725928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040398593,0.00058484025,0.0006816107,0.0015494087,0.0007972581,0.0024300816,0.0011593599,0.00058640924,0.021418385],"category_scores_gemma":[0.0021229116,0.0004985216,0.00075316185,0.0011901167,0.001200938,0.002655483,0.0036926917,0.0019513791,0.005542797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008108614,0.000032504824,0.00047586346,0.00021380247,0.00002008727,0.00016977957,0.00027824295,0.007846425,0.004196822,0.86470985,0.0139922695,0.10798329],"study_design_scores_gemma":[0.000037715326,0.000052825908,0.00036198343,0.00012343416,0.000020728035,0.00051722635,0.0002662326,0.048096392,0.0068832384,0.82696027,0.11665377,0.000026131473],"about_ca_topic_score_codex":0.00091320864,"about_ca_topic_score_gemma":0.0017198699,"teacher_disagreement_score":0.021418385,"about_ca_system_score_codex":0.000667427,"about_ca_system_score_gemma":0.00031910135,"threshold_uncertainty_score":0.07165164},"labels":[],"label_agreement":null},{"id":"W139510642","doi":"","title":"Small 2-factors of Bipartite Graphs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Graph","score_opus":0.014788959360586332,"score_gpt":0.19352386450597928,"score_spread":0.17873490514539295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W139510642","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36544445,0.0033996438,0.32190052,0.0020123464,0.0006435033,0.00019254968,0.0009892938,0.0012011258,0.30421656],"genre_scores_gemma":[0.9154663,0.0011847898,0.029695442,0.00056316436,0.00036532522,0.00015990042,0.00044564312,0.00026517542,0.05185424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929583,0.00022994705,0.000024458217,0.00015764998,0.00014724389,0.00014491146],"domain_scores_gemma":[0.9976891,0.0012197738,0.00027448655,0.00028486937,0.00019948573,0.00033227482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005078314,0.0006695438,0.00060072215,0.0015929776,0.0010164605,0.0019149063,0.0004855509,0.00081479317,0.01768654],"category_scores_gemma":[0.0042184475,0.00046206723,0.00050946797,0.00076528685,0.0016910143,0.002723783,0.0012619247,0.0010780586,0.0028271514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010999983,0.00003106886,0.0005661148,0.00008745679,0.000017241675,0.00014477612,0.00019603681,0.0028116927,0.002789064,0.9766716,0.0057226676,0.010852262],"study_design_scores_gemma":[0.000029926841,0.000023949353,0.00042681373,0.000035426085,0.000013670796,0.00025374044,0.0000936839,0.010763415,0.0013288958,0.97495234,0.012064994,0.000013141936],"about_ca_topic_score_codex":0.00094140565,"about_ca_topic_score_gemma":0.001690367,"teacher_disagreement_score":0.01768654,"about_ca_system_score_codex":0.00067931117,"about_ca_system_score_gemma":0.00043102255,"threshold_uncertainty_score":0.059167385},"labels":[],"label_agreement":null},{"id":"W140062478","doi":"","title":"On c-Hadamard matrices.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hadamard transform; Mathematics; Mathematical analysis","score_opus":0.00753535808064969,"score_gpt":0.17903196736818489,"score_spread":0.17149660928753518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W140062478","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07302499,0.007923799,0.5921733,0.004076846,0.0020927845,0.00009270388,0.000650272,0.00056418224,0.31940112],"genre_scores_gemma":[0.7815488,0.006187992,0.12433822,0.002491721,0.0019063954,0.00022238253,0.00075108744,0.0002684106,0.08228496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887556,0.00041297887,0.000048549253,0.00015820013,0.00028971414,0.00021489685],"domain_scores_gemma":[0.9977495,0.0010631937,0.0002436783,0.00036035493,0.00039378947,0.00018943998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084645965,0.00095553073,0.00065329764,0.0029301138,0.0015525816,0.0023097256,0.0007918106,0.0013798422,0.011688943],"category_scores_gemma":[0.0043101795,0.00040150058,0.0006539651,0.002289748,0.0025226707,0.0035883372,0.0017294111,0.002651014,0.0038944099],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025383295,0.000012934916,0.00010629997,0.000038552793,0.0000060305274,0.0000831347,0.00009939716,0.0015245659,0.00073214935,0.98540086,0.003951791,0.008018903],"study_design_scores_gemma":[0.000008322766,0.000012796946,0.00009667092,0.000027399186,0.0000032355222,0.00015097935,0.00004395405,0.0075736693,0.00051931787,0.98448527,0.007063871,0.00001451069],"about_ca_topic_score_codex":0.001861822,"about_ca_topic_score_gemma":0.002355363,"teacher_disagreement_score":0.011688943,"about_ca_system_score_codex":0.001301845,"about_ca_system_score_gemma":0.00070042873,"threshold_uncertainty_score":0.03910345},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Steiner system; Group (periodic table); Steiner tree problem; Combinatorics; Pure mathematics; Physics","score_opus":0.004838672456518819,"score_gpt":0.17559055662067116,"score_spread":0.17075188416415235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W140290324","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73442227,0.0009614459,0.12563823,0.0016794977,0.00053629134,0.0002343984,0.0017925743,0.0008249105,0.1339104],"genre_scores_gemma":[0.95932233,0.00031862248,0.02567097,0.00024307509,0.00007665791,0.00011593837,0.00081626873,0.000061856146,0.013374428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994916,0.00013888544,0.000030748866,0.00009017707,0.00011876568,0.00012985324],"domain_scores_gemma":[0.99914455,0.0002332624,0.00016804754,0.0001670903,0.00013234769,0.00015465946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002966611,0.0004336255,0.0005857571,0.0010827865,0.0014831009,0.001553784,0.00070244883,0.0011484087,0.013098279],"category_scores_gemma":[0.001195815,0.00029941188,0.0004476251,0.0011887329,0.0009447271,0.001710287,0.0016056685,0.00095446664,0.0017509961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040330619,0.00007760441,0.001129361,0.00020924257,0.00007195623,0.0013608248,0.00049481733,0.013687364,0.011678172,0.9328024,0.011094909,0.026990099],"study_design_scores_gemma":[0.00018813935,0.00019143448,0.0012111408,0.000081037055,0.00005859205,0.0010881255,0.000909217,0.044291865,0.00841421,0.92330986,0.020192957,0.0000635276],"about_ca_topic_score_codex":0.0007705857,"about_ca_topic_score_gemma":0.0013927135,"teacher_disagreement_score":0.013098279,"about_ca_system_score_codex":0.00077981065,"about_ca_system_score_gemma":0.0007059796,"threshold_uncertainty_score":0.043818057},"labels":[],"label_agreement":null},{"id":"W140737235","doi":"","title":"On The Fibonacci Matrix Of Order 2^k Sequence {F^(2k)n}.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Mathematics; Sequence (biology); Order (exchange); Combinatorics; Matrix (chemical analysis); Pure mathematics; Genetics; Chemistry; Biology","score_opus":0.015683791413433307,"score_gpt":0.29382768786332797,"score_spread":0.2781438964498947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W140737235","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27701616,0.005119259,0.2828981,0.0046485104,0.0043774415,0.00020771749,0.0015504673,0.0007069975,0.42347527],"genre_scores_gemma":[0.8372109,0.0026200302,0.06830042,0.0022419048,0.0012770268,0.0002635178,0.001182743,0.00039031895,0.08651322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994838,0.00011410956,0.000022667125,0.00007987782,0.00016724096,0.00013228561],"domain_scores_gemma":[0.99939704,0.00025190646,0.00009137247,0.000049857383,0.00011559049,0.00009429795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005055515,0.0009381742,0.00070789893,0.0022212362,0.002119004,0.002291788,0.0008058832,0.0017742536,0.018698122],"category_scores_gemma":[0.0021916034,0.00042134026,0.0005569991,0.0012199763,0.0017728843,0.0026025686,0.0011267881,0.0015789835,0.0049499767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073041134,0.00001586393,0.00013858933,0.00007098915,0.000008125966,0.00037542082,0.00020937923,0.0012705113,0.002534075,0.9786549,0.007076045,0.009573126],"study_design_scores_gemma":[0.000024021396,0.000037523125,0.00037945947,0.00006477828,0.00000679319,0.0005522316,0.00010355845,0.009361282,0.0015114922,0.9766326,0.0112805655,0.000045712983],"about_ca_topic_score_codex":0.0023902296,"about_ca_topic_score_gemma":0.004111038,"teacher_disagreement_score":0.018698122,"about_ca_system_score_codex":0.0010153953,"about_ca_system_score_gemma":0.00076950446,"threshold_uncertainty_score":0.06255144},"labels":[],"label_agreement":null},{"id":"W14142706","doi":"","title":"The Doyen-Wilson Theorem for Extended Directed Triple Systems.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.006816897687461571,"score_gpt":0.2122335786978402,"score_spread":0.20541668101037863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W14142706","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08155341,0.0040021017,0.5245865,0.0034163448,0.0012305194,0.000105322135,0.0006704334,0.00043474935,0.3840006],"genre_scores_gemma":[0.82438916,0.0026935528,0.078333184,0.0016587225,0.0007055688,0.00025295853,0.00052969443,0.00023183839,0.091205224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993437,0.00015812747,0.000039609156,0.00013111265,0.0001976748,0.00012991045],"domain_scores_gemma":[0.9986553,0.00057500903,0.00009912399,0.0002292743,0.00028591012,0.00015520697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008269583,0.0004590717,0.00065068906,0.001782137,0.0022937297,0.0026615532,0.00077397143,0.0011278103,0.011559217],"category_scores_gemma":[0.003977193,0.00036567036,0.0007397541,0.0012274395,0.0022207142,0.0058721374,0.00222251,0.0020614099,0.0019418843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062143295,0.0000047761837,0.00006670625,0.000018760962,0.0000033673043,0.000031206055,0.000058463273,0.0002173691,0.00017244529,0.99402654,0.0017441047,0.003650129],"study_design_scores_gemma":[0.0000046468826,0.000003535978,0.000058639816,0.000011417021,0.0000040690243,0.00007614436,0.0000358512,0.0016310221,0.00019015542,0.99005544,0.007923472,0.0000056957824],"about_ca_topic_score_codex":0.0016557509,"about_ca_topic_score_gemma":0.0020171641,"teacher_disagreement_score":0.011559217,"about_ca_system_score_codex":0.001255378,"about_ca_system_score_gemma":0.0007145392,"threshold_uncertainty_score":0.038669407},"labels":[],"label_agreement":null},{"id":"W141509276","doi":"","title":"On Infinite Kuratowski Theorems.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.011276499343480247,"score_gpt":0.23362716481231094,"score_spread":0.2223506654688307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W141509276","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05610715,0.013620798,0.27736342,0.011205919,0.0016366091,0.00005638891,0.00078108045,0.0008875652,0.63834107],"genre_scores_gemma":[0.7833547,0.010388516,0.06793556,0.0044006817,0.0019960192,0.00027278575,0.001144491,0.0007092136,0.129798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990722,0.00027947902,0.00006474628,0.00016040042,0.00029685037,0.00012637525],"domain_scores_gemma":[0.9965952,0.0021807966,0.0001845652,0.00044545947,0.00037070818,0.00022324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018022166,0.0007571425,0.0006483467,0.0022431016,0.002151114,0.0032971294,0.0011630772,0.0010220605,0.015039691],"category_scores_gemma":[0.006024244,0.0004881686,0.00089892297,0.0014875833,0.0052663274,0.0129871,0.003850523,0.003773131,0.0036467095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013125469,0.000008449906,0.000073699885,0.000035269444,0.0000041087287,0.00003095862,0.000101414305,0.00019263911,0.0001143685,0.9926603,0.002979972,0.0037856332],"study_design_scores_gemma":[0.000005419926,0.0000030992032,0.00008701697,0.00002042979,0.0000041071085,0.000057314028,0.000034837754,0.0006865566,0.00015604953,0.9920655,0.006874674,0.000004990832],"about_ca_topic_score_codex":0.0010159527,"about_ca_topic_score_gemma":0.0017601515,"teacher_disagreement_score":0.015039691,"about_ca_system_score_codex":0.001895411,"about_ca_system_score_gemma":0.00066656125,"threshold_uncertainty_score":0.050312757},"labels":[],"label_agreement":null},{"id":"W141638915","doi":"","title":"Minimum Average Broadcast Time in a Graph of Bounded Degree.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Bounded function; Graph; Combinatorics; Discrete mathematics; Mathematical analysis","score_opus":0.01643793209246781,"score_gpt":0.22748849478388355,"score_spread":0.21105056269141576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W141638915","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7020487,0.0023660327,0.27026558,0.0029194988,0.00020986819,0.000114702336,0.0037888866,0.002069546,0.016217045],"genre_scores_gemma":[0.95816773,0.0005919854,0.03512391,0.00013049295,0.00011269275,0.000092710914,0.0010996514,0.00038097918,0.004299813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990866,0.00025649596,0.000050032868,0.00022532094,0.00015308145,0.00022850784],"domain_scores_gemma":[0.98587984,0.00994598,0.001294513,0.0010289359,0.00093620917,0.00091446436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012050465,0.0006570212,0.001355869,0.0010799567,0.000972197,0.0020912685,0.002135525,0.0012848531,0.0045426176],"category_scores_gemma":[0.012243408,0.00046251365,0.00041776197,0.0011697081,0.0007234973,0.0031085517,0.0007704103,0.00095036323,0.0006662999],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0045341463,0.00035476199,0.0054772473,0.0017413023,0.00034534401,0.00037639093,0.000880828,0.6073936,0.051914938,0.19905335,0.026182089,0.10174594],"study_design_scores_gemma":[0.00024831796,0.00030979028,0.002214303,0.000073685645,0.00016597843,0.0003673764,0.0002381071,0.83052695,0.011042681,0.15122852,0.0035483507,0.000035919227],"about_ca_topic_score_codex":0.0026139016,"about_ca_topic_score_gemma":0.005711962,"teacher_disagreement_score":0.0045426176,"about_ca_system_score_codex":0.0019660222,"about_ca_system_score_gemma":0.0013344772,"threshold_uncertainty_score":0.015196562},"labels":[],"label_agreement":null},{"id":"W142077717","doi":"","title":"Edge Zeta Functions Of Graph Coverings.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Enhanced Data Rates for GSM Evolution; Combinatorics; Artificial intelligence; Computer science","score_opus":0.01659559937668688,"score_gpt":0.25193790865813276,"score_spread":0.2353423092814459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W142077717","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62379247,0.004039874,0.11027755,0.0031699326,0.0010118677,0.000050410268,0.00068176474,0.0005358245,0.25644025],"genre_scores_gemma":[0.9692039,0.001258023,0.0037705756,0.0002142637,0.00042536392,0.00003433824,0.00027599462,0.000120308694,0.02469719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968135,0.0000793158,0.000011370011,0.00004956602,0.00009485954,0.0000835527],"domain_scores_gemma":[0.9989654,0.0004336343,0.00013445853,0.00009850546,0.00013486257,0.0002332208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047455786,0.00072223425,0.00051971787,0.0032627503,0.0009896349,0.0026696573,0.0006428077,0.0007590309,0.007962481],"category_scores_gemma":[0.003447362,0.00027617687,0.00043489266,0.0013647797,0.0015941443,0.0033360207,0.0017530909,0.0016448268,0.0018205789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045819776,0.000020255955,0.0006476792,0.00004445878,0.000011254778,0.00007085229,0.00017398466,0.0012289678,0.0009700514,0.9815176,0.0037664848,0.011502548],"study_design_scores_gemma":[0.0000107454,0.000011646969,0.0007708536,0.000024032372,0.000009344895,0.00019394538,0.00014252627,0.007314813,0.0005549402,0.9855482,0.005408563,0.000010427111],"about_ca_topic_score_codex":0.00071876333,"about_ca_topic_score_gemma":0.00054139335,"teacher_disagreement_score":0.007962481,"about_ca_system_score_codex":0.0009050692,"about_ca_system_score_gemma":0.00025833724,"threshold_uncertainty_score":0.026637197},"labels":[],"label_agreement":null},{"id":"W142123670","doi":"","title":"Regular Weighted Graphs Without Positive Cuts.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.010257762863609247,"score_gpt":0.27615987145997967,"score_spread":0.2659021085963704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W142123670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26514095,0.0017372294,0.4655954,0.00235806,0.0008418834,0.00026034954,0.0027572382,0.0014715336,0.25983745],"genre_scores_gemma":[0.7525889,0.0013428422,0.13682863,0.00096596585,0.0003377805,0.0002597616,0.0033173535,0.0006509623,0.10370778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999033,0.00019604147,0.000054801294,0.00029530074,0.00025963725,0.00016125625],"domain_scores_gemma":[0.9969599,0.0011707561,0.00051524,0.0005445462,0.00050635246,0.00030324515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066734944,0.00078363885,0.00063693285,0.00146348,0.0011788326,0.0024805923,0.0013653121,0.00112345,0.013268331],"category_scores_gemma":[0.0051460834,0.00073716545,0.0006252367,0.0014642334,0.0014462239,0.004349965,0.0012953768,0.0019138868,0.0030711666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024241673,0.000084069274,0.0007595957,0.00026224725,0.00006592389,0.0004342152,0.00022652945,0.003016157,0.006845064,0.93250066,0.013811047,0.041752227],"study_design_scores_gemma":[0.000032211392,0.00003293004,0.00053181977,0.00007173263,0.00005496335,0.00067270966,0.00015897927,0.010394277,0.0028984267,0.9654636,0.01967056,0.000017798848],"about_ca_topic_score_codex":0.0009018591,"about_ca_topic_score_gemma":0.0017258896,"teacher_disagreement_score":0.013268331,"about_ca_system_score_codex":0.0006378219,"about_ca_system_score_gemma":0.00045123062,"threshold_uncertainty_score":0.044386983},"labels":[],"label_agreement":null},{"id":"W142381885","doi":"","title":"On k-arcs Covering a Line in Finite Projective Planes.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Projective test; Line (geometry); Projective line; Projective plane; Pure mathematics; Geometry; Projective space","score_opus":0.00904422544584932,"score_gpt":0.2066362370154323,"score_spread":0.19759201156958298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W142381885","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.745724,0.0012687301,0.11628479,0.0014709852,0.00020446313,0.00006014399,0.00086611975,0.00045342965,0.1336673],"genre_scores_gemma":[0.9641352,0.00076209125,0.014429376,0.00013879625,0.00010665053,0.00004221722,0.00044858982,0.000088366316,0.019848792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99926215,0.00022012011,0.000030004201,0.00013009486,0.00012740924,0.00023009375],"domain_scores_gemma":[0.997993,0.0010303995,0.0004172839,0.00016945889,0.00014866704,0.000241266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002997189,0.0005359266,0.00041649432,0.0020205036,0.0017891354,0.0025178038,0.0006972369,0.0010729429,0.011792992],"category_scores_gemma":[0.0023358816,0.00040318893,0.00039992787,0.0019787825,0.0018973941,0.0035329254,0.0017366037,0.0012106893,0.0017550447],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002320559,0.00004600931,0.0017679062,0.00012778977,0.00003766181,0.0007890281,0.0007567918,0.011480806,0.004824028,0.9546427,0.005395073,0.01990018],"study_design_scores_gemma":[0.000057293484,0.000060821083,0.0020208317,0.000088458044,0.000035579968,0.0010469235,0.0010099057,0.036670398,0.005188057,0.9366765,0.017104154,0.000040951825],"about_ca_topic_score_codex":0.0027191292,"about_ca_topic_score_gemma":0.0027177783,"teacher_disagreement_score":0.011792992,"about_ca_system_score_codex":0.0013683725,"about_ca_system_score_gemma":0.0003240618,"threshold_uncertainty_score":0.03945148},"labels":[],"label_agreement":null},{"id":"W142587239","doi":"","title":"All graphs are set reconstructible if all 2-connected graphs are set reconstructible.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Set (abstract data type); Computer science; Programming language","score_opus":0.02561773521238148,"score_gpt":0.2717130375520703,"score_spread":0.24609530233968885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W142587239","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42334703,0.0011283054,0.46518847,0.0018046664,0.0005033271,0.0003546577,0.0065854695,0.0032134736,0.09787466],"genre_scores_gemma":[0.8426248,0.0010139885,0.123900294,0.000555697,0.00027257358,0.00026852335,0.00876753,0.00049894897,0.022097634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870527,0.00021321094,0.00011344993,0.00035465683,0.00036173203,0.00025166175],"domain_scores_gemma":[0.99565965,0.0014451055,0.0006543402,0.001412536,0.000520232,0.0003081106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008514422,0.0010848131,0.0007984811,0.0022822677,0.0010964455,0.0036803985,0.001178168,0.001355552,0.01137913],"category_scores_gemma":[0.004165876,0.0006697914,0.0010597288,0.0015953971,0.002126801,0.004612117,0.0016003296,0.0018742871,0.0014818262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009573763,0.00021165739,0.0037961472,0.00066570815,0.00020160522,0.0016313998,0.00121656,0.017845483,0.015392105,0.84251666,0.016450977,0.09911435],"study_design_scores_gemma":[0.00006622706,0.0001209221,0.0027885016,0.00014995805,0.00012157694,0.002384031,0.00081803225,0.027272163,0.017166011,0.92178714,0.027235191,0.000090161186],"about_ca_topic_score_codex":0.0006578022,"about_ca_topic_score_gemma":0.0010026485,"teacher_disagreement_score":0.01137913,"about_ca_system_score_codex":0.00058740354,"about_ca_system_score_gemma":0.00048391274,"threshold_uncertainty_score":0.038066983},"labels":[],"label_agreement":null},{"id":"W142923102","doi":"","title":"Minimizing b + D and well covered graphs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.011272300107994696,"score_gpt":0.2164174358797207,"score_spread":0.205145135771726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W142923102","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6001131,0.0036246106,0.27355203,0.005917031,0.00022842351,0.000111198286,0.0034552088,0.00086212414,0.112136275],"genre_scores_gemma":[0.85369736,0.0015180248,0.10770196,0.00076047704,0.0001766016,0.00013963143,0.0028818587,0.00035704725,0.03276701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931645,0.00023814214,0.000030021774,0.0001484284,0.000118937314,0.00014810728],"domain_scores_gemma":[0.99712664,0.0016867898,0.0003281603,0.00032706928,0.00018087718,0.00035044298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061465794,0.00058153464,0.00065221643,0.0012433846,0.0009994855,0.0019048423,0.0010388785,0.0011325377,0.0075081503],"category_scores_gemma":[0.003699234,0.0005486926,0.00044990322,0.0013933616,0.000897841,0.0030407596,0.0015181653,0.0013231862,0.00096047187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023825462,0.0001284927,0.0030008059,0.000296038,0.000058253267,0.00017708587,0.0002928224,0.02018981,0.0051031136,0.888803,0.03532266,0.04638973],"study_design_scores_gemma":[0.000040007148,0.000037608046,0.0016548513,0.00005207089,0.000029690096,0.00032826499,0.00023902749,0.053077374,0.002665615,0.92610663,0.015750568,0.000018304698],"about_ca_topic_score_codex":0.0022188344,"about_ca_topic_score_gemma":0.0038907698,"teacher_disagreement_score":0.0075081503,"about_ca_system_score_codex":0.0015602881,"about_ca_system_score_gemma":0.0005083212,"threshold_uncertainty_score":0.025117278},"labels":[],"label_agreement":null},{"id":"W143112014","doi":"","title":"On the Cordiality of the t-ply Pt(u, v).","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.03634808734588124,"score_gpt":0.30143515791648107,"score_spread":0.2650870705705998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W143112014","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.124381825,0.0025038314,0.16844894,0.008091027,0.0018457113,0.00007637911,0.0008297238,0.00059487205,0.6932276],"genre_scores_gemma":[0.87570715,0.0011979225,0.026528036,0.0015217477,0.00087596296,0.00009447723,0.0004856722,0.00042146468,0.093167566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989662,0.00029180327,0.00005572473,0.00025814175,0.00020420791,0.00022389856],"domain_scores_gemma":[0.9983412,0.00060098787,0.00018421657,0.0003336969,0.000281705,0.00025816532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001139649,0.00049750786,0.0005675293,0.0012966791,0.003469047,0.004023055,0.0009672227,0.0013082935,0.02494828],"category_scores_gemma":[0.0059047984,0.00038688723,0.00059810333,0.0011655721,0.0046531684,0.008507175,0.0042318045,0.0037118453,0.004558846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019008847,0.000004994682,0.00007885578,0.000010513993,0.0000020332761,0.00004759766,0.000113024005,0.00008246978,0.00012433233,0.9939904,0.0022405374,0.0032861813],"study_design_scores_gemma":[0.000008262253,0.00000888245,0.00016622678,0.000015384896,0.000004361057,0.00014392947,0.0000606878,0.0008711803,0.00024431167,0.9899311,0.008538281,0.000007338873],"about_ca_topic_score_codex":0.0017051997,"about_ca_topic_score_gemma":0.0016377455,"teacher_disagreement_score":0.02494828,"about_ca_system_score_codex":0.0013573399,"about_ca_system_score_gemma":0.0008106399,"threshold_uncertainty_score":0.08346027},"labels":[],"label_agreement":null},{"id":"W143115087","doi":"","title":"The Maximum Number of Lines Contained in Subsets of PG(k, 2).","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Statistics; Animal science; Biology","score_opus":0.006931192562698387,"score_gpt":0.22332458191907395,"score_spread":0.21639338935637556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W143115087","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75358963,0.0044701956,0.09391052,0.005728107,0.00050588517,0.00032463405,0.021928832,0.0015589612,0.11798321],"genre_scores_gemma":[0.89945376,0.0018260209,0.06024553,0.0003451577,0.00034267813,0.00030305592,0.008072617,0.0005640079,0.0288471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822754,0.0005227589,0.00014376352,0.0003678981,0.00033188294,0.00040614474],"domain_scores_gemma":[0.9928438,0.003955242,0.0009239082,0.0009191778,0.00065077475,0.00070719194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008242457,0.0009625729,0.0009729406,0.0017447053,0.0018630933,0.0049788193,0.0020871458,0.0019673326,0.017843172],"category_scores_gemma":[0.009701516,0.0006213505,0.0005457071,0.0017253746,0.001345308,0.005566532,0.0014766447,0.001331308,0.004494075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008931912,0.0008918556,0.022009686,0.0039886953,0.00047686265,0.0024218378,0.002571835,0.060385466,0.10363824,0.41531846,0.10284846,0.27651665],"study_design_scores_gemma":[0.00041848616,0.0007998912,0.021812811,0.0008390722,0.00033410187,0.0065400847,0.002583997,0.09829128,0.10368046,0.62965125,0.13486427,0.00018425238],"about_ca_topic_score_codex":0.00048165247,"about_ca_topic_score_gemma":0.0006564595,"teacher_disagreement_score":0.017843172,"about_ca_system_score_codex":0.0008855057,"about_ca_system_score_gemma":0.000604791,"threshold_uncertainty_score":0.05969131},"labels":[],"label_agreement":null},{"id":"W143170565","doi":"","title":"Semi-regular Bipartite Graphs and an Extension of the Marriage Lemma.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Combinatorics; Mathematics; Lemma (botany); Hypercube; Matching (statistics); Discrete mathematics; Complete bipartite graph; Extension (predicate logic); Graph; Computer science","score_opus":0.022611245792453355,"score_gpt":0.27694563450556736,"score_spread":0.254334388713114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W143170565","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30932495,0.0018092624,0.5812888,0.0014366955,0.0003280902,0.00015383672,0.0006213838,0.0005366071,0.104500376],"genre_scores_gemma":[0.9360116,0.0008219614,0.051762465,0.00047557073,0.00024843367,0.000084119194,0.00038561423,0.000076425196,0.01013387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931943,0.00021353665,0.00003912763,0.00017133722,0.00015477434,0.00010192137],"domain_scores_gemma":[0.9978124,0.0009151468,0.00040187372,0.00039308582,0.00024171098,0.00023567151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007538964,0.00021958124,0.00032361445,0.0006389079,0.0009206135,0.00080143724,0.00060560944,0.00047189827,0.004982156],"category_scores_gemma":[0.0034049351,0.00028873523,0.0006205737,0.0008947162,0.0014899607,0.0021839226,0.0018349516,0.00093475595,0.0006270829],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008701335,0.000036017103,0.0010907094,0.000098043856,0.0000188937,0.00038218973,0.00041440706,0.0044546737,0.005574375,0.9675794,0.0025632358,0.017701041],"study_design_scores_gemma":[0.000028728997,0.000104668936,0.0016959747,0.000039531657,0.00003316544,0.0017741605,0.0003152421,0.038580492,0.0036982463,0.93009037,0.023610123,0.000029317343],"about_ca_topic_score_codex":0.0008939059,"about_ca_topic_score_gemma":0.0008626661,"teacher_disagreement_score":0.004982156,"about_ca_system_score_codex":0.00045882104,"about_ca_system_score_gemma":0.0002981517,"threshold_uncertainty_score":0.016666949},"labels":[],"label_agreement":null},{"id":"W143711533","doi":"","title":"A Note on the Representation of Unit Interval Graphs: A Link Between Interval Graphs and Semiorders.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Interval (graph theory); Indifference graph; Link (geometry); Unit interval; Interval graph; Combinatorics; Chordal graph; Unit (ring theory); Representation (politics); Pathwidth; Discrete mathematics; 1-planar graph; Graph; Line graph; Mathematics education","score_opus":0.0368655418629756,"score_gpt":0.32064296678188997,"score_spread":0.2837774249189144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W143711533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011805914,0.007887557,0.8040776,0.011170853,0.0060577737,0.00007924475,0.00059588137,0.0011300138,0.1571951],"genre_scores_gemma":[0.26989782,0.012178947,0.66227466,0.0070521287,0.0060939076,0.00027028905,0.000857358,0.0012720808,0.040102717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921846,0.00034241396,0.000052514686,0.00013710586,0.0001881565,0.00006126662],"domain_scores_gemma":[0.99661714,0.0018558167,0.00020344794,0.00079322583,0.00031238265,0.00021809092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014058562,0.00063743145,0.0006361285,0.0010917458,0.0019450929,0.00423734,0.0019385362,0.0014422506,0.011330648],"category_scores_gemma":[0.0067786546,0.00040812578,0.0010303814,0.0027784558,0.004279911,0.0112535665,0.0026511436,0.005202871,0.0028879207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019130444,0.000014748699,0.00007080908,0.00005806909,0.000005344071,0.00010186769,0.0003370277,0.00048708118,0.0005427379,0.97116864,0.0113186715,0.015875882],"study_design_scores_gemma":[0.0000041798744,0.000013736359,0.00007842106,0.00004079193,0.000008146335,0.00014053614,0.00009920075,0.0015558448,0.00028821133,0.9455239,0.05223402,0.000012978412],"about_ca_topic_score_codex":0.0015122613,"about_ca_topic_score_gemma":0.0023142344,"teacher_disagreement_score":0.011330648,"about_ca_system_score_codex":0.00072944217,"about_ca_system_score_gemma":0.0005686827,"threshold_uncertainty_score":0.03790474},"labels":[],"label_agreement":null},{"id":"W143714731","doi":"","title":"Certain classes of groups with commutativity degree d(G) < 1/2.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Commutative property; Degree (music); Pure mathematics; Physics","score_opus":0.10682751189102903,"score_gpt":0.3252975885371575,"score_spread":0.2184700766461285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W143714731","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8292707,0.00080996973,0.031199701,0.0014216877,0.00015369637,0.00006843052,0.00055169757,0.00028171117,0.13624236],"genre_scores_gemma":[0.9843491,0.00021221845,0.0030530617,0.00019097448,0.00013447156,0.0000435242,0.0004530173,0.000030086348,0.011533607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999519,0.000092043985,0.000023496355,0.00013881284,0.00009438657,0.00013233104],"domain_scores_gemma":[0.99824595,0.00070584763,0.0003441182,0.0002500676,0.00009950616,0.00035450404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004450837,0.0003408335,0.00034793623,0.0014511385,0.0013642464,0.001891609,0.0005092764,0.00071452494,0.008800837],"category_scores_gemma":[0.002089113,0.0002451153,0.0004533039,0.000682367,0.0022301206,0.0025695798,0.0012404645,0.0009732929,0.0006364353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001346733,0.00004334381,0.0020292394,0.000048536564,0.000014796181,0.00029601538,0.0007381072,0.0005099491,0.0020370826,0.9839728,0.0027538172,0.007421552],"study_design_scores_gemma":[0.00008459375,0.000058932623,0.0036249284,0.00003232113,0.000021829208,0.00095770095,0.0007801641,0.0038703866,0.002429226,0.9677472,0.020371106,0.000021539838],"about_ca_topic_score_codex":0.00063230016,"about_ca_topic_score_gemma":0.0009313515,"teacher_disagreement_score":0.008800837,"about_ca_system_score_codex":0.0008208326,"about_ca_system_score_gemma":0.00037524305,"threshold_uncertainty_score":0.029441714},"labels":[],"label_agreement":null},{"id":"W144515280","doi":"","title":"Greedy Defining Sets in Latin Squares.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Latin square; Mathematics; Greedy algorithm; Least-squares function approximation; Combinatorics; Mathematical optimization; Statistics; Biology","score_opus":0.011783479061915646,"score_gpt":0.1994339256728513,"score_spread":0.18765044661093563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W144515280","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06762388,0.0014766033,0.69506884,0.0018990184,0.0005900055,0.00012693567,0.00032671908,0.00047329438,0.23241463],"genre_scores_gemma":[0.59421843,0.0013057105,0.3083577,0.0018408675,0.00048806422,0.0004418773,0.0006323078,0.00052082905,0.0921943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985642,0.00070563174,0.000052583502,0.00021624634,0.00030516944,0.00015617689],"domain_scores_gemma":[0.9980908,0.0010500258,0.00015618384,0.00029538455,0.00023355724,0.0001740032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009239528,0.00050755066,0.0005245591,0.0010660448,0.001437361,0.0022460981,0.000962488,0.0009796877,0.011133666],"category_scores_gemma":[0.0049173324,0.00044416924,0.00051306933,0.0012656763,0.002186371,0.0034047056,0.0027252275,0.0021003785,0.0027499318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010275368,0.0000083832,0.000065130684,0.000016675194,0.0000025147372,0.000018715573,0.00007179293,0.000849208,0.0003252419,0.98939335,0.0019329248,0.007305799],"study_design_scores_gemma":[0.000009034375,0.000010455439,0.0000636672,0.000014600688,0.0000032918172,0.00007783569,0.000074810676,0.005818061,0.0004775933,0.98455226,0.008891395,0.0000069544035],"about_ca_topic_score_codex":0.00071981247,"about_ca_topic_score_gemma":0.0015941763,"teacher_disagreement_score":0.011133666,"about_ca_system_score_codex":0.0010659199,"about_ca_system_score_gemma":0.0006413577,"threshold_uncertainty_score":0.03724581},"labels":[],"label_agreement":null},{"id":"W144967261","doi":"","title":"Minimal 4-Equitability of C2nOK1.","year":2002,"lang":"ca","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.013384184263481709,"score_gpt":0.2057151738129442,"score_spread":0.1923309895494625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W144967261","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5598674,0.0004114658,0.040124703,0.0013148484,0.00027213636,0.000110278736,0.0013200406,0.00063832564,0.39594093],"genre_scores_gemma":[0.9187383,0.00019596511,0.009243028,0.00040681585,0.000087480024,0.00007605102,0.0014797219,0.00034829107,0.06942434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913543,0.00013623545,0.00004269311,0.0002053826,0.00018945686,0.0002908588],"domain_scores_gemma":[0.9983364,0.00065221055,0.00023306972,0.00025636397,0.0002907909,0.0002313517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045438198,0.00076553476,0.0005599142,0.0012844452,0.0024997245,0.0029981479,0.0010449413,0.0010506731,0.027345566],"category_scores_gemma":[0.0019458957,0.00041567048,0.00052945194,0.0009814458,0.0018128373,0.0027531767,0.0023611113,0.0017122924,0.0037918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046839696,0.00012057879,0.00094645505,0.00016359398,0.000030589257,0.0006240604,0.0007099008,0.0021613094,0.008531067,0.9613702,0.008380322,0.016493589],"study_design_scores_gemma":[0.0000743729,0.00006260342,0.0015069818,0.000059908674,0.000046436213,0.0005298903,0.0005470415,0.0055181114,0.013225673,0.9451873,0.033182345,0.00005938353],"about_ca_topic_score_codex":0.0022998475,"about_ca_topic_score_gemma":0.0028422638,"teacher_disagreement_score":0.027345566,"about_ca_system_score_codex":0.001790818,"about_ca_system_score_gemma":0.00070546777,"threshold_uncertainty_score":0.09148002},"labels":[],"label_agreement":null},{"id":"W145583369","doi":"","title":"A Note on the Hall-Condition Number of a Graph.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.014490520136057602,"score_gpt":0.2956513618336297,"score_spread":0.2811608416975721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W145583369","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07887145,0.020827174,0.106962465,0.033804875,0.019828705,0.00015242356,0.002286954,0.0010198681,0.7362461],"genre_scores_gemma":[0.8715197,0.010518098,0.05129123,0.0061317245,0.011553056,0.00021548438,0.0010688152,0.00045048672,0.047251523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990631,0.00023734293,0.000045400753,0.00022000806,0.00026454197,0.00016966632],"domain_scores_gemma":[0.99273866,0.0053139366,0.00026082192,0.0005934103,0.00052065507,0.0005723891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010664389,0.00073780393,0.0009730375,0.0031981997,0.0027433007,0.0026290456,0.0019594408,0.0019534326,0.02954756],"category_scores_gemma":[0.008659012,0.0004094521,0.0006807901,0.0025263617,0.0052765314,0.0072621796,0.002653765,0.005554859,0.0031425045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011373645,0.000023378292,0.00033204953,0.00017763459,0.000012695886,0.00018244184,0.0001234713,0.0009974557,0.0010316138,0.9440305,0.035677016,0.01729795],"study_design_scores_gemma":[0.000014864152,0.00002876952,0.00042492998,0.00003958175,0.000015985244,0.0001635023,0.00009860381,0.0014242212,0.0005645159,0.97245336,0.02474825,0.000023558292],"about_ca_topic_score_codex":0.0018564918,"about_ca_topic_score_gemma":0.0023948196,"teacher_disagreement_score":0.02954756,"about_ca_system_score_codex":0.0018666241,"about_ca_system_score_gemma":0.001012629,"threshold_uncertainty_score":0.098846495},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Disjoint sets; Dominating set; Combinatorics; Graph","score_opus":0.013711757464083662,"score_gpt":0.26537390016920026,"score_spread":0.2516621427051166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W145866003","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021597594,0.09468618,0.318755,0.058220852,0.040459197,0.000218983,0.0020880864,0.0009578956,0.46301624],"genre_scores_gemma":[0.34585527,0.12643677,0.3015352,0.029072113,0.057777666,0.00047637228,0.0020744712,0.0012215832,0.1355505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877113,0.00037316378,0.000076540164,0.0003019158,0.00037214134,0.0001050521],"domain_scores_gemma":[0.99399006,0.004400233,0.00018412486,0.00067526364,0.0004285194,0.0003218427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018257684,0.001387113,0.001603954,0.0019377917,0.0022806895,0.002724445,0.0023383955,0.0014442062,0.0082181655],"category_scores_gemma":[0.007355422,0.0006754336,0.0019293176,0.0031300322,0.003643002,0.010235643,0.0036737777,0.006633806,0.002607862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016263772,0.00006641532,0.0006470297,0.00088872423,0.00010728333,0.0010940238,0.0003844585,0.0034161701,0.001972986,0.80228704,0.12855124,0.060422007],"study_design_scores_gemma":[0.000019424666,0.000050874063,0.0007258378,0.00015197159,0.00007103574,0.0010762601,0.00016506808,0.0026229841,0.0004674202,0.85052156,0.14409494,0.000032586766],"about_ca_topic_score_codex":0.0025411595,"about_ca_topic_score_gemma":0.0046862797,"teacher_disagreement_score":0.0082181655,"about_ca_system_score_codex":0.0016946242,"about_ca_system_score_gemma":0.00077408686,"threshold_uncertainty_score":0.027492523},"labels":[],"label_agreement":null},{"id":"W1470794575","doi":"","title":"Existence for perfect T(K 1 , k)-triple systems.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Arithmetic","score_opus":0.013800513891207901,"score_gpt":0.216804341998463,"score_spread":0.2030038281072551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1470794575","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5185015,0.002024313,0.27159083,0.0035576115,0.0005830878,0.0001446385,0.0013246188,0.0010935273,0.20117998],"genre_scores_gemma":[0.96745235,0.0004459835,0.01817633,0.00031291746,0.00008162683,0.000084097876,0.00039717884,0.000081735656,0.012967756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892056,0.00023184011,0.00007331489,0.000220375,0.00021561212,0.00033820057],"domain_scores_gemma":[0.99607086,0.0019270297,0.00050555606,0.0005768876,0.00045806164,0.00046151583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000720287,0.00031965616,0.0005635733,0.0015256607,0.002971315,0.0033846595,0.00057964126,0.0015309397,0.015559855],"category_scores_gemma":[0.005075869,0.00057109003,0.00061760814,0.0011388753,0.0020481173,0.0044558276,0.0029826474,0.0016885174,0.002405448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001101532,0.000025677871,0.0008631722,0.00013872486,0.000021119606,0.00023341861,0.000493631,0.0023567837,0.0027836915,0.9784691,0.0050467756,0.0094578145],"study_design_scores_gemma":[0.000027306303,0.000044058314,0.0005512494,0.000071358096,0.000023722614,0.00050657516,0.0004894542,0.009702836,0.0023618592,0.9785548,0.0076328325,0.000033806944],"about_ca_topic_score_codex":0.0009592697,"about_ca_topic_score_gemma":0.0012387867,"teacher_disagreement_score":0.015559855,"about_ca_system_score_codex":0.0010817524,"about_ca_system_score_gemma":0.0009569114,"threshold_uncertainty_score":0.052052915},"labels":[],"label_agreement":null},{"id":"W147496691","doi":"","title":"A Note on Star Arboricity of Crowns.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Organometallic Compounds Synthesis and Characterization","field":"Chemistry","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arboricity; Mathematics; Star (game theory); Combinatorics; Mathematical analysis; Graph","score_opus":0.013175208603393683,"score_gpt":0.2179246447636905,"score_spread":0.2047494361602968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W147496691","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08380021,0.025229663,0.13115647,0.0102552455,0.006727286,0.00011305594,0.0013308948,0.0008694625,0.7405177],"genre_scores_gemma":[0.79945105,0.018138863,0.08099104,0.003956863,0.0015676729,0.00017177261,0.0010507932,0.0006572574,0.09401454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995365,0.00009057502,0.00003173466,0.0001106676,0.0001587758,0.000071690316],"domain_scores_gemma":[0.99902344,0.00043094138,0.00006157592,0.00024994178,0.00013974968,0.000094465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004774577,0.00030474894,0.00042730465,0.00063701154,0.0010593832,0.001583721,0.000883393,0.0005367786,0.011933803],"category_scores_gemma":[0.0019872256,0.00020153537,0.00031147996,0.00065869495,0.0016988728,0.0028559405,0.0012597907,0.0015427499,0.0021992214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000727479,0.000019235471,0.0003017057,0.00025761846,0.000013280952,0.00027319218,0.00017128176,0.0005175414,0.011034947,0.93882793,0.017569395,0.030941153],"study_design_scores_gemma":[0.0000127473,0.00016459046,0.0008472176,0.000060761042,0.00001747568,0.00096647756,0.00013457831,0.0021530578,0.015009524,0.667823,0.31277502,0.00003559915],"about_ca_topic_score_codex":0.0007374662,"about_ca_topic_score_gemma":0.0022025325,"teacher_disagreement_score":0.011933803,"about_ca_system_score_codex":0.0004543824,"about_ca_system_score_gemma":0.00040398343,"threshold_uncertainty_score":0.039922535},"labels":[],"label_agreement":null},{"id":"W147598185","doi":"","title":"Bondage number in oriented graphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.012176168225396909,"score_gpt":0.29484539892828276,"score_spread":0.28266923070288585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W147598185","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55991566,0.002953732,0.10205387,0.0033643201,0.0014996905,0.000080186765,0.0008096302,0.0006173217,0.32870552],"genre_scores_gemma":[0.9441135,0.0014925711,0.016129933,0.00023667987,0.00047121712,0.00009124586,0.00029420783,0.00014337368,0.03702733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999619,0.00008995776,0.000018134026,0.00008038876,0.00012480872,0.00006768341],"domain_scores_gemma":[0.9984579,0.0006325103,0.00030973417,0.000115034716,0.00014992042,0.00033490726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005071461,0.00035329425,0.00042134407,0.0024726465,0.0013070381,0.0021174608,0.00062924775,0.0010919403,0.014675764],"category_scores_gemma":[0.0029968852,0.00023490748,0.00023532555,0.0012554611,0.0016355468,0.0036432683,0.0010700878,0.0010653818,0.0019100542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004016236,0.000015734751,0.00046590684,0.00003967375,0.0000047585777,0.000039060084,0.000102212034,0.00079613517,0.0012073306,0.9855488,0.00283068,0.0089096185],"study_design_scores_gemma":[0.000012552658,0.000020508045,0.000593309,0.000024220997,0.0000081416265,0.00014418378,0.00009519565,0.004281021,0.0010846992,0.9849187,0.0088050915,0.000012321647],"about_ca_topic_score_codex":0.00050700986,"about_ca_topic_score_gemma":0.0007882607,"teacher_disagreement_score":0.014675764,"about_ca_system_score_codex":0.0007283141,"about_ca_system_score_gemma":0.00035890596,"threshold_uncertainty_score":0.049095333},"labels":[],"label_agreement":null},{"id":"W147739259","doi":"","title":"Two families of graphs that are not CCE-orientable","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.02582890884677912,"score_gpt":0.2883827748628266,"score_spread":0.26255386601604747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W147739259","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7997642,0.0014796582,0.04721552,0.0037283434,0.000394305,0.00015909257,0.0010572971,0.0005987572,0.1456028],"genre_scores_gemma":[0.9621007,0.0006009224,0.017117176,0.0005739847,0.00007992327,0.00015637893,0.0017132652,0.00015718033,0.01750042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922943,0.00013867328,0.000034356304,0.00020327957,0.00014991783,0.00024438024],"domain_scores_gemma":[0.99568367,0.0021129297,0.0005430653,0.00049515796,0.0004433186,0.0007218914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007075739,0.0009739821,0.0007869566,0.0018261914,0.0033476157,0.003209804,0.0012263627,0.0024243942,0.0077231443],"category_scores_gemma":[0.005124519,0.0010103874,0.000960297,0.0017095007,0.0022470602,0.0029649932,0.0016355001,0.0023827755,0.00071663625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006246906,0.00018006125,0.0058064708,0.00028407283,0.00007171542,0.0052156323,0.0024684726,0.0022291427,0.010028263,0.9425072,0.010616814,0.019967495],"study_design_scores_gemma":[0.00033230323,0.00014941329,0.017573884,0.00026763292,0.00020522864,0.009036496,0.0047485456,0.0117935715,0.010595262,0.8761912,0.06895113,0.00015533442],"about_ca_topic_score_codex":0.0018665174,"about_ca_topic_score_gemma":0.0018372743,"teacher_disagreement_score":0.0077231443,"about_ca_system_score_codex":0.0015998436,"about_ca_system_score_gemma":0.0006195767,"threshold_uncertainty_score":0.025836527},"labels":[],"label_agreement":null},{"id":"W148229027","doi":"","title":"The Counting Series for Unlabeled Linear Acyclic Hypergraphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Series (stratigraphy); Combinatorics; Biology","score_opus":0.008401725942124443,"score_gpt":0.2225427401329127,"score_spread":0.21414101419078826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W148229027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08002012,0.0038286457,0.73334986,0.004672194,0.0014694688,0.0001358239,0.0021598348,0.001900374,0.17246357],"genre_scores_gemma":[0.7063925,0.0053531677,0.17002624,0.0017069505,0.0025322372,0.000499759,0.0028073413,0.0011383516,0.10954345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983151,0.0004295335,0.00013682092,0.00032741477,0.00058454956,0.00020649673],"domain_scores_gemma":[0.9911289,0.005309007,0.00076756923,0.0010421037,0.0011108625,0.0006415655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023228873,0.00072265003,0.00090601307,0.0059237387,0.002194904,0.005230687,0.0016761379,0.0011242235,0.01392243],"category_scores_gemma":[0.020094644,0.0006625544,0.0008685899,0.005982176,0.0021599887,0.009331707,0.0017416195,0.0029662312,0.0028496222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025133431,0.000018573934,0.00037073952,0.00006870375,0.000013264739,0.00006905609,0.00011508443,0.0022118497,0.000274308,0.96408993,0.00791564,0.024827624],"study_design_scores_gemma":[0.000006852429,0.000007858169,0.00019270134,0.00003873471,0.000015109636,0.00019011204,0.000036529156,0.022281101,0.00042414252,0.9652244,0.011568715,0.000013765945],"about_ca_topic_score_codex":0.0018814658,"about_ca_topic_score_gemma":0.0027844117,"teacher_disagreement_score":0.01392243,"about_ca_system_score_codex":0.0030415575,"about_ca_system_score_gemma":0.0014821028,"threshold_uncertainty_score":0.04657513},"labels":[],"label_agreement":null},{"id":"W1483725570","doi":"","title":"The edge-coloring of graphs with small genus","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Genus; Edge coloring; Combinatorics; Enhanced Data Rates for GSM Evolution; Graph coloring; Zoology; Biology; Computer science; Graph; Artificial intelligence; Line graph","score_opus":0.013783901787935912,"score_gpt":0.20396592795589297,"score_spread":0.19018202616795704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1483725570","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8088235,0.0027552391,0.13010858,0.005538008,0.00038040613,0.00005627021,0.00061864185,0.000634016,0.051085368],"genre_scores_gemma":[0.95063204,0.0014436676,0.034834165,0.00063870964,0.0003947308,0.00007774637,0.0005200726,0.00024884296,0.011210147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992873,0.00029464188,0.000032811564,0.00014704953,0.00009436028,0.000143934],"domain_scores_gemma":[0.99331725,0.004270731,0.00066421536,0.00076492695,0.00026380882,0.00071909756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011163582,0.00095055613,0.0013015344,0.0020000546,0.0024216175,0.004613177,0.002167169,0.0019200561,0.004372206],"category_scores_gemma":[0.0074646696,0.0011649743,0.001003359,0.0023062243,0.0037691453,0.0060337107,0.0024281912,0.0028739816,0.0005118296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002025384,0.000049854338,0.0017607232,0.00015934487,0.000023092007,0.00008386201,0.00038368785,0.015098885,0.0024206783,0.9595757,0.005993797,0.014247856],"study_design_scores_gemma":[0.0000341995,0.00001533928,0.0005767565,0.000027134802,0.000019949723,0.00008752332,0.00012994246,0.025927527,0.00071009266,0.97008854,0.0023664632,0.000016499609],"about_ca_topic_score_codex":0.0023140272,"about_ca_topic_score_gemma":0.0028222075,"teacher_disagreement_score":0.004613177,"about_ca_system_score_codex":0.0018960417,"about_ca_system_score_gemma":0.0008610611,"threshold_uncertainty_score":0.014626503},"labels":[],"label_agreement":null},{"id":"W148937047","doi":"","title":"On groups with redundancy in multiplication.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Multiplication (music); Arithmetic; Redundancy (engineering); Computer science; Combinatorics; Operating system","score_opus":0.007186927590803211,"score_gpt":0.1793688034782214,"score_spread":0.17218187588741818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W148937047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16371298,0.021988338,0.3995892,0.013517506,0.003665759,0.000117030744,0.00076883566,0.0005448358,0.39609548],"genre_scores_gemma":[0.82168365,0.008987569,0.0737247,0.0032847458,0.0051730075,0.00019663623,0.0006556798,0.00026082832,0.08603318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880123,0.00046487848,0.00007031157,0.00017155994,0.0002679441,0.0002240177],"domain_scores_gemma":[0.99730587,0.0015087825,0.00029082858,0.00043856475,0.00027073562,0.00018522562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001193168,0.0008442413,0.0008577405,0.0025237543,0.0016903429,0.001841779,0.00087712385,0.0013002539,0.009256251],"category_scores_gemma":[0.0044114054,0.00049242144,0.0006571399,0.0018364569,0.0035076647,0.007163372,0.0021523046,0.0023946683,0.002152274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023851379,0.000011637456,0.0001037437,0.000044383134,0.000007370922,0.00009036148,0.00015072468,0.0006187177,0.00037137698,0.9888727,0.0034428614,0.006262196],"study_design_scores_gemma":[0.0000055815226,0.000016960854,0.00010102702,0.000018862285,0.0000058808428,0.00013923446,0.000045232566,0.0016522893,0.0001916518,0.9906611,0.007155429,0.0000067283518],"about_ca_topic_score_codex":0.00066362653,"about_ca_topic_score_gemma":0.0009044679,"teacher_disagreement_score":0.009256251,"about_ca_system_score_codex":0.0009576497,"about_ca_system_score_gemma":0.00046253923,"threshold_uncertainty_score":0.030965209},"labels":[],"label_agreement":null},{"id":"W148996821","doi":"","title":"Relationships between vertex-neighbor-integrity and other parameters","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Commutative Algebra and Its Applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Graph","score_opus":0.08533398824440068,"score_gpt":0.3190394182076954,"score_spread":0.2337054299632947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W148996821","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2339559,0.0015439721,0.6427521,0.003946489,0.0004551793,0.00020772839,0.0024673534,0.0014068495,0.11326434],"genre_scores_gemma":[0.94446266,0.0006569857,0.04280038,0.00020502218,0.0003187111,0.00011228762,0.00044990456,0.000555563,0.010438417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99195987,0.0025215922,0.000893026,0.0019936226,0.0019076747,0.00072423596],"domain_scores_gemma":[0.9169335,0.046305202,0.008038153,0.02046191,0.00567148,0.00258987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009241679,0.0008133658,0.0017160673,0.0025117835,0.0040272796,0.011241524,0.0049928236,0.0023910406,0.020309053],"category_scores_gemma":[0.059568163,0.0009005634,0.0007494336,0.0044361884,0.00607451,0.04104261,0.0037103803,0.0055145146,0.0022855406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118190124,0.00007215384,0.0020507558,0.00006806851,0.000022338962,0.00007039675,0.00031425522,0.0019097972,0.0006697842,0.98233634,0.0010384946,0.0113293845],"study_design_scores_gemma":[0.000020451595,0.000032376953,0.0006114558,0.000024321103,0.000052029707,0.00035901114,0.0003381261,0.008588702,0.0033636296,0.98225176,0.004313435,0.000044639688],"about_ca_topic_score_codex":0.0006610617,"about_ca_topic_score_gemma":0.00071585906,"teacher_disagreement_score":0.020309053,"about_ca_system_score_codex":0.0021387078,"about_ca_system_score_gemma":0.0012843087,"threshold_uncertainty_score":0.06794059},"labels":[],"label_agreement":null},{"id":"W1491930737","doi":"","title":"Vertex-Magic Total Labelings of Complete Bipartite Graphs","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Vertex (graph theory); MAGIC (telescope); Complete bipartite graph; Lambda; Discrete mathematics; Graph; Physics","score_opus":0.014770083210947256,"score_gpt":0.22008917696039187,"score_spread":0.20531909374944463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491930737","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8472782,0.00041392486,0.1173004,0.0003613131,0.000028988816,0.000043151424,0.0012020981,0.0004568166,0.032915182],"genre_scores_gemma":[0.95444155,0.00024841182,0.03867894,0.00010959873,0.00002616938,0.00006156709,0.0013012565,0.000094304836,0.0050381143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935085,0.00017031915,0.00004358077,0.00016180705,0.0001345172,0.00013886695],"domain_scores_gemma":[0.99721515,0.0014405578,0.00038759,0.00044513337,0.00023308722,0.00027844842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065379654,0.00039385242,0.00036558323,0.0013202741,0.001148645,0.0018752125,0.00068332,0.0005684323,0.0035121506],"category_scores_gemma":[0.002943725,0.00053867215,0.00051855575,0.0014234952,0.0014045648,0.0024176708,0.0010093801,0.00064913376,0.00033869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000324298,0.00005597681,0.0044426625,0.0001697343,0.000029073255,0.00011785351,0.00056086225,0.019147387,0.007848929,0.926286,0.004535603,0.036481753],"study_design_scores_gemma":[0.00004456242,0.000054972905,0.0022186062,0.000041847074,0.000036651647,0.00029148915,0.0003127571,0.048953604,0.006860937,0.93306124,0.00808977,0.00003357335],"about_ca_topic_score_codex":0.0014307547,"about_ca_topic_score_gemma":0.0023199376,"teacher_disagreement_score":0.0035121506,"about_ca_system_score_codex":0.0011070627,"about_ca_system_score_gemma":0.0004995403,"threshold_uncertainty_score":0.011749268},"labels":[],"label_agreement":null},{"id":"W149423157","doi":"","title":"A Note on the Decomposition Dimension of Complete Graphs.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dimension (graph theory); Decomposition; Combinatorics; Discrete mathematics","score_opus":0.01587284314016184,"score_gpt":0.24239626202262987,"score_spread":0.22652341888246802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W149423157","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048645597,0.07099646,0.3153717,0.08704747,0.017916467,0.00012970259,0.0024170254,0.0012040911,0.45627138],"genre_scores_gemma":[0.5627613,0.052320346,0.2718559,0.02145095,0.025105659,0.00040630036,0.0020408672,0.0012835488,0.062775165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822694,0.00059941725,0.000081287784,0.00042104642,0.00046640693,0.00020496077],"domain_scores_gemma":[0.9878236,0.0093212705,0.0003691795,0.0011597151,0.00051197386,0.00081416825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002193358,0.001243378,0.0014513473,0.002865864,0.0027834426,0.0049140113,0.0024188522,0.002284748,0.012460721],"category_scores_gemma":[0.011629732,0.00084043154,0.0013558497,0.003948117,0.006369308,0.012632761,0.00501649,0.0102992365,0.001952189],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007189861,0.00003591855,0.00056362094,0.00022786771,0.000028338356,0.000119782635,0.00021236262,0.001452883,0.0007828147,0.9081335,0.06647116,0.02189991],"study_design_scores_gemma":[0.000009686046,0.000013428726,0.00044223227,0.00006816808,0.000014114447,0.00013835293,0.00011264685,0.0022901285,0.00032550792,0.9606919,0.03587627,0.000017640266],"about_ca_topic_score_codex":0.002120187,"about_ca_topic_score_gemma":0.0036414566,"teacher_disagreement_score":0.012460721,"about_ca_system_score_codex":0.0026571911,"about_ca_system_score_gemma":0.0008963878,"threshold_uncertainty_score":0.041685224},"labels":[],"label_agreement":null},{"id":"W1494822778","doi":"","title":"On The Embedding Of Complements Of Some Hyperbolic Planes III.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematics and Applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Embedding; Pure mathematics; Artificial intelligence; Computer science","score_opus":0.03804853154896041,"score_gpt":0.3090193287118896,"score_spread":0.27097079716292916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1494822778","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45258698,0.003226732,0.16215485,0.0027219087,0.00080205925,0.00008219194,0.00057050417,0.00017261908,0.37768212],"genre_scores_gemma":[0.91084933,0.0014126067,0.026535457,0.0003964155,0.00019288083,0.000057126443,0.0005575723,0.00012913803,0.059869602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996904,0.00008489611,0.000012426008,0.000049266364,0.00008419296,0.00007895277],"domain_scores_gemma":[0.9995982,0.000142543,0.00005117302,0.000041799434,0.00008883116,0.00007760505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031238672,0.00047969213,0.00040772604,0.0009296989,0.0011566839,0.0023629228,0.0005029243,0.0006712647,0.007929189],"category_scores_gemma":[0.00141562,0.00030890093,0.00047312176,0.0005715251,0.0025883017,0.0026811564,0.0027538391,0.002368588,0.0010876242],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037846083,0.000009262366,0.00020167942,0.000037915805,0.000007978234,0.00012666233,0.00034281216,0.00073743233,0.0012199198,0.98938227,0.0016310978,0.006265037],"study_design_scores_gemma":[0.000013012201,0.000047966438,0.00092547317,0.00007591706,0.000016958602,0.00034770143,0.0010162982,0.0066293753,0.0016766499,0.968777,0.020455217,0.00001850866],"about_ca_topic_score_codex":0.0027236831,"about_ca_topic_score_gemma":0.0022279508,"teacher_disagreement_score":0.007929189,"about_ca_system_score_codex":0.00088039524,"about_ca_system_score_gemma":0.00037471237,"threshold_uncertainty_score":0.026525736},"labels":[],"label_agreement":null},{"id":"W149867181","doi":"","title":"Szeged Index of HC5C7[r, p] Nanotube.","year":2008,"lang":"hu","type":"article","venue":"Ars Combinatoria","topic":"Fullerene Chemistry and Applications","field":"Chemistry","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Nanotube; Statistics; Composite material; Materials science; Carbon nanotube; Computer science","score_opus":0.01532299681068667,"score_gpt":0.2310673118149188,"score_spread":0.21574431500423213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W149867181","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62238115,0.0012581408,0.012674534,0.0009879791,0.00096297625,0.000047926023,0.0022593339,0.00048748095,0.35894057],"genre_scores_gemma":[0.9592674,0.00053780124,0.0032297897,0.00025627928,0.000087077125,0.00008715888,0.0011189501,0.00013551542,0.035280105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998672,0.000011658851,0.000008371647,0.000022883243,0.00004605588,0.00004382842],"domain_scores_gemma":[0.9998801,0.000019205767,0.000016673917,0.000022712906,0.000030314952,0.000031037343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009406316,0.00026691472,0.00036908578,0.001389497,0.0013014551,0.0010753829,0.00037933176,0.000767624,0.0255811],"category_scores_gemma":[0.00025590515,0.00008450927,0.00012642574,0.00060759654,0.0004496372,0.0008253197,0.00058172917,0.00031923188,0.0020558878],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026467102,0.00004072339,0.00059986,0.00024256768,0.000016987287,0.0005180213,0.00012927385,0.002169046,0.061742634,0.89443827,0.016220154,0.02361784],"study_design_scores_gemma":[0.00006405448,0.00049799716,0.009955775,0.0001847846,0.000064158114,0.002126296,0.00073436275,0.07477417,0.13448378,0.61947954,0.15743504,0.0002000032],"about_ca_topic_score_codex":0.0006453712,"about_ca_topic_score_gemma":0.0009884943,"teacher_disagreement_score":0.0255811,"about_ca_system_score_codex":0.0005912258,"about_ca_system_score_gemma":0.00033212328,"threshold_uncertainty_score":0.08557725},"labels":[],"label_agreement":null},{"id":"W150213933","doi":"","title":"Fractional inverse and inverse fractional domination.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Control Systems Design","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Inverse; Fractional calculus; Applied mathematics; Geometry","score_opus":0.01136125872231081,"score_gpt":0.2097836554230529,"score_spread":0.1984223967007421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W150213933","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.120614834,0.0026684024,0.34063652,0.0018604537,0.00072408083,0.000069879454,0.00025651706,0.00027527733,0.5328941],"genre_scores_gemma":[0.89469886,0.0013598978,0.03019368,0.00064624316,0.00041209394,0.000094338735,0.00015599477,0.00009907568,0.072339684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994567,0.0001168785,0.000020847921,0.000092860486,0.00019727397,0.00011545504],"domain_scores_gemma":[0.9992854,0.0003099128,0.00008204952,0.000121414545,0.00012735024,0.00007384278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048482782,0.0004052499,0.00040458638,0.0011030844,0.0011929866,0.0015610318,0.0004526059,0.00059503433,0.0110301515],"category_scores_gemma":[0.003248711,0.00015719325,0.0004786357,0.0006217192,0.0019647325,0.0021488124,0.0015023106,0.0010886323,0.0009228407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026705107,0.00000966038,0.000111925925,0.00002613482,0.0000048594247,0.00007955978,0.00008002465,0.0017527832,0.0011926835,0.983125,0.0015700157,0.012020692],"study_design_scores_gemma":[0.000010806065,0.000019332892,0.00023547748,0.000021444077,0.000009087391,0.00029464907,0.00007664932,0.016166013,0.0015125872,0.96112853,0.02051228,0.000013053274],"about_ca_topic_score_codex":0.00096205994,"about_ca_topic_score_gemma":0.0013084993,"teacher_disagreement_score":0.0110301515,"about_ca_system_score_codex":0.0008959519,"about_ca_system_score_gemma":0.0005007569,"threshold_uncertainty_score":0.036899507},"labels":[],"label_agreement":null},{"id":"W150214721","doi":"","title":"On the Co-circuits of a Splitting Matroid.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Matroid; Mathematics; Combinatorics; Matroid partitioning; Graphic matroid; Discrete mathematics","score_opus":0.02112876898355665,"score_gpt":0.2430824634807771,"score_spread":0.22195369449722047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W150214721","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45126843,0.0029782252,0.24204041,0.0037893867,0.00033021386,0.0001008049,0.0011055644,0.00047051138,0.29791662],"genre_scores_gemma":[0.9390192,0.00073851185,0.027969426,0.00053440384,0.00021500817,0.000062892505,0.0006435514,0.00012974191,0.030687263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945325,0.0001520932,0.000027959215,0.00010304084,0.00014846599,0.00011517388],"domain_scores_gemma":[0.9985348,0.00079086394,0.0001083958,0.00016076595,0.00021008024,0.00019502686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005345555,0.0003587958,0.00044981105,0.00097133924,0.0013494695,0.0023248154,0.0009025008,0.0009233785,0.0106953215],"category_scores_gemma":[0.0023653924,0.00037073687,0.0004702456,0.0011470879,0.0023575816,0.0062751155,0.0018554262,0.0020252417,0.0010019987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003391233,0.000014296201,0.00027342216,0.000029068007,0.0000071096106,0.00007348832,0.00014311896,0.0007502033,0.00077810645,0.9901563,0.0015513822,0.006189547],"study_design_scores_gemma":[0.0000094685165,0.00001229843,0.0002799964,0.000010840561,0.000008546532,0.00013384092,0.0000918076,0.0039003717,0.00055251864,0.9906002,0.0043943087,0.000005742332],"about_ca_topic_score_codex":0.0019842887,"about_ca_topic_score_gemma":0.0024339524,"teacher_disagreement_score":0.0106953215,"about_ca_system_score_codex":0.0012686737,"about_ca_system_score_gemma":0.00041823395,"threshold_uncertainty_score":0.035779357},"labels":[],"label_agreement":null},{"id":"W1502738661","doi":"","title":"On Potentially Ck-graphic Sequences.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.016563136386097004,"score_gpt":0.23439978222847188,"score_spread":0.2178366458423749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502738661","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22477609,0.0029973176,0.40463427,0.0015610352,0.0011217641,0.00019957226,0.0014080442,0.0019034146,0.3613986],"genre_scores_gemma":[0.76061165,0.002050202,0.09186827,0.00060449797,0.00041180864,0.00019284063,0.0018237676,0.0007225089,0.14171441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991897,0.00016945899,0.00006219404,0.00016746204,0.00023097424,0.00018027826],"domain_scores_gemma":[0.99810374,0.00088492583,0.00022849606,0.0002907711,0.0002703985,0.00022160436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047834875,0.0010113235,0.00056265655,0.0030257842,0.0016066801,0.0032816527,0.0008057035,0.00091017055,0.02868042],"category_scores_gemma":[0.0050286497,0.00041588646,0.0005410639,0.0025895603,0.001600136,0.0038868224,0.0025231696,0.0016447674,0.006889008],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002605268,0.00005251212,0.0008015925,0.0002412735,0.000016912762,0.0008589251,0.00044222403,0.0023217932,0.0054129977,0.9083534,0.009879198,0.071358606],"study_design_scores_gemma":[0.000025988584,0.000050594877,0.00077997206,0.000114472954,0.000021901156,0.0011539378,0.00023658281,0.011553252,0.0047441144,0.9358172,0.045463327,0.000038602895],"about_ca_topic_score_codex":0.00090228673,"about_ca_topic_score_gemma":0.0021692323,"teacher_disagreement_score":0.02868042,"about_ca_system_score_codex":0.0009935295,"about_ca_system_score_gemma":0.00048458434,"threshold_uncertainty_score":0.09594554},"labels":[],"label_agreement":null},{"id":"W1504958541","doi":"","title":"Irreducible cyclic codes of length 2pn.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Arithmetic; Discrete mathematics","score_opus":0.012311740047581175,"score_gpt":0.24737944442209656,"score_spread":0.23506770437451538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504958541","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54797494,0.0043371455,0.14583553,0.0035695715,0.001081063,0.00022981162,0.0036520963,0.0011793593,0.29214057],"genre_scores_gemma":[0.93649435,0.0012107866,0.015345751,0.00042539102,0.00032947087,0.000104331295,0.0014046,0.00009791545,0.044587296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998892,0.00020664975,0.00004667125,0.00012578403,0.00040451455,0.00032442462],"domain_scores_gemma":[0.9981667,0.00066343596,0.00028212272,0.00044074323,0.00027155035,0.00017540886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047022785,0.00053549436,0.00045773244,0.0011277916,0.0010830227,0.001261712,0.00046769658,0.0008320656,0.008796308],"category_scores_gemma":[0.0038052641,0.0002382158,0.00031601483,0.001445958,0.0010062337,0.00126942,0.001904149,0.0012495492,0.0021198883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003303518,0.00007996778,0.0012550327,0.00018742039,0.00002057526,0.00070806604,0.0003918848,0.0062333406,0.0094885975,0.9136129,0.011967562,0.05572436],"study_design_scores_gemma":[0.000052039308,0.00011413159,0.0016686195,0.00011546769,0.000021744454,0.0010204308,0.00013046611,0.018924333,0.008446657,0.921281,0.048173387,0.000051786723],"about_ca_topic_score_codex":0.00096551026,"about_ca_topic_score_gemma":0.0013547912,"teacher_disagreement_score":0.008796308,"about_ca_system_score_codex":0.0007592049,"about_ca_system_score_gemma":0.0014058815,"threshold_uncertainty_score":0.029426575},"labels":[],"label_agreement":null},{"id":"W150683057","doi":"","title":"On line graphs which are weakly maximal clique irreducible.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Clique; Combinatorics; Line (geometry); Clique-sum; Clique number; Chordal graph; Discrete mathematics; Graph; 1-planar graph; Geometry","score_opus":0.021942974181400923,"score_gpt":0.29408166444763506,"score_spread":0.27213869026623416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W150683057","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62029994,0.00079205143,0.18989685,0.0028183148,0.000224988,0.00016767593,0.0023164845,0.0014307287,0.18205297],"genre_scores_gemma":[0.93594944,0.00067300035,0.026615608,0.0004944136,0.00023777717,0.00009752159,0.0028162256,0.0003057548,0.032810163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908197,0.0002803793,0.000032681102,0.00018229445,0.000167922,0.00025483363],"domain_scores_gemma":[0.9946865,0.0030382657,0.0008473621,0.00052066316,0.0003967832,0.0005104366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065596856,0.00055470905,0.0005834144,0.0016080606,0.0017922001,0.0023833117,0.00068333437,0.0011592822,0.015242894],"category_scores_gemma":[0.0050532883,0.0005804257,0.0006698118,0.0014572116,0.002078619,0.004482308,0.0018829816,0.001887782,0.0018242464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025370286,0.00009029789,0.0019446044,0.0001575442,0.000031107673,0.00049185724,0.0005987353,0.0046339277,0.0036189097,0.96198565,0.010665557,0.015528168],"study_design_scores_gemma":[0.00003289649,0.00002724124,0.0011969417,0.00004686686,0.000025858626,0.00035692344,0.00035380587,0.01122922,0.0015985752,0.9770279,0.008088582,0.000015272648],"about_ca_topic_score_codex":0.00092670135,"about_ca_topic_score_gemma":0.0018273557,"teacher_disagreement_score":0.015242894,"about_ca_system_score_codex":0.00088952517,"about_ca_system_score_gemma":0.00042565807,"threshold_uncertainty_score":0.050992608},"labels":[],"label_agreement":null},{"id":"W150903405","doi":"","title":"Krasnoselskii numbers and non simply connected orthogonal polygons.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"History and advancements in chemistry","field":"Chemistry","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.0057648338670935086,"score_gpt":0.2254828388266454,"score_spread":0.2197180049595519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W150903405","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13408104,0.011261655,0.070543535,0.003037411,0.0016501427,0.000032718384,0.00040505567,0.000175469,0.77881294],"genre_scores_gemma":[0.87563413,0.0070863753,0.019655246,0.0005350803,0.0007189348,0.000057592864,0.00035986584,0.00008265783,0.09587019],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997211,0.00006176755,0.000016944105,0.00004294918,0.000110581685,0.000046594672],"domain_scores_gemma":[0.99964345,0.00015504056,0.00006662229,0.000036259135,0.000042087413,0.00005653594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028216073,0.00038516094,0.0002961095,0.0014461778,0.0009886412,0.0021465884,0.00038087013,0.00038111093,0.0075774165],"category_scores_gemma":[0.0013919617,0.00022309048,0.00023318431,0.0011839545,0.002085074,0.0033411407,0.0012367606,0.0013508416,0.0011620685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062023482,0.0000037630625,0.000045002525,0.000014113121,0.0000010403609,0.00001811891,0.00003444082,0.00021235389,0.00011268247,0.9943825,0.0010892699,0.0040804697],"study_design_scores_gemma":[0.0000033123451,0.000004300492,0.00014270288,0.000012398589,0.0000016647641,0.00006470243,0.000056115292,0.0008495687,0.00013538142,0.98473597,0.013990046,0.000003885486],"about_ca_topic_score_codex":0.00047677392,"about_ca_topic_score_gemma":0.0008926066,"teacher_disagreement_score":0.0075774165,"about_ca_system_score_codex":0.00067077234,"about_ca_system_score_gemma":0.00049082976,"threshold_uncertainty_score":0.025349021},"labels":[],"label_agreement":null},{"id":"W150937722","doi":"","title":"Graceful Labelings of Graphs Associated with Vertex-saturated Graphs.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Edge-graceful labeling; Discrete mathematics; Graph; Line graph","score_opus":0.013250123035972,"score_gpt":0.1997373051002761,"score_spread":0.1864871820643041,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W150937722","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51770204,0.001652824,0.3160456,0.0033973877,0.00037246218,0.00014175344,0.002633844,0.0021784543,0.1558756],"genre_scores_gemma":[0.9338214,0.00085849833,0.0404167,0.0004397465,0.000297196,0.00012329285,0.0015924217,0.00037511202,0.022075724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989141,0.00027492372,0.000067215144,0.00025984732,0.00022113232,0.0002627737],"domain_scores_gemma":[0.99564654,0.0018836027,0.00070115866,0.0009205137,0.00026209882,0.00058619207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008353828,0.00069466716,0.00059660967,0.002246359,0.0025159828,0.003474732,0.0012194866,0.0011417102,0.00917197],"category_scores_gemma":[0.0046114586,0.0006564088,0.00089595316,0.0022031614,0.002491898,0.005038544,0.0029124583,0.0020181735,0.001281643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063337546,0.000021894946,0.0005844064,0.000045639248,0.000009743102,0.000074221956,0.00028352017,0.0024219693,0.001481311,0.9839324,0.0032883196,0.0077931215],"study_design_scores_gemma":[0.00001033033,0.000010824173,0.0003602074,0.0000169246,0.000013368364,0.00012082557,0.0001456865,0.0066046747,0.0012812077,0.9850699,0.006352553,0.000013504008],"about_ca_topic_score_codex":0.0018262464,"about_ca_topic_score_gemma":0.0022720497,"teacher_disagreement_score":0.00917197,"about_ca_system_score_codex":0.0018354406,"about_ca_system_score_gemma":0.00071739743,"threshold_uncertainty_score":0.030683279},"labels":[],"label_agreement":null},{"id":"W151120489","doi":"","title":"2-Reducible paths containing a specified edge in (2k+1)-edge-connected graphs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Enhanced Data Rates for GSM Evolution; Mathematics; Combinatorics; Computer science; Telecommunications","score_opus":0.02159210417045681,"score_gpt":0.2407699990500419,"score_spread":0.21917789487958508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W151120489","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7592529,0.0010318272,0.09810003,0.0012680499,0.0003309039,0.00028818933,0.0043557477,0.0012871876,0.13408512],"genre_scores_gemma":[0.91289216,0.00066917995,0.047909968,0.00028616146,0.00006031299,0.00024328119,0.00383953,0.00023544996,0.033863965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934644,0.00013392435,0.000051164618,0.00014646981,0.00012282746,0.00019924759],"domain_scores_gemma":[0.998502,0.00058727764,0.00027664122,0.0003528496,0.00013411717,0.00014712861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036463403,0.00067847106,0.0005413252,0.00097455346,0.0017995106,0.002011589,0.00092299056,0.0012358851,0.012687144],"category_scores_gemma":[0.002467721,0.0005903302,0.00083547906,0.00096629193,0.0011145057,0.0023919016,0.0016646279,0.0012890521,0.0024629917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001508983,0.0003666776,0.0049391463,0.001123493,0.00016647362,0.005709013,0.0021652535,0.032374296,0.028360326,0.78551066,0.02193854,0.11583711],"study_design_scores_gemma":[0.00013829296,0.00016046841,0.0033947325,0.00023126297,0.00010323741,0.0033658757,0.00089194614,0.01846684,0.020852135,0.9200219,0.032294482,0.00007884537],"about_ca_topic_score_codex":0.00096401566,"about_ca_topic_score_gemma":0.0020441525,"teacher_disagreement_score":0.012687144,"about_ca_system_score_codex":0.0006851197,"about_ca_system_score_gemma":0.0007192889,"threshold_uncertainty_score":0.04244274},"labels":[],"label_agreement":null},{"id":"W1511609224","doi":"","title":"No maximal partial spread of size 115 in PG(3,11)","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.009746909160056534,"score_gpt":0.2230698239956414,"score_spread":0.21332291483558488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1511609224","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78215283,0.0011173532,0.05054933,0.006267545,0.00041730606,0.00019880613,0.003963931,0.0019343803,0.15339842],"genre_scores_gemma":[0.95664144,0.00038293758,0.011572337,0.0008191109,0.00020781017,0.0001854271,0.0023975032,0.00022512126,0.027568307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872005,0.00022334099,0.00007883198,0.0002964736,0.0003515782,0.00032975723],"domain_scores_gemma":[0.9962704,0.0019887637,0.00046898218,0.0005887476,0.00017228688,0.000510738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084700953,0.00090733136,0.0015636969,0.0010176683,0.0026302326,0.0036615212,0.0010145009,0.0019406705,0.02475028],"category_scores_gemma":[0.0039946223,0.0006630029,0.001167777,0.0013235209,0.0022481873,0.005284697,0.003022067,0.0025705062,0.0041058874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033306975,0.00019239323,0.0028028595,0.0004712136,0.00019715566,0.00075396005,0.0009765733,0.0037528032,0.029024817,0.8952325,0.019618848,0.043646112],"study_design_scores_gemma":[0.0005262096,0.00023697436,0.0021435563,0.00012835703,0.00015574423,0.0009177748,0.0003191408,0.0055767796,0.02100144,0.94262,0.026261197,0.000112824884],"about_ca_topic_score_codex":0.00071489037,"about_ca_topic_score_gemma":0.0005916928,"teacher_disagreement_score":0.02475028,"about_ca_system_score_codex":0.0014558958,"about_ca_system_score_gemma":0.001673033,"threshold_uncertainty_score":0.082798004},"labels":[],"label_agreement":null},{"id":"W1515159858","doi":"","title":"Packing balanced complete multipartite graphs with hexagons","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Multipartite; Mathematics; Combinatorics; Physics; Quantum","score_opus":0.012193956852142687,"score_gpt":0.20602796421070085,"score_spread":0.19383400735855816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1515159858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45824566,0.0013818124,0.4629872,0.0011532346,0.00021990901,0.00031172202,0.0022367276,0.00062415225,0.07283954],"genre_scores_gemma":[0.7974553,0.0013020507,0.16940176,0.00047230333,0.0001152953,0.000355289,0.0028331417,0.00037212844,0.02769266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914134,0.00029466965,0.000051566636,0.00014772124,0.00015876947,0.00020594047],"domain_scores_gemma":[0.9986719,0.00057009084,0.00018634349,0.0002920792,0.000106063795,0.0001735442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053976587,0.0011797791,0.0016923492,0.0011592894,0.0010466793,0.0030087654,0.001186501,0.0016790455,0.014244806],"category_scores_gemma":[0.0027184892,0.0011939717,0.0006510005,0.0032894881,0.000731662,0.0034905658,0.0025563159,0.0011712093,0.0019115346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013523035,0.0005537999,0.0019854226,0.000616907,0.00017460108,0.00057784707,0.00029565304,0.5959149,0.015732035,0.22468576,0.019990098,0.13812064],"study_design_scores_gemma":[0.00015161585,0.00029464214,0.0011814631,0.00011673084,0.000052813786,0.00033786302,0.00043759766,0.64902323,0.01096041,0.32503173,0.012373348,0.000038519487],"about_ca_topic_score_codex":0.0012345386,"about_ca_topic_score_gemma":0.0014218681,"teacher_disagreement_score":0.014244806,"about_ca_system_score_codex":0.00082149624,"about_ca_system_score_gemma":0.00043540867,"threshold_uncertainty_score":0.047653615},"labels":[],"label_agreement":null},{"id":"W151888074","doi":"","title":"Binary codes from graphs on triples and permutation decoding.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Adjacency list; Adjacency matrix; Discrete mathematics; Binary number; Permutation (music); Decoding methods; Arithmetic; Algorithm; Graph","score_opus":0.009198161447047309,"score_gpt":0.21855478652794538,"score_spread":0.20935662508089808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W151888074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068925686,0.0011904467,0.7978863,0.0014722325,0.00053934957,0.00016335846,0.0007268814,0.0008097886,0.12828597],"genre_scores_gemma":[0.777393,0.0017366123,0.18481512,0.0009507396,0.0003387418,0.00028970986,0.0010029479,0.00040457907,0.033068627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991442,0.00027125355,0.000043904285,0.00009456305,0.00028560334,0.00016038887],"domain_scores_gemma":[0.9991085,0.0004202251,0.00009478258,0.00021400914,0.00010876975,0.000053757194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005881234,0.00081143016,0.0004990739,0.0011821577,0.0011745319,0.0017493165,0.0007297425,0.0012501046,0.0048860316],"category_scores_gemma":[0.0030339875,0.0003485358,0.0007918578,0.0014141748,0.0015183467,0.0029688226,0.0020968725,0.0021014223,0.0020162899],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025873469,0.000011214335,0.00006917855,0.000040588588,0.000005408024,0.00013574505,0.00010769885,0.0041543217,0.0015267809,0.9821761,0.0020241814,0.009722944],"study_design_scores_gemma":[0.000006826924,0.000011272076,0.000047019737,0.000023291912,0.0000044798885,0.00017444979,0.000031408432,0.018670605,0.0024650376,0.97270375,0.0058478797,0.000013954778],"about_ca_topic_score_codex":0.0013642125,"about_ca_topic_score_gemma":0.001647722,"teacher_disagreement_score":0.0048860316,"about_ca_system_score_codex":0.0009612257,"about_ca_system_score_gemma":0.0007565529,"threshold_uncertainty_score":0.016345382},"labels":[],"label_agreement":null},{"id":"W152148196","doi":"","title":"Monochromatic Fibonacci Numbers of Graphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Monochromatic color; Mathematics; Combinatorics; Discrete mathematics; Arithmetic; Physics; Optics","score_opus":0.007492433064624672,"score_gpt":0.2675876200069989,"score_spread":0.26009518694237427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W152148196","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16846152,0.008855459,0.22268039,0.0024290076,0.0025105283,0.00015947368,0.0013638054,0.00058647926,0.5929534],"genre_scores_gemma":[0.84029317,0.0025122822,0.08498654,0.001675938,0.00091707153,0.00019543136,0.00069967844,0.00017613372,0.06854372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994172,0.00011769936,0.00002981516,0.000117811775,0.00020460173,0.00011296228],"domain_scores_gemma":[0.9989636,0.00044857574,0.00014957695,0.00015245249,0.00020305152,0.00008274348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048535262,0.00056858454,0.00053761416,0.002657144,0.0018352955,0.002626329,0.00069376145,0.0010848127,0.014967046],"category_scores_gemma":[0.002662823,0.00036929236,0.0004835369,0.001657856,0.0016588334,0.003038898,0.000970736,0.0011707385,0.0024570639],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014220565,0.000003538334,0.00006213729,0.000029136107,0.0000026180367,0.000055798824,0.000056504872,0.00021566788,0.00061636156,0.98821646,0.0029118552,0.00781565],"study_design_scores_gemma":[0.0000059295808,0.0000073731017,0.00019444765,0.000016069203,0.0000040442937,0.0002206276,0.000036773654,0.0013237606,0.00049566873,0.9861755,0.011511033,0.000008758615],"about_ca_topic_score_codex":0.0013049168,"about_ca_topic_score_gemma":0.0024809204,"teacher_disagreement_score":0.014967046,"about_ca_system_score_codex":0.0011379139,"about_ca_system_score_gemma":0.0005184475,"threshold_uncertainty_score":0.05006981},"labels":[],"label_agreement":null},{"id":"W15242030","doi":"","title":"Two-Dimensional Bandwidth of Graphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bandwidth (computing); Combinatorics; Computer network; Computer science","score_opus":0.013483079314258253,"score_gpt":0.2793649703429749,"score_spread":0.2658818910287167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W15242030","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.305199,0.011581389,0.46213216,0.011833813,0.0015380402,0.00040031134,0.008721955,0.0017124787,0.19688082],"genre_scores_gemma":[0.8871051,0.004601972,0.06359543,0.001178615,0.0006889013,0.00059219595,0.0037870787,0.00030124266,0.038149387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99769044,0.0007970717,0.00013689189,0.00051254453,0.0004448442,0.0004182401],"domain_scores_gemma":[0.9915143,0.0045933607,0.0012161321,0.0013250026,0.0006427334,0.00070835016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014385963,0.0009030694,0.0010798327,0.004038626,0.0020291428,0.004232598,0.0019984161,0.0023619304,0.019491483],"category_scores_gemma":[0.013054931,0.00068010046,0.0009769994,0.0040077153,0.0022059085,0.006265575,0.0027240396,0.0021080552,0.0034491527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010932404,0.00006235806,0.0015551192,0.00030205064,0.00005566133,0.00025572805,0.000548881,0.006881354,0.0010033038,0.95047003,0.0097898245,0.02896636],"study_design_scores_gemma":[0.000024170808,0.000029359408,0.0012004955,0.00008662596,0.000029822351,0.0006669136,0.00031558503,0.018786564,0.00044218588,0.95653594,0.021858342,0.000024018642],"about_ca_topic_score_codex":0.0016419417,"about_ca_topic_score_gemma":0.0012660603,"teacher_disagreement_score":0.019491483,"about_ca_system_score_codex":0.0017063569,"about_ca_system_score_gemma":0.0006208517,"threshold_uncertainty_score":0.065205514},"labels":[],"label_agreement":null},{"id":"W152794511","doi":"","title":"Phi-Strong (weak) domination in a graph.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Domination analysis; Graph; Vertex (graph theory)","score_opus":0.05296783659037206,"score_gpt":0.34865348522186346,"score_spread":0.2956856486314914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W152794511","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5509259,0.0009655153,0.31808394,0.005421247,0.00029920225,0.00030106807,0.0019252615,0.000416262,0.12166153],"genre_scores_gemma":[0.9629854,0.0003623315,0.022600418,0.00040650083,0.00013667345,0.00017648711,0.0003272868,0.000036460347,0.012968533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780566,0.00084835343,0.00012317304,0.0004073176,0.00039190447,0.00042346516],"domain_scores_gemma":[0.99084127,0.006078619,0.00068575103,0.00056134857,0.0006943944,0.0011384945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023704604,0.00052553276,0.0007534914,0.0015400919,0.0014045059,0.0030027737,0.0009310884,0.0011068375,0.007080434],"category_scores_gemma":[0.009016444,0.00033613737,0.0006027725,0.001273315,0.0028065625,0.0047972314,0.0024984789,0.0016107499,0.0006403313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023102916,0.000083134255,0.0031842508,0.00024313365,0.000088987064,0.000290946,0.0005612363,0.0061497744,0.003640448,0.9548969,0.004734926,0.0258953],"study_design_scores_gemma":[0.00005364681,0.00008368137,0.0016316129,0.000048270642,0.0000694391,0.000458563,0.00039803464,0.029493688,0.001785779,0.9593323,0.006618754,0.000026210577],"about_ca_topic_score_codex":0.0010610336,"about_ca_topic_score_gemma":0.0014977733,"teacher_disagreement_score":0.007080434,"about_ca_system_score_codex":0.0011322912,"about_ca_system_score_gemma":0.0010651383,"threshold_uncertainty_score":0.023686409},"labels":[],"label_agreement":null},{"id":"W152869389","doi":"","title":"Families of Matrices with Good Auto and Cross-Correlation.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Correlation; Statistics; Geometry","score_opus":0.004246140175229221,"score_gpt":0.19646889642758048,"score_spread":0.19222275625235125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W152869389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36530197,0.002332965,0.495787,0.0019355876,0.0002621542,0.00015995774,0.0018249473,0.0011461569,0.13124923],"genre_scores_gemma":[0.9300635,0.0008996216,0.04038836,0.0005578496,0.00026414354,0.00019342135,0.00095804915,0.00016838413,0.026506621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985794,0.00049092335,0.000051061223,0.0002997708,0.00033098832,0.00024796664],"domain_scores_gemma":[0.9930641,0.0032760298,0.0011301753,0.0009927567,0.0008281596,0.00070875476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000992824,0.0006864036,0.00053683337,0.002843307,0.0017898543,0.0019429751,0.00072114175,0.0010364747,0.008440541],"category_scores_gemma":[0.0076704137,0.0006297418,0.0006189482,0.0011228133,0.0014771642,0.0021630032,0.0015555522,0.0010933278,0.0020247723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012682627,0.00004044501,0.0012370034,0.00006697126,0.000037102753,0.00046391116,0.00025229296,0.0044604223,0.0032982507,0.9686521,0.007907075,0.013457542],"study_design_scores_gemma":[0.000073888856,0.00007988376,0.0019187825,0.000081997285,0.00003858037,0.0027767392,0.00029868563,0.048308462,0.0041033225,0.923485,0.018764148,0.00007049408],"about_ca_topic_score_codex":0.00064689957,"about_ca_topic_score_gemma":0.0009510671,"teacher_disagreement_score":0.008440541,"about_ca_system_score_codex":0.0007154182,"about_ca_system_score_gemma":0.0006378988,"threshold_uncertainty_score":0.028236449},"labels":[],"label_agreement":null},{"id":"W1528865674","doi":"","title":"Maximal partial spreads in PG(3,5)","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.04255469665930454,"score_gpt":0.3191622974719635,"score_spread":0.27660760081265895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528865674","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75680655,0.0012963684,0.05989053,0.00063714327,0.000068247915,0.00010008736,0.002248959,0.0009964658,0.17795561],"genre_scores_gemma":[0.9614084,0.00034863743,0.015869873,0.00007838333,0.000032171156,0.000038678976,0.0012129903,0.000086273,0.020924637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973315,0.00005808523,0.000019535748,0.000044988752,0.00006925898,0.00007492761],"domain_scores_gemma":[0.99940395,0.00030081367,0.000096284195,0.000075344906,0.00005439974,0.0000691814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021729339,0.00036883148,0.00033199537,0.0009523669,0.0008510059,0.0013223668,0.00031934728,0.00041582267,0.017188216],"category_scores_gemma":[0.0010434004,0.00019348694,0.0003089136,0.0011403266,0.00068410515,0.0011854831,0.00070314837,0.0006883144,0.0023762113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013114247,0.00008507904,0.0032104072,0.00031798432,0.00006193021,0.0016384211,0.0012067017,0.007216386,0.06065881,0.77793777,0.00897188,0.13738328],"study_design_scores_gemma":[0.000117843934,0.00033218335,0.0051325434,0.00010588839,0.00008722053,0.0023356834,0.0006666335,0.006746797,0.046451256,0.8373588,0.10057975,0.00008544499],"about_ca_topic_score_codex":0.00068838435,"about_ca_topic_score_gemma":0.0010248735,"teacher_disagreement_score":0.017188216,"about_ca_system_score_codex":0.000525668,"about_ca_system_score_gemma":0.0004034794,"threshold_uncertainty_score":0.057500303},"labels":[],"label_agreement":null},{"id":"W153491315","doi":"","title":"Asymptotically good choice numbers of multigraphs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Mathematical economics","score_opus":0.019369932241194703,"score_gpt":0.2854565604757975,"score_spread":0.2660866282346028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W153491315","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37785432,0.005541935,0.15304698,0.006547808,0.0005037397,0.00008354886,0.0009955706,0.000788296,0.45463789],"genre_scores_gemma":[0.95742023,0.0008755038,0.01513572,0.0004086451,0.00020371075,0.00009672472,0.00024082579,0.00013375116,0.025484832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980767,0.0007653872,0.000076642034,0.00028088843,0.00053655374,0.00026376412],"domain_scores_gemma":[0.9905785,0.0063498933,0.00068953674,0.0010231923,0.00052279327,0.00083609263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018279074,0.00047449226,0.00074773683,0.003042856,0.0021348484,0.004533889,0.0010686809,0.0014530531,0.0117090065],"category_scores_gemma":[0.014058656,0.0006407513,0.00054664345,0.0018072649,0.004027733,0.008088024,0.0032245293,0.0029080098,0.0012367418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002104319,0.000005487157,0.00019306588,0.000020699961,0.0000033929032,0.000016736232,0.00007125006,0.0005013205,0.00014660977,0.9952618,0.0012110808,0.0025474906],"study_design_scores_gemma":[0.000005620194,0.0000036579777,0.00013044762,0.000012627241,0.0000034194736,0.000050106337,0.000034036308,0.0020919694,0.00013363741,0.9954152,0.0021148361,0.0000044388216],"about_ca_topic_score_codex":0.0009993827,"about_ca_topic_score_gemma":0.0017084586,"teacher_disagreement_score":0.0117090065,"about_ca_system_score_codex":0.002771581,"about_ca_system_score_gemma":0.0007404252,"threshold_uncertainty_score":0.039170504},"labels":[],"label_agreement":null},{"id":"W1537722183","doi":"","title":"On Theorems Equivalent with Kotzig's Result on Graphs with Unique 1-Factors","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.023767092404476397,"score_gpt":0.2714564342471568,"score_spread":0.24768934184268043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537722183","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17543878,0.007419547,0.28902397,0.019904932,0.0038367147,0.00024096678,0.0017248018,0.0016627114,0.5007476],"genre_scores_gemma":[0.84045786,0.008038671,0.059429716,0.009150077,0.0033356736,0.0005619906,0.001974155,0.001430592,0.075621344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807644,0.0005486724,0.000106227635,0.0005113361,0.00039970974,0.00035763864],"domain_scores_gemma":[0.9946045,0.003650942,0.00038282256,0.0006199044,0.00038053485,0.0003612434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002110968,0.0020673631,0.002247967,0.0052600238,0.0045655696,0.0044256877,0.002959909,0.0029745332,0.019539801],"category_scores_gemma":[0.0075299595,0.0012625668,0.0035648576,0.006509041,0.006467466,0.020485435,0.0076117525,0.008028827,0.0028147027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005895937,0.00002711739,0.00012779303,0.00012801088,0.000016380704,0.0000993601,0.00044790897,0.0006193198,0.0004644334,0.9887087,0.004738599,0.0045634545],"study_design_scores_gemma":[0.000010960031,0.000008168125,0.00011416685,0.000018331422,0.000017472492,0.00008120416,0.000085289896,0.0006303426,0.00014071156,0.99586475,0.003018311,0.000010356147],"about_ca_topic_score_codex":0.003036787,"about_ca_topic_score_gemma":0.0025219747,"teacher_disagreement_score":0.019539801,"about_ca_system_score_codex":0.0033138539,"about_ca_system_score_gemma":0.000895768,"threshold_uncertainty_score":0.06536716},"labels":[],"label_agreement":null},{"id":"W153866119","doi":"","title":"A New s3 Type Condition for Heavy Cycles in Weighted Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Type (biology); Combinatorics; Biology","score_opus":0.03459558252301843,"score_gpt":0.3022723663448287,"score_spread":0.26767678382181026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W153866119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31277895,0.0013313388,0.36269602,0.004722343,0.0037190837,0.0005559598,0.003954593,0.0030713107,0.30717036],"genre_scores_gemma":[0.85245943,0.0008078257,0.09253822,0.0026233566,0.0013015936,0.0005898979,0.0030616857,0.0011995302,0.04541854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987784,0.00024170997,0.00012218604,0.00027973467,0.0002925355,0.00028544705],"domain_scores_gemma":[0.994835,0.0017654902,0.00044515426,0.0007644482,0.0011221004,0.0010677647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013020049,0.0006734597,0.0010339795,0.002430604,0.0028301429,0.0032162198,0.0018712565,0.0033965718,0.033138286],"category_scores_gemma":[0.00908745,0.00075521093,0.0015184936,0.0022955725,0.002367458,0.0070196814,0.0029791796,0.0033373036,0.0049574324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030397828,0.00006827478,0.0012192597,0.00020813152,0.000019364415,0.0004927936,0.00032129415,0.0009605239,0.0063734,0.9537394,0.018316003,0.017977647],"study_design_scores_gemma":[0.00008945928,0.000078590565,0.00073896104,0.00008382326,0.000029562952,0.00060788,0.00033362073,0.010516294,0.0044026366,0.9663821,0.016680753,0.00005634297],"about_ca_topic_score_codex":0.0015355569,"about_ca_topic_score_gemma":0.0019219898,"teacher_disagreement_score":0.033138286,"about_ca_system_score_codex":0.0012485231,"about_ca_system_score_gemma":0.0014139148,"threshold_uncertainty_score":0.11085856},"labels":[],"label_agreement":null},{"id":"W154253029","doi":"","title":"On embedding partial unitals and large (k, n)-arcs","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Embedding; Mathematics; Pure mathematics; Combinatorics; Computer science; Artificial intelligence","score_opus":0.009529900423714164,"score_gpt":0.2078367881897664,"score_spread":0.19830688776605224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W154253029","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49652228,0.0020733173,0.29362828,0.0032810634,0.0002748849,0.0001203868,0.0005867954,0.0010765413,0.20243643],"genre_scores_gemma":[0.92463994,0.0010677327,0.036620863,0.00031347323,0.00014293498,0.00010579131,0.00033087717,0.0002709787,0.036507454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991819,0.00033454117,0.000041320385,0.00015432549,0.0001276392,0.00016013312],"domain_scores_gemma":[0.9941182,0.0040232097,0.0004764777,0.00065340474,0.00030452228,0.0004241141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069729576,0.0007456299,0.0008291435,0.0014844806,0.0018759167,0.0039503365,0.0011808184,0.0012863011,0.01151504],"category_scores_gemma":[0.0065030647,0.00072577584,0.00059331866,0.0026851364,0.0030121643,0.0076805144,0.0032665192,0.0021824173,0.0011788994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105131534,0.000040029554,0.00043899534,0.00009161781,0.000010225722,0.00016970906,0.0004389675,0.005843864,0.0010993928,0.9762224,0.0024051578,0.013134527],"study_design_scores_gemma":[0.000016058675,0.000017271757,0.00027841757,0.000033498978,0.000015678808,0.00018724096,0.00031622523,0.019473366,0.0009818227,0.97307825,0.00558593,0.00001622855],"about_ca_topic_score_codex":0.001178053,"about_ca_topic_score_gemma":0.0021191866,"teacher_disagreement_score":0.01151504,"about_ca_system_score_codex":0.001471144,"about_ca_system_score_gemma":0.00041628393,"threshold_uncertainty_score":0.038521707},"labels":[],"label_agreement":null},{"id":"W154255124","doi":"","title":"Minimum Degree and the Orientation of a Graph.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Orientation (vector space); Graph; Combinatorics; Geometry; Physics","score_opus":0.013963262927331192,"score_gpt":0.23887480670042938,"score_spread":0.2249115437730982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W154255124","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4408622,0.0030487417,0.43210408,0.002570109,0.00064999046,0.00007854811,0.0014132169,0.00041447981,0.118858606],"genre_scores_gemma":[0.91455054,0.0022271334,0.06327924,0.00018656382,0.0002620462,0.000068748486,0.0010102144,0.00020879912,0.018206637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996406,0.00008707401,0.00001951169,0.00008156135,0.00009876955,0.00007245623],"domain_scores_gemma":[0.99884593,0.00046896332,0.00021077393,0.00014919948,0.00015548343,0.00016955877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003760115,0.0003926303,0.0004366161,0.001293243,0.0007041657,0.001915526,0.00059779984,0.000697416,0.005475669],"category_scores_gemma":[0.0037337986,0.00032167078,0.00035743852,0.0010745928,0.0015475441,0.0022243094,0.0012470726,0.0011829495,0.0012126178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013655788,0.000044459768,0.0028816336,0.00012671572,0.000019534009,0.00013722733,0.00028984004,0.011504767,0.0050025997,0.9057417,0.008017965,0.06609692],"study_design_scores_gemma":[0.000026636779,0.00004389481,0.0023744479,0.000060003673,0.000027265669,0.0004637925,0.00038466734,0.022600334,0.0034772467,0.9486038,0.021916509,0.000021368784],"about_ca_topic_score_codex":0.0010241425,"about_ca_topic_score_gemma":0.0017581886,"teacher_disagreement_score":0.005475669,"about_ca_system_score_codex":0.000656958,"about_ca_system_score_gemma":0.00034516913,"threshold_uncertainty_score":0.018317938},"labels":[],"label_agreement":null},{"id":"W15435421","doi":"","title":"On k-sets of type (2, h) in a planar space.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Planar; Type (biology); Space (punctuation); Combinatorics; Arithmetic; Topology (electrical circuits); Pure mathematics; Discrete mathematics; Computer science; Computer graphics (images); Operating system; Geology","score_opus":0.009590963137248,"score_gpt":0.2338139800957916,"score_spread":0.2242230169585436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W15435421","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5714482,0.0013621073,0.28300884,0.001411901,0.0005281607,0.00014528466,0.0026729112,0.0007039581,0.13871866],"genre_scores_gemma":[0.879718,0.00057048275,0.071410455,0.00031188707,0.00017130288,0.00011552165,0.002139034,0.00026565202,0.04529772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905246,0.00020341732,0.00006448693,0.00015827222,0.0002820095,0.00023936575],"domain_scores_gemma":[0.99870753,0.00062780094,0.00020395129,0.0001790354,0.00012228369,0.00015944251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044082617,0.0005763628,0.00088854163,0.0020188084,0.002284284,0.0033982818,0.0015534475,0.0014465352,0.016500056],"category_scores_gemma":[0.0025839342,0.00059893384,0.00090791075,0.0019983782,0.002028168,0.0038714684,0.004669032,0.0018938602,0.0024702004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024125303,0.00005229244,0.0012945125,0.00017289822,0.00003816981,0.0004758037,0.00052153587,0.0121491365,0.0027733573,0.9540675,0.0073101926,0.020903297],"study_design_scores_gemma":[0.00004492059,0.00004075193,0.0010105501,0.000063859276,0.000018348408,0.0005254697,0.00078421645,0.018267246,0.0023527874,0.96560204,0.011255758,0.000034050812],"about_ca_topic_score_codex":0.0015941353,"about_ca_topic_score_gemma":0.0019869297,"teacher_disagreement_score":0.016500056,"about_ca_system_score_codex":0.0012041132,"about_ca_system_score_gemma":0.00039810166,"threshold_uncertainty_score":0.055198193},"labels":[],"label_agreement":null},{"id":"W154378396","doi":"","title":"Comment on \"Properly Coloured Hamiltonian Paths in Edge-coloured Complete Graphs without Monochromatic Triangles\".","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Monochromatic color; Mathematics; Enhanced Data Rates for GSM Evolution; Hamiltonian (control theory); Combinatorics; Hamiltonian path; Graph; Computer science; Mathematical optimization; Optics; Physics; Artificial intelligence","score_opus":0.025989539586778323,"score_gpt":0.28188861639656165,"score_spread":0.25589907680978335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W154378396","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000944125,0.0019844647,0.0010532079,0.9162249,0.070900485,0.00003737847,0.0006213882,0.00024947218,0.007984564],"genre_scores_gemma":[0.0063316217,0.0013376197,0.00073748076,0.9642853,0.019608386,0.00007867595,0.00015137976,0.00007444223,0.0073950137],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99683917,0.00044096372,0.00036373318,0.0007929335,0.0011172795,0.0004458703],"domain_scores_gemma":[0.98770624,0.006458228,0.0010865353,0.0006064326,0.003440416,0.0007020279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036704491,0.0012842016,0.0013480464,0.0011302965,0.004151033,0.0021526897,0.006234564,0.028292488,0.012833217],"category_scores_gemma":[0.025268143,0.0009256464,0.0017632305,0.0015698172,0.0062909303,0.005180877,0.0025942014,0.028102446,0.0110486895],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006962214,0.000009695746,0.00024213073,0.00016825237,0.000018291223,0.00046975075,0.00014702507,0.00012248491,0.00024455212,0.008921804,0.98706853,0.00251789],"study_design_scores_gemma":[0.00017164476,0.000054156953,0.002698213,0.000558728,0.0000800081,0.0011371949,0.0006050747,0.00046729023,0.0013498813,0.033415873,0.959358,0.00010393212],"about_ca_topic_score_codex":0.020809192,"about_ca_topic_score_gemma":0.019807648,"teacher_disagreement_score":0.028292488,"about_ca_system_score_codex":0.003979527,"about_ca_system_score_gemma":0.0026993002,"threshold_uncertainty_score":0.042931378},"labels":[],"label_agreement":null},{"id":"W1547542988","doi":"","title":"Sparse Semi-Magic Squares and Vertex-magic Labelings","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Magic square; Combinatorics; MAGIC (telescope); Mathematics; Row; Vertex (graph theory); Remainder; Discrete mathematics; Arithmetic; Graph; Computer science; Physics; Quantum mechanics","score_opus":0.007694649119300171,"score_gpt":0.20465222152414303,"score_spread":0.19695757240484285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547542988","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14789508,0.0006907433,0.7496738,0.0010100966,0.00026381493,0.000094615636,0.0005147842,0.0010656621,0.09879149],"genre_scores_gemma":[0.69134575,0.0006540752,0.27717867,0.00063465437,0.00018244416,0.0002128053,0.0006821365,0.00031599402,0.028793486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947554,0.00013254934,0.000024041594,0.00011924259,0.00015929207,0.00008927239],"domain_scores_gemma":[0.99906987,0.00040056193,0.00009268124,0.00022896887,0.00011870198,0.00008926346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003481093,0.0003898658,0.00035812994,0.0005535442,0.0008645798,0.00096435694,0.0006587034,0.0005994616,0.0067454367],"category_scores_gemma":[0.0015542242,0.0003430162,0.00040495893,0.0009142273,0.0015660042,0.0019070604,0.0017281899,0.0013157693,0.0011981312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038011625,0.000011687603,0.00015281273,0.000048972568,0.000003470197,0.000077009994,0.00014684076,0.004344441,0.004178363,0.9693141,0.0025076813,0.01917672],"study_design_scores_gemma":[0.000018068293,0.000031759148,0.00013493486,0.000015619682,0.0000048617403,0.00020577289,0.00008624276,0.019566601,0.0048589,0.95565164,0.019407995,0.000017615004],"about_ca_topic_score_codex":0.00051769643,"about_ca_topic_score_gemma":0.0009831056,"teacher_disagreement_score":0.0067454367,"about_ca_system_score_codex":0.00056050613,"about_ca_system_score_gemma":0.0003813375,"threshold_uncertainty_score":0.022565722},"labels":[],"label_agreement":null},{"id":"W155199866","doi":"","title":"On Motzkin words and noncrossing partitions.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.030110578222651212,"score_gpt":0.30621473170043545,"score_spread":0.2761041534777842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W155199866","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33020794,0.015228383,0.076685034,0.008322586,0.0020947305,0.000082700266,0.0006625009,0.00028698932,0.56642914],"genre_scores_gemma":[0.906905,0.006076495,0.012261052,0.001166252,0.0014712393,0.000094309835,0.00073422206,0.00015316189,0.07113824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995889,0.00011483666,0.000018905244,0.00006724926,0.0001035403,0.00010657536],"domain_scores_gemma":[0.99885595,0.0005900296,0.00018324629,0.000114135146,0.0001161307,0.00014050356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005361297,0.00074963004,0.0007113378,0.0022637579,0.0023353137,0.0029563436,0.0008924387,0.0013653738,0.012027811],"category_scores_gemma":[0.0031142237,0.00045160585,0.0005228035,0.0019315778,0.0031356388,0.0073548094,0.0026777736,0.0026912792,0.002353505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002885206,0.000010909499,0.00015243728,0.000035653575,0.0000036245874,0.00008075772,0.00018306504,0.00036377207,0.00024807372,0.99219054,0.002490707,0.004211484],"study_design_scores_gemma":[0.000005078143,0.0000050095227,0.00021028507,0.000016843425,0.000003542736,0.00011935459,0.000108404776,0.00068230485,0.000089692956,0.9951579,0.0035967422,0.0000048638212],"about_ca_topic_score_codex":0.0009853223,"about_ca_topic_score_gemma":0.0016573755,"teacher_disagreement_score":0.012027811,"about_ca_system_score_codex":0.0012366534,"about_ca_system_score_gemma":0.00036981978,"threshold_uncertainty_score":0.04023701},"labels":[],"label_agreement":null},{"id":"W155720742","doi":"","title":"A Note on the Total Relative Displacement.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"International Law and Aviation","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Displacement (psychology); Psychology","score_opus":0.009818221995686759,"score_gpt":0.27342849872976294,"score_spread":0.26361027673407617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W155720742","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0088700615,0.016970528,0.13874891,0.0365121,0.00718854,0.00005271387,0.0007230377,0.0001874041,0.7907467],"genre_scores_gemma":[0.66629755,0.016690146,0.07410461,0.017258016,0.0073964917,0.0004735201,0.00064338784,0.0007914048,0.21634492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978569,0.000607947,0.0001236852,0.0005517674,0.00068543473,0.0001742859],"domain_scores_gemma":[0.99620545,0.0019237506,0.0001689864,0.0010427808,0.00051091023,0.00014810244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022595688,0.00060423004,0.0008461887,0.0017001291,0.0032194545,0.0030615649,0.0021185935,0.0017358507,0.030372927],"category_scores_gemma":[0.011002088,0.00035881117,0.0013617728,0.0022901206,0.009848424,0.012813509,0.0049511306,0.0059703607,0.004234176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046018645,0.0000011189102,0.00003111873,0.00001905667,0.0000033633173,0.000009784531,0.000045855086,0.000075594755,0.000028201775,0.9927596,0.0044827345,0.002539028],"study_design_scores_gemma":[0.000004322486,0.0000062731133,0.00011310784,0.000021956334,0.0000059743206,0.0000561171,0.00006135168,0.00027337702,0.00009508498,0.95123094,0.048126746,0.000004705941],"about_ca_topic_score_codex":0.0034166654,"about_ca_topic_score_gemma":0.0038707089,"teacher_disagreement_score":0.030372927,"about_ca_system_score_codex":0.002141346,"about_ca_system_score_gemma":0.0011921132,"threshold_uncertainty_score":0.10160756},"labels":[],"label_agreement":null},{"id":"W1558644659","doi":"","title":"A study of typenumber in book-embedding","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Embedding; Artificial intelligence; Computer science","score_opus":0.012701671020705909,"score_gpt":0.22187006321866187,"score_spread":0.20916839219795597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558644659","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5011723,0.0021279638,0.22364654,0.0033622412,0.0006862744,0.00011769963,0.0006273232,0.000467919,0.26779172],"genre_scores_gemma":[0.9257853,0.0008377598,0.029831685,0.00017381796,0.00033927607,0.000052539683,0.00025821166,0.00026165557,0.042459816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985644,0.00053347874,0.00006302949,0.0002602836,0.00033053293,0.00024830602],"domain_scores_gemma":[0.98929626,0.0061857398,0.0012697526,0.0013567964,0.0010185192,0.00087300246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012629511,0.00048135643,0.0008332752,0.002487638,0.0030024454,0.0041859215,0.0017966221,0.0013878457,0.018736906],"category_scores_gemma":[0.010705644,0.00060812663,0.00079791865,0.0038623342,0.0036050244,0.010743212,0.002080225,0.0024333168,0.0011564449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004895841,0.000049788992,0.0007825886,0.000045497807,0.0000037442735,0.00006542668,0.00029798053,0.0019592128,0.0004993696,0.98535144,0.001680583,0.009215411],"study_design_scores_gemma":[0.000014622948,0.000035405035,0.0008499349,0.000048137852,0.000019489147,0.0003360479,0.00049037853,0.019742101,0.0012186894,0.96645766,0.010758831,0.000028602095],"about_ca_topic_score_codex":0.0016217567,"about_ca_topic_score_gemma":0.0019360706,"teacher_disagreement_score":0.018736906,"about_ca_system_score_codex":0.0019392652,"about_ca_system_score_gemma":0.0007385813,"threshold_uncertainty_score":0.0626812},"labels":[],"label_agreement":null},{"id":"W156100500","doi":"","title":"Some Results on Fractional Edge Coloring of Graphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Edge coloring; Enhanced Data Rates for GSM Evolution; Graph coloring; Combinatorics; Graph; Computer science; Artificial intelligence; Line graph","score_opus":0.01790362477311514,"score_gpt":0.24964450090771292,"score_spread":0.2317408761345978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W156100500","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0955442,0.02705873,0.31508657,0.014288324,0.003191187,0.00015709334,0.0029505298,0.0013145239,0.5404088],"genre_scores_gemma":[0.70940703,0.029188925,0.1531216,0.007399885,0.0056797867,0.00040676375,0.0051071965,0.0010319786,0.088656865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895656,0.0002504163,0.000058778955,0.00021817048,0.00027595964,0.00024012354],"domain_scores_gemma":[0.9947748,0.0035298546,0.00028872187,0.0006595573,0.00034520103,0.0004017222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016346409,0.0013739545,0.0012068133,0.0036478823,0.0028971944,0.004491541,0.001984704,0.0018080453,0.017250473],"category_scores_gemma":[0.0070643937,0.00084431045,0.0014061681,0.0063386876,0.0028941252,0.007493475,0.0023401247,0.0046615615,0.0025531398],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105893116,0.00012218994,0.0007145976,0.00044404558,0.000035277026,0.00015535131,0.00029134372,0.0051471964,0.0012112419,0.92486095,0.02973368,0.03717826],"study_design_scores_gemma":[0.000020018793,0.000018273024,0.0004660712,0.000070593414,0.00003290497,0.00022000828,0.00012399057,0.006761394,0.0006851724,0.96516466,0.0264196,0.000017316497],"about_ca_topic_score_codex":0.0036031336,"about_ca_topic_score_gemma":0.0042689275,"teacher_disagreement_score":0.017250473,"about_ca_system_score_codex":0.0031872387,"about_ca_system_score_gemma":0.0010638771,"threshold_uncertainty_score":0.05770862},"labels":[],"label_agreement":null},{"id":"W156107011","doi":"","title":"The rank partition and the covering number of the elements of the dual matroid.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Commutative Algebra and Its Applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Matroid; Mathematics; Partition (number theory); Dual (grammatical number); Rank (graph theory); Combinatorics; Dual graph; Graph; Art; Line graph","score_opus":0.017269874807816006,"score_gpt":0.29163973239325364,"score_spread":0.27436985758543764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W156107011","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7643031,0.0018793659,0.05831438,0.0021421756,0.00045245767,0.000038074166,0.0007096793,0.00019744359,0.17196327],"genre_scores_gemma":[0.980168,0.0003899738,0.005251083,0.00010448738,0.00024129594,0.00002555102,0.00023557713,0.000050692586,0.013533355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924064,0.00019617667,0.000034580346,0.00015320421,0.00017248178,0.00020298276],"domain_scores_gemma":[0.99827707,0.0006505279,0.00029968433,0.0001852261,0.00019200459,0.00039559428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010186998,0.0004185754,0.0005500089,0.0021084254,0.0018693587,0.0037361423,0.0007356016,0.0009479581,0.009837991],"category_scores_gemma":[0.0040186592,0.00039889565,0.00038453136,0.0009805743,0.0035527537,0.0045096427,0.0015677969,0.0014407783,0.0010467676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000707366,0.000013050894,0.0004892331,0.000017387913,0.0000051508687,0.00003415878,0.00013023772,0.0004975629,0.00094227126,0.99362385,0.0010439621,0.0031324134],"study_design_scores_gemma":[0.000016594668,0.000023693088,0.0012737507,0.000021718624,0.000014519363,0.00027766824,0.00019623547,0.0054835286,0.0015704685,0.9870617,0.0040395907,0.000020458818],"about_ca_topic_score_codex":0.0011227845,"about_ca_topic_score_gemma":0.0011937778,"teacher_disagreement_score":0.009837991,"about_ca_system_score_codex":0.0011675234,"about_ca_system_score_gemma":0.0005228317,"threshold_uncertainty_score":0.03291136},"labels":[],"label_agreement":null},{"id":"W1561983737","doi":"","title":"On cross numbers of minimal zero sequences in certain cyclic groups","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Integer (computer science); Upper and lower bounds; Set (abstract data type); Zero (linguistics); Discrete mathematics; Mathematical analysis","score_opus":0.019577989922383864,"score_gpt":0.300315737069441,"score_spread":0.2807377471470571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561983737","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9521419,0.0006445478,0.014731429,0.00019362029,0.000025825224,0.000014277338,0.0001087042,0.00007991501,0.032059804],"genre_scores_gemma":[0.9928727,0.00026550837,0.0045532384,0.00005262079,0.000045481214,0.000052423195,0.00020311236,0.0000251208,0.0019297015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888915,0.00026546806,0.00006316319,0.00022831108,0.00032311512,0.0002308286],"domain_scores_gemma":[0.9959766,0.00251054,0.0006311717,0.00020962038,0.00021678903,0.00045529054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016121547,0.00065660215,0.00055427174,0.0037420823,0.0020080446,0.0033339001,0.00080887246,0.001002205,0.0040003485],"category_scores_gemma":[0.00572112,0.00046838075,0.0004718182,0.001464748,0.0029816693,0.0031727734,0.0027203644,0.0010280894,0.00040611989],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033863442,0.00011880183,0.010218743,0.00014606075,0.000040695522,0.0012335557,0.0010415033,0.008653045,0.011483808,0.9467681,0.0009409028,0.019016014],"study_design_scores_gemma":[0.000044859004,0.0001960587,0.005161098,0.00014675409,0.000047610152,0.0018528533,0.00090923865,0.025014339,0.014248517,0.9456418,0.0066658366,0.000071075294],"about_ca_topic_score_codex":0.00023989835,"about_ca_topic_score_gemma":0.00027869153,"teacher_disagreement_score":0.0040003485,"about_ca_system_score_codex":0.00093888683,"about_ca_system_score_gemma":0.00032708966,"threshold_uncertainty_score":0.013382435},"labels":[],"label_agreement":null},{"id":"W156247037","doi":"","title":"Notes on factor-critically, extendability and independence number.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Independence (probability theory); Factor (programming language); Independence number; Discrete mathematics; Statistics; Computer science; Programming language","score_opus":0.02805785495427411,"score_gpt":0.3083864145964977,"score_spread":0.2803285596422236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W156247037","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048382398,0.010599115,0.09194366,0.012065889,0.0017879754,0.000049722283,0.00085002603,0.00026242103,0.83405876],"genre_scores_gemma":[0.85382676,0.011678276,0.02858523,0.0028421653,0.0042546173,0.00016728052,0.0010184802,0.0002565033,0.097370714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992132,0.00015011756,0.0000475994,0.00019659456,0.00027114555,0.00012126646],"domain_scores_gemma":[0.9952709,0.0033087253,0.00021642356,0.0004890492,0.0004386167,0.00027624087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012480137,0.00073323044,0.00067177,0.0021252087,0.0013471069,0.0019436964,0.0008332208,0.000977613,0.019256683],"category_scores_gemma":[0.0058606975,0.00042869058,0.00076117786,0.0026057158,0.0057030157,0.007568701,0.0022511992,0.005765454,0.0019132192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022973967,0.000012852223,0.00018079836,0.000051209983,0.0000069417233,0.00005543629,0.00012286066,0.00025362184,0.00026501383,0.9857927,0.0055759037,0.007659691],"study_design_scores_gemma":[0.0000071053396,0.000009315029,0.0003924071,0.0000134411985,0.0000075046128,0.0000931698,0.000041543084,0.00028332582,0.00019043723,0.9866432,0.0123127075,0.0000058912983],"about_ca_topic_score_codex":0.0016241983,"about_ca_topic_score_gemma":0.0018255006,"teacher_disagreement_score":0.019256683,"about_ca_system_score_codex":0.0014313421,"about_ca_system_score_gemma":0.0005407293,"threshold_uncertainty_score":0.064420044},"labels":[],"label_agreement":null},{"id":"W156263185","doi":"","title":"Double Circulant Self-Dual Codes over GF(5).","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Circulant matrix; Mathematics; Dual (grammatical number); Arithmetic; Discrete mathematics; Linguistics","score_opus":0.009382806470143452,"score_gpt":0.22474303220213468,"score_spread":0.21536022573199123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W156263185","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46082288,0.0042708856,0.31124765,0.0027188312,0.0016450507,0.0002852844,0.0013944511,0.0012317165,0.2163833],"genre_scores_gemma":[0.9362323,0.0009372242,0.034609042,0.0005577924,0.0003480917,0.000117900665,0.0006405006,0.00009671773,0.026460424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929047,0.00013279743,0.000034762677,0.00009916896,0.00024725692,0.00019541116],"domain_scores_gemma":[0.9986418,0.00041634042,0.00023200829,0.00030066798,0.00023164482,0.00017755388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000486023,0.00047791487,0.00048702725,0.0016839019,0.0010248233,0.0017363516,0.00048288426,0.00075649086,0.006688845],"category_scores_gemma":[0.002552302,0.00022277141,0.00032283945,0.0011585447,0.00097249576,0.0014938327,0.0013386868,0.0011371684,0.0017065794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003756514,0.00013789821,0.00070942397,0.00019898098,0.000027688375,0.00055754854,0.0001825005,0.006020473,0.016238444,0.91528606,0.008405241,0.051859967],"study_design_scores_gemma":[0.0001864103,0.00026128878,0.0013451359,0.00032467497,0.000057496025,0.0020050097,0.00023449688,0.060650405,0.037954748,0.820608,0.07626793,0.00010445437],"about_ca_topic_score_codex":0.0006407947,"about_ca_topic_score_gemma":0.001154031,"teacher_disagreement_score":0.006688845,"about_ca_system_score_codex":0.0008115202,"about_ca_system_score_gemma":0.0011599936,"threshold_uncertainty_score":0.022376359},"labels":[],"label_agreement":null},{"id":"W156285056","doi":"","title":"K-Dominating Sets of Cardinal Products of Paths.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Regular cardinal; Combinatorics","score_opus":0.015076404813184943,"score_gpt":0.2741882838147326,"score_spread":0.25911187900154764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W156285056","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84237665,0.0016353575,0.10653057,0.00036356132,0.00010887114,0.000110897585,0.0022146695,0.00024248657,0.046416886],"genre_scores_gemma":[0.9424231,0.0006931574,0.04536219,0.00008702258,0.00006569178,0.00011116259,0.0012417539,0.00006614396,0.009949647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992244,0.00012773972,0.000057251727,0.00025167517,0.00020032197,0.00013845917],"domain_scores_gemma":[0.9955519,0.00289653,0.0005482186,0.00028142176,0.00031154233,0.0004104852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071345596,0.0004970322,0.00041067784,0.0014573288,0.0013852636,0.002651159,0.00066236884,0.0003431174,0.0048292107],"category_scores_gemma":[0.0043844134,0.00044338222,0.0004965393,0.001130564,0.0011008501,0.003458552,0.001096658,0.00076409464,0.0006386565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013837133,0.00018030603,0.026210403,0.00107554,0.00017950856,0.0008814024,0.0022974312,0.0366725,0.034938548,0.7921405,0.0064825634,0.09755751],"study_design_scores_gemma":[0.00010094028,0.0002737871,0.014396904,0.00023979179,0.00014051977,0.003810653,0.0010741119,0.06763492,0.025119742,0.8354123,0.05169678,0.00009963184],"about_ca_topic_score_codex":0.00061147404,"about_ca_topic_score_gemma":0.0010405757,"teacher_disagreement_score":0.0048292107,"about_ca_system_score_codex":0.0012101948,"about_ca_system_score_gemma":0.00046672637,"threshold_uncertainty_score":0.016155303},"labels":[],"label_agreement":null},{"id":"W156526445","doi":"","title":"Transformation of Spanning Trees in a 2-Connected Graph.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Spanning tree; Mathematics; Transformation (genetics); Connected dominating set; Graph; Combinatorics; Chemistry","score_opus":0.01830503032991665,"score_gpt":0.27788232892317394,"score_spread":0.2595772985932573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W156526445","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5028528,0.0003929052,0.3566652,0.0005673834,0.00045374117,0.00022754198,0.00060991006,0.0017597098,0.13647084],"genre_scores_gemma":[0.9004378,0.00027109918,0.07113828,0.0001821873,0.00006749042,0.00009046077,0.0005866869,0.00052462664,0.02670143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99982077,0.000044501692,0.0000072462412,0.000041593587,0.000050673465,0.000035189303],"domain_scores_gemma":[0.9997651,0.000081036036,0.000032120737,0.000059108497,0.000029019528,0.00003358362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010596557,0.0002546381,0.00017805846,0.0006945636,0.0005072213,0.0006037727,0.00034598302,0.00048537183,0.008549927],"category_scores_gemma":[0.000793894,0.00017874756,0.00039517623,0.00055672927,0.00039317994,0.00088424736,0.00075605983,0.00056965946,0.0016597245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019016425,0.0002379607,0.0009594134,0.00016052424,0.000038674243,0.0012017111,0.001130047,0.019453533,0.058246292,0.7796761,0.011037748,0.127668],"study_design_scores_gemma":[0.000061996594,0.00009946315,0.0014288832,0.000035837886,0.000026908876,0.0010396963,0.00046404268,0.06250944,0.020960687,0.87888855,0.034460038,0.000024525169],"about_ca_topic_score_codex":0.0005118162,"about_ca_topic_score_gemma":0.00085505174,"teacher_disagreement_score":0.008549927,"about_ca_system_score_codex":0.00023450938,"about_ca_system_score_gemma":0.00018345576,"threshold_uncertainty_score":0.028602362},"labels":[],"label_agreement":null},{"id":"W156637814","doi":"","title":"Double Orderings of (0, 1)-Matrices.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.007482849627625452,"score_gpt":0.19869061385869172,"score_spread":0.19120776423106625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W156637814","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20902307,0.0021686782,0.45478743,0.0017642439,0.0016451047,0.00017914329,0.001640088,0.0011461547,0.32764605],"genre_scores_gemma":[0.8339622,0.0009943326,0.08693778,0.0007553828,0.0004800269,0.00016861605,0.0010737403,0.00026551526,0.07536247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910706,0.00019354842,0.00006309539,0.00016027116,0.00025002877,0.00022597566],"domain_scores_gemma":[0.9979729,0.00055470085,0.00033519085,0.0003256238,0.00042864736,0.0003829504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000405637,0.00069963076,0.0003663773,0.0025906,0.0013671402,0.002374546,0.0004669326,0.0006739284,0.01611638],"category_scores_gemma":[0.0026481282,0.00030009175,0.00031848953,0.0011866117,0.0011048707,0.0025043434,0.0011084498,0.0012122702,0.0030742516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008032127,0.000026412707,0.00025916676,0.00004794364,0.0000061520614,0.00019003877,0.00015412369,0.0007231176,0.004595076,0.9690842,0.0043352935,0.020498151],"study_design_scores_gemma":[0.000022141034,0.000047992813,0.00034637278,0.000046106106,0.000009111627,0.00043836888,0.00017523312,0.0064530913,0.004891643,0.9555478,0.031995904,0.00002622231],"about_ca_topic_score_codex":0.00073161005,"about_ca_topic_score_gemma":0.001889937,"teacher_disagreement_score":0.01611638,"about_ca_system_score_codex":0.00076488836,"about_ca_system_score_gemma":0.0005907659,"threshold_uncertainty_score":0.053914666},"labels":[],"label_agreement":null},{"id":"W1567844118","doi":"","title":"Copnumber of graphs with strong isometric dimension two","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Isometric exercise; Mathematics; Dimension (graph theory); Pure mathematics; Medicine; Physical therapy","score_opus":0.023717553742848507,"score_gpt":0.2910267428076806,"score_spread":0.2673091890648321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567844118","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7591701,0.0006690339,0.08658362,0.0034715217,0.0007562344,0.00012880264,0.0013381629,0.0007730628,0.14710951],"genre_scores_gemma":[0.95580876,0.00040772045,0.02028056,0.0005832856,0.0005063866,0.00020757463,0.0010497158,0.00027943836,0.02087656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874973,0.00026096974,0.00006154302,0.0002879013,0.0003528446,0.00028697064],"domain_scores_gemma":[0.9953216,0.001989874,0.000768285,0.00050590525,0.00042693733,0.0009874859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008696085,0.0008923545,0.0013961324,0.004036586,0.00349611,0.004633242,0.0020731122,0.0015913047,0.012584487],"category_scores_gemma":[0.0051395968,0.0007915756,0.0010908024,0.0028564676,0.0032437164,0.0050701993,0.0031228275,0.0027785986,0.0010883056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012017315,0.000039606268,0.00067106576,0.00006366323,0.000011641301,0.0001245084,0.00021739825,0.00075301976,0.001220755,0.9859859,0.0042782137,0.006514128],"study_design_scores_gemma":[0.000031416614,0.000024150264,0.00094281253,0.000022032516,0.00002255767,0.0002923011,0.00014420155,0.006530267,0.0011145461,0.985995,0.004857321,0.000023415765],"about_ca_topic_score_codex":0.0009947887,"about_ca_topic_score_gemma":0.001195844,"teacher_disagreement_score":0.012584487,"about_ca_system_score_codex":0.0017401262,"about_ca_system_score_gemma":0.0008986994,"threshold_uncertainty_score":0.042099297},"labels":[],"label_agreement":null},{"id":"W1568046019","doi":"","title":"Sums of powers of binomial coefficients via Legendre polynomials, Part 2.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Binomial coefficient; Legendre polynomials; Gaussian binomial coefficient; Associated Legendre polynomials; Binomial (polynomial); Sums of powers; Legendre function; Pure mathematics; Negative binomial distribution; Statistics; Discrete mathematics; Orthogonal polynomials; Classical orthogonal polynomials; Mathematical analysis; Gegenbauer polynomials; Poisson distribution","score_opus":0.008457947039591563,"score_gpt":0.24988956819442282,"score_spread":0.24143162115483124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568046019","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15261105,0.015189769,0.40038058,0.0027011307,0.004143006,0.000152896,0.0007752915,0.00078572385,0.4232606],"genre_scores_gemma":[0.82413274,0.0067670573,0.051328305,0.0013823793,0.0035181402,0.00019773307,0.000686619,0.0007319931,0.1112551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985777,0.00039885886,0.00008336619,0.00018327475,0.0005260626,0.00023083563],"domain_scores_gemma":[0.9982815,0.0007676995,0.0002134624,0.000250954,0.00030149624,0.00018493566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013345903,0.0013604752,0.0010032754,0.0027045168,0.0014856941,0.0043479665,0.001371573,0.0009435604,0.01395079],"category_scores_gemma":[0.005302199,0.0007141111,0.0012826596,0.0018930824,0.0030344375,0.005836706,0.002363686,0.0026410122,0.004359724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003655284,0.000023368799,0.00019140578,0.00010641557,0.000019430645,0.00015602878,0.0002331892,0.0010302615,0.0013405056,0.9766436,0.005808861,0.0144103905],"study_design_scores_gemma":[0.000007704586,0.000020054242,0.00026541686,0.000037589623,0.000016915268,0.0003635911,0.000045842276,0.004088653,0.0007178935,0.98452395,0.009890022,0.000022337012],"about_ca_topic_score_codex":0.00063473434,"about_ca_topic_score_gemma":0.0010168208,"teacher_disagreement_score":0.01395079,"about_ca_system_score_codex":0.0008275826,"about_ca_system_score_gemma":0.0006526485,"threshold_uncertainty_score":0.04667008},"labels":[],"label_agreement":null},{"id":"W157437755","doi":"","title":"Realizability of Connected, Separable, p-Point, q-Line Graphs with Prescribed Minimum Degree and Line Connectivity.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Realizability; Mathematics; Degree (music); Line (geometry); Separable space; Point (geometry); Combinatorics; Discrete mathematics; Algorithm; Mathematical analysis; Geometry; Physics","score_opus":0.027018049765787637,"score_gpt":0.23695281671421112,"score_spread":0.20993476694842347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W157437755","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7400024,0.00020198004,0.22710031,0.0005588364,0.000027439031,0.000071087044,0.00096891174,0.00041538183,0.030653642],"genre_scores_gemma":[0.9830993,0.00009401019,0.013707511,0.00004065181,0.000015326792,0.00004733594,0.00052496715,0.00003526761,0.002435659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963284,0.00011024141,0.000028490504,0.00009185146,0.00007793927,0.000058642763],"domain_scores_gemma":[0.9985266,0.0006926749,0.00034184317,0.00018052754,0.000112636895,0.00014574504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000365578,0.00036508677,0.00033396768,0.0004867203,0.0006631662,0.0015406338,0.00073941547,0.00081309886,0.0047418205],"category_scores_gemma":[0.0022207692,0.00036010944,0.00059580815,0.00054321537,0.0011301958,0.0023033668,0.00088717026,0.0008551442,0.0004108942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045657638,0.00012057865,0.0024297037,0.00019607322,0.000053211406,0.0007179143,0.0005276122,0.055570696,0.013379126,0.90808254,0.0023378436,0.016128113],"study_design_scores_gemma":[0.00015203976,0.00010901736,0.0011198298,0.000034377194,0.000035371733,0.00033903265,0.00025052324,0.12673129,0.0060408646,0.862387,0.0027763792,0.000024334504],"about_ca_topic_score_codex":0.0011806925,"about_ca_topic_score_gemma":0.0015440175,"teacher_disagreement_score":0.0047418205,"about_ca_system_score_codex":0.0006586309,"about_ca_system_score_gemma":0.00033142773,"threshold_uncertainty_score":0.015862942},"labels":[],"label_agreement":null},{"id":"W157439906","doi":"","title":"De Bruijn sequences: Generation, reproduction and applications.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Computational Techniques and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"De Bruijn sequence; Mathematics; Reproduction; Combinatorics; Biology; Ecology","score_opus":0.02530545731176501,"score_gpt":0.26632553359800804,"score_spread":0.24102007628624303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W157439906","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02980528,0.0186524,0.8350302,0.0018325691,0.0012259261,0.00018854912,0.00079436373,0.0018527488,0.110618025],"genre_scores_gemma":[0.42428344,0.016269097,0.47024244,0.00072396867,0.0016296654,0.0003746888,0.0017020544,0.00083946687,0.08393514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991184,0.00028500255,0.00008005235,0.0001821996,0.0002676575,0.00006669172],"domain_scores_gemma":[0.99745315,0.0016303957,0.000197986,0.00032878757,0.00026059215,0.00012900075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009375447,0.000797339,0.00077158393,0.0019805771,0.0011000382,0.002497627,0.0010053066,0.0009488703,0.0105988635],"category_scores_gemma":[0.007419922,0.00064381905,0.00066449103,0.0023602445,0.0016477039,0.0029860896,0.0014677884,0.001656466,0.004579045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007920537,0.000054103904,0.00034428778,0.00027417854,0.000020370877,0.00019296556,0.00028404852,0.008287486,0.0028105844,0.8238775,0.010054207,0.15372106],"study_design_scores_gemma":[0.000029701223,0.000051963176,0.00020438666,0.00011496629,0.000018968596,0.0008528916,0.00008556574,0.032318477,0.004307145,0.909926,0.05205258,0.000037355603],"about_ca_topic_score_codex":0.00048095235,"about_ca_topic_score_gemma":0.00071506033,"teacher_disagreement_score":0.0105988635,"about_ca_system_score_codex":0.00075316365,"about_ca_system_score_gemma":0.0005990538,"threshold_uncertainty_score":0.035456717},"labels":[],"label_agreement":null},{"id":"W157493903","doi":"","title":"Wide Diameters and Diameter of Networks.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Geometry","score_opus":0.013075799793172263,"score_gpt":0.21234871856420115,"score_spread":0.19927291877102887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W157493903","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32108974,0.021235315,0.4196545,0.01184827,0.0013371772,0.00010526834,0.0022718888,0.00092758983,0.22153021],"genre_scores_gemma":[0.9226579,0.0077772075,0.039222155,0.0010612203,0.0020269882,0.00020559505,0.0009173115,0.00031123133,0.025820497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985513,0.00048414874,0.000091292284,0.00035594267,0.0003068927,0.00021042861],"domain_scores_gemma":[0.9843106,0.010698389,0.001359861,0.0010231456,0.0010656537,0.0015423071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021208832,0.00072816975,0.0011429214,0.0026600056,0.0015678321,0.0044497587,0.0014409916,0.0013537904,0.008818175],"category_scores_gemma":[0.017774237,0.000691707,0.00063914084,0.0015420839,0.0037111316,0.009657918,0.0030489913,0.0025958822,0.0017416427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006872396,0.000012012568,0.00095419,0.00008313142,0.000018792529,0.00005746243,0.00018416689,0.0030998287,0.00070869527,0.9778252,0.005988242,0.010999468],"study_design_scores_gemma":[0.000015473026,0.000021260787,0.0007895406,0.00003614313,0.000016607575,0.00025852374,0.000116427145,0.008981717,0.000499659,0.97922647,0.010026994,0.000011199672],"about_ca_topic_score_codex":0.0005409084,"about_ca_topic_score_gemma":0.0005787114,"teacher_disagreement_score":0.008818175,"about_ca_system_score_codex":0.0016044604,"about_ca_system_score_gemma":0.00041726566,"threshold_uncertainty_score":0.02949977},"labels":[],"label_agreement":null},{"id":"W1575036539","doi":"","title":"The Graphs C(t)11 are Graceful for t = 0, 1 (mod 4).","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mod; Mathematics; Combinatorics; Discrete mathematics","score_opus":0.007011103592310649,"score_gpt":0.19993837308537743,"score_spread":0.1929272694930668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575036539","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42364308,0.0008723087,0.1154402,0.0029225831,0.0013690002,0.00044188622,0.0033603678,0.002710092,0.44924048],"genre_scores_gemma":[0.88874584,0.00068137684,0.026633522,0.0010150447,0.00030757685,0.00027492686,0.0017976072,0.00062433677,0.079919755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99908435,0.00010808734,0.000035337423,0.00019156994,0.00021503054,0.00036566905],"domain_scores_gemma":[0.9974445,0.0005002618,0.00061253086,0.0006927123,0.00038490182,0.00036514096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039053592,0.00080625876,0.00037279387,0.0025441514,0.0033845487,0.002962078,0.00094679557,0.0011303525,0.021917716],"category_scores_gemma":[0.0028732438,0.0005108314,0.00087116146,0.0015140993,0.0029047623,0.0020928672,0.0015693099,0.0022622277,0.0033299588],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037743806,0.00008614257,0.0011531599,0.00019968995,0.000036836027,0.0007528089,0.0005732573,0.0026976096,0.01681878,0.9230406,0.017606677,0.036656875],"study_design_scores_gemma":[0.0000438833,0.00007929781,0.0038946047,0.00006739257,0.00004761248,0.0010083125,0.00039686152,0.0048948782,0.016659016,0.90132487,0.0714564,0.00012696952],"about_ca_topic_score_codex":0.0035722416,"about_ca_topic_score_gemma":0.0063245897,"teacher_disagreement_score":0.021917716,"about_ca_system_score_codex":0.0016094897,"about_ca_system_score_gemma":0.001815325,"threshold_uncertainty_score":0.07332212},"labels":[],"label_agreement":null},{"id":"W157602590","doi":"","title":"The Metric Dimension of Cayley Digraphs of Abelian Groups.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"advanced mathematical theories","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Abelian group; Cayley graph; Dimension (graph theory); Rank of an abelian group; Metric (unit); Elementary abelian group; Pure mathematics; Combinatorics; Algebra over a field; Discrete mathematics; Business","score_opus":0.013815030719886087,"score_gpt":0.2731458502827192,"score_spread":0.2593308195628331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W157602590","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78047144,0.0036297813,0.042830035,0.0037480346,0.0006812824,0.000048789996,0.0015937663,0.0002761545,0.16672067],"genre_scores_gemma":[0.9851857,0.0008503783,0.004216577,0.00028003723,0.00024589023,0.000030912142,0.00042304528,0.00003599803,0.00873149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995895,0.00011670934,0.00002410504,0.000067941764,0.00011577096,0.00008591839],"domain_scores_gemma":[0.9983575,0.0005204938,0.00032828317,0.00014186121,0.00021035265,0.00044161978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044445365,0.00046182284,0.00042116398,0.002893758,0.0012745564,0.0028356276,0.0007554945,0.0007403504,0.006117551],"category_scores_gemma":[0.0025892868,0.00032119575,0.00026940208,0.0014220184,0.0019092887,0.0042779283,0.0014573004,0.0010846272,0.0006882449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022167467,0.000010633937,0.0005977987,0.000025611285,0.000008344143,0.000037238446,0.00013912331,0.00045397392,0.00046673036,0.9926817,0.0017642865,0.0037923674],"study_design_scores_gemma":[0.000010363385,0.000016368593,0.0011498072,0.000016786385,0.000009334944,0.00013927244,0.00013228571,0.003932805,0.00033799064,0.98899776,0.0052428856,0.0000143318075],"about_ca_topic_score_codex":0.0016691611,"about_ca_topic_score_gemma":0.0023051943,"teacher_disagreement_score":0.006117551,"about_ca_system_score_codex":0.0011274306,"about_ca_system_score_gemma":0.00054580026,"threshold_uncertainty_score":0.020465255},"labels":[],"label_agreement":null},{"id":"W157787184","doi":"","title":"Further Ramsey Numbers for Small Complete Bipartite Graphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Ramsey's theorem; Complete bipartite graph; Discrete mathematics; Graph","score_opus":0.03096334432265397,"score_gpt":0.26689878981841536,"score_spread":0.2359354454957614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W157787184","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16425171,0.006571421,0.11404326,0.011073275,0.001201494,0.00012888729,0.0011791667,0.00077857694,0.7007722],"genre_scores_gemma":[0.9009894,0.0020575472,0.02651225,0.0015754211,0.0007095844,0.0002848524,0.0004649452,0.00016092104,0.067244895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934345,0.00020756994,0.000028949278,0.00013192954,0.00019024378,0.00009782643],"domain_scores_gemma":[0.9961636,0.0023255085,0.00033098395,0.00034716006,0.0003445728,0.00048819554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011995318,0.0006106566,0.00051537843,0.0020850443,0.0015533239,0.0027623577,0.0008538113,0.0011091385,0.020446844],"category_scores_gemma":[0.0076044225,0.00034904006,0.0005272419,0.0011421998,0.002627306,0.008359027,0.002039114,0.0031704726,0.0020057992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002064059,0.000012926138,0.00009598615,0.000050164024,0.000003207469,0.000022929691,0.000085966705,0.0003434863,0.00037049834,0.9906625,0.0045126444,0.0038190775],"study_design_scores_gemma":[0.000007020115,0.0000063236585,0.00013808432,0.000018594988,0.0000042141237,0.00007812024,0.000046607038,0.0017438531,0.00025838715,0.9921799,0.0055141677,0.000004896107],"about_ca_topic_score_codex":0.0006390897,"about_ca_topic_score_gemma":0.0011999552,"teacher_disagreement_score":0.020446844,"about_ca_system_score_codex":0.0012100978,"about_ca_system_score_gemma":0.00058693317,"threshold_uncertainty_score":0.068401456},"labels":[],"label_agreement":null},{"id":"W158188782","doi":"","title":"On the lower bounds of partial signed domination number of graphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Domination analysis; Combinatorics; Discrete mathematics; Graph","score_opus":0.01261581860335374,"score_gpt":0.2841050634765157,"score_spread":0.27148924487316195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W158188782","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31225723,0.013294849,0.32540014,0.011130156,0.0015854071,0.00021937495,0.0032915717,0.0016886101,0.33113262],"genre_scores_gemma":[0.9183863,0.00454016,0.047092237,0.0013259002,0.0012065138,0.00040441952,0.0020119161,0.000590781,0.024441846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973794,0.00063148764,0.000117843665,0.00047263954,0.0008323134,0.0005663367],"domain_scores_gemma":[0.9737709,0.019319706,0.0013062238,0.002401472,0.0016301473,0.0015714754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028837658,0.0016397475,0.0015677074,0.0039908355,0.0018936627,0.0050131567,0.0036026,0.0019989384,0.017359512],"category_scores_gemma":[0.030649357,0.00069108297,0.001047647,0.0033329923,0.003035609,0.010618212,0.0036374482,0.0043943576,0.0031433557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007598722,0.00023010086,0.0034286154,0.0007446855,0.00013184542,0.00023138331,0.0005075912,0.03689837,0.0075580613,0.83935475,0.027826663,0.08232802],"study_design_scores_gemma":[0.000047916794,0.00010428846,0.0019139856,0.00017621309,0.00008938744,0.0003715356,0.00013683604,0.09368794,0.0043200077,0.88564044,0.013450739,0.000060783022],"about_ca_topic_score_codex":0.00094288675,"about_ca_topic_score_gemma":0.0016258275,"teacher_disagreement_score":0.017359512,"about_ca_system_score_codex":0.0026180595,"about_ca_system_score_gemma":0.0012935183,"threshold_uncertainty_score":0.0580734},"labels":[],"label_agreement":null},{"id":"W1583095047","doi":"","title":"Factors of r-partite graphs and bounds for the strong chromatic number","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Chromatic scale; Upper and lower bounds; Graph; Discrete mathematics","score_opus":0.017636136053523592,"score_gpt":0.251702014760716,"score_spread":0.23406587870719242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583095047","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5980101,0.0026460923,0.26500773,0.004011076,0.00026636544,0.00015101796,0.001619251,0.0011338624,0.12715451],"genre_scores_gemma":[0.9386572,0.00091551204,0.04460493,0.0003861655,0.0002275684,0.00014677669,0.00062944967,0.00034235153,0.014090024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999255,0.00017099154,0.00003822691,0.00020971354,0.00015037358,0.00017568085],"domain_scores_gemma":[0.9942115,0.0037546074,0.00045469738,0.00071914465,0.00032580408,0.0005343067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011221007,0.00096413144,0.00048188004,0.0015494308,0.001288804,0.0022148022,0.0011775767,0.0009356907,0.014172952],"category_scores_gemma":[0.0056561767,0.0006537511,0.0009189389,0.0013143546,0.0022896847,0.0047034766,0.0019113972,0.00198208,0.0015225238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005988803,0.00016558061,0.009158994,0.00042877704,0.00007140767,0.00023520605,0.0005172883,0.07398571,0.021853568,0.8435847,0.014674486,0.034725405],"study_design_scores_gemma":[0.000077089586,0.00016676029,0.00426086,0.00011986805,0.00008831657,0.00031556582,0.00024553083,0.23713866,0.014116799,0.7269313,0.016455352,0.000084014195],"about_ca_topic_score_codex":0.0022784784,"about_ca_topic_score_gemma":0.0053934595,"teacher_disagreement_score":0.014172952,"about_ca_system_score_codex":0.0018458798,"about_ca_system_score_gemma":0.00065151154,"threshold_uncertainty_score":0.04741323},"labels":[],"label_agreement":null},{"id":"W158518767","doi":"","title":"Upon the existence of a removable circuit in a simple 3-connected Eularian graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Simple (philosophy); Mathematics; Combinatorics; Epistemology","score_opus":0.015599871772160686,"score_gpt":0.19445154388921215,"score_spread":0.17885167211705147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W158518767","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7498301,0.00062344375,0.08766652,0.000860651,0.00021026534,0.00007507773,0.00039394907,0.00023276781,0.16010723],"genre_scores_gemma":[0.9715639,0.0002884298,0.010761361,0.00023477752,0.00004249737,0.00003685003,0.000281421,0.00003785942,0.016752986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997924,0.000045385008,0.000009068703,0.000050106188,0.000049961796,0.000053114058],"domain_scores_gemma":[0.99944013,0.00028531734,0.00008678864,0.000068462716,0.00005580766,0.000063607324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017153556,0.00021819423,0.00020546657,0.0006987549,0.0009308982,0.00088625704,0.0006703208,0.0008899197,0.010723057],"category_scores_gemma":[0.0012362506,0.00019337682,0.00029579434,0.0004206161,0.0012678662,0.0015211281,0.0011876051,0.0010110919,0.00090135273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036242034,0.000064634696,0.0013452232,0.00019228239,0.00003044837,0.001419182,0.00058866356,0.0042772028,0.025888562,0.9398717,0.0030088455,0.022950716],"study_design_scores_gemma":[0.00008121768,0.0001506039,0.00281038,0.00012213677,0.000057711153,0.0016120648,0.00079763663,0.02036214,0.025844228,0.92627114,0.0218344,0.000056361267],"about_ca_topic_score_codex":0.0004977334,"about_ca_topic_score_gemma":0.0008698335,"teacher_disagreement_score":0.010723057,"about_ca_system_score_codex":0.0003748687,"about_ca_system_score_gemma":0.00021883007,"threshold_uncertainty_score":0.03587216},"labels":[],"label_agreement":null},{"id":"W15859830","doi":"10.1089/jpm.1998.1.213","title":"Some properties of two-color partitions.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Color Science and Applications","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.023534762239376117,"score_gpt":0.24124152345011643,"score_spread":0.2177067612107403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W15859830","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2343832,0.0030265006,0.13475788,0.0033364627,0.0010928176,0.00018134559,0.002375898,0.0007947158,0.62005115],"genre_scores_gemma":[0.8993738,0.0015937166,0.03364665,0.0011446954,0.0008661186,0.00023895013,0.0018844402,0.00057183835,0.060679827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902105,0.00023365612,0.0000617313,0.00018400371,0.00028624758,0.00021325354],"domain_scores_gemma":[0.9972344,0.0011794553,0.00032588592,0.0004924101,0.0004019521,0.000365984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010408068,0.00066187215,0.00068371574,0.0023754258,0.0028132228,0.005529931,0.0011660308,0.0010171866,0.019198796],"category_scores_gemma":[0.0042237705,0.0005953109,0.00097647076,0.003007191,0.0030379177,0.005801322,0.002219205,0.002150946,0.0033652848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033473756,0.000015549918,0.00019725284,0.00003873574,0.0000052792825,0.0000565766,0.00014861037,0.0002728186,0.00046606484,0.9907257,0.003451735,0.0045882105],"study_design_scores_gemma":[0.00001800381,0.000010854648,0.00032361475,0.000021310108,0.0000089139185,0.00024552582,0.00011325644,0.0014372636,0.00050560443,0.98278606,0.014516685,0.000012808431],"about_ca_topic_score_codex":0.001128022,"about_ca_topic_score_gemma":0.0011528032,"teacher_disagreement_score":0.019198796,"about_ca_system_score_codex":0.0016583747,"about_ca_system_score_gemma":0.0006601234,"threshold_uncertainty_score":0.06422639},"labels":[],"label_agreement":null},{"id":"W158624546","doi":"","title":"Note on transformation of posets with the same semi bound graphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Transformation (genetics); Star product; Combinatorics; Chemistry","score_opus":0.007142248163686592,"score_gpt":0.2307854759495268,"score_spread":0.22364322778584023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W158624546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02187627,0.0016392806,0.6996716,0.006405899,0.009009202,0.00035274465,0.0009318754,0.003676967,0.25643608],"genre_scores_gemma":[0.4281255,0.004652708,0.40968013,0.006670931,0.003528468,0.0007587051,0.0026579387,0.0033144678,0.14061113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879587,0.00027873745,0.00008702865,0.00025481146,0.00045440864,0.0001291872],"domain_scores_gemma":[0.9984456,0.0006365657,0.00006357178,0.0005146371,0.00020500059,0.00013470692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012330395,0.000908794,0.0007652985,0.0014253658,0.0014084338,0.001846525,0.0013270318,0.0009067571,0.026318977],"category_scores_gemma":[0.0031470382,0.0003550649,0.0025621282,0.0012499576,0.0026767422,0.0038647898,0.0036329266,0.003655179,0.0055481307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002091926,0.00022880176,0.00037529605,0.00031726563,0.000073417694,0.0013368282,0.00083077035,0.002767603,0.010969453,0.87487775,0.032366116,0.07564746],"study_design_scores_gemma":[0.000028115677,0.00009610029,0.0006080692,0.000045546378,0.000043346125,0.001145882,0.00022840028,0.0040959306,0.0076878546,0.884084,0.10187567,0.000061008614],"about_ca_topic_score_codex":0.0020944623,"about_ca_topic_score_gemma":0.0023613416,"teacher_disagreement_score":0.026318977,"about_ca_system_score_codex":0.00058418256,"about_ca_system_score_gemma":0.0005418654,"threshold_uncertainty_score":0.08804572},"labels":[],"label_agreement":null},{"id":"W1587274897","doi":"","title":"An Upper Bound of 62 on the Classical Ramsey Number R(3, 3, 3, 3).","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Ramsey's theorem; Combinatorics","score_opus":0.021281415312157676,"score_gpt":0.2925127670443617,"score_spread":0.27123135173220403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1587274897","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17152454,0.014487574,0.07278604,0.01779456,0.0022464579,0.000106160944,0.0021720405,0.0017553173,0.7171274],"genre_scores_gemma":[0.9111405,0.0047948654,0.029477239,0.0032469358,0.0017545389,0.00026424197,0.0012660401,0.00045934453,0.047596324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975184,0.0004913854,0.000094010524,0.0005729147,0.0007074803,0.00061570737],"domain_scores_gemma":[0.9915479,0.0058232713,0.00030837097,0.00085136574,0.00046992718,0.0009991569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027585155,0.0013386626,0.0013632838,0.002288891,0.0032509225,0.004410781,0.002177332,0.0021812504,0.02889613],"category_scores_gemma":[0.011755409,0.0008324078,0.0009118654,0.0020133427,0.0037509901,0.010767798,0.0051567233,0.0045657824,0.0070673777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063725346,0.00016409517,0.0010036242,0.00050302455,0.00006245141,0.00024946732,0.0005332677,0.0042345766,0.00474584,0.9105495,0.040329084,0.036987796],"study_design_scores_gemma":[0.00004974663,0.000062102394,0.0012097023,0.00013091964,0.00005400363,0.00030287067,0.00011986442,0.006283786,0.0027500158,0.95488095,0.034083396,0.00007258374],"about_ca_topic_score_codex":0.0015927644,"about_ca_topic_score_gemma":0.0028544948,"teacher_disagreement_score":0.02889613,"about_ca_system_score_codex":0.0022123957,"about_ca_system_score_gemma":0.0013853684,"threshold_uncertainty_score":0.09666717},"labels":[],"label_agreement":null},{"id":"W158781227","doi":"","title":"On Irregularity of Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.0218766658137197,"score_gpt":0.2728580865804129,"score_spread":0.25098142076669316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W158781227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3141603,0.016059304,0.32516187,0.018715912,0.0026504584,0.00014048858,0.0013830794,0.00080002693,0.3209286],"genre_scores_gemma":[0.9027511,0.008229123,0.040917166,0.0018992132,0.003244337,0.00016740503,0.0013009113,0.000488558,0.041002143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866474,0.0003953032,0.00008686218,0.00029761405,0.0003582411,0.00019716445],"domain_scores_gemma":[0.98998904,0.0060810414,0.00093152147,0.0015063623,0.00076531025,0.0007267188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014449216,0.0006432591,0.0011574241,0.004008225,0.002269217,0.0031790729,0.0012278132,0.0015335601,0.008722113],"category_scores_gemma":[0.012270986,0.0006102328,0.0009914312,0.0026826921,0.005137705,0.009235329,0.0034539143,0.0046398044,0.0014156643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003169608,0.000019204872,0.0007562837,0.000073747906,0.000012357913,0.00009526228,0.00026018397,0.0015759367,0.00029642842,0.9828551,0.0046062293,0.009417652],"study_design_scores_gemma":[0.000004617192,0.000007575853,0.0002919521,0.000021393806,0.0000058661367,0.00011522986,0.00008952313,0.0030926524,0.00010375283,0.99200696,0.004255251,0.0000053121566],"about_ca_topic_score_codex":0.001198795,"about_ca_topic_score_gemma":0.0014439181,"teacher_disagreement_score":0.008722113,"about_ca_system_score_codex":0.0016389365,"about_ca_system_score_gemma":0.0003887791,"threshold_uncertainty_score":0.02917844},"labels":[],"label_agreement":null},{"id":"W158822179","doi":"","title":"The non planar vertex deletion of Cn x Cm.","year":2005,"lang":"it","type":"article","venue":"Ars Combinatoria","topic":"Electron and X-Ray Spectroscopy Techniques","field":"Materials Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Planar; Combinatorics; Computer science; Graph; Computer graphics (images)","score_opus":0.008006357348668508,"score_gpt":0.2561350862975551,"score_spread":0.2481287289488866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W158822179","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50657153,0.0009475999,0.080135405,0.0018132199,0.0015381072,0.00011098567,0.0010183991,0.00063108956,0.40723374],"genre_scores_gemma":[0.8796284,0.0004630585,0.02560855,0.0005512214,0.000089615736,0.00008180471,0.0009539642,0.0002989511,0.09232445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975914,0.00003629191,0.000007590153,0.000053858417,0.0000916812,0.000051475992],"domain_scores_gemma":[0.9997265,0.00006125652,0.000056858964,0.00006789323,0.00003930588,0.000048217582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014885934,0.00044254572,0.00021630633,0.00063736225,0.0010599076,0.0008885649,0.00082530826,0.0005102426,0.014798735],"category_scores_gemma":[0.00088167505,0.00016408827,0.00022617263,0.0005484936,0.00081048196,0.0010996101,0.0010257028,0.0010043078,0.0016249965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019706495,0.00002533021,0.00060606084,0.00015385712,0.000009660705,0.0006773275,0.00013154148,0.0022185596,0.021686742,0.92888623,0.0088088075,0.036598794],"study_design_scores_gemma":[0.000051947885,0.00013843314,0.0035051387,0.000057640198,0.000032301596,0.0024431269,0.00041507077,0.00981696,0.04176564,0.83771205,0.104007736,0.00005400958],"about_ca_topic_score_codex":0.0012065708,"about_ca_topic_score_gemma":0.0019171962,"teacher_disagreement_score":0.014798735,"about_ca_system_score_codex":0.0004570917,"about_ca_system_score_gemma":0.0005527012,"threshold_uncertainty_score":0.049506664},"labels":[],"label_agreement":null},{"id":"W159195102","doi":"","title":"Toughness of Generalized Petersen Graphs.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01855483965152638,"score_gpt":0.27677174546538014,"score_spread":0.25821690581385376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W159195102","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7481446,0.000983671,0.08024366,0.0025043457,0.00037915257,0.000092068105,0.0009887867,0.00035868204,0.16630502],"genre_scores_gemma":[0.9784878,0.0004219565,0.0058687595,0.00024391663,0.00017789978,0.000052337466,0.00041559775,0.00006970883,0.014262065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922204,0.00013562162,0.000034734512,0.00017287988,0.00025416812,0.00018044922],"domain_scores_gemma":[0.9971283,0.0013533623,0.0004930889,0.0002703144,0.00023377169,0.0005211913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005606568,0.00049351,0.0005264259,0.0025614386,0.0021017562,0.0026389994,0.00089121383,0.0008796033,0.015513322],"category_scores_gemma":[0.0042214687,0.00054146297,0.00068238,0.0012790449,0.0029412028,0.004859349,0.0025659145,0.001783814,0.0009824408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000613086,0.000018318533,0.0007024322,0.00006486295,0.000016702375,0.00014325487,0.0003640382,0.0018086107,0.0010933047,0.9882708,0.0026288931,0.0048275567],"study_design_scores_gemma":[0.000012854628,0.00001435277,0.0009135748,0.000020663023,0.000012327716,0.00019621082,0.00022682996,0.004787347,0.00055687147,0.9897305,0.0035143557,0.00001418116],"about_ca_topic_score_codex":0.0013814956,"about_ca_topic_score_gemma":0.001441575,"teacher_disagreement_score":0.015513322,"about_ca_system_score_codex":0.0007949432,"about_ca_system_score_gemma":0.0003563812,"threshold_uncertainty_score":0.051897287},"labels":[],"label_agreement":null},{"id":"W159253485","doi":"","title":"Graph Orientations and Signings That Are Saturated with Alternating Cycles.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.01678179386426939,"score_gpt":0.2690823586310942,"score_spread":0.25230056476682483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W159253485","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64628845,0.000814162,0.13993117,0.0017796835,0.00027769437,0.00012573476,0.00085469184,0.0017706443,0.20815781],"genre_scores_gemma":[0.9573314,0.0003324127,0.016885063,0.00019173531,0.00012626123,0.000047863297,0.00062858686,0.00024705572,0.024209658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902177,0.00020432193,0.00006473376,0.00022829938,0.00017025237,0.00031048417],"domain_scores_gemma":[0.9963959,0.0014238063,0.0006215453,0.00075522583,0.00034036112,0.0004632378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053552905,0.0005042107,0.00046110674,0.001146789,0.0019312083,0.0029378948,0.00061219215,0.001247659,0.014465054],"category_scores_gemma":[0.004431665,0.0008401037,0.0006419561,0.0013479205,0.0027066795,0.00725562,0.0025298598,0.0020149432,0.0021698156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029278727,0.0000865565,0.0017025515,0.00009330756,0.000020053918,0.00077708677,0.000757986,0.0021002984,0.00808859,0.9597559,0.0042585246,0.022066383],"study_design_scores_gemma":[0.000038700182,0.000046661302,0.0009917783,0.000045125133,0.000036742458,0.00071196386,0.0006581469,0.007320178,0.0060357703,0.96898735,0.015089427,0.000038059447],"about_ca_topic_score_codex":0.0011526176,"about_ca_topic_score_gemma":0.0018453872,"teacher_disagreement_score":0.014465054,"about_ca_system_score_codex":0.00081409543,"about_ca_system_score_gemma":0.0005713715,"threshold_uncertainty_score":0.048390448},"labels":[],"label_agreement":null},{"id":"W159710950","doi":"","title":"Self-complementary Graphs with Minimum Degree Two","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Combinatorics; Discrete mathematics","score_opus":0.03104552313222821,"score_gpt":0.27496098841493855,"score_spread":0.24391546528271033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W159710950","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.803011,0.00036641603,0.08840482,0.0015368,0.00022614164,0.00013665877,0.0013842661,0.00054118247,0.10439278],"genre_scores_gemma":[0.9157847,0.00035188903,0.057211082,0.00047202787,0.000111449954,0.00015740767,0.001337816,0.00016786638,0.024405684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960536,0.000086047345,0.000020174108,0.00009139553,0.00010686321,0.00009015732],"domain_scores_gemma":[0.99750525,0.0010999928,0.00027622515,0.0003234099,0.0003397974,0.00045530885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035798195,0.00045123755,0.0007061316,0.0014926199,0.0017407036,0.001467314,0.0008703446,0.0010641833,0.009503516],"category_scores_gemma":[0.0022982813,0.0005962882,0.00052942574,0.0010823915,0.0008908648,0.0022426546,0.0014984295,0.0012309256,0.0011761603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045196252,0.00022291172,0.0023833336,0.00031929335,0.0000672613,0.00064455497,0.00070410734,0.003291261,0.037363596,0.91271913,0.009285876,0.03254673],"study_design_scores_gemma":[0.00020283075,0.00015086995,0.0030656701,0.0000835873,0.0000851342,0.0015225245,0.0006813373,0.018005483,0.02366451,0.932708,0.019781915,0.000048148373],"about_ca_topic_score_codex":0.00040135588,"about_ca_topic_score_gemma":0.0009875082,"teacher_disagreement_score":0.009503516,"about_ca_system_score_codex":0.00053943926,"about_ca_system_score_gemma":0.00068748085,"threshold_uncertainty_score":0.031792402},"labels":[],"label_agreement":null},{"id":"W159748213","doi":"","title":"On Disconnected Graph with Large Reconstruction Number.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Graph; Vertex (graph theory); Totally disconnected space; Connectivity; Connected component; Discrete mathematics","score_opus":0.013110134706882505,"score_gpt":0.2500286008500767,"score_spread":0.23691846614319423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W159748213","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6932952,0.003484561,0.25286713,0.0037316047,0.00017134394,0.00012449177,0.0006812696,0.0007947284,0.044849742],"genre_scores_gemma":[0.93997115,0.0011613454,0.050166555,0.0003270169,0.0001565714,0.000125257,0.0011511433,0.00014901612,0.006791999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900705,0.0003694678,0.000033515105,0.000232554,0.00023557502,0.0001219652],"domain_scores_gemma":[0.99287766,0.004707154,0.00090508244,0.0006303303,0.0003484065,0.0005312927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009656147,0.0006376289,0.0007451256,0.0017833675,0.0013266406,0.0011041278,0.00087091327,0.0012186778,0.003598906],"category_scores_gemma":[0.007963946,0.00042207332,0.0005637546,0.0011000774,0.0020471662,0.003072386,0.0015359648,0.0012518348,0.0006043545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009431989,0.000121472796,0.006521788,0.00063490786,0.000105944615,0.0018411386,0.0010618494,0.09106352,0.018448811,0.8026567,0.010316621,0.06628387],"study_design_scores_gemma":[0.00009031591,0.00025962346,0.0035158878,0.0000818708,0.00008480293,0.0025519393,0.00039939684,0.20114946,0.009884654,0.7681896,0.013741267,0.00005131681],"about_ca_topic_score_codex":0.00044693763,"about_ca_topic_score_gemma":0.00048208813,"teacher_disagreement_score":0.003598906,"about_ca_system_score_codex":0.0011884618,"about_ca_system_score_gemma":0.00032006387,"threshold_uncertainty_score":0.012039542},"labels":[],"label_agreement":null},{"id":"W159861840","doi":"","title":"Neighborhood Union Condition with Distance for Vertex-pancyclicity.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Graph","score_opus":0.011887405154393143,"score_gpt":0.27203364812114655,"score_spread":0.2601462429667534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W159861840","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2913054,0.003123957,0.2114469,0.008390758,0.0011184103,0.00021864023,0.0032177134,0.0009948178,0.4801834],"genre_scores_gemma":[0.95084536,0.0011634394,0.019444084,0.0008090227,0.000634161,0.00018204233,0.0013206649,0.00019096385,0.025410254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843985,0.0002992639,0.00009248599,0.00035757065,0.00048084694,0.00033003217],"domain_scores_gemma":[0.9912675,0.004962819,0.00071487017,0.0011268918,0.00084911514,0.0010787678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009949157,0.00038786934,0.0011454572,0.0013867201,0.0024092544,0.0029531156,0.0020478833,0.0021215514,0.025632028],"category_scores_gemma":[0.013923201,0.0005373734,0.0006299768,0.0019805809,0.0027937323,0.009877505,0.004282155,0.0037453903,0.0025478022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016812197,0.000035066954,0.0004926036,0.00013635281,0.000013540342,0.0001955792,0.0001875867,0.001992685,0.00096993387,0.97628367,0.008504096,0.011020884],"study_design_scores_gemma":[0.000058212943,0.0000442496,0.000564263,0.000043720353,0.000022683162,0.00051485724,0.00021234396,0.01207616,0.0015591701,0.9758621,0.009015918,0.000026369124],"about_ca_topic_score_codex":0.0014332135,"about_ca_topic_score_gemma":0.0014662817,"teacher_disagreement_score":0.025632028,"about_ca_system_score_codex":0.0012917412,"about_ca_system_score_gemma":0.00087711937,"threshold_uncertainty_score":0.08574766},"labels":[],"label_agreement":null},{"id":"W159955302","doi":"","title":"Average lower independence in trees and outerplanar graphs.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Independence (probability theory); Independence number; Combinatorics; Pathwidth; Discrete mathematics; Statistics; Graph; Line graph","score_opus":0.011522635569900066,"score_gpt":0.25953387175641757,"score_spread":0.2480112361865175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W159955302","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4628128,0.008971184,0.25286567,0.008259189,0.0007519141,0.00009398823,0.009823096,0.0023593367,0.25406283],"genre_scores_gemma":[0.94808406,0.001800418,0.019241912,0.0010823095,0.0009448795,0.00010479,0.004491303,0.0006913061,0.023559008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975376,0.0004899269,0.00008421058,0.0006258954,0.0006593694,0.0006029993],"domain_scores_gemma":[0.9728069,0.018122822,0.0018977387,0.0031546378,0.0015310711,0.0024868334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018934968,0.0010319278,0.0019262001,0.002608455,0.002325416,0.0042300946,0.0034263853,0.001636085,0.025912669],"category_scores_gemma":[0.019246763,0.001091582,0.0010943287,0.0037565983,0.002116643,0.0076881456,0.0024066875,0.004995406,0.003150151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009765698,0.0004062267,0.009578265,0.00065887487,0.0002676802,0.00036993242,0.00084411533,0.037603494,0.0057062944,0.8123657,0.06330099,0.06792173],"study_design_scores_gemma":[0.000055004108,0.000056986803,0.00592586,0.00005406033,0.000112095746,0.00037799714,0.00011449833,0.059326347,0.0027042723,0.92189443,0.009341442,0.000036927624],"about_ca_topic_score_codex":0.0040461402,"about_ca_topic_score_gemma":0.009497714,"teacher_disagreement_score":0.025912669,"about_ca_system_score_codex":0.0029438343,"about_ca_system_score_gemma":0.0011487062,"threshold_uncertainty_score":0.08668655},"labels":[],"label_agreement":null},{"id":"W1600157163","doi":"","title":"On Some Problems of A.K. Agarwal.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arithmetic; Calculus (dental); Orthodontics; Medicine","score_opus":0.021456511603761268,"score_gpt":0.27664711359735994,"score_spread":0.25519060199359866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600157163","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016343564,0.06456338,0.11424956,0.59758025,0.024733497,0.00008630409,0.00048253484,0.00047510417,0.1814859],"genre_scores_gemma":[0.41678324,0.06519948,0.11476184,0.14063255,0.04045275,0.00039622746,0.00090697635,0.0009979138,0.21986902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973924,0.0012009164,0.0001111931,0.0004555466,0.00061084895,0.00022908527],"domain_scores_gemma":[0.9949334,0.0032395062,0.0002809451,0.00043472418,0.0007537009,0.0003576273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044670333,0.0010329713,0.0012070559,0.0014949868,0.006233096,0.003976026,0.0023858186,0.006147081,0.010208177],"category_scores_gemma":[0.012097605,0.0006607131,0.0011621242,0.0028912066,0.007450231,0.0150564695,0.004629331,0.011593444,0.003376821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061092986,0.00005572243,0.00023517318,0.00012809309,0.00001586023,0.00012711457,0.00048285408,0.00056387845,0.00016106623,0.8833719,0.100923,0.013874253],"study_design_scores_gemma":[0.000019961964,0.000017037579,0.00017002123,0.000066991255,0.0000073014517,0.00018045357,0.00024886875,0.0011092139,0.00018378085,0.9192038,0.07876101,0.000031539817],"about_ca_topic_score_codex":0.003878743,"about_ca_topic_score_gemma":0.0027870212,"teacher_disagreement_score":0.010208177,"about_ca_system_score_codex":0.0031262776,"about_ca_system_score_gemma":0.0020255714,"threshold_uncertainty_score":0.034149826},"labels":[],"label_agreement":null},{"id":"W160262093","doi":"","title":"One edge union of k shell graphs is cordial.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Shell (structure); Computer science; Telecommunications; Materials science; Composite material","score_opus":0.020721625719953788,"score_gpt":0.2217733056093445,"score_spread":0.2010516798893907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W160262093","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44732058,0.0009601228,0.26182416,0.0013168706,0.0007696571,0.0002295462,0.0015545492,0.0033762625,0.2826483],"genre_scores_gemma":[0.87430894,0.0007722767,0.051589206,0.0004590286,0.00018116272,0.00012680178,0.0020343862,0.00061039475,0.069917716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988907,0.00013172209,0.000098722296,0.00035982355,0.00020961628,0.00030948952],"domain_scores_gemma":[0.99631643,0.0008752975,0.0006183289,0.00076887035,0.0007305654,0.0006905524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005115372,0.0008205617,0.00078399107,0.0012920494,0.0024548664,0.0033689784,0.00150701,0.0012888109,0.024255786],"category_scores_gemma":[0.00440534,0.0005758302,0.0008001914,0.0013961258,0.0024178629,0.005409488,0.0031122982,0.001500685,0.00586852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013470973,0.00029137413,0.0053161387,0.0009941749,0.00014333773,0.002646332,0.0015458111,0.0077121654,0.024843786,0.7948467,0.024025127,0.13628788],"study_design_scores_gemma":[0.00007477562,0.00026491407,0.0049603865,0.00028147534,0.00015735986,0.003010986,0.0011852928,0.028328925,0.027838672,0.8749564,0.058814295,0.00012637276],"about_ca_topic_score_codex":0.001255411,"about_ca_topic_score_gemma":0.0019158808,"teacher_disagreement_score":0.024255786,"about_ca_system_score_codex":0.000731533,"about_ca_system_score_gemma":0.0006716727,"threshold_uncertainty_score":0.08114368},"labels":[],"label_agreement":null},{"id":"W1606071578","doi":"","title":"All 2-regular leaves of partial 6-cycle systems","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Horticulture; Biology","score_opus":0.006925416122718716,"score_gpt":0.19817404696321222,"score_spread":0.1912486308404935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606071578","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7971052,0.00042995324,0.068193816,0.00082639715,0.000172348,0.00014513628,0.0011892194,0.000593717,0.13134426],"genre_scores_gemma":[0.9269732,0.0003042928,0.016406696,0.0003345144,0.00012338,0.00020236509,0.0014159118,0.00021844874,0.05402108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995085,0.00007433596,0.000025752963,0.000104517865,0.00012789186,0.00015903062],"domain_scores_gemma":[0.99914217,0.00026739266,0.00013528475,0.00013303298,0.00014491363,0.00017710644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026605546,0.0006275594,0.0007995093,0.0014675034,0.0024723925,0.0032122585,0.0008697088,0.001241953,0.012209398],"category_scores_gemma":[0.001181022,0.00057421887,0.0006523283,0.0016067512,0.0012573238,0.0025129488,0.0015238676,0.0015231654,0.0018330074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019289591,0.00007096305,0.0008499497,0.00012011037,0.000028440345,0.00033039693,0.00084064854,0.0022155026,0.007777925,0.96428704,0.004123087,0.019163001],"study_design_scores_gemma":[0.00003990464,0.00003893162,0.0008732045,0.000027432154,0.000020631203,0.00028316808,0.0003855216,0.0053360695,0.0035095264,0.97762626,0.01183528,0.000024014118],"about_ca_topic_score_codex":0.0010451772,"about_ca_topic_score_gemma":0.0015995937,"teacher_disagreement_score":0.012209398,"about_ca_system_score_codex":0.0009627922,"about_ca_system_score_gemma":0.000707317,"threshold_uncertainty_score":0.04084444},"labels":[],"label_agreement":null},{"id":"W161262107","doi":"","title":"Algebraic connectivity of the line graph, the middle graph and the total graph of a regular graph.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Line graph; Mathematics; Cubic graph; Butterfly graph; Voltage graph; Combinatorics; Null graph; Simplex graph; Graph; Discrete mathematics; Regular graph","score_opus":0.0124261256614257,"score_gpt":0.20146713975832303,"score_spread":0.18904101409689733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W161262107","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59187055,0.0016212811,0.23221482,0.0021703313,0.00024536104,0.00009184692,0.001346721,0.00036378464,0.17007531],"genre_scores_gemma":[0.9701054,0.00084970327,0.015948812,0.00014778858,0.00021227413,0.00007247511,0.0007092356,0.000065593165,0.011888715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997315,0.000080412756,0.000012920782,0.00007334279,0.00005791698,0.00004392574],"domain_scores_gemma":[0.9981213,0.00083094265,0.00044578605,0.00012518933,0.0002766972,0.00020000848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002893222,0.0002837624,0.00029081583,0.0013656867,0.00088903366,0.0018064196,0.0005137045,0.0005495769,0.007197589],"category_scores_gemma":[0.0032760873,0.00026356254,0.00035633025,0.0010950654,0.001480647,0.00366382,0.0010213441,0.0008957018,0.00061001355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040658786,0.000010458254,0.0005868284,0.00003825405,0.000008571238,0.000080488586,0.00018644183,0.0022932824,0.00073771394,0.98552763,0.002127638,0.008362093],"study_design_scores_gemma":[0.000014712296,0.000026359123,0.0010391814,0.00002254267,0.000022250206,0.0002706554,0.00021568038,0.0152779715,0.00066586264,0.9751042,0.007328204,0.00001247519],"about_ca_topic_score_codex":0.0014448239,"about_ca_topic_score_gemma":0.0018473557,"teacher_disagreement_score":0.007197589,"about_ca_system_score_codex":0.00058889604,"about_ca_system_score_gemma":0.00030556152,"threshold_uncertainty_score":0.02407831},"labels":[],"label_agreement":null},{"id":"W161287854","doi":"","title":"Edge Complete (p, 2) Semigraphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Artificial intelligence; Computer science","score_opus":0.022926056344896535,"score_gpt":0.2889876445121452,"score_spread":0.2660615881672487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W161287854","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37474117,0.00130248,0.27695772,0.0031144496,0.00047797288,0.0003097744,0.013655889,0.0018623157,0.32757825],"genre_scores_gemma":[0.8074672,0.0006238376,0.08182407,0.00060994166,0.0001874855,0.00017963847,0.006790107,0.00037950702,0.10193823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995546,0.00013735711,0.000026060216,0.000107997024,0.00010006207,0.00007390966],"domain_scores_gemma":[0.99859256,0.0005284579,0.00017037636,0.0002487169,0.0002205835,0.00023937628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004431097,0.0005274234,0.00046471332,0.0006208911,0.0013620815,0.0015214535,0.0006943184,0.00069866766,0.02140213],"category_scores_gemma":[0.0015703675,0.0003513299,0.00048598013,0.0010332351,0.00066855224,0.003108002,0.0013534952,0.0011545032,0.0032080135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085883733,0.0002451813,0.0020367655,0.0007770571,0.00011183802,0.0011602244,0.00057913386,0.00605254,0.013418809,0.81894666,0.063178815,0.0926343],"study_design_scores_gemma":[0.00007529414,0.000105785446,0.001856443,0.00006584235,0.000050230523,0.0010942698,0.00030838227,0.009927246,0.005244534,0.9199991,0.061247855,0.000024905523],"about_ca_topic_score_codex":0.0007152413,"about_ca_topic_score_gemma":0.001789333,"teacher_disagreement_score":0.02140213,"about_ca_system_score_codex":0.0005578551,"about_ca_system_score_gemma":0.0005434127,"threshold_uncertainty_score":0.07159722},"labels":[],"label_agreement":null},{"id":"W161474301","doi":"","title":"Various partition function identities.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Social and Economic Development in India","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Partition (number theory); Function (biology); Combinatorics; Evolutionary biology","score_opus":0.014403349082562893,"score_gpt":0.24433156967183914,"score_spread":0.22992822058927626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W161474301","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06292264,0.0043550055,0.083269544,0.0058980966,0.0013583407,0.00007857168,0.0011791884,0.0002779284,0.84066075],"genre_scores_gemma":[0.7658966,0.0045669437,0.02872268,0.0017898008,0.0014639224,0.00024395659,0.0013486182,0.00030293784,0.19566455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988803,0.00031539268,0.000055769167,0.00018294953,0.00033943157,0.00022610564],"domain_scores_gemma":[0.9988819,0.0003830354,0.00009857823,0.00026535298,0.00020998597,0.00016114961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012915591,0.0007857008,0.0008656217,0.0033869622,0.0025137737,0.004508455,0.0012287889,0.0013724111,0.025260406],"category_scores_gemma":[0.0033460287,0.00027032165,0.0010729285,0.002547543,0.0031170556,0.004696705,0.0025412452,0.0023741922,0.0050892974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030669146,0.0000032382509,0.000035006044,0.000008632034,0.0000015244744,0.000008643616,0.000035024346,0.00009159474,0.000024809278,0.99671626,0.0014649295,0.0016073132],"study_design_scores_gemma":[0.00000508956,0.0000031678985,0.000128844,0.000018631099,0.0000056181616,0.000073684416,0.000058932514,0.0012132325,0.000109088614,0.98631126,0.012066076,0.0000063937428],"about_ca_topic_score_codex":0.0013040892,"about_ca_topic_score_gemma":0.0015536065,"teacher_disagreement_score":0.025260406,"about_ca_system_score_codex":0.0023385566,"about_ca_system_score_gemma":0.0009178012,"threshold_uncertainty_score":0.084504545},"labels":[],"label_agreement":null},{"id":"W161708728","doi":"","title":"Square-free colorings of graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Square-free integer; Cartesian product; Discrete mathematics; Multipartite; Bounded function; Graph; Domination analysis; Vertex (graph theory)","score_opus":0.015100800266836044,"score_gpt":0.26638835724180937,"score_spread":0.25128755697497335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W161708728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4048225,0.004398797,0.50312126,0.0009494051,0.00076148007,0.0002081729,0.001766957,0.0011631267,0.0828083],"genre_scores_gemma":[0.87906724,0.0013337897,0.09243212,0.0004109854,0.000390524,0.00018379134,0.001535145,0.00025914307,0.024387272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991295,0.00022736119,0.000040603376,0.00020383208,0.00021183382,0.00018679744],"domain_scores_gemma":[0.99720436,0.00143448,0.00032023055,0.00041333793,0.00028944714,0.000338059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006006626,0.0005393079,0.00034372802,0.0012197387,0.0007918906,0.0012352308,0.0004957221,0.0004952533,0.0056930906],"category_scores_gemma":[0.0030298622,0.0004064495,0.00047567175,0.0011364444,0.0014097348,0.0016493747,0.0010435182,0.000893874,0.0009531816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024144382,0.000054194177,0.0020653033,0.0002878136,0.000038812323,0.00032065317,0.00049373735,0.023258863,0.009861627,0.8769864,0.009187201,0.077204034],"study_design_scores_gemma":[0.000030854597,0.00010427767,0.001485174,0.000036704707,0.000013977622,0.000544413,0.00014217851,0.03472813,0.0031921188,0.9303672,0.02932872,0.000026197096],"about_ca_topic_score_codex":0.0008878032,"about_ca_topic_score_gemma":0.0015120446,"teacher_disagreement_score":0.0056930906,"about_ca_system_score_codex":0.0009692744,"about_ca_system_score_gemma":0.00035877476,"threshold_uncertainty_score":0.019045234},"labels":[],"label_agreement":null},{"id":"W161837034","doi":"","title":"More maps of p-gons with a ring of q-gons.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Ring (chemistry); Combinatorics; Chemistry","score_opus":0.022608208770891418,"score_gpt":0.302879848120375,"score_spread":0.28027163934948357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W161837034","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15927547,0.005857355,0.16971788,0.005130782,0.004626211,0.00016094743,0.0014219087,0.0017492862,0.65206015],"genre_scores_gemma":[0.66351026,0.0026944128,0.07471578,0.0018325947,0.001580977,0.000101303165,0.0012439801,0.0006569365,0.25366375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996438,0.000091410984,0.000018018973,0.000088754,0.00009966755,0.000058355978],"domain_scores_gemma":[0.99962425,0.00009081738,0.000041312505,0.00007615299,0.00006447223,0.000102883474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051854266,0.0006166706,0.0004925909,0.0015784671,0.0011868224,0.001993982,0.0005897833,0.00056041765,0.040553298],"category_scores_gemma":[0.00089137506,0.00034668218,0.0010731975,0.00085326924,0.0014712246,0.0045715524,0.0023847087,0.0017405131,0.003514119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013853534,0.000119472774,0.00086480944,0.00019355633,0.000038352944,0.0007250033,0.0011460152,0.0011041509,0.0040327352,0.9381678,0.018398015,0.035071604],"study_design_scores_gemma":[0.000044062024,0.00010133971,0.0019642415,0.000051627234,0.00004333144,0.0014410841,0.0009436639,0.0027807758,0.0023555122,0.81995285,0.17026982,0.000051664374],"about_ca_topic_score_codex":0.0009629848,"about_ca_topic_score_gemma":0.0013749229,"teacher_disagreement_score":0.040553298,"about_ca_system_score_codex":0.00061912014,"about_ca_system_score_gemma":0.00023472075,"threshold_uncertainty_score":0.13566428},"labels":[],"label_agreement":null},{"id":"W162061640","doi":"","title":"Self-Dual Confined Configurations With Ten Points.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dual (grammatical number)","score_opus":0.008409585598752102,"score_gpt":0.22398269000087415,"score_spread":0.21557310440212205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W162061640","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6108876,0.0007527252,0.114380054,0.0013390857,0.00097443565,0.00011702553,0.00058289926,0.0010077765,0.26995835],"genre_scores_gemma":[0.94755703,0.00017746422,0.016673304,0.00027446615,0.00007055781,0.00011412725,0.00025839193,0.00016601998,0.034708597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969566,0.000058487713,0.000013395985,0.000052245967,0.00009068936,0.000089615365],"domain_scores_gemma":[0.99964094,0.00005908622,0.000033304503,0.00007208881,0.000046734407,0.00014792936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024853132,0.00041280207,0.00053678366,0.0009548699,0.0017100681,0.0017313235,0.00096906757,0.0011191448,0.024796799],"category_scores_gemma":[0.0009868795,0.00033583277,0.00033426296,0.000515938,0.001999555,0.001728426,0.0031717464,0.0007994667,0.00265856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019502614,0.000065012144,0.00026708137,0.00008043739,0.00002246357,0.00035429772,0.00013048222,0.005497603,0.0065078223,0.9766018,0.0032573605,0.007020734],"study_design_scores_gemma":[0.00017138153,0.00011462564,0.0006456187,0.00006726661,0.000023801536,0.0006199346,0.0004944544,0.05390303,0.0078101764,0.917028,0.01904065,0.00008106693],"about_ca_topic_score_codex":0.00050202844,"about_ca_topic_score_gemma":0.00068450265,"teacher_disagreement_score":0.024796799,"about_ca_system_score_codex":0.0005802363,"about_ca_system_score_gemma":0.00044731417,"threshold_uncertainty_score":0.08295363},"labels":[],"label_agreement":null},{"id":"W1621911526","doi":"","title":"Algorithmic aspects of counting independent sets","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.01732168150100458,"score_gpt":0.2255222481867079,"score_spread":0.20820056668570333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1621911526","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105699666,0.0028944009,0.7895798,0.0061189006,0.00048719152,0.00013951119,0.00069322536,0.0005234115,0.09386382],"genre_scores_gemma":[0.6782523,0.0025936107,0.27987552,0.0011845737,0.0018308783,0.0005456865,0.0013361603,0.0003777316,0.034003627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945058,0.0018540437,0.00038710545,0.0010045626,0.0017786805,0.00046975352],"domain_scores_gemma":[0.9755643,0.017548034,0.0014867642,0.0028841607,0.0016706592,0.0008461274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066709975,0.0013713868,0.0024397809,0.006507373,0.003919633,0.011428657,0.006049804,0.0031092921,0.010755367],"category_scores_gemma":[0.031703427,0.0017743018,0.0027103093,0.010079306,0.0073972247,0.018519381,0.00588147,0.0071152677,0.0012684442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011985152,0.000010835368,0.00017686262,0.000024026065,0.000008353208,0.00001805267,0.000063861495,0.001180186,0.000066296045,0.9943498,0.0006747946,0.003415138],"study_design_scores_gemma":[0.0000050649423,0.0000023574753,0.00007435819,0.000007893222,0.000009088162,0.000029693154,0.00001945038,0.0067419056,0.000073721574,0.9920372,0.0009921027,0.0000072679645],"about_ca_topic_score_codex":0.0017198608,"about_ca_topic_score_gemma":0.0020032618,"teacher_disagreement_score":0.011428657,"about_ca_system_score_codex":0.0035154668,"about_ca_system_score_gemma":0.0016625143,"threshold_uncertainty_score":0.035980284},"labels":[],"label_agreement":null},{"id":"W162372568","doi":"","title":"Bound For 2-Exponents of Primitive Extremal Tournaments.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.13004630986359506,"score_gpt":0.3715315202130298,"score_spread":0.24148521034943476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W162372568","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4813843,0.008783827,0.2350073,0.008582158,0.0011279926,0.00022778264,0.0020606935,0.0007055452,0.26212037],"genre_scores_gemma":[0.9645211,0.0016870205,0.017953146,0.00063144224,0.00056712644,0.00016136518,0.0005235194,0.00010526011,0.013850003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863005,0.00029254114,0.00006870726,0.00024273244,0.00038162054,0.0003843214],"domain_scores_gemma":[0.98740935,0.009039045,0.0008683721,0.0006743596,0.0007667093,0.0012422022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019753848,0.0010945294,0.0014057799,0.002872486,0.0016102163,0.0055428925,0.0017681028,0.0017704294,0.016461767],"category_scores_gemma":[0.015602457,0.0005111743,0.000801883,0.0017088109,0.0027451236,0.0066825687,0.0030957358,0.0045690406,0.0021885806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032807808,0.00009864218,0.0025388177,0.00031505618,0.000057408724,0.00026062716,0.0003937812,0.0057285405,0.0021362859,0.96126413,0.008800897,0.018077737],"study_design_scores_gemma":[0.00005875464,0.00006500024,0.0013430313,0.000112680034,0.000042540636,0.00035216325,0.000112902264,0.018897308,0.00088094437,0.97224885,0.005856014,0.000029798808],"about_ca_topic_score_codex":0.000438742,"about_ca_topic_score_gemma":0.00074444135,"teacher_disagreement_score":0.016461767,"about_ca_system_score_codex":0.0016031074,"about_ca_system_score_gemma":0.0006832061,"threshold_uncertainty_score":0.055070102},"labels":[],"label_agreement":null},{"id":"W162420740","doi":"","title":"On the spectral radius of graphs with k-vertex cut.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; Vertex (graph theory); RADIUS; Combinatorics; Graph; Physics; Quantum mechanics; Computer science; Eigenvalues and eigenvectors","score_opus":0.023932100537675093,"score_gpt":0.24676897304798728,"score_spread":0.2228368725103122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W162420740","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5704347,0.016810045,0.24831232,0.006983018,0.0009234565,0.000102785794,0.001299734,0.000952465,0.15418154],"genre_scores_gemma":[0.9668299,0.0037902691,0.020597907,0.00055393664,0.0008067533,0.0001267006,0.00054086687,0.00033417027,0.0064194202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845266,0.00069092517,0.00005896451,0.00024541805,0.00029154622,0.00026052908],"domain_scores_gemma":[0.98381996,0.011740811,0.0015188276,0.0007637498,0.0008592907,0.0012973974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002064467,0.0009317807,0.0014121427,0.004328819,0.0014839577,0.0027035833,0.0023310636,0.00202392,0.0067158765],"category_scores_gemma":[0.020233989,0.0006333506,0.00050056196,0.0022049283,0.0033659423,0.006073232,0.0027367065,0.0020783956,0.0022772125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033860118,0.00007297242,0.0021186708,0.00030147654,0.0000564041,0.00018276165,0.00052781607,0.021628616,0.0035985177,0.9340859,0.015176848,0.021911548],"study_design_scores_gemma":[0.000033362932,0.000041232943,0.0016772674,0.000102881364,0.000037973252,0.000409413,0.00040022656,0.06395994,0.00123168,0.92697906,0.005086779,0.00004015344],"about_ca_topic_score_codex":0.0012230276,"about_ca_topic_score_gemma":0.0008526199,"teacher_disagreement_score":0.0067158765,"about_ca_system_score_codex":0.0014486271,"about_ca_system_score_gemma":0.00042969748,"threshold_uncertainty_score":0.022466779},"labels":[],"label_agreement":null},{"id":"W16243189","doi":"10.1016/j.joms.2005.07.015","title":"On Monochromatic-Rainbow Generalizations of Two Ramsey Type Theorems.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Rainbow; Mathematics; Monochromatic color; Type (biology); Ramsey theory; Combinatorics; Optics; Physics","score_opus":0.02920809428856019,"score_gpt":0.3219582061678492,"score_spread":0.292750111879289,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W16243189","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20596094,0.0068033747,0.3287007,0.008155706,0.002425288,0.0001590388,0.0009287181,0.00090066355,0.44596547],"genre_scores_gemma":[0.89452016,0.0031446621,0.049350046,0.0021889547,0.0011456457,0.00014005082,0.000582517,0.00022542577,0.048702467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989949,0.00030639517,0.000052397092,0.00022594209,0.00023379957,0.0001865896],"domain_scores_gemma":[0.99700004,0.0015511997,0.00030351424,0.00058743806,0.0002741989,0.00028358307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002041005,0.0004991557,0.0006737788,0.0013304587,0.0020126307,0.0021243768,0.0012536616,0.0012365833,0.0096913865],"category_scores_gemma":[0.0057600276,0.00035532293,0.0009606911,0.0015773996,0.0027681184,0.00919508,0.003425511,0.0027061354,0.00081790704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030464496,0.000016420374,0.00013305711,0.000042400647,0.0000068483864,0.00009172272,0.000111370646,0.00032639204,0.0002808051,0.9913111,0.0032352991,0.0044141407],"study_design_scores_gemma":[0.000013128844,0.000012137518,0.00023086721,0.000016374803,0.000012057153,0.0002070108,0.00009481442,0.0015312536,0.0003407278,0.9919899,0.005541437,0.000010184192],"about_ca_topic_score_codex":0.0010108954,"about_ca_topic_score_gemma":0.0015203535,"teacher_disagreement_score":0.0096913865,"about_ca_system_score_codex":0.0013054488,"about_ca_system_score_gemma":0.00057289866,"threshold_uncertainty_score":0.032420933},"labels":[],"label_agreement":null},{"id":"W162524908","doi":"","title":"Disproof of a Conjecture on List Coloring.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Conjecture; Mathematics; Combinatorics; List coloring","score_opus":0.016127839007170474,"score_gpt":0.22193553136565952,"score_spread":0.20580769235848906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W162524908","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29481983,0.0039176624,0.17696255,0.14415781,0.006813078,0.0003517879,0.009930376,0.0045135194,0.3585333],"genre_scores_gemma":[0.88073575,0.0016444165,0.052623965,0.016662823,0.0022701705,0.00023870044,0.008075991,0.0008089568,0.036939263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99519676,0.0014553432,0.00023721965,0.0011545104,0.0010923411,0.0008638131],"domain_scores_gemma":[0.9480908,0.038432863,0.0013056484,0.0071386294,0.0032093334,0.0018227086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032253268,0.00094552856,0.0016426085,0.0014538538,0.0055385935,0.005467016,0.003206911,0.004961607,0.015525978],"category_scores_gemma":[0.03443691,0.0013062404,0.0018645595,0.002303163,0.006159238,0.011418921,0.005729437,0.009158395,0.0039605373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000844145,0.00026881704,0.004662598,0.00047404948,0.000105735504,0.0005827092,0.0009874449,0.0071090916,0.0029237613,0.7621831,0.1892542,0.030604286],"study_design_scores_gemma":[0.00019656816,0.00006787257,0.0013842682,0.0001239715,0.000082042905,0.0007019627,0.0006871465,0.014247671,0.0034688537,0.93031555,0.048664723,0.000059320504],"about_ca_topic_score_codex":0.005679694,"about_ca_topic_score_gemma":0.0056856647,"teacher_disagreement_score":0.015525978,"about_ca_system_score_codex":0.0033084736,"about_ca_system_score_gemma":0.0024038178,"threshold_uncertainty_score":0.051939547},"labels":[],"label_agreement":null},{"id":"W162572492","doi":"","title":"Generalized weakly connected domination in graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.020548479801050817,"score_gpt":0.2737326248080655,"score_spread":0.2531841450070147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W162572492","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6487225,0.002422684,0.18337093,0.0033706862,0.00022439066,0.0001366622,0.00095317786,0.0005046806,0.16029434],"genre_scores_gemma":[0.9636075,0.0007983182,0.013541945,0.00040130955,0.00015524012,0.00010663841,0.0004285322,0.000075638876,0.020884868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992223,0.00026631544,0.000036166548,0.00016263334,0.00019649981,0.000115976254],"domain_scores_gemma":[0.9973787,0.0014511475,0.0002507694,0.00032733424,0.00030472752,0.00028737338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061923283,0.0003822387,0.0005852596,0.0013462129,0.0015318322,0.0021413278,0.000786119,0.0007087218,0.0055244397],"category_scores_gemma":[0.0035372372,0.00030988082,0.00053750817,0.0014345435,0.0021733514,0.0033044945,0.0019151799,0.0011917572,0.00053519383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000678519,0.000023956558,0.0015177154,0.00013635197,0.000031504627,0.00021879564,0.0007287271,0.0017143872,0.0026399004,0.9740002,0.003151144,0.015769543],"study_design_scores_gemma":[0.000014931251,0.000011057396,0.00082740013,0.000029990317,0.000022033038,0.00027660528,0.00026386284,0.006904348,0.0010036833,0.9849517,0.005685157,0.000009255335],"about_ca_topic_score_codex":0.0012406659,"about_ca_topic_score_gemma":0.0020415373,"teacher_disagreement_score":0.0055244397,"about_ca_system_score_codex":0.0011670202,"about_ca_system_score_gemma":0.0005181239,"threshold_uncertainty_score":0.018481076},"labels":[],"label_agreement":null},{"id":"W1627871800","doi":"","title":"No-hole 2-distant colorings for unit interval graphs","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Interval (graph theory); Unit (ring theory); Combinatorics; Unit interval; Discrete mathematics; Mathematics education","score_opus":0.02113733466330601,"score_gpt":0.24881090134930903,"score_spread":0.22767356668600303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1627871800","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5790886,0.0012374795,0.3078882,0.003413024,0.0005010043,0.00016984684,0.001459133,0.0011838109,0.10505896],"genre_scores_gemma":[0.89190155,0.0006955127,0.08385861,0.00090902654,0.00023720339,0.00018087108,0.0014008193,0.00043871964,0.020377666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878484,0.00034539777,0.00006995853,0.00032883772,0.00018560293,0.0002852965],"domain_scores_gemma":[0.9929645,0.0040020566,0.00076519547,0.0011215967,0.0002594076,0.0008873164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001165596,0.0010177919,0.0015304434,0.0014335008,0.0032435362,0.0044654645,0.0030164546,0.0019764258,0.013830493],"category_scores_gemma":[0.006721658,0.001279681,0.0012728556,0.002037375,0.0025037762,0.006964809,0.0030846596,0.0042564035,0.0012349454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005151509,0.00019840646,0.0013450586,0.0002551487,0.00003478177,0.00015994352,0.0006009588,0.013692272,0.0030336392,0.94533426,0.010550179,0.024280122],"study_design_scores_gemma":[0.000086878514,0.000046324556,0.00054997974,0.000034214703,0.00003388314,0.00015411698,0.0002627658,0.025000814,0.0013185234,0.9684304,0.004053135,0.000029008082],"about_ca_topic_score_codex":0.0011997272,"about_ca_topic_score_gemma":0.0021463477,"teacher_disagreement_score":0.013830493,"about_ca_system_score_codex":0.0017124809,"about_ca_system_score_gemma":0.00068007654,"threshold_uncertainty_score":0.04626757},"labels":[],"label_agreement":null},{"id":"W16323757","doi":"10.1021/es051382h","title":"On Generalized Schur Numbers for x1+x2+c = kx3.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Schur's theorem; Schur complement; Combinatorics; Pure mathematics; Orthogonal polynomials; Physics; Eigenvalues and eigenvectors","score_opus":0.012983303118572858,"score_gpt":0.2578665010753239,"score_spread":0.24488319795675104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W16323757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16971591,0.00816209,0.518434,0.0059402245,0.002335499,0.00050329696,0.004424161,0.0008366915,0.28964818],"genre_scores_gemma":[0.7714729,0.0066047246,0.11466273,0.0016381183,0.0016170669,0.0012478827,0.0033189077,0.0006279154,0.09880978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981665,0.00062678923,0.00010400908,0.00033453794,0.00042055963,0.0003477148],"domain_scores_gemma":[0.9943125,0.0029751528,0.0006582425,0.0004718661,0.0012671269,0.00031521945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030132013,0.0016954764,0.0011436075,0.0034843283,0.0016926844,0.0029754017,0.0016111104,0.0012947564,0.045545783],"category_scores_gemma":[0.0130876135,0.00045420835,0.0013348407,0.0025099039,0.003831617,0.0055655716,0.0023296725,0.0029298603,0.010960813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084618114,0.000034736677,0.00069546513,0.00016621023,0.000031303836,0.00017611828,0.00023180843,0.004694667,0.00046297003,0.9584139,0.010706255,0.024302019],"study_design_scores_gemma":[0.000027066924,0.000042187774,0.00078296283,0.00007363618,0.000013087848,0.00025991,0.00007044468,0.029136447,0.00038403124,0.9569037,0.012256281,0.00005032587],"about_ca_topic_score_codex":0.0030335316,"about_ca_topic_score_gemma":0.0026515988,"teacher_disagreement_score":0.045545783,"about_ca_system_score_codex":0.0014968758,"about_ca_system_score_gemma":0.0011698556,"threshold_uncertainty_score":0.15236586},"labels":[],"label_agreement":null},{"id":"W16336656","doi":"","title":"On Families of Bipartite Graphs Associated with Sums of Fibonacci and Lucas Numbers.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Mathematics; Combinatorics; Bipartite graph; Lucas number; Fibonacci polynomials; Recurrence relation; Sequence (biology); Lucas sequence; Discrete mathematics; Graph; Classical orthogonal polynomials; Orthogonal polynomials","score_opus":0.00891547460181605,"score_gpt":0.23323638915526157,"score_spread":0.22432091455344552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W16336656","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54748154,0.0041367277,0.31391382,0.0017172826,0.00056361925,0.00015371961,0.0009938111,0.0006582574,0.1303812],"genre_scores_gemma":[0.93851024,0.0016935557,0.037010618,0.00038603935,0.0003663661,0.00022407142,0.0007437825,0.00016871541,0.020896552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890745,0.00032337537,0.000041690873,0.00023179573,0.00026117353,0.0002345359],"domain_scores_gemma":[0.9968912,0.0017612197,0.00060034735,0.00016301549,0.00028329046,0.00030088233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092087244,0.00061887974,0.00060739764,0.0030016191,0.0032123697,0.0018666792,0.00064076507,0.0013667842,0.011023496],"category_scores_gemma":[0.005821309,0.0005565839,0.0009277867,0.0015696745,0.0021525729,0.0034572706,0.001343259,0.00091089314,0.0009910502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032479253,0.000008845526,0.00069536944,0.000045294943,0.0000103305265,0.0003060628,0.00033337492,0.0016460462,0.00084572926,0.9889592,0.0014601642,0.0056571267],"study_design_scores_gemma":[0.00001467512,0.000021112673,0.0008513217,0.000058052407,0.000016012948,0.0009025564,0.00031630092,0.011640933,0.00057145767,0.97706556,0.008513027,0.000029074425],"about_ca_topic_score_codex":0.0018464765,"about_ca_topic_score_gemma":0.00212224,"teacher_disagreement_score":0.011023496,"about_ca_system_score_codex":0.0012345957,"about_ca_system_score_gemma":0.00050190336,"threshold_uncertainty_score":0.036877275},"labels":[],"label_agreement":null},{"id":"W164070410","doi":"","title":"Independent Sets And Matchings In Tensor Product Of Graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Tensor product; Product (mathematics); Tensor (intrinsic definition); Combinatorics; Pure mathematics; Geometry","score_opus":0.0124302741916157,"score_gpt":0.2691557154029496,"score_spread":0.2567254412113339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W164070410","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35470992,0.009380632,0.4348014,0.0047514364,0.0009275765,0.00015264527,0.001276499,0.0008583845,0.19314146],"genre_scores_gemma":[0.88554704,0.0029469777,0.06615897,0.0005492985,0.0009611754,0.00013725823,0.000930574,0.00025845866,0.042510264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978034,0.0007136254,0.00017967532,0.00047617735,0.00050792616,0.00031918648],"domain_scores_gemma":[0.99410903,0.0031230797,0.0008569578,0.00078942586,0.00049237005,0.0006291008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020331019,0.00076628075,0.0010755227,0.003646673,0.0028625517,0.004424146,0.0015716434,0.0016572303,0.01042421],"category_scores_gemma":[0.007776422,0.0011821999,0.0014526533,0.0039859107,0.004127701,0.011949607,0.0032603631,0.0028338458,0.0017626968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035373418,0.000020991702,0.0002792146,0.000045766432,0.000014044069,0.00006652921,0.00020342004,0.0007212,0.00038371727,0.99098575,0.0015003611,0.005743672],"study_design_scores_gemma":[0.0000058976857,0.0000103112625,0.0001844898,0.000017421951,0.000014952891,0.00013772548,0.000069080306,0.0028623585,0.00025830578,0.9934009,0.0030298166,0.000008736863],"about_ca_topic_score_codex":0.0015344416,"about_ca_topic_score_gemma":0.0018761391,"teacher_disagreement_score":0.01042421,"about_ca_system_score_codex":0.0016598208,"about_ca_system_score_gemma":0.00071843906,"threshold_uncertainty_score":0.034872413},"labels":[],"label_agreement":null},{"id":"W164208013","doi":"","title":"Combinatorial Proofs of a Type of Binomial Identity.","year":2005,"lang":"ca","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Mathematical proof; Type (biology); Identity (music); Binomial coefficient; Combinatorial proof; Binomial (polynomial); Combinatorics; Discrete mathematics; Statistics; Geometry; Biology; Physics","score_opus":0.016133512960468648,"score_gpt":0.26702322381014104,"score_spread":0.2508897108496724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W164208013","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10004796,0.0031597917,0.43893617,0.012039597,0.0032242155,0.00014435957,0.0012737671,0.0018534326,0.43932065],"genre_scores_gemma":[0.8709379,0.001133447,0.06319495,0.0022977917,0.0014151937,0.00013307115,0.00072002487,0.00043781367,0.059729792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99716055,0.0012120844,0.00015329395,0.00043450145,0.00074624055,0.00029330683],"domain_scores_gemma":[0.9871564,0.008578942,0.0006036664,0.001922303,0.0011097207,0.0006289379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024877149,0.0005405878,0.0007837091,0.0013317448,0.0029956603,0.0037198083,0.0018769973,0.0013831793,0.02016183],"category_scores_gemma":[0.014677648,0.00068021845,0.0012463151,0.0014039417,0.004396724,0.009289549,0.0039638365,0.0032943648,0.0025320542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002744491,0.000023092425,0.00017494854,0.00005441555,0.000009812212,0.00015569996,0.0001720164,0.00015150601,0.00036799305,0.9891327,0.005495642,0.0042347],"study_design_scores_gemma":[0.000023862265,0.00001565681,0.00018708258,0.00003389329,0.000019563304,0.0004046294,0.00007771699,0.0015440637,0.0008840236,0.9837467,0.013048854,0.000013841167],"about_ca_topic_score_codex":0.00072805525,"about_ca_topic_score_gemma":0.0009922539,"teacher_disagreement_score":0.02016183,"about_ca_system_score_codex":0.0016936274,"about_ca_system_score_gemma":0.0009841992,"threshold_uncertainty_score":0.06744808},"labels":[],"label_agreement":null},{"id":"W164421947","doi":"","title":"A space-filling complete graph.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Space (punctuation); Combinatorics; Computer science","score_opus":0.030524980774971847,"score_gpt":0.2844275239525914,"score_spread":0.25390254317761957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W164421947","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3946,0.0015612118,0.3096109,0.0046815327,0.000698889,0.000365076,0.008437112,0.0022996955,0.27774563],"genre_scores_gemma":[0.7644229,0.0011269667,0.15334758,0.00077565433,0.00015524392,0.00023192177,0.00515674,0.0005373718,0.07424558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996487,0.00008773063,0.000015414607,0.00008633269,0.0000878176,0.00007398983],"domain_scores_gemma":[0.9989698,0.00042382174,0.000116804964,0.00018810967,0.00013071709,0.00017066226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026356906,0.00050129276,0.0005899059,0.00067028886,0.0015667806,0.0018273123,0.0008060491,0.0011472873,0.021458639],"category_scores_gemma":[0.0018557751,0.00035237125,0.0005471131,0.0012863918,0.001203439,0.0026849676,0.0013922375,0.0014819645,0.003615984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002453637,0.00011482465,0.0003996053,0.00037311963,0.00003226991,0.00059075886,0.00045800296,0.0040993937,0.007423445,0.9162787,0.025396308,0.04458817],"study_design_scores_gemma":[0.00004750494,0.00006709928,0.00062553224,0.00006473116,0.00003413247,0.0007348361,0.00034865818,0.0087529365,0.004246637,0.9305391,0.054517806,0.000021005915],"about_ca_topic_score_codex":0.0010022804,"about_ca_topic_score_gemma":0.0012928544,"teacher_disagreement_score":0.021458639,"about_ca_system_score_codex":0.00052040094,"about_ca_system_score_gemma":0.0006766733,"threshold_uncertainty_score":0.071786284},"labels":[],"label_agreement":null},{"id":"W164845282","doi":"","title":"Circulant Distant Two Labeling and Circular Chromatic Number","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Circulant matrix; Chromatic scale; Graph; Function (biology); Discrete mathematics","score_opus":0.0105874983956545,"score_gpt":0.23182612799275454,"score_spread":0.22123862959710003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W164845282","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8137233,0.00083352387,0.11700976,0.0016949414,0.00014716142,0.00007999509,0.00084153266,0.0004501542,0.065219514],"genre_scores_gemma":[0.9494273,0.00039487134,0.03967136,0.00025528992,0.000067227964,0.00008219162,0.00063746143,0.00007119417,0.009393034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953496,0.00009662826,0.000021762238,0.00013992516,0.000081597,0.00012501908],"domain_scores_gemma":[0.9971589,0.0013501577,0.0004835264,0.00034697543,0.00025878145,0.0004016454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046691706,0.00036245026,0.00029317572,0.0011206927,0.0013872525,0.0014007738,0.00064907805,0.00069394923,0.0056271986],"category_scores_gemma":[0.0026552773,0.0002209242,0.00022901292,0.0014461261,0.0017040329,0.002047021,0.0009868621,0.00077912473,0.000562723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051611505,0.00009894271,0.004324371,0.00019434272,0.00002052626,0.00016057996,0.00047894305,0.017426902,0.014074315,0.90735227,0.008432621,0.046919953],"study_design_scores_gemma":[0.000110326604,0.00017458445,0.0035161863,0.00006027036,0.000037437065,0.00082344195,0.00043895651,0.08987423,0.012352196,0.86137754,0.0311662,0.000068593625],"about_ca_topic_score_codex":0.001468226,"about_ca_topic_score_gemma":0.0020361315,"teacher_disagreement_score":0.0056271986,"about_ca_system_score_codex":0.0018146088,"about_ca_system_score_gemma":0.0007392464,"threshold_uncertainty_score":0.018824816},"labels":[],"label_agreement":null},{"id":"W165581539","doi":"","title":"On the edge-residual number and the line completion number of a graph.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Residual; Combinatorics; Enhanced Data Rates for GSM Evolution; Graph; Edge contraction; Line graph; Algorithm; Voltage graph; Computer science; Artificial intelligence","score_opus":0.01814577112471864,"score_gpt":0.23225060729119126,"score_spread":0.21410483616647263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W165581539","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5171743,0.006774743,0.21947919,0.013132149,0.0009674912,0.0001293512,0.0029066077,0.00088050845,0.23855561],"genre_scores_gemma":[0.92295337,0.002967257,0.042132616,0.0007294733,0.0011284978,0.00016037091,0.0015511082,0.00033490406,0.028042294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986926,0.0004503357,0.00005935221,0.00029927716,0.00021806436,0.00028032053],"domain_scores_gemma":[0.98987156,0.0067752637,0.0009680999,0.0008508188,0.0005271905,0.0010070372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020250722,0.0007891264,0.0011076971,0.0030224705,0.0018634693,0.0033744453,0.002097584,0.0018945914,0.01442827],"category_scores_gemma":[0.011365352,0.00057646364,0.00059041183,0.0025102512,0.0046306523,0.011618633,0.0021895575,0.003394413,0.0024092922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018109799,0.000070668306,0.0012320578,0.00013474292,0.000019681702,0.000059770082,0.00020069133,0.0064520002,0.0009768791,0.9632161,0.012104316,0.01535189],"study_design_scores_gemma":[0.000034431334,0.0000390733,0.0012232985,0.000051090537,0.00002147486,0.00018942489,0.00023166608,0.018602844,0.0008422928,0.9711884,0.0075446353,0.000031420244],"about_ca_topic_score_codex":0.0016515306,"about_ca_topic_score_gemma":0.0016778295,"teacher_disagreement_score":0.01442827,"about_ca_system_score_codex":0.0017672781,"about_ca_system_score_gemma":0.00067266944,"threshold_uncertainty_score":0.048267305},"labels":[],"label_agreement":null},{"id":"W16581075","doi":"10.1016/j.injury.2006.02.038","title":"Graph Operations and Point-Distinguishing Chromatic Indices.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Graph; Windmill graph; Friendship graph; Combinatorics; Line graph; Voltage graph","score_opus":0.009737606395186975,"score_gpt":0.23673656357332248,"score_spread":0.2269989571781355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W16581075","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14851178,0.0047458853,0.6229075,0.0049930257,0.0010804726,0.00032163784,0.004767437,0.0019081892,0.21076414],"genre_scores_gemma":[0.75824493,0.0034148216,0.16848359,0.0009712311,0.000763046,0.00027247175,0.0044980636,0.00063373754,0.0627181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990257,0.0002183159,0.000056239845,0.00029121182,0.00025437542,0.0001542203],"domain_scores_gemma":[0.99710053,0.0014520022,0.00038150037,0.00042864043,0.0003931419,0.00024409387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010204396,0.0007453926,0.0005749135,0.0035541297,0.0015918799,0.0028703737,0.0010702095,0.0010826328,0.016991314],"category_scores_gemma":[0.0048875827,0.0003797207,0.00082363834,0.003016799,0.0027658762,0.0060018087,0.0018988468,0.0023933027,0.0029221063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007835828,0.00002516068,0.00055367703,0.00007837681,0.000018935922,0.00005770465,0.00019160715,0.0038125352,0.0006562329,0.95193714,0.0069405176,0.0356496],"study_design_scores_gemma":[0.0000122877345,0.000017442553,0.00035037182,0.000021233245,0.000012210752,0.00015109351,0.00008390378,0.00915152,0.00049916434,0.9757742,0.013910018,0.000016552056],"about_ca_topic_score_codex":0.0034308413,"about_ca_topic_score_gemma":0.004012814,"teacher_disagreement_score":0.016991314,"about_ca_system_score_codex":0.0021905568,"about_ca_system_score_gemma":0.00086314185,"threshold_uncertainty_score":0.05684161},"labels":[],"label_agreement":null},{"id":"W166124905","doi":"","title":"Hyperbolic Modified Pell Functions.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.008612894878175,"score_gpt":0.23052262421363517,"score_spread":0.2219097293354602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W166124905","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05394104,0.0036905361,0.18108222,0.0028860855,0.0013384572,0.00008291354,0.000932901,0.00077802787,0.75526774],"genre_scores_gemma":[0.5797412,0.0032594998,0.047718834,0.0012268883,0.0008345107,0.00013405875,0.0009708803,0.0009396102,0.3651745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997013,0.000059859576,0.000013572104,0.000057048015,0.00012463416,0.000043526135],"domain_scores_gemma":[0.9995677,0.00008915681,0.000060839397,0.00008980057,0.000116675976,0.00007581268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033271054,0.0008818489,0.00046612194,0.0017380493,0.00086075056,0.0024174063,0.0007051817,0.00069078465,0.031081203],"category_scores_gemma":[0.0024439262,0.00028193084,0.000412136,0.0010859366,0.0012861848,0.002841561,0.0019458141,0.0017641716,0.008821505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020007412,0.000008133904,0.0001570044,0.0000287496,0.000006379652,0.00004666,0.00007164109,0.00057921,0.0007937982,0.96638554,0.008691685,0.023211135],"study_design_scores_gemma":[0.000012607245,0.000013371502,0.00041068695,0.000025140764,0.000012614846,0.0002780968,0.00009088954,0.007443683,0.0020018492,0.92509115,0.064602606,0.000017309885],"about_ca_topic_score_codex":0.0009977914,"about_ca_topic_score_gemma":0.0012944764,"teacher_disagreement_score":0.031081203,"about_ca_system_score_codex":0.0011921388,"about_ca_system_score_gemma":0.0005035489,"threshold_uncertainty_score":0.103976965},"labels":[],"label_agreement":null},{"id":"W166823269","doi":"","title":"On Irregularity In Graphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.011329640090500047,"score_gpt":0.2636239412768887,"score_spread":0.2522943011863887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W166823269","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20290856,0.029973157,0.38292646,0.028213648,0.004927378,0.00016430733,0.0012502901,0.000998387,0.34863785],"genre_scores_gemma":[0.83178794,0.019206276,0.063185774,0.0042663203,0.006292739,0.00025416346,0.0016402414,0.0007956838,0.07257091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987992,0.0003753615,0.00008354404,0.00024970938,0.00030025945,0.00019183845],"domain_scores_gemma":[0.99171,0.0052087754,0.0006670615,0.0011363224,0.00066315394,0.0006148269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015144388,0.0007193808,0.0012489116,0.0040127053,0.002514661,0.0029619471,0.0013242945,0.0018635349,0.009335966],"category_scores_gemma":[0.010366258,0.0006440004,0.0009156138,0.003330008,0.005436583,0.010390888,0.0035983317,0.005056456,0.0018906324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003625034,0.000029280118,0.0007314371,0.0001199631,0.000016678314,0.00014283966,0.0003564539,0.0018755036,0.0002986313,0.97325385,0.008894112,0.014245183],"study_design_scores_gemma":[0.000004470435,0.000008959482,0.00025581638,0.000030242782,0.0000068898653,0.00012143544,0.00011423242,0.0025389583,0.000091435715,0.9904585,0.006362951,0.000006232303],"about_ca_topic_score_codex":0.0013667092,"about_ca_topic_score_gemma":0.0018004366,"teacher_disagreement_score":0.009335966,"about_ca_system_score_codex":0.0016679371,"about_ca_system_score_gemma":0.0004682665,"threshold_uncertainty_score":0.03123194},"labels":[],"label_agreement":null},{"id":"W166850336","doi":"","title":"Disjoint Partial Triple Systems of Different Orders.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Disjoint sets; Mathematics; Combinatorics","score_opus":0.0054992165173615055,"score_gpt":0.18026248925254648,"score_spread":0.17476327273518497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W166850336","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19092128,0.0017135734,0.45172364,0.0016209249,0.001005868,0.00024005216,0.0026018124,0.0013175262,0.3488555],"genre_scores_gemma":[0.77165353,0.00085908815,0.1416497,0.00069080613,0.00027451364,0.00025244127,0.002663831,0.00040664614,0.0815494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983942,0.00036239062,0.00012617705,0.00031614513,0.00046776718,0.00033330938],"domain_scores_gemma":[0.99701476,0.00085216865,0.00031173215,0.00067431154,0.00079789426,0.00034912015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000774089,0.0005046742,0.0006916957,0.002537297,0.0031173148,0.004245345,0.0009733248,0.0011180089,0.022366235],"category_scores_gemma":[0.0035289058,0.0006315037,0.0007967269,0.0021519891,0.0022950438,0.005614928,0.0028629724,0.0018897186,0.003999142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043344513,0.000024625764,0.00029094674,0.000042884167,0.00001478625,0.0001552576,0.00025930084,0.00058001286,0.0017851797,0.9840056,0.0027602853,0.010037817],"study_design_scores_gemma":[0.000019001984,0.000025714195,0.00031458118,0.00004983586,0.000028434828,0.00040647798,0.0004864958,0.0038348567,0.0038846259,0.9564906,0.034429513,0.000029845516],"about_ca_topic_score_codex":0.001863691,"about_ca_topic_score_gemma":0.0037588102,"teacher_disagreement_score":0.022366235,"about_ca_system_score_codex":0.0014704767,"about_ca_system_score_gemma":0.0010930565,"threshold_uncertainty_score":0.074822485},"labels":[],"label_agreement":null},{"id":"W166953216","doi":"","title":"Vertex-Neighbor-Integrity of Composition Graphs of Paths.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Composition (language); Combinatorics; Graph; Art","score_opus":0.017667599210157293,"score_gpt":0.22980220846005123,"score_spread":0.21213460924989394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W166953216","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21307515,0.0007593595,0.71737313,0.0038560815,0.00033370312,0.00032636579,0.003350765,0.0024210012,0.058504432],"genre_scores_gemma":[0.82425636,0.00055501837,0.15278572,0.0005007586,0.0002687914,0.00017200236,0.0038857472,0.0006216836,0.016953912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994406,0.0014175911,0.00047449133,0.0011866319,0.0018173221,0.0006978357],"domain_scores_gemma":[0.96894574,0.012533367,0.0034710513,0.008841191,0.0047747535,0.0014340231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038942955,0.00063146005,0.0010419536,0.0019763205,0.0028619736,0.0049212426,0.0024617643,0.0019765764,0.009154364],"category_scores_gemma":[0.032724414,0.00088644703,0.0009389311,0.0024283505,0.0030630396,0.015410112,0.0042033014,0.003382317,0.0019374542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089947094,0.00025135287,0.00909613,0.00043777432,0.00015157109,0.0006182847,0.001477587,0.017529683,0.005548035,0.83726513,0.011099446,0.11562559],"study_design_scores_gemma":[0.000040535586,0.00007839174,0.0010652622,0.00006322883,0.000114013084,0.00062675425,0.00059128203,0.0431909,0.009998803,0.930934,0.013269153,0.000027709382],"about_ca_topic_score_codex":0.0023116264,"about_ca_topic_score_gemma":0.0022642154,"teacher_disagreement_score":0.009154364,"about_ca_system_score_codex":0.0013609229,"about_ca_system_score_gemma":0.0021028765,"threshold_uncertainty_score":0.03062433},"labels":[],"label_agreement":null},{"id":"W1669943","doi":"","title":"The Height Distribution of Nodes in Non-Crossing Trees.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Distribution (mathematics); Statistics; Mathematical analysis","score_opus":0.009088075525755093,"score_gpt":0.23055360921991788,"score_spread":0.22146553369416278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1669943","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7290401,0.002617133,0.23494232,0.00083468534,0.00034773766,0.00018830082,0.015332865,0.002580168,0.014116738],"genre_scores_gemma":[0.9314799,0.0007333121,0.05236638,0.00011182703,0.000111836416,0.000120360695,0.010816901,0.00025917482,0.004000315],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865854,0.00017919895,0.00012028785,0.00040643246,0.000399687,0.00023590802],"domain_scores_gemma":[0.99153686,0.0042950083,0.001138719,0.0013574229,0.0011309739,0.0005409909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018947094,0.00035559657,0.0005889609,0.004147181,0.0007984156,0.0017235252,0.001409204,0.0008242862,0.0052954336],"category_scores_gemma":[0.01422054,0.00034028981,0.0005485867,0.0034211758,0.0008408573,0.0023153478,0.0011691343,0.0007410082,0.0016327975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021295731,0.00033962523,0.25994748,0.0010972755,0.00034863863,0.0020805849,0.0025916519,0.12086359,0.034329735,0.11764731,0.029637365,0.42898712],"study_design_scores_gemma":[0.0001681603,0.0005833695,0.12050346,0.00032268107,0.0002463235,0.008287792,0.0019457059,0.47545248,0.015683763,0.32047722,0.056194834,0.00013420262],"about_ca_topic_score_codex":0.0013532947,"about_ca_topic_score_gemma":0.0026774602,"teacher_disagreement_score":0.0052954336,"about_ca_system_score_codex":0.00080180966,"about_ca_system_score_gemma":0.00046326526,"threshold_uncertainty_score":0.017714977},"labels":[],"label_agreement":null},{"id":"W167066395","doi":"","title":"A New Construction For Group Divisible Designs With Block Size Five and Few Groups.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Block (permutation group theory); Group (periodic table); Block size; Combinatorics; Arithmetic; Computer science; Operating system","score_opus":0.006824054315018605,"score_gpt":0.19564269927913483,"score_spread":0.1888186449641162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W167066395","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09148448,0.0007547507,0.83071506,0.00091383,0.0008082565,0.0002647752,0.000398164,0.0014425999,0.07321804],"genre_scores_gemma":[0.51373833,0.00050953106,0.4485851,0.00064299157,0.00022334466,0.0003710281,0.0004443819,0.00025278472,0.03523245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993364,0.00017935602,0.000043587082,0.00013844551,0.00019748625,0.000104604565],"domain_scores_gemma":[0.9988134,0.00034392506,0.00015032191,0.00036560337,0.0001271068,0.00019970826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064862607,0.0004962651,0.00051177427,0.0009512206,0.0012823647,0.0012182025,0.0009834372,0.00077185134,0.008867121],"category_scores_gemma":[0.0016604403,0.00039639696,0.00060793885,0.0007834007,0.001283984,0.0015157986,0.0024103504,0.0014468258,0.001980514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022558549,0.00009842505,0.00043322763,0.0002087979,0.000024934332,0.0002560193,0.00029259713,0.0026803226,0.02473156,0.900612,0.0069764834,0.06345997],"study_design_scores_gemma":[0.00028011843,0.00054871256,0.0006847235,0.0001633946,0.00008914723,0.0014652946,0.00019544175,0.027889347,0.03168996,0.8096508,0.12722567,0.000117365016],"about_ca_topic_score_codex":0.0002708234,"about_ca_topic_score_gemma":0.000676644,"teacher_disagreement_score":0.008867121,"about_ca_system_score_codex":0.00069674576,"about_ca_system_score_gemma":0.0006675972,"threshold_uncertainty_score":0.029663444},"labels":[],"label_agreement":null},{"id":"W167104252","doi":"","title":"Path Spectra and Forbidden Families.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Path (computing); Spectral line; Combinatorics; Computer science; Computer network; Physics; Astronomy","score_opus":0.010339195753276423,"score_gpt":0.22733423903899458,"score_spread":0.21699504328571817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W167104252","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10967694,0.006921677,0.7177559,0.004802049,0.0006733281,0.00013721614,0.0017722483,0.002000497,0.15626012],"genre_scores_gemma":[0.7638776,0.0046501756,0.17657073,0.00126242,0.0005455628,0.00035484676,0.0021874667,0.00066294987,0.049888343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985067,0.000502101,0.00008919163,0.00025292914,0.0004794038,0.00016956827],"domain_scores_gemma":[0.99586076,0.0025893562,0.00026433935,0.00084979454,0.00028585686,0.00014990928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009988786,0.00047009383,0.0005224964,0.0021250986,0.0014978268,0.0027031614,0.00095538463,0.00085188006,0.012249442],"category_scores_gemma":[0.007766267,0.00038885398,0.00047702718,0.002506251,0.0023034096,0.0050387476,0.002212943,0.0020607244,0.0023360727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009453325,0.000036247857,0.00039449797,0.00008886491,0.0000167063,0.0001420454,0.0002111809,0.0027888191,0.0011386261,0.91666657,0.009849835,0.06857214],"study_design_scores_gemma":[0.000008404238,0.000009859943,0.000105979,0.000037162343,0.0000064039505,0.00026391947,0.00008341123,0.0065296725,0.0010424126,0.98049635,0.011407924,0.000008475292],"about_ca_topic_score_codex":0.0005711665,"about_ca_topic_score_gemma":0.0007609664,"teacher_disagreement_score":0.012249442,"about_ca_system_score_codex":0.0012346191,"about_ca_system_score_gemma":0.0008660124,"threshold_uncertainty_score":0.04097843},"labels":[],"label_agreement":null},{"id":"W167165370","doi":"","title":"New Linear Codes of Dimensions 5 and 6 over GF(8).","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; GF(2); Arithmetic; Discrete mathematics; Finite field","score_opus":0.013753463928825767,"score_gpt":0.22618413138596213,"score_spread":0.21243066745713637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W167165370","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50423247,0.018683722,0.2280324,0.011586942,0.0073908716,0.00035609,0.0031202475,0.0033526777,0.22324471],"genre_scores_gemma":[0.7734008,0.004350634,0.14293852,0.002093954,0.001109701,0.000265263,0.0030079295,0.00030615556,0.07252709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991654,0.00012963718,0.00006728452,0.00011133171,0.00034298465,0.00018329328],"domain_scores_gemma":[0.99818015,0.00048832287,0.00031086348,0.00039835577,0.00034086904,0.00028147775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052842725,0.00039190854,0.0003704286,0.0012839816,0.0010176285,0.0017352443,0.0007142972,0.0009979041,0.00886121],"category_scores_gemma":[0.0026154858,0.0003505858,0.00058764854,0.0012132925,0.0011306739,0.002940179,0.001888973,0.0020606127,0.0021936574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007533816,0.00025928754,0.0014564486,0.00041043543,0.00006500984,0.0010809605,0.00071132823,0.006931755,0.02688297,0.75083864,0.03997924,0.17063053],"study_design_scores_gemma":[0.00034782797,0.00057514245,0.002766036,0.00043973478,0.00012069387,0.004841664,0.0004743516,0.04356513,0.046185754,0.6095221,0.29089263,0.00026899244],"about_ca_topic_score_codex":0.00051982515,"about_ca_topic_score_gemma":0.0015051349,"teacher_disagreement_score":0.00886121,"about_ca_system_score_codex":0.0009361209,"about_ca_system_score_gemma":0.0011140179,"threshold_uncertainty_score":0.029643714},"labels":[],"label_agreement":null},{"id":"W167733642","doi":"","title":"Total domination in Kr-covered graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.010918119384244298,"score_gpt":0.2668438112478923,"score_spread":0.255925691863648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W167733642","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78660667,0.0013184994,0.0923295,0.001432219,0.00007197541,0.00009098205,0.0019663365,0.00051554875,0.11566814],"genre_scores_gemma":[0.9754032,0.00058048253,0.0067599188,0.00016135721,0.000047494115,0.00005141934,0.0009200756,0.00011093229,0.015965244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897015,0.00019894779,0.000044747143,0.00020857107,0.00029700578,0.00028058435],"domain_scores_gemma":[0.99558926,0.0026253841,0.00042634757,0.0005220061,0.00046575803,0.00037134372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005906516,0.00032354996,0.0005624906,0.0014422045,0.0011657209,0.0023002469,0.00086233293,0.00058423687,0.008710919],"category_scores_gemma":[0.003586326,0.00041844192,0.0005847533,0.0016470153,0.0012144378,0.0033965302,0.0018165049,0.0008262458,0.0008792212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040913085,0.00008177655,0.009304713,0.000675092,0.00020249467,0.0009956539,0.0021001515,0.016409539,0.014319359,0.8761439,0.016150976,0.0632072],"study_design_scores_gemma":[0.000080094826,0.00006601666,0.006079163,0.00013836955,0.00020006252,0.002268583,0.0011586562,0.048866414,0.009946882,0.89782935,0.033322886,0.00004344219],"about_ca_topic_score_codex":0.0025695772,"about_ca_topic_score_gemma":0.003478571,"teacher_disagreement_score":0.008710919,"about_ca_system_score_codex":0.0012027565,"about_ca_system_score_gemma":0.00055740273,"threshold_uncertainty_score":0.02914095},"labels":[],"label_agreement":null},{"id":"W168336619","doi":"","title":"On a Prime Labeling Conjecture.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Prime (order theory); Conjecture; Mathematics; Arithmetic; Combinatorics","score_opus":0.00712472240400353,"score_gpt":0.2099430421946723,"score_spread":0.20281831979066878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W168336619","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11525387,0.0061898204,0.19121602,0.102217235,0.0046643233,0.00012972872,0.0024914285,0.0020077082,0.57582986],"genre_scores_gemma":[0.7965333,0.0059709484,0.06418451,0.023407562,0.005944988,0.0003530503,0.004316739,0.0010014721,0.09828743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982267,0.0005626724,0.000057128655,0.0005016027,0.00036846765,0.0002834739],"domain_scores_gemma":[0.98641926,0.009667406,0.00044623512,0.0019971817,0.00071427616,0.00075564935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025549254,0.0008452555,0.0011763228,0.0012824244,0.003910109,0.0050799334,0.0018875289,0.003500209,0.028538004],"category_scores_gemma":[0.01263595,0.0007481485,0.0011045518,0.0024554352,0.0055685197,0.019478837,0.0052032727,0.006911931,0.005334644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071471244,0.000043775577,0.00041980555,0.00007346435,0.0000075944135,0.00006235076,0.00019162026,0.0006195307,0.00021175604,0.9534469,0.03501773,0.009833964],"study_design_scores_gemma":[0.00002197779,0.000008325782,0.00017554396,0.00002475008,0.0000074773166,0.00008208816,0.00007769417,0.0012846285,0.00017325938,0.9853851,0.012752425,0.0000066670123],"about_ca_topic_score_codex":0.0017836415,"about_ca_topic_score_gemma":0.001772794,"teacher_disagreement_score":0.028538004,"about_ca_system_score_codex":0.002120852,"about_ca_system_score_gemma":0.0011382092,"threshold_uncertainty_score":0.09546918},"labels":[],"label_agreement":null},{"id":"W168427437","doi":"","title":"Cordialness of cycles with parallel Pk-chords and multiple subdivision graphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Subdivision; Mathematics; Combinatorics; Geography","score_opus":0.005601636298647363,"score_gpt":0.1951557387908735,"score_spread":0.18955410249222615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W168427437","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64387983,0.0011951175,0.15070973,0.0012325261,0.00020725862,0.00016237382,0.0007727006,0.00045046408,0.20139009],"genre_scores_gemma":[0.9592564,0.0003498497,0.016763944,0.00015666395,0.00008765862,0.000053314325,0.0004612013,0.00007014107,0.022800833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947995,0.00010128693,0.000034154116,0.00015177674,0.00012407402,0.00010881113],"domain_scores_gemma":[0.9967746,0.0012822935,0.0005795851,0.00054309086,0.00042874966,0.0003916978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042453766,0.00035820488,0.00043975553,0.0013023589,0.0013413574,0.0023847122,0.0010244469,0.00081337936,0.015597348],"category_scores_gemma":[0.006114885,0.0003740441,0.00037509442,0.001101999,0.0015058474,0.0031807867,0.0018842948,0.001050613,0.0011428479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020366901,0.000049529488,0.0019278409,0.00011440366,0.000020130166,0.0003088448,0.0005156786,0.0065956265,0.0035408102,0.9584609,0.003299715,0.02496294],"study_design_scores_gemma":[0.00005108715,0.000052931577,0.0012240378,0.00005057283,0.000035769386,0.00071433006,0.00047758312,0.027633308,0.0034647975,0.952121,0.01415277,0.000021762224],"about_ca_topic_score_codex":0.002759905,"about_ca_topic_score_gemma":0.0030608883,"teacher_disagreement_score":0.015597348,"about_ca_system_score_codex":0.0011327605,"about_ca_system_score_gemma":0.0005921904,"threshold_uncertainty_score":0.052178323},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.042413865062384294,"score_gpt":0.28400207813885303,"score_spread":0.24158821307646874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W168516241","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44727993,0.0036939443,0.16712843,0.0059303516,0.0006430699,0.00011865516,0.0010000113,0.0006659101,0.37353972],"genre_scores_gemma":[0.9664374,0.0008183502,0.016779987,0.0004162186,0.00023872558,0.00018263377,0.00020009677,0.00006660729,0.01486002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990282,0.00036458997,0.000049223032,0.00017060128,0.00026508045,0.00012227069],"domain_scores_gemma":[0.99333376,0.0042824117,0.00068713585,0.00047827337,0.0005306044,0.0006877717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016273073,0.00038491574,0.00047311548,0.0024196415,0.0015134593,0.002890991,0.00096408365,0.00089372107,0.009532367],"category_scores_gemma":[0.00906889,0.00040063876,0.00036304197,0.0009391467,0.0027322958,0.0062009688,0.0016316382,0.0017558158,0.0009157329],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002160165,0.000010028787,0.00014569487,0.00003091636,0.0000033350905,0.000014731369,0.000054420656,0.00040615138,0.0002701359,0.9947978,0.0016258656,0.00261925],"study_design_scores_gemma":[0.000009653985,0.000008356031,0.00017997815,0.00001673242,0.000005464509,0.00009645285,0.000051773477,0.004458227,0.00033386645,0.99179685,0.0030363118,0.000006275639],"about_ca_topic_score_codex":0.00044766627,"about_ca_topic_score_gemma":0.0008250952,"teacher_disagreement_score":0.009532367,"about_ca_system_score_codex":0.0012372077,"about_ca_system_score_gemma":0.00059878547,"threshold_uncertainty_score":0.031888902},"labels":[],"label_agreement":null},{"id":"W168997024","doi":"","title":"The Greedy Algorithm for Domination in Cubic Graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Greedy algorithm; Mathematics; Cubic graph; Combinatorics; Algorithm; Graph; Line graph","score_opus":0.013345152088701713,"score_gpt":0.2831954101280781,"score_spread":0.26985025803937635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W168997024","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06726803,0.0022131908,0.8363113,0.0031728777,0.0004463732,0.00047057195,0.0013374178,0.0048012626,0.08397894],"genre_scores_gemma":[0.42535463,0.0013571717,0.52983224,0.0009154133,0.00023824854,0.0004859677,0.0019826146,0.0010258695,0.038807828],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915314,0.00020740637,0.00003351304,0.000121760924,0.000244232,0.00023996312],"domain_scores_gemma":[0.9981254,0.00091272016,0.000096613076,0.00045648654,0.00023136787,0.00017744041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090145966,0.00068891695,0.0006532983,0.0010730262,0.0015769611,0.0016684129,0.0018340207,0.0011317137,0.009187823],"category_scores_gemma":[0.005542916,0.0004351286,0.0007203261,0.0019013063,0.0012480457,0.0027749173,0.0024751942,0.0018394013,0.0029969267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089470367,0.00023822534,0.0023080006,0.00054904114,0.000116348165,0.00018860449,0.00056400953,0.057452075,0.007482063,0.28643543,0.090984434,0.55278695],"study_design_scores_gemma":[0.00048042074,0.00014202522,0.0011006986,0.00011312359,0.00010239337,0.00037542052,0.0002843535,0.3698775,0.006496727,0.5749624,0.045998912,0.000066092034],"about_ca_topic_score_codex":0.010100346,"about_ca_topic_score_gemma":0.01612563,"teacher_disagreement_score":0.010100346,"about_ca_system_score_codex":0.0019101014,"about_ca_system_score_gemma":0.0043693674,"threshold_uncertainty_score":0.030736327},"labels":[],"label_agreement":null},{"id":"W168999955","doi":"","title":"Re-Orienting Tournaments by Pushing Vertices.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01699630069008094,"score_gpt":0.26567149618206587,"score_spread":0.24867519549198494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W168999955","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24275978,0.0011488212,0.64152056,0.001227077,0.0014684807,0.0005153918,0.0004565004,0.0026463503,0.1082571],"genre_scores_gemma":[0.7647823,0.00063576654,0.19303212,0.0004812203,0.00018999145,0.00029156607,0.0005516408,0.0004952687,0.039540138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992526,0.00022314748,0.00004121067,0.0001842176,0.000133093,0.00016568923],"domain_scores_gemma":[0.9979328,0.0007811497,0.00019083667,0.00052166695,0.00015432142,0.00041925034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073547853,0.0008731609,0.0008988814,0.00073224615,0.0011685587,0.0021452939,0.0015462819,0.0012239331,0.014157332],"category_scores_gemma":[0.0053409203,0.00053663075,0.0009422725,0.0008117027,0.0010067846,0.0022864572,0.002342721,0.0017329545,0.002721776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00093012134,0.0004606244,0.0024062279,0.0005504746,0.00023126103,0.000770955,0.0008478925,0.08124675,0.027671862,0.54920024,0.0321081,0.30357546],"study_design_scores_gemma":[0.00039598206,0.0005695525,0.0015139685,0.00015140948,0.0001920618,0.00070684095,0.00061972655,0.27023825,0.009776318,0.6549405,0.06079788,0.00009759001],"about_ca_topic_score_codex":0.0011010235,"about_ca_topic_score_gemma":0.0020371645,"teacher_disagreement_score":0.014157332,"about_ca_system_score_codex":0.0004537044,"about_ca_system_score_gemma":0.00044962435,"threshold_uncertainty_score":0.047360957},"labels":[],"label_agreement":null},{"id":"W169044707","doi":"","title":"Laplacian Eigenvalues and the Excess of a Graph.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Graph; Laplace operator; Laplacian matrix; Combinatorics; Mathematical analysis; Physics","score_opus":0.03011903369141844,"score_gpt":0.2670818628958165,"score_spread":0.23696282920439804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W169044707","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62346065,0.0048165033,0.12663797,0.006761159,0.0010087856,0.00003478105,0.0006576499,0.00069326727,0.2359293],"genre_scores_gemma":[0.9729279,0.0013098874,0.006852129,0.00034098234,0.0005052072,0.000032900272,0.00015604321,0.00009818891,0.017776657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996573,0.000079848345,0.000012519002,0.000056267134,0.00012972129,0.000064296844],"domain_scores_gemma":[0.99852365,0.00065659836,0.0002084198,0.00012963203,0.00020059789,0.00028113864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044439497,0.00050570763,0.0005280388,0.0025905936,0.00079761,0.0017715271,0.0007226532,0.0008203467,0.009601569],"category_scores_gemma":[0.0035166228,0.00024044632,0.00027139875,0.0009363287,0.001557708,0.0024528448,0.0011929031,0.0010974,0.0014083025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027810755,0.000015337771,0.0002960116,0.000034072174,0.000006597373,0.00009645054,0.00008675844,0.0013140035,0.0015515743,0.98791414,0.0027574128,0.0058998466],"study_design_scores_gemma":[0.000008561821,0.000009533956,0.00038944973,0.000014197372,0.0000056034837,0.0001946793,0.000092182745,0.0108386045,0.00038236502,0.985294,0.0027616203,0.000009344828],"about_ca_topic_score_codex":0.0005648287,"about_ca_topic_score_gemma":0.00090880966,"teacher_disagreement_score":0.009601569,"about_ca_system_score_codex":0.0006567576,"about_ca_system_score_gemma":0.00025887278,"threshold_uncertainty_score":0.032120407},"labels":[],"label_agreement":null},{"id":"W1693775031","doi":"","title":"Cubic 1-fault-tolerant hamiltonian graphs, Globally 3*-connected graphs, and Super 3-spanning connected graphs","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chordal graph; Indifference graph; Pancyclic graph; Combinatorics; 1-planar graph; Pathwidth; Maximal independent set; Discrete mathematics; Graph; Line graph","score_opus":0.008639259654158413,"score_gpt":0.21023155357091586,"score_spread":0.20159229391675745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1693775031","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81224656,0.0006531113,0.12731297,0.0014885634,0.00018353426,0.00007236626,0.00068237016,0.0005915206,0.056768965],"genre_scores_gemma":[0.9773473,0.00025484792,0.013863053,0.0002954788,0.000045681696,0.000034440385,0.0003773831,0.00005573293,0.0077261855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99979025,0.000029662646,0.000009617844,0.000047856673,0.00006188432,0.000060790237],"domain_scores_gemma":[0.9991357,0.00022140295,0.00023975695,0.0001376916,0.00012479015,0.00014073403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001667189,0.0002793012,0.00041559362,0.0006945206,0.0010796068,0.0008294122,0.0008841854,0.00058639806,0.005784386],"category_scores_gemma":[0.0009777648,0.00021902818,0.00033081186,0.001179639,0.00067330827,0.0012583721,0.0008617649,0.0010510014,0.00036600814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000503178,0.00016542409,0.003487518,0.00037029214,0.00005442376,0.0011350039,0.00083905103,0.09155022,0.026079303,0.78180623,0.01197501,0.08203443],"study_design_scores_gemma":[0.00008051076,0.0001254674,0.0032979033,0.000037515827,0.00004451496,0.00069246575,0.00054040743,0.13442,0.0070428634,0.8431537,0.010525971,0.000038824455],"about_ca_topic_score_codex":0.0030156935,"about_ca_topic_score_gemma":0.0059611257,"teacher_disagreement_score":0.005784386,"about_ca_system_score_codex":0.00083161064,"about_ca_system_score_gemma":0.0005767104,"threshold_uncertainty_score":0.019350708},"labels":[],"label_agreement":null},{"id":"W169464880","doi":"","title":"On the Constructions of New Families of Harmonious Graphs","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.01088924025084195,"score_gpt":0.2068556504035095,"score_spread":0.19596641015266755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W169464880","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33241203,0.0018263657,0.4990279,0.0032884208,0.0003348524,0.00016948032,0.0005043531,0.0011293921,0.16130728],"genre_scores_gemma":[0.8209191,0.0012806539,0.14482877,0.00084801426,0.00021707994,0.00033838002,0.00054984505,0.0004868213,0.030531367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861133,0.00061979255,0.00006174583,0.0002504558,0.0002476666,0.00020899264],"domain_scores_gemma":[0.9961688,0.0022071865,0.00025842662,0.0007790187,0.00024320919,0.00034338477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020721378,0.00053915265,0.00077318924,0.0023149455,0.0030460244,0.0028460557,0.0021081064,0.0014365318,0.0100090485],"category_scores_gemma":[0.004937093,0.0009533128,0.0012040747,0.0018271263,0.003489267,0.0074325716,0.0049275444,0.0027301332,0.001017856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017478873,0.000014938585,0.00015491089,0.000027075936,0.000005339292,0.00004103066,0.00024472867,0.0010804806,0.00041925977,0.99073505,0.001361197,0.0058986642],"study_design_scores_gemma":[0.000017472135,0.000014695317,0.00021345713,0.00002525977,0.0000120451605,0.0001585415,0.00024350987,0.008452322,0.00068892515,0.9792317,0.010924087,0.000017956892],"about_ca_topic_score_codex":0.00051781954,"about_ca_topic_score_gemma":0.00090396724,"teacher_disagreement_score":0.0100090485,"about_ca_system_score_codex":0.0014939678,"about_ca_system_score_gemma":0.00044317983,"threshold_uncertainty_score":0.033483624},"labels":[],"label_agreement":null},{"id":"W1696519303","doi":"","title":"On constant-multiple-free sets contained in random sets of integers","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Constant (computer programming); Combinatorics; Discrete mathematics; Computer science","score_opus":0.010923535846434093,"score_gpt":0.23044467487592826,"score_spread":0.21952113902949416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1696519303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4647998,0.0038106851,0.47110152,0.003791686,0.0003305841,0.00013870813,0.000782706,0.00049408,0.054750215],"genre_scores_gemma":[0.94440323,0.0013913243,0.041450318,0.00045602044,0.0005045145,0.0001778078,0.0005221426,0.00012710343,0.010967541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99609596,0.0011760102,0.0003423562,0.0006787156,0.0011228092,0.0005842065],"domain_scores_gemma":[0.96603996,0.026816979,0.0027428507,0.0018235848,0.0011119575,0.0014645972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048356038,0.0009808938,0.0029113768,0.0064224317,0.0037938068,0.008313356,0.0028556297,0.0017827285,0.0050253132],"category_scores_gemma":[0.027932998,0.0013645926,0.0026052226,0.0060732807,0.0070639895,0.012384181,0.0047969995,0.0036973082,0.00056942494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004206514,0.000011672204,0.00024822305,0.000039439023,0.000014363684,0.00006242044,0.00019026587,0.0016512072,0.00014014001,0.9954072,0.00030898987,0.0018840607],"study_design_scores_gemma":[0.000018197677,0.000009712493,0.00017597311,0.000022602453,0.000019416068,0.00007703387,0.000079240555,0.0077375066,0.00016940755,0.9908398,0.00083342183,0.000017830987],"about_ca_topic_score_codex":0.002178216,"about_ca_topic_score_gemma":0.0018178895,"teacher_disagreement_score":0.008313356,"about_ca_system_score_codex":0.0037247085,"about_ca_system_score_gemma":0.0011140847,"threshold_uncertainty_score":0.027024806},"labels":[],"label_agreement":null},{"id":"W16985043","doi":"10.1158/1055-9965.epi-06-0479","title":"Realizability of p-Point, q-Line Graphs with Prescribed Maximum Degree, and Point Connectivity.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Realizability; Mathematics; Degree (music); Point (geometry); Line (geometry); Combinatorics; Discrete mathematics; Algorithm; Geometry; Physics","score_opus":0.02517202750151202,"score_gpt":0.2729990411080596,"score_spread":0.2478270136065476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W16985043","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72757745,0.00038953248,0.20219746,0.0011221671,0.000048340982,0.00011974758,0.0014217653,0.0005332703,0.06659027],"genre_scores_gemma":[0.97904,0.00018130678,0.015480567,0.00006412549,0.00003033569,0.000064454856,0.0007580355,0.00005379835,0.004327262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995059,0.00013528393,0.000033345037,0.00013194382,0.00011277801,0.00008065024],"domain_scores_gemma":[0.997122,0.0015285059,0.0005054346,0.00037660205,0.0002097454,0.00025769637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050552597,0.0003368322,0.00036725274,0.00068923703,0.0010029031,0.002024944,0.00092646165,0.0011118498,0.0056075654],"category_scores_gemma":[0.0039730943,0.0004748357,0.0006870365,0.0007558704,0.0016318914,0.0035709129,0.0013961989,0.0013341766,0.00046842473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021598468,0.00007923983,0.002219448,0.00011037995,0.00003338774,0.0004382297,0.00050935673,0.020109864,0.0046937326,0.95864856,0.0021705627,0.010771248],"study_design_scores_gemma":[0.00007426038,0.00004794245,0.0010141061,0.000026575166,0.00002679065,0.00028656822,0.00028693522,0.03796336,0.0026816253,0.9550567,0.0025176418,0.000017518356],"about_ca_topic_score_codex":0.0019761578,"about_ca_topic_score_gemma":0.0027560664,"teacher_disagreement_score":0.0056075654,"about_ca_system_score_codex":0.0007488589,"about_ca_system_score_gemma":0.0004277721,"threshold_uncertainty_score":0.018759191},"labels":[],"label_agreement":null},{"id":"W170162790","doi":"","title":"Embeddings of Steiner Quadruple Systems.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Steiner tree problem; Combinatorics","score_opus":0.009033768621034338,"score_gpt":0.18489732337680154,"score_spread":0.1758635547557672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W170162790","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29212984,0.0021653082,0.38243246,0.0017702545,0.0008629305,0.00014070458,0.0020353917,0.00081880484,0.31764433],"genre_scores_gemma":[0.8513826,0.0013259541,0.085498214,0.00046483308,0.0002164323,0.00011336247,0.0020362972,0.00028343173,0.058678947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995919,0.000106464955,0.00002528774,0.00009593069,0.000097371434,0.000083103165],"domain_scores_gemma":[0.9991436,0.00026829855,0.00015487084,0.00016186037,0.00013697027,0.00013436074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018847693,0.00047573165,0.00036714235,0.0014454576,0.0011191709,0.002044746,0.0005781113,0.0008423233,0.016752893],"category_scores_gemma":[0.0017156065,0.00037701975,0.00041350664,0.0011366772,0.0008920629,0.0032403558,0.0020858063,0.0014361481,0.003671082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035856076,0.000027630826,0.00027215076,0.00006556006,0.000011300179,0.00016801615,0.00024101518,0.0020954155,0.0016966474,0.96658385,0.005995725,0.022806786],"study_design_scores_gemma":[0.000012313126,0.000027621327,0.00034401056,0.00004227637,0.00001066152,0.00039450108,0.0003499909,0.0077098343,0.0012940849,0.9601851,0.029615244,0.0000143598245],"about_ca_topic_score_codex":0.00048465177,"about_ca_topic_score_gemma":0.0007695628,"teacher_disagreement_score":0.016752893,"about_ca_system_score_codex":0.0006925397,"about_ca_system_score_gemma":0.00025860363,"threshold_uncertainty_score":0.056044042},"labels":[],"label_agreement":null},{"id":"W170351987","doi":"","title":"On (a, d)-antimagic special trees, unicyclic graphs, complete bipartite graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Complete bipartite graph; Discrete mathematics; Graph","score_opus":0.016626671985419415,"score_gpt":0.23001586720472073,"score_spread":0.2133891952193013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W170351987","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4724579,0.008453138,0.2872024,0.010713329,0.00065091974,0.0002198708,0.0039062446,0.0010574597,0.21533878],"genre_scores_gemma":[0.89442337,0.00542543,0.06792439,0.0015747787,0.00061372726,0.0002523035,0.0024643329,0.00021646704,0.027105195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991653,0.00029769994,0.000044863318,0.00018715864,0.00013535704,0.00016969242],"domain_scores_gemma":[0.99468625,0.0035523188,0.00055840344,0.0004929419,0.00021683423,0.0004932708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008186919,0.0006040864,0.0009383386,0.0021944009,0.0020779357,0.0032019385,0.0012704652,0.0019210093,0.0071132607],"category_scores_gemma":[0.004648967,0.0006321146,0.00062473014,0.00406549,0.002342866,0.0051824013,0.002668321,0.0019688208,0.0011961994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016122666,0.00008253191,0.0011276251,0.00027204186,0.000031619114,0.00015596281,0.0003486096,0.0062512103,0.0018273408,0.94448775,0.018656185,0.026597872],"study_design_scores_gemma":[0.00003107631,0.000018519066,0.00050026807,0.000052313622,0.000021534122,0.0002767831,0.0002105121,0.011403149,0.0005574473,0.9785019,0.008411426,0.000015025142],"about_ca_topic_score_codex":0.0020875481,"about_ca_topic_score_gemma":0.0035169518,"teacher_disagreement_score":0.0071132607,"about_ca_system_score_codex":0.0022893047,"about_ca_system_score_gemma":0.0007517045,"threshold_uncertainty_score":0.0237962},"labels":[],"label_agreement":null},{"id":"W170607195","doi":"","title":"Aperiodic Perfect Maps from de Bruijn Sequences.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Aperiodic graph; De Bruijn sequence; Mathematics; Combinatorics","score_opus":0.013655785243458417,"score_gpt":0.21469496949299977,"score_spread":0.20103918424954134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W170607195","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2460795,0.0077880365,0.25599232,0.003007437,0.0021458482,0.00019487375,0.0016919594,0.0009896605,0.48211032],"genre_scores_gemma":[0.87295645,0.0028020102,0.035520032,0.0006992637,0.00090636377,0.00013477149,0.0009061123,0.0003416266,0.08573332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991561,0.00018601063,0.00006231936,0.00015870098,0.00028422696,0.00015267788],"domain_scores_gemma":[0.9983157,0.0007962571,0.00025241767,0.0002861478,0.00018122436,0.00016825645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055722665,0.0006607692,0.00050196,0.002104183,0.0014667029,0.0028705865,0.00058299,0.0007956905,0.010726062],"category_scores_gemma":[0.0038863886,0.00049588253,0.00043702833,0.0013003281,0.0014626406,0.004300756,0.0024438784,0.0017395888,0.003210985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044349545,0.000018304869,0.00010802268,0.000055287146,0.000006956503,0.00015385085,0.00017908355,0.00084194285,0.0013628338,0.98248166,0.0025584823,0.012189329],"study_design_scores_gemma":[0.0000106028965,0.00001846959,0.0001207202,0.000038471102,0.0000063589446,0.00034886668,0.00007344506,0.001985989,0.0019071331,0.9711231,0.024350926,0.000015840043],"about_ca_topic_score_codex":0.00035832662,"about_ca_topic_score_gemma":0.00045853952,"teacher_disagreement_score":0.010726062,"about_ca_system_score_codex":0.00069984724,"about_ca_system_score_gemma":0.000612964,"threshold_uncertainty_score":0.035882235},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; MAGIC (telescope); Enhanced Data Rates for GSM Evolution; Combinatorics; Astronomy; Computer science; Physics; Artificial intelligence","score_opus":0.015606070929740546,"score_gpt":0.21197879182458984,"score_spread":0.1963727208948493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W170650356","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2775422,0.005861848,0.36524537,0.008853268,0.0007813364,0.00014736613,0.0024473027,0.0009765214,0.33814478],"genre_scores_gemma":[0.8140297,0.0035464137,0.12307743,0.0020988532,0.0006203968,0.00023111519,0.0025445777,0.0003862273,0.05346533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989706,0.0003472818,0.00004480998,0.0002025924,0.00022759424,0.00020712003],"domain_scores_gemma":[0.99612755,0.0022431768,0.00036426575,0.00059391523,0.0002707747,0.0004003329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010272944,0.0005788096,0.0007692746,0.0020162428,0.0020280888,0.002621658,0.0015799587,0.0014994893,0.014829956],"category_scores_gemma":[0.004453626,0.0005382138,0.0006361536,0.0026058645,0.0024596364,0.008294622,0.002898678,0.0027579947,0.0018354616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047825135,0.000024925332,0.0003619155,0.00009514139,0.000008932862,0.000039200488,0.000109280685,0.0019075109,0.0005551639,0.97267115,0.008775023,0.015403877],"study_design_scores_gemma":[0.000011054833,0.000006715815,0.0002103088,0.000026879608,0.0000068882077,0.00008286888,0.000094541894,0.006228698,0.00039031333,0.9854252,0.007509677,0.000007000212],"about_ca_topic_score_codex":0.0015210666,"about_ca_topic_score_gemma":0.0031766316,"teacher_disagreement_score":0.014829956,"about_ca_system_score_codex":0.0016362095,"about_ca_system_score_gemma":0.0007049382,"threshold_uncertainty_score":0.04961115},"labels":[],"label_agreement":null},{"id":"W170880581","doi":"","title":"On geometric lattices and matroids of arbitrary cardinality.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cardinality (data modeling); Matroid; Mathematics; Combinatorics; Discrete mathematics; Computer science","score_opus":0.008565139494594108,"score_gpt":0.22572710296828427,"score_spread":0.21716196347369016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W170880581","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22516055,0.016094448,0.33842677,0.015704986,0.0018275701,0.00014955564,0.0018839936,0.00065924326,0.40009278],"genre_scores_gemma":[0.81102127,0.008787735,0.091171056,0.0022307676,0.003345676,0.00020396672,0.0017092035,0.0003774925,0.08115293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980167,0.00069749466,0.00012824345,0.0003237832,0.0005321585,0.0003015543],"domain_scores_gemma":[0.9947284,0.002772745,0.0007232107,0.0006611169,0.00047256076,0.0006420249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016859559,0.00089098874,0.0011746689,0.0027810703,0.0026603914,0.0048422744,0.0013773424,0.0017352543,0.0103557175],"category_scores_gemma":[0.0073693683,0.00089825084,0.0012228079,0.0032256974,0.006185625,0.015391334,0.0049095834,0.0049758935,0.002169506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002257603,0.0000149041525,0.00018923043,0.000039793293,0.000007747422,0.00006682509,0.00013868047,0.0007848636,0.00019627504,0.9919001,0.0026881641,0.0039508673],"study_design_scores_gemma":[0.000005453941,0.000006274622,0.000105801984,0.000014010732,0.0000038208645,0.000100779,0.00006438965,0.0014623982,0.00007334828,0.99478275,0.0033749624,0.0000059763897],"about_ca_topic_score_codex":0.001528,"about_ca_topic_score_gemma":0.0023524987,"teacher_disagreement_score":0.0103557175,"about_ca_system_score_codex":0.0023553832,"about_ca_system_score_gemma":0.00072319125,"threshold_uncertainty_score":0.034643292},"labels":[],"label_agreement":null},{"id":"W170974329","doi":"","title":"Integral Sum Graphs from a Class of Trees.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Class (philosophy); Combinatorics; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.011341590645950864,"score_gpt":0.21981387207467037,"score_spread":0.2084722814287195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W170974329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34145567,0.0027645943,0.3572256,0.0039854487,0.00057443464,0.00012655278,0.0016982636,0.0013036825,0.29086578],"genre_scores_gemma":[0.87096953,0.0014989224,0.07573577,0.00089288276,0.0005840621,0.00011942891,0.0019140888,0.000510078,0.047775302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993381,0.00012879075,0.00003271468,0.0001681758,0.00020647624,0.00012572527],"domain_scores_gemma":[0.9976841,0.0011649205,0.00021854104,0.00040109883,0.00021319433,0.0003180378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005700893,0.00044167816,0.00077278004,0.0018707489,0.002310738,0.004144191,0.001340337,0.0011358935,0.0126691535],"category_scores_gemma":[0.0038138668,0.0004857738,0.0006808216,0.001990023,0.001798114,0.0060534896,0.0031203434,0.0032283051,0.0015607293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026914759,0.000019823001,0.00022021335,0.000041421474,0.000005461936,0.000041055686,0.00010916707,0.00081317755,0.0006711476,0.9844956,0.0031770824,0.010378956],"study_design_scores_gemma":[0.0000064198116,0.0000055693954,0.00020155284,0.000016112923,0.000009608389,0.00017801588,0.000075194876,0.004845709,0.00072354043,0.9848455,0.009086753,0.000006038797],"about_ca_topic_score_codex":0.0006515687,"about_ca_topic_score_gemma":0.0009895726,"teacher_disagreement_score":0.0126691535,"about_ca_system_score_codex":0.0011949064,"about_ca_system_score_gemma":0.00053856306,"threshold_uncertainty_score":0.04238254},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Physics","score_opus":0.013472682030766093,"score_gpt":0.27525342787879337,"score_spread":0.2617807458480273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W170988298","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19790454,0.007245213,0.40298933,0.0030175264,0.00071197527,0.00023222355,0.00219349,0.0009846768,0.384721],"genre_scores_gemma":[0.8378149,0.0027439585,0.053648293,0.00067500246,0.00033660507,0.00022257106,0.0016428157,0.00023264157,0.10268324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989743,0.00026693477,0.00007762328,0.0002730998,0.00021559719,0.00019243888],"domain_scores_gemma":[0.9981495,0.0009554525,0.00016130366,0.00020628888,0.00027774484,0.000249686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078712124,0.00058188837,0.00052925845,0.0018679429,0.0023640539,0.0034229397,0.0005209831,0.0006250794,0.011866554],"category_scores_gemma":[0.002935567,0.00057131215,0.00070925796,0.002437936,0.0021333953,0.0043807435,0.0021620968,0.0011931749,0.0014080127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004499816,0.0000142608005,0.00061634986,0.000096813674,0.000013556535,0.00024524843,0.00088469504,0.0010421958,0.0009402211,0.9588364,0.00352021,0.033744976],"study_design_scores_gemma":[0.000014978896,0.000021936125,0.0005088921,0.00004879811,0.000020712117,0.00047859954,0.00033868724,0.005591355,0.0011090548,0.9429004,0.048946388,0.000020184547],"about_ca_topic_score_codex":0.003174013,"about_ca_topic_score_gemma":0.0062027024,"teacher_disagreement_score":0.011866554,"about_ca_system_score_codex":0.0022267469,"about_ca_system_score_gemma":0.001000994,"threshold_uncertainty_score":0.039697528},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.012070815635474404,"score_gpt":0.2810397959182403,"score_spread":0.2689689802827659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W171110949","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8587462,0.0010804293,0.09036533,0.0013003029,0.00015813942,0.00007220051,0.0014861273,0.00038939936,0.04640187],"genre_scores_gemma":[0.98503256,0.0004911939,0.007759345,0.00007277553,0.00012606014,0.000068540656,0.0004583662,0.000071391616,0.0059196907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988702,0.00023908324,0.00007583698,0.00027392892,0.00033087892,0.00021002158],"domain_scores_gemma":[0.994514,0.002756738,0.0006726343,0.00074691465,0.00059183885,0.0007178937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011247869,0.0004792132,0.0008637065,0.0034354646,0.001546672,0.004300762,0.0019015209,0.001163638,0.008759669],"category_scores_gemma":[0.0074428646,0.0005066975,0.0007817523,0.0019040927,0.0031431883,0.008065824,0.0017999627,0.0010824476,0.00079115405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014791594,0.000038944076,0.0034723901,0.00014616548,0.000059262566,0.000100205645,0.0002873108,0.002986386,0.0035520552,0.9703129,0.002642411,0.016254153],"study_design_scores_gemma":[0.000021799904,0.000029212724,0.002437531,0.000031091564,0.00004929255,0.00050588965,0.0002637063,0.016622266,0.0023648164,0.97449625,0.0031572364,0.000020975262],"about_ca_topic_score_codex":0.00049068034,"about_ca_topic_score_gemma":0.00061933405,"teacher_disagreement_score":0.008759669,"about_ca_system_score_codex":0.0011273748,"about_ca_system_score_gemma":0.0004843825,"threshold_uncertainty_score":0.029304028},"labels":[],"label_agreement":null},{"id":"W1712011956","doi":"","title":"Pancyclicity, Panconnectivity, and Panpositionability for General Graphs and Bipartite Graphs","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Combinatorics; Cograph; Chordal graph; 1-planar graph; Graph","score_opus":0.02047042098494921,"score_gpt":0.2928000782790482,"score_spread":0.27232965729409897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1712011956","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8338588,0.0015720018,0.10461727,0.002468151,0.00012978916,0.00012576967,0.0011378778,0.0002752039,0.05581511],"genre_scores_gemma":[0.97455615,0.0012982114,0.015601456,0.00030512217,0.00026232432,0.000109356806,0.00088295847,0.00007385676,0.0069105346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986601,0.00025906603,0.00009072745,0.00040749653,0.00034919239,0.0002334294],"domain_scores_gemma":[0.9878973,0.0068991003,0.0021174971,0.0014310265,0.00065703504,0.0009981147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089906086,0.00076634577,0.00096178864,0.0024054023,0.002398864,0.0031972954,0.0016530708,0.0013987867,0.007703385],"category_scores_gemma":[0.007731959,0.0009014996,0.0009938291,0.0043705,0.0037812218,0.0063144662,0.002524835,0.0028003503,0.0003988196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044977764,0.0001667582,0.007813705,0.00037595458,0.00008542946,0.0009930147,0.0014545969,0.011899308,0.0057712486,0.92836535,0.0053025982,0.037322298],"study_design_scores_gemma":[0.000048812566,0.00005016388,0.0026005069,0.000030563082,0.00006715621,0.00079158606,0.0002763585,0.017775062,0.0013981968,0.97389936,0.0030272347,0.00003505592],"about_ca_topic_score_codex":0.0018933916,"about_ca_topic_score_gemma":0.002937557,"teacher_disagreement_score":0.007703385,"about_ca_system_score_codex":0.0009710552,"about_ca_system_score_gemma":0.0006487469,"threshold_uncertainty_score":0.025770426},"labels":[],"label_agreement":null},{"id":"W171333665","doi":"","title":"A Note on Distance-Regular Graphs with Girth 3.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Girth (graph theory); Odd graph; Combinatorics; Discrete mathematics; Graph; Chordal graph; 1-planar graph","score_opus":0.0038080119001334136,"score_gpt":0.17997172265771003,"score_spread":0.1761637107575766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W171333665","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04796953,0.038731534,0.3651722,0.04184823,0.02857422,0.00016621439,0.0011095759,0.0018001033,0.4746284],"genre_scores_gemma":[0.5514503,0.054179665,0.23159121,0.020268079,0.023273801,0.0002643114,0.0011308319,0.0012193114,0.11662244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919945,0.00022007692,0.00003905397,0.00016743064,0.0002760688,0.00009792499],"domain_scores_gemma":[0.9963349,0.0024928602,0.0001474387,0.0005042016,0.00026755355,0.0002530321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094329694,0.0009828227,0.0009351983,0.0016221512,0.0018718748,0.001941755,0.0019511759,0.0014223136,0.010788612],"category_scores_gemma":[0.0046956455,0.00043036405,0.00089745177,0.0021184685,0.00273914,0.0053230757,0.0028130275,0.0048603965,0.0032211565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001316111,0.00008043522,0.0006123115,0.0005082305,0.000056782676,0.0010648804,0.00039300098,0.004442269,0.0034268955,0.834622,0.08973123,0.06493038],"study_design_scores_gemma":[0.00000981054,0.000043192817,0.00042248002,0.00006813282,0.000022915174,0.00073444634,0.00011444853,0.0031816482,0.00096822635,0.89187557,0.102528244,0.000030966934],"about_ca_topic_score_codex":0.0013467176,"about_ca_topic_score_gemma":0.002498171,"teacher_disagreement_score":0.010788612,"about_ca_system_score_codex":0.0010327711,"about_ca_system_score_gemma":0.00056446483,"threshold_uncertainty_score":0.036091506},"labels":[],"label_agreement":null},{"id":"W171577813","doi":"","title":"Decomposing complete graphs into isomorphic subgraphs with six vertices and seven edges.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.00617502743079777,"score_gpt":0.18179463751196306,"score_spread":0.1756196100811653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W171577813","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10609839,0.0010929616,0.7841592,0.0008980569,0.0002753354,0.000338638,0.0014514893,0.00094762206,0.10473832],"genre_scores_gemma":[0.57973677,0.0012274389,0.38059714,0.000719844,0.00019433428,0.00027510585,0.004811621,0.000388331,0.032049406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995247,0.00014566508,0.000022236187,0.00010985086,0.000118983655,0.000078464276],"domain_scores_gemma":[0.9989951,0.00030014856,0.000113927126,0.0003395943,0.0001586745,0.000092577146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035637608,0.00059290376,0.00040628834,0.0013241936,0.0006148041,0.0012399914,0.00071453786,0.0005617461,0.00917013],"category_scores_gemma":[0.0019546668,0.0002724776,0.00072750077,0.001196309,0.0007414229,0.002490573,0.0012654038,0.0009595978,0.0015423973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002707851,0.00019007287,0.0015597354,0.0004148143,0.000113443246,0.0007802385,0.000463072,0.03178596,0.016126148,0.7522932,0.01860086,0.17740172],"study_design_scores_gemma":[0.000043142718,0.000049312694,0.0011468608,0.00007181471,0.000066385335,0.0005799054,0.00045710508,0.04864518,0.0055261347,0.9110531,0.032341253,0.000019690446],"about_ca_topic_score_codex":0.0016353606,"about_ca_topic_score_gemma":0.003463269,"teacher_disagreement_score":0.00917013,"about_ca_system_score_codex":0.00053790386,"about_ca_system_score_gemma":0.0006824674,"threshold_uncertainty_score":0.0306772},"labels":[],"label_agreement":null},{"id":"W171736474","doi":"","title":"Partioning A Bipartite Graph into Vertex-Disjoint Paths.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Combinatorics; Complete bipartite graph; Disjoint sets; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.011712075852797465,"score_gpt":0.2598653087767702,"score_spread":0.24815323292397276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W171736474","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11044836,0.0007826248,0.818609,0.00070822565,0.00020366749,0.00037042162,0.0014166548,0.0017969309,0.06566418],"genre_scores_gemma":[0.51700234,0.0010856217,0.4124309,0.0007110439,0.00020915442,0.00054406165,0.0037049418,0.0009436534,0.06336828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891794,0.00039746464,0.000048671107,0.00026339322,0.00017305504,0.00019947332],"domain_scores_gemma":[0.996366,0.0017181828,0.0002392292,0.0011077238,0.00029556442,0.00027326538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007595573,0.0007363864,0.0005538036,0.0013165327,0.0014584007,0.001297363,0.0010223775,0.00073849043,0.013417287],"category_scores_gemma":[0.004257309,0.0006715184,0.00088837143,0.0022652142,0.0011561067,0.00292942,0.0024910602,0.0014244167,0.0037019923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079388014,0.00028636528,0.0019554954,0.00079286325,0.00020010183,0.000722486,0.0015773427,0.056586675,0.032645456,0.67666125,0.033327874,0.19445026],"study_design_scores_gemma":[0.00008300847,0.00016378863,0.0013490892,0.00013136708,0.00014313664,0.0005324652,0.00051163987,0.13523766,0.013401066,0.8025671,0.045833968,0.000045790286],"about_ca_topic_score_codex":0.0018568248,"about_ca_topic_score_gemma":0.004143553,"teacher_disagreement_score":0.013417287,"about_ca_system_score_codex":0.00057316956,"about_ca_system_score_gemma":0.00070204434,"threshold_uncertainty_score":0.044885278},"labels":[],"label_agreement":null},{"id":"W172001932","doi":"","title":"An Efficient Algorithm for Cyclic Edge Connectivity of Regular Graphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Enhanced Data Rates for GSM Evolution; Mathematics; Algorithm; Computer science; Artificial intelligence","score_opus":0.01060679274702316,"score_gpt":0.24529651187151613,"score_spread":0.23468971912449296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W172001932","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053085096,0.0008761409,0.9042123,0.0010018414,0.0002358145,0.0007697657,0.0015676667,0.009750132,0.02850129],"genre_scores_gemma":[0.22444768,0.00038619124,0.75850487,0.00028845423,0.00010855891,0.00080087216,0.0041042566,0.00081027584,0.010548849],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992423,0.00017649255,0.00005052051,0.00017861013,0.00020510527,0.00014697477],"domain_scores_gemma":[0.99779797,0.0010243283,0.00012916983,0.00061849324,0.00030289774,0.00012728336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060583313,0.0009889874,0.00078189827,0.0015226194,0.0011532876,0.0015627666,0.0022652445,0.0014391786,0.012913287],"category_scores_gemma":[0.005187943,0.0005413515,0.00067793846,0.002441326,0.0007448544,0.0027680274,0.002587673,0.0010912364,0.0031247712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007516216,0.0004520018,0.0016144781,0.0006374573,0.00011436365,0.00036014192,0.00044404736,0.060139086,0.012786265,0.086453676,0.083526544,0.75272036],"study_design_scores_gemma":[0.0006460892,0.00031433714,0.0010449002,0.00010659561,0.0001339533,0.0006724334,0.00030919773,0.6794746,0.0143574,0.25830048,0.044562202,0.000077798635],"about_ca_topic_score_codex":0.0042118547,"about_ca_topic_score_gemma":0.0072988244,"teacher_disagreement_score":0.012913287,"about_ca_system_score_codex":0.0012356596,"about_ca_system_score_gemma":0.002387986,"threshold_uncertainty_score":0.04319924},"labels":[],"label_agreement":null},{"id":"W172056098","doi":"","title":"Average degrees of critical graphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.028509372284495956,"score_gpt":0.30911033749573535,"score_spread":0.2806009652112394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W172056098","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76133084,0.0033521927,0.12628731,0.0029407376,0.0003948118,0.00007284489,0.0027576305,0.0005839068,0.10227973],"genre_scores_gemma":[0.986278,0.0009684609,0.006158654,0.00017519653,0.00027316174,0.000044019394,0.00063994696,0.00009731618,0.005365356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994066,0.0001344866,0.00002219041,0.0001417128,0.00014554901,0.00014944332],"domain_scores_gemma":[0.9937325,0.003251007,0.000775741,0.00057557586,0.0006795851,0.0009856442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087163394,0.00057910755,0.00076038577,0.004182502,0.0012858221,0.002736795,0.0012245366,0.0008187379,0.008040544],"category_scores_gemma":[0.010368215,0.00043553798,0.00042759575,0.0016952254,0.0017346416,0.0044498453,0.0012706624,0.0012251018,0.00088665436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001514671,0.000035879522,0.0035549367,0.00016483439,0.00004135032,0.00010358111,0.00033526198,0.009288937,0.0028288527,0.95684767,0.0088786585,0.017768549],"study_design_scores_gemma":[0.00001850381,0.000019749194,0.0019873232,0.00003455276,0.000027139684,0.00026476392,0.00019711419,0.017420702,0.0017391369,0.9730987,0.0051776334,0.000014764909],"about_ca_topic_score_codex":0.0010550538,"about_ca_topic_score_gemma":0.0016941121,"teacher_disagreement_score":0.008040544,"about_ca_system_score_codex":0.0014190469,"about_ca_system_score_gemma":0.00046388037,"threshold_uncertainty_score":0.026898324},"labels":[],"label_agreement":null},{"id":"W172066816","doi":"","title":"New Conditions for k-ordered Hamiltonian Graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Wheel graph; Hamiltonian path; Hamiltonian (control theory); Path graph; Graph; Discrete mathematics; Graph power; Line graph","score_opus":0.017926935948161738,"score_gpt":0.2960958785239048,"score_spread":0.27816894257574304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W172066816","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21337518,0.0017950734,0.33818233,0.006935821,0.002787754,0.000735167,0.005070014,0.0020996514,0.429019],"genre_scores_gemma":[0.8587178,0.00152374,0.10245685,0.002183927,0.0010762251,0.0007694424,0.004424471,0.0005804019,0.028267162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985619,0.0002758743,0.00015536127,0.00028138867,0.00036708332,0.00035834324],"domain_scores_gemma":[0.9929724,0.0027892303,0.0009036352,0.00065723713,0.0011202799,0.0015572069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010963446,0.00075967744,0.0006035753,0.0020852676,0.0024473113,0.0022848381,0.00136913,0.0022626605,0.030464046],"category_scores_gemma":[0.009367582,0.0007561888,0.0008326965,0.0013574027,0.002263187,0.008269372,0.0029648424,0.003136966,0.0049327584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020950769,0.00009177169,0.0010457558,0.00023669278,0.000013399613,0.00089988724,0.00044399942,0.0024596844,0.005175603,0.9657638,0.013331822,0.010328181],"study_design_scores_gemma":[0.00014514309,0.00010557462,0.0012088229,0.00010996842,0.000032557517,0.0014312594,0.00081515283,0.013948242,0.0047986377,0.93749523,0.039836008,0.00007341562],"about_ca_topic_score_codex":0.0014371421,"about_ca_topic_score_gemma":0.002479367,"teacher_disagreement_score":0.030464046,"about_ca_system_score_codex":0.0012116751,"about_ca_system_score_gemma":0.0010984888,"threshold_uncertainty_score":0.10191244},"labels":[],"label_agreement":null},{"id":"W172494826","doi":"","title":"Maximum Number of Contractible Edges on Longest Cycles of a 3-Connected Graph.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Contractible space; Mathematics; Combinatorics; Graph","score_opus":0.013649292137118964,"score_gpt":0.25014681230987906,"score_spread":0.2364975201727601,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W172494826","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9272417,0.00095418503,0.032656424,0.0008357264,0.000107459266,0.000089748675,0.0033339525,0.00022685972,0.03455402],"genre_scores_gemma":[0.9613866,0.0006389826,0.026703494,0.0001407664,0.00006715023,0.0001204851,0.0017396443,0.0000902482,0.009112651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957305,0.00009034566,0.000037128702,0.00009288298,0.00009091706,0.00011556918],"domain_scores_gemma":[0.99646086,0.0017093007,0.00055881427,0.0002872357,0.00034670957,0.0006370743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039477053,0.0004846707,0.00045414423,0.0010778018,0.0013144767,0.0014608268,0.00097340695,0.0010911557,0.009822915],"category_scores_gemma":[0.0030798758,0.00037579972,0.0004622573,0.00092227635,0.0008457268,0.0020123331,0.0008402566,0.00058011134,0.0008533449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037853369,0.0004088105,0.021800358,0.0022553569,0.00035927325,0.0020088956,0.0019102917,0.050078645,0.11688714,0.58424836,0.027403574,0.18885393],"study_design_scores_gemma":[0.00029442928,0.0005055237,0.019886624,0.00044540947,0.00031812256,0.0030691547,0.0014999163,0.079339296,0.048051514,0.794139,0.052305017,0.00014600098],"about_ca_topic_score_codex":0.00087409274,"about_ca_topic_score_gemma":0.0021000477,"teacher_disagreement_score":0.009822915,"about_ca_system_score_codex":0.0005780562,"about_ca_system_score_gemma":0.00057122036,"threshold_uncertainty_score":0.032860875},"labels":[],"label_agreement":null},{"id":"W172597931","doi":"","title":"On Variations of Graceful Labelings.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arithmetic","score_opus":0.01532837856312311,"score_gpt":0.22334579723664702,"score_spread":0.2080174186735239,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W172597931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16436256,0.0047791377,0.505286,0.005286304,0.0014313088,0.00017261192,0.0018197042,0.0030227425,0.31383973],"genre_scores_gemma":[0.78505176,0.0029550446,0.13032725,0.0021390151,0.0013350873,0.0002941481,0.0018856087,0.001822707,0.07418935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984982,0.00043787388,0.00007255178,0.00038365382,0.00036902403,0.0002386926],"domain_scores_gemma":[0.9964715,0.0014781373,0.00033618242,0.0010643197,0.00022790278,0.00042190737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013168894,0.0009238291,0.0008423377,0.0020386474,0.002156566,0.0026806174,0.0019473308,0.0013101702,0.013868266],"category_scores_gemma":[0.0062273038,0.0005313293,0.0010418018,0.0027635496,0.003654448,0.0060459143,0.0041080248,0.0040525515,0.0024381774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003995561,0.00001920927,0.00016359365,0.00003722419,0.0000076171727,0.000031225427,0.000104873914,0.0027729087,0.00047640415,0.9773526,0.005686992,0.013307378],"study_design_scores_gemma":[0.000009848278,0.0000122166575,0.00013241563,0.000017710781,0.000008450408,0.000054074593,0.00003375663,0.006694652,0.00033570733,0.9806224,0.012066807,0.000011788813],"about_ca_topic_score_codex":0.0026023681,"about_ca_topic_score_gemma":0.0036240884,"teacher_disagreement_score":0.013868266,"about_ca_system_score_codex":0.0023793958,"about_ca_system_score_gemma":0.0007702289,"threshold_uncertainty_score":0.04639399},"labels":[],"label_agreement":null},{"id":"W17283808","doi":"10.1039/b608532f","title":"Connectivity of bi-Cayley Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Supramolecular Self-Assembly in Materials","field":"Materials Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cayley graph; Combinatorics; Graph","score_opus":0.016378203175909493,"score_gpt":0.243149377276336,"score_spread":0.22677117410042652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W17283808","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42140454,0.0033372834,0.36051023,0.0029221643,0.00075777975,0.00038066274,0.008323629,0.0013099984,0.2010537],"genre_scores_gemma":[0.8995416,0.0020375026,0.054846294,0.00094611273,0.0002515206,0.00032330092,0.0061540427,0.00016559273,0.035733923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995413,0.00009818136,0.000037598144,0.00014876666,0.000096846874,0.00007724989],"domain_scores_gemma":[0.99841356,0.00058194716,0.00034073307,0.00019782258,0.00028180899,0.0001840364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027050445,0.0004935302,0.00035073253,0.0020883856,0.00086771307,0.001750031,0.00063508074,0.000707667,0.01526287],"category_scores_gemma":[0.0022558577,0.00032667705,0.0005026497,0.0016069746,0.0007268442,0.0021387872,0.00074446725,0.0009672306,0.0015388692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008322675,0.00004825337,0.001372554,0.0002776223,0.00006893747,0.0004458345,0.0002344208,0.007910964,0.005143944,0.94167894,0.008693916,0.03404134],"study_design_scores_gemma":[0.00003476705,0.00005006111,0.001258412,0.00004800544,0.00004030845,0.0006366329,0.00012518362,0.033090178,0.0024758957,0.9346755,0.027533438,0.00003160562],"about_ca_topic_score_codex":0.0018819404,"about_ca_topic_score_gemma":0.003965706,"teacher_disagreement_score":0.01526287,"about_ca_system_score_codex":0.0009039626,"about_ca_system_score_gemma":0.0005225044,"threshold_uncertainty_score":0.051059365},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arithmetic","score_opus":0.023396892576082524,"score_gpt":0.19221085460350468,"score_spread":0.16881396202742216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W172950155","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8157587,0.0035222373,0.10611835,0.0005201158,0.00036583966,0.00023519278,0.0009503531,0.0012516519,0.07127757],"genre_scores_gemma":[0.9308222,0.0009743248,0.025808971,0.00035626255,0.000075589895,0.0002377717,0.0015431525,0.0007331124,0.039448682],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947065,0.00013335508,0.000021516877,0.00015654796,0.0000641347,0.00015382194],"domain_scores_gemma":[0.99926263,0.00022149149,0.0000852097,0.00025918894,0.00009737557,0.00007424641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005923389,0.00066299277,0.00039673134,0.0012117715,0.00083600264,0.0007675875,0.000935163,0.00057123456,0.0072835386],"category_scores_gemma":[0.00078563864,0.0003647015,0.00049071654,0.0007719153,0.0006660101,0.000544814,0.0007938993,0.0009452101,0.0017661091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061163976,0.00006790189,0.00070847356,0.00017860495,0.000025175723,0.00018150463,0.00022812115,0.00072183507,0.965692,0.014616054,0.0009317209,0.016037002],"study_design_scores_gemma":[0.000022764936,0.00036497856,0.0007949977,0.000011740813,0.000027040991,0.00013451316,0.00004308074,0.0011393144,0.97770315,0.00061828835,0.019129174,0.000011044745],"about_ca_topic_score_codex":0.0013329599,"about_ca_topic_score_gemma":0.0018291998,"teacher_disagreement_score":0.0072835386,"about_ca_system_score_codex":0.0009364367,"about_ca_system_score_gemma":0.00044451616,"threshold_uncertainty_score":0.024365842},"labels":[],"label_agreement":null},{"id":"W173213579","doi":"","title":"T-Colorings and Chromatic Number of Distance Graphs.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chromatic scale; Mathematics; Combinatorics","score_opus":0.0067433125142632,"score_gpt":0.2186780912331773,"score_spread":0.2119347787189141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W173213579","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6751075,0.0044398895,0.15678295,0.007348699,0.00064002053,0.00010944987,0.0026998655,0.00064640405,0.15222523],"genre_scores_gemma":[0.9547364,0.0015449965,0.025413126,0.00041791977,0.00034524166,0.000101086254,0.0010523289,0.00016468178,0.016224273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992092,0.0002237261,0.0000378313,0.00020438523,0.00012878176,0.00019602539],"domain_scores_gemma":[0.99119955,0.0056948187,0.001185638,0.0005945824,0.00046701852,0.00085842126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009334552,0.0006186798,0.00058763626,0.002412625,0.0020236906,0.0036549931,0.0015957078,0.0013897701,0.01195048],"category_scores_gemma":[0.008223157,0.0006359266,0.00057301525,0.002650724,0.0029180106,0.0055202264,0.0015183743,0.0024161153,0.0009906646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028020775,0.00009674814,0.0037010168,0.00015076685,0.000034890498,0.00008472624,0.00029007797,0.015395159,0.0023797872,0.93958527,0.017053755,0.020947607],"study_design_scores_gemma":[0.00004415672,0.000025064734,0.001714696,0.000040589523,0.000022774911,0.00020795643,0.00022876014,0.03783108,0.0012369595,0.95313066,0.005494523,0.000022764272],"about_ca_topic_score_codex":0.003738319,"about_ca_topic_score_gemma":0.0043154275,"teacher_disagreement_score":0.01195048,"about_ca_system_score_codex":0.0028646379,"about_ca_system_score_gemma":0.00085921783,"threshold_uncertainty_score":0.039978385},"labels":[],"label_agreement":null},{"id":"W173230354","doi":"","title":"A Cube-Packing Problem.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cube (algebra); Mathematics; Packing problems; Combinatorics; Mathematical optimization","score_opus":0.01210765673712815,"score_gpt":0.20602602515098944,"score_spread":0.1939183684138613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W173230354","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114786915,0.0059048627,0.5850933,0.007894737,0.0024530138,0.0006742475,0.009243532,0.0010860151,0.27286342],"genre_scores_gemma":[0.5491205,0.0058565387,0.3446401,0.0016994595,0.0010668315,0.0004603564,0.009001542,0.0004763028,0.08767841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990797,0.00025378293,0.00005357396,0.00021180387,0.00023056348,0.0001705834],"domain_scores_gemma":[0.99873215,0.0006794114,0.000095260955,0.00019010602,0.00013926452,0.00016380491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006057601,0.0008100457,0.0011607617,0.00069313863,0.001051455,0.002847152,0.0013258872,0.0023230906,0.025314668],"category_scores_gemma":[0.003630077,0.00048293767,0.0011359227,0.0021224834,0.0007746801,0.0037082867,0.0017444844,0.0020939282,0.0037669719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005560551,0.00046157712,0.001302554,0.0010782813,0.00021742095,0.0008414197,0.00021101566,0.15249735,0.004271996,0.47374892,0.1608056,0.20400769],"study_design_scores_gemma":[0.00011406676,0.00016771302,0.0009649488,0.00016161044,0.00008786305,0.0011708798,0.00032087922,0.2826118,0.0035544517,0.63207954,0.07872305,0.000043151038],"about_ca_topic_score_codex":0.0020491963,"about_ca_topic_score_gemma":0.002418254,"teacher_disagreement_score":0.025314668,"about_ca_system_score_codex":0.0008722923,"about_ca_system_score_gemma":0.0011747741,"threshold_uncertainty_score":0.08468598},"labels":[],"label_agreement":null},{"id":"W173337542","doi":"","title":"Centers of Tensor Products of Graphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Tensor product; Tensor (intrinsic definition); Combinatorics; Pure mathematics","score_opus":0.006096749259206535,"score_gpt":0.1847817289992875,"score_spread":0.17868497974008096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W173337542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22796127,0.002765787,0.4581509,0.0017495312,0.0012818835,0.00017985282,0.0011340731,0.0012787161,0.30549797],"genre_scores_gemma":[0.8513119,0.0015437311,0.073502116,0.0005842714,0.000790875,0.00018499023,0.0008588102,0.00051788485,0.070705414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987274,0.00031838406,0.00007838718,0.0003016657,0.00031113776,0.00026309065],"domain_scores_gemma":[0.9971732,0.00079512136,0.0004957784,0.00052333996,0.0005869,0.0004256699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008889244,0.00080673874,0.00075945846,0.0033412694,0.0019177473,0.0043231933,0.0010525566,0.0010393278,0.01647784],"category_scores_gemma":[0.0036532192,0.0006129859,0.0008057019,0.0016757621,0.0026526747,0.0058239284,0.0026117382,0.0018819692,0.0032365695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021240761,0.000011825376,0.000112742746,0.000024511606,0.000006558867,0.000039414652,0.000111743284,0.0003236108,0.00057820097,0.99287087,0.0016226628,0.0042766905],"study_design_scores_gemma":[0.000009617521,0.000018674249,0.0001563962,0.000022162032,0.0000122448855,0.00018819555,0.00013246427,0.0042464593,0.0013603114,0.98290986,0.010930664,0.000012994561],"about_ca_topic_score_codex":0.0008848508,"about_ca_topic_score_gemma":0.0011799469,"teacher_disagreement_score":0.01647784,"about_ca_system_score_codex":0.0013343584,"about_ca_system_score_gemma":0.0006546071,"threshold_uncertainty_score":0.055123925},"labels":[],"label_agreement":null},{"id":"W173519685","doi":"","title":"A Run-length Operator on Partitions of Integers, Applied to Inventory Chains.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Operator (biology); Combinatorics; Chemistry","score_opus":0.012275942785862082,"score_gpt":0.21424280984692787,"score_spread":0.20196686706106579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W173519685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02159742,0.0007470105,0.9468119,0.0004893729,0.0004279285,0.00010953606,0.00022151806,0.0008337487,0.028761411],"genre_scores_gemma":[0.26371858,0.0010391612,0.7071252,0.0004227862,0.0005255173,0.00031562793,0.0003740342,0.0008696779,0.025609408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999127,0.00029688643,0.000058549173,0.00016788712,0.00023885546,0.00011082743],"domain_scores_gemma":[0.9984022,0.00085654855,0.00013019308,0.00031315384,0.00016426491,0.0001336653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001395513,0.00064964255,0.0007019095,0.0012180993,0.0013586844,0.0022194067,0.001156772,0.00089257007,0.007987326],"category_scores_gemma":[0.00542105,0.00034962554,0.00085798494,0.0022211887,0.002020121,0.0033180066,0.002573934,0.002155655,0.001794142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000282021,0.000103325234,0.0003599212,0.00019646318,0.000026959679,0.00018843438,0.00037660377,0.032715593,0.0098677445,0.7611537,0.009782604,0.18494657],"study_design_scores_gemma":[0.000047268994,0.00016905526,0.0003459641,0.00009418536,0.000035400273,0.00026802346,0.00016356516,0.18531089,0.006701613,0.7723827,0.034431253,0.000050131166],"about_ca_topic_score_codex":0.0014955157,"about_ca_topic_score_gemma":0.0019037839,"teacher_disagreement_score":0.007987326,"about_ca_system_score_codex":0.0011034264,"about_ca_system_score_gemma":0.00093560596,"threshold_uncertainty_score":0.026720226},"labels":[],"label_agreement":null},{"id":"W173602826","doi":"","title":"A Note on the Construction of Magic Squares of Higher Order.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Magic square; Mathematics; MAGIC (telescope); Order (exchange); Combinatorics; Astrophysics; Physics; Business","score_opus":0.015705430546401167,"score_gpt":0.22328099845551158,"score_spread":0.20757556790911041,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W173602826","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03092747,0.0051514506,0.6494929,0.0072286446,0.003972529,0.0001381788,0.00052126107,0.0021858895,0.30038154],"genre_scores_gemma":[0.26093692,0.004592498,0.66320693,0.0034405927,0.0011417804,0.0002530811,0.0005932176,0.0011571916,0.064677835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991423,0.0002619047,0.000039456037,0.00015498439,0.00029508048,0.000106401436],"domain_scores_gemma":[0.99846715,0.0007578722,0.00006317789,0.00041755583,0.00013912191,0.00015499654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009339966,0.00072034367,0.0007656424,0.0013363819,0.0022680515,0.0020375485,0.0018028558,0.0011249166,0.015730293],"category_scores_gemma":[0.0027704611,0.00070636417,0.0008313939,0.0016676418,0.0034831644,0.004675405,0.0041986736,0.0046400046,0.004021223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039520088,0.00002893249,0.00018858063,0.00013915291,0.000010079606,0.00015595923,0.0002505713,0.0009418704,0.002890377,0.9478227,0.017482057,0.030050196],"study_design_scores_gemma":[0.000014415957,0.000033188066,0.00019294996,0.000038475264,0.000009371342,0.00027598374,0.00011100003,0.002590565,0.0026635097,0.9027082,0.09133267,0.000029698396],"about_ca_topic_score_codex":0.0012315437,"about_ca_topic_score_gemma":0.0038511225,"teacher_disagreement_score":0.015730293,"about_ca_system_score_codex":0.00093342486,"about_ca_system_score_gemma":0.00071419304,"threshold_uncertainty_score":0.052623093},"labels":[],"label_agreement":null},{"id":"W1736267627","doi":"","title":"Conditional Fault Hamiltonicity of the Star Graph","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Star (game theory); Mathematics; Graph; Combinatorics","score_opus":0.006745557873233054,"score_gpt":0.20725412931379278,"score_spread":0.20050857144055972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1736267627","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7520587,0.00019170671,0.21080603,0.0014740588,0.00008993411,0.00010592484,0.0012671965,0.0006367576,0.03336966],"genre_scores_gemma":[0.9841888,0.000080900034,0.009077759,0.000109283545,0.000039329585,0.000043073505,0.0005214054,0.000053255822,0.0058862516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999503,0.00012205555,0.000025395328,0.0000994127,0.00014158717,0.00010855793],"domain_scores_gemma":[0.9961448,0.0019159202,0.00046362437,0.0005126879,0.00062383164,0.00033925858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004599883,0.00026960688,0.0005402214,0.0009003883,0.00092075526,0.0010837467,0.0008501565,0.0006338699,0.008041517],"category_scores_gemma":[0.0046974155,0.00031084273,0.00036997403,0.00085146783,0.0012700926,0.0018529199,0.0009874734,0.00096283696,0.00048359085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034559512,0.000074474294,0.00410412,0.00014276478,0.000035255973,0.00039963075,0.00033903902,0.030594416,0.0063746306,0.9335818,0.0059503433,0.01805791],"study_design_scores_gemma":[0.000059779293,0.000061450206,0.0018370855,0.000018177436,0.000039423925,0.0001961548,0.00016105337,0.11119988,0.0045589856,0.87933934,0.0025050782,0.000023566752],"about_ca_topic_score_codex":0.0029140455,"about_ca_topic_score_gemma":0.0038782984,"teacher_disagreement_score":0.008041517,"about_ca_system_score_codex":0.0010671818,"about_ca_system_score_gemma":0.0011232054,"threshold_uncertainty_score":0.026901603},"labels":[],"label_agreement":null},{"id":"W173691115","doi":"","title":"A New Method For Constructing Nonlinear Modular n-Queens Solutions.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Modular design; Mathematics; Nonlinear system; Computer science; Programming language; Physics","score_opus":0.023402061188800352,"score_gpt":0.3087845100197513,"score_spread":0.285382448830951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W173691115","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062313084,0.00021156918,0.97732985,0.000115500174,0.00017622915,0.00014320333,0.00009944714,0.0006182141,0.015074585],"genre_scores_gemma":[0.05552068,0.00019527366,0.9318115,0.00010766094,0.000054076187,0.00029498182,0.0002039701,0.00023853344,0.011573378],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975127,0.000053223222,0.000014904311,0.00005264792,0.00010253254,0.000025463727],"domain_scores_gemma":[0.99974114,0.000098151366,0.000024248777,0.000061574516,0.00004659285,0.000028308274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003813248,0.00081063097,0.0005622596,0.0012538813,0.00074330467,0.0007538964,0.0012223801,0.0006850848,0.012600952],"category_scores_gemma":[0.001572904,0.00038041873,0.00097282004,0.0009950512,0.00068654463,0.0010017301,0.0019978515,0.0010161801,0.002974918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001981816,0.00020647047,0.00066570146,0.0005737255,0.00012385576,0.00022156986,0.00025835482,0.095531315,0.03036176,0.16253142,0.019022997,0.6903047],"study_design_scores_gemma":[0.00018166364,0.00020872141,0.00053329463,0.00013609417,0.00009620804,0.00056827907,0.000111238594,0.76777816,0.01408147,0.14181857,0.074426085,0.000060230548],"about_ca_topic_score_codex":0.00081778865,"about_ca_topic_score_gemma":0.0021741746,"teacher_disagreement_score":0.012600952,"about_ca_system_score_codex":0.00040926773,"about_ca_system_score_gemma":0.00075636146,"threshold_uncertainty_score":0.04215443},"labels":[],"label_agreement":null},{"id":"W174061112","doi":"","title":"Some 3x3 transformation formulas related to Bailey's 2x2.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Transformation (genetics); Mathematical economics","score_opus":0.01580810059294447,"score_gpt":0.2821994928779334,"score_spread":0.2663913922849889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W174061112","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14515671,0.0019098897,0.13011998,0.0027091047,0.0019482065,0.00014222498,0.0006903445,0.00089065847,0.71643287],"genre_scores_gemma":[0.74989617,0.0013127523,0.05016621,0.0019138384,0.00072257273,0.000186106,0.0007741088,0.00083889917,0.1941893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962807,0.000088742454,0.000015250319,0.000037570153,0.00015710898,0.00007329304],"domain_scores_gemma":[0.99968004,0.00009449545,0.00004736649,0.00004523201,0.00007973305,0.000053222277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004883433,0.00051658804,0.00037658654,0.0011288454,0.0016588895,0.001946835,0.00072208006,0.0009255211,0.021579372],"category_scores_gemma":[0.0016458108,0.0002510503,0.00067574426,0.0012523714,0.0015144063,0.0024726961,0.0014934132,0.0019367335,0.004953172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001717278,0.0000139411895,0.00007962248,0.000018679459,0.0000023412504,0.00012791074,0.00015443939,0.00015488984,0.00050205324,0.98555076,0.004993501,0.0083846655],"study_design_scores_gemma":[0.000017002038,0.000014369115,0.00028992756,0.000012625061,0.0000048802463,0.00027366827,0.000114260365,0.0017844494,0.00081025437,0.9730568,0.023608955,0.000012853728],"about_ca_topic_score_codex":0.0011207701,"about_ca_topic_score_gemma":0.0012003337,"teacher_disagreement_score":0.021579372,"about_ca_system_score_codex":0.0010261217,"about_ca_system_score_gemma":0.00049605937,"threshold_uncertainty_score":0.072190225},"labels":[],"label_agreement":null},{"id":"W174319746","doi":"","title":"Four traps are almost always enough to catch a square-celled animal.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Physiological and biochemical adaptations","field":"Environmental Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Square (algebra); Mathematics; Geometry","score_opus":0.0200082108116684,"score_gpt":0.22239616717690763,"score_spread":0.20238795636523924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W174319746","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9231732,0.0036633073,0.04045599,0.002480107,0.00073973706,0.0001414677,0.002262415,0.0021414089,0.024942348],"genre_scores_gemma":[0.9342639,0.00082499685,0.027369235,0.0017486559,0.00012130357,0.00016561837,0.002784269,0.00042952813,0.03229242],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992772,0.00008532397,0.000049197464,0.00028418688,0.00014876224,0.00015531694],"domain_scores_gemma":[0.9983789,0.00022478844,0.000272313,0.00038327428,0.00019930294,0.00054136745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005783475,0.000787392,0.0011608336,0.0007848746,0.0014010599,0.001125103,0.0010898302,0.0013436031,0.021151891],"category_scores_gemma":[0.0010527541,0.0007230589,0.000967355,0.0005640803,0.0010246437,0.0022106722,0.0022662026,0.0013916714,0.010648467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018079598,0.00038933364,0.08099303,0.00090720947,0.00086460105,0.0013514416,0.0005040545,0.0033244304,0.7435944,0.0056933863,0.011981905,0.14858828],"study_design_scores_gemma":[0.00030369993,0.005283093,0.46363887,0.0004173672,0.0008711839,0.014815311,0.005383492,0.010614524,0.20191537,0.031225597,0.264874,0.00065749313],"about_ca_topic_score_codex":0.00069411227,"about_ca_topic_score_gemma":0.0034665584,"teacher_disagreement_score":0.021151891,"about_ca_system_score_codex":0.00048394428,"about_ca_system_score_gemma":0.00037583912,"threshold_uncertainty_score":0.07076013},"labels":[],"label_agreement":null},{"id":"W175032106","doi":"","title":"On the Laplacian Spectra of Graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Laplacian matrix; Eigenvalues and eigenvectors; Laplace operator; Combinatorics; Graph; Algebraic connectivity; Resistance distance; Degree matrix; Discrete mathematics; Line graph; Mathematical analysis; Graph power; Physics","score_opus":0.021342993373551822,"score_gpt":0.266556041425976,"score_spread":0.24521304805242417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W175032106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09146449,0.010909664,0.7909786,0.0044014505,0.0007304741,0.000110236935,0.0011561984,0.00083644746,0.09941238],"genre_scores_gemma":[0.8451183,0.017804343,0.112098105,0.0019152027,0.0027940865,0.00041151157,0.0013717719,0.00057929306,0.017907355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985928,0.0003983728,0.000059509955,0.000291754,0.0004452852,0.00021223653],"domain_scores_gemma":[0.98889005,0.008177906,0.0008131683,0.0006639976,0.00086762395,0.00058721856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014206986,0.0018351148,0.0011274092,0.0043040733,0.0013583293,0.0022285858,0.0014725316,0.0016425445,0.008521268],"category_scores_gemma":[0.014290488,0.00053328555,0.0007268463,0.0027132935,0.0033001332,0.006348636,0.0031114446,0.0037627977,0.0030987759],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007259766,0.00008053666,0.00095720903,0.00028439506,0.000041096453,0.00031457323,0.0005141314,0.02112748,0.007298808,0.9315389,0.009119635,0.02865068],"study_design_scores_gemma":[0.000009605542,0.000030472625,0.00079299445,0.00008370839,0.000013137786,0.00029089986,0.00017788864,0.0588601,0.0013432157,0.9333914,0.004971331,0.000035310288],"about_ca_topic_score_codex":0.0009748302,"about_ca_topic_score_gemma":0.0009168871,"teacher_disagreement_score":0.008521268,"about_ca_system_score_codex":0.001220414,"about_ca_system_score_gemma":0.00046036116,"threshold_uncertainty_score":0.028506458},"labels":[],"label_agreement":null},{"id":"W175104714","doi":"","title":"Orientable embedding distributions by genus for certain type of non-planar graphs (II).","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Embedding; Genus; Type (biology); Combinatorics; Planar graph; Planar; Book embedding; Type species; Pure mathematics; Chordal graph; 1-planar graph; Graph; Botany; Biology; Computer science; Artificial intelligence; Paleontology","score_opus":0.017751290286212723,"score_gpt":0.29741306604122736,"score_spread":0.2796617757550146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W175104714","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8866196,0.0008302472,0.067758,0.0010451748,0.00012502457,0.000056804005,0.0003990404,0.0004076511,0.042758398],"genre_scores_gemma":[0.98652565,0.00062585826,0.007106192,0.00014276522,0.00010435109,0.000047716174,0.00029144943,0.00011961323,0.0050364137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952126,0.0000898813,0.000022138565,0.00010246028,0.00013872529,0.00012556593],"domain_scores_gemma":[0.99688596,0.0013132415,0.0007081201,0.00029201043,0.00026138203,0.00053929206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005546142,0.0004314532,0.0004971703,0.001985267,0.0009908939,0.0026606747,0.001310363,0.0010359096,0.00657536],"category_scores_gemma":[0.005966954,0.00039649958,0.0005141684,0.0014903127,0.0022014522,0.0036532206,0.001553213,0.0015769168,0.00053964084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001370426,0.00006830557,0.0046926327,0.00008475364,0.000018717814,0.0003447303,0.00042855006,0.004486676,0.0043281075,0.96524394,0.0032790145,0.01688744],"study_design_scores_gemma":[0.000047707978,0.000064592125,0.008150141,0.000051774674,0.000044636472,0.0014384742,0.000711034,0.0326151,0.0029267287,0.94881564,0.005090708,0.00004346882],"about_ca_topic_score_codex":0.0006616814,"about_ca_topic_score_gemma":0.0009335037,"teacher_disagreement_score":0.00657536,"about_ca_system_score_codex":0.0011242583,"about_ca_system_score_gemma":0.00025204802,"threshold_uncertainty_score":0.021996737},"labels":[],"label_agreement":null},{"id":"W175177793","doi":"","title":"On the Structure of Optimal Linear Block Codes of Length a Multiple of 4 and d = 4.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Block (permutation group theory); Combinatorics; Discrete mathematics","score_opus":0.009039251704525087,"score_gpt":0.22062445887223744,"score_spread":0.21158520716771237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W175177793","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7496208,0.0033814292,0.13138455,0.0045125103,0.00027332376,0.00015993873,0.002062635,0.000366197,0.10823861],"genre_scores_gemma":[0.94289494,0.0011120599,0.033775598,0.0007010708,0.00022324246,0.0001545621,0.0015337327,0.00015999793,0.019444898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996088,0.00011959961,0.000017912835,0.0000451367,0.0000983899,0.00011013588],"domain_scores_gemma":[0.9976342,0.0010555445,0.000517007,0.00030607588,0.0002795821,0.00020766002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003684386,0.00032766518,0.0005432741,0.0011206933,0.0009903787,0.0014067481,0.00068031735,0.00097425864,0.0047692386],"category_scores_gemma":[0.0034288578,0.00042707578,0.00028589246,0.0010379549,0.001239005,0.002209177,0.0012373963,0.0012891742,0.0010151907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036668332,0.00007643768,0.0008760979,0.00010708098,0.00001699888,0.00014817761,0.00023476437,0.0163042,0.004976683,0.9467988,0.0099674715,0.020126624],"study_design_scores_gemma":[0.00006179745,0.00008631133,0.0006873673,0.00004320424,0.000012949004,0.00013643413,0.000098253426,0.046026777,0.0018020809,0.94415367,0.006865117,0.000026100342],"about_ca_topic_score_codex":0.0008189849,"about_ca_topic_score_gemma":0.0014248495,"teacher_disagreement_score":0.0047692386,"about_ca_system_score_codex":0.0009080275,"about_ca_system_score_gemma":0.00094560697,"threshold_uncertainty_score":0.015954673},"labels":[],"label_agreement":null},{"id":"W175193922","doi":"","title":"Further constructions for BIB designs with nested rows and columns.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Row; Row and column spaces; Arithmetic; Computer science; Programming language","score_opus":0.017321915887473123,"score_gpt":0.2063566414762262,"score_spread":0.1890347255887531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W175193922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020354098,0.0015784054,0.7998742,0.00095176505,0.0010357542,0.0002721049,0.0010124029,0.004232934,0.17068842],"genre_scores_gemma":[0.24681056,0.0015444561,0.67735964,0.0014155557,0.0003564972,0.0004330136,0.0019187753,0.001154125,0.06900739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994351,0.00011784198,0.00005136649,0.00006351868,0.00022503462,0.00010703001],"domain_scores_gemma":[0.9992931,0.00017798833,0.00007255355,0.0002425545,0.00013528505,0.000078487625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065460027,0.0008158696,0.00057061366,0.0010805741,0.0010013179,0.0017221394,0.0008620811,0.0005620776,0.029976131],"category_scores_gemma":[0.0016788968,0.0005255703,0.0009027317,0.0012574148,0.00092052104,0.0017980189,0.0015850639,0.0017446987,0.009756984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040404353,0.0001761527,0.00069189986,0.0012020884,0.000072447234,0.0006583362,0.0003727844,0.007985885,0.04445147,0.68274635,0.049475074,0.21176353],"study_design_scores_gemma":[0.00020914586,0.0003871954,0.00083004346,0.00039573293,0.000107453714,0.0023343826,0.00030112296,0.037983198,0.0690873,0.52601516,0.36222565,0.000123613],"about_ca_topic_score_codex":0.0004341957,"about_ca_topic_score_gemma":0.0017136919,"teacher_disagreement_score":0.029976131,"about_ca_system_score_codex":0.00071605155,"about_ca_system_score_gemma":0.0006986367,"threshold_uncertainty_score":0.100280166},"labels":[],"label_agreement":null},{"id":"W175207658","doi":"","title":"A Note on the Toughness of Certain Graphs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Toughness; Composite material; Materials science","score_opus":0.01603784125792736,"score_gpt":0.23731903345967578,"score_spread":0.2212811922017484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W175207658","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14278473,0.011285755,0.23289901,0.047013376,0.0046310197,0.00016260619,0.0021891291,0.0008835814,0.5581508],"genre_scores_gemma":[0.8403975,0.00907023,0.08468757,0.008772885,0.0049971356,0.00026900537,0.0013309964,0.0005635054,0.049911156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982285,0.0005062648,0.000071705894,0.00041895764,0.0004818564,0.00029271562],"domain_scores_gemma":[0.98419535,0.012288328,0.00059622905,0.0011637101,0.0005510916,0.0012053375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017911214,0.0009136883,0.001097747,0.0027570536,0.004139661,0.0041637644,0.0022691037,0.0023743166,0.017723262],"category_scores_gemma":[0.012523178,0.0008910907,0.0013332259,0.0028447732,0.007179896,0.0090103755,0.004465721,0.0072114095,0.0015364044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004540284,0.000022909111,0.00050476094,0.00013213001,0.000014939293,0.00016612801,0.00025848145,0.0013351594,0.00084376265,0.9684713,0.020781735,0.007423313],"study_design_scores_gemma":[0.000010275785,0.000014932896,0.00060424535,0.000040259034,0.000012175212,0.00022033419,0.00016466754,0.003140773,0.00033789987,0.97898966,0.01644554,0.000019284193],"about_ca_topic_score_codex":0.002752424,"about_ca_topic_score_gemma":0.0031310678,"teacher_disagreement_score":0.017723262,"about_ca_system_score_codex":0.0019604892,"about_ca_system_score_gemma":0.0006902615,"threshold_uncertainty_score":0.05929023},"labels":[],"label_agreement":null},{"id":"W175226406","doi":"","title":"k-Geodomination in Graphs","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.015649248580041072,"score_gpt":0.21926343233824622,"score_spread":0.20361418375820514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W175226406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44307977,0.0015072589,0.46875882,0.0050430377,0.00036184714,0.0002121948,0.0010567546,0.0015808506,0.0783993],"genre_scores_gemma":[0.8656618,0.00090695947,0.09480548,0.00077122805,0.00015565899,0.0001600645,0.001001015,0.00048279506,0.03605511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972435,0.0008141798,0.0002246984,0.00079687644,0.00042607903,0.00049464987],"domain_scores_gemma":[0.9917497,0.0036455942,0.00082305336,0.002056983,0.00071573275,0.0010088888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015962663,0.0007888836,0.001487225,0.00200576,0.0040622554,0.0059433,0.0022819564,0.0018449015,0.008849479],"category_scores_gemma":[0.0076295417,0.0010306337,0.0012535403,0.003952254,0.0035239644,0.0102414265,0.0060414546,0.002908289,0.002485664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001786436,0.00007907774,0.0018209992,0.0001874,0.000025764835,0.00034414875,0.0013225644,0.0029862677,0.0015619013,0.9563875,0.0049157836,0.03018986],"study_design_scores_gemma":[0.000028705319,0.000025066778,0.00037779653,0.000040998573,0.00002867227,0.00058088737,0.00044325378,0.00818461,0.0014346646,0.97708786,0.011747443,0.000020050058],"about_ca_topic_score_codex":0.0015543138,"about_ca_topic_score_gemma":0.0020408032,"teacher_disagreement_score":0.008849479,"about_ca_system_score_codex":0.0014529403,"about_ca_system_score_gemma":0.001014889,"threshold_uncertainty_score":0.029604435},"labels":[],"label_agreement":null},{"id":"W175278431","doi":"","title":"On the Weakly Superincreasing Distributions and the Fibonacci-Hessenberg Matrices.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Mathematics; Combinatorics; Pure mathematics","score_opus":0.006140337592106747,"score_gpt":0.24550561391824013,"score_spread":0.23936527632613339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W175278431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28475308,0.0063801385,0.42362115,0.007034392,0.0010834176,0.000094157054,0.0008939534,0.00040661532,0.2757331],"genre_scores_gemma":[0.8989416,0.0035638467,0.045299664,0.0016118353,0.0011239523,0.00017068317,0.00045555588,0.00016271502,0.04867015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995627,0.00014190047,0.000022003107,0.00006310838,0.000121216224,0.00008906909],"domain_scores_gemma":[0.9975176,0.0015326617,0.00023910058,0.00016660248,0.0003207912,0.00022322554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010546513,0.0005535352,0.00050961,0.0020249335,0.0013137771,0.0021093546,0.00074010633,0.0008571792,0.009826965],"category_scores_gemma":[0.0066031828,0.00040070005,0.00044303577,0.0015833615,0.003371536,0.005021998,0.0012098206,0.0018817487,0.001576585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010053629,0.0000048281477,0.00007013784,0.0000117235795,0.00000202679,0.00002929714,0.000053999225,0.0006158169,0.00026772593,0.9940129,0.0014600885,0.0034613383],"study_design_scores_gemma":[0.000003821264,0.00000517609,0.000116339754,0.0000062605795,0.0000013934433,0.000049104034,0.000027378486,0.0026000224,0.00010981421,0.99559194,0.0014835004,0.000005174328],"about_ca_topic_score_codex":0.0012606232,"about_ca_topic_score_gemma":0.0015813133,"teacher_disagreement_score":0.009826965,"about_ca_system_score_codex":0.00089875807,"about_ca_system_score_gemma":0.00060513604,"threshold_uncertainty_score":0.032874465},"labels":[],"label_agreement":null},{"id":"W175374440","doi":"","title":"The anatomy of magic squares.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Ancient Egypt and Archaeology","field":"Arts and Humanities","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Magic square; MAGIC (telescope); Mathematics; Anatomy; Geometry; Medicine; Astronomy; Physics","score_opus":0.014879712204294872,"score_gpt":0.2352507529015702,"score_spread":0.2203710406972753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W175374440","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009584275,0.008095822,0.0646591,0.0033041635,0.00070138776,0.000025971529,0.00027349862,0.00032433233,0.91303134],"genre_scores_gemma":[0.5163184,0.007191102,0.076343134,0.0010993443,0.000855167,0.00013968088,0.0003951353,0.0005226581,0.39713535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956936,0.00013585313,0.000030267116,0.00009564644,0.00011136876,0.00005742517],"domain_scores_gemma":[0.99944144,0.00022077354,0.000038410595,0.00014541701,0.000108993976,0.000044964567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032923522,0.0004285153,0.00033601563,0.001533206,0.002471473,0.0044989074,0.00074505137,0.0010845719,0.03339167],"category_scores_gemma":[0.0019096506,0.00043869912,0.00046482185,0.0017403846,0.0064268294,0.0054142512,0.001761858,0.0016670323,0.007633507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055642818,0.00000131901,0.000030640582,0.000015352944,0.0000016627433,0.000021876336,0.00015522627,0.000089288355,0.00007246772,0.9889922,0.003290928,0.0073234322],"study_design_scores_gemma":[0.0000073193105,0.0000061019973,0.00015071518,0.000024450086,0.0000045247184,0.000189898,0.00024128679,0.0004293363,0.00021421966,0.82592994,0.1727964,0.000005672822],"about_ca_topic_score_codex":0.0025830925,"about_ca_topic_score_gemma":0.004803074,"teacher_disagreement_score":0.03339167,"about_ca_system_score_codex":0.0013937956,"about_ca_system_score_gemma":0.00076337706,"threshold_uncertainty_score":0.11170632},"labels":[],"label_agreement":null},{"id":"W175875804","doi":"","title":"Z-Cyclic Directed Moore (2, 6) Generalised Whist Tournament Designs on p elements where p = 7 (mod 12).","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mod; Tournament; Mathematics; Combinatorics; Discrete mathematics","score_opus":0.019217455684710814,"score_gpt":0.21000240372774406,"score_spread":0.19078494804303325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W175875804","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61031526,0.00044869742,0.2318742,0.0006063779,0.0004114521,0.00018948386,0.00076539133,0.0008284481,0.1545607],"genre_scores_gemma":[0.9290203,0.00015607408,0.039728973,0.00024637964,0.00006198365,0.000104590494,0.000350347,0.00006066994,0.030270744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994708,0.00013878617,0.00003218879,0.00009760572,0.00011077636,0.00014993302],"domain_scores_gemma":[0.99934655,0.00015466921,0.0001087883,0.00013631987,0.000118157186,0.00013554412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037246168,0.00030301703,0.00032631663,0.00063668523,0.0008974372,0.0013977854,0.00055012666,0.0006481237,0.011975104],"category_scores_gemma":[0.001145568,0.00022436523,0.00029355078,0.00070085574,0.00066264847,0.0008685924,0.0009922944,0.00061605405,0.0013359817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040982015,0.00006906613,0.0008675106,0.0000905291,0.00003057901,0.00034159154,0.00024582722,0.0072034514,0.014009674,0.93313795,0.0053466656,0.038247284],"study_design_scores_gemma":[0.0002741189,0.00049697317,0.0018328693,0.000087973436,0.000061853025,0.0005932815,0.0003074494,0.051354356,0.022592986,0.8636986,0.05860129,0.00009825309],"about_ca_topic_score_codex":0.0008751353,"about_ca_topic_score_gemma":0.0025632263,"teacher_disagreement_score":0.011975104,"about_ca_system_score_codex":0.0005129581,"about_ca_system_score_gemma":0.0004768001,"threshold_uncertainty_score":0.04006076},"labels":[],"label_agreement":null},{"id":"W175918027","doi":"","title":"Embedding graphs without edge accumulation points in tubular surfaces.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Embedding; Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Geometry; Computer science; Artificial intelligence","score_opus":0.02975803999944533,"score_gpt":0.3394812905349219,"score_spread":0.30972325053547656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W175918027","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5341792,0.0012291968,0.33497202,0.0012752584,0.00037536214,0.00008758268,0.0007096272,0.0012523155,0.12591933],"genre_scores_gemma":[0.9057626,0.00075126876,0.051579468,0.00021768182,0.00015130291,0.00005203167,0.0008530296,0.0004238704,0.040208843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963117,0.00007423301,0.000021139062,0.00009229913,0.000105167645,0.00007591864],"domain_scores_gemma":[0.9989242,0.00035309003,0.00018218782,0.00018775449,0.00017298353,0.00017976329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025003176,0.00047327986,0.0005285945,0.0012669801,0.0013481156,0.0018978249,0.00082954566,0.0013552919,0.008385427],"category_scores_gemma":[0.0024757842,0.00053542753,0.0005625198,0.0010414633,0.0015919562,0.0036113588,0.0022046084,0.0015531493,0.0024858946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009946564,0.00003513297,0.00067058014,0.00009155299,0.000014082266,0.0003441439,0.00035837165,0.0039807204,0.0036113402,0.964137,0.004009859,0.022647751],"study_design_scores_gemma":[0.000016017486,0.000031475498,0.00056704687,0.0000345267,0.000018260262,0.0003373827,0.0002967286,0.010940382,0.0023042005,0.97522336,0.010215467,0.000015112815],"about_ca_topic_score_codex":0.0008807863,"about_ca_topic_score_gemma":0.001439485,"teacher_disagreement_score":0.008385427,"about_ca_system_score_codex":0.00054411835,"about_ca_system_score_gemma":0.00026601081,"threshold_uncertainty_score":0.028052032},"labels":[],"label_agreement":null},{"id":"W175951983","doi":"","title":"On The Generalized Fibonacci Matrix of Order 2^k Sequence {G^(2k)n}.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Mathematics; Sequence (biology); Order (exchange); Combinatorics; Matrix (chemical analysis); Pure mathematics; Genetics; Chemistry","score_opus":0.01786242607161436,"score_gpt":0.29814201910109644,"score_spread":0.2802795930294821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W175951983","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38308847,0.004943282,0.24885158,0.0045981877,0.0038257327,0.00020702778,0.0013443866,0.0006864232,0.35245493],"genre_scores_gemma":[0.8796856,0.0022183994,0.054851092,0.0018773817,0.00093854597,0.00020363282,0.00080626877,0.00029084084,0.059128214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999582,0.00009959716,0.000017396917,0.00006536583,0.00012387338,0.00011170928],"domain_scores_gemma":[0.99950075,0.00018993126,0.00008019335,0.000044673623,0.00009479141,0.00008959892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004278704,0.0008326838,0.00066347944,0.0019907504,0.0017890943,0.001912846,0.0007913856,0.0016292406,0.014696016],"category_scores_gemma":[0.0017660174,0.00036722686,0.00053788535,0.0011450486,0.0017278822,0.0021306938,0.0010283436,0.0013499067,0.0033632624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006582265,0.000013541159,0.00013598522,0.00007216922,0.000007859985,0.00039276475,0.00018144603,0.0016231828,0.0027965505,0.9816195,0.005272561,0.007818744],"study_design_scores_gemma":[0.000023007777,0.000036300713,0.00035828236,0.000058962236,0.0000061891647,0.000545511,0.00009679175,0.012157867,0.0013281967,0.9768479,0.008496581,0.00004434379],"about_ca_topic_score_codex":0.0023616967,"about_ca_topic_score_gemma":0.0040685087,"teacher_disagreement_score":0.014696016,"about_ca_system_score_codex":0.00094681536,"about_ca_system_score_gemma":0.00077138806,"threshold_uncertainty_score":0.049163043},"labels":[],"label_agreement":null},{"id":"W176088125","doi":"","title":"Generalised Ramsey Numbers with respect to Classes of Graphs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Ramsey's theorem; Discrete mathematics; Graph","score_opus":0.025130017646434494,"score_gpt":0.3021226658226305,"score_spread":0.27699264817619595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W176088125","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30113652,0.0086938115,0.18874392,0.0066627613,0.0019995929,0.00015223617,0.0012667541,0.00088517007,0.49045923],"genre_scores_gemma":[0.9532841,0.0017501625,0.019018427,0.00064644887,0.0010268985,0.0001273657,0.00032761588,0.00011558246,0.023703532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981427,0.000600362,0.00010197762,0.00040445384,0.0005153488,0.00023517892],"domain_scores_gemma":[0.99671423,0.0013517092,0.0004859496,0.00054973346,0.00038182054,0.000516509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018137479,0.0006717661,0.0008213206,0.0040580905,0.001676208,0.0040004244,0.0011726108,0.001394421,0.008180854],"category_scores_gemma":[0.0067712036,0.0004832549,0.00075808284,0.0024222846,0.005277838,0.010319656,0.0039940365,0.003441934,0.0010337175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013591342,0.000002818716,0.00006734202,0.000018834597,0.0000037780437,0.000021556709,0.00009570236,0.00022620075,0.000141875,0.99628866,0.00072819047,0.0023913526],"study_design_scores_gemma":[0.000007930217,0.000008030111,0.00021792714,0.000016027274,0.0000060099173,0.0001106672,0.000065098786,0.00076548767,0.0001317849,0.99306524,0.005598652,0.000007089779],"about_ca_topic_score_codex":0.0009201404,"about_ca_topic_score_gemma":0.0010639178,"teacher_disagreement_score":0.008180854,"about_ca_system_score_codex":0.0018625569,"about_ca_system_score_gemma":0.00049114873,"threshold_uncertainty_score":0.027367711},"labels":[],"label_agreement":null},{"id":"W176538022","doi":"","title":"On chromatic roots with negative real part.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematics and Applications","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics","score_opus":0.035820146300629095,"score_gpt":0.2762787772084648,"score_spread":0.24045863090783567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W176538022","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16098623,0.010880752,0.15725546,0.00884323,0.004126006,0.00008191328,0.00071587105,0.0008167337,0.6562938],"genre_scores_gemma":[0.79907274,0.0054528825,0.028925655,0.0016303388,0.001699156,0.000069438334,0.00054278254,0.0005136213,0.16209337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995453,0.00010611201,0.000015166995,0.000104955514,0.00012526085,0.00010330853],"domain_scores_gemma":[0.9988613,0.00047052593,0.00014190396,0.00015049665,0.00019806913,0.00017767542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005500026,0.0008080682,0.00058079406,0.0023014608,0.0016668164,0.0022416464,0.0007164754,0.0011273931,0.022184229],"category_scores_gemma":[0.0035615966,0.00037064782,0.00036853412,0.0014124284,0.003600353,0.005584081,0.0025737686,0.0032816771,0.004727853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045010063,0.000013931424,0.00025288877,0.00007008017,0.0000066736125,0.00014074762,0.00023719687,0.000685529,0.0012765555,0.97736585,0.008287069,0.011618409],"study_design_scores_gemma":[0.000011047545,0.000012515834,0.0002490086,0.000028167664,0.0000061074015,0.00023202361,0.00014156521,0.00130701,0.00040534252,0.9858598,0.011736237,0.000011313262],"about_ca_topic_score_codex":0.0013531039,"about_ca_topic_score_gemma":0.002307751,"teacher_disagreement_score":0.022184229,"about_ca_system_score_codex":0.0013368083,"about_ca_system_score_gemma":0.0005091907,"threshold_uncertainty_score":0.074213624},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Inverse; Graph; Combinatorics; Geometry","score_opus":0.012533047829698121,"score_gpt":0.2847599724812493,"score_spread":0.2722269246515512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W176713422","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4777745,0.0025745304,0.09392923,0.004018691,0.0009064901,0.000089740206,0.0039022004,0.00076940114,0.41603518],"genre_scores_gemma":[0.95553386,0.001235782,0.01643878,0.0003250942,0.0004477734,0.00010359744,0.0010304146,0.00016918326,0.024715412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914765,0.00017448288,0.000044954857,0.00022633813,0.00023014242,0.00017651387],"domain_scores_gemma":[0.99546176,0.0028567452,0.00042925248,0.00036136273,0.00041853302,0.00047239938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006815669,0.00047678896,0.0005759065,0.003581371,0.0013717193,0.003083018,0.00083581713,0.00087965355,0.013277536],"category_scores_gemma":[0.005532858,0.00025603865,0.00040492497,0.0017646572,0.0021492182,0.004723758,0.0011532431,0.001768856,0.0016175675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023636859,0.000050590876,0.0024243924,0.0002048362,0.00003768508,0.00014372414,0.00041581815,0.0027308264,0.0059199976,0.9321733,0.012474652,0.043187857],"study_design_scores_gemma":[0.000029457955,0.00004678607,0.0027554838,0.00007359794,0.000050024624,0.0008897801,0.00026249277,0.010076696,0.0055380166,0.94616723,0.03406886,0.000041416813],"about_ca_topic_score_codex":0.0007385503,"about_ca_topic_score_gemma":0.00095905364,"teacher_disagreement_score":0.013277536,"about_ca_system_score_codex":0.0012244951,"about_ca_system_score_gemma":0.0005903058,"threshold_uncertainty_score":0.04441774},"labels":[],"label_agreement":null},{"id":"W1768292","doi":"","title":"On the existence of Aperiodic Perfect Maps for 2 x 2 Windows.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Aperiodic graph; Mathematics; Combinatorics","score_opus":0.019856818305440532,"score_gpt":0.2191653776294581,"score_spread":0.19930855932401756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1768292","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48305452,0.001855927,0.48577628,0.00085424114,0.00030423226,0.00012309721,0.0005371045,0.001221861,0.026272751],"genre_scores_gemma":[0.944576,0.00051401684,0.04625672,0.00013674519,0.00020572609,0.0001128143,0.00028435123,0.0001774241,0.007736065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986739,0.0003011124,0.00012637489,0.0003506196,0.00031020562,0.00023766581],"domain_scores_gemma":[0.99139977,0.005172949,0.0012236454,0.00089544605,0.00064754556,0.00066060823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013845296,0.00046041582,0.00051800563,0.0018859053,0.0012949192,0.0023839355,0.00056082994,0.00090904126,0.0048302216],"category_scores_gemma":[0.012071174,0.00066693145,0.0006029673,0.0008031363,0.0017494697,0.003923407,0.0013699614,0.0007689203,0.0012393513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048702108,0.000052473217,0.0026447924,0.0002391987,0.00004703247,0.0010558537,0.0009866336,0.008152152,0.012897043,0.9260702,0.0024112258,0.04495643],"study_design_scores_gemma":[0.00008726574,0.00018770095,0.0031580552,0.000102647915,0.000052646825,0.0023052003,0.0003546791,0.07524634,0.0081529105,0.89717704,0.013075794,0.00009960473],"about_ca_topic_score_codex":0.000575453,"about_ca_topic_score_gemma":0.00049720873,"teacher_disagreement_score":0.0048302216,"about_ca_system_score_codex":0.0007042022,"about_ca_system_score_gemma":0.0006486625,"threshold_uncertainty_score":0.01615864},"labels":[],"label_agreement":null},{"id":"W176990240","doi":"","title":"Vertex and Edge Type Relations of Randic Index for Chemical Trees.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Type (biology); Index (typography); Enhanced Data Rates for GSM Evolution; Graph; Artificial intelligence; Computer science; Biology","score_opus":0.030343866383658387,"score_gpt":0.2724838222997454,"score_spread":0.242139955916087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W176990240","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38727832,0.004201488,0.11076323,0.0022141892,0.0009161329,0.00012029328,0.0025600344,0.0010340299,0.4909123],"genre_scores_gemma":[0.9413861,0.0010451797,0.02959497,0.00047603995,0.00042295738,0.00010554047,0.00084874633,0.0003704443,0.025750019],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992818,0.00016976353,0.000050735292,0.00015664844,0.00021427625,0.00012671849],"domain_scores_gemma":[0.99797004,0.0008340195,0.00031243343,0.00034882635,0.00030211618,0.00023263672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082806067,0.00029303515,0.00063954305,0.0031943833,0.0018590213,0.003158465,0.001046633,0.0010367621,0.010913342],"category_scores_gemma":[0.0037201724,0.00037238502,0.0003715365,0.0018740393,0.0018397463,0.004896908,0.0012475145,0.0017248319,0.001872102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049165064,0.00001526333,0.0004818717,0.000032514447,0.0000044843855,0.000041045234,0.00014012249,0.00042630825,0.0013719978,0.9865623,0.0026369626,0.0082379],"study_design_scores_gemma":[0.000011334489,0.000014683831,0.0007386984,0.000025012721,0.0000124518,0.00018289605,0.00011730133,0.003851382,0.0015387196,0.9838194,0.009668933,0.000019284475],"about_ca_topic_score_codex":0.0010348631,"about_ca_topic_score_gemma":0.0017293534,"teacher_disagreement_score":0.010913342,"about_ca_system_score_codex":0.0010416713,"about_ca_system_score_gemma":0.00044761252,"threshold_uncertainty_score":0.03650874},"labels":[],"label_agreement":null},{"id":"W17701413","doi":"10.1007/s00381-007-0455-x","title":"Triangle-Free Polyconvex Graphs","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.018701616499314767,"score_gpt":0.2206636877406595,"score_spread":0.20196207124134474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W17701413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3184685,0.0011403125,0.5265411,0.0021375478,0.00019081667,0.0002291364,0.0018554096,0.00041801514,0.1490192],"genre_scores_gemma":[0.88481164,0.0014724289,0.055011626,0.0003001989,0.00013827051,0.00017499564,0.0026444716,0.00025063023,0.055195767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967396,0.00006816766,0.000013358417,0.000056280955,0.00013186247,0.000056324876],"domain_scores_gemma":[0.9990019,0.0004490576,0.00016653165,0.000106467494,0.00015630912,0.00011968464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018986472,0.00045529357,0.00037874098,0.0012030413,0.0007712083,0.001051447,0.00082514354,0.0006323725,0.008449732],"category_scores_gemma":[0.0016952448,0.00040962506,0.00034828106,0.0009670583,0.0011114754,0.0011069519,0.0011518773,0.0010128649,0.0013800366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072374525,0.00003815874,0.0006371926,0.00013649972,0.000022082626,0.0005007718,0.00018534824,0.1073189,0.003959229,0.8530359,0.0073523135,0.02674119],"study_design_scores_gemma":[0.000032319283,0.000026265046,0.0010366093,0.000029640822,0.000012092785,0.00027938324,0.00013589083,0.16576019,0.0012958875,0.8110329,0.020341909,0.000016890152],"about_ca_topic_score_codex":0.003399361,"about_ca_topic_score_gemma":0.0052287197,"teacher_disagreement_score":0.008449732,"about_ca_system_score_codex":0.0006483368,"about_ca_system_score_gemma":0.00040803806,"threshold_uncertainty_score":0.028267145},"labels":[],"label_agreement":null},{"id":"W177027056","doi":"","title":"The values sqrt(2q) and log2q: their relationship with k-arcs.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.006421720995426841,"score_gpt":0.1782583689177718,"score_spread":0.17183664792234496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W177027056","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23555306,0.010114835,0.5250927,0.015193777,0.0011624086,0.00014070055,0.0018482892,0.003038587,0.20785561],"genre_scores_gemma":[0.9132531,0.002548124,0.058931313,0.00056073745,0.0007119975,0.00017712144,0.0003349402,0.0006909912,0.022791656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99795985,0.00086302235,0.000105895626,0.0003989884,0.00040563484,0.00026652616],"domain_scores_gemma":[0.9701333,0.022497654,0.002451162,0.0022764194,0.0015691805,0.0010723337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022951728,0.0007385418,0.0007167944,0.0034665668,0.0017412821,0.004776979,0.0017010131,0.0018737608,0.016032208],"category_scores_gemma":[0.039548486,0.0006835451,0.00032326384,0.0046280003,0.0052131056,0.009936273,0.0023556512,0.0043042977,0.0034027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035294998,0.00011153296,0.004441445,0.00015352349,0.000026834723,0.00029215185,0.00041164062,0.013705693,0.0016542347,0.9010639,0.013615217,0.064170815],"study_design_scores_gemma":[0.000025300531,0.000032891854,0.0014591191,0.00006537566,0.000020514137,0.0006499179,0.00022776973,0.04028357,0.0023720902,0.9429974,0.011801424,0.00006463656],"about_ca_topic_score_codex":0.0010582992,"about_ca_topic_score_gemma":0.0014168872,"teacher_disagreement_score":0.016032208,"about_ca_system_score_codex":0.0016915696,"about_ca_system_score_gemma":0.001058445,"threshold_uncertainty_score":0.053633094},"labels":[],"label_agreement":null},{"id":"W177200576","doi":"","title":"3-restricted edge connectivity of vertex transitive graphs","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Vertex (graph theory); Mathematics; Transitive relation; Enhanced Data Rates for GSM Evolution; Combinatorics; Graph; Computer science; Telecommunications","score_opus":0.010790451077434449,"score_gpt":0.22510424006502486,"score_spread":0.2143137889875904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W177200576","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.833183,0.0003915631,0.10240784,0.0006474441,0.00007526806,0.00008158071,0.00082491,0.00046809696,0.06192032],"genre_scores_gemma":[0.982143,0.00033183597,0.010943133,0.00016386766,0.000069189424,0.00010091387,0.0007206046,0.000089277106,0.0054383017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992956,0.00019110914,0.00006504276,0.00016538709,0.00015281806,0.00013005208],"domain_scores_gemma":[0.99591845,0.0021174063,0.0007594266,0.0005295498,0.0002963974,0.00037867617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055074255,0.00046316133,0.00076689874,0.0014229023,0.0012048428,0.0027221707,0.0012015399,0.0010254995,0.009442736],"category_scores_gemma":[0.0036059564,0.0005697678,0.00062919495,0.0015135846,0.0013916694,0.0034074604,0.0015226201,0.0013954558,0.00071081053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034426057,0.00010233046,0.0024787756,0.00020534,0.0000551612,0.0007292463,0.000953687,0.014117866,0.010149884,0.9466053,0.0037949178,0.02046321],"study_design_scores_gemma":[0.0000608615,0.000042977128,0.0015863567,0.00003192549,0.000044891913,0.0006327669,0.0002748623,0.029973887,0.002398828,0.96059024,0.004338154,0.000024209887],"about_ca_topic_score_codex":0.0009567478,"about_ca_topic_score_gemma":0.0013503013,"teacher_disagreement_score":0.009442736,"about_ca_system_score_codex":0.00053019734,"about_ca_system_score_gemma":0.0004138393,"threshold_uncertainty_score":0.03158915},"labels":[],"label_agreement":null},{"id":"W177822790","doi":"","title":"On Relatively Short Sides of Convex Hexagons.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Regular polygon; Combinatorics; Geometry","score_opus":0.009605387970541978,"score_gpt":0.21682407100820955,"score_spread":0.20721868303766758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W177822790","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25545436,0.0014836439,0.29739764,0.0012346142,0.0011995308,0.00018289177,0.0019020718,0.00050622685,0.44063896],"genre_scores_gemma":[0.8061651,0.0012663363,0.07540276,0.0006490286,0.00025608877,0.00018077734,0.0019152499,0.00036469023,0.11379996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994771,0.00012095494,0.000022311682,0.00011281424,0.00015159028,0.00011534316],"domain_scores_gemma":[0.9993444,0.00023777572,0.00012292553,0.000092339294,0.00010587338,0.00009663149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013451374,0.0005301592,0.00053273916,0.0009664301,0.0010276292,0.0018416923,0.0007247905,0.0007055989,0.026103154],"category_scores_gemma":[0.0012866956,0.0004590564,0.00037140577,0.0009254968,0.001019428,0.0016520725,0.0014009778,0.0015045968,0.0053777867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022042787,0.000052289743,0.0005949737,0.00018636687,0.00003362475,0.0006624115,0.00024918697,0.014524804,0.009406752,0.92298,0.013558156,0.037531152],"study_design_scores_gemma":[0.000038229813,0.00006802474,0.0011068258,0.00010890598,0.000018087458,0.0007671212,0.00092403154,0.047962423,0.0068263896,0.89306235,0.04908389,0.00003369798],"about_ca_topic_score_codex":0.0009245071,"about_ca_topic_score_gemma":0.0016216363,"teacher_disagreement_score":0.026103154,"about_ca_system_score_codex":0.0005005744,"about_ca_system_score_gemma":0.00030998955,"threshold_uncertainty_score":0.087323785},"labels":[],"label_agreement":null},{"id":"W178004677","doi":"","title":"Notes on the (s, t)-Lucas and Lucas Matrix Sequences.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Lucas sequence; Lucas number; Combinatorics; Fibonacci polynomials; Fibonacci number","score_opus":0.01889746250169525,"score_gpt":0.2772891229700649,"score_spread":0.25839166046836964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W178004677","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046793804,0.019701147,0.10408557,0.014764413,0.0066543566,0.00007017564,0.0009334676,0.00048551566,0.80651146],"genre_scores_gemma":[0.66658056,0.018463023,0.068214305,0.004779996,0.0068704844,0.0002248287,0.0010038401,0.00041157613,0.23345152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996105,0.00009363677,0.000026768708,0.00007394673,0.00013489535,0.000060262282],"domain_scores_gemma":[0.9988819,0.00051703985,0.0001474408,0.000112010996,0.00020822334,0.00013334911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006320613,0.0007468581,0.00050972804,0.0024722232,0.0016042449,0.0022627532,0.00067105173,0.0011920604,0.022304969],"category_scores_gemma":[0.003636251,0.00036400888,0.00050408964,0.0025842488,0.0029670591,0.00423987,0.0017977966,0.0029823566,0.0035837453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009943905,0.0000034429447,0.000031639087,0.000024387758,0.0000016434262,0.00004059774,0.0000782107,0.000180197,0.00018816601,0.9886176,0.00517775,0.0056465426],"study_design_scores_gemma":[0.000007407857,0.000015349568,0.00018866317,0.000025655852,0.0000030882427,0.0001536182,0.000064915024,0.0005814497,0.00024159353,0.96232176,0.03638432,0.00001209307],"about_ca_topic_score_codex":0.001855172,"about_ca_topic_score_gemma":0.0023945302,"teacher_disagreement_score":0.022304969,"about_ca_system_score_codex":0.0013743979,"about_ca_system_score_gemma":0.00076011196,"threshold_uncertainty_score":0.074617624},"labels":[],"label_agreement":null},{"id":"W178472531","doi":"","title":"All c-Bhaskar Rao Designs With Block Size 3 and c >= -1 Exist.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Block (permutation group theory); Block size; Combinatorics; Computer science","score_opus":0.01190397609527716,"score_gpt":0.20134943463475435,"score_spread":0.1894454585394772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W178472531","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2880456,0.004524446,0.3409241,0.0018561276,0.0007430429,0.0005272195,0.002452755,0.0030434874,0.35788316],"genre_scores_gemma":[0.82510525,0.0020633293,0.11347959,0.0011736209,0.00025961662,0.0007178355,0.0014235778,0.00030508096,0.055472214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977584,0.0005969503,0.00009671369,0.000326161,0.00048744906,0.0007343377],"domain_scores_gemma":[0.9941579,0.0022600526,0.0008205158,0.0013140327,0.0010264276,0.00042105105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013828732,0.0010577046,0.0010664484,0.0020683745,0.0024222038,0.002564542,0.0009196233,0.002268575,0.027917223],"category_scores_gemma":[0.006069828,0.0005968684,0.0009568959,0.0018613932,0.0014865757,0.0018729923,0.0016571782,0.0014906824,0.011943524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00096067577,0.0001919368,0.0014759765,0.0005463038,0.00008728457,0.00025796684,0.0004443454,0.0025852553,0.01985043,0.8502676,0.0125868395,0.11074537],"study_design_scores_gemma":[0.0003240273,0.0007844808,0.0025204835,0.0003693481,0.00014763312,0.0020390057,0.00047263099,0.012660553,0.030147435,0.8441521,0.10620672,0.00017556445],"about_ca_topic_score_codex":0.00057819695,"about_ca_topic_score_gemma":0.0013961224,"teacher_disagreement_score":0.027917223,"about_ca_system_score_codex":0.0006301582,"about_ca_system_score_gemma":0.0019657435,"threshold_uncertainty_score":0.09339243},"labels":[],"label_agreement":null},{"id":"W178751288","doi":"","title":"A sk type condition for heavy cycles in weighted graphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Type (biology); Combinatorics; Geology","score_opus":0.024735094740734483,"score_gpt":0.310158737922295,"score_spread":0.2854236431815605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W178751288","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32583138,0.0013452724,0.29917333,0.006060572,0.003158139,0.00048052674,0.0051713055,0.002671762,0.35610774],"genre_scores_gemma":[0.89259434,0.00085242506,0.04027439,0.0019045596,0.0010490038,0.00038078293,0.0032645955,0.00081313524,0.058866616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986614,0.00026161317,0.00012946605,0.00028289747,0.00030148847,0.0003632406],"domain_scores_gemma":[0.99297947,0.0026654482,0.00059856736,0.0011718988,0.0016041395,0.000980377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013251645,0.0005731846,0.0010003038,0.001978485,0.0026050704,0.0030234824,0.0016561175,0.002476525,0.03426211],"category_scores_gemma":[0.011348204,0.00075137545,0.0011930998,0.0020281756,0.00220872,0.008679838,0.0028001827,0.003741215,0.0063248356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036592458,0.00006865337,0.0012856076,0.00023906732,0.000024431863,0.00032319568,0.00030831608,0.0012124839,0.0037526966,0.95800424,0.020051865,0.014363506],"study_design_scores_gemma":[0.00008533133,0.00005337215,0.00079452107,0.00007767669,0.00005123624,0.00044979385,0.00035250475,0.009781696,0.0028815644,0.97304916,0.012378807,0.00004430479],"about_ca_topic_score_codex":0.0019891937,"about_ca_topic_score_gemma":0.0028078933,"teacher_disagreement_score":0.03426211,"about_ca_system_score_codex":0.0013297803,"about_ca_system_score_gemma":0.0016354222,"threshold_uncertainty_score":0.11461824},"labels":[],"label_agreement":null},{"id":"W178775065","doi":"","title":"A few identities involving partitions with a fixed number of parts.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.03521260512837762,"score_gpt":0.30860059038109267,"score_spread":0.273387985252715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W178775065","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035318628,0.00982966,0.2671006,0.009647519,0.0070939646,0.00015295172,0.0007759859,0.00066572893,0.66941494],"genre_scores_gemma":[0.44423032,0.017162213,0.1947776,0.009423779,0.009583142,0.0003800335,0.0015730679,0.0009106615,0.3219593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893814,0.00027485876,0.00007225487,0.00019212479,0.00036249124,0.0001601469],"domain_scores_gemma":[0.99859184,0.000540168,0.0001402525,0.00036042382,0.00022797643,0.00013940598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013239924,0.0007116022,0.0005354543,0.0013780935,0.0030028897,0.002575825,0.0010707235,0.0018519069,0.0130306855],"category_scores_gemma":[0.004843945,0.0004700728,0.0011303987,0.001544766,0.002591063,0.006751117,0.0024750836,0.0038707678,0.005787151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009972693,0.000022955459,0.00014026737,0.00008710288,0.000005764964,0.00016612363,0.00022807955,0.00017409939,0.00066689996,0.97057223,0.012616717,0.015309872],"study_design_scores_gemma":[0.000004574697,0.0000122164,0.00023680563,0.000049060785,0.000010607862,0.0004284828,0.0000874739,0.00058235374,0.0008010428,0.93901145,0.05875848,0.000017517552],"about_ca_topic_score_codex":0.0008443519,"about_ca_topic_score_gemma":0.0015656502,"teacher_disagreement_score":0.0130306855,"about_ca_system_score_codex":0.0010569722,"about_ca_system_score_gemma":0.00075508247,"threshold_uncertainty_score":0.043591976},"labels":[],"label_agreement":null},{"id":"W1790131601","doi":"","title":"Embeddings of Maximum Packings of Triples","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01395709014173337,"score_gpt":0.19350167484654723,"score_spread":0.17954458470481385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1790131601","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51421416,0.0012677575,0.37936896,0.0016225771,0.00043586252,0.00014505311,0.0022015714,0.0010917804,0.099652365],"genre_scores_gemma":[0.86615443,0.00082528783,0.10648296,0.00039340058,0.0002079824,0.00023046574,0.0027286198,0.00066167314,0.022315172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988581,0.00030285312,0.00008574784,0.00025948582,0.00026128368,0.00023262046],"domain_scores_gemma":[0.99675566,0.0016199163,0.00041481326,0.00054741354,0.00029322825,0.0003689239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058845145,0.0011140715,0.0010646442,0.0021982098,0.0019553273,0.0041429824,0.0013665336,0.0016966244,0.014769703],"category_scores_gemma":[0.0050965315,0.0014664975,0.0012059704,0.002587263,0.001974386,0.0056852624,0.0031396735,0.0025374396,0.002290977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002255697,0.0001248252,0.0010613522,0.00025682105,0.000041007745,0.00043764294,0.0010784764,0.010604851,0.0037809894,0.94205594,0.0074641854,0.032868214],"study_design_scores_gemma":[0.00003008699,0.000036807003,0.00062787376,0.00009095914,0.00002663062,0.00036048843,0.0005964379,0.02536705,0.0019481557,0.9622625,0.008630387,0.000022598311],"about_ca_topic_score_codex":0.0009479545,"about_ca_topic_score_gemma":0.0012414326,"teacher_disagreement_score":0.014769703,"about_ca_system_score_codex":0.0011265771,"about_ca_system_score_gemma":0.00035715703,"threshold_uncertainty_score":0.04940957},"labels":[],"label_agreement":null},{"id":"W179046744","doi":"","title":"Partial Parallelisms With Sharply Two-Transitive Skew Spreads.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Quasicrystal Structures and Properties","field":"Materials Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Skew; Mathematics; Transitive relation; Combinatorics; Computer science; Telecommunications","score_opus":0.008912858752650831,"score_gpt":0.22095376299266414,"score_spread":0.21204090424001332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W179046744","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62974155,0.0005976154,0.102490224,0.000733592,0.0002041454,0.00008514609,0.0007114874,0.0005336298,0.26490256],"genre_scores_gemma":[0.9681828,0.00017193417,0.0123937065,0.00010336685,0.00006276439,0.000038596063,0.00024433833,0.00010298744,0.01869941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996767,0.00006066809,0.00002256419,0.0000533812,0.000120783574,0.000065874],"domain_scores_gemma":[0.99941266,0.00014164932,0.00012086435,0.00013094314,0.00009583248,0.00009813428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002718336,0.00029467297,0.00022400208,0.0009717691,0.0008234517,0.0019177081,0.00037449275,0.00034437826,0.009940317],"category_scores_gemma":[0.0012017253,0.00021779866,0.00026004558,0.00058000576,0.001377976,0.002296432,0.0010907582,0.0006596973,0.0008846275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022257274,0.000007860287,0.00019228067,0.00001305693,0.0000028497298,0.000070974165,0.000073570125,0.00042218142,0.0017110541,0.99355066,0.0007380705,0.0031951766],"study_design_scores_gemma":[0.000023883751,0.00002373561,0.000475337,0.00001260423,0.0000065660333,0.00043924627,0.00015057798,0.0054519046,0.0029946468,0.98109686,0.009311062,0.000013504477],"about_ca_topic_score_codex":0.00057306356,"about_ca_topic_score_gemma":0.0010830066,"teacher_disagreement_score":0.009940317,"about_ca_system_score_codex":0.0005084775,"about_ca_system_score_gemma":0.00037553828,"threshold_uncertainty_score":0.03325373},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bounding overwatch; Independence (probability theory); Combinatorics; Statistics; Artificial intelligence; Computer science","score_opus":0.04643839219436271,"score_gpt":0.30948513663570454,"score_spread":0.26304674444134185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W179124857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23842964,0.0016349602,0.53850114,0.0041871904,0.00036522647,0.00006372491,0.00045692947,0.0006525461,0.21570854],"genre_scores_gemma":[0.94276625,0.00077975914,0.02255223,0.00036764288,0.0005705835,0.00008160906,0.0002884421,0.00032138432,0.032272086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834967,0.0004639576,0.000043442342,0.00028468386,0.0005542999,0.0003039837],"domain_scores_gemma":[0.98897237,0.008161162,0.00072509516,0.0007561587,0.0008029701,0.0005823004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017681356,0.0011783033,0.0012127403,0.0026112602,0.0017364176,0.0027850035,0.0019060132,0.0013113911,0.012816561],"category_scores_gemma":[0.014849063,0.0007128922,0.00086100487,0.0014963192,0.0037443156,0.0069264956,0.0031658302,0.006082311,0.0023262822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032345542,0.000024823354,0.00029358457,0.000048030866,0.000008884799,0.00005054584,0.00013295065,0.0045867646,0.0011710457,0.98441744,0.0022678182,0.0069656847],"study_design_scores_gemma":[0.0000066180314,0.00000737795,0.00021684557,0.000011074199,0.000006737917,0.0000465795,0.000032806045,0.034563765,0.0008991205,0.962678,0.0015205389,0.000010582909],"about_ca_topic_score_codex":0.0011391047,"about_ca_topic_score_gemma":0.0015278553,"teacher_disagreement_score":0.012816561,"about_ca_system_score_codex":0.0016790688,"about_ca_system_score_gemma":0.00078273506,"threshold_uncertainty_score":0.042875648},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Enhanced Data Rates for GSM Evolution; Degree (music); Mathematics; Computer science; Telecommunications; Physics","score_opus":0.02030007296313182,"score_gpt":0.23291870956597047,"score_spread":0.21261863660283864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W180089728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35614464,0.007888191,0.41668847,0.004239904,0.00050921104,0.00011410149,0.0024069145,0.0007811578,0.21122742],"genre_scores_gemma":[0.9500092,0.003095189,0.029830908,0.00034239897,0.00028580282,0.000113534225,0.0010875119,0.00012468794,0.015110644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994518,0.00015454674,0.000030937364,0.00014685735,0.00011110531,0.000104690494],"domain_scores_gemma":[0.99700326,0.0017195884,0.00039715646,0.00035845675,0.00028576102,0.00023581322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004609674,0.00044852437,0.0005989387,0.00088111614,0.0005763892,0.0013271512,0.0012545993,0.0008789528,0.009672966],"category_scores_gemma":[0.00541561,0.00027793553,0.00029650444,0.0011447923,0.0011407862,0.0036251405,0.0010584979,0.0012453829,0.0014006083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002143107,0.00006551453,0.0014487613,0.00037430777,0.00004610226,0.00036288062,0.00015408202,0.015101597,0.0048623993,0.9157573,0.012946524,0.048666216],"study_design_scores_gemma":[0.000029700841,0.00003578904,0.0010100425,0.00004805655,0.000026616477,0.00073652004,0.00009380811,0.020810125,0.0014832426,0.9640252,0.011686283,0.000014596357],"about_ca_topic_score_codex":0.00042894468,"about_ca_topic_score_gemma":0.00068414916,"teacher_disagreement_score":0.009672966,"about_ca_system_score_codex":0.0004082034,"about_ca_system_score_gemma":0.00024794647,"threshold_uncertainty_score":0.032359302},"labels":[],"label_agreement":null},{"id":"W180446144","doi":"","title":"Constructions Of Graphs Without Nowhere-Zero Flows From Boolean Formulas.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Zero (linguistics); Nowhere dense set; Combinatorics; Discrete mathematics; Computer science; Linguistics; Philosophy","score_opus":0.009344297948319143,"score_gpt":0.2303565491186145,"score_spread":0.22101225117029535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W180446144","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04440227,0.001663905,0.8406371,0.0033847345,0.0008118023,0.00027072604,0.0024818464,0.0040071877,0.10234049],"genre_scores_gemma":[0.48002854,0.0023584615,0.45610186,0.001969842,0.000342109,0.00048158356,0.004402704,0.002177712,0.05213722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987669,0.00039236728,0.000118882446,0.00024545362,0.00028269106,0.00019382327],"domain_scores_gemma":[0.99534214,0.002626435,0.00030861632,0.00092182826,0.0005244021,0.00027660019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015523346,0.0009255141,0.00071628665,0.0020841972,0.0024164647,0.00390625,0.0021755842,0.0014257595,0.01134885],"category_scores_gemma":[0.0071447166,0.0010554439,0.0015760297,0.0024317375,0.0025762292,0.0096995495,0.0034815758,0.0032673948,0.0030854663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052103835,0.000036322897,0.00015995493,0.00012018383,0.00001568304,0.00015129794,0.00025235218,0.00070797175,0.0013326998,0.9771987,0.0056310846,0.014341502],"study_design_scores_gemma":[0.000018596025,0.000008959997,0.00009549331,0.00006194603,0.000028384744,0.0001543591,0.00011937872,0.002331368,0.0021275438,0.97627366,0.018761916,0.00001848456],"about_ca_topic_score_codex":0.0016146577,"about_ca_topic_score_gemma":0.0027735033,"teacher_disagreement_score":0.01134885,"about_ca_system_score_codex":0.0017381699,"about_ca_system_score_gemma":0.0011378841,"threshold_uncertainty_score":0.037965655},"labels":[],"label_agreement":null},{"id":"W180549117","doi":"","title":"Maximum number of 3-paths in a graph.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Graph","score_opus":0.01570994867429192,"score_gpt":0.2926897269549101,"score_spread":0.27697977828061815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W180549117","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6745445,0.0033467049,0.14478838,0.009575427,0.0005662479,0.00031260774,0.019643087,0.0019990276,0.145224],"genre_scores_gemma":[0.81847703,0.002081976,0.1411552,0.0008773261,0.00025263886,0.00036529033,0.0071095144,0.0004601288,0.029220905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989015,0.00026509108,0.00008665042,0.00028967194,0.00020552083,0.00025148105],"domain_scores_gemma":[0.9905143,0.005629779,0.0009387005,0.00078860525,0.00081591035,0.0013126391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009382363,0.0009009972,0.0008435289,0.0017397626,0.0027085738,0.0030301893,0.0016258113,0.0021735737,0.022081954],"category_scores_gemma":[0.007574889,0.0006227452,0.0010989137,0.0015516314,0.0015380145,0.0063159326,0.0020135937,0.0017121744,0.003583681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030826076,0.0005505085,0.014786539,0.0032581887,0.00052829465,0.0015396915,0.0018060061,0.022931866,0.056461398,0.676735,0.049992185,0.1683277],"study_design_scores_gemma":[0.00019737812,0.00027078015,0.005481641,0.0003413341,0.00028794145,0.002661321,0.0008907722,0.020313054,0.017303787,0.90172267,0.050451696,0.00007763658],"about_ca_topic_score_codex":0.0007389244,"about_ca_topic_score_gemma":0.0019302965,"teacher_disagreement_score":0.022081954,"about_ca_system_score_codex":0.0009884773,"about_ca_system_score_gemma":0.0010116262,"threshold_uncertainty_score":0.073871434},"labels":[],"label_agreement":null},{"id":"W18057595","doi":"10.1107/s0108270107051104","title":"Graphs K1*4, 5, K1*5, 4, K1*4, 4, K2, 3, 4, have the property M(3).","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Property (philosophy); Combinatorics; Philosophy; Epistemology","score_opus":0.030689331042505236,"score_gpt":0.2913653033221387,"score_spread":0.26067597227963346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W18057595","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6328833,0.0007592769,0.053456135,0.0012295701,0.00053440203,0.0005239878,0.01200743,0.0017559957,0.29684988],"genre_scores_gemma":[0.8692134,0.00048974564,0.044177562,0.00030457176,0.000035983263,0.0002447959,0.012800189,0.00034392116,0.07238997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99983716,0.00001857913,0.000011373323,0.000044322795,0.000020807978,0.00006767984],"domain_scores_gemma":[0.99960357,0.00006087896,0.00012640558,0.00008684497,0.000059660473,0.00006255131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010104434,0.000776684,0.00030695894,0.0006944623,0.0014287974,0.0009884471,0.0005676256,0.0005403045,0.03856774],"category_scores_gemma":[0.0004677358,0.00025890535,0.0006482333,0.00068213744,0.0008121398,0.000978888,0.0006924117,0.00051451137,0.0059853294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002091595,0.0006563169,0.015075489,0.0020891458,0.00045821906,0.004945124,0.001101152,0.009045716,0.14298186,0.48063335,0.09848859,0.2424335],"study_design_scores_gemma":[0.00029599495,0.0005415376,0.059756625,0.0003229105,0.00039391013,0.00799608,0.0034070143,0.010093553,0.09682356,0.439111,0.3810784,0.000179463],"about_ca_topic_score_codex":0.0012920672,"about_ca_topic_score_gemma":0.0036098128,"teacher_disagreement_score":0.03856774,"about_ca_system_score_codex":0.0008163428,"about_ca_system_score_gemma":0.00057104026,"threshold_uncertainty_score":0.129022},"labels":[],"label_agreement":null},{"id":"W1809658767","doi":"","title":"Complete minors in cubic graphs with few short cycles and random cubic graphs","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cubic graph; Combinatorics; Minor (academic); Girth (graph theory); Discrete mathematics; Graph; Robertson–Seymour theorem; Kappa; Odd graph; 1-planar graph; Line graph; Humanities; Geometry; Voltage graph","score_opus":0.018937704088158314,"score_gpt":0.25736463420247574,"score_spread":0.23842693011431743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1809658767","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89758885,0.0005480415,0.084281,0.0007134157,0.00004299717,0.00007213277,0.00041018997,0.00032783026,0.016015477],"genre_scores_gemma":[0.9884433,0.00024116684,0.0071588554,0.00010989758,0.00005401747,0.000095383104,0.00024343042,0.0000805069,0.0035734843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992692,0.00017574131,0.00003559726,0.00016678173,0.00018348913,0.00016923604],"domain_scores_gemma":[0.99353176,0.0030669044,0.0011278375,0.0008393107,0.0005525099,0.0008816375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068916706,0.00036455758,0.00069346465,0.0012384475,0.0015421992,0.0015901596,0.0009537743,0.0008290369,0.003319166],"category_scores_gemma":[0.0083008725,0.00058066787,0.00065233826,0.0009315512,0.0024403273,0.00244799,0.0021963322,0.0014576834,0.00042651984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038029204,0.000108954875,0.008302913,0.00031793173,0.000047484104,0.0006740323,0.0019821303,0.031856548,0.014235876,0.9210955,0.0046980926,0.016300341],"study_design_scores_gemma":[0.000062352905,0.00009977088,0.0031986048,0.00004051867,0.0000256605,0.0011374465,0.0005766907,0.08495539,0.0049255593,0.8983925,0.0065297415,0.000055664466],"about_ca_topic_score_codex":0.0036564087,"about_ca_topic_score_gemma":0.0040279436,"teacher_disagreement_score":0.0036564087,"about_ca_system_score_codex":0.0012470969,"about_ca_system_score_gemma":0.0006459166,"threshold_uncertainty_score":0.011103749},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Partition (number theory); Dimension (graph theory); Combinatorics","score_opus":0.01299084395861121,"score_gpt":0.22616707608031614,"score_spread":0.21317623212170492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W181220164","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7620004,0.004854739,0.15157671,0.0072991983,0.00041818948,0.000084887935,0.0012251004,0.00033952325,0.07220123],"genre_scores_gemma":[0.9649568,0.001536446,0.021176498,0.00058163924,0.0005219796,0.00012471376,0.0006545246,0.00017298006,0.010274418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828964,0.0006125531,0.0000703021,0.0003319761,0.00029963555,0.000395777],"domain_scores_gemma":[0.98613423,0.009582623,0.0010924757,0.0010538771,0.00059609185,0.0015407332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022610088,0.001114708,0.0021282588,0.004038164,0.0041732616,0.007207201,0.0035910937,0.0033637485,0.0110180015],"category_scores_gemma":[0.012174322,0.0017595381,0.0013818641,0.004502766,0.007724821,0.015929427,0.005024975,0.004900218,0.00069783855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008674494,0.00003122821,0.0008033383,0.00007402472,0.000016534166,0.000026611435,0.00030179005,0.0063126646,0.0003292261,0.9850531,0.0023500589,0.004614623],"study_design_scores_gemma":[0.000023147186,0.000010114475,0.0005723449,0.000033083943,0.000018311,0.000039969047,0.00018173036,0.016331939,0.00021579245,0.9807968,0.0017547768,0.000021910342],"about_ca_topic_score_codex":0.00358696,"about_ca_topic_score_gemma":0.0033896917,"teacher_disagreement_score":0.0110180015,"about_ca_system_score_codex":0.0033299003,"about_ca_system_score_gemma":0.0010667904,"threshold_uncertainty_score":0.036858916},"labels":[],"label_agreement":null},{"id":"W181291931","doi":"","title":"Structural Properties Of Hyper-Stars.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Astronomy and Astrophysical Research","field":"Physics and Astronomy","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Stars; Mathematics; Astrophysics; Physics","score_opus":0.011704482599105719,"score_gpt":0.22975786482424626,"score_spread":0.21805338222514054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W181291931","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68145937,0.0018694488,0.10800723,0.0017742004,0.0003155715,0.00011043372,0.0029673246,0.00044911247,0.20304729],"genre_scores_gemma":[0.96385837,0.00067339663,0.011953995,0.00023759382,0.0001826775,0.00004949843,0.0019917388,0.000109503126,0.020943252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993814,0.00011568463,0.000056646102,0.0001470572,0.00018439937,0.00011478196],"domain_scores_gemma":[0.9974688,0.0005594761,0.000672487,0.00035017097,0.00049884565,0.0004501553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005386503,0.00040400884,0.0005398384,0.0022096962,0.0015961454,0.003441993,0.00085945573,0.00078317116,0.012380192],"category_scores_gemma":[0.0027002632,0.00028061174,0.00044966975,0.0021192862,0.0017964971,0.0045085596,0.0019926603,0.0009133483,0.0025835237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006501441,0.000023765397,0.0027398334,0.00006712432,0.0000123375485,0.00009869073,0.00021517486,0.00082462106,0.001459546,0.9834651,0.0017133434,0.009315327],"study_design_scores_gemma":[0.00001655896,0.000025611042,0.0019255813,0.0000261584,0.000014209507,0.0003226186,0.00024191744,0.0026803282,0.001173389,0.98282284,0.010736999,0.000013812933],"about_ca_topic_score_codex":0.00071414676,"about_ca_topic_score_gemma":0.0009489553,"teacher_disagreement_score":0.012380192,"about_ca_system_score_codex":0.00096949004,"about_ca_system_score_gemma":0.0005216403,"threshold_uncertainty_score":0.04141581},"labels":[],"label_agreement":null},{"id":"W181630308","doi":"","title":"Packing of any set of graphs into a graceful/harmonious/elegant graphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chordal graph; Maximal independent set; Indifference graph; Combinatorics; Set (abstract data type); Pathwidth; Split graph; 1-planar graph; Graph; Computer science; Programming language; Line graph","score_opus":0.01321629750535833,"score_gpt":0.2405574321996528,"score_spread":0.22734113469429448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W181630308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3794502,0.0005411803,0.48985225,0.0016290756,0.00033334285,0.00020123087,0.0013510755,0.0022243804,0.12441722],"genre_scores_gemma":[0.76456755,0.00039789107,0.20723046,0.000461519,0.00015875674,0.00016571405,0.0013364318,0.0006133891,0.025068311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931824,0.00015790961,0.000047775175,0.00018552788,0.00015023761,0.00014036657],"domain_scores_gemma":[0.9985038,0.00030323231,0.00022745275,0.00072804245,0.00007510487,0.00016239432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047632243,0.00055350544,0.0005636885,0.000828308,0.0015237805,0.002437565,0.0011343565,0.0008991705,0.010568634],"category_scores_gemma":[0.0018188806,0.00061130594,0.0010015158,0.001039165,0.0015119605,0.0036334638,0.002713549,0.0015181205,0.0018886477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025507982,0.00011080421,0.0010356044,0.00020588866,0.000057568515,0.00025795694,0.0005114674,0.014149462,0.014695029,0.9111344,0.012872841,0.04471393],"study_design_scores_gemma":[0.000041788175,0.00010761635,0.0011049595,0.000049804665,0.000059754937,0.0005437411,0.00037083548,0.043912277,0.0115407,0.9129747,0.029251244,0.000042577358],"about_ca_topic_score_codex":0.0005226775,"about_ca_topic_score_gemma":0.0007687426,"teacher_disagreement_score":0.010568634,"about_ca_system_score_codex":0.0005818118,"about_ca_system_score_gemma":0.00034425207,"threshold_uncertainty_score":0.035355628},"labels":[],"label_agreement":null},{"id":"W182153220","doi":"","title":"List Edge Colorings of Outerplanar Graphs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; 1-planar graph; Outerplanar graph; Pathwidth; Chordal graph; Graph; Computer science; Telecommunications; Line graph","score_opus":0.013430518336646532,"score_gpt":0.22812099755370047,"score_spread":0.21469047921705392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W182153220","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48892006,0.00321699,0.26842007,0.004723446,0.0005812517,0.00015242955,0.0044285133,0.002265138,0.22729214],"genre_scores_gemma":[0.8620733,0.001691149,0.07445105,0.0008811488,0.00031063132,0.000107805594,0.0041426956,0.0004985066,0.055843674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994068,0.00017374034,0.000032411095,0.00010667959,0.0000979271,0.00018244001],"domain_scores_gemma":[0.9959948,0.0023995733,0.00045195327,0.00050248986,0.0003116179,0.00033948518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048427496,0.00047932233,0.00047340489,0.0013611562,0.0017437994,0.002958014,0.0011325506,0.0010222276,0.013605725],"category_scores_gemma":[0.0040751663,0.0005098658,0.00043773212,0.0019605882,0.001088347,0.0039337347,0.0018356127,0.001528157,0.001997126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033233457,0.000106812025,0.0026047654,0.0002595291,0.000026346741,0.00020426017,0.0005487565,0.010821554,0.004724621,0.87799543,0.037742324,0.06463318],"study_design_scores_gemma":[0.000051418836,0.000044506,0.0014762995,0.00006221306,0.00003366914,0.0003402278,0.00044452152,0.023516063,0.003476274,0.93776655,0.032760426,0.00002781889],"about_ca_topic_score_codex":0.002559463,"about_ca_topic_score_gemma":0.004327138,"teacher_disagreement_score":0.013605725,"about_ca_system_score_codex":0.0015477003,"about_ca_system_score_gemma":0.00054757274,"threshold_uncertainty_score":0.045515656},"labels":[],"label_agreement":null},{"id":"W18227173","doi":"10.1128/iai.01197-07","title":"On the point-distinguishing chromatic index of complete bipartite graphs","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Institute of Allergy and Infectious Diseases","keywords":"Mathematics; Bipartite graph; Index (typography); Combinatorics; Edge coloring; Foster graph; Chromatic scale; Point (geometry); Graph; Geometry; Line graph; Computer science; Voltage graph","score_opus":0.013632681695109656,"score_gpt":0.21309405559338734,"score_spread":0.1994613738982777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W18227173","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78808695,0.0005826195,0.15700142,0.0019061955,0.00011245068,0.0002472183,0.0022286598,0.00043724157,0.049397293],"genre_scores_gemma":[0.9691019,0.0005467121,0.020264583,0.00028785673,0.0001403359,0.00018316456,0.0012667949,0.00011163827,0.008096967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999005,0.000302439,0.000030375897,0.00023706132,0.0002088636,0.00021626525],"domain_scores_gemma":[0.99370193,0.0036515184,0.0007948943,0.00044366182,0.0006669601,0.00074108475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010298869,0.0007535819,0.00072879146,0.0026224358,0.0015060432,0.0021258823,0.0014500694,0.0011721735,0.009674089],"category_scores_gemma":[0.007594968,0.00046732652,0.0004913487,0.001962061,0.002222269,0.003090463,0.0016724038,0.001368935,0.00077241636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008656283,0.0001361155,0.0055984836,0.00031852673,0.00012566999,0.00027738238,0.0007543083,0.09982923,0.013398881,0.8295459,0.0104372585,0.038712684],"study_design_scores_gemma":[0.00014518255,0.00017575837,0.0038538289,0.00007174874,0.000050958322,0.00027385878,0.00029118577,0.28289706,0.002605297,0.7027551,0.00681447,0.000065533335],"about_ca_topic_score_codex":0.0035152277,"about_ca_topic_score_gemma":0.003399768,"teacher_disagreement_score":0.009674089,"about_ca_system_score_codex":0.0027084346,"about_ca_system_score_gemma":0.0010901075,"threshold_uncertainty_score":0.032363117},"labels":[],"label_agreement":null},{"id":"W182272990","doi":"","title":"Restricted Edge Connectivity of Edge Transitive Graphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Transitive relation; Combinatorics; Computer science; Artificial intelligence","score_opus":0.009947330772996156,"score_gpt":0.21667002099512614,"score_spread":0.20672269022213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W182272990","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44242197,0.0023445007,0.35824457,0.0016157206,0.00037643465,0.00017947708,0.0025886004,0.0010093781,0.19121943],"genre_scores_gemma":[0.9594869,0.0013474054,0.023099557,0.0002562531,0.00022754246,0.00015040312,0.0017675445,0.00014101228,0.013523514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999286,0.00022201036,0.00005793005,0.00016987874,0.00015824733,0.00010609511],"domain_scores_gemma":[0.9963373,0.0019866573,0.00049827783,0.0006491236,0.00029471464,0.0002339706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003815106,0.00034670398,0.00046195314,0.0013566059,0.00068225054,0.0016262471,0.0008387707,0.00073004613,0.0108646145],"category_scores_gemma":[0.005398025,0.00034567164,0.0004076075,0.0014068794,0.0011078555,0.0035180217,0.0010773224,0.0011099571,0.00117346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012956464,0.000045892153,0.0013128251,0.0002387822,0.00004068294,0.0005536748,0.00030697105,0.009601981,0.004449915,0.9438128,0.008024213,0.031482704],"study_design_scores_gemma":[0.000032525815,0.000042682426,0.0011215606,0.000050768584,0.000042882595,0.0010619204,0.00016104708,0.029153435,0.0019908994,0.9511163,0.015207884,0.000018221539],"about_ca_topic_score_codex":0.0005992211,"about_ca_topic_score_gemma":0.00077702274,"teacher_disagreement_score":0.0108646145,"about_ca_system_score_codex":0.0004015126,"about_ca_system_score_gemma":0.0002543205,"threshold_uncertainty_score":0.03634578},"labels":[],"label_agreement":null},{"id":"W182427859","doi":"","title":"RNA secondary structures and bicoloured ordered trees.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Computational biology; Biology","score_opus":0.005378315074254503,"score_gpt":0.2104078208723109,"score_spread":0.2050295057980564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W182427859","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6415528,0.008547692,0.26169923,0.00094377936,0.0003227282,0.00007399156,0.0009854719,0.0011135997,0.08476061],"genre_scores_gemma":[0.9542578,0.0013699732,0.03162452,0.00017434506,0.00010019359,0.000059163398,0.00071062666,0.00013066885,0.011572739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998191,0.00003973642,0.000013167343,0.000043966633,0.000053173204,0.000030898656],"domain_scores_gemma":[0.99931693,0.00024356281,0.00017702732,0.000101744365,0.000054728804,0.00010608251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023648437,0.00028603425,0.0002914973,0.0010289223,0.000662844,0.0011180281,0.00039811892,0.00031729788,0.003316263],"category_scores_gemma":[0.0008333542,0.00019133258,0.0002461249,0.00069445634,0.0009038506,0.0011997535,0.0005057245,0.00043342568,0.0009181813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013338694,0.00003125212,0.00083466683,0.00016635773,0.000020602149,0.0003218856,0.00021816278,0.00876752,0.026167579,0.9231765,0.0023693761,0.037792653],"study_design_scores_gemma":[0.00001878,0.000047855166,0.0013204537,0.000036614754,0.000012790149,0.00039719098,0.00010874717,0.029689273,0.0056956788,0.948329,0.014318368,0.000025437268],"about_ca_topic_score_codex":0.00041068607,"about_ca_topic_score_gemma":0.0013100617,"teacher_disagreement_score":0.003316263,"about_ca_system_score_codex":0.00055592036,"about_ca_system_score_gemma":0.00021402015,"threshold_uncertainty_score":0.011093974},"labels":[],"label_agreement":null},{"id":"W182458970","doi":"","title":"On List (2, 1)-Labeling of Some Planar Graphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Planar; Combinatorics; Planar graph; Graph; Computer science; Computer graphics (images)","score_opus":0.011708956099348359,"score_gpt":0.2337384183170683,"score_spread":0.22202946221771994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W182458970","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48845142,0.0024209318,0.25154695,0.010301311,0.0006344012,0.00029384182,0.0059165186,0.0024857705,0.23794888],"genre_scores_gemma":[0.79614645,0.0018844458,0.14162168,0.0023662318,0.00044059614,0.00034278043,0.0062246434,0.00075867993,0.05021454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998961,0.0003078489,0.000054186527,0.00022437662,0.00016269846,0.00028997083],"domain_scores_gemma":[0.99605596,0.0022670159,0.00043721794,0.0005932971,0.00028551265,0.00036092644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082173734,0.00069101085,0.00084686704,0.0016209579,0.0029837082,0.0033846162,0.0014403475,0.0018742363,0.014077526],"category_scores_gemma":[0.004556944,0.0005668622,0.00082389073,0.002632112,0.0018782708,0.0071470644,0.0024934108,0.0024478864,0.0026277557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033939793,0.00013968864,0.0016485933,0.00035676153,0.000034957247,0.00020384988,0.0006418922,0.006700769,0.0038721538,0.90409386,0.035714142,0.046253942],"study_design_scores_gemma":[0.000059988066,0.000042746615,0.0010133574,0.000062508494,0.00004255495,0.00029812605,0.00057326374,0.015264505,0.0028060826,0.9619403,0.01786215,0.000034331628],"about_ca_topic_score_codex":0.0024503854,"about_ca_topic_score_gemma":0.0037763247,"teacher_disagreement_score":0.014077526,"about_ca_system_score_codex":0.0024021273,"about_ca_system_score_gemma":0.0011245362,"threshold_uncertainty_score":0.047093987},"labels":[],"label_agreement":null},{"id":"W182726185","doi":"","title":"On the Spectral Radius of Unicyclic Graphs with n Vertices and Edge Independence Number q.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; Combinatorics; Independence number; Enhanced Data Rates for GSM Evolution; Independence (probability theory); RADIUS; Graph; Eigenvalues and eigenvectors; Statistics; Physics; Computer science; Artificial intelligence; Quantum mechanics; Computer network","score_opus":0.017555822875046728,"score_gpt":0.2751346892003651,"score_spread":0.25757886632531835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W182726185","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7045635,0.012571963,0.15064959,0.0063216127,0.0005556763,0.000099866076,0.001265355,0.00064089213,0.123331554],"genre_scores_gemma":[0.9835143,0.0022347711,0.009259196,0.0003070082,0.00041599755,0.00009896581,0.00031848784,0.00014183485,0.0037095018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985683,0.0007362155,0.000052912306,0.00020923313,0.00022161767,0.00021178229],"domain_scores_gemma":[0.9802643,0.014765286,0.0020026024,0.0007484891,0.000835978,0.0013833251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020788566,0.0007405271,0.0011770984,0.0036363548,0.0011101601,0.0019168503,0.0019303932,0.001395493,0.005236114],"category_scores_gemma":[0.020554459,0.0005648532,0.00035567858,0.0017905786,0.003425999,0.003869834,0.0023195501,0.0016675456,0.0013986329],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006851384,0.00011056085,0.0038476791,0.00042161954,0.000089154295,0.00031332925,0.000688779,0.047534406,0.0054952335,0.8929276,0.020501168,0.02738525],"study_design_scores_gemma":[0.0000658382,0.00007883919,0.0029405968,0.00012571283,0.000047312562,0.0005027368,0.0005130896,0.109001264,0.001670467,0.87973726,0.0052581225,0.000058651764],"about_ca_topic_score_codex":0.0010984621,"about_ca_topic_score_gemma":0.0007831566,"teacher_disagreement_score":0.005236114,"about_ca_system_score_codex":0.0012998421,"about_ca_system_score_gemma":0.000417993,"threshold_uncertainty_score":0.017516553},"labels":[],"label_agreement":null},{"id":"W182912702","doi":"","title":"Several definitions of matroids.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Matroid; Mathematics; Combinatorics","score_opus":0.025569289347559657,"score_gpt":0.2771785389918423,"score_spread":0.25160924964428266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W182912702","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017841322,0.030214576,0.4565982,0.01571043,0.004157284,0.00024885382,0.0024651266,0.00090094935,0.47186327],"genre_scores_gemma":[0.3212648,0.033235367,0.49576074,0.014004091,0.0062059686,0.0013039872,0.0045486437,0.0011014834,0.122574896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997726,0.0007106363,0.00020537239,0.0005420696,0.0005915388,0.0002243766],"domain_scores_gemma":[0.99742174,0.0010427951,0.00032323116,0.00038830948,0.0005218614,0.00030217285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018607546,0.0013341607,0.0008257759,0.0037370976,0.0024160324,0.004719975,0.0022176353,0.0017441547,0.019871006],"category_scores_gemma":[0.004368544,0.00069194235,0.0014622646,0.00579247,0.003666583,0.009956526,0.0033959732,0.005890011,0.0055032135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000108151835,0.000024720366,0.00013500433,0.00010636026,0.000009904525,0.00006336306,0.00023323363,0.00016313232,0.00037668092,0.97643673,0.011699173,0.01074089],"study_design_scores_gemma":[0.000009191312,0.000023759894,0.00037036376,0.00011571617,0.000017150078,0.000646462,0.00025510526,0.0009495275,0.00063446764,0.80824226,0.1887054,0.00003056405],"about_ca_topic_score_codex":0.00084827066,"about_ca_topic_score_gemma":0.0015047401,"teacher_disagreement_score":0.019871006,"about_ca_system_score_codex":0.0020833772,"about_ca_system_score_gemma":0.00068310194,"threshold_uncertainty_score":0.06647509},"labels":[],"label_agreement":null},{"id":"W183387654","doi":"","title":"New Families of Sequential Graphs.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.018161506262625228,"score_gpt":0.2779904438686136,"score_spread":0.25982893760598835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W183387654","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17971684,0.002756729,0.5717496,0.004044074,0.0010121579,0.0003386685,0.0022132273,0.0020616676,0.23610713],"genre_scores_gemma":[0.7058388,0.002911346,0.15736577,0.0013838504,0.0009489569,0.0008747951,0.003179168,0.0009619085,0.12653543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856025,0.0003754751,0.000073025214,0.00041382512,0.0003974868,0.00018005718],"domain_scores_gemma":[0.99308664,0.0031779932,0.0007411954,0.0011367148,0.0009894803,0.0008679223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013264283,0.0007518428,0.00056840904,0.0026963917,0.0027896608,0.0025700624,0.0013441426,0.0011381464,0.021884236],"category_scores_gemma":[0.008311116,0.00087660836,0.0012829272,0.0017815153,0.0019342841,0.007822089,0.0027967044,0.002132006,0.0024596562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007317848,0.00003462837,0.0008308717,0.000088017834,0.000015969687,0.0004122104,0.00046225797,0.0011258646,0.0009966745,0.97101766,0.007497948,0.017444843],"study_design_scores_gemma":[0.000039798982,0.000044909353,0.00061600556,0.000059531325,0.000033898257,0.0014781229,0.00031906343,0.009161031,0.0010265114,0.9267593,0.060439058,0.000022959623],"about_ca_topic_score_codex":0.0006877784,"about_ca_topic_score_gemma":0.0012653003,"teacher_disagreement_score":0.021884236,"about_ca_system_score_codex":0.0014474819,"about_ca_system_score_gemma":0.00077649235,"threshold_uncertainty_score":0.07321006},"labels":[],"label_agreement":null},{"id":"W183389108","doi":"","title":"Szeged Index of a Zig-zag Polyhex Nanotube.","year":2008,"lang":"hu","type":"article","venue":"Ars Combinatoria","topic":"Graphene and Nanomaterials Applications","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Zigzag; Index (typography); Nanotube; Composite material; Geometry; Materials science; Carbon nanotube; Computer science","score_opus":0.010692921773554373,"score_gpt":0.20634873531633,"score_spread":0.19565581354277561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W183389108","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72428775,0.0007447515,0.015521764,0.0010230689,0.0012414319,0.000046271547,0.00097199425,0.0002598552,0.2559031],"genre_scores_gemma":[0.9756427,0.00029496316,0.003182109,0.00014167465,0.000061053564,0.000041468717,0.00025893096,0.000049373888,0.020327816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99991786,0.000009178976,0.000006466543,0.000014995854,0.000028023507,0.000023457831],"domain_scores_gemma":[0.99989986,0.000018390188,0.000014862295,0.000018520604,0.000018851702,0.000029431021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000068659276,0.00024022452,0.00030317105,0.001019479,0.00088007364,0.001115069,0.00029013568,0.00083634054,0.015317383],"category_scores_gemma":[0.00021484839,0.00008810501,0.000095967975,0.0004948789,0.0005705712,0.0007987425,0.000540087,0.00037660537,0.0012388563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028766625,0.00006972773,0.00078956917,0.00016851764,0.000015121152,0.0008517634,0.00011308777,0.0037260875,0.07929935,0.8918552,0.0060878913,0.01673595],"study_design_scores_gemma":[0.00007651398,0.0005391083,0.00842943,0.00014582985,0.000042615695,0.0022434117,0.0007050906,0.13453221,0.10328865,0.67520076,0.074614964,0.00018132797],"about_ca_topic_score_codex":0.00035818745,"about_ca_topic_score_gemma":0.0005273047,"teacher_disagreement_score":0.015317383,"about_ca_system_score_codex":0.0004555271,"about_ca_system_score_gemma":0.0002806928,"threshold_uncertainty_score":0.051241755},"labels":[],"label_agreement":null},{"id":"W183476718","doi":"","title":"Correction to \"All c-Bhaskar Rao designs with block size 3 and c >= -1 exist\".","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Optimal Experimental Design Methods","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Block (permutation group theory); Block size; Arithmetic; Combinatorics; Computer science","score_opus":0.12105832927030821,"score_gpt":0.37764119276679703,"score_spread":0.25658286349648884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W183476718","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005345207,0.0021674272,0.008001319,0.11093197,0.8711723,0.00007515003,0.0021116214,0.0016643936,0.0033411928],"genre_scores_gemma":[0.060359545,0.012745181,0.041258935,0.27860948,0.40188608,0.0012903404,0.0040052063,0.0030713244,0.19677389],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99282634,0.0017493466,0.0012553018,0.001076871,0.0024170838,0.00067521574],"domain_scores_gemma":[0.9342376,0.024089148,0.003928677,0.005442301,0.030200835,0.0021014942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067197992,0.002777942,0.0032884753,0.0036133153,0.0040378054,0.0029353327,0.004732484,0.0085522635,0.06668543],"category_scores_gemma":[0.12686837,0.0019519355,0.001965533,0.003539574,0.0041527245,0.0032636204,0.0026876123,0.016482098,0.038458716],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012833122,0.000011354177,0.00006774464,0.00032173423,0.000032252112,0.00017494922,0.00006546646,0.0001030957,0.00011328507,0.0033574894,0.98673034,0.008893976],"study_design_scores_gemma":[0.000188452,0.00006528304,0.0008023154,0.0004438108,0.000083337116,0.0005748939,0.00010030321,0.0008323334,0.001026759,0.009357431,0.9864275,0.000097546144],"about_ca_topic_score_codex":0.007034295,"about_ca_topic_score_gemma":0.008183264,"teacher_disagreement_score":0.06668543,"about_ca_system_score_codex":0.0036108713,"about_ca_system_score_gemma":0.0048265853,"threshold_uncertainty_score":0.22308499},"labels":[],"label_agreement":null},{"id":"W184121975","doi":"","title":"Hamiltonian Circuits in Sparse Circulant Digraphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Circulant matrix; Mathematics; Electronic circuit; Hamiltonian (control theory); Combinatorics; Mathematical optimization; Electrical engineering; Engineering","score_opus":0.013120626392343388,"score_gpt":0.22291582229135112,"score_spread":0.20979519589900775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W184121975","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5122892,0.0033510777,0.25807524,0.003917205,0.00050687883,0.0002147344,0.0022122166,0.00069797976,0.21873546],"genre_scores_gemma":[0.9536738,0.0009217543,0.020112744,0.00058951246,0.00019001766,0.00009378332,0.0006367232,0.00006592473,0.02371582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996369,0.000108149085,0.000013791914,0.000058115762,0.00008864605,0.00009437115],"domain_scores_gemma":[0.9985531,0.0008330676,0.00018892852,0.00013455747,0.00012639537,0.00016396042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024766155,0.0003061917,0.00044299482,0.0010213358,0.0008493541,0.0016130389,0.0006319312,0.000891427,0.00859199],"category_scores_gemma":[0.002310231,0.00032498877,0.00028475432,0.00097057875,0.0009653967,0.0019070966,0.00081817055,0.001158094,0.0007943488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026579843,0.000022686037,0.00016478832,0.00006341147,0.000008522669,0.00009563411,0.00007692101,0.0030893495,0.0010702936,0.98110455,0.004508952,0.0097683165],"study_design_scores_gemma":[0.000022760645,0.000016814944,0.00023251219,0.000022296073,0.000009260324,0.00013785707,0.00005363506,0.01917335,0.0005635041,0.9745105,0.005247867,0.000009633732],"about_ca_topic_score_codex":0.0012968843,"about_ca_topic_score_gemma":0.00343537,"teacher_disagreement_score":0.00859199,"about_ca_system_score_codex":0.0010681623,"about_ca_system_score_gemma":0.0005329392,"threshold_uncertainty_score":0.028743029},"labels":[],"label_agreement":null},{"id":"W184223002","doi":"","title":"On the n x n Knight Cover Problem.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Knight; Mathematics; Cover (algebra); Combinatorics; Physics; Astronomy; Engineering","score_opus":0.009955061762726578,"score_gpt":0.21334173450552674,"score_spread":0.20338667274280015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W184223002","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2848602,0.0074620056,0.26751375,0.024730759,0.0016725174,0.0003054757,0.0024610918,0.00085346337,0.41014078],"genre_scores_gemma":[0.8569767,0.005615791,0.053061977,0.0018910108,0.0015578538,0.00025321514,0.0021611215,0.00028506664,0.0781973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987577,0.00034719886,0.000045830657,0.00019272717,0.00025833977,0.00039814782],"domain_scores_gemma":[0.99679106,0.0022429153,0.00025553812,0.00035782444,0.00012890775,0.00022363507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012103394,0.00090221147,0.0012422677,0.0011888638,0.0028959601,0.0034158959,0.0013886807,0.002472949,0.019507995],"category_scores_gemma":[0.006036391,0.0005846363,0.0007070623,0.0022539727,0.0033960235,0.009706652,0.0035507153,0.0030740425,0.0028725401],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045390578,0.00012946804,0.0008830204,0.0002736748,0.00007176053,0.000440496,0.00029933263,0.02149316,0.0012429868,0.8799148,0.05260488,0.042192657],"study_design_scores_gemma":[0.00006225325,0.000028114973,0.000415907,0.00004847373,0.000022891561,0.00023521237,0.0001583584,0.019876352,0.00063159806,0.9654065,0.0130941,0.000020258065],"about_ca_topic_score_codex":0.0030926177,"about_ca_topic_score_gemma":0.003892731,"teacher_disagreement_score":0.019507995,"about_ca_system_score_codex":0.0022065674,"about_ca_system_score_gemma":0.0013303796,"threshold_uncertainty_score":0.06526077},"labels":[],"label_agreement":null},{"id":"W184330457","doi":"","title":"Disproof of a conjecture about average Steiner distance.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Steiner tree problem","score_opus":0.00927342983490126,"score_gpt":0.26342436926701246,"score_spread":0.2541509394321112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W184330457","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37708002,0.0066134576,0.23776321,0.10977028,0.0055704713,0.00012767738,0.00730234,0.0019144113,0.25385812],"genre_scores_gemma":[0.94139427,0.0016165876,0.031063482,0.006933899,0.001779483,0.00009078076,0.0032453015,0.0004134474,0.013462657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99501604,0.0012800898,0.00025871387,0.0013272496,0.0014647848,0.000653103],"domain_scores_gemma":[0.95334214,0.032627784,0.0020881656,0.006855136,0.0035108486,0.0015759512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037210812,0.0006358111,0.0020260774,0.0015965977,0.0039377427,0.0043037194,0.0032923487,0.004324655,0.012014921],"category_scores_gemma":[0.051499397,0.0008495354,0.001618821,0.0026918638,0.0054052183,0.011959774,0.005511851,0.007966976,0.002775881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005665382,0.00009079961,0.0033014591,0.00024199791,0.00011600419,0.00039691915,0.00057953375,0.0053053554,0.0016590918,0.8972894,0.0684315,0.022021368],"study_design_scores_gemma":[0.00006448371,0.00005107093,0.0012203143,0.000055928165,0.000042636293,0.0006028985,0.00028747664,0.0079843085,0.0013984322,0.9724761,0.015788382,0.00002787939],"about_ca_topic_score_codex":0.0016879451,"about_ca_topic_score_gemma":0.00154296,"teacher_disagreement_score":0.012014921,"about_ca_system_score_codex":0.00220679,"about_ca_system_score_gemma":0.0010978819,"threshold_uncertainty_score":0.040193915},"labels":[],"label_agreement":null},{"id":"W184384693","doi":"","title":"Bishop Covers of Rectangular Boards.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Architecture and Computational Design","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.008313219173113198,"score_gpt":0.18457334719564494,"score_spread":0.17626012802253174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W184384693","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22763114,0.0012280085,0.18676598,0.00040133693,0.0003670809,0.00010305731,0.00069206266,0.0005173783,0.5822939],"genre_scores_gemma":[0.78324544,0.0008834229,0.034607362,0.000205794,0.00015219284,0.00009284261,0.0010216872,0.00029201037,0.17949928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969065,0.000050462746,0.000011680406,0.00006465193,0.000091239344,0.00009132918],"domain_scores_gemma":[0.9997017,0.00010072867,0.000031986587,0.00006206683,0.000039589424,0.00006402044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011433403,0.0005953957,0.00032369097,0.0010157233,0.00096137135,0.0014307812,0.00062170293,0.0004281805,0.030515805],"category_scores_gemma":[0.0009489983,0.00041506978,0.00033891885,0.0006415699,0.0010639745,0.0015748297,0.002074398,0.0010315527,0.004218728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012460543,0.000022808495,0.00048673138,0.00010565085,0.000018255585,0.0002840054,0.000353899,0.007765757,0.0064609563,0.9339996,0.008389813,0.0419878],"study_design_scores_gemma":[0.000047577378,0.000115806855,0.0021590183,0.00013368815,0.000044346907,0.00068713416,0.00096078514,0.033818197,0.013039914,0.7948845,0.15407312,0.000035935176],"about_ca_topic_score_codex":0.0015152206,"about_ca_topic_score_gemma":0.0031835383,"teacher_disagreement_score":0.030515805,"about_ca_system_score_codex":0.00046298956,"about_ca_system_score_gemma":0.00021150164,"threshold_uncertainty_score":0.10208559},"labels":[],"label_agreement":null},{"id":"W18476074","doi":"10.1155/s1064744996000208","title":"Circular Chromatic Number of Hypergraphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chromatic scale; Mathematics; Combinatorics","score_opus":0.008835500954366925,"score_gpt":0.22611436491597733,"score_spread":0.21727886396161042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W18476074","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5040183,0.0049821655,0.15479827,0.010380418,0.0011912835,0.00031054634,0.009997645,0.00083927606,0.31348205],"genre_scores_gemma":[0.8928905,0.0028908523,0.041091714,0.0010264788,0.00058866054,0.00023297312,0.0048656985,0.00022769136,0.05618545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936026,0.00015284719,0.000033560384,0.00016129416,0.00013754443,0.00015435953],"domain_scores_gemma":[0.9962638,0.0019919982,0.00059947657,0.00033919528,0.00035533155,0.00045016664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060887623,0.0005668641,0.0005075127,0.0030079586,0.0020483453,0.002787757,0.00086421124,0.00097236095,0.018245414],"category_scores_gemma":[0.0036911392,0.0003436358,0.0005717106,0.0032866003,0.0021660929,0.0029468942,0.0012670284,0.001466499,0.0019482698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027892413,0.000049052313,0.0024108745,0.00032223287,0.000043736465,0.0002513732,0.00066294306,0.0073381243,0.0027881134,0.932979,0.019083746,0.033791948],"study_design_scores_gemma":[0.000056011562,0.000038683174,0.0024398125,0.000069024034,0.000033312077,0.0005304477,0.0003118954,0.015693344,0.0011156431,0.9437799,0.035900414,0.000031568492],"about_ca_topic_score_codex":0.0030933085,"about_ca_topic_score_gemma":0.0039652428,"teacher_disagreement_score":0.018245414,"about_ca_system_score_codex":0.0023139985,"about_ca_system_score_gemma":0.0007979737,"threshold_uncertainty_score":0.061037064},"labels":[],"label_agreement":null},{"id":"W184891553","doi":"","title":"On the Decomposition of Graphs Into Cliques.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Decomposition; Combinatorics; Biology","score_opus":0.011175043424231097,"score_gpt":0.29203822280072705,"score_spread":0.28086317937649596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W184891553","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062649496,0.014041583,0.71258676,0.01096436,0.0014608263,0.00021744514,0.0015700052,0.00080491503,0.19570461],"genre_scores_gemma":[0.4365956,0.0130948145,0.44104072,0.005457176,0.0036688426,0.0004179105,0.004496039,0.0014917532,0.09373701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982986,0.00073443895,0.00007472704,0.0003216952,0.0002976636,0.00027294914],"domain_scores_gemma":[0.99372417,0.003918359,0.00037894264,0.0010124729,0.00043689884,0.0005291631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020284506,0.0011392713,0.0012193071,0.0028190452,0.0025640153,0.003318456,0.0018521141,0.0021013203,0.013479481],"category_scores_gemma":[0.009117698,0.001016704,0.0016041939,0.0033245757,0.0049753934,0.012265849,0.0032939091,0.0052306354,0.003927352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006212874,0.000050803937,0.00051568565,0.00018474899,0.000048110844,0.00012634462,0.00041125555,0.0034015963,0.000889912,0.9436462,0.023426535,0.027236603],"study_design_scores_gemma":[0.000008795767,0.000007666817,0.00024355674,0.000034717013,0.000014085789,0.00008525895,0.0000830307,0.004481818,0.00015576648,0.98580176,0.009076149,0.000007399225],"about_ca_topic_score_codex":0.0033573888,"about_ca_topic_score_gemma":0.0052378625,"teacher_disagreement_score":0.013479481,"about_ca_system_score_codex":0.0018137832,"about_ca_system_score_gemma":0.0007675454,"threshold_uncertainty_score":0.045093298},"labels":[],"label_agreement":null},{"id":"W185444019","doi":"","title":"On (k, l)-Kernels of Orientations of Special Graphs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Pure mathematics","score_opus":0.014002163972422663,"score_gpt":0.25455600148164176,"score_spread":0.2405538375092191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W185444019","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5595967,0.0007131843,0.35760117,0.0007046956,0.0002581847,0.000108624015,0.0005284063,0.00089261995,0.07959635],"genre_scores_gemma":[0.9452396,0.00037748506,0.035144366,0.00016603903,0.000116400224,0.000056729103,0.00050360896,0.0003411466,0.018054562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994105,0.00012903516,0.00003196672,0.00010681375,0.00014847041,0.0001732965],"domain_scores_gemma":[0.99838126,0.00057653803,0.00029184166,0.00026020678,0.0002014461,0.00028870744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047638055,0.0004395657,0.0005345474,0.0018819064,0.001097757,0.0022742026,0.000873485,0.0008245018,0.0077234693],"category_scores_gemma":[0.0031126419,0.00041438386,0.0006896164,0.0009748511,0.002077225,0.0029015501,0.0027017763,0.0013563425,0.0014878552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008669553,0.000040867406,0.0012227778,0.00006590544,0.000011790676,0.00018033489,0.0004241754,0.003395791,0.002838158,0.96584344,0.0036697017,0.02222045],"study_design_scores_gemma":[0.000023783266,0.00003340609,0.0009803079,0.000037754195,0.000015553018,0.00035972794,0.00036094463,0.022239259,0.0027062935,0.96608824,0.0071316576,0.000023106755],"about_ca_topic_score_codex":0.0015415591,"about_ca_topic_score_gemma":0.0020403487,"teacher_disagreement_score":0.0077234693,"about_ca_system_score_codex":0.0010485501,"about_ca_system_score_gemma":0.00031526582,"threshold_uncertainty_score":0.0258376},"labels":[],"label_agreement":null},{"id":"W185541708","doi":"","title":"Identities and Generating Functions for Certain Classes of F-Partitions.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics; Combinatorics; Algebra over a field","score_opus":0.015082864726527779,"score_gpt":0.24592150832248705,"score_spread":0.23083864359595926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W185541708","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5938776,0.00096893864,0.14394513,0.0021597564,0.00034722476,0.0001556889,0.001052098,0.0003046754,0.2571889],"genre_scores_gemma":[0.95240706,0.00042064942,0.013191208,0.00026694764,0.0002803821,0.0001576745,0.00072567875,0.00010222396,0.032448202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901986,0.0002799854,0.000050645576,0.00014920313,0.00020966039,0.0002906954],"domain_scores_gemma":[0.99737203,0.0014126274,0.0002848625,0.0002735692,0.0002564974,0.0004004857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017116144,0.00046800898,0.0006055635,0.002818934,0.0027003968,0.00407832,0.0009833754,0.001370576,0.010293094],"category_scores_gemma":[0.005502052,0.00041749503,0.0010060233,0.0012254278,0.0031912134,0.0052153487,0.0019787513,0.0021378745,0.001614302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015250447,0.000014165287,0.00026361004,0.0000081164935,0.0000021215465,0.000037847625,0.00018844716,0.00010601821,0.00018190993,0.99648213,0.00077491865,0.0019254222],"study_design_scores_gemma":[0.000014908252,0.000007641633,0.00039624865,0.000013799519,0.0000055053533,0.00017913367,0.00013125225,0.00206224,0.00038313054,0.993651,0.0031443303,0.000010805852],"about_ca_topic_score_codex":0.0009486308,"about_ca_topic_score_gemma":0.0010436912,"teacher_disagreement_score":0.010293094,"about_ca_system_score_codex":0.0016043229,"about_ca_system_score_gemma":0.0008243415,"threshold_uncertainty_score":0.03443384},"labels":[],"label_agreement":null},{"id":"W185790984","doi":"","title":"A hierarchy of complete orthogonal structures","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematics and Applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Mathematics; Hierarchy; Combinatorics; Political science","score_opus":0.0681083934338239,"score_gpt":0.2962900573133898,"score_spread":0.2281816638795659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W185790984","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37588567,0.0018271814,0.31696022,0.0017572409,0.00030347996,0.00020451889,0.0020768277,0.0013766296,0.29960817],"genre_scores_gemma":[0.79852504,0.0016968336,0.1257867,0.0006427974,0.0003800162,0.00024550388,0.002490753,0.00047899844,0.06975331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980069,0.0003600241,0.00014876356,0.00030687373,0.00071818114,0.00045924378],"domain_scores_gemma":[0.99713564,0.0008304491,0.00028066672,0.00055979594,0.00072266633,0.00047076264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001089316,0.0007526811,0.0012588684,0.002984205,0.0037485498,0.0056748325,0.0012086338,0.0011281606,0.013546772],"category_scores_gemma":[0.0032189908,0.0011340113,0.0010061695,0.0035090616,0.0028743888,0.007120876,0.003793859,0.0024714402,0.002676023],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021088053,0.000018012846,0.00019678069,0.000027965814,0.0000051801953,0.000039535313,0.0001776086,0.00017456895,0.00064939243,0.9882063,0.0013826217,0.009100892],"study_design_scores_gemma":[0.000015842284,0.000019136105,0.00040037598,0.000027123288,0.000016825501,0.00016916089,0.00018640132,0.0021688442,0.0005483997,0.9830852,0.01334434,0.000018415281],"about_ca_topic_score_codex":0.0014490989,"about_ca_topic_score_gemma":0.002278189,"teacher_disagreement_score":0.013546772,"about_ca_system_score_codex":0.0013816601,"about_ca_system_score_gemma":0.0011857406,"threshold_uncertainty_score":0.045318425},"labels":[],"label_agreement":null},{"id":"W186137167","doi":"","title":"Trees with equal average domination and independent domination numbers.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Domination analysis; Graph","score_opus":0.0096807429801973,"score_gpt":0.2558306158770472,"score_spread":0.2461498728968499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W186137167","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6488353,0.001753173,0.21413322,0.0016186372,0.0002199826,0.00010566534,0.0029377402,0.0007832356,0.12961298],"genre_scores_gemma":[0.96913546,0.0003825095,0.017452091,0.00024615313,0.00015448709,0.00007632241,0.0007783163,0.00012942715,0.011645351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831605,0.00036559755,0.00008180047,0.00038303202,0.0004294516,0.00042402354],"domain_scores_gemma":[0.9846821,0.009660331,0.0014528796,0.001544974,0.0014297629,0.0012300503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013141125,0.0003739494,0.00073224236,0.0022278978,0.0017026503,0.0034804163,0.0013750009,0.00099896,0.008169428],"category_scores_gemma":[0.014378031,0.0004506469,0.00048365287,0.001841232,0.0017636401,0.0047451053,0.0014187214,0.0012675668,0.0010820997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046949266,0.00010958911,0.005999496,0.00016250032,0.00009152087,0.0003864555,0.0005483813,0.013981943,0.007062372,0.9169938,0.010128398,0.044066012],"study_design_scores_gemma":[0.000053470798,0.000044148106,0.0036407071,0.000044454537,0.00008272444,0.001188919,0.00028039067,0.03677887,0.003911595,0.9448114,0.009128398,0.000034892433],"about_ca_topic_score_codex":0.0011840352,"about_ca_topic_score_gemma":0.0024871638,"teacher_disagreement_score":0.008169428,"about_ca_system_score_codex":0.0012891496,"about_ca_system_score_gemma":0.00073126704,"threshold_uncertainty_score":0.027329504},"labels":[],"label_agreement":null},{"id":"W1862735","doi":"10.1111/j.1600-0447.1991.tb03096.x","title":"Colouring walls may help to make good schedules","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Building Energy and Comfort Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.007213733345810092,"score_gpt":0.2153763631390386,"score_spread":0.2081626297932285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1862735","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08570279,0.0044045383,0.23256578,0.024063861,0.013968453,0.0012050993,0.0022274044,0.015006824,0.6208553],"genre_scores_gemma":[0.33642763,0.0041763405,0.28909564,0.0059736776,0.0014219504,0.0006362247,0.0017702621,0.0037571818,0.35674104],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995536,0.00015415471,0.00002941477,0.000057521178,0.000109433895,0.000095845084],"domain_scores_gemma":[0.99817276,0.0004302881,0.00019623016,0.00041929877,0.00035015753,0.00043125023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001140458,0.001092487,0.00050853105,0.0005622317,0.001588917,0.0016397507,0.0011456273,0.0014635156,0.13058057],"category_scores_gemma":[0.0059313616,0.00028777256,0.00063216005,0.0004050848,0.0009058016,0.002078711,0.0016177655,0.0018992996,0.061015043],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017814772,0.0007744803,0.0063740555,0.00072938995,0.00008184925,0.0016293518,0.0021459032,0.00425924,0.023926418,0.041568995,0.2479379,0.66879094],"study_design_scores_gemma":[0.00022278502,0.0011784339,0.012344854,0.0005932212,0.00007954751,0.0013535192,0.0030878752,0.0034849376,0.0077259005,0.046165623,0.9236021,0.00016115078],"about_ca_topic_score_codex":0.0011279355,"about_ca_topic_score_gemma":0.003612517,"teacher_disagreement_score":0.13058057,"about_ca_system_score_codex":0.00038232596,"about_ca_system_score_gemma":0.0006869147,"threshold_uncertainty_score":0.43683553},"labels":[],"label_agreement":null},{"id":"W186613980","doi":"","title":"The Smallest Degree Sum that Yields Potentially K2s-graphic Sequences.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Degree (music); Mathematics; Combinatorics; Physics","score_opus":0.02977802091326811,"score_gpt":0.2509795088918668,"score_spread":0.2212014879785987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W186613980","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7186926,0.0013778774,0.09370659,0.0023935314,0.00057192025,0.0001940514,0.0050364053,0.0019077903,0.1761193],"genre_scores_gemma":[0.91607934,0.000839339,0.046107046,0.00038524,0.00012667054,0.00011193978,0.002694321,0.00052972377,0.033126388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935764,0.000112456604,0.0000466453,0.00011984606,0.00014910946,0.0002141779],"domain_scores_gemma":[0.9987418,0.0005342948,0.00011123188,0.00022824889,0.00017564774,0.00020887151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033456204,0.0009162862,0.0005394832,0.0012846091,0.0018148939,0.0025551987,0.0006189313,0.00094075914,0.018634746],"category_scores_gemma":[0.003266156,0.0003433116,0.00056253,0.0011268867,0.000959214,0.0025694354,0.001584271,0.0009592642,0.005816713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030448413,0.00031865507,0.009010266,0.0020194657,0.00017058541,0.0038448104,0.0021007312,0.023634631,0.14660741,0.4948303,0.059989817,0.25442845],"study_design_scores_gemma":[0.0001895973,0.00031919804,0.0053970674,0.00030993103,0.0001566146,0.0044153123,0.0013763033,0.02588871,0.08616587,0.78448546,0.09116094,0.00013503055],"about_ca_topic_score_codex":0.0005582357,"about_ca_topic_score_gemma":0.0015981969,"teacher_disagreement_score":0.018634746,"about_ca_system_score_codex":0.0006106252,"about_ca_system_score_gemma":0.00063643104,"threshold_uncertainty_score":0.062339425},"labels":[],"label_agreement":null},{"id":"W186627527","doi":"","title":"Extremal Trees with Respect to Dominance Order.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dominance (genetics); Order (exchange); Combinatorics; Mathematical economics; Biology; Business","score_opus":0.021152460912072353,"score_gpt":0.2829915776536043,"score_spread":0.26183911674153193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W186627527","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37082267,0.002582193,0.30946395,0.0038279928,0.00048063006,0.00008908051,0.0016851964,0.00058066193,0.31046766],"genre_scores_gemma":[0.92948866,0.0010254201,0.034297504,0.00047808798,0.00039188683,0.000067440305,0.0007777147,0.00016681767,0.03330649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999062,0.00022637658,0.00004774794,0.0001895738,0.00027973298,0.00019448962],"domain_scores_gemma":[0.9972324,0.001310269,0.00037555484,0.00033148727,0.00039545738,0.0003548767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006782671,0.0003505781,0.0006578812,0.002141117,0.0017829183,0.0037247173,0.0008080239,0.0010878998,0.008504967],"category_scores_gemma":[0.0049563716,0.00042539,0.00040420724,0.0015279206,0.0017660597,0.003991865,0.0015547001,0.0022232367,0.0011742942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029625953,0.000012541954,0.00030054248,0.000026826967,0.000007757722,0.00008355065,0.00012645163,0.0009835133,0.00073286874,0.98813397,0.0019721368,0.007590315],"study_design_scores_gemma":[0.0000081083745,0.000008121593,0.00032319303,0.00001518657,0.00000791341,0.00026099366,0.00010831683,0.00406901,0.00039044168,0.9895884,0.0052131624,0.0000071335535],"about_ca_topic_score_codex":0.0008764167,"about_ca_topic_score_gemma":0.0015952771,"teacher_disagreement_score":0.008504967,"about_ca_system_score_codex":0.001149554,"about_ca_system_score_gemma":0.00046074463,"threshold_uncertainty_score":0.02845192},"labels":[],"label_agreement":null},{"id":"W186889428","doi":"","title":"On the order of close to regular graphs without a matching of given size.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Matching (statistics); Order (exchange); Combinatorics; Statistics; Business","score_opus":0.00906251706821449,"score_gpt":0.2365889048584384,"score_spread":0.2275263877902239,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W186889428","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67180234,0.0016666097,0.18783192,0.00624421,0.0004703011,0.00020381458,0.0035216627,0.0014150835,0.12684393],"genre_scores_gemma":[0.8917661,0.0008443388,0.07184214,0.0011266685,0.00036944306,0.00015679574,0.0027366518,0.0006190923,0.030538864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858534,0.00040352702,0.000086112,0.00036472824,0.00024419173,0.00031615436],"domain_scores_gemma":[0.98403335,0.009715987,0.0016492669,0.0021881056,0.0008742758,0.0015388941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012560525,0.0004976336,0.0011130569,0.0018160415,0.0022973905,0.0044836677,0.0014502696,0.0018080951,0.012666749],"category_scores_gemma":[0.01288241,0.0007478608,0.000842768,0.0016223065,0.0024153073,0.009593101,0.0022306927,0.002492345,0.0015232081],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005160345,0.00014306534,0.002659886,0.00021021522,0.000035037705,0.00014235204,0.00049333676,0.007766923,0.0024459984,0.95145786,0.011588872,0.022540497],"study_design_scores_gemma":[0.00006916055,0.000061987674,0.0010412277,0.000051331685,0.000032685653,0.00021915822,0.00039506535,0.019144606,0.0015293459,0.96931535,0.008116244,0.000023787277],"about_ca_topic_score_codex":0.002213853,"about_ca_topic_score_gemma":0.003738607,"teacher_disagreement_score":0.012666749,"about_ca_system_score_codex":0.0022981383,"about_ca_system_score_gemma":0.0010592686,"threshold_uncertainty_score":0.04237455},"labels":[],"label_agreement":null},{"id":"W18702672","doi":"10.1111/j.1365-313x.2008.03650.x","title":"with parts constrained by the leading summand.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.009043726008296997,"score_gpt":0.21922760091536053,"score_spread":0.21018387490706353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W18702672","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2887043,0.006769771,0.20294249,0.00204558,0.0026029868,0.0004662939,0.0059748003,0.0063878396,0.48410594],"genre_scores_gemma":[0.6143662,0.0016368172,0.059163302,0.001065175,0.00020933824,0.00039933398,0.0076868744,0.0012478033,0.3142252],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996407,0.000019177965,0.000020409425,0.0001504355,0.00009270847,0.00007658153],"domain_scores_gemma":[0.99963474,0.00003742157,0.00006069743,0.00009974176,0.000057831898,0.000109648376],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021091643,0.0011796914,0.00048746084,0.00060730014,0.0019942787,0.0020867249,0.0013343659,0.0011394487,0.07318414],"category_scores_gemma":[0.00070147985,0.0006121901,0.0007832917,0.00057940156,0.00091890333,0.00139136,0.0034355205,0.0011575978,0.046610165],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010332343,0.00011810641,0.010726929,0.0007890632,0.00010123529,0.005274007,0.001483318,0.0037936997,0.5332783,0.11735445,0.021050869,0.30499682],"study_design_scores_gemma":[0.00011376875,0.00057006517,0.024286306,0.00037562635,0.00019145463,0.007681145,0.0016441926,0.010366917,0.10901321,0.049270436,0.79632276,0.00016422024],"about_ca_topic_score_codex":0.0021230024,"about_ca_topic_score_gemma":0.0029145677,"teacher_disagreement_score":0.92681587,"about_ca_system_score_codex":0.0004915377,"about_ca_system_score_gemma":0.0009555194,"threshold_uncertainty_score":0.2448253},"labels":[],"label_agreement":null},{"id":"W187157619","doi":"","title":"Domination Graphs of Tournaments with Isolated Vertices.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.010761805555458954,"score_gpt":0.25894835006657946,"score_spread":0.24818654451112052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W187157619","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7279535,0.0013043956,0.11068907,0.0014850764,0.0002208327,0.00015759851,0.0017169144,0.00062530284,0.15584733],"genre_scores_gemma":[0.974853,0.00036934728,0.008263311,0.00022505494,0.00010620882,0.00007936593,0.00104385,0.000077755554,0.014982138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991054,0.0002547198,0.00004538467,0.00017458053,0.0001639252,0.0002559937],"domain_scores_gemma":[0.99508166,0.0026309453,0.00076457206,0.00038275353,0.00036760024,0.0007725355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056684896,0.0005350064,0.0006013781,0.0014772535,0.0022503585,0.0033766944,0.0012344944,0.0009438499,0.010163382],"category_scores_gemma":[0.0042042374,0.0005678648,0.0006233821,0.0015904208,0.0013246515,0.0025545524,0.0015559901,0.0011573728,0.0008175062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006016967,0.00014549756,0.0076585887,0.0002287348,0.00014465305,0.0012978065,0.0011603762,0.008971285,0.0074996515,0.91856116,0.017413126,0.03631746],"study_design_scores_gemma":[0.00018327242,0.00007822308,0.0068405475,0.0000878009,0.00012904174,0.0018818656,0.0007892182,0.03791417,0.0037056648,0.9200405,0.028302716,0.000047058416],"about_ca_topic_score_codex":0.0026986508,"about_ca_topic_score_gemma":0.0036848248,"teacher_disagreement_score":0.010163382,"about_ca_system_score_codex":0.0011580124,"about_ca_system_score_gemma":0.00047645232,"threshold_uncertainty_score":0.03399992},"labels":[],"label_agreement":null},{"id":"W187402296","doi":"","title":"Generalized Books And Cm-Snakes Are Prime Graphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Prime (order theory); Combinatorics","score_opus":0.009880115627131297,"score_gpt":0.2095767959243572,"score_spread":0.19969668029722593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W187402296","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28885862,0.002771571,0.27897894,0.008692999,0.00085127226,0.00016526268,0.0022983016,0.0012773372,0.41610563],"genre_scores_gemma":[0.7869936,0.0016819075,0.08815154,0.0015981427,0.0004961875,0.000179002,0.001766442,0.00040345837,0.11872962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918824,0.00022457387,0.00003472145,0.00028093887,0.00013432548,0.000137131],"domain_scores_gemma":[0.9976689,0.000970925,0.00031348804,0.0005170149,0.000238215,0.00029141738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000592294,0.0005267948,0.00057499716,0.0013432641,0.0024393175,0.0036825358,0.0011537096,0.0013369642,0.021356516],"category_scores_gemma":[0.0032141735,0.0005821624,0.00068456336,0.0024702402,0.0026649588,0.007275075,0.0022866933,0.002412236,0.0027329947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003172007,0.000011184832,0.00022650196,0.000041686173,0.0000047889544,0.00004848643,0.00015182987,0.00034979114,0.00036046404,0.9837489,0.005240854,0.009783807],"study_design_scores_gemma":[0.000010934323,0.000010722097,0.00035728703,0.000023769619,0.000010622456,0.00025696223,0.0002345738,0.0017032983,0.0007731994,0.96212655,0.034481425,0.000010768908],"about_ca_topic_score_codex":0.0009860022,"about_ca_topic_score_gemma":0.0015133626,"teacher_disagreement_score":0.021356516,"about_ca_system_score_codex":0.0013399879,"about_ca_system_score_gemma":0.00054751005,"threshold_uncertainty_score":0.07144469},"labels":[],"label_agreement":null},{"id":"W187688748","doi":"","title":"The generalized exponent sets of primitive, minimally strong digraphs (II).","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Exponent; Mathematics; Combinatorics; Discrete mathematics; Pure mathematics","score_opus":0.008517221550269133,"score_gpt":0.2156154293940034,"score_spread":0.20709820784373428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W187688748","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6972408,0.001020894,0.12646781,0.00093678833,0.0002450094,0.00013565732,0.0017088248,0.00030022272,0.17194398],"genre_scores_gemma":[0.9634301,0.00034418935,0.015996182,0.00020870047,0.000117023024,0.00006793552,0.00058394956,0.000054137403,0.019197721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959475,0.000076807,0.000031677184,0.00009916624,0.00010673588,0.000090781454],"domain_scores_gemma":[0.9985916,0.0006097082,0.00018862828,0.00023856861,0.0001603505,0.0002110368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003436384,0.00035144817,0.0004653195,0.0013124676,0.0011999044,0.002722733,0.00053562736,0.0005198276,0.007874233],"category_scores_gemma":[0.0023062595,0.0003869859,0.00042264667,0.0007760286,0.0013496592,0.0029431009,0.0016948736,0.0011924516,0.00081513834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057709072,0.000017209148,0.0005158551,0.00006523038,0.000010128272,0.00014203465,0.00020437452,0.00078991574,0.0018142143,0.98711616,0.0013575408,0.007909673],"study_design_scores_gemma":[0.00002936738,0.000033543398,0.0012474568,0.000044081706,0.000022701428,0.0003666355,0.00018837715,0.006069962,0.0019938638,0.9800198,0.0099659255,0.000018334642],"about_ca_topic_score_codex":0.00046392795,"about_ca_topic_score_gemma":0.0007641937,"teacher_disagreement_score":0.007874233,"about_ca_system_score_codex":0.0008146588,"about_ca_system_score_gemma":0.00040223764,"threshold_uncertainty_score":0.026341915},"labels":[],"label_agreement":null},{"id":"W187710645","doi":"","title":"Distance Independent Domination In Iterated Line Graphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Iterated function; Combinatorics; Line (geometry); Geometry; Mathematical analysis","score_opus":0.009569804928416695,"score_gpt":0.2630987710915827,"score_spread":0.253528966163166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W187710645","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7037351,0.001065331,0.15349905,0.0012149047,0.00009700712,0.000081668164,0.00039968546,0.00045772758,0.1394495],"genre_scores_gemma":[0.9703569,0.00033434856,0.011409133,0.00015469713,0.000073188545,0.000045827135,0.00018613435,0.00006284913,0.017376868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991053,0.00022843825,0.000036876783,0.00017529055,0.00028054125,0.00017354965],"domain_scores_gemma":[0.9947389,0.003244779,0.0006066788,0.0004693866,0.00047032716,0.00046997474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005555027,0.00025675687,0.00039839873,0.0011949667,0.001222053,0.0018701704,0.0010050873,0.00070363004,0.006084964],"category_scores_gemma":[0.0049902922,0.000281944,0.0004309248,0.000969128,0.0015529216,0.0028705662,0.0015680806,0.0012147871,0.00077407504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014065602,0.00006396203,0.0028558637,0.00014437438,0.00004991268,0.0005344719,0.000961181,0.0051774103,0.0069099353,0.94523907,0.004286828,0.03363629],"study_design_scores_gemma":[0.000054863533,0.000045599474,0.0019747342,0.000041759915,0.000058514885,0.00097976,0.00041036613,0.034336362,0.004615325,0.9463565,0.0110977525,0.00002844454],"about_ca_topic_score_codex":0.0010559276,"about_ca_topic_score_gemma":0.001567488,"teacher_disagreement_score":0.006084964,"about_ca_system_score_codex":0.0010774276,"about_ca_system_score_gemma":0.0003698406,"threshold_uncertainty_score":0.020356297},"labels":[],"label_agreement":null},{"id":"W188107640","doi":"","title":"Unitary Analogues Of Some Formulae Of Ingham.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematics and Applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Unitary state; Mathematics; Pure mathematics; Algebra over a field; Law","score_opus":0.03781253770959368,"score_gpt":0.31393726531864535,"score_spread":0.27612472760905166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W188107640","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09669442,0.002659909,0.13201791,0.003931507,0.0020568636,0.00007925262,0.0006781067,0.0005465292,0.76133555],"genre_scores_gemma":[0.8616613,0.0012401881,0.045058932,0.0019952538,0.0010219854,0.00008873361,0.00044950555,0.00026475202,0.08821934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994618,0.00014800245,0.000029735109,0.00008850973,0.00016138701,0.00011039845],"domain_scores_gemma":[0.99928707,0.00025618484,0.000077250574,0.00015989803,0.00014716412,0.00007259332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006442721,0.00033158198,0.00045230077,0.0010627664,0.001647424,0.0019758625,0.0006759041,0.0010194833,0.015468019],"category_scores_gemma":[0.0031019212,0.00026268224,0.0006681577,0.001201806,0.0021752974,0.0038978967,0.0017474481,0.0024150915,0.0015154761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006096047,0.0000051220995,0.000026568072,0.000010420898,0.0000015300013,0.00003525644,0.00009395281,0.000038989645,0.00014775089,0.99555784,0.0012819832,0.0027945694],"study_design_scores_gemma":[0.000007529654,0.000008887123,0.00012409595,0.000012234359,0.0000048897623,0.00010123898,0.00007007064,0.00056847575,0.00038451698,0.98834586,0.010365783,0.0000064740157],"about_ca_topic_score_codex":0.0011492852,"about_ca_topic_score_gemma":0.0014896613,"teacher_disagreement_score":0.015468019,"about_ca_system_score_codex":0.00092631206,"about_ca_system_score_gemma":0.00044449986,"threshold_uncertainty_score":0.051745713},"labels":[],"label_agreement":null},{"id":"W188570670","doi":"","title":"On Multicolor Ramsey Numbers for Even Cycles in Graphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Ramsey's theorem; Combinatorics; Discrete mathematics; Graph","score_opus":0.02371764824039489,"score_gpt":0.314858636182584,"score_spread":0.29114098794218907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W188570670","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4212491,0.013103073,0.15591581,0.006527258,0.0012616608,0.00010779264,0.0006889104,0.0006894612,0.40045696],"genre_scores_gemma":[0.9538686,0.003379291,0.020669116,0.0007214938,0.0004910832,0.00014625417,0.00020360723,0.00014825842,0.02037213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930847,0.00021422231,0.000039751558,0.00013537167,0.00017585217,0.00012632561],"domain_scores_gemma":[0.9957704,0.0027188193,0.00042844025,0.00029806956,0.00036463173,0.0004196009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013684728,0.000543572,0.00069014577,0.003314002,0.0017084081,0.0028765916,0.0011869328,0.0010954587,0.008467417],"category_scores_gemma":[0.008504767,0.00047256134,0.0004326828,0.0017655063,0.0030979998,0.008632483,0.0024832888,0.0020008276,0.0011662841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030243506,0.000013802872,0.00026233282,0.00006318713,0.0000043140926,0.000037132304,0.00019548874,0.00081119686,0.00030299064,0.9886286,0.0023888058,0.0072619133],"study_design_scores_gemma":[0.0000055499618,0.000007737685,0.00016434769,0.000035162713,0.0000046213263,0.00008464098,0.00010740516,0.0027634022,0.00019527847,0.99305236,0.0035705278,0.0000090728645],"about_ca_topic_score_codex":0.0010740458,"about_ca_topic_score_gemma":0.0016305541,"teacher_disagreement_score":0.008467417,"about_ca_system_score_codex":0.0016483268,"about_ca_system_score_gemma":0.0005435365,"threshold_uncertainty_score":0.028326273},"labels":[],"label_agreement":null},{"id":"W188596012","doi":"","title":"The Automorphism Groups of Certain Tetravalent Metacirculant Graphs.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Automorphism; Combinatorics; Pure mathematics","score_opus":0.044694503723472175,"score_gpt":0.30163214350930706,"score_spread":0.2569376397858349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W188596012","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85853463,0.00027769257,0.02016203,0.0007862788,0.00017208811,0.000044235647,0.00020940056,0.00024172294,0.11957199],"genre_scores_gemma":[0.98321515,0.0001519156,0.0031719368,0.00012572344,0.00006222908,0.000025867466,0.00017433711,0.00004595145,0.013026781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976116,0.000039694612,0.000010000961,0.000038690498,0.00006888814,0.00008151909],"domain_scores_gemma":[0.99937147,0.00015256622,0.00018867823,0.00009425076,0.00006488091,0.00012812311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018814567,0.0002890939,0.000282795,0.0013468234,0.0011701509,0.0016386689,0.00053021,0.00061335525,0.006782919],"category_scores_gemma":[0.0009916854,0.00021158376,0.00035172602,0.00068915525,0.0012432489,0.0012138648,0.00094226445,0.0008848816,0.00086512533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004867424,0.000025659381,0.00042772916,0.000016743788,0.0000059526883,0.00022755303,0.000303069,0.00085068727,0.0036334083,0.98681843,0.0014021863,0.0062399413],"study_design_scores_gemma":[0.000029583296,0.0000342105,0.0014187928,0.000021183987,0.00001589415,0.000450038,0.0003861489,0.0077275163,0.0038582974,0.9768306,0.009207712,0.000019982479],"about_ca_topic_score_codex":0.0012453893,"about_ca_topic_score_gemma":0.0016356698,"teacher_disagreement_score":0.006782919,"about_ca_system_score_codex":0.00073354493,"about_ca_system_score_gemma":0.00034560935,"threshold_uncertainty_score":0.02269113},"labels":[],"label_agreement":null},{"id":"W188669452","doi":"","title":"Determining a permutation from its set of reductions.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Permutation (music); Set (abstract data type); Combinatorics; Computer science; Programming language","score_opus":0.014844619276884742,"score_gpt":0.2667212119536093,"score_spread":0.2518765926767246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W188669452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06785267,0.0004863928,0.8542687,0.0017988067,0.00045396067,0.00039770373,0.0034165154,0.00603419,0.065290965],"genre_scores_gemma":[0.30783954,0.00049508916,0.64912593,0.00070242485,0.0002384272,0.00035585344,0.010009329,0.0025788671,0.028654447],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837744,0.000405918,0.00010388414,0.0005228352,0.00036860973,0.00022132526],"domain_scores_gemma":[0.9967372,0.0018715832,0.0001216868,0.00086123904,0.00028759582,0.000120734534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013022232,0.00098024,0.0010049581,0.0017654997,0.0015916048,0.003103173,0.0018231735,0.0012918623,0.019970508],"category_scores_gemma":[0.0069221994,0.0005168873,0.0022254663,0.0017530626,0.0014724531,0.0035564578,0.0022856873,0.0025223596,0.006544543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066466164,0.0005587823,0.0029734496,0.00090395444,0.0002506069,0.0003728613,0.00049910916,0.03951123,0.019438243,0.4047863,0.06363925,0.46640155],"study_design_scores_gemma":[0.0001038168,0.00013053461,0.0008114023,0.000084389016,0.00013945065,0.0003589789,0.0003489771,0.08508052,0.0130328555,0.86305445,0.036801882,0.00005273894],"about_ca_topic_score_codex":0.0017766511,"about_ca_topic_score_gemma":0.003935632,"teacher_disagreement_score":0.019970508,"about_ca_system_score_codex":0.0010075134,"about_ca_system_score_gemma":0.0022553222,"threshold_uncertainty_score":0.066807985},"labels":[],"label_agreement":null},{"id":"W188789192","doi":"","title":"Two Properties of the Generalized Sequence {Wn} Relevant to Recurring Decimal.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Sequence (biology); Decimal; Arithmetic; Genetics; Biology","score_opus":0.030353350422732527,"score_gpt":0.25616821161044423,"score_spread":0.2258148611877117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W188789192","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40874052,0.0014048177,0.2665138,0.0035265514,0.0012738166,0.00022005118,0.0009458035,0.00089350797,0.3164811],"genre_scores_gemma":[0.9486521,0.0004068,0.029487768,0.0007153426,0.00032793492,0.00009694764,0.0005120217,0.00017087936,0.019630186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993839,0.00014155936,0.000058580434,0.00015170095,0.00013992909,0.00012414092],"domain_scores_gemma":[0.9979284,0.0007842777,0.00026263515,0.00045256948,0.0002953959,0.00027672446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006045117,0.00035372627,0.00040964887,0.0009907043,0.001437715,0.0021241817,0.00070903497,0.0011043499,0.010295757],"category_scores_gemma":[0.0056412187,0.0002462385,0.00043606933,0.0011292918,0.0027302876,0.0030446954,0.0012188276,0.0018966383,0.0012265899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005505495,0.000017537413,0.00026529096,0.00005602485,0.000003934729,0.00026896136,0.00023642318,0.0003778574,0.00215506,0.98536694,0.0015363721,0.009660635],"study_design_scores_gemma":[0.000015511006,0.000025712376,0.0005447556,0.000022735194,0.000006791078,0.0005982036,0.00019317174,0.0018742821,0.002139828,0.9836918,0.010871701,0.000015549189],"about_ca_topic_score_codex":0.0006683315,"about_ca_topic_score_gemma":0.0009133322,"teacher_disagreement_score":0.010295757,"about_ca_system_score_codex":0.000612759,"about_ca_system_score_gemma":0.0005643457,"threshold_uncertainty_score":0.034442723},"labels":[],"label_agreement":null},{"id":"W188952203","doi":"","title":"A Note on the Relationships Between the Generalized Bernoulli and Euler Polynomials.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Representation (politics); Bernoulli's principle; Bernoulli polynomials; Algebra over a field; Euler's formula; Pure mathematics; Matrix representation; Difference polynomials; Orthogonal polynomials; Mathematical analysis","score_opus":0.08337408453583188,"score_gpt":0.303187475330235,"score_spread":0.2198133907944031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W188952203","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08003618,0.094811514,0.25370935,0.036896035,0.017747177,0.00007472959,0.0010638258,0.00046456736,0.51519656],"genre_scores_gemma":[0.76433426,0.053251874,0.076131985,0.009733098,0.022060523,0.00007901942,0.00048080858,0.0002536461,0.07367491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938214,0.00022778811,0.000022794578,0.000112005764,0.00019595725,0.000059302347],"domain_scores_gemma":[0.99799323,0.0011624965,0.00028685693,0.00018632627,0.0002350204,0.00013615278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010450643,0.00074535783,0.00049483526,0.0016222155,0.0012767111,0.0014988205,0.0013161829,0.0011867208,0.017619248],"category_scores_gemma":[0.004002711,0.00030477016,0.0003754071,0.001988449,0.0029570663,0.0039911997,0.0017998591,0.0034146202,0.0020643882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012224247,0.000008442444,0.00020461915,0.00008154766,0.0000040872637,0.00012210144,0.000083737534,0.00030522668,0.00041061928,0.98404956,0.0055850213,0.009132912],"study_design_scores_gemma":[0.0000030577507,0.000014729466,0.00039991192,0.000029651055,0.0000050524586,0.00029969623,0.000035712215,0.001843986,0.0002100117,0.962804,0.034340046,0.00001422364],"about_ca_topic_score_codex":0.0016328496,"about_ca_topic_score_gemma":0.0020348334,"teacher_disagreement_score":0.017619248,"about_ca_system_score_codex":0.00075435895,"about_ca_system_score_gemma":0.00046169077,"threshold_uncertainty_score":0.05894226},"labels":[],"label_agreement":null},{"id":"W189131776","doi":"","title":"Constrained switchings in cubic graphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.009523332103955083,"score_gpt":0.255686903082417,"score_spread":0.2461635709784619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W189131776","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5220531,0.0014904854,0.15733938,0.001903968,0.00067698053,0.00022659946,0.0021950044,0.0016741621,0.31244037],"genre_scores_gemma":[0.9387294,0.0004892653,0.026943455,0.00052359956,0.00015014733,0.0001390812,0.0012379166,0.00031339086,0.03147385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933237,0.0001265592,0.00003357757,0.00014749059,0.00016348,0.00019647893],"domain_scores_gemma":[0.9974496,0.0010476678,0.0003008597,0.0005652488,0.00024126779,0.0003954117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036347136,0.00032355677,0.00046819818,0.001019652,0.0017158851,0.00170655,0.0012536208,0.00098276,0.026855016],"category_scores_gemma":[0.0036313997,0.0004222808,0.00054938154,0.0014916657,0.0012110567,0.0026258207,0.0016342726,0.0018625658,0.0018113919],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017185911,0.00010198194,0.00089422415,0.00016933639,0.000022544298,0.00030691767,0.00029925662,0.0077424827,0.0038246477,0.9302812,0.010546669,0.045638803],"study_design_scores_gemma":[0.00004572793,0.000033493227,0.00086077873,0.000040174506,0.000018893414,0.00023691016,0.00023701052,0.02915916,0.0017064376,0.95263225,0.015002544,0.000026721289],"about_ca_topic_score_codex":0.005062349,"about_ca_topic_score_gemma":0.009715645,"teacher_disagreement_score":0.026855016,"about_ca_system_score_codex":0.0012039859,"about_ca_system_score_gemma":0.0009903017,"threshold_uncertainty_score":0.08983898},"labels":[],"label_agreement":null},{"id":"W189148624","doi":"","title":"Construction and cataloguing of nested partially balanced incomplete block designs","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"BIM and Construction Integration","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Block (permutation group theory); Mathematics; Arithmetic; Combinatorics","score_opus":0.011209438732090444,"score_gpt":0.2035605862339142,"score_spread":0.19235114750182378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W189148624","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035397798,0.00012236254,0.95218027,0.000044552515,0.000027913078,0.00013957579,0.00028747233,0.0005880385,0.011211975],"genre_scores_gemma":[0.2729105,0.00023810884,0.7095966,0.00004955341,0.000018328747,0.00030234418,0.0009708996,0.00032884098,0.015584897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99788254,0.00050089875,0.0001996588,0.00031295887,0.000910451,0.0001934831],"domain_scores_gemma":[0.9977041,0.00053911476,0.00022627747,0.0008298954,0.00059537194,0.000105140425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020018464,0.00055563427,0.0014732435,0.0018238644,0.0011222701,0.0025118636,0.0015580151,0.00073349243,0.0068313014],"category_scores_gemma":[0.004468429,0.00079613755,0.0010395027,0.0021595522,0.0012588924,0.0024909747,0.0023354192,0.0008506962,0.0016147201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016290342,0.00012890114,0.0012722985,0.00023226315,0.000038271977,0.0002380007,0.000542692,0.050534192,0.012258723,0.7157837,0.0027394418,0.21606863],"study_design_scores_gemma":[0.00009504715,0.00028613477,0.00086459133,0.00017845933,0.00013180923,0.0004842163,0.00040173501,0.31535974,0.0429349,0.5637135,0.07546549,0.00008430643],"about_ca_topic_score_codex":0.002077831,"about_ca_topic_score_gemma":0.00414458,"teacher_disagreement_score":0.0068313014,"about_ca_system_score_codex":0.0009872537,"about_ca_system_score_gemma":0.0018719061,"threshold_uncertainty_score":0.022852957},"labels":[],"label_agreement":null},{"id":"W189221645","doi":"","title":"Improved Inclusion-Exclusion for Valuations on Distributive Lattices.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Distributive property; Mathematics; Inclusion–exclusion principle; Inclusion (mineral); Pure mathematics; Social psychology; Psychology; Political science","score_opus":0.025633382983119634,"score_gpt":0.2662825039226755,"score_spread":0.24064912093955587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W189221645","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056958444,0.0014380661,0.87819964,0.0016527605,0.0008640455,0.00019401676,0.0006856166,0.0014888669,0.05851844],"genre_scores_gemma":[0.6551533,0.00074937916,0.31510788,0.00062100653,0.000674769,0.00022028976,0.0011926134,0.00065663876,0.025624141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962341,0.0011686436,0.00033815615,0.0004930933,0.0012515908,0.0005144472],"domain_scores_gemma":[0.99326575,0.003662309,0.00030535707,0.0013005906,0.00091939484,0.000546504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042914567,0.0007399713,0.0016874381,0.0016140031,0.0024401115,0.0046171574,0.0022776653,0.0010183419,0.010108974],"category_scores_gemma":[0.012434333,0.000555446,0.0017111965,0.0017882234,0.0034117184,0.011833951,0.005983849,0.0037666662,0.0020020162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024216787,0.0000970636,0.0004556207,0.0001309305,0.000027957249,0.000114363094,0.00026168613,0.0042865984,0.0013738179,0.9518679,0.005009812,0.03613202],"study_design_scores_gemma":[0.000041324947,0.000036516438,0.00015847712,0.000026238169,0.000025779802,0.00009736908,0.00007171143,0.019017816,0.0012778295,0.9705029,0.008721095,0.000022873577],"about_ca_topic_score_codex":0.0023121631,"about_ca_topic_score_gemma":0.0038622408,"teacher_disagreement_score":0.010108974,"about_ca_system_score_codex":0.0017921355,"about_ca_system_score_gemma":0.0017259044,"threshold_uncertainty_score":0.033817887},"labels":[],"label_agreement":null},{"id":"W189395912","doi":"","title":"Using Thresholds to Compute Chromatic Polynomials.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics","score_opus":0.028152259977880595,"score_gpt":0.27192839575572664,"score_spread":0.24377613577784604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W189395912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22594218,0.0012129878,0.7135139,0.00075937464,0.0005997646,0.0001805368,0.0015140875,0.008238958,0.048038125],"genre_scores_gemma":[0.8652215,0.0003285252,0.12116011,0.00016817455,0.00010820745,0.00009174466,0.0016631216,0.0007753368,0.010483296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989054,0.00014413771,0.000064843916,0.00023820292,0.00035916458,0.00028819474],"domain_scores_gemma":[0.99752766,0.0008391328,0.00017262607,0.0008152899,0.0004115423,0.00023364705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008531319,0.0006022192,0.00073417847,0.00235073,0.0012599797,0.0031880261,0.0012042806,0.00062961335,0.009221098],"category_scores_gemma":[0.006967285,0.00038445953,0.00063097157,0.002509411,0.0013167309,0.0051390016,0.0025195049,0.0020514445,0.0027655868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009042971,0.00020280245,0.009114226,0.00023679886,0.00011372097,0.00017816552,0.00048732458,0.048019577,0.021742905,0.64309317,0.024323193,0.25158387],"study_design_scores_gemma":[0.00006745642,0.00012582944,0.0017306192,0.00005680194,0.000046344216,0.0001202347,0.00022422451,0.2479326,0.018147843,0.7184728,0.013013972,0.000061308514],"about_ca_topic_score_codex":0.006412206,"about_ca_topic_score_gemma":0.010475149,"teacher_disagreement_score":0.009221098,"about_ca_system_score_codex":0.0019293939,"about_ca_system_score_gemma":0.0015505591,"threshold_uncertainty_score":0.030847669},"labels":[],"label_agreement":null},{"id":"W189412359","doi":"","title":"Pattern avoiding colorings of Euclidean spaces.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Euclidean geometry; Pure mathematics; Combinatorics; Geometry","score_opus":0.02023108454050174,"score_gpt":0.21445814588080261,"score_spread":0.19422706134030088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W189412359","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47059473,0.0019351192,0.3315666,0.003326854,0.0005787108,0.0001004482,0.0018809995,0.0009340777,0.18908247],"genre_scores_gemma":[0.85943365,0.0009307415,0.08942057,0.0006338002,0.00022977467,0.000115444454,0.0016140271,0.0002898735,0.047332156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991335,0.00027451638,0.000052813462,0.00018710879,0.00017577143,0.00017632885],"domain_scores_gemma":[0.997591,0.0011025261,0.0003370406,0.00048537366,0.00021067861,0.00027332254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005397782,0.00048519165,0.00054986245,0.0011317013,0.0015764214,0.0026598854,0.001134391,0.0010072173,0.009960831],"category_scores_gemma":[0.003241688,0.0005067579,0.00058101275,0.0015785431,0.0014368478,0.003341814,0.0020042115,0.0018426864,0.0015583928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007135173,0.000029776977,0.00069292594,0.00006952652,0.0000115740595,0.000070283786,0.0001560979,0.0036219524,0.0012996403,0.9697296,0.0074155084,0.016831698],"study_design_scores_gemma":[0.000020812762,0.000018696515,0.0004084563,0.000021575246,0.00000961748,0.00022449184,0.0001339085,0.011811667,0.0010184215,0.9764227,0.009897788,0.000011722843],"about_ca_topic_score_codex":0.0014727939,"about_ca_topic_score_gemma":0.002411386,"teacher_disagreement_score":0.009960831,"about_ca_system_score_codex":0.0012627767,"about_ca_system_score_gemma":0.0004963734,"threshold_uncertainty_score":0.033322275},"labels":[],"label_agreement":null},{"id":"W189599242","doi":"","title":"On Self-Complementary Vertex-Transitive Graphs Of Order A Product Of Distinct Primes.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Transitive relation; Order (exchange); Discrete mathematics; Graph; Business","score_opus":0.015794383293306808,"score_gpt":0.25829374774745373,"score_spread":0.2424993644541469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W189599242","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5951509,0.0019411589,0.1451503,0.0019069369,0.0006092629,0.00012811332,0.0007383353,0.0006085716,0.25376636],"genre_scores_gemma":[0.9541656,0.0008601213,0.017883617,0.00034707016,0.00035324178,0.000064247215,0.00038257867,0.00012122716,0.025822202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992244,0.0002405602,0.00003695773,0.00014323878,0.0001790693,0.00017582598],"domain_scores_gemma":[0.99768,0.0009992752,0.0005128164,0.00023831923,0.00019511429,0.0003744019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078050466,0.00055510836,0.00063813076,0.002079742,0.0020655938,0.002629656,0.0008357924,0.0007929505,0.0075210663],"category_scores_gemma":[0.0024880052,0.00050273095,0.000664988,0.00133876,0.0026852193,0.0058520604,0.0020075447,0.001338472,0.0011551616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027695633,0.00001500762,0.00018447905,0.000027948732,0.0000070169785,0.00009307577,0.00015656937,0.00045135603,0.0004802413,0.9955432,0.00085523684,0.0021583538],"study_design_scores_gemma":[0.000013868086,0.000012596126,0.00018525148,0.0000120616905,0.000009660392,0.00015972965,0.0001069895,0.0015656069,0.00040004266,0.9951315,0.0023947058,0.000007996909],"about_ca_topic_score_codex":0.00075463107,"about_ca_topic_score_gemma":0.0013454075,"teacher_disagreement_score":0.0075210663,"about_ca_system_score_codex":0.0010136497,"about_ca_system_score_gemma":0.0004895843,"threshold_uncertainty_score":0.025160491},"labels":[],"label_agreement":null},{"id":"W190437119","doi":"","title":"On the matching polynomials of the complete n-partite graph.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Matching (statistics); Combinatorics; Graph; Discrete mathematics; Statistics","score_opus":0.045669660856966686,"score_gpt":0.2916617731814702,"score_spread":0.2459921123245035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W190437119","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6455239,0.0023841632,0.16269098,0.004415724,0.0006965619,0.00009881285,0.0012460889,0.00029217367,0.18265153],"genre_scores_gemma":[0.9611887,0.0013670333,0.011698383,0.00035779062,0.00056386687,0.00004328897,0.00043482464,0.00009842743,0.024247715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951434,0.00014104861,0.0000094471725,0.00007178978,0.00011597862,0.00014749198],"domain_scores_gemma":[0.9985875,0.0007645457,0.0002364992,0.000120585944,0.00013252872,0.00015835433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055742747,0.00045013943,0.0005187169,0.0012852185,0.0010665745,0.001434568,0.0008974321,0.0007838353,0.009561598],"category_scores_gemma":[0.0044027544,0.00028331098,0.00050678203,0.0013668669,0.0017192429,0.0027754745,0.0011808983,0.0016809017,0.0018601613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014922618,0.0000674837,0.0008696558,0.00014164973,0.000016839273,0.00017533777,0.0003389907,0.013336776,0.0016137362,0.9447767,0.0115413135,0.026972283],"study_design_scores_gemma":[0.000023205923,0.00002993251,0.0008658149,0.000022655346,0.000011946445,0.00013876706,0.00011797569,0.029400554,0.0005714675,0.964177,0.0046217833,0.00001894191],"about_ca_topic_score_codex":0.0030406555,"about_ca_topic_score_gemma":0.0037530186,"teacher_disagreement_score":0.009561598,"about_ca_system_score_codex":0.0008785759,"about_ca_system_score_gemma":0.0005935257,"threshold_uncertainty_score":0.031986713},"labels":[],"label_agreement":null},{"id":"W190917613","doi":"","title":"The Use of Sklem Sequences to Generate Perfect One-Factorizations.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arithmetic","score_opus":0.030652822980997554,"score_gpt":0.21840171629374663,"score_spread":0.18774889331274908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W190917613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19696906,0.0016249926,0.5880992,0.0015744044,0.0008446313,0.00017995865,0.00045105678,0.0016135513,0.20864323],"genre_scores_gemma":[0.85639906,0.0005610392,0.11509753,0.00034978462,0.00011098342,0.00008734823,0.0003756716,0.00023019315,0.02678836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993709,0.00023127184,0.00003348296,0.00012119552,0.0001292161,0.00011389414],"domain_scores_gemma":[0.9984131,0.00071152725,0.00013834675,0.00040761766,0.00018032809,0.00014915502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070515857,0.000413512,0.00032170664,0.0009474619,0.001280757,0.0011970378,0.0005364065,0.0005906248,0.009184907],"category_scores_gemma":[0.003852431,0.00029633375,0.00038836902,0.0004828817,0.0013370527,0.002305009,0.0018120428,0.000985119,0.0024851072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001972872,0.00006645169,0.00031385082,0.000102706384,0.000011806712,0.00016716297,0.00034625098,0.0042411783,0.008283201,0.93742764,0.0061347215,0.042707693],"study_design_scores_gemma":[0.0000426655,0.000111204594,0.00017579884,0.0000715601,0.00001478668,0.00040169212,0.00015404842,0.023515822,0.014801165,0.93898726,0.021685971,0.000038014638],"about_ca_topic_score_codex":0.00037932003,"about_ca_topic_score_gemma":0.0009278131,"teacher_disagreement_score":0.009184907,"about_ca_system_score_codex":0.00046435735,"about_ca_system_score_gemma":0.00041515625,"threshold_uncertainty_score":0.030726552},"labels":[],"label_agreement":null},{"id":"W191000816","doi":"","title":"Gracefulness of Pa, b.","year":2004,"lang":"ceb","type":"article","venue":"Ars Combinatoria","topic":"Indian and Buddhist Studies","field":"Arts and Humanities","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.017615242279005332,"score_gpt":0.2224423021520842,"score_spread":0.20482705987307886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W191000816","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03381295,0.0012538404,0.049253937,0.00627038,0.0012077297,0.00007514212,0.00035981057,0.0005341733,0.9072321],"genre_scores_gemma":[0.79233694,0.0006720782,0.017106341,0.0011326324,0.00043677381,0.00013825255,0.00027133356,0.0006949485,0.1872108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984956,0.00034860888,0.000082276354,0.0004705672,0.00031563704,0.0002873387],"domain_scores_gemma":[0.9967321,0.000692177,0.00020309105,0.0011359693,0.00084516907,0.00039152274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015516712,0.00041753444,0.000504174,0.0010289723,0.0062939567,0.0061591538,0.0009178887,0.0012411459,0.02648868],"category_scores_gemma":[0.007514389,0.00044790958,0.00064670265,0.00080420275,0.010576655,0.0068562636,0.0037440541,0.0041640154,0.0062924265],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036151363,0.000009737248,0.00013568759,0.000017682512,0.000004656583,0.000054684264,0.001390205,0.000042528685,0.00036612284,0.99089104,0.0028060302,0.004245518],"study_design_scores_gemma":[0.000018209097,0.000029293737,0.0008614816,0.000037044705,0.000016023761,0.00036061066,0.0012354073,0.00036707186,0.0012056547,0.8753031,0.12054407,0.000021992135],"about_ca_topic_score_codex":0.0033768562,"about_ca_topic_score_gemma":0.003445788,"teacher_disagreement_score":0.02648868,"about_ca_system_score_codex":0.0020505444,"about_ca_system_score_gemma":0.0017931312,"threshold_uncertainty_score":0.08861351},"labels":[],"label_agreement":null},{"id":"W191044012","doi":"","title":"Cycles Containing Given Subsets in 1-Tough Graphs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.009577903490147092,"score_gpt":0.21043725183450446,"score_spread":0.20085934834435737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W191044012","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63792825,0.0010522753,0.1615883,0.0018556095,0.0004631712,0.0002925243,0.0018646015,0.00080198416,0.19415322],"genre_scores_gemma":[0.922289,0.00056538545,0.035810087,0.00051849935,0.00011907518,0.0002583396,0.0011419378,0.00017368168,0.03912394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993248,0.00016984274,0.000041539904,0.00015587133,0.00013255916,0.00017536886],"domain_scores_gemma":[0.99748397,0.0011662118,0.00042674263,0.00029514355,0.00026929748,0.00035855468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040144543,0.0003777699,0.00047272036,0.0020506254,0.0025638188,0.0028562965,0.00081329216,0.0010948578,0.014847702],"category_scores_gemma":[0.0035211574,0.0005277183,0.00050369673,0.0014259443,0.0016292568,0.003553262,0.0018551315,0.0009394362,0.0013885068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016530654,0.00003921996,0.001085297,0.0001555833,0.000028829132,0.000494075,0.00080492627,0.0028915731,0.0040157023,0.9649919,0.0062555564,0.019071925],"study_design_scores_gemma":[0.00003013948,0.000042243882,0.0012239747,0.00010290341,0.000041747302,0.00067109516,0.0007785345,0.013472875,0.0044010133,0.95340174,0.025800264,0.00003344505],"about_ca_topic_score_codex":0.0017083765,"about_ca_topic_score_gemma":0.0038886394,"teacher_disagreement_score":0.014847702,"about_ca_system_score_codex":0.001017157,"about_ca_system_score_gemma":0.0005822251,"threshold_uncertainty_score":0.049670517},"labels":[],"label_agreement":null},{"id":"W191213114","doi":"","title":"A Note on Combinatorial Identities arising from the Lagrange-Waring Interpolation Formula.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Lagrange polynomial; Interpolation (computer graphics); Applied mathematics; Algebra over a field; Pure mathematics; Mathematical analysis; Computer science; Artificial intelligence; Motion (physics)","score_opus":0.014649799155151627,"score_gpt":0.26322256634312263,"score_spread":0.248572767187971,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W191213114","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032942798,0.008956912,0.27860892,0.013706343,0.011149438,0.000082687526,0.00062985584,0.00040806681,0.653515],"genre_scores_gemma":[0.5896299,0.014720562,0.19356762,0.007773437,0.009839209,0.00022659205,0.0010579966,0.00085447193,0.1823303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994549,0.00014581309,0.000028809258,0.000070335314,0.00023617069,0.000063956926],"domain_scores_gemma":[0.9990957,0.00046501774,0.00008016818,0.00012258686,0.00014306988,0.0000934922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012253784,0.00058041496,0.00063082215,0.0015703853,0.0021476971,0.0023581302,0.0016065852,0.0012021221,0.013861211],"category_scores_gemma":[0.0036194941,0.0003581784,0.00094266987,0.0016653888,0.0025202564,0.00582235,0.0028115632,0.0046489234,0.0025183212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008127747,0.000009917815,0.00005746167,0.00003556723,0.0000026885486,0.00010145968,0.000071823524,0.00014612076,0.00024762403,0.98725265,0.005940022,0.0061265565],"study_design_scores_gemma":[0.0000033744673,0.0000070006863,0.00010905018,0.000018245555,0.0000042484844,0.00015202897,0.000028596198,0.0011354884,0.00020535552,0.9797466,0.018581415,0.000008627242],"about_ca_topic_score_codex":0.0010613115,"about_ca_topic_score_gemma":0.0020000928,"teacher_disagreement_score":0.013861211,"about_ca_system_score_codex":0.00077489245,"about_ca_system_score_gemma":0.0008066595,"threshold_uncertainty_score":0.046370387},"labels":[],"label_agreement":null},{"id":"W191381569","doi":"","title":"Plane Partition Cores.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Partition (number theory); Plane (geometry); Geometry; Combinatorics","score_opus":0.01505691274595231,"score_gpt":0.24603113048557812,"score_spread":0.23097421773962581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W191381569","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11940984,0.0016544228,0.38244638,0.001083306,0.00082874845,0.0007244943,0.0047655627,0.005034543,0.4840527],"genre_scores_gemma":[0.49787575,0.0018093996,0.23531474,0.00088135345,0.00030471978,0.00073788234,0.0099889785,0.0022020023,0.25088513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950933,0.00004181964,0.000029958605,0.0001081358,0.00015470783,0.00015615096],"domain_scores_gemma":[0.9994881,0.000055849097,0.000042573174,0.00021379645,0.00013162162,0.000068009555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021037276,0.00097145117,0.00086156005,0.0014810059,0.001272301,0.003361139,0.0011011043,0.0007444258,0.06392003],"category_scores_gemma":[0.0010712919,0.000397551,0.0006997029,0.0014776256,0.0005990549,0.0030992753,0.0026821957,0.0010658934,0.018787485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007794972,0.00037988537,0.0015942301,0.00053854723,0.00008574081,0.00035610635,0.00030910803,0.01011689,0.028009076,0.476691,0.10035114,0.38078874],"study_design_scores_gemma":[0.00019844835,0.0002865431,0.0018838842,0.00022137193,0.00011041049,0.0009619104,0.00074509525,0.058243364,0.04554583,0.47792366,0.41382456,0.00005489463],"about_ca_topic_score_codex":0.0012160508,"about_ca_topic_score_gemma":0.0031886613,"teacher_disagreement_score":0.06392003,"about_ca_system_score_codex":0.0008800723,"about_ca_system_score_gemma":0.0007677817,"threshold_uncertainty_score":0.21383375},"labels":[],"label_agreement":null},{"id":"W191581831","doi":"","title":"Triangle-Free Regular Graphs as an Extremal Family.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.023373265250316945,"score_gpt":0.2794175054579152,"score_spread":0.25604424020759825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W191581831","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6321008,0.0015805932,0.10880795,0.0025781959,0.0004006755,0.0000706197,0.00079862314,0.0006147377,0.25304776],"genre_scores_gemma":[0.96540415,0.0005130942,0.012916383,0.00021268045,0.0001235997,0.000037211263,0.00039081246,0.00011149053,0.020290513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996413,0.00008497771,0.00001414713,0.00008085387,0.00010472912,0.000073989],"domain_scores_gemma":[0.99912566,0.00032301908,0.00012562031,0.0001322227,0.00010225771,0.00019116358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036717084,0.00030083567,0.00038202852,0.001271132,0.0018434831,0.0015077292,0.0006652917,0.00093033875,0.0101904],"category_scores_gemma":[0.002106554,0.0004560952,0.00043738258,0.000748744,0.0012018959,0.0022222002,0.0013446324,0.0012569526,0.0011182165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007380717,0.00001834408,0.0005967715,0.000040536594,0.000010573402,0.00032221756,0.0002247494,0.001306493,0.0018653634,0.981471,0.0051747877,0.008895366],"study_design_scores_gemma":[0.000019124824,0.000024901501,0.0008179091,0.00003154775,0.000019979609,0.0016390827,0.00026839634,0.011124354,0.0012669958,0.9727759,0.011995898,0.00001595612],"about_ca_topic_score_codex":0.00046395554,"about_ca_topic_score_gemma":0.00069242954,"teacher_disagreement_score":0.0101904,"about_ca_system_score_codex":0.00056174106,"about_ca_system_score_gemma":0.00021966542,"threshold_uncertainty_score":0.03409028},"labels":[],"label_agreement":null},{"id":"W19160470","doi":"","title":"Some Maximally Tough Circulants.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.07599777790478122,"score_gpt":0.31215271696239266,"score_spread":0.23615493905761142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W19160470","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38281974,0.0017781951,0.073070094,0.0045756823,0.0011521808,0.00012253001,0.0010189059,0.00046978076,0.53499293],"genre_scores_gemma":[0.93018085,0.00055950304,0.017764086,0.0010265259,0.0007549147,0.00010253322,0.000531825,0.00017091584,0.048908945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991485,0.00020320728,0.000037345304,0.00012936896,0.00026525758,0.00021627055],"domain_scores_gemma":[0.9982109,0.0006751575,0.00025685126,0.00021227579,0.00025395086,0.0003909562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006775354,0.00060134544,0.0005553473,0.0017208862,0.0027338644,0.0028950914,0.0006656148,0.0009514387,0.01581206],"category_scores_gemma":[0.0034736753,0.00034319266,0.000558923,0.0010311853,0.002819521,0.0023412227,0.0018317779,0.0018914012,0.00228546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017884502,0.000008600159,0.00006341967,0.000018884595,0.0000033834294,0.00005876688,0.00008949717,0.00012060999,0.00037459258,0.9944061,0.0029179074,0.0019202421],"study_design_scores_gemma":[0.0000152540615,0.000011696253,0.00018417528,0.000015737045,0.0000059085505,0.00011934775,0.00009680351,0.0013590074,0.0003351381,0.9910653,0.006780673,0.000011004013],"about_ca_topic_score_codex":0.001178167,"about_ca_topic_score_gemma":0.0017742045,"teacher_disagreement_score":0.01581206,"about_ca_system_score_codex":0.0012128437,"about_ca_system_score_gemma":0.00067589537,"threshold_uncertainty_score":0.05289662},"labels":[],"label_agreement":null},{"id":"W191626242","doi":"","title":"Some nonexistence results for 7-dimensional ternary linear codes.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Ternary operation; Computer science; Programming language","score_opus":0.020473297060375723,"score_gpt":0.2560432509599951,"score_spread":0.23556995389961935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W191626242","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21223524,0.022964658,0.28647047,0.018950261,0.0026373188,0.00027540931,0.0023868207,0.00094572647,0.45313412],"genre_scores_gemma":[0.84221,0.014850026,0.07270292,0.004923443,0.0033204476,0.0010023891,0.002513088,0.00043320513,0.05804452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99654275,0.0007605769,0.00034784243,0.0005485092,0.0012678562,0.0005325246],"domain_scores_gemma":[0.9697276,0.024589201,0.0010566023,0.0015342218,0.0021837936,0.0009085925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045126406,0.0013920703,0.0017345268,0.003712383,0.0051629627,0.0060459855,0.0026496903,0.0028320435,0.016043805],"category_scores_gemma":[0.02487423,0.0014696738,0.0020078227,0.0034385598,0.0042517376,0.01318161,0.006993258,0.008177191,0.0052013528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017328832,0.00007600007,0.00074864377,0.00056927424,0.000055817858,0.0005473986,0.0005245511,0.0021073024,0.0024506992,0.96726394,0.010737024,0.01474622],"study_design_scores_gemma":[0.000036772995,0.00005186076,0.0003980239,0.00015382784,0.000059329905,0.0008736182,0.00022676597,0.0061267326,0.003211181,0.9738809,0.014923519,0.000057495028],"about_ca_topic_score_codex":0.00052002433,"about_ca_topic_score_gemma":0.0005282885,"teacher_disagreement_score":0.016043805,"about_ca_system_score_codex":0.0021673588,"about_ca_system_score_gemma":0.001362232,"threshold_uncertainty_score":0.053671896},"labels":[],"label_agreement":null},{"id":"W191831150","doi":"","title":"On toughness and fractional f-factors.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Toughness; Mental toughness; Composite material; Materials science; Medicine; Physical therapy","score_opus":0.01748583521772142,"score_gpt":0.23772211262947615,"score_spread":0.22023627741175472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W191831150","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28215322,0.012520346,0.19080716,0.011166897,0.0019124355,0.00006611037,0.00057075144,0.0004938195,0.5003092],"genre_scores_gemma":[0.93106747,0.0030526964,0.017508099,0.0011907782,0.0012227339,0.000054231194,0.0002616036,0.00013527056,0.04550711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906534,0.00019221741,0.0000488723,0.00018451095,0.00025134513,0.000257804],"domain_scores_gemma":[0.9974361,0.0013599427,0.00026129867,0.00025397772,0.00027860285,0.0004100265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012341934,0.0006938557,0.0007386337,0.0027122847,0.0029818108,0.0029663413,0.00077160157,0.0013152062,0.01660543],"category_scores_gemma":[0.006203373,0.0004216336,0.0008518906,0.0016841206,0.0067505534,0.010032535,0.0029535536,0.003334399,0.0016301366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024012435,0.000008540629,0.00020049456,0.000025587055,0.0000045737893,0.000057825422,0.00019064975,0.00029124334,0.00019111959,0.9934104,0.0017783437,0.0038172663],"study_design_scores_gemma":[0.000004558923,0.00000608008,0.0001736328,0.00001629359,0.000003982071,0.00007798974,0.000091803275,0.0006506897,0.00010237626,0.994624,0.004240896,0.000007685252],"about_ca_topic_score_codex":0.0024483723,"about_ca_topic_score_gemma":0.0024665724,"teacher_disagreement_score":0.01660543,"about_ca_system_score_codex":0.001677939,"about_ca_system_score_gemma":0.0005320903,"threshold_uncertainty_score":0.055550694},"labels":[],"label_agreement":null},{"id":"W191844323","doi":"","title":"On Super Edge-Magic Graphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; MAGIC (telescope); Enhanced Data Rates for GSM Evolution; Combinatorics; Astronomy; Computer science; Physics; Artificial intelligence","score_opus":0.007695456690224536,"score_gpt":0.20735049712269898,"score_spread":0.19965504043247445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W191844323","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28056163,0.005219379,0.37025878,0.008253675,0.0007351374,0.0001437501,0.0024585277,0.00094631367,0.3314228],"genre_scores_gemma":[0.82025534,0.0029777735,0.12101881,0.0019783683,0.000568298,0.00021731688,0.0024061382,0.0003660236,0.050211936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989723,0.00034774936,0.000045019384,0.00020291006,0.00022879089,0.00020326332],"domain_scores_gemma":[0.9960049,0.0023193487,0.00037078623,0.0006162571,0.0002826852,0.00040599512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010208251,0.00056052697,0.0007497329,0.00199593,0.0019541811,0.0025383679,0.001575644,0.0014566247,0.0149335135],"category_scores_gemma":[0.0045080506,0.00051863334,0.0006386811,0.0025030856,0.0024241358,0.007953872,0.0028076249,0.0026861771,0.0017683172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046092064,0.000024208637,0.00035294122,0.0000905596,0.000008705166,0.00003873583,0.000101832586,0.0018662509,0.0005486448,0.97458535,0.008021193,0.01431558],"study_design_scores_gemma":[0.000010870432,0.0000066133452,0.00021415442,0.000025525876,0.000006644911,0.00008185413,0.00009020748,0.0065458454,0.0003820509,0.98556954,0.007059761,0.000006949437],"about_ca_topic_score_codex":0.0014946786,"about_ca_topic_score_gemma":0.003140175,"teacher_disagreement_score":0.0149335135,"about_ca_system_score_codex":0.0015833774,"about_ca_system_score_gemma":0.0007013431,"threshold_uncertainty_score":0.049957633},"labels":[],"label_agreement":null},{"id":"W191955849","doi":"","title":"On the Domination Number of the Product of Two Cycles.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Product (mathematics); Combinatorics; Arithmetic; Geometry","score_opus":0.015502352550200691,"score_gpt":0.3097720243543911,"score_spread":0.2942696718041904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W191955849","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65718,0.0054129795,0.08831775,0.0044104923,0.00065214804,0.00010811304,0.0017191294,0.00028572956,0.24191363],"genre_scores_gemma":[0.97160923,0.0016470415,0.013051296,0.00027648412,0.00043927453,0.00011824926,0.00051404536,0.00013563462,0.0122087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870384,0.00042431933,0.000074848824,0.00024201069,0.0002941692,0.00026070848],"domain_scores_gemma":[0.9817508,0.014090952,0.001431673,0.00079254585,0.0007853169,0.0011487212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001653895,0.00060017215,0.00095249654,0.0037225788,0.0018731884,0.0030237513,0.001645159,0.0012684223,0.012440633],"category_scores_gemma":[0.016084956,0.00053842727,0.00046275684,0.0024618919,0.0027740295,0.006863017,0.0018410139,0.0019094342,0.0011448539],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048404327,0.00006211918,0.0038181474,0.0002705678,0.000058464404,0.00022930358,0.00052983145,0.011776709,0.0032456818,0.9311207,0.010797809,0.037606537],"study_design_scores_gemma":[0.000057321693,0.000058345882,0.0025412717,0.00011273858,0.000066060784,0.00054739317,0.00025844612,0.0366669,0.0022418872,0.9470871,0.010318221,0.000044295608],"about_ca_topic_score_codex":0.0013753638,"about_ca_topic_score_gemma":0.0017674319,"teacher_disagreement_score":0.012440633,"about_ca_system_score_codex":0.0018069992,"about_ca_system_score_gemma":0.0006179532,"threshold_uncertainty_score":0.04161805},"labels":[],"label_agreement":null},{"id":"W192156423","doi":"","title":"Multidecompositions of the complete graph.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.007819124245561936,"score_gpt":0.19302755839102267,"score_spread":0.18520843414546073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W192156423","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17906319,0.0023320017,0.4998559,0.002148363,0.00083694654,0.00020901923,0.002260579,0.0005703529,0.3127236],"genre_scores_gemma":[0.70162964,0.0015581532,0.1735146,0.0010182732,0.00062811753,0.00030112386,0.0032573617,0.0004997241,0.117593035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988739,0.0002808135,0.000067041066,0.00035880646,0.00027577262,0.00014364533],"domain_scores_gemma":[0.9974394,0.00096450245,0.0003313914,0.0005467948,0.00044783493,0.00027015927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005603958,0.000541922,0.00054935686,0.0021007913,0.0017198562,0.0027085776,0.0008297584,0.00080541143,0.022042328],"category_scores_gemma":[0.0026790893,0.000563858,0.0008564648,0.0014574045,0.001296555,0.0046887826,0.0022703898,0.0023084395,0.0038917975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040062456,0.00003486447,0.00022564412,0.00006841428,0.000020585876,0.00016382536,0.00016674552,0.000922877,0.0012936371,0.97643423,0.0043933652,0.016235773],"study_design_scores_gemma":[0.000014620454,0.000023145993,0.00036043298,0.00004338368,0.00001866667,0.00040786903,0.00017487392,0.0065703862,0.002068668,0.9674492,0.022853093,0.000015525293],"about_ca_topic_score_codex":0.00051316834,"about_ca_topic_score_gemma":0.0012447597,"teacher_disagreement_score":0.022042328,"about_ca_system_score_codex":0.00072834635,"about_ca_system_score_gemma":0.00045707537,"threshold_uncertainty_score":0.07373893},"labels":[],"label_agreement":null},{"id":"W192192786","doi":"","title":"On blocking sets of external lines to a quadric in PG(3, q), q prime .","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Quadric; Mathematics; Blocking (statistics); Prime (order theory); Pure mathematics; Combinatorics; Statistics","score_opus":0.04870560748252028,"score_gpt":0.36324773433458113,"score_spread":0.31454212685206084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W192192786","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7389873,0.00057565473,0.05990417,0.001078581,0.00019070649,0.00011797949,0.000767143,0.00052729016,0.1978511],"genre_scores_gemma":[0.9146314,0.00053591345,0.024370113,0.0005059615,0.00020016171,0.00022072285,0.0022449235,0.00039626806,0.05689452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884677,0.00028399134,0.00005491836,0.00014603767,0.00029240517,0.00037587987],"domain_scores_gemma":[0.9967213,0.0014672076,0.0005676875,0.00037870885,0.00033133637,0.0005336364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087960163,0.00073440035,0.00092227856,0.0020350823,0.004100761,0.0032591189,0.0016941645,0.0012216404,0.014570099],"category_scores_gemma":[0.0038403394,0.00076474226,0.00092161883,0.001343456,0.0024826038,0.0038948616,0.0031736223,0.002094195,0.0030743466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028404544,0.000102501435,0.0015515923,0.00007676241,0.00002466591,0.00029724932,0.0007019222,0.0037318044,0.002495032,0.9779619,0.005018858,0.0077536823],"study_design_scores_gemma":[0.00009304675,0.0000958052,0.0016244822,0.00009181393,0.00004083184,0.00033038156,0.0007629771,0.016456708,0.0026292403,0.9650949,0.012740643,0.00003904448],"about_ca_topic_score_codex":0.003513897,"about_ca_topic_score_gemma":0.003912565,"teacher_disagreement_score":0.014570099,"about_ca_system_score_codex":0.001562255,"about_ca_system_score_gemma":0.0006762256,"threshold_uncertainty_score":0.048741817},"labels":[],"label_agreement":null},{"id":"W192344717","doi":"","title":"The Edge Choosability of Cn x Pm.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Artificial intelligence; Computer science","score_opus":0.031223476808399053,"score_gpt":0.32457874639500195,"score_spread":0.2933552695866029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W192344717","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4555528,0.00067395705,0.11787473,0.0024853128,0.0003439645,0.0000864878,0.0013995747,0.00038102295,0.4212022],"genre_scores_gemma":[0.9367237,0.00042354362,0.010363844,0.00033875782,0.00014474937,0.00006422982,0.0007047937,0.00013871935,0.05109767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948704,0.00009079175,0.000020893436,0.00013761818,0.00013713683,0.00012651167],"domain_scores_gemma":[0.9988249,0.000595494,0.00013625274,0.0002170856,0.000090684895,0.00013559811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037367377,0.0003459459,0.0003531912,0.00044006732,0.0008799638,0.0019530449,0.00071896135,0.0006146995,0.02371284],"category_scores_gemma":[0.0026762483,0.0002818698,0.00037589285,0.0006501024,0.0013583241,0.0032578877,0.0017609424,0.0017465333,0.0015978181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013437665,0.000018649775,0.0006541807,0.000056422545,0.000008662519,0.00012423434,0.000115779934,0.0017440018,0.0015335592,0.9726136,0.005135703,0.017860902],"study_design_scores_gemma":[0.000045529934,0.00002858395,0.0015419804,0.000023002438,0.00002032451,0.00031500167,0.00009658361,0.009887902,0.0027128402,0.973585,0.011727659,0.000015660336],"about_ca_topic_score_codex":0.0019527958,"about_ca_topic_score_gemma":0.001904286,"teacher_disagreement_score":0.02371284,"about_ca_system_score_codex":0.00079996197,"about_ca_system_score_gemma":0.00055245234,"threshold_uncertainty_score":0.079327345},"labels":[],"label_agreement":null},{"id":"W192445291","doi":"","title":"Comparison of Convex Hulls and Box Hulls.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Robotic Mechanisms and Dynamics","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hull; Mathematics; Convex hull; Regular polygon; Geometry; Engineering; Marine engineering","score_opus":0.010531962012799817,"score_gpt":0.24252412526074232,"score_spread":0.2319921632479425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W192445291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20377216,0.0106026,0.52117723,0.0012179432,0.0006192875,0.00014615993,0.0043390235,0.0012584793,0.25686708],"genre_scores_gemma":[0.86600685,0.0045894836,0.10291528,0.00014887443,0.00021600701,0.00007612338,0.006213268,0.00052326993,0.019310882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983789,0.0003536577,0.00011811574,0.00020293404,0.0007882855,0.00015816174],"domain_scores_gemma":[0.9916965,0.0049553686,0.00066418736,0.000959396,0.0012225796,0.00050195033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001449685,0.00069533975,0.0009758752,0.004172774,0.0009631238,0.003737957,0.00092048553,0.00075705984,0.02074412],"category_scores_gemma":[0.012628593,0.00044861398,0.00079395494,0.0040847203,0.0016603944,0.006622937,0.0026302,0.0010237274,0.0022288074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043660455,0.000060398437,0.0050184843,0.00048538987,0.00008889484,0.00014952778,0.00043040988,0.036402646,0.0020412859,0.78284794,0.012398614,0.15963985],"study_design_scores_gemma":[0.00006028865,0.00028157164,0.012974165,0.00032132273,0.000108947,0.00093420665,0.0013725742,0.14557117,0.0030909162,0.7655416,0.069668576,0.00007466227],"about_ca_topic_score_codex":0.0014589097,"about_ca_topic_score_gemma":0.0020181022,"teacher_disagreement_score":0.02074412,"about_ca_system_score_codex":0.0008498111,"about_ca_system_score_gemma":0.0006800674,"threshold_uncertainty_score":0.06939596},"labels":[],"label_agreement":null},{"id":"W192669604","doi":"","title":"On an Extension of Nagell's Totient Function and Some Applications.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Euler's totient function; Mathematics; Extension (predicate logic); Computer science; Mathematical analysis; Euler's formula; Programming language","score_opus":0.015321320835616195,"score_gpt":0.22297333290140386,"score_spread":0.20765201206578768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W192669604","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03415438,0.01048511,0.56492317,0.009258454,0.0025806103,0.00013651732,0.0002944472,0.0010129227,0.37715438],"genre_scores_gemma":[0.5002632,0.013706968,0.3020837,0.0048144055,0.0032559203,0.00052368885,0.00047311143,0.0011550584,0.17372395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992455,0.00023275484,0.000031822477,0.00012534492,0.0002353703,0.00012920225],"domain_scores_gemma":[0.9982456,0.0010647397,0.000065072076,0.00026199,0.00022879394,0.00013378805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016144419,0.0009786773,0.0010033451,0.0034863784,0.0028311063,0.002422553,0.0020862045,0.0015992512,0.012595079],"category_scores_gemma":[0.0075524,0.00035843631,0.0015578624,0.004021586,0.0047365422,0.008246387,0.004950724,0.0036782539,0.002498271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016296884,0.00001485247,0.00011440997,0.00003963409,0.000004815673,0.00006672228,0.00014142142,0.00053032837,0.00014893284,0.9788134,0.0037201855,0.01638898],"study_design_scores_gemma":[0.000008602493,0.000016198735,0.00017178591,0.000034551867,0.000011749605,0.0001712187,0.000059267546,0.0040325057,0.00030437947,0.9627656,0.032408547,0.000015645648],"about_ca_topic_score_codex":0.0037782358,"about_ca_topic_score_gemma":0.0036405013,"teacher_disagreement_score":0.012595079,"about_ca_system_score_codex":0.001798156,"about_ca_system_score_gemma":0.0010745033,"threshold_uncertainty_score":0.04213476},"labels":[],"label_agreement":null},{"id":"W193222370","doi":"","title":"Sizes of Graphs with Fixed Orders and Spans for Circular-Distance-Two Labelings.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.010045241937121783,"score_gpt":0.22113801411941605,"score_spread":0.21109277218229427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W193222370","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8192203,0.00194687,0.085872255,0.005952751,0.00019978303,0.00019164216,0.01306208,0.0019534752,0.07160076],"genre_scores_gemma":[0.95923734,0.00058180233,0.027900662,0.00040302516,0.00016683985,0.00020188719,0.004353957,0.000609328,0.0065452047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979049,0.0006280045,0.00012108319,0.00049684313,0.00035853413,0.0004906376],"domain_scores_gemma":[0.96374035,0.027092557,0.0028279242,0.0029854751,0.0011382692,0.00221533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025314568,0.0007956534,0.0010875921,0.002355567,0.002003259,0.005452103,0.0033818365,0.0022497056,0.0141364755],"category_scores_gemma":[0.021441745,0.0009574728,0.0009131173,0.0023956378,0.002951156,0.0077291685,0.0020496782,0.0020268934,0.0014435257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021818154,0.0002339868,0.006699715,0.00061530893,0.00010720422,0.00032992297,0.0012272642,0.060480114,0.0072444123,0.8501608,0.040245097,0.030474432],"study_design_scores_gemma":[0.00025911495,0.00009909667,0.0028686866,0.00011298711,0.000106367945,0.000546003,0.00061717205,0.075835265,0.0059916116,0.9032844,0.010205681,0.00007366003],"about_ca_topic_score_codex":0.002441197,"about_ca_topic_score_gemma":0.003206457,"teacher_disagreement_score":0.0141364755,"about_ca_system_score_codex":0.003412414,"about_ca_system_score_gemma":0.0015982206,"threshold_uncertainty_score":0.04729116},"labels":[],"label_agreement":null},{"id":"W193517690","doi":"","title":"The number of repeated blocks in twofold extended triple systems.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arithmetic; Combinatorics","score_opus":0.00425814293118565,"score_gpt":0.1978705931960348,"score_spread":0.19361245026484916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W193517690","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71868914,0.0012562838,0.119481124,0.0009919729,0.00069514057,0.00011288701,0.0005678316,0.0003877813,0.1578178],"genre_scores_gemma":[0.97247136,0.0002564127,0.012076635,0.000120543344,0.00009464832,0.00010462446,0.00016193182,0.000050643524,0.014663258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994199,0.00016124411,0.00003647345,0.000092465416,0.0001591168,0.00013071488],"domain_scores_gemma":[0.9976762,0.0009846648,0.00034340427,0.0003406011,0.0003081158,0.00034704618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004972765,0.00026035542,0.00040241115,0.0014479761,0.0013161327,0.0016900364,0.00054756773,0.0012168091,0.013761775],"category_scores_gemma":[0.0037137608,0.00024189473,0.0002243077,0.0004940948,0.0012668238,0.0022343867,0.0010116574,0.0008118942,0.0012995747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018619686,0.000054442782,0.00085353956,0.000078948084,0.000012866307,0.00021196603,0.00018827406,0.0024097953,0.012227345,0.96629655,0.0022284603,0.015251611],"study_design_scores_gemma":[0.000041359373,0.00015767693,0.0016885941,0.000080522674,0.000026616586,0.00070699875,0.0002904662,0.028847983,0.012438563,0.9447946,0.0108689545,0.000057729343],"about_ca_topic_score_codex":0.00028175564,"about_ca_topic_score_gemma":0.0006095951,"teacher_disagreement_score":0.013761775,"about_ca_system_score_codex":0.00042508455,"about_ca_system_score_gemma":0.00043927538,"threshold_uncertainty_score":0.046037793},"labels":[],"label_agreement":null},{"id":"W193563330","doi":"","title":"On A Characterization of Balanced Matroids.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Matroid; Characterization (materials science); Mathematics; Combinatorics; Nanotechnology; Materials science","score_opus":0.008279321690776286,"score_gpt":0.2237761111528669,"score_spread":0.21549678946209064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W193563330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28045008,0.0036796478,0.43459228,0.005227924,0.00059123675,0.00017651379,0.0029881138,0.00084511156,0.27144915],"genre_scores_gemma":[0.86057633,0.0029802185,0.07137418,0.0015326828,0.00118598,0.00022964984,0.0036753125,0.00046909953,0.057976615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990766,0.00018253685,0.00006690462,0.00022450704,0.00027401166,0.00017535039],"domain_scores_gemma":[0.9974362,0.001065218,0.00038357833,0.00027741614,0.00039702386,0.0004405421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009214007,0.00075556943,0.0007368027,0.00265025,0.0014941684,0.0039934632,0.0010105103,0.0011923754,0.020559423],"category_scores_gemma":[0.0046162196,0.0005013688,0.0005995185,0.0027774666,0.0020155378,0.009778814,0.0028819619,0.002239363,0.0032576385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056910907,0.00003158206,0.00048799632,0.000058840662,0.00000937014,0.000060632086,0.0001709394,0.00074098614,0.0017510011,0.9780613,0.0048729572,0.01369751],"study_design_scores_gemma":[0.000014304939,0.00003289811,0.0004959687,0.000035321154,0.000011683794,0.00025355094,0.0001619708,0.0039491085,0.0008933419,0.9789797,0.015159335,0.000012785376],"about_ca_topic_score_codex":0.00081235735,"about_ca_topic_score_gemma":0.0009081898,"teacher_disagreement_score":0.020559423,"about_ca_system_score_codex":0.0013965413,"about_ca_system_score_gemma":0.00041034343,"threshold_uncertainty_score":0.06877816},"labels":[],"label_agreement":null},{"id":"W193929503","doi":"","title":"The splitting number and skewness of C n x C m .","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Skewness; Combinatorics; Statistics","score_opus":0.032410902846079837,"score_gpt":0.3004937461126104,"score_spread":0.2680828432665306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W193929503","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7651542,0.0009770481,0.060785547,0.0025313713,0.0006175384,0.000046330446,0.0004408809,0.00028387335,0.16916324],"genre_scores_gemma":[0.98615533,0.00021170024,0.0048447205,0.00016199097,0.00017638928,0.000026708012,0.00012428538,0.000046139827,0.008252886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994844,0.00012254056,0.000024266814,0.00008726965,0.00015516969,0.00012626075],"domain_scores_gemma":[0.99793303,0.00057559146,0.0003566806,0.00022451818,0.0003639018,0.00054634595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087498233,0.00043188196,0.0003278655,0.0023652462,0.0013521314,0.0020544191,0.000593528,0.00080490735,0.008853495],"category_scores_gemma":[0.005136133,0.00021591237,0.00026621504,0.00082852156,0.0031933603,0.0036245843,0.0017095087,0.0011464996,0.0011961443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083441206,0.000017535003,0.0014718623,0.0000217537,0.0000052415417,0.00017854788,0.00021792187,0.0006251542,0.0018551043,0.9838035,0.0024832988,0.009236681],"study_design_scores_gemma":[0.000011296408,0.00001882619,0.0015776164,0.000028938752,0.0000053573085,0.0004318839,0.00017376669,0.005434872,0.0011264317,0.9880838,0.0030899972,0.000017137569],"about_ca_topic_score_codex":0.0006974579,"about_ca_topic_score_gemma":0.00063866103,"teacher_disagreement_score":0.008853495,"about_ca_system_score_codex":0.0008375787,"about_ca_system_score_gemma":0.0005588465,"threshold_uncertainty_score":0.029617906},"labels":[],"label_agreement":null},{"id":"W194037823","doi":"","title":"An Improved Method for Finding Knight Covers.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Handwritten Text Recognition Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Knight; Physics","score_opus":0.017309905796442555,"score_gpt":0.31301052109491656,"score_spread":0.295700615298474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W194037823","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017085036,0.0008401057,0.9479485,0.00022898898,0.00037316955,0.00027871688,0.0009162066,0.005061277,0.027267983],"genre_scores_gemma":[0.11736992,0.0006253929,0.8367395,0.00022074765,0.00018750697,0.00024149798,0.0027509064,0.0012171896,0.040647294],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990232,0.000091563496,0.00007109595,0.00025724716,0.00041476847,0.00014203232],"domain_scores_gemma":[0.99911255,0.0002604031,0.000044305794,0.00031557164,0.0002100437,0.00005700485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038288932,0.000952975,0.000902899,0.003080267,0.0012809291,0.0018007245,0.0013670583,0.0008166863,0.021221867],"category_scores_gemma":[0.0027199374,0.00053639576,0.0010265171,0.002247723,0.0009305319,0.0026853702,0.0021116622,0.001338871,0.008319755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002930913,0.00015078194,0.0012419524,0.00047544859,0.00009688108,0.0004419669,0.00029235054,0.010303652,0.032120362,0.051948283,0.03694063,0.8656946],"study_design_scores_gemma":[0.00021488512,0.00042893185,0.0051704603,0.00026559643,0.00031007233,0.0038512545,0.0006735193,0.31676364,0.100485094,0.24619515,0.32540506,0.00023629655],"about_ca_topic_score_codex":0.00317779,"about_ca_topic_score_gemma":0.006791473,"teacher_disagreement_score":0.021221867,"about_ca_system_score_codex":0.00064643245,"about_ca_system_score_gemma":0.0009827553,"threshold_uncertainty_score":0.07099426},"labels":[],"label_agreement":null},{"id":"W194079889","doi":"","title":"On a-valuations of disconnected graphs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.025384215024093684,"score_gpt":0.3063423858488823,"score_spread":0.28095817082478863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W194079889","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48298144,0.0050252494,0.20579801,0.0043963436,0.0009868171,0.00011533358,0.0011999162,0.0004674433,0.29902947],"genre_scores_gemma":[0.9459105,0.0020571114,0.020896528,0.0006003347,0.0006542548,0.00008325773,0.0006804919,0.00018239317,0.028935134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990823,0.00032747144,0.00005762569,0.00016359643,0.0001915449,0.0001774827],"domain_scores_gemma":[0.995372,0.0025128222,0.0005143465,0.00032709088,0.00034905982,0.0009245809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011170752,0.000787284,0.0006454736,0.0036347709,0.0020660392,0.00420663,0.0010663079,0.001216669,0.009285227],"category_scores_gemma":[0.0046513733,0.0005368492,0.00088158017,0.0026205685,0.0037150155,0.0077762487,0.0030851904,0.0026931367,0.0013430006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004047017,0.00002309669,0.00044226923,0.000037464,0.000010587009,0.00012294661,0.0002000867,0.0006107432,0.0006141741,0.99062777,0.0017563063,0.0055141044],"study_design_scores_gemma":[0.000012837363,0.00001093949,0.00024136774,0.000022794637,0.0000067427995,0.00018476171,0.00014025279,0.0021264239,0.00019510947,0.993891,0.0031612485,0.0000066698517],"about_ca_topic_score_codex":0.00077924423,"about_ca_topic_score_gemma":0.0008531506,"teacher_disagreement_score":0.009285227,"about_ca_system_score_codex":0.0014017285,"about_ca_system_score_gemma":0.0004487994,"threshold_uncertainty_score":0.031062245},"labels":[],"label_agreement":null},{"id":"W194283047","doi":"","title":"Polynomial Algorithm for Finding Chromatic Sum for Unicyclic and Outerplanar Graphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics; Chromatic polynomial; Algorithm; Discrete mathematics","score_opus":0.01932628026623991,"score_gpt":0.2964231950449247,"score_spread":0.2770969147786848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W194283047","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15249676,0.0013589399,0.7814934,0.0021745309,0.00037049557,0.0006219254,0.0031712432,0.010356155,0.047956623],"genre_scores_gemma":[0.48645005,0.0004607607,0.48849663,0.00034965103,0.0001493168,0.0002732738,0.0048389304,0.00073356536,0.018247882],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908245,0.00014344943,0.00005949963,0.00028010548,0.0002177118,0.00021676852],"domain_scores_gemma":[0.99758685,0.0009205462,0.00018984165,0.0007298656,0.00036205092,0.00021099624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065113266,0.0009172995,0.0010010455,0.0018864853,0.0014870373,0.0022867632,0.0025339324,0.0011955446,0.01678689],"category_scores_gemma":[0.004328735,0.00044981725,0.0008450368,0.0027668036,0.00088096963,0.0034016503,0.0024643745,0.0016046392,0.004022144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018700976,0.00095795526,0.0049749943,0.0010192466,0.00027840163,0.00033283723,0.0009079526,0.039707962,0.024288421,0.093813576,0.0656954,0.76615316],"study_design_scores_gemma":[0.0010402815,0.0006185269,0.0053652567,0.00012994971,0.0004533258,0.0011388041,0.0010340875,0.57995033,0.027975151,0.34058183,0.041555356,0.00015712553],"about_ca_topic_score_codex":0.008198225,"about_ca_topic_score_gemma":0.016599746,"teacher_disagreement_score":0.01678689,"about_ca_system_score_codex":0.0017501168,"about_ca_system_score_gemma":0.003061987,"threshold_uncertainty_score":0.056157768},"labels":[],"label_agreement":null},{"id":"W194888234","doi":"","title":"An Algorithm for Constructing two disjoint Hadamard Designs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hadamard transform; Disjoint sets; Mathematics; Algorithm; Combinatorics; Mathematical analysis","score_opus":0.012072343842401518,"score_gpt":0.23182245057817272,"score_spread":0.2197501067357712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W194888234","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008466276,0.0002939636,0.9766178,0.00027398535,0.00016161193,0.00031145007,0.00042291355,0.002345577,0.011106366],"genre_scores_gemma":[0.05423822,0.00012846004,0.93881273,0.00009987128,0.000028616603,0.00035371352,0.00076793693,0.00019829394,0.005372101],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840516,0.0003962987,0.00013731251,0.00028963268,0.00058883906,0.0001828273],"domain_scores_gemma":[0.99796474,0.0007725106,0.00009749266,0.00071474345,0.0003415117,0.000109014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011741092,0.001171856,0.0010509859,0.0015355751,0.001295844,0.0015925354,0.001492347,0.0015883786,0.018363602],"category_scores_gemma":[0.004937327,0.0007436568,0.0012005211,0.0018066345,0.0007732711,0.0017898388,0.0030239928,0.0014582938,0.0073990277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007212512,0.00037994675,0.0009081594,0.00055997376,0.00017488202,0.00036959784,0.00036771936,0.014773998,0.025378566,0.11537604,0.028546857,0.812443],"study_design_scores_gemma":[0.0011367928,0.00078765344,0.0013751036,0.00023665075,0.00031409308,0.0026011,0.0005974246,0.20870739,0.054580078,0.6157541,0.11367275,0.00023683567],"about_ca_topic_score_codex":0.00087110914,"about_ca_topic_score_gemma":0.0018665165,"teacher_disagreement_score":0.018363602,"about_ca_system_score_codex":0.0008006384,"about_ca_system_score_gemma":0.0018727578,"threshold_uncertainty_score":0.06143236},"labels":[],"label_agreement":null},{"id":"W195191818","doi":"","title":"Applications Related to the Generalized Seidel Matrix .","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Matrix (chemical analysis); Applied mathematics; Chemistry; Chromatography","score_opus":0.007531413510922716,"score_gpt":0.25724883585974734,"score_spread":0.24971742234882463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W195191818","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07273354,0.02988951,0.5093397,0.0061115157,0.004663869,0.00011492274,0.00050811894,0.0013461757,0.37529263],"genre_scores_gemma":[0.7041817,0.019248381,0.17267127,0.001638913,0.003828682,0.00015307791,0.0005428134,0.0003925896,0.09734264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995372,0.00014020184,0.000021263844,0.00008172701,0.0001642404,0.000055429147],"domain_scores_gemma":[0.99908626,0.00038581507,0.000083617626,0.00015984073,0.00017518127,0.00010931431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040475087,0.0008201243,0.0006414421,0.0018391152,0.0011175547,0.001810722,0.0006530129,0.0009117664,0.011564182],"category_scores_gemma":[0.0027555355,0.0002884953,0.0006079009,0.00217779,0.0014449051,0.0019261469,0.0017373519,0.0022704613,0.0031186948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002726969,0.000032143376,0.0002670375,0.000125515,0.000015534273,0.00016364295,0.00013557734,0.003628487,0.001475215,0.950584,0.009759451,0.03378617],"study_design_scores_gemma":[0.000005127876,0.000016386823,0.00012594211,0.00002759877,0.0000053691165,0.0002822615,0.00006434868,0.01331497,0.00071009377,0.96510524,0.020332191,0.000010484766],"about_ca_topic_score_codex":0.0008671527,"about_ca_topic_score_gemma":0.0015809768,"teacher_disagreement_score":0.011564182,"about_ca_system_score_codex":0.0008407203,"about_ca_system_score_gemma":0.0005907915,"threshold_uncertainty_score":0.038686097},"labels":[],"label_agreement":null},{"id":"W195192778","doi":"","title":"Equivalence Classes of Subsets of a Finite Field.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Equivalence (formal languages); Finite field; Pure mathematics; Discrete mathematics","score_opus":0.02134140187472002,"score_gpt":0.23663842764748919,"score_spread":0.21529702577276916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W195192778","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40971133,0.0023926827,0.15618293,0.0055429717,0.0008848053,0.00023825771,0.0032166727,0.0007161122,0.42111424],"genre_scores_gemma":[0.94920075,0.0008902091,0.013637812,0.0003977197,0.0007690145,0.00016251649,0.0024781635,0.00011256309,0.032351334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975076,0.0007478588,0.00019754922,0.0004909833,0.0005716508,0.00048438515],"domain_scores_gemma":[0.9955723,0.0022337327,0.00044544594,0.00075163454,0.00041437178,0.0005825523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015040317,0.0005385358,0.0007669305,0.0036677383,0.0025186662,0.0046022465,0.0010672001,0.0011228514,0.017627222],"category_scores_gemma":[0.005494236,0.00039333777,0.0009547703,0.001963337,0.0037455345,0.010988223,0.0027755084,0.0027300138,0.0021463875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007196859,0.000042385163,0.00045604166,0.000028333465,0.00000898129,0.00009240077,0.00028690358,0.00017285997,0.00053190393,0.98600185,0.0023212624,0.009985105],"study_design_scores_gemma":[0.000021075626,0.000019056955,0.0005897417,0.000033310265,0.000009884658,0.00019674315,0.00017714156,0.0008667057,0.0007196153,0.9845883,0.012769715,0.000008841084],"about_ca_topic_score_codex":0.0005677942,"about_ca_topic_score_gemma":0.00041351453,"teacher_disagreement_score":0.017627222,"about_ca_system_score_codex":0.0014854055,"about_ca_system_score_gemma":0.00064596627,"threshold_uncertainty_score":0.0589689},"labels":[],"label_agreement":null},{"id":"W195230590","doi":"","title":"Some Nonbinary Power Residue Codes.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Residue (chemistry); Biology","score_opus":0.007390091069230929,"score_gpt":0.2177016479665731,"score_spread":0.21031155689734216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W195230590","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4401048,0.00633067,0.1928265,0.0056050806,0.0012483079,0.00015892058,0.0010174516,0.00046386325,0.35224435],"genre_scores_gemma":[0.88999283,0.002184445,0.02824946,0.0007755021,0.0008951361,0.00011484861,0.00055559224,0.0001532813,0.07707896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991949,0.00017364933,0.00003942599,0.0001232748,0.0003062558,0.0001624982],"domain_scores_gemma":[0.99742967,0.0012526775,0.00032933528,0.00037387718,0.0003392065,0.00027518225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000867692,0.0005736202,0.00058739656,0.0019078545,0.0013963259,0.0021758387,0.00065897463,0.0010195067,0.011536831],"category_scores_gemma":[0.0048842444,0.00028930508,0.00048616892,0.0015264023,0.0016252626,0.0038031533,0.001627088,0.0024596446,0.0025466513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047074856,0.000022280909,0.00013609199,0.000033515556,0.000004610352,0.00013921267,0.00010408774,0.00059800927,0.00066121796,0.9862428,0.0023663559,0.009644682],"study_design_scores_gemma":[0.00001520276,0.00001929717,0.00018065839,0.000019390736,0.0000042940974,0.0002589345,0.000034766454,0.0046105734,0.0005168943,0.987523,0.006806689,0.000010274779],"about_ca_topic_score_codex":0.0004866338,"about_ca_topic_score_gemma":0.0005856189,"teacher_disagreement_score":0.011536831,"about_ca_system_score_codex":0.0011521555,"about_ca_system_score_gemma":0.0007687082,"threshold_uncertainty_score":0.038594544},"labels":[],"label_agreement":null},{"id":"W195379771","doi":"","title":"Strongly pan-factorial property in cages.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Property (philosophy); Factorial experiment; Factorial; Statistics; Mathematical analysis; Epistemology; Philosophy","score_opus":0.012514581587055519,"score_gpt":0.19126386033144668,"score_spread":0.17874927874439117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W195379771","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4639541,0.0007860579,0.25771022,0.0013852766,0.0003616466,0.00009235709,0.0011768154,0.0010559716,0.27347755],"genre_scores_gemma":[0.95955133,0.00023628525,0.016169759,0.0003253254,0.00011872515,0.00008673611,0.00046178018,0.00012615335,0.022923859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995363,0.00008855247,0.000023707486,0.00012731359,0.000095882184,0.00012822723],"domain_scores_gemma":[0.9984345,0.00061720825,0.00018296522,0.00027262387,0.00023960149,0.00025316497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030960146,0.00022155048,0.00036934132,0.0005942845,0.0010933221,0.0014371284,0.00031444844,0.0005554836,0.012915748],"category_scores_gemma":[0.0017865228,0.00020017638,0.00035430965,0.0004400086,0.0010953221,0.0020983396,0.0012331282,0.00074090797,0.0013287067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048677513,0.000016512893,0.00060306746,0.000037641654,0.000005899145,0.00013243864,0.000101864,0.0006281985,0.004866714,0.98475915,0.0027003402,0.006099458],"study_design_scores_gemma":[0.000028072289,0.00007073544,0.0019272876,0.000029419169,0.00002223286,0.0007750561,0.000280144,0.01174305,0.007261728,0.95192224,0.02591461,0.000025513984],"about_ca_topic_score_codex":0.00091295154,"about_ca_topic_score_gemma":0.0013036533,"teacher_disagreement_score":0.012915748,"about_ca_system_score_codex":0.00048520204,"about_ca_system_score_gemma":0.00038489705,"threshold_uncertainty_score":0.043207526},"labels":[],"label_agreement":null},{"id":"W195844759","doi":"","title":"Degree Sequences of Halin Graphs, and Forcibly Cograph-graphic Sequences.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Degree (music)","score_opus":0.02339521022761119,"score_gpt":0.2600380946302295,"score_spread":0.2366428844026183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W195844759","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57029194,0.00207346,0.21306738,0.0021279017,0.00083202013,0.00019348701,0.0019011569,0.0010364839,0.20847626],"genre_scores_gemma":[0.9022789,0.0008333946,0.038139652,0.0006818975,0.00019720626,0.00014814998,0.0014287578,0.00019425795,0.05609784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996574,0.00007819522,0.000020299545,0.000089655965,0.00007997723,0.000074589145],"domain_scores_gemma":[0.99869496,0.00053639733,0.00024177741,0.000120127836,0.00019022716,0.00021644488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027032834,0.00041023255,0.00023718031,0.0017750476,0.00132393,0.0018374368,0.00047643026,0.0006550639,0.008621945],"category_scores_gemma":[0.0034203432,0.000249698,0.00023165107,0.0010293949,0.0013948319,0.0022163284,0.0010077765,0.0011463348,0.0010191236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094999974,0.00002376991,0.00082218647,0.000068848705,0.000005084887,0.00019314437,0.00036541687,0.0016401897,0.0028475814,0.971545,0.0037400117,0.018653752],"study_design_scores_gemma":[0.000015232566,0.000030676663,0.0012397828,0.000038834045,0.000006431012,0.00043196493,0.00028014721,0.0060854456,0.0030865504,0.9684623,0.020302948,0.000019580186],"about_ca_topic_score_codex":0.001213752,"about_ca_topic_score_gemma":0.002350816,"teacher_disagreement_score":0.008621945,"about_ca_system_score_codex":0.0010573802,"about_ca_system_score_gemma":0.0005869343,"threshold_uncertainty_score":0.028843224},"labels":[],"label_agreement":null},{"id":"W1959050181","doi":"","title":"Dominating sets with at most k components","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.022151674382142696,"score_gpt":0.21251705296260207,"score_spread":0.19036537858045938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1959050181","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32299057,0.002284169,0.5621792,0.0049115806,0.00039007558,0.0012390873,0.0064946604,0.0010400865,0.098470606],"genre_scores_gemma":[0.7728096,0.0017873308,0.15074396,0.0012139276,0.00033662218,0.0012715406,0.004278543,0.00039671108,0.067161776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951019,0.0017286423,0.000358995,0.0011369861,0.0009159586,0.0007575871],"domain_scores_gemma":[0.98269504,0.0113195805,0.0008670271,0.0023308506,0.0013680636,0.0014195255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023808233,0.0020710977,0.0033152904,0.0021352852,0.002850106,0.008274071,0.0046683475,0.002848547,0.014413232],"category_scores_gemma":[0.015300842,0.0016490952,0.0017508067,0.0032951431,0.0023039544,0.0064714346,0.0036551182,0.0030963216,0.004201589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021587329,0.0005209693,0.0044565075,0.0019775366,0.00051010563,0.0011290484,0.0013594567,0.04877157,0.018222498,0.8154739,0.02828609,0.077133656],"study_design_scores_gemma":[0.0003809958,0.00016756773,0.0012803434,0.00012160483,0.0002532085,0.0019034318,0.00062934135,0.10117396,0.007271002,0.8613583,0.02536873,0.00009154291],"about_ca_topic_score_codex":0.00090064446,"about_ca_topic_score_gemma":0.0012898196,"teacher_disagreement_score":0.014413232,"about_ca_system_score_codex":0.002080522,"about_ca_system_score_gemma":0.0012935152,"threshold_uncertainty_score":0.04821706},"labels":[],"label_agreement":null},{"id":"W1959268203","doi":"","title":"Minimal perfect bicoverings of K v with block sizes two, three and four","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Block (permutation group theory); Combinatorics; Block size; Set (abstract data type); Computer science","score_opus":0.005688535359316719,"score_gpt":0.1784936644605806,"score_spread":0.1728051291012639,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1959268203","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.949584,0.00083206524,0.025299208,0.00024371555,0.000034469598,0.00002120069,0.00029186488,0.00016876467,0.02352457],"genre_scores_gemma":[0.9865868,0.0002682818,0.0090074865,0.0000663418,0.000018039877,0.000023555127,0.0003090624,0.000026895155,0.0036936274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952865,0.00008590882,0.000027208804,0.0000722769,0.000090097885,0.00019590581],"domain_scores_gemma":[0.99916804,0.00031246472,0.00016741549,0.00017979687,0.0000524841,0.00011970374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023688651,0.00033413424,0.0004404337,0.00065413653,0.0011101041,0.00089752453,0.00063680025,0.00048391783,0.003177405],"category_scores_gemma":[0.0011877879,0.00039263593,0.00036138037,0.00070658064,0.00071595836,0.0011628506,0.001039577,0.00034377145,0.00034544992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001162293,0.00012890852,0.010226142,0.0005962554,0.00013544213,0.0013885829,0.0013904328,0.04187829,0.04736866,0.80858076,0.00842793,0.07871638],"study_design_scores_gemma":[0.00016156788,0.00035862907,0.00801619,0.00016864017,0.00012050502,0.0019535634,0.0010106297,0.07050151,0.036388475,0.84742725,0.033818662,0.00007439372],"about_ca_topic_score_codex":0.0014479354,"about_ca_topic_score_gemma":0.0023600613,"teacher_disagreement_score":0.003177405,"about_ca_system_score_codex":0.0005761667,"about_ca_system_score_gemma":0.00030050604,"threshold_uncertainty_score":0.010629475},"labels":[],"label_agreement":null},{"id":"W196193938","doi":"","title":"Counting rooted spanning forests in complete multipartite graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Multipartite; Mathematics; Combinatorics; Spanning tree; Physics","score_opus":0.02526542457220644,"score_gpt":0.28737536236066785,"score_spread":0.2621099377884614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W196193938","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29331118,0.0029508732,0.6518375,0.0025260227,0.0004473641,0.00027376486,0.0033167892,0.0013188043,0.044017784],"genre_scores_gemma":[0.7579636,0.0013503483,0.22068359,0.00052903953,0.00045921776,0.00028870755,0.0036092233,0.00051179883,0.014604546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998004,0.0006472479,0.0001503219,0.00040548088,0.00053624,0.00025661982],"domain_scores_gemma":[0.9877867,0.007846238,0.0011649381,0.0014020591,0.0011289589,0.0006711397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015162417,0.0005951103,0.0009890599,0.002818056,0.0013507426,0.0031576904,0.0019933518,0.0021487419,0.006686606],"category_scores_gemma":[0.020143032,0.0008170179,0.0007074808,0.0037127184,0.0011922801,0.007271178,0.0019045378,0.00155166,0.0011319434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036110374,0.0001967019,0.008333703,0.00090922654,0.00017956518,0.00039614787,0.00064339663,0.04127814,0.008798833,0.7675951,0.028746886,0.14256115],"study_design_scores_gemma":[0.00003260231,0.00004059339,0.0017460891,0.0001086379,0.00006714366,0.0005673473,0.00022263985,0.13090244,0.003892338,0.85300654,0.009389851,0.000023841536],"about_ca_topic_score_codex":0.0009751516,"about_ca_topic_score_gemma":0.002288145,"teacher_disagreement_score":0.006686606,"about_ca_system_score_codex":0.0008950065,"about_ca_system_score_gemma":0.0005664582,"threshold_uncertainty_score":0.022368908},"labels":[],"label_agreement":null},{"id":"W196764120","doi":"","title":"Numbers of Vertices and Edges of Magic Graphs.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; MAGIC (telescope); Combinatorics; Physics; Astronomy","score_opus":0.00883440746568456,"score_gpt":0.21347094964171362,"score_spread":0.20463654217602906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W196764120","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36711356,0.0029051788,0.26617008,0.005251727,0.001386797,0.0001591918,0.0066301553,0.0010205123,0.34936273],"genre_scores_gemma":[0.84623337,0.0010572887,0.11352176,0.0005315292,0.00035625778,0.0001854095,0.0021149032,0.00019329503,0.035806168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989312,0.0002807134,0.00009496842,0.0002599487,0.00023962812,0.00019348797],"domain_scores_gemma":[0.99718505,0.0013830928,0.0004237682,0.00038815459,0.00030872982,0.00031114768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000742533,0.0005681371,0.00051562116,0.0025758813,0.0017056307,0.0028473916,0.0013345636,0.0011589692,0.01145825],"category_scores_gemma":[0.0049850456,0.00047167993,0.00045448635,0.0020345943,0.002303986,0.0043824487,0.001569283,0.0015760837,0.0019256842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011664204,0.000021805872,0.0008400646,0.000088815235,0.000011373707,0.000043158583,0.00013219129,0.0015813834,0.0018580874,0.9651918,0.007060328,0.023054319],"study_design_scores_gemma":[0.000021321704,0.000017092749,0.0006715682,0.000047631696,0.000017645189,0.00018799109,0.0001392109,0.0052817897,0.0020262604,0.97210294,0.019466193,0.000020505782],"about_ca_topic_score_codex":0.0009359818,"about_ca_topic_score_gemma":0.0016519001,"teacher_disagreement_score":0.01145825,"about_ca_system_score_codex":0.0011007037,"about_ca_system_score_gemma":0.00060528517,"threshold_uncertainty_score":0.038331687},"labels":[],"label_agreement":null},{"id":"W19717087","doi":"","title":"Prime factors of Motzkin numbers.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.023160980213516487,"score_gpt":0.2843253096033827,"score_spread":0.2611643293898662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W19717087","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16348979,0.0077066347,0.060715295,0.004555991,0.0018190745,0.000063216634,0.00055200484,0.00045759705,0.7606405],"genre_scores_gemma":[0.8800725,0.0022494523,0.011742632,0.00048235097,0.0010483875,0.000050713075,0.00029771196,0.00015933497,0.10389693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995708,0.00009182807,0.000015402282,0.00008699788,0.00014224075,0.00009268979],"domain_scores_gemma":[0.9992926,0.00029848443,0.00009529933,0.00009103053,0.00009545359,0.00012711274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038931723,0.0006050368,0.00045516837,0.0015685958,0.0015540672,0.0022876794,0.00045304617,0.00056410616,0.0199521],"category_scores_gemma":[0.0024720964,0.00033499065,0.0003917655,0.00092057843,0.0019415721,0.0044468977,0.0017926516,0.0022285413,0.0038599719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040268536,0.000008487942,0.00013899292,0.000030969743,0.000003619868,0.000052153075,0.0001137032,0.00018067444,0.0004246848,0.98911893,0.003444044,0.0064434092],"study_design_scores_gemma":[0.000013317135,0.0000134048,0.00033746765,0.000018099061,0.00000666919,0.000205664,0.000070481314,0.000730776,0.000633962,0.9749742,0.022989128,0.0000068493882],"about_ca_topic_score_codex":0.00066083437,"about_ca_topic_score_gemma":0.001064528,"teacher_disagreement_score":0.0199521,"about_ca_system_score_codex":0.0009878413,"about_ca_system_score_gemma":0.00044774203,"threshold_uncertainty_score":0.06674641},"labels":[],"label_agreement":null},{"id":"W197421507","doi":"","title":"On the voltage-current transferring in topological graph theory.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Current (fluid); Topology (electrical circuits); Voltage; Graph; Discrete mathematics; Electrical engineering; Combinatorics","score_opus":0.019133958570325172,"score_gpt":0.2518688174165719,"score_spread":0.23273485884624673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W197421507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09658669,0.004870146,0.7234269,0.007419658,0.0014793131,0.00013038183,0.000611259,0.0009234446,0.16455221],"genre_scores_gemma":[0.8806794,0.0055124615,0.072887875,0.0021669336,0.0022020573,0.00019598665,0.0006406886,0.0004917617,0.035222888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999114,0.000301773,0.000052511397,0.00016883803,0.00024327403,0.00011950211],"domain_scores_gemma":[0.99677235,0.0017271397,0.00024033862,0.0006903375,0.0003072313,0.00026251381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013580103,0.0005232291,0.00068606355,0.002672143,0.0018310777,0.0030613015,0.0018572138,0.0015320589,0.010561206],"category_scores_gemma":[0.008896299,0.00036987494,0.0006721251,0.0025339033,0.005320039,0.012304761,0.0030730388,0.0030890398,0.0019844386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013846322,0.000010492558,0.0001051447,0.000024795474,0.000003428653,0.000036741254,0.00009373613,0.0008866756,0.00024727784,0.98672557,0.0017562498,0.010096011],"study_design_scores_gemma":[0.0000020377545,0.000005233833,0.000052584506,0.000008084524,0.0000025431757,0.000053001226,0.000036758945,0.0031309638,0.00013025667,0.9945754,0.0019989726,0.000004207392],"about_ca_topic_score_codex":0.00079390686,"about_ca_topic_score_gemma":0.0004719952,"teacher_disagreement_score":0.010561206,"about_ca_system_score_codex":0.0010312112,"about_ca_system_score_gemma":0.00045845774,"threshold_uncertainty_score":0.035330713},"labels":[],"label_agreement":null},{"id":"W197919409","doi":"","title":"A Note on a Theorem of Fan Concerning Average Degrees and Long Cycles.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.021150440046206323,"score_gpt":0.22213685868736058,"score_spread":0.20098641864115424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W197919409","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026955998,0.022582171,0.6075893,0.03998309,0.008350846,0.000094060924,0.0023720355,0.00082985405,0.29124266],"genre_scores_gemma":[0.63530475,0.032798044,0.19288509,0.024187008,0.025503904,0.00035785165,0.001915473,0.0015912855,0.08545659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878424,0.00042894637,0.00006380013,0.00028777943,0.00031026767,0.00012498727],"domain_scores_gemma":[0.9901371,0.007588194,0.0003803685,0.0007219427,0.0007187956,0.0004535324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034640967,0.0009781435,0.0013743861,0.0032831966,0.0025369592,0.0032698682,0.0017434077,0.0017403284,0.019552603],"category_scores_gemma":[0.016411427,0.0005111035,0.0018699559,0.0041523557,0.004701448,0.012280543,0.0027389952,0.004290982,0.0021171686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020776955,0.000011606234,0.00026296603,0.00006738645,0.000012366996,0.00005389482,0.0000758262,0.0008978745,0.00012497051,0.9679195,0.018161518,0.0123912105],"study_design_scores_gemma":[0.0000049201267,0.0000074779527,0.00018341215,0.000023583545,0.000005896949,0.00007791412,0.0000138882415,0.0017247306,0.00008872896,0.9795155,0.018344589,0.0000094383995],"about_ca_topic_score_codex":0.0036446603,"about_ca_topic_score_gemma":0.0032049653,"teacher_disagreement_score":0.019552603,"about_ca_system_score_codex":0.0020037147,"about_ca_system_score_gemma":0.0008233115,"threshold_uncertainty_score":0.06541002},"labels":[],"label_agreement":null},{"id":"W199386351","doi":"","title":"A Computer Program for Obtaining Subsystems.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Data Processing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Computer program; Computer science; Arithmetic; Programming language","score_opus":0.01499881400213835,"score_gpt":0.27298488629964685,"score_spread":0.2579860722975085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W199386351","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002857779,0.00021429038,0.9148893,0.000090021385,0.00005748207,0.00026132178,0.004026334,0.060572974,0.01703052],"genre_scores_gemma":[0.03158686,0.00040568996,0.92073554,0.00015578844,0.00005741135,0.0010206741,0.012795482,0.008488483,0.024754077],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997328,0.00004114359,0.000026368536,0.000080857106,0.00008229711,0.000036556718],"domain_scores_gemma":[0.99939144,0.00026763364,0.000027225027,0.00015404858,0.00011116579,0.00004847243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068555406,0.0011998431,0.0006975769,0.0015906533,0.0007742089,0.00092729524,0.0011746426,0.00045258284,0.07838685],"category_scores_gemma":[0.0017783093,0.00061486126,0.0007617289,0.0016285992,0.00036554036,0.0013607155,0.0016031372,0.001393726,0.040009044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005768934,0.00024741885,0.001813036,0.00082783157,0.000108784436,0.00030327347,0.00039887894,0.004554383,0.02446267,0.0480684,0.16600233,0.75263596],"study_design_scores_gemma":[0.0009287039,0.00039900775,0.0044386038,0.0002639683,0.00021176111,0.0011037359,0.00027333034,0.114496455,0.0677686,0.1429791,0.667017,0.00011993291],"about_ca_topic_score_codex":0.0013410577,"about_ca_topic_score_gemma":0.0025755223,"teacher_disagreement_score":0.07838685,"about_ca_system_score_codex":0.00039053758,"about_ca_system_score_gemma":0.000943017,"threshold_uncertainty_score":0.2622301},"labels":[],"label_agreement":null},{"id":"W199998079","doi":"","title":"On Bases of the Cycle and Cut Spaces in Digraphs.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Pure mathematics","score_opus":0.0073699426454666,"score_gpt":0.21905994319724464,"score_spread":0.21169000055177806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W199998079","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18968993,0.0024184948,0.64270324,0.0013158085,0.00044220703,0.00012470952,0.0014619019,0.00059951615,0.16124429],"genre_scores_gemma":[0.77334666,0.0017835669,0.16036917,0.00038923873,0.00024392852,0.00017294582,0.0021078098,0.0003940189,0.061192576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995832,0.00011351912,0.000023229664,0.00008271871,0.00011389226,0.00008341456],"domain_scores_gemma":[0.9990669,0.00044058237,0.00008955934,0.00014678664,0.000117759926,0.0001383612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039346694,0.0005311698,0.00057627686,0.0017588524,0.001213251,0.0025673697,0.0010303559,0.0008326878,0.0156642],"category_scores_gemma":[0.0025849347,0.00045226756,0.0006820793,0.0014701631,0.0014755304,0.00354872,0.0026193324,0.0019520648,0.0021656714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025632451,0.000015333973,0.00016721824,0.00003726449,0.0000060766793,0.00004710529,0.00010417103,0.0034417564,0.00039812262,0.97531784,0.002343768,0.01809569],"study_design_scores_gemma":[0.000008595192,0.000013534625,0.00010445536,0.000029135621,0.000005873947,0.00006374142,0.00009160715,0.009500362,0.00036215925,0.9821269,0.007687225,0.0000064270243],"about_ca_topic_score_codex":0.0015562737,"about_ca_topic_score_gemma":0.0029786231,"teacher_disagreement_score":0.0156642,"about_ca_system_score_codex":0.0008822066,"about_ca_system_score_gemma":0.0004282797,"threshold_uncertainty_score":0.05240196},"labels":[],"label_agreement":null},{"id":"W200115983","doi":"","title":"Dominating Broadcasts of Caterpillars.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Rights Management and Security","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.014337653153385086,"score_gpt":0.2180419631188919,"score_spread":0.2037043099655068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W200115983","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4679816,0.003397491,0.21768792,0.0029261822,0.000711551,0.0003277737,0.0026754958,0.0011323172,0.30315968],"genre_scores_gemma":[0.8909681,0.0013351168,0.020173168,0.00052355905,0.00036443665,0.00012363118,0.001407686,0.00020234146,0.084901996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876153,0.0002588246,0.00006575635,0.0002650196,0.00025410744,0.00039480816],"domain_scores_gemma":[0.99514526,0.0023950702,0.0004758954,0.00082395336,0.00049449294,0.0006652677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007446145,0.00050151115,0.00095969887,0.0013636734,0.002201577,0.0032927182,0.0012907049,0.0011619793,0.016678274],"category_scores_gemma":[0.005811429,0.00051863777,0.00078781304,0.0016221103,0.0013175035,0.0038119254,0.0024563698,0.0015222433,0.0028169106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051319954,0.000081904596,0.001395419,0.0003026059,0.000079369594,0.00077408395,0.00075263355,0.010016312,0.0070850425,0.9244138,0.019088952,0.035496708],"study_design_scores_gemma":[0.00019559979,0.00014903668,0.0017365355,0.000121869874,0.00011837632,0.0010889255,0.0007666204,0.0384339,0.0052405535,0.89657325,0.0555237,0.000051815096],"about_ca_topic_score_codex":0.0021692642,"about_ca_topic_score_gemma":0.0028550418,"teacher_disagreement_score":0.016678274,"about_ca_system_score_codex":0.0019553292,"about_ca_system_score_gemma":0.00060913427,"threshold_uncertainty_score":0.05579436},"labels":[],"label_agreement":null},{"id":"W200335736","doi":"","title":"A family of chromatically unique 5-bridge graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bridge (graph theory); Biology; Anatomy","score_opus":0.026595281798719724,"score_gpt":0.27698040310182404,"score_spread":0.2503851213031043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W200335736","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56762284,0.0024277074,0.10586509,0.0025890733,0.00051132694,0.00014410897,0.0028261472,0.0010163453,0.31699738],"genre_scores_gemma":[0.9226057,0.0008161431,0.030765582,0.0006057188,0.00007468993,0.000104996325,0.0025544858,0.00016100104,0.042311605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999706,0.000044571843,0.000010077709,0.00009921483,0.000066797664,0.000073226714],"domain_scores_gemma":[0.99929047,0.00024553356,0.00009839178,0.00010249779,0.00010765736,0.00015536227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002765344,0.00038863384,0.00027598077,0.0011342539,0.0017250855,0.001161909,0.0008724195,0.00089632627,0.015344707],"category_scores_gemma":[0.0012683244,0.00036034486,0.00043332737,0.00087163475,0.00072741415,0.0014337711,0.0012753687,0.0012426339,0.0017541568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015400216,0.00006518406,0.0020934616,0.00015659077,0.000035516998,0.0010670985,0.00065248273,0.0017455025,0.007905911,0.92938244,0.01964272,0.037098996],"study_design_scores_gemma":[0.000087765045,0.00008998267,0.005678601,0.0001446253,0.00006312815,0.0046024267,0.0008576848,0.011341384,0.005290813,0.8398931,0.1318939,0.00005649346],"about_ca_topic_score_codex":0.0009708789,"about_ca_topic_score_gemma":0.001811816,"teacher_disagreement_score":0.015344707,"about_ca_system_score_codex":0.0007341215,"about_ca_system_score_gemma":0.00043812368,"threshold_uncertainty_score":0.05133319},"labels":[],"label_agreement":null},{"id":"W202516377","doi":"","title":"An extension of Seller's theorem on partitions and its applications.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Extension (predicate logic); Discrete mathematics; Computer science; Programming language","score_opus":0.04471334934995021,"score_gpt":0.3155232630714719,"score_spread":0.2708099137215217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W202516377","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022984123,0.006737467,0.4849698,0.014802796,0.0046708123,0.00010724099,0.0007443272,0.0003369646,0.46464637],"genre_scores_gemma":[0.5867611,0.0106501,0.18426612,0.0074660107,0.008797979,0.00034305544,0.0008738224,0.0007471029,0.20009471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986197,0.0004351827,0.00006384883,0.00030233734,0.00041812693,0.0001609634],"domain_scores_gemma":[0.9968015,0.0015640722,0.00022713275,0.000523124,0.0005961452,0.00028802114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024223132,0.000678668,0.0011059132,0.0030613116,0.0028085902,0.0036692144,0.0019072881,0.0022641025,0.018161187],"category_scores_gemma":[0.009576092,0.00052877667,0.0017444704,0.0033513964,0.0048814733,0.013326377,0.005083704,0.004872286,0.004426293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074801624,0.000008367371,0.00006496984,0.000021963835,0.000003169548,0.00003076554,0.000078154844,0.0001142247,0.00007901158,0.99165326,0.0037399728,0.004198771],"study_design_scores_gemma":[0.000006293394,0.0000076752885,0.00011358708,0.000017671735,0.0000046505056,0.00012243625,0.000044482313,0.0008666863,0.00008230281,0.9808896,0.017837731,0.000006874208],"about_ca_topic_score_codex":0.001464817,"about_ca_topic_score_gemma":0.0012059342,"teacher_disagreement_score":0.018161187,"about_ca_system_score_codex":0.0015717406,"about_ca_system_score_gemma":0.0010538433,"threshold_uncertainty_score":0.060755193},"labels":[],"label_agreement":null},{"id":"W203922734","doi":"","title":"On the (r, s) domination number of a graph.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Domination analysis; Graph; Vertex (graph theory)","score_opus":0.01994224594606359,"score_gpt":0.28376223699266157,"score_spread":0.263819991046598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W203922734","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6286889,0.0036221142,0.116101824,0.0069977297,0.00067409297,0.00010292215,0.0023306897,0.0005302005,0.24095163],"genre_scores_gemma":[0.9604099,0.001612066,0.018927801,0.0004160863,0.0005503901,0.00015148826,0.0006015346,0.00014120853,0.017189583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871886,0.00040999823,0.00007019885,0.0002772809,0.0002838959,0.00023967499],"domain_scores_gemma":[0.9882826,0.008732977,0.00096183934,0.0006182889,0.00052706763,0.0008772234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001644109,0.00067899755,0.0008101063,0.0039606523,0.001699688,0.002954961,0.001400069,0.0013411804,0.011090606],"category_scores_gemma":[0.0104735475,0.00038289517,0.0004449736,0.0026415435,0.0033840535,0.006484081,0.0018894353,0.0020472938,0.0012537087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035197064,0.000052726708,0.0029175535,0.00020483749,0.000040190745,0.00015035216,0.00045081592,0.0107321795,0.0031073848,0.9336471,0.011053269,0.037291553],"study_design_scores_gemma":[0.000050807084,0.000057433008,0.0024006893,0.00008532637,0.000038486614,0.0004447968,0.00021930654,0.027268505,0.0020375804,0.9587157,0.0086317565,0.000049553328],"about_ca_topic_score_codex":0.0012323444,"about_ca_topic_score_gemma":0.0015618013,"teacher_disagreement_score":0.011090606,"about_ca_system_score_codex":0.002015627,"about_ca_system_score_gemma":0.0006892732,"threshold_uncertainty_score":0.037101746},"labels":[],"label_agreement":null},{"id":"W204249971","doi":"","title":"Some Properties of Prime Graphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Prime (order theory); Combinatorics","score_opus":0.01590317179693103,"score_gpt":0.21904800488490672,"score_spread":0.2031448330879757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W204249971","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2177723,0.008357844,0.18564102,0.013478419,0.0009809745,0.00016860645,0.0035406605,0.0009793625,0.5690808],"genre_scores_gemma":[0.90659904,0.0047860504,0.043336295,0.0019925016,0.0015202705,0.0002384223,0.00232781,0.00042413964,0.03877544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991468,0.00027963988,0.000050128972,0.00020708426,0.00018871445,0.00012760695],"domain_scores_gemma":[0.9953419,0.0031059464,0.00036627767,0.00058534864,0.0002878815,0.00031271778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012907973,0.00064105797,0.0006577552,0.0020987361,0.0019725892,0.0040509542,0.0009555148,0.0010730696,0.015111965],"category_scores_gemma":[0.0054923575,0.0006347392,0.0008208096,0.0029953483,0.0028344684,0.0067573767,0.0016484288,0.002906789,0.0024428207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030708496,0.00002493516,0.00044300474,0.00008393935,0.00000809618,0.00007345841,0.00018512759,0.0005956941,0.0005076225,0.97856003,0.008236867,0.011250365],"study_design_scores_gemma":[0.000011070493,0.000012174733,0.0003818399,0.000019679283,0.00001031842,0.00023988314,0.000095703814,0.0015318621,0.00045480512,0.98431534,0.0129197575,0.0000074969093],"about_ca_topic_score_codex":0.00070637057,"about_ca_topic_score_gemma":0.0006951351,"teacher_disagreement_score":0.015111965,"about_ca_system_score_codex":0.0014935732,"about_ca_system_score_gemma":0.0005263002,"threshold_uncertainty_score":0.050554514},"labels":[],"label_agreement":null},{"id":"W204285469","doi":"","title":"Packing Three-Vertex Paths in 2-Connected Cubic Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Polyhedral graph; Cubic graph; Chordal graph; 1-planar graph; Graph; Line graph","score_opus":0.02290155658983611,"score_gpt":0.2636769478942789,"score_spread":0.2407753913044428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W204285469","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75584906,0.0017116048,0.13654996,0.0011645345,0.0004158799,0.00024868894,0.0022991428,0.0014977831,0.10026331],"genre_scores_gemma":[0.92104995,0.00080305134,0.058552135,0.00024774487,0.000051145184,0.000114367824,0.0012756432,0.00018769482,0.017718222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995733,0.000080965736,0.000021627078,0.00006819292,0.00010140754,0.000154525],"domain_scores_gemma":[0.99913967,0.0003979094,0.0001321624,0.00015017882,0.00005633645,0.00012368661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001779885,0.00048183135,0.00057375606,0.0009966372,0.0014387545,0.0013708626,0.0009756465,0.001493763,0.014561352],"category_scores_gemma":[0.002028667,0.0004985119,0.0004458901,0.0021235996,0.00066357845,0.0021433022,0.002060393,0.0008576449,0.0020450747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015625812,0.00052688806,0.0052792244,0.0011686623,0.00014548379,0.0028194084,0.001688341,0.16926292,0.025573924,0.43474576,0.041855175,0.31537163],"study_design_scores_gemma":[0.00019968727,0.00031611556,0.0033250041,0.00019424268,0.00006724997,0.0012278752,0.0012265071,0.24880375,0.011419713,0.7022122,0.03093315,0.00007455266],"about_ca_topic_score_codex":0.0031067482,"about_ca_topic_score_gemma":0.005610087,"teacher_disagreement_score":0.014561352,"about_ca_system_score_codex":0.0006046278,"about_ca_system_score_gemma":0.000656753,"threshold_uncertainty_score":0.04871261},"labels":[],"label_agreement":null},{"id":"W205483883","doi":"","title":"Subdirectly Irreducible Squags of Cardinality 3n.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cardinality (data modeling); Mathematics; Combinatorics; Computer science; Data mining","score_opus":0.01364674758501507,"score_gpt":0.19695315716324893,"score_spread":0.18330640957823385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W205483883","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7331942,0.0003249453,0.09061984,0.0007702597,0.00024747362,0.0001060684,0.0014156608,0.00069561123,0.17262597],"genre_scores_gemma":[0.9415814,0.00012113987,0.019117061,0.00015307966,0.000045279743,0.00005122248,0.0010900239,0.00009111178,0.03774977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959725,0.00006390811,0.000022271674,0.00007753565,0.00010435861,0.00013460506],"domain_scores_gemma":[0.9988562,0.00038206004,0.00013723991,0.0003068895,0.00015287707,0.00016471397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032060195,0.00027010214,0.00038133244,0.0009719432,0.0013851369,0.0011291406,0.00040557337,0.0005098811,0.013782416],"category_scores_gemma":[0.0014707407,0.00020244556,0.00035394504,0.0005898218,0.001129735,0.0013885723,0.0018395459,0.00091009814,0.0018236578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037306413,0.00013718674,0.0046357303,0.00013781303,0.00003222567,0.0011371494,0.00084172585,0.00265431,0.026572797,0.9202488,0.008744117,0.034484997],"study_design_scores_gemma":[0.000040830375,0.000103571474,0.00626811,0.0000975667,0.000043695196,0.001995853,0.0008463692,0.016274871,0.01977836,0.8997727,0.05474056,0.00003746084],"about_ca_topic_score_codex":0.000843813,"about_ca_topic_score_gemma":0.0026182525,"teacher_disagreement_score":0.013782416,"about_ca_system_score_codex":0.00053330866,"about_ca_system_score_gemma":0.0004808497,"threshold_uncertainty_score":0.046106756},"labels":[],"label_agreement":null},{"id":"W205520280","doi":"","title":"Some Equitably 2-colorable cycle decompositions of Kv+I.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.008695186536014433,"score_gpt":0.20325846106949594,"score_spread":0.19456327453348152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W205520280","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47892293,0.0010514723,0.19159867,0.0013588691,0.0002811443,0.00022184981,0.0030607553,0.00082188187,0.32268244],"genre_scores_gemma":[0.8657569,0.00062226504,0.061741963,0.00046519242,0.00011233039,0.00018765374,0.002578585,0.00038610003,0.06814905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956614,0.00007845863,0.000023354794,0.000096644275,0.000095569,0.00013986776],"domain_scores_gemma":[0.999213,0.0002236175,0.00013242949,0.00013202496,0.00013850645,0.00016040343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003179083,0.00062092603,0.0004287541,0.0013239313,0.0013524785,0.0023814193,0.0007957322,0.0006813412,0.013397506],"category_scores_gemma":[0.0013223095,0.0005085849,0.0005143586,0.0011937069,0.000947921,0.0015904412,0.0013194631,0.001445245,0.0021715425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014438828,0.00006632445,0.0005701617,0.00012507029,0.000021818189,0.0002726139,0.0005678005,0.0038769976,0.0070668636,0.95331776,0.010724491,0.023245692],"study_design_scores_gemma":[0.000042302454,0.00003002229,0.0008695746,0.000048725222,0.000023468014,0.0003279098,0.00034086592,0.009472166,0.003039247,0.96785694,0.017928863,0.000019956327],"about_ca_topic_score_codex":0.0016625379,"about_ca_topic_score_gemma":0.0026843166,"teacher_disagreement_score":0.013397506,"about_ca_system_score_codex":0.0012917338,"about_ca_system_score_gemma":0.00052044337,"threshold_uncertainty_score":0.044819176},"labels":[],"label_agreement":null},{"id":"W205629517","doi":"","title":"Spanning trails that join given edges in 3-edge-connected graphs.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Join (topology); Enhanced Data Rates for GSM Evolution; Mathematics; Combinatorics; Computer science; Telecommunications","score_opus":0.026175743226512723,"score_gpt":0.27252693756401697,"score_spread":0.24635119433750424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W205629517","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6434781,0.0008244365,0.26121265,0.0008097857,0.0006837468,0.0005032415,0.002219367,0.0017571003,0.088511586],"genre_scores_gemma":[0.8027378,0.00068065344,0.15691665,0.00029263596,0.0000913647,0.00023166148,0.002221067,0.00027164552,0.036556523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965644,0.0000608354,0.00003585139,0.00006530832,0.00008102561,0.00010054829],"domain_scores_gemma":[0.9982097,0.00046606164,0.000386666,0.00035530466,0.00021998918,0.00036231554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004063317,0.00030720985,0.00032272312,0.0013227244,0.0017280392,0.0016719118,0.0007059197,0.0009074131,0.012062356],"category_scores_gemma":[0.0026402287,0.00041223952,0.0004974145,0.0014989418,0.00077636587,0.002163315,0.0016118024,0.0008858387,0.0026337348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010412186,0.000602906,0.006161952,0.0008006166,0.00013669765,0.002938852,0.0019946387,0.01898417,0.046003964,0.6720797,0.028782094,0.22047336],"study_design_scores_gemma":[0.00019930098,0.00044388982,0.004865086,0.00042010657,0.00019175508,0.0023538382,0.0020459185,0.06976669,0.031977516,0.8030142,0.084627084,0.00009466475],"about_ca_topic_score_codex":0.0007224865,"about_ca_topic_score_gemma":0.0023149885,"teacher_disagreement_score":0.012062356,"about_ca_system_score_codex":0.0003926505,"about_ca_system_score_gemma":0.0006139577,"threshold_uncertainty_score":0.040352523},"labels":[],"label_agreement":null},{"id":"W205938674","doi":"","title":"On Splitting Graphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.010916106129861767,"score_gpt":0.23568396285944945,"score_spread":0.22476785672958768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W205938674","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1021752,0.009505224,0.3186468,0.009879385,0.0015150468,0.00015262299,0.0022005374,0.0011998094,0.5547253],"genre_scores_gemma":[0.67584527,0.0075554475,0.14113429,0.0037191291,0.0018493467,0.00034470944,0.0055995076,0.001072667,0.16287966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916637,0.00024022207,0.000039633862,0.00019655423,0.00021137869,0.00014583663],"domain_scores_gemma":[0.9979215,0.0009823333,0.00015354589,0.0004973065,0.00020174758,0.00024346221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008660713,0.0008457364,0.0009378975,0.002297491,0.0020852229,0.0026787757,0.0013420001,0.0012819781,0.021220675],"category_scores_gemma":[0.0032133197,0.00059319765,0.0008418277,0.002585745,0.0022376997,0.007612462,0.0033688229,0.003719485,0.004232078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031063137,0.00003382532,0.00037973732,0.00008265534,0.000013999849,0.000050558156,0.00018198011,0.0012619835,0.00054633303,0.9476854,0.019579453,0.030153004],"study_design_scores_gemma":[0.000005984746,0.0000050846256,0.00019453731,0.000025241168,0.000006917907,0.000085828025,0.00008637045,0.0031078942,0.00025673586,0.98102313,0.015197729,0.000004542212],"about_ca_topic_score_codex":0.0011605275,"about_ca_topic_score_gemma":0.002297939,"teacher_disagreement_score":0.021220675,"about_ca_system_score_codex":0.0018362235,"about_ca_system_score_gemma":0.00056576537,"threshold_uncertainty_score":0.070990264},"labels":[],"label_agreement":null},{"id":"W206202451","doi":"","title":"Directed Bipartite Graphs Containing Every Possible Pair of Directed Cycles.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Discrete mathematics; Graph","score_opus":0.009180906024946346,"score_gpt":0.20630244044192478,"score_spread":0.19712153441697844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W206202451","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1079217,0.003142566,0.6035883,0.002854136,0.00096934795,0.0008742017,0.015608569,0.001759375,0.26328182],"genre_scores_gemma":[0.60876316,0.0028125746,0.28960186,0.0020649699,0.00044111017,0.0013843456,0.01414157,0.00037582053,0.080414645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878746,0.00041675512,0.000070452894,0.00034837087,0.00019274282,0.0001841436],"domain_scores_gemma":[0.99727434,0.0014530477,0.00034157504,0.00032288517,0.0003901523,0.00021805291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005776316,0.0009173047,0.00070986117,0.0024127983,0.0021847384,0.0027137126,0.0012956125,0.0019270502,0.022387408],"category_scores_gemma":[0.0045214365,0.0006464223,0.0006631982,0.0021971955,0.0012082602,0.0032874704,0.0014634667,0.0014063322,0.004228916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028679075,0.00016191165,0.0010668684,0.0006048307,0.00013086807,0.0009831941,0.00029050055,0.0049010143,0.0076780296,0.9079763,0.021694759,0.054224882],"study_design_scores_gemma":[0.00005481802,0.00004853422,0.0005813471,0.00019126802,0.00009839203,0.0010778487,0.00028257337,0.015057039,0.004087843,0.8985712,0.07990839,0.000040729912],"about_ca_topic_score_codex":0.001371797,"about_ca_topic_score_gemma":0.0023554661,"teacher_disagreement_score":0.022387408,"about_ca_system_score_codex":0.00097071606,"about_ca_system_score_gemma":0.0011131809,"threshold_uncertainty_score":0.074893355},"labels":[],"label_agreement":null},{"id":"W206369421","doi":"","title":"A Syndrome-Distribution Decoding of Mols Lp Codes.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Decoding methods; Mathematics; Distribution (mathematics); Algorithm; Mathematical analysis","score_opus":0.00919060259359472,"score_gpt":0.2369193175644431,"score_spread":0.22772871497084837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W206369421","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22400962,0.00063776196,0.64828867,0.0038141098,0.0005525589,0.00018884425,0.0029281136,0.0034356285,0.11614473],"genre_scores_gemma":[0.89864945,0.00025292984,0.07628592,0.0006009704,0.00019083534,0.00014612345,0.0014332294,0.00037207434,0.022068482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885154,0.00034707517,0.000068637804,0.00016526297,0.00035898498,0.00020848167],"domain_scores_gemma":[0.9973183,0.0013093869,0.0001809368,0.00060353347,0.0004080467,0.00017975007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073203305,0.00048592433,0.00049766083,0.0009792154,0.0009823228,0.001854848,0.0006449174,0.00092437014,0.007228687],"category_scores_gemma":[0.006688956,0.00025659142,0.0004424719,0.0008917175,0.0011496405,0.0012027307,0.0020993992,0.0010554127,0.0028117932],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005734836,0.000052700845,0.0014561311,0.0001222852,0.000033927554,0.00053124747,0.00030850808,0.012812127,0.01345857,0.88039684,0.014412586,0.07584151],"study_design_scores_gemma":[0.00009516352,0.000082662234,0.0007445549,0.00007395591,0.000024211438,0.0006486182,0.00012232833,0.1529368,0.017517481,0.81546485,0.012234468,0.00005494941],"about_ca_topic_score_codex":0.0012980519,"about_ca_topic_score_gemma":0.0015673304,"teacher_disagreement_score":0.007228687,"about_ca_system_score_codex":0.00101303,"about_ca_system_score_gemma":0.0014396845,"threshold_uncertainty_score":0.02418232},"labels":[],"label_agreement":null},{"id":"W207338156","doi":"","title":"Partial Diallel Cross Block Designs.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Optimal Experimental Design Methods","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Diallel cross; Mathematics; Block (permutation group theory); Arithmetic; Combinatorics; Horticulture; Biology","score_opus":0.18328870662151253,"score_gpt":0.42360412442249823,"score_spread":0.2403154178009857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W207338156","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014213847,0.000690818,0.97150844,0.00028812277,0.00024297103,0.0016705111,0.00095052365,0.00065815926,0.009776686],"genre_scores_gemma":[0.25582406,0.0006427378,0.7110695,0.00082130067,0.0002087943,0.013355063,0.0012583942,0.00026166628,0.016558528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.96162814,0.031479575,0.0009415066,0.0029873885,0.0022922256,0.00067117886],"domain_scores_gemma":[0.957566,0.031550728,0.001977936,0.006477281,0.001888995,0.0005391026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.027068648,0.0015027205,0.0020775718,0.0012418862,0.00075432373,0.0018763035,0.0020000346,0.0016072225,0.0396604],"category_scores_gemma":[0.059365284,0.001057364,0.0012613817,0.0009977586,0.0020160282,0.0022665132,0.0022279741,0.0018160094,0.005626252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.010192303,0.0010731601,0.0023652837,0.0028223447,0.00091272633,0.00010693932,0.00036790047,0.04016746,0.006866378,0.5252754,0.0093064755,0.40054366],"study_design_scores_gemma":[0.004455836,0.011919727,0.003242129,0.000821952,0.0009977826,0.00030246188,0.00020802872,0.26654205,0.023469409,0.6091453,0.07871824,0.00017712155],"about_ca_topic_score_codex":0.00032562762,"about_ca_topic_score_gemma":0.00064151146,"teacher_disagreement_score":0.0396604,"about_ca_system_score_codex":0.0012973222,"about_ca_system_score_gemma":0.0022042005,"threshold_uncertainty_score":0.14315438},"labels":[],"label_agreement":null},{"id":"W20746358","doi":"10.1136/bmj.2.560.342","title":"On the Three Color Ramsey Numbers R(Cm, C4, C4).","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.014315527967654854,"score_gpt":0.2322408990762624,"score_spread":0.21792537110860755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W20746358","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48802534,0.0044376487,0.12251793,0.013678733,0.0010122248,0.000101117126,0.001710946,0.00065931963,0.36785674],"genre_scores_gemma":[0.9277168,0.001699734,0.033651683,0.001630979,0.00048880844,0.00014692803,0.0009143346,0.00020897486,0.033541806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993024,0.00024802648,0.000025603282,0.00013637469,0.00011677289,0.00017086696],"domain_scores_gemma":[0.996431,0.0023562901,0.00035186464,0.00029462262,0.00019601706,0.00037029345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011633338,0.00063321926,0.0006377201,0.0013199477,0.002040605,0.0030755876,0.001327703,0.0015958514,0.014414207],"category_scores_gemma":[0.0050868713,0.00045796437,0.00054512464,0.0012610345,0.0028642986,0.006284599,0.0025204325,0.002585627,0.0018915551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014043621,0.000025244539,0.00035765124,0.00007399367,0.0000089002615,0.000048922087,0.00014047936,0.0034531069,0.000496112,0.97238207,0.013247234,0.00962576],"study_design_scores_gemma":[0.00003187195,0.000014494291,0.00041970113,0.000034797264,0.000009846145,0.00009436919,0.00015062519,0.009309097,0.0003881958,0.98298454,0.0065429816,0.000019600155],"about_ca_topic_score_codex":0.00209372,"about_ca_topic_score_gemma":0.0027389263,"teacher_disagreement_score":0.014414207,"about_ca_system_score_codex":0.0018260942,"about_ca_system_score_gemma":0.00086761016,"threshold_uncertainty_score":0.048220396},"labels":[],"label_agreement":null},{"id":"W207628992","doi":"","title":"Extremal Matrices of Generalized Exponents of Primitive Nearly Reducible Matrices.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics; Combinatorics","score_opus":0.020475206867856043,"score_gpt":0.23593862173507596,"score_spread":0.21546341486721993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W207628992","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7832451,0.0013022176,0.124298826,0.0010853667,0.00039712174,0.00009071687,0.00047771755,0.00037052142,0.08873249],"genre_scores_gemma":[0.9685384,0.0003622034,0.018071162,0.00015327285,0.00026970656,0.000035893856,0.00020973383,0.00007584322,0.012283739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994892,0.00011855153,0.000024181545,0.00008379124,0.00017486425,0.0001093828],"domain_scores_gemma":[0.9989151,0.00039108092,0.000220804,0.00016904608,0.00012693694,0.00017707329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004281299,0.00055869744,0.0004552556,0.0014078317,0.0008197235,0.0020880338,0.00060501695,0.0006455576,0.009313866],"category_scores_gemma":[0.0037091363,0.00034317776,0.00035113603,0.0005561697,0.0015935329,0.0025519708,0.0014485712,0.0015097203,0.0013790053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012172079,0.000029559596,0.000730878,0.00005519606,0.000011933388,0.00028366238,0.00020356654,0.00212046,0.0035453578,0.9786028,0.0022986147,0.011996301],"study_design_scores_gemma":[0.000025937572,0.00003926681,0.00052257685,0.000028179467,0.000008655927,0.00042251305,0.00012841946,0.013275523,0.0022342799,0.97960424,0.0036918449,0.000018536572],"about_ca_topic_score_codex":0.000263403,"about_ca_topic_score_gemma":0.0005044194,"teacher_disagreement_score":0.009313866,"about_ca_system_score_codex":0.00046736724,"about_ca_system_score_gemma":0.00025532025,"threshold_uncertainty_score":0.03115791},"labels":[],"label_agreement":null},{"id":"W207882731","doi":"","title":"Balanced Bipartite Row-Column Designs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Optimal Experimental Design Methods","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Column (typography); Mathematics; Bipartite graph; Combinatorics; Algorithm; Geometry; Graph","score_opus":0.13705619323265078,"score_gpt":0.4176691317247561,"score_spread":0.28061293849210533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W207882731","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011315336,0.00066792447,0.9745137,0.00036692517,0.00026047716,0.0030582596,0.0016447944,0.0004890946,0.007683553],"genre_scores_gemma":[0.23421328,0.00081408164,0.7336959,0.0008753693,0.00020277491,0.018744582,0.0017357339,0.00022442034,0.0094939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9510204,0.04184628,0.00095661305,0.0028673566,0.0023551013,0.0009542731],"domain_scores_gemma":[0.9486212,0.037590798,0.0031215954,0.007497808,0.0023245981,0.0008440095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03103854,0.002265489,0.002810716,0.0012442542,0.0008619669,0.0019450419,0.0022848286,0.0020361189,0.032333285],"category_scores_gemma":[0.07267214,0.0013392989,0.0012472384,0.0016561167,0.0020905184,0.0018815706,0.0018894244,0.0018985248,0.0044336873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.014122762,0.001756736,0.0023791294,0.0033162273,0.001626664,0.00010126705,0.00025210236,0.06976295,0.009454966,0.5306625,0.016467465,0.3500974],"study_design_scores_gemma":[0.006597382,0.006085115,0.002356641,0.0008480461,0.0013156264,0.00013751678,0.00016438603,0.23269634,0.014208457,0.69571793,0.03971039,0.00016216314],"about_ca_topic_score_codex":0.00073042884,"about_ca_topic_score_gemma":0.0015433935,"teacher_disagreement_score":0.032333285,"about_ca_system_score_codex":0.0016568037,"about_ca_system_score_gemma":0.0036205582,"threshold_uncertainty_score":0.16414946},"labels":[],"label_agreement":null},{"id":"W207932846","doi":"","title":"On clique graph recognition.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Clique; Clique number; Combinatorics; Graph","score_opus":0.01806779878322305,"score_gpt":0.21572844312336514,"score_spread":0.1976606443401421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W207932846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02170615,0.01248596,0.8382194,0.0065751565,0.0022183831,0.00034221675,0.0024334623,0.0077132564,0.10830605],"genre_scores_gemma":[0.29244146,0.009896581,0.56717855,0.0052042683,0.0036968598,0.00072705606,0.015369474,0.0031054,0.102380365],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785244,0.00047043207,0.00013419658,0.00068828894,0.0005730017,0.00028162965],"domain_scores_gemma":[0.9943538,0.0028041336,0.00022054219,0.0018260083,0.00048696896,0.00030849397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015306132,0.0014110969,0.0019736183,0.0038286063,0.0023698537,0.0040924908,0.0037660433,0.0025875263,0.02687408],"category_scores_gemma":[0.007971937,0.0010664958,0.0015274624,0.0055333907,0.0027670998,0.011165379,0.004479834,0.0042110826,0.011263179],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030272955,0.00031970057,0.0017426275,0.00062051864,0.00017241033,0.0002602245,0.0003681988,0.012999403,0.0030252133,0.32190713,0.19675657,0.46152523],"study_design_scores_gemma":[0.000039945997,0.000045630637,0.0010156028,0.00013979044,0.00007303294,0.00041618416,0.000244344,0.070476934,0.003239104,0.8458199,0.07844967,0.0000397851],"about_ca_topic_score_codex":0.004668168,"about_ca_topic_score_gemma":0.009244553,"teacher_disagreement_score":0.02687408,"about_ca_system_score_codex":0.0018779356,"about_ca_system_score_gemma":0.001236027,"threshold_uncertainty_score":0.08990282},"labels":[],"label_agreement":null},{"id":"W209002","doi":"","title":"A Decoding Scheme for the 4-ary Lexicodes with dm=4.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Decoding methods; Mathematics; Scheme (mathematics); Arithmetic; Algorithm; Mathematical analysis","score_opus":0.009872929036725445,"score_gpt":0.20763178837679228,"score_spread":0.19775885934006682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W209002","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08546548,0.0015163195,0.7626668,0.003663699,0.0009254673,0.00050836615,0.0028164308,0.0020373652,0.14040004],"genre_scores_gemma":[0.50421995,0.0014233844,0.42078307,0.0016109012,0.000290667,0.00054200523,0.0022340314,0.0004607389,0.06843533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987696,0.0003561407,0.00010588658,0.00016175736,0.00033003598,0.00027655155],"domain_scores_gemma":[0.9984914,0.00063330686,0.00010025158,0.0004654777,0.00021991215,0.000089622896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010173314,0.0005526604,0.00062854885,0.0009257945,0.002003278,0.0022287725,0.0009836588,0.0014008539,0.011737905],"category_scores_gemma":[0.0031041056,0.00039938532,0.00060998276,0.0012566467,0.0010869618,0.0021444815,0.0027150605,0.001797759,0.0052307863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033771782,0.000074901574,0.0003034327,0.00018738872,0.00003118321,0.00019552336,0.0004535748,0.0065608625,0.012779946,0.87481016,0.01626304,0.088002354],"study_design_scores_gemma":[0.00020209045,0.00016083485,0.00033369134,0.00019221785,0.00005290071,0.0005243187,0.00020138724,0.03685186,0.018366124,0.88121843,0.0617834,0.00011270092],"about_ca_topic_score_codex":0.001324432,"about_ca_topic_score_gemma":0.002266071,"teacher_disagreement_score":0.011737905,"about_ca_system_score_codex":0.0012686659,"about_ca_system_score_gemma":0.002489429,"threshold_uncertainty_score":0.039267242},"labels":[],"label_agreement":null},{"id":"W2099183157","doi":"","title":"Equitable chromatic threshold of direct products of complete graphs","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics","score_opus":0.01800581702827371,"score_gpt":0.2235108729910736,"score_spread":0.2055050559627999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099183157","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91207063,0.00042335744,0.048490286,0.00095531216,0.00003915022,0.000042565793,0.0006990166,0.00026872894,0.03701094],"genre_scores_gemma":[0.98082274,0.00022554476,0.010430228,0.0001486189,0.000055390374,0.00006293532,0.00064634695,0.0001461753,0.0074619753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980806,0.00044668026,0.000100923506,0.00054151524,0.0004090272,0.0004212568],"domain_scores_gemma":[0.98653793,0.008579846,0.0012624154,0.001262602,0.00070375256,0.0016535639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016440277,0.0007385278,0.0015460683,0.0024790897,0.0023821013,0.007099107,0.0028803058,0.0016520276,0.0125676105],"category_scores_gemma":[0.009688806,0.0012437855,0.0007243773,0.0022828782,0.0031227295,0.0074881357,0.0030947323,0.0028839302,0.0008349196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044530787,0.00015300672,0.003835786,0.00017371813,0.000042107604,0.00017020613,0.0008556143,0.013386523,0.006113086,0.9599358,0.003836785,0.011052126],"study_design_scores_gemma":[0.00006819289,0.00005046147,0.002056931,0.00003997591,0.000044214958,0.0002579399,0.00042725596,0.051017214,0.003899275,0.93957615,0.0025300996,0.00003216023],"about_ca_topic_score_codex":0.0021594185,"about_ca_topic_score_gemma":0.0031153697,"teacher_disagreement_score":0.0125676105,"about_ca_system_score_codex":0.002970572,"about_ca_system_score_gemma":0.00096133875,"threshold_uncertainty_score":0.04204285},"labels":[],"label_agreement":null},{"id":"W2102860190","doi":"","title":"Drawing Graphs on the Torus","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Torus; Combinatorics; Vertex (graph theory); Rotation system; Toroid; Planar graph; Embedding; Rotation (mathematics); Graph; Bipartite graph; Discrete mathematics; Geometry; Physics; Computer science","score_opus":0.017115935340757702,"score_gpt":0.23966051249161976,"score_spread":0.22254457715086207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102860190","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054868918,0.0008907216,0.8719539,0.0006735495,0.0005826573,0.00021836493,0.0010284454,0.00716829,0.06261516],"genre_scores_gemma":[0.24564055,0.0013279031,0.7358855,0.00024344426,0.00016616091,0.00020195908,0.0015011481,0.000821586,0.014211806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995925,0.00012266863,0.00001992933,0.000099752484,0.00010490613,0.000060398997],"domain_scores_gemma":[0.9997218,0.000093525014,0.000025350018,0.00008158945,0.000047328736,0.000030360958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020423644,0.0008323161,0.0005767299,0.0010584833,0.00084760616,0.0015152935,0.0008299806,0.00056024466,0.015454821],"category_scores_gemma":[0.001077438,0.00055569445,0.0009166425,0.0014824556,0.00074923044,0.0018329474,0.0011471731,0.00079553924,0.0025961872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030252512,0.000055802786,0.0008820985,0.0005732788,0.00009718971,0.0008347384,0.0017491095,0.11397003,0.036176197,0.4006661,0.049468916,0.39522406],"study_design_scores_gemma":[0.00011032344,0.00024380456,0.0008090945,0.00016133828,0.00008413296,0.000772007,0.0010572053,0.20836827,0.013630034,0.45878482,0.31588522,0.00009372293],"about_ca_topic_score_codex":0.0025316048,"about_ca_topic_score_gemma":0.0038375515,"teacher_disagreement_score":0.015454821,"about_ca_system_score_codex":0.001078773,"about_ca_system_score_gemma":0.0005146097,"threshold_uncertainty_score":0.051701546},"labels":[],"label_agreement":null},{"id":"W2109557983","doi":"","title":"The Last Descent In Samples Of Geometric Random Variables And Permutations.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Descent (aeronautics); Combinatorics; Statistics; Geography","score_opus":0.013036842164318543,"score_gpt":0.23518992439154165,"score_spread":0.2221530822272231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109557983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114391744,0.002186233,0.8611405,0.0035402456,0.00047063344,0.000108851906,0.001088924,0.0010697189,0.016003126],"genre_scores_gemma":[0.74746305,0.00147422,0.21410926,0.0014623376,0.0010806742,0.0004861346,0.0027217614,0.0007922896,0.030410307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952566,0.0025666116,0.00019436916,0.0006951092,0.0007703731,0.00051693013],"domain_scores_gemma":[0.9827381,0.01116268,0.00094194897,0.0032541465,0.0010570558,0.00084618543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060230703,0.0007031581,0.0014202961,0.0020193146,0.0016185999,0.003871393,0.0023484642,0.0017187388,0.007237],"category_scores_gemma":[0.040802564,0.0008323245,0.0011415249,0.0018488712,0.004374286,0.005716893,0.0027300501,0.0031554247,0.001878725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002685594,0.000062434396,0.002786714,0.00011075689,0.00006919055,0.00017269279,0.00025257998,0.021985713,0.0007151831,0.9281751,0.009493766,0.035907228],"study_design_scores_gemma":[0.0000525815,0.000067376146,0.0011692018,0.000062816755,0.000025181333,0.00019972854,0.00007621057,0.13805853,0.000935957,0.8533585,0.0059670336,0.000026915308],"about_ca_topic_score_codex":0.0024481986,"about_ca_topic_score_gemma":0.004923952,"teacher_disagreement_score":0.007237,"about_ca_system_score_codex":0.002103605,"about_ca_system_score_gemma":0.0016736797,"threshold_uncertainty_score":0.031853378},"labels":[],"label_agreement":null},{"id":"W2133707704","doi":"","title":"On the Chromatic Uniqueness of Edge-Gluing of Complete Bipartite Graphs and Cycles.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Uniqueness; Chromatic scale; Graph; Foster graph; Chromatic polynomial; Enhanced Data Rates for GSM Evolution; Complete bipartite graph; Friendship graph; Windmill graph; Discrete mathematics; Line graph; Voltage graph; Mathematical analysis; Computer science","score_opus":0.03988452569176727,"score_gpt":0.2837049346007079,"score_spread":0.24382040890894063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133707704","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7056333,0.001395647,0.2378316,0.0008174975,0.00021127559,0.00006235504,0.00034942818,0.00024025033,0.05345873],"genre_scores_gemma":[0.9756257,0.0003740019,0.01844668,0.00009524273,0.00006631611,0.000023575669,0.00018221696,0.00007715257,0.0051091583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994443,0.0001369749,0.000017773902,0.00017101679,0.000091446454,0.00013843008],"domain_scores_gemma":[0.99842787,0.0007527904,0.00023162081,0.00024730345,0.00015947921,0.00018097855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067427405,0.00029819747,0.00038248984,0.00076639943,0.001810081,0.0014709599,0.0007682633,0.0007195666,0.0038026767],"category_scores_gemma":[0.004622051,0.00030519234,0.0005128674,0.0010088466,0.0028285915,0.0030782337,0.0016029221,0.0011346451,0.00048376975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012366737,0.000021482054,0.0027155448,0.000077902885,0.000016633167,0.00015523352,0.00052468415,0.00738144,0.0031616234,0.96742266,0.0015511061,0.016848158],"study_design_scores_gemma":[0.000021537262,0.00007766124,0.0024384572,0.00003579058,0.000034872915,0.00067355385,0.0006070202,0.030868784,0.0049637854,0.9508526,0.009365059,0.000061004408],"about_ca_topic_score_codex":0.0021721905,"about_ca_topic_score_gemma":0.0022856046,"teacher_disagreement_score":0.0038026767,"about_ca_system_score_codex":0.0009213898,"about_ca_system_score_gemma":0.00076472876,"threshold_uncertainty_score":0.0127212405},"labels":[],"label_agreement":null},{"id":"W2136907605","doi":"","title":"On Dense Triple-Loop Networks.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Loop (graph theory); Mathematics; Combinatorics","score_opus":0.01157568349192068,"score_gpt":0.23056799942518202,"score_spread":0.21899231593326135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136907605","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.120073065,0.0038105818,0.72267264,0.0012659624,0.0005364496,0.00009067966,0.00082209765,0.00071588263,0.15001258],"genre_scores_gemma":[0.88032395,0.004192521,0.06104378,0.0005300664,0.0003838556,0.000225153,0.000984629,0.00020698809,0.05210906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997254,0.00006941331,0.000013248445,0.00004748479,0.000079928985,0.00006450329],"domain_scores_gemma":[0.999038,0.0004180181,0.0001347979,0.00012928744,0.00015768145,0.00012224088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003177986,0.00041868392,0.00048067185,0.0010167501,0.000662086,0.0012130239,0.00063876,0.00057755254,0.012662415],"category_scores_gemma":[0.0022697558,0.00026345276,0.00031984728,0.0009943651,0.0009357517,0.0028648148,0.0013297074,0.0011037572,0.0018393445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006359294,0.000021043888,0.00029749368,0.00012792494,0.000020373538,0.0001557652,0.00011455171,0.023126261,0.001944418,0.9343236,0.007293686,0.0325113],"study_design_scores_gemma":[0.0000116842775,0.000027580287,0.00017813228,0.000034101213,0.000008662753,0.0001536487,0.000060378585,0.052953158,0.0006981494,0.9343997,0.011466696,0.000008115367],"about_ca_topic_score_codex":0.00069659273,"about_ca_topic_score_gemma":0.0013022033,"teacher_disagreement_score":0.012662415,"about_ca_system_score_codex":0.00065110374,"about_ca_system_score_gemma":0.00029305974,"threshold_uncertainty_score":0.042360008},"labels":[],"label_agreement":null},{"id":"W214563378","doi":"","title":"Mutually Independent Hamiltonian Cycles in Some Graphs","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hamiltonian path; Hamiltonian (control theory); Combinatorics; Pure mathematics; Graph; Mathematical optimization","score_opus":0.026747679570385416,"score_gpt":0.29026433268558555,"score_spread":0.2635166531152001,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W214563378","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.802093,0.00091805344,0.08115539,0.0019147184,0.00019082807,0.00020488253,0.0006471595,0.00021397916,0.11266193],"genre_scores_gemma":[0.95174325,0.00047880018,0.024766382,0.000417356,0.00012362741,0.00024214447,0.00044375588,0.0001036864,0.021680886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992945,0.00019793407,0.000044704335,0.0001465656,0.00016076938,0.00015549705],"domain_scores_gemma":[0.9982799,0.0007626152,0.0003129298,0.00013663096,0.00019141422,0.00031644374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005154654,0.0007399191,0.00071893085,0.0024135537,0.0037111118,0.0024421401,0.0011838925,0.0012876071,0.007716726],"category_scores_gemma":[0.0021799328,0.00094204175,0.0009884816,0.002676733,0.0020698346,0.0025301015,0.0020823781,0.0016119604,0.0006096488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049245107,0.000041436353,0.0006790007,0.00008312851,0.000036469068,0.0004784502,0.0007032243,0.0014310664,0.0020347645,0.9874364,0.0017469674,0.005279823],"study_design_scores_gemma":[0.000034632325,0.00001789301,0.0005886496,0.000022458147,0.000049093396,0.00034036275,0.000369953,0.0060917563,0.0011286793,0.98734576,0.0039919675,0.0000188035],"about_ca_topic_score_codex":0.0012871014,"about_ca_topic_score_gemma":0.0026017644,"teacher_disagreement_score":0.007716726,"about_ca_system_score_codex":0.0009685096,"about_ca_system_score_gemma":0.00070897647,"threshold_uncertainty_score":0.02581501},"labels":[],"label_agreement":null},{"id":"W2157678198","doi":"","title":"PATHS TO A MULTINOMIAL INEQUALITY","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Inequality; Multinomial distribution; Statistics; Mathematical analysis","score_opus":0.04351866915341615,"score_gpt":0.31413746262931896,"score_spread":0.2706187934759028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157678198","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057335537,0.0010988341,0.7960825,0.005360034,0.0006369245,0.00009164215,0.0005277397,0.0003202488,0.13854645],"genre_scores_gemma":[0.71843004,0.0026373337,0.1938398,0.0042206333,0.00198707,0.0006929671,0.0008687205,0.00081566174,0.07650773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964445,0.0011333425,0.00011209652,0.0008871688,0.00091087725,0.0005119836],"domain_scores_gemma":[0.98774093,0.008753878,0.0008256209,0.0009255779,0.0011438554,0.0006101417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031059906,0.001038688,0.0011181526,0.0025709867,0.0021725676,0.0040323227,0.0029903755,0.0023857187,0.035000335],"category_scores_gemma":[0.017166689,0.0005686428,0.00151634,0.0032133225,0.00419859,0.012062005,0.00553883,0.0072042434,0.0037383863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008184403,0.0000067968053,0.00014586972,0.000020377205,0.0000035755963,0.000038014776,0.000053568903,0.00080626825,0.00018255273,0.9940995,0.0012049269,0.0034304606],"study_design_scores_gemma":[0.0000048815973,0.000008443611,0.00018337932,0.000019300722,0.0000056634763,0.00006486916,0.000031138752,0.012588366,0.0001502939,0.9835259,0.0034117335,0.0000060173315],"about_ca_topic_score_codex":0.0021474813,"about_ca_topic_score_gemma":0.001719491,"teacher_disagreement_score":0.035000335,"about_ca_system_score_codex":0.0021258935,"about_ca_system_score_gemma":0.0011618736,"threshold_uncertainty_score":0.11708772},"labels":[],"label_agreement":null},{"id":"W21679978","doi":"10.1016/j.juro.2011.03.179","title":"A Helly Theorem For Intersections Of Sets Starshaped Via Staircase n-Paths.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.010268898581256644,"score_gpt":0.24391671476360244,"score_spread":0.23364781618234579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W21679978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16437697,0.0015971218,0.6150063,0.0031887607,0.00048692932,0.00015613667,0.0016778,0.0008699847,0.21263997],"genre_scores_gemma":[0.78822625,0.0013815598,0.12848829,0.0012553156,0.00042059796,0.00029201954,0.0017249293,0.00045179253,0.07775928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905115,0.00016048671,0.000061905186,0.00023262194,0.00033720108,0.00015664051],"domain_scores_gemma":[0.99588037,0.002607543,0.00025721578,0.0005072935,0.00044594044,0.0003016918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010721489,0.0005090359,0.00073181716,0.0018228239,0.0029194872,0.0034046345,0.0014517951,0.0012071208,0.019456219],"category_scores_gemma":[0.0062493086,0.00077389064,0.0012214925,0.0017896472,0.0031173606,0.00886408,0.005420479,0.0037186353,0.0022631472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005416188,0.000016080381,0.00040535227,0.000062918756,0.000013690219,0.00007801988,0.0002780435,0.001123203,0.0005729794,0.9849828,0.0038024038,0.008610439],"study_design_scores_gemma":[0.000020082545,0.000022859083,0.00029712325,0.000025854833,0.000024476458,0.00019843571,0.00019682295,0.0037253352,0.0009863887,0.9824285,0.012059989,0.000014289415],"about_ca_topic_score_codex":0.0014286988,"about_ca_topic_score_gemma":0.0015110414,"teacher_disagreement_score":0.019456219,"about_ca_system_score_codex":0.0015732768,"about_ca_system_score_gemma":0.00077882624,"threshold_uncertainty_score":0.0650875},"labels":[],"label_agreement":null},{"id":"W2169660879","doi":"","title":"Resolving Edge Colorings in Graphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Edge coloring; Combinatorics; Computer science; Graph; Artificial intelligence; Line graph","score_opus":0.012131910959786591,"score_gpt":0.2263921460265984,"score_spread":0.21426023506681183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169660879","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17068681,0.0058626863,0.65166533,0.012511256,0.001860096,0.00032476403,0.0033269015,0.0027569358,0.1510052],"genre_scores_gemma":[0.61867166,0.0028558057,0.32518142,0.0027083699,0.0008864473,0.00021484417,0.004882133,0.00097444234,0.043624885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99750024,0.0009139431,0.0001498702,0.00058753835,0.00040234652,0.00044603285],"domain_scores_gemma":[0.99005264,0.006368122,0.0006194793,0.001848607,0.0005862819,0.00052475464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020281186,0.0008760085,0.0010719544,0.001798209,0.0031088444,0.0044821654,0.002456414,0.002654825,0.014120994],"category_scores_gemma":[0.013829842,0.000978097,0.0011531871,0.0031217055,0.0023751152,0.008631079,0.003959894,0.0044455864,0.0025198932],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021381084,0.00021010412,0.00182952,0.0003844538,0.00007179081,0.00022087664,0.0006290253,0.012826737,0.0026199939,0.8392077,0.050980914,0.09080501],"study_design_scores_gemma":[0.000032855187,0.00001980181,0.00028927223,0.000056012665,0.0000277756,0.00025863957,0.00042980083,0.017118573,0.00197882,0.9583448,0.021423727,0.000019849364],"about_ca_topic_score_codex":0.0028453993,"about_ca_topic_score_gemma":0.0044666855,"teacher_disagreement_score":0.014120994,"about_ca_system_score_codex":0.0018891429,"about_ca_system_score_gemma":0.0013755314,"threshold_uncertainty_score":0.047239423},"labels":[],"label_agreement":null},{"id":"W2172792075","doi":"","title":"On The Super Edge-Magic Deficiency Of Graphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; MAGIC (telescope); Bijection; Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Physics; Quantum mechanics; Computer science","score_opus":0.009240455857461218,"score_gpt":0.2032537891227456,"score_spread":0.1940133332652844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172792075","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9349164,0.0006191491,0.049184345,0.0007445891,0.00004119978,0.000026753272,0.00029886406,0.00009380295,0.014074839],"genre_scores_gemma":[0.9872329,0.00014080197,0.011408035,0.00007013345,0.00002049807,0.00001498963,0.00014338641,0.00001729391,0.0009519474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999154,0.0002447146,0.00005899985,0.00020869699,0.00019038194,0.00014337162],"domain_scores_gemma":[0.99541074,0.0024664646,0.00071652135,0.00053164,0.00036524294,0.0005094793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001288469,0.0003218812,0.00060193776,0.0015524065,0.0009758831,0.0013801471,0.00065905316,0.0006170757,0.0018881732],"category_scores_gemma":[0.0044281133,0.0004174433,0.0003313718,0.0008107453,0.0022081567,0.0027062483,0.0012564617,0.0007473112,0.00016857445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010393312,0.00008886017,0.015343899,0.00029427416,0.000038429793,0.00044231932,0.0010458347,0.021979522,0.019047128,0.8938298,0.0028623396,0.04398835],"study_design_scores_gemma":[0.000058732552,0.00021724323,0.0052542714,0.00007149984,0.000045535653,0.0013554143,0.0007058238,0.069345675,0.009072124,0.90341026,0.010429137,0.000034248333],"about_ca_topic_score_codex":0.00059708237,"about_ca_topic_score_gemma":0.00080807746,"teacher_disagreement_score":0.0018881732,"about_ca_system_score_codex":0.0009941539,"about_ca_system_score_gemma":0.00040211919,"threshold_uncertainty_score":0.0072131753},"labels":[],"label_agreement":null},{"id":"W2174012357","doi":"","title":"On 3-coloring of plane triangulations","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Plane (geometry); Face (sociological concept); Triangulation; Set (abstract data type); Geometry; Computer science","score_opus":0.014407893911314869,"score_gpt":0.23510747871947507,"score_spread":0.2206995848081602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2174012357","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53130484,0.0026626757,0.35529467,0.0018624449,0.0002880762,0.00011274247,0.0015647018,0.00071701757,0.10619276],"genre_scores_gemma":[0.86243707,0.0018716097,0.11722219,0.00059225486,0.0002262322,0.00015074252,0.0014113741,0.00028777384,0.015800824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989066,0.00031660433,0.000053224474,0.00019321675,0.00019610643,0.00033417577],"domain_scores_gemma":[0.9974617,0.0012957297,0.00044121026,0.0003451883,0.00021413599,0.00024194723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067932444,0.00071286876,0.00072976167,0.0015285166,0.0015484344,0.0022019532,0.0008595863,0.0008097964,0.0073179514],"category_scores_gemma":[0.0031607857,0.0005379877,0.0008180353,0.0021164455,0.001906473,0.0025122939,0.0023416826,0.001240991,0.0011120135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028493616,0.00004983805,0.0030422306,0.000182186,0.00003160111,0.00026340326,0.0007010275,0.032852147,0.0047408096,0.8956242,0.010102789,0.052124877],"study_design_scores_gemma":[0.000039382052,0.000040733084,0.001846034,0.00005302159,0.000018586148,0.00037105675,0.0003519134,0.06952321,0.0017053545,0.90765995,0.01835944,0.000031377516],"about_ca_topic_score_codex":0.0031877037,"about_ca_topic_score_gemma":0.0035929198,"teacher_disagreement_score":0.0073179514,"about_ca_system_score_codex":0.0021546355,"about_ca_system_score_gemma":0.00048244072,"threshold_uncertainty_score":0.024480999},"labels":[],"label_agreement":null},{"id":"W2177700890","doi":"","title":"Extremal bipartite graphs with high girth","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Combinatorics; Girth (graph theory); Complete bipartite graph; Graph; Degree (music); Odd graph; Pancyclic graph; Discrete mathematics; Triangle-free graph; Foster graph; 1-planar graph; Graph power; Line graph; Physics","score_opus":0.02002632650413408,"score_gpt":0.26915747818237873,"score_spread":0.24913115167824465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2177700890","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9525862,0.0006337133,0.03504121,0.0004844838,0.000024260948,0.000012583173,0.00025736456,0.00018536409,0.010774889],"genre_scores_gemma":[0.9904935,0.00020706096,0.0080186445,0.000065688626,0.000045771147,0.000017532735,0.00020261596,0.000025169436,0.0009239798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942577,0.0001683122,0.000017228149,0.00014878281,0.00010054598,0.00013939073],"domain_scores_gemma":[0.9977768,0.0011129427,0.0003675542,0.00032406644,0.00015674252,0.00026185074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041590925,0.0002645512,0.00052701484,0.0011550697,0.0008621008,0.0010644773,0.00052955444,0.00068688986,0.0015975495],"category_scores_gemma":[0.0033889168,0.00034057006,0.00025471897,0.00075916253,0.0009280316,0.0011570895,0.0013307711,0.00064560183,0.00022675129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013464474,0.00016192206,0.03668822,0.00041281793,0.00017273932,0.003332966,0.0014845864,0.06546629,0.06758707,0.7412598,0.009336433,0.07275085],"study_design_scores_gemma":[0.000075777054,0.00018139665,0.026856562,0.00007106149,0.00008471344,0.006048219,0.0007392211,0.1571451,0.015860122,0.77964264,0.013226483,0.00006867982],"about_ca_topic_score_codex":0.0002048371,"about_ca_topic_score_gemma":0.00034435745,"teacher_disagreement_score":0.0015975495,"about_ca_system_score_codex":0.0005457599,"about_ca_system_score_gemma":0.00016282675,"threshold_uncertainty_score":0.0053443313},"labels":[],"label_agreement":null},{"id":"W2180784125","doi":"","title":"The total chromatic number of some bipartite graphs","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Chromatic scale; Combinatorics; Foster graph; Graph; Line graph; Voltage graph","score_opus":0.011877532212437014,"score_gpt":0.22813568561092532,"score_spread":0.2162581533984883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2180784125","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8727254,0.00090199156,0.056208346,0.0036081658,0.00011789732,0.000068877256,0.0027019712,0.00035395668,0.06331338],"genre_scores_gemma":[0.9658561,0.00058552774,0.019540677,0.00039403478,0.00019466257,0.00014854467,0.00154585,0.00021409555,0.011520416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989894,0.00032245828,0.00004321494,0.0002696371,0.00018536109,0.00018995398],"domain_scores_gemma":[0.9900771,0.0067432444,0.0009947234,0.0008198188,0.00049678405,0.0008684111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015136768,0.0009896547,0.0009789006,0.0036403134,0.0030670173,0.0057350546,0.0024551828,0.001729021,0.010683381],"category_scores_gemma":[0.006242898,0.001022005,0.0008710477,0.0040675313,0.003648061,0.0051239477,0.0016264019,0.0023643125,0.00059794256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005784361,0.00012321102,0.005822747,0.0003104436,0.00011130561,0.00012941264,0.0006205128,0.043131966,0.007750217,0.9125991,0.013101868,0.015720667],"study_design_scores_gemma":[0.00012607547,0.00004914604,0.0034296184,0.000057255536,0.000103379105,0.00022589098,0.00033342556,0.11691399,0.0033338692,0.86970806,0.0056671235,0.00005221545],"about_ca_topic_score_codex":0.0036143574,"about_ca_topic_score_gemma":0.0064510847,"teacher_disagreement_score":0.010683381,"about_ca_system_score_codex":0.0042813295,"about_ca_system_score_gemma":0.0014194248,"threshold_uncertainty_score":0.03573948},"labels":[],"label_agreement":null},{"id":"W2181133991","doi":"","title":"Independent Cycles in a Bipartite Graph.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Graph; Complete bipartite graph; Combinatorics","score_opus":0.025259145208541306,"score_gpt":0.29056747833971486,"score_spread":0.2653083331311735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2181133991","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34424347,0.0043098647,0.45033902,0.004287659,0.00074720825,0.00034201954,0.0028204643,0.0008578271,0.19205247],"genre_scores_gemma":[0.80808884,0.0032041082,0.11075084,0.0013089939,0.00064908195,0.0006412422,0.0025060412,0.00042566983,0.072425164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989569,0.00038740443,0.000059462087,0.00025246566,0.00019369068,0.00015015608],"domain_scores_gemma":[0.9958062,0.0023338515,0.0006256453,0.00035374134,0.00041415222,0.00046640585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064923335,0.00065663026,0.0006747671,0.0029306572,0.001864335,0.0023667736,0.0011066234,0.0017203882,0.0105681745],"category_scores_gemma":[0.0052002748,0.0006900182,0.00076280837,0.002909149,0.0016837872,0.003614045,0.0016711545,0.0017290612,0.002436494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071339615,0.000049405706,0.0007906342,0.00017472084,0.000043349133,0.00030912156,0.0003330034,0.0033269504,0.0017352243,0.960509,0.0104990285,0.022158274],"study_design_scores_gemma":[0.000018883298,0.000013681475,0.0003881399,0.00005400889,0.000029266052,0.00028148794,0.00012837544,0.013759114,0.00063313957,0.97337836,0.011301028,0.000014455231],"about_ca_topic_score_codex":0.0016469549,"about_ca_topic_score_gemma":0.0026869373,"teacher_disagreement_score":0.0105681745,"about_ca_system_score_codex":0.001084406,"about_ca_system_score_gemma":0.00072192185,"threshold_uncertainty_score":0.035354078},"labels":[],"label_agreement":null},{"id":"W2184131469","doi":"","title":"A stochastic model for the number of fixed points of a Welch Costas permutation.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Random permutation; Permutation (music); Mathematics; Combinatorics; Cyclic permutation; Order (exchange); Partial permutation; Discrete mathematics; Symmetric group","score_opus":0.04081863445165606,"score_gpt":0.34015855417318014,"score_spread":0.2993399197215241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184131469","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092543684,0.0003952809,0.8963163,0.0009073021,0.00016454361,0.00019447197,0.00075108843,0.0004001544,0.00832723],"genre_scores_gemma":[0.88082063,0.0005158964,0.08828711,0.00036685631,0.00027491103,0.00060045574,0.0010527102,0.00017073276,0.027910681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760544,0.0007112541,0.000091071175,0.00068056467,0.00047140548,0.0004402388],"domain_scores_gemma":[0.9892294,0.0059441095,0.0017252867,0.0016809817,0.000800807,0.0006193668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040522357,0.00089813914,0.0015075383,0.0025991884,0.0014282207,0.0028315966,0.0034366124,0.003464082,0.011264273],"category_scores_gemma":[0.01803884,0.00091066235,0.0016733531,0.0017409514,0.0051437067,0.0052610068,0.0017661604,0.0032605163,0.0019505278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018915269,0.0000680542,0.0021896393,0.0000820352,0.00007032452,0.00030075872,0.00020211714,0.22613068,0.0039262865,0.75325274,0.0026003576,0.010987835],"study_design_scores_gemma":[0.000045139026,0.00008703082,0.0010115986,0.000027967755,0.000024394141,0.00015228524,0.000054876517,0.6672708,0.0012008307,0.32825223,0.0018080855,0.00006480108],"about_ca_topic_score_codex":0.00318497,"about_ca_topic_score_gemma":0.004664952,"teacher_disagreement_score":0.011264273,"about_ca_system_score_codex":0.002452223,"about_ca_system_score_gemma":0.0013230029,"threshold_uncertainty_score":0.037682712},"labels":[],"label_agreement":null},{"id":"W2185126490","doi":"","title":"Tutte uniqueness of locally grid graphs","year":2009,"lang":"it","type":"article","venue":"Ars Combinatoria","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Uniqueness; Grid; Combinatorics; Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.019056275731259353,"score_gpt":0.280612930851511,"score_spread":0.26155665512025167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2185126490","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83671385,0.00021282851,0.13966271,0.0003276757,0.00003886118,0.000043508266,0.00068480265,0.00037224262,0.021943465],"genre_scores_gemma":[0.98432344,0.000107932145,0.009748263,0.0000678822,0.000028342938,0.000046724082,0.00046523215,0.00008932781,0.005122684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994204,0.000112598354,0.000026388418,0.00017513525,0.00008502199,0.00018047955],"domain_scores_gemma":[0.99759346,0.0010027799,0.00034266233,0.00045489162,0.00028286673,0.00032336634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032634646,0.00027870535,0.0005369047,0.00072276435,0.0014974944,0.0016460043,0.0007146125,0.0007622837,0.00504144],"category_scores_gemma":[0.003702015,0.0005022235,0.00049512094,0.0007990226,0.0015326514,0.0025783277,0.0016783351,0.0010428409,0.0007919129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038652567,0.00006545331,0.011240287,0.00019436351,0.00004388577,0.0006538836,0.0019551953,0.02950444,0.015238378,0.90676165,0.0042717014,0.029684138],"study_design_scores_gemma":[0.00003857236,0.00015058933,0.0053958185,0.00004423836,0.000044182285,0.0013906022,0.001234129,0.08056747,0.01125276,0.8902525,0.0095534455,0.00007570923],"about_ca_topic_score_codex":0.0015016148,"about_ca_topic_score_gemma":0.0018392052,"teacher_disagreement_score":0.00504144,"about_ca_system_score_codex":0.00048119357,"about_ca_system_score_gemma":0.000447231,"threshold_uncertainty_score":0.016865313},"labels":[],"label_agreement":null},{"id":"W21885831","doi":"10.1161/circresaha.111.245969","title":"Ranks of Regular Graphs Under Certain Unary Operations.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Heart, Lung, and Blood Institute","keywords":"Unary operation; Mathematics; Combinatorics","score_opus":0.011095045278237096,"score_gpt":0.23935933002592288,"score_spread":0.2282642847476858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W21885831","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68509305,0.0007946584,0.21625237,0.0018636534,0.00033529894,0.00017727862,0.0022989686,0.0017355925,0.09144916],"genre_scores_gemma":[0.9654827,0.00035804405,0.016353812,0.00030780007,0.00030888105,0.0001022223,0.0012711517,0.000269305,0.015546088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817276,0.00033383028,0.00013602918,0.00043806108,0.00041820892,0.00050104206],"domain_scores_gemma":[0.9952937,0.0017190038,0.0011520233,0.00070277695,0.0005019461,0.00063044054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012895721,0.0006137693,0.00079975696,0.0032413232,0.0018271045,0.0037735845,0.0011416983,0.0008387711,0.01778174],"category_scores_gemma":[0.0044273795,0.00035122293,0.00115739,0.001531372,0.0019671866,0.004973786,0.0016404081,0.0014678367,0.0021373273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002552398,0.0000971277,0.0010887007,0.00015523197,0.000042841893,0.0002681884,0.00041797076,0.0036975055,0.0032575803,0.9691823,0.003908489,0.017628828],"study_design_scores_gemma":[0.000037288533,0.00008239266,0.0010513518,0.000023029459,0.00003921338,0.0005030396,0.00017844827,0.01345901,0.0027404712,0.97683084,0.0050071953,0.000047653528],"about_ca_topic_score_codex":0.0010132263,"about_ca_topic_score_gemma":0.0013920724,"teacher_disagreement_score":0.01778174,"about_ca_system_score_codex":0.0012862938,"about_ca_system_score_gemma":0.0006906636,"threshold_uncertainty_score":0.059485853},"labels":[],"label_agreement":null},{"id":"W22003958","doi":"10.1111/j.1582-4934.2011.01469.x","title":"Critical sets for dihedral groups.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematics and Applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dihedral group; Dihedral angle; Pure mathematics; Group (periodic table); Chemistry","score_opus":0.052798291817565936,"score_gpt":0.36104867931141793,"score_spread":0.308250387493852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W22003958","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09103529,0.008446048,0.25185633,0.0053821737,0.0064932797,0.00040460133,0.0032056267,0.0014191401,0.63175756],"genre_scores_gemma":[0.68810093,0.0047134524,0.08447184,0.0028129746,0.001128114,0.0009432121,0.0037121568,0.0010435369,0.2130738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996283,0.000057413778,0.000030372537,0.00012871076,0.00009378671,0.00006142605],"domain_scores_gemma":[0.99971694,0.000047656464,0.00005515287,0.00006723364,0.000054129978,0.000058814945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002777308,0.0007711664,0.0004638324,0.0009985084,0.0014611253,0.0017165288,0.0009995336,0.0009715127,0.07473757],"category_scores_gemma":[0.0011472043,0.00032662568,0.00041061637,0.0005822673,0.0013869988,0.0022580137,0.002003054,0.0013757009,0.012819941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006960674,0.000018299756,0.00021344825,0.00017915874,0.000011257188,0.00012905143,0.0001091554,0.00088509487,0.0037277285,0.96044594,0.008997034,0.02521417],"study_design_scores_gemma":[0.000020717831,0.000037783248,0.00019417652,0.000035024197,0.000006475563,0.00026354165,0.0001407099,0.0012648394,0.0024334427,0.8712483,0.1243401,0.000014925612],"about_ca_topic_score_codex":0.00039540193,"about_ca_topic_score_gemma":0.00060205563,"teacher_disagreement_score":0.07473757,"about_ca_system_score_codex":0.00071478984,"about_ca_system_score_gemma":0.0004919973,"threshold_uncertainty_score":0.2500221},"labels":[],"label_agreement":null},{"id":"W220737694","doi":"","title":"A Combinatorial Shifting Method On Multicomplexes With Applications To Simplicial Complexes And Simple Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Simple (philosophy); Mathematics; Simplicial complex; Abstract simplicial complex; Simplicial approximation theorem; Combinatorics; Simplicial set; Pure mathematics","score_opus":0.026642175524037547,"score_gpt":0.2865448549466455,"score_spread":0.259902679422608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W220737694","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04448342,0.0006089275,0.92780316,0.0004556578,0.00029044336,0.0000995355,0.00015296826,0.000691684,0.02541421],"genre_scores_gemma":[0.32009396,0.0010843587,0.64490604,0.00030086018,0.000303606,0.00018576169,0.00046813342,0.0006267488,0.03203057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949026,0.00010895981,0.000031767348,0.00013148754,0.0001898237,0.00004766007],"domain_scores_gemma":[0.99893516,0.00038184907,0.00005986558,0.00031740637,0.00017591058,0.00012976179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070535013,0.0005811127,0.00056557666,0.0022133053,0.00093192444,0.0012041447,0.0013280293,0.0004929911,0.0115011595],"category_scores_gemma":[0.0031598795,0.00033516763,0.0005940667,0.0022280896,0.001808641,0.002534412,0.00312817,0.0013293745,0.0022142036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006330168,0.00010133423,0.0010298486,0.00013784188,0.000027481727,0.00016998815,0.0003728278,0.008396691,0.009806447,0.62371784,0.0062311725,0.3499453],"study_design_scores_gemma":[0.000031032512,0.00008538789,0.0010452494,0.00005214781,0.000037802725,0.0006059093,0.000359267,0.11066138,0.01000144,0.83270496,0.044371456,0.000044023433],"about_ca_topic_score_codex":0.00093985436,"about_ca_topic_score_gemma":0.0014188604,"teacher_disagreement_score":0.0115011595,"about_ca_system_score_codex":0.000634591,"about_ca_system_score_gemma":0.0005006548,"threshold_uncertainty_score":0.038475215},"labels":[],"label_agreement":null},{"id":"W2209429586","doi":"","title":"About General Order Regular Flexagons","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Synthesis and properties of polymers","field":"Materials Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Order (exchange); Business","score_opus":0.025848384537106552,"score_gpt":0.22691227290545304,"score_spread":0.2010638883683465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2209429586","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40362555,0.002942279,0.09162192,0.0029541356,0.000717116,0.000073718606,0.0007290712,0.0003241326,0.4970121],"genre_scores_gemma":[0.9394652,0.0019170396,0.015849272,0.00080996065,0.00066988484,0.00007087188,0.00053906126,0.00019940932,0.04047928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997396,0.000059000326,0.000015721187,0.000059096787,0.00007770823,0.00004887736],"domain_scores_gemma":[0.99946874,0.00023856352,0.000082829225,0.00009277061,0.000048475533,0.000068601534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035825744,0.00051783904,0.00048333668,0.0009797697,0.0012976464,0.00234344,0.00057036843,0.0008176979,0.009553695],"category_scores_gemma":[0.0011248946,0.00030768206,0.0005551404,0.0009556859,0.0020814668,0.0037922247,0.0011184552,0.0016615062,0.00081781007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002383377,0.0000063146645,0.00005865314,0.00003413744,0.000003575204,0.000041997697,0.00008825568,0.0011975376,0.00044993398,0.9933488,0.0009502629,0.0037967998],"study_design_scores_gemma":[0.0000063437865,0.000004844497,0.000067737106,0.0000072175226,0.0000024510387,0.000044016004,0.0000504277,0.0018508806,0.00019294502,0.9943551,0.0034135086,0.0000046330497],"about_ca_topic_score_codex":0.00051511073,"about_ca_topic_score_gemma":0.0006908255,"teacher_disagreement_score":0.009553695,"about_ca_system_score_codex":0.0008477467,"about_ca_system_score_gemma":0.00024196878,"threshold_uncertainty_score":0.03196031},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.015373727413802237,"score_gpt":0.22799794753461056,"score_spread":0.2126242201208083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2219595186","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8931292,0.0022672212,0.052910287,0.0012078488,0.00016035303,0.000038173253,0.0005232582,0.00013043349,0.049633235],"genre_scores_gemma":[0.98262286,0.0010547956,0.012272556,0.00015466772,0.00019598148,0.00004378914,0.0002468236,0.000041680174,0.0033668873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934644,0.0001661507,0.000032635584,0.00015830308,0.00014414664,0.0001523397],"domain_scores_gemma":[0.9979284,0.0008797049,0.0003690576,0.00020191452,0.0002078118,0.0004131129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006833249,0.00057041005,0.0005870507,0.002512577,0.0011395833,0.0016910312,0.0007075962,0.00062300847,0.0031034031],"category_scores_gemma":[0.0029715498,0.0003177132,0.00049375254,0.0014966711,0.0026252177,0.0026236984,0.001823446,0.0011333709,0.00037468827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000867367,0.000031587344,0.00186101,0.000074878175,0.000018049237,0.000121403034,0.00050418155,0.0030814505,0.0025442946,0.98136467,0.0015024208,0.008809333],"study_design_scores_gemma":[0.000024153773,0.00007552623,0.0027028613,0.000043824424,0.000018693947,0.00033000237,0.00029390655,0.018619481,0.0010536778,0.9689146,0.0078853145,0.000037865695],"about_ca_topic_score_codex":0.0010230411,"about_ca_topic_score_gemma":0.00063192094,"teacher_disagreement_score":0.0031034031,"about_ca_system_score_codex":0.0012447087,"about_ca_system_score_gemma":0.00030808244,"threshold_uncertainty_score":0.010381937},"labels":[],"label_agreement":null},{"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.04101186121649524,"score_gpt":0.26861997904994717,"score_spread":0.22760811783345192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W22292547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21750697,0.0034197816,0.59503716,0.0023072367,0.0012669867,0.00009946367,0.00044281202,0.00040610443,0.1795135],"genre_scores_gemma":[0.8506883,0.002739535,0.06940317,0.0007876036,0.00094534917,0.00021362446,0.0004994815,0.00037311384,0.07434978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998387,0.0005237667,0.000076286466,0.00028277925,0.00052748615,0.00020274513],"domain_scores_gemma":[0.9980349,0.00055325625,0.00029965938,0.000177886,0.0005757,0.00035857243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018106134,0.0008279703,0.00065417984,0.0026944897,0.0014004662,0.002692463,0.0009392147,0.0008130803,0.0071208086],"category_scores_gemma":[0.0046425248,0.00026041848,0.00057866535,0.0013966643,0.0035246878,0.004724648,0.0031266015,0.0019244198,0.0014033734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024108896,0.0000093283215,0.00009296461,0.00003072312,0.000009203848,0.000030629883,0.00013861638,0.00035520003,0.00053679076,0.99322647,0.00070029806,0.0048456932],"study_design_scores_gemma":[0.000009717114,0.000044051714,0.00035628048,0.000019730911,0.0000069343964,0.000105815554,0.00013345694,0.008612578,0.0007202848,0.98284954,0.007126663,0.000014975768],"about_ca_topic_score_codex":0.0016622213,"about_ca_topic_score_gemma":0.0012590897,"teacher_disagreement_score":0.0071208086,"about_ca_system_score_codex":0.0011805721,"about_ca_system_score_gemma":0.0008773797,"threshold_uncertainty_score":0.023821533},"labels":[],"label_agreement":null},{"id":"W2236526535","doi":"","title":"Hamiltonicity of the Inner Power of a Cycle","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Power (physics)","score_opus":0.01242643194636564,"score_gpt":0.2568757387617923,"score_spread":0.24444930681542668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2236526535","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6964589,0.0005908878,0.09555689,0.0015010162,0.00024143768,0.00008570707,0.00040970684,0.00018367941,0.20497179],"genre_scores_gemma":[0.9737399,0.00027466234,0.0056791804,0.00021068491,0.00015925492,0.000050071416,0.0001392351,0.00006400403,0.019682892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995623,0.00011635322,0.00001859932,0.00008003295,0.000108021755,0.00011457129],"domain_scores_gemma":[0.99857545,0.00064937863,0.00021073513,0.00013926762,0.00019809727,0.00022708952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039945045,0.00037616782,0.0005198975,0.0015417807,0.0012497534,0.0020778042,0.0007114446,0.0006906037,0.008520805],"category_scores_gemma":[0.0019243382,0.00036165712,0.0004635133,0.0010500462,0.0020855714,0.0017468992,0.0013228732,0.0011728873,0.0007977609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027780217,0.000011516629,0.00026848854,0.000023896759,0.000006576681,0.00009962587,0.00026185688,0.00085714966,0.0014289418,0.99271566,0.00086381676,0.00343474],"study_design_scores_gemma":[0.000014198336,0.000011929046,0.00022537712,0.000009134706,0.000007389859,0.00005541306,0.000091493224,0.0038282976,0.00061230327,0.99302095,0.0021151416,0.000008404682],"about_ca_topic_score_codex":0.002260372,"about_ca_topic_score_gemma":0.002258898,"teacher_disagreement_score":0.008520805,"about_ca_system_score_codex":0.000875303,"about_ca_system_score_gemma":0.00053930253,"threshold_uncertainty_score":0.028504968},"labels":[],"label_agreement":null},{"id":"W22396107","doi":"10.1002/pca.2358","title":"Stability Number and f-factor in K 1, n -free Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Factor (programming language); Stability (learning theory); Computer science","score_opus":0.027836573303789525,"score_gpt":0.2782295072133435,"score_spread":0.25039293390955397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W22396107","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85572946,0.011906792,0.10488068,0.0009358802,0.00016123676,0.00009342477,0.0025812353,0.00041056756,0.023300633],"genre_scores_gemma":[0.978933,0.0019168392,0.01092973,0.00009545702,0.000045804623,0.000059623013,0.0012455578,0.00008273779,0.0066910805],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940145,0.00012266473,0.000019841444,0.00023866033,0.00013487421,0.0000824725],"domain_scores_gemma":[0.9989184,0.00049885665,0.00021906134,0.00010504865,0.00018266868,0.00007586791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006714576,0.0003392539,0.00022903759,0.0015557567,0.0005506824,0.0006069917,0.00037642234,0.00039298754,0.0028457944],"category_scores_gemma":[0.00216363,0.00020876541,0.00028391232,0.0006102936,0.00076201424,0.0010835454,0.0002892651,0.0006580013,0.0008360349],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011353963,0.000102252976,0.007675003,0.000616925,0.00012708864,0.00019695761,0.0005802796,0.007306468,0.8814827,0.037693813,0.003586983,0.059496205],"study_design_scores_gemma":[0.000039510553,0.00064954394,0.03337373,0.000076011216,0.000116454146,0.0009809938,0.000248613,0.022896174,0.8672745,0.046303865,0.027907385,0.00013324998],"about_ca_topic_score_codex":0.0033323714,"about_ca_topic_score_gemma":0.0035386228,"teacher_disagreement_score":0.0033323714,"about_ca_system_score_codex":0.0010449084,"about_ca_system_score_gemma":0.00029709612,"threshold_uncertainty_score":0.0095201135},"labels":[],"label_agreement":null},{"id":"W2239631536","doi":"","title":"Maximum Wiener Index of Unicyclic Graphs with Fixed Maximum Degree","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Wiener index; Degree (music); Statistics; Combinatorics; Discrete mathematics; Graph; Computer science; Physics","score_opus":0.03673490465704366,"score_gpt":0.2754255899989676,"score_spread":0.23869068534192395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2239631536","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88003445,0.0014410198,0.07696102,0.0006731816,0.00008592368,0.000028390803,0.0004889494,0.00025122208,0.040035803],"genre_scores_gemma":[0.9828316,0.000757622,0.009317231,0.00008100866,0.0001142146,0.000049349786,0.00029189204,0.00010657938,0.006450476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994299,0.00012938317,0.000036340418,0.000114108196,0.00015426653,0.00013591607],"domain_scores_gemma":[0.9964729,0.0018762107,0.00063344947,0.0002834126,0.00026429657,0.0004696612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009406974,0.0006574296,0.0012122905,0.0038448279,0.0015934835,0.0030520994,0.00161183,0.0010419656,0.0039900625],"category_scores_gemma":[0.005441592,0.00070043444,0.0006268707,0.0027810852,0.0018533998,0.0042091073,0.0019209345,0.0012277231,0.0005780421],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029941511,0.000039142087,0.001689543,0.00015720435,0.000042678264,0.00017864167,0.00056825427,0.011985957,0.0088205775,0.96274346,0.0015258793,0.011949212],"study_design_scores_gemma":[0.000031063446,0.00003821394,0.0011448396,0.000038986007,0.00003818851,0.0001958582,0.00014747497,0.034079075,0.0035059412,0.9589173,0.0018291614,0.000033922643],"about_ca_topic_score_codex":0.0006700375,"about_ca_topic_score_gemma":0.0012429162,"teacher_disagreement_score":0.0039900625,"about_ca_system_score_codex":0.0015156247,"about_ca_system_score_gemma":0.0005074537,"threshold_uncertainty_score":0.013348043},"labels":[],"label_agreement":null},{"id":"W2240587687","doi":"","title":"Some Good Cyclic and Quasi-Twisted Z 4 -Linear Codes.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics; Combinatorics; Discrete mathematics; Arithmetic","score_opus":0.021172871303082177,"score_gpt":0.22937721576246728,"score_spread":0.2082043444593851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2240587687","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73154134,0.0025960666,0.06269498,0.0034580023,0.0004689791,0.00009479657,0.001138191,0.0004268778,0.19758074],"genre_scores_gemma":[0.9626292,0.00069901237,0.009166984,0.00032125448,0.0002051152,0.00005395453,0.00032026766,0.000076272176,0.02652797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994172,0.00013773696,0.000024407966,0.000062648774,0.00017062474,0.00018737819],"domain_scores_gemma":[0.9986161,0.000568225,0.0002554341,0.00019010641,0.00017448554,0.00019555511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005711543,0.00050856284,0.00032742787,0.0014435868,0.0010766427,0.0017653856,0.0004670991,0.00078918587,0.007335604],"category_scores_gemma":[0.0023303218,0.00036351228,0.00050533155,0.0011480345,0.0017778169,0.0017124669,0.0017507226,0.0013329408,0.0013492942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116646,0.000016041035,0.00053397374,0.00004461767,0.000009314844,0.0002534372,0.000244995,0.0017761416,0.0017374852,0.98388934,0.0025213,0.008856599],"study_design_scores_gemma":[0.000037621397,0.00004201936,0.0007566143,0.00003490131,0.000015579564,0.00045456365,0.0001419822,0.006737308,0.002104388,0.9803208,0.009325372,0.000028729632],"about_ca_topic_score_codex":0.0010408955,"about_ca_topic_score_gemma":0.0011787118,"teacher_disagreement_score":0.007335604,"about_ca_system_score_codex":0.0011041636,"about_ca_system_score_gemma":0.00083007675,"threshold_uncertainty_score":0.024540067},"labels":[],"label_agreement":null},{"id":"W2255515338","doi":"","title":"Self-complementary magic squares.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Magic square; Mathematics; MAGIC (telescope); Arithmetic; Combinatorics; Astronomy; Physics","score_opus":0.009429417000067771,"score_gpt":0.22074071702791528,"score_spread":0.2113113000278475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2255515338","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18228199,0.0021550627,0.3085846,0.004179942,0.0013009384,0.00012497485,0.0019126256,0.0010035266,0.4984563],"genre_scores_gemma":[0.77800167,0.00097033643,0.12811464,0.0014120169,0.00040636008,0.0001598514,0.0014803386,0.0003809017,0.08907387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993748,0.00017258147,0.000026961006,0.00016234249,0.00016457068,0.00009883798],"domain_scores_gemma":[0.99837387,0.0007639584,0.00016271546,0.0003165037,0.00020052842,0.00018243091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046655157,0.00040920373,0.0005696706,0.0010968163,0.0015123298,0.0017787615,0.0010601328,0.0010878718,0.023001136],"category_scores_gemma":[0.002689324,0.0004087059,0.0005544315,0.001172951,0.0016180952,0.00287462,0.0020727413,0.0018576655,0.003705082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041887462,0.000019831008,0.0001891055,0.00007316165,0.000009340235,0.00005618788,0.0000683265,0.00089214655,0.0011346114,0.972415,0.008968101,0.0161323],"study_design_scores_gemma":[0.000018392964,0.0000099753925,0.0001620126,0.000020590815,0.000007997572,0.00015889217,0.00006929401,0.0051919613,0.0011308313,0.9767049,0.016515555,0.000009503991],"about_ca_topic_score_codex":0.0006933728,"about_ca_topic_score_gemma":0.0017570332,"teacher_disagreement_score":0.023001136,"about_ca_system_score_codex":0.0007466264,"about_ca_system_score_gemma":0.00061071746,"threshold_uncertainty_score":0.07694644},"labels":[],"label_agreement":null},{"id":"W2259036428","doi":"","title":"CONICS CHARACTERIZING THE GENERALIZED FIBONACCI AND LUCAS SEQUENCES WITH INDICES IN ARITHMETIC PROGRESSIONS","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Mathematics; Lucas number; Lucas sequence; Arithmetic; Conic section; Pisano period; Fibonacci polynomials; Combinatorics; Geometry; Classical orthogonal polynomials","score_opus":0.007995846988303204,"score_gpt":0.26609275554367784,"score_spread":0.25809690855537465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2259036428","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4490362,0.005544327,0.2448987,0.001889023,0.00095239666,0.00037160696,0.0010145729,0.00034547792,0.29594758],"genre_scores_gemma":[0.86936975,0.0035687299,0.08757052,0.0006059089,0.0011496678,0.00039870245,0.000908188,0.00020126483,0.036227267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989943,0.00015859569,0.00007966696,0.00016397561,0.00043286075,0.0001706194],"domain_scores_gemma":[0.9979463,0.0007314088,0.00043158972,0.00018630277,0.0005026008,0.00020176818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009427534,0.00087558036,0.00084694615,0.004378113,0.0023903013,0.0038246126,0.0007480301,0.0011051496,0.00946193],"category_scores_gemma":[0.0049506463,0.00037261905,0.0006368127,0.0037877834,0.0037142567,0.0058276877,0.0012355185,0.0024702672,0.0014929518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001422609,0.0000067873116,0.00019870498,0.00003663927,0.000002299487,0.00009841995,0.00019648852,0.0008258476,0.000905698,0.9887644,0.0007589386,0.008191474],"study_design_scores_gemma":[0.00000856934,0.000018927174,0.00042594186,0.00003244891,0.0000041848907,0.0002575177,0.00023477976,0.0028767919,0.0008232754,0.9839018,0.011393085,0.000022617955],"about_ca_topic_score_codex":0.0013606631,"about_ca_topic_score_gemma":0.0018794689,"teacher_disagreement_score":0.00946193,"about_ca_system_score_codex":0.0017739884,"about_ca_system_score_gemma":0.001175821,"threshold_uncertainty_score":0.031653345},"labels":[],"label_agreement":null},{"id":"W2261193143","doi":"","title":"Longest path starting at a vertex","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Path (computing); Combinatorics; Computer science; Graph; Computer network","score_opus":0.007865656827534644,"score_gpt":0.20364350290230418,"score_spread":0.19577784607476953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2261193143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3582,0.0012148595,0.4271065,0.0033095977,0.0016228727,0.0008194728,0.014145314,0.0051895115,0.18839195],"genre_scores_gemma":[0.5901473,0.0013147561,0.29096967,0.00046209007,0.00021151302,0.00038542593,0.008887207,0.0011019132,0.106520005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945146,0.000063030624,0.00004155975,0.00019165277,0.00010582708,0.00014643576],"domain_scores_gemma":[0.9981534,0.0007514553,0.00018502944,0.00024137198,0.00032568982,0.0003430453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035188196,0.00093685085,0.00078037195,0.002054557,0.0031231483,0.002730802,0.0014933521,0.002030018,0.03251406],"category_scores_gemma":[0.001943135,0.0006240886,0.00093027134,0.0019140381,0.00090677006,0.0033507321,0.0021448499,0.0016085797,0.009470335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013075296,0.0004443812,0.0032741642,0.0018484012,0.0001939864,0.004807714,0.0028191297,0.004429682,0.08808664,0.74634683,0.02254022,0.12390126],"study_design_scores_gemma":[0.00017141608,0.00040680516,0.0019290874,0.00042523025,0.00024835768,0.0033588181,0.001707153,0.013112797,0.053979065,0.7788673,0.14565644,0.00013755843],"about_ca_topic_score_codex":0.0014678604,"about_ca_topic_score_gemma":0.0022175848,"teacher_disagreement_score":0.03251406,"about_ca_system_score_codex":0.0010989928,"about_ca_system_score_gemma":0.0018090137,"threshold_uncertainty_score":0.10877037},"labels":[],"label_agreement":null},{"id":"W2262149688","doi":"","title":"Crossing numbers of nearly complete graphs and nearly complete bipartite graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Robertson–Seymour theorem; Cograph; Indifference graph; Complete bipartite graph; 1-planar graph; Chordal graph; Discrete mathematics; Graph","score_opus":0.023439922217151583,"score_gpt":0.2743095829051087,"score_spread":0.25086966068795713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2262149688","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7075691,0.0023459885,0.14490186,0.0015055548,0.0003590913,0.00006775581,0.00220372,0.00053598825,0.14051084],"genre_scores_gemma":[0.9738444,0.00082005165,0.015922623,0.0002033564,0.00013318719,0.00006745982,0.00078439276,0.00011600231,0.008108479],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992236,0.0001991678,0.00003385696,0.00018511532,0.00022883927,0.00012949336],"domain_scores_gemma":[0.99488187,0.0026445542,0.0009856869,0.00050167093,0.00035514336,0.000631214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009019816,0.00046711403,0.00047024895,0.0034846645,0.00087097846,0.0023258685,0.0009184578,0.0009281368,0.009597542],"category_scores_gemma":[0.007917166,0.00044327526,0.00032640964,0.0024274462,0.0012894038,0.003550332,0.0012006595,0.0013829811,0.00088264165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012021618,0.00003067675,0.0016272549,0.00008912195,0.000019985324,0.000101075595,0.00018589567,0.0093898615,0.002825137,0.9603777,0.004679011,0.020554163],"study_design_scores_gemma":[0.000015011435,0.000021921223,0.0021639208,0.000038499886,0.000015513493,0.00035054114,0.00016188512,0.026899891,0.0014378902,0.9632187,0.0056571956,0.000019006804],"about_ca_topic_score_codex":0.0005794479,"about_ca_topic_score_gemma":0.0006751473,"teacher_disagreement_score":0.009597542,"about_ca_system_score_codex":0.0008604791,"about_ca_system_score_gemma":0.0003064373,"threshold_uncertainty_score":0.032106996},"labels":[],"label_agreement":null},{"id":"W2266186","doi":"10.1136/jcp.43.12.992","title":"The Domination Graphs of Complete Paired Comparison Digraphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.02565909821618035,"score_gpt":0.29988415800787005,"score_spread":0.2742250597916897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2266186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13084117,0.0018034087,0.80541444,0.0014411296,0.00027062854,0.00047898976,0.01142095,0.0021252255,0.046204124],"genre_scores_gemma":[0.768969,0.0013096535,0.18145819,0.0009121178,0.00042323105,0.0011740128,0.013221753,0.00062428165,0.03190769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99572635,0.0012797728,0.0002214705,0.00158253,0.0008420507,0.00034775923],"domain_scores_gemma":[0.9819009,0.01192303,0.0017853404,0.0021815908,0.0015032697,0.0007058593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032060987,0.0007870729,0.0008751458,0.0037745398,0.0011153393,0.0022895518,0.0016652311,0.00090136216,0.019985273],"category_scores_gemma":[0.01744751,0.0006423349,0.0011482523,0.0023464418,0.0023684122,0.0041305185,0.0015126509,0.0014032525,0.002167494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045177084,0.00017190375,0.0041266186,0.00076637993,0.0002441817,0.00066304294,0.0006419051,0.015481847,0.004248696,0.8081956,0.01407454,0.1509335],"study_design_scores_gemma":[0.00005281253,0.00012047476,0.0035454223,0.00008619843,0.000070258364,0.00064377685,0.00011329435,0.06682806,0.0022392205,0.90774333,0.018514892,0.000042374188],"about_ca_topic_score_codex":0.0012483163,"about_ca_topic_score_gemma":0.0014122328,"teacher_disagreement_score":0.019985273,"about_ca_system_score_codex":0.0018107109,"about_ca_system_score_gemma":0.0008701095,"threshold_uncertainty_score":0.06685746},"labels":[],"label_agreement":null},{"id":"W2266835036","doi":"","title":"The Relative n-th Commutativity Degree of 2-Generator p-Groups of Nilpotency Class Two","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Commutative property; Degree (music); Class (philosophy); Generator (circuit theory); Pure mathematics; Computer science; Artificial intelligence; Physics","score_opus":0.03644561613127464,"score_gpt":0.27582707121809086,"score_spread":0.2393814550868162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2266835036","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9059622,0.00026967804,0.027311338,0.000913937,0.00024319136,0.00003952465,0.00016595647,0.00012894897,0.06496528],"genre_scores_gemma":[0.9922895,0.0001045748,0.0022327735,0.00009045674,0.00012033135,0.000027829426,0.00008534837,0.000028421757,0.0050208406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987664,0.00027540393,0.00007507972,0.00031545298,0.00023365785,0.00033400205],"domain_scores_gemma":[0.99755484,0.00092805625,0.00040580137,0.00022475525,0.00024053417,0.0006460379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019372578,0.0005926099,0.0005619796,0.002767755,0.0029800606,0.0037220642,0.0011756569,0.00080867484,0.006766376],"category_scores_gemma":[0.002877144,0.00043384876,0.00045594436,0.00097268756,0.0060451403,0.0055891885,0.0024865451,0.0015061578,0.0007035576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027997734,0.000057606194,0.0021637396,0.000052847998,0.000017523013,0.00018853862,0.0012456224,0.0006962182,0.005962847,0.9810497,0.0007181681,0.007567207],"study_design_scores_gemma":[0.00004285807,0.00011251922,0.0030214225,0.000027063574,0.000026590811,0.0005003275,0.000583715,0.0040437947,0.008634527,0.97771466,0.005232031,0.000060445156],"about_ca_topic_score_codex":0.0005588516,"about_ca_topic_score_gemma":0.0006625563,"teacher_disagreement_score":0.006766376,"about_ca_system_score_codex":0.0013363028,"about_ca_system_score_gemma":0.00053462427,"threshold_uncertainty_score":0.022635818},"labels":[],"label_agreement":null},{"id":"W22670994","doi":"","title":"On Friendly Index Sets of Bipartite Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Index (typography); Combinatorics; Discrete mathematics; Graph; Computer science; World Wide Web","score_opus":0.013574699607247429,"score_gpt":0.22790031124383284,"score_spread":0.21432561163658542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W22670994","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31106114,0.0015845232,0.46074393,0.0026949754,0.00040528236,0.0002779786,0.0027320855,0.0012320619,0.21926805],"genre_scores_gemma":[0.80040425,0.0014637945,0.14425084,0.0012351685,0.000541518,0.00047025445,0.0033742457,0.000680495,0.04757951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972996,0.0009469678,0.00015367572,0.0004018448,0.0006993079,0.0004985769],"domain_scores_gemma":[0.99069536,0.0056871637,0.0009000631,0.0014172652,0.00051578385,0.00078445475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016748353,0.0007189059,0.0011508727,0.0031166065,0.003478348,0.005761877,0.0020748442,0.0017401378,0.013019982],"category_scores_gemma":[0.010274395,0.00091758225,0.0011161626,0.003377911,0.002390233,0.008822043,0.0037379677,0.0024282846,0.0026642024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008338395,0.00005455109,0.0006085123,0.000074041745,0.000011961543,0.000068956404,0.00029585647,0.0029915199,0.0009807821,0.9727233,0.0068710637,0.015236171],"study_design_scores_gemma":[0.00001756399,0.000018577723,0.0003572414,0.000034324374,0.0000140423645,0.00016430697,0.00014430938,0.013326577,0.0010624346,0.9758664,0.008979245,0.0000149968955],"about_ca_topic_score_codex":0.001177396,"about_ca_topic_score_gemma":0.0018443703,"teacher_disagreement_score":0.013019982,"about_ca_system_score_codex":0.0023657884,"about_ca_system_score_gemma":0.0007760367,"threshold_uncertainty_score":0.043556154},"labels":[],"label_agreement":null},{"id":"W2274512402","doi":"","title":"A Note on Eigenvalues of the Derangement Graph","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Derangement; Mathematics; Eigenvalues and eigenvectors; Combinatorics; Graph; Pure mathematics; Physics; Quantum mechanics","score_opus":0.0482777693190106,"score_gpt":0.2858767769068373,"score_spread":0.23759900758782673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2274512402","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20536175,0.009796343,0.3025976,0.014537286,0.011109566,0.000077932884,0.00046454417,0.0011381919,0.45491683],"genre_scores_gemma":[0.83816963,0.007094847,0.060064852,0.0022539739,0.0051356764,0.00010123636,0.00019841675,0.0006740179,0.086307295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960655,0.000113195405,0.00001750312,0.00007891581,0.00014074639,0.000043115382],"domain_scores_gemma":[0.99898964,0.00056485075,0.000082350045,0.00015814413,0.000095990734,0.000108952394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051066396,0.000770396,0.0007361615,0.001712701,0.0014086873,0.00208816,0.0010233407,0.0012855387,0.008101462],"category_scores_gemma":[0.0022118336,0.0003382265,0.00060701714,0.0011445176,0.0021956416,0.0027674183,0.0013284936,0.0025591175,0.0014349888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001864411,0.000011133172,0.00008718702,0.000044075277,0.000005770715,0.00014709479,0.00017638283,0.0016474708,0.0016985664,0.9834221,0.004518974,0.008222599],"study_design_scores_gemma":[0.0000034943348,0.00000896768,0.000119102566,0.000010850975,0.0000032794164,0.00008417341,0.00006247832,0.0040096254,0.00035059094,0.98721343,0.008120115,0.000014043063],"about_ca_topic_score_codex":0.0008030598,"about_ca_topic_score_gemma":0.00094413763,"teacher_disagreement_score":0.008101462,"about_ca_system_score_codex":0.00065025606,"about_ca_system_score_gemma":0.00028616108,"threshold_uncertainty_score":0.027102113},"labels":[],"label_agreement":null},{"id":"W2279781878","doi":"","title":"The Laplacian spectral radius of graphs with given matching number","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; Matching (statistics); Combinatorics; Laplace operator; RADIUS; Mathematical analysis; Statistics; Computer science; Eigenvalues and eigenvectors; Physics; Computer network","score_opus":0.009841915676796955,"score_gpt":0.2601583011360572,"score_spread":0.25031638545926027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2279781878","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88132143,0.0008315516,0.07924849,0.0017937482,0.00010390931,0.0000323826,0.0005172238,0.00059321406,0.035557978],"genre_scores_gemma":[0.9878754,0.0003470327,0.0074693183,0.00012473296,0.00012595174,0.000037868096,0.00020657059,0.00011494227,0.0036981679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994591,0.00018453403,0.00002189498,0.0001328216,0.00011224495,0.000089393936],"domain_scores_gemma":[0.9955966,0.0025730843,0.00060142955,0.0002751332,0.00031980846,0.0006340233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008697258,0.00058854424,0.00076257833,0.003029724,0.001064418,0.0025684482,0.0014780669,0.00141539,0.004982551],"category_scores_gemma":[0.008102566,0.0004322776,0.00030874988,0.0014601739,0.0017992149,0.0030266189,0.0013007815,0.0007308111,0.0008075398],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053973135,0.00012622423,0.003856924,0.00023661584,0.000059271926,0.0002814364,0.0006623448,0.048367377,0.017829293,0.90114003,0.007234664,0.019666025],"study_design_scores_gemma":[0.000052313542,0.00005595194,0.0028324712,0.00004372728,0.000044754037,0.00041186344,0.00045353698,0.25149763,0.004918524,0.7367782,0.0028586057,0.000052455372],"about_ca_topic_score_codex":0.00085865846,"about_ca_topic_score_gemma":0.0007319326,"teacher_disagreement_score":0.004982551,"about_ca_system_score_codex":0.0012297613,"about_ca_system_score_gemma":0.00040591322,"threshold_uncertainty_score":0.01666832},"labels":[],"label_agreement":null},{"id":"W2281619726","doi":"","title":"The Connected Domination and Tree Domination of P(n,k) for k = 1, 2, [n/2]","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Tree (set theory); Domination analysis; Graph","score_opus":0.024368073227741285,"score_gpt":0.27167585384316717,"score_spread":0.24730778061542588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2281619726","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80275625,0.0007322797,0.051608346,0.0017277856,0.00008547585,0.00015504105,0.0014172068,0.00021802828,0.14129959],"genre_scores_gemma":[0.95860153,0.00042466747,0.012263493,0.0002065329,0.000068627036,0.00016654252,0.0011111305,0.000119766555,0.027037602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992505,0.0001564972,0.000034215867,0.00017208274,0.00019973848,0.00018701186],"domain_scores_gemma":[0.9965663,0.0017155922,0.0005343727,0.0002738142,0.00039793723,0.000511929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053669745,0.0003877466,0.00031310142,0.0020318155,0.0021778387,0.0030651984,0.0013213111,0.0011353786,0.011423809],"category_scores_gemma":[0.005675618,0.00039881276,0.0005401308,0.00201444,0.0020221765,0.0026173699,0.0017051713,0.0012403487,0.00077667664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059314165,0.000066522756,0.0029378072,0.0001731849,0.00004082565,0.0006481354,0.001821026,0.00714367,0.008352844,0.95058745,0.005974537,0.021660846],"study_design_scores_gemma":[0.000083526895,0.000032337743,0.004884521,0.000050284674,0.000040323495,0.00092520367,0.00047236076,0.033290062,0.0036395683,0.9462158,0.010317461,0.00004855183],"about_ca_topic_score_codex":0.0032315522,"about_ca_topic_score_gemma":0.0042326706,"teacher_disagreement_score":0.011423809,"about_ca_system_score_codex":0.0011354646,"about_ca_system_score_gemma":0.00090652343,"threshold_uncertainty_score":0.038216412},"labels":[],"label_agreement":null},{"id":"W2281982864","doi":"","title":"Strong Distances in Strong Oriented Complete k-Partite Graphs","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.031077314002769665,"score_gpt":0.23482072264806414,"score_spread":0.20374340864529447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2281982864","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8447943,0.0006502988,0.100513674,0.0019790612,0.00016606506,0.0001076468,0.001337847,0.00030740636,0.050143667],"genre_scores_gemma":[0.9676427,0.00038782295,0.018995851,0.00035251453,0.00012507067,0.00013853532,0.0009657835,0.00010690009,0.011284807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998459,0.00036802198,0.00009502207,0.00039858426,0.0003528361,0.00032670275],"domain_scores_gemma":[0.99236506,0.003724745,0.0012642943,0.0006468129,0.00058811094,0.0014110161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076569384,0.0007241453,0.0012097504,0.0019070357,0.003649205,0.00435375,0.0016808448,0.0014980164,0.008529712],"category_scores_gemma":[0.0055440194,0.0012870898,0.00073693186,0.0028674328,0.0022054403,0.005720133,0.0032023555,0.0025277212,0.0009960106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003728648,0.00012910932,0.004060609,0.00030211094,0.000053340453,0.00028231204,0.0008999923,0.016600383,0.0038173783,0.9503345,0.0063034003,0.01684397],"study_design_scores_gemma":[0.00009065205,0.0000618701,0.0020257817,0.000041336323,0.00005323648,0.00030700112,0.00064774416,0.027652787,0.001822183,0.96154225,0.005720094,0.000035087036],"about_ca_topic_score_codex":0.0010645802,"about_ca_topic_score_gemma":0.0019260269,"teacher_disagreement_score":0.008529712,"about_ca_system_score_codex":0.0015123138,"about_ca_system_score_gemma":0.00088050344,"threshold_uncertainty_score":0.02853477},"labels":[],"label_agreement":null},{"id":"W2288095033","doi":"","title":"On short zero-sum subsequences over p-groups","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Zero (linguistics); Combinatorics; Arithmetic; Linguistics","score_opus":0.041612595551010864,"score_gpt":0.32899054369092323,"score_spread":0.28737794813991235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2288095033","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64452916,0.0033115777,0.16557482,0.0029626645,0.0016878659,0.000086739296,0.00036687194,0.0007069392,0.18077327],"genre_scores_gemma":[0.9162557,0.0017948233,0.021670194,0.0005948632,0.0012421249,0.00011861378,0.00046731412,0.0003703852,0.05748597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987962,0.00033394896,0.000104403145,0.00024034294,0.00029899983,0.00022611271],"domain_scores_gemma":[0.9970553,0.0014592352,0.00039391255,0.00035045666,0.00026239458,0.00047863254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014186355,0.0018119488,0.0016591382,0.0047353217,0.003994744,0.0038748682,0.0020254576,0.0018364838,0.009888432],"category_scores_gemma":[0.004933168,0.00081492943,0.0016593413,0.004339783,0.0045066364,0.011560917,0.004873965,0.003651024,0.0015762916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050742678,0.000031067313,0.00027367217,0.00004762776,0.000012429124,0.00023060082,0.0005201409,0.00057005277,0.0007112889,0.9907092,0.0007424811,0.0061007123],"study_design_scores_gemma":[0.00000915083,0.000023629886,0.00016418102,0.000021254335,0.000012800457,0.00015154289,0.00015797585,0.0016062415,0.00034228433,0.995742,0.0017566847,0.000012188379],"about_ca_topic_score_codex":0.000822676,"about_ca_topic_score_gemma":0.0009159938,"teacher_disagreement_score":0.009888432,"about_ca_system_score_codex":0.0018503036,"about_ca_system_score_gemma":0.00064079254,"threshold_uncertainty_score":0.0330801},"labels":[],"label_agreement":null},{"id":"W2289374179","doi":"","title":"On factorisations of cyclic permutations into transpositions","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.00587812331910578,"score_gpt":0.24369172887370713,"score_spread":0.23781360555460135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2289374179","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047887255,0.00054609246,0.91393,0.00058723794,0.00019779988,0.00014382083,0.00023011825,0.0012322871,0.035245452],"genre_scores_gemma":[0.38859004,0.0014095404,0.56765467,0.0007236457,0.0004731788,0.0004169994,0.0015620696,0.0018443946,0.03732544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978052,0.00083683373,0.00014045858,0.00046535034,0.00042213133,0.00033002876],"domain_scores_gemma":[0.99267393,0.00524534,0.00033712317,0.0011330869,0.00035220385,0.00025831177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002491745,0.0015701842,0.0014027408,0.0015699952,0.0011391112,0.0034946667,0.0022033532,0.0015552953,0.019895924],"category_scores_gemma":[0.011765856,0.0008051586,0.0023361093,0.0027637938,0.0035944514,0.0062070987,0.0032863033,0.003358399,0.0034422758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018369836,0.00008827866,0.00046590553,0.00016469897,0.000032274995,0.000075891505,0.00039021517,0.038220648,0.002118297,0.8613623,0.004608445,0.09228944],"study_design_scores_gemma":[0.000042013733,0.000050602615,0.000104653445,0.00004378623,0.000018343277,0.000075043085,0.00008462843,0.051909592,0.0012886325,0.93901795,0.007344221,0.00002052497],"about_ca_topic_score_codex":0.0018063602,"about_ca_topic_score_gemma":0.0025691886,"teacher_disagreement_score":0.019895924,"about_ca_system_score_codex":0.0016141183,"about_ca_system_score_gemma":0.0009278388,"threshold_uncertainty_score":0.06655848},"labels":[],"label_agreement":null},{"id":"W2293521544","doi":"","title":"A Linear Time Algorithm for Computing Longest Paths in 2-Trees","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Time complexity; Algorithm; Running time; Computer science; Combinatorics","score_opus":0.013515686416620123,"score_gpt":0.2757339437695265,"score_spread":0.2622182573529064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293521544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06516807,0.0014052135,0.8975995,0.0014115222,0.000321064,0.00067385024,0.0030426981,0.014848604,0.0155294165],"genre_scores_gemma":[0.10421678,0.00031194423,0.88252354,0.00029729144,0.00010542878,0.00042902786,0.004316353,0.0008243799,0.006975202],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843854,0.0002036313,0.00013177904,0.0005234102,0.00043831227,0.00026431584],"domain_scores_gemma":[0.99701846,0.0017271898,0.00019631059,0.0005548861,0.0003012656,0.00020180237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009558043,0.0020349147,0.0017412547,0.0024934025,0.0017380111,0.0035888879,0.0038313752,0.0024273319,0.01890895],"category_scores_gemma":[0.0045955605,0.0011467737,0.002033366,0.005336051,0.0011346331,0.0075386097,0.0032639042,0.0025067257,0.005029812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013715924,0.00088941806,0.0022742746,0.0015447442,0.00022565047,0.0002471177,0.0005889575,0.044976216,0.027409688,0.04089949,0.03899662,0.84057623],"study_design_scores_gemma":[0.0016531132,0.00089539675,0.0032250702,0.0002468939,0.00050863775,0.0009940289,0.0010545403,0.5658602,0.029369656,0.35077822,0.045174837,0.00023933429],"about_ca_topic_score_codex":0.0056248032,"about_ca_topic_score_gemma":0.012676211,"teacher_disagreement_score":0.01890895,"about_ca_system_score_codex":0.0025295455,"about_ca_system_score_gemma":0.0033624235,"threshold_uncertainty_score":0.06325674},"labels":[],"label_agreement":null},{"id":"W2293732238","doi":"","title":"Fuzzy parameterized fuzzy soft lattice implication algebras","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Parameterized complexity; Mathematics; Fuzzy logic; Lattice (music); Pure mathematics; Algebra over a field; Artificial intelligence; Algorithm; Computer science; Physics","score_opus":0.01365426802870272,"score_gpt":0.24429238800740707,"score_spread":0.23063811997870434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293732238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14995353,0.0003385785,0.79556185,0.0005006172,0.0001528062,0.00011165602,0.00048626587,0.0008999927,0.05199471],"genre_scores_gemma":[0.8579444,0.00024849127,0.11942973,0.00018432608,0.00012290856,0.00009668839,0.00045809132,0.00012373156,0.021391585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987795,0.00022243599,0.0001131545,0.00021721302,0.0005321478,0.00013565803],"domain_scores_gemma":[0.99844235,0.0003347641,0.000217884,0.00035274745,0.00045582873,0.00019637546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010508572,0.00046779314,0.0007014076,0.001178159,0.001456063,0.004072212,0.0010116247,0.000593769,0.009222806],"category_scores_gemma":[0.0025109914,0.00039996332,0.001027636,0.0015174139,0.0018231076,0.005126683,0.0015223107,0.0020787963,0.0015177123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012546431,0.00004980712,0.0002946816,0.0000469841,0.000026844336,0.00018064759,0.00019883615,0.0044453735,0.004502553,0.964985,0.000994469,0.024149297],"study_design_scores_gemma":[0.000031437143,0.000026126161,0.0002463127,0.00001558366,0.000029571409,0.00021559285,0.00012186841,0.040893022,0.004406342,0.94771767,0.006265904,0.00003071054],"about_ca_topic_score_codex":0.0009262975,"about_ca_topic_score_gemma":0.0014204348,"teacher_disagreement_score":0.009222806,"about_ca_system_score_codex":0.0015841752,"about_ca_system_score_gemma":0.00096515566,"threshold_uncertainty_score":0.030853331},"labels":[],"label_agreement":null},{"id":"W2294185024","doi":"","title":"Product Cordial Sets of Long Grids","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Graph; Vertex (graph theory); Mathematics; Product (mathematics); Geometry","score_opus":0.015008691299261839,"score_gpt":0.24192746120376785,"score_spread":0.22691876990450602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294185024","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8561707,0.0004300637,0.10899427,0.00026897562,0.000058255057,0.000064889115,0.0012463452,0.0003386895,0.03242778],"genre_scores_gemma":[0.937635,0.00025210806,0.04740934,0.0001239731,0.00008089433,0.00012030138,0.0014074955,0.000080047255,0.012890741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945563,0.00007369677,0.00004657266,0.0001506583,0.00015825382,0.00011523294],"domain_scores_gemma":[0.99808514,0.0006340944,0.00040529075,0.00032915402,0.00026835245,0.00027805872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039104818,0.0003109705,0.00052289997,0.0011315752,0.0012155778,0.0016873315,0.0008492757,0.00039146908,0.0057529705],"category_scores_gemma":[0.0023086525,0.00037199084,0.00045456956,0.0013545932,0.0010855374,0.0022767219,0.0013106058,0.0007975898,0.00045124802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023300335,0.000052421026,0.005109353,0.00011679196,0.00002167122,0.0002318934,0.00056564034,0.008069143,0.00541092,0.9420637,0.002734807,0.035390727],"study_design_scores_gemma":[0.00004242001,0.00011840529,0.0061030905,0.000048561742,0.000028556826,0.0010579225,0.00028809978,0.05179048,0.005761092,0.9131034,0.021617368,0.00004055768],"about_ca_topic_score_codex":0.0011229032,"about_ca_topic_score_gemma":0.0011988265,"teacher_disagreement_score":0.0057529705,"about_ca_system_score_codex":0.0011781658,"about_ca_system_score_gemma":0.0003810606,"threshold_uncertainty_score":0.019245625},"labels":[],"label_agreement":null},{"id":"W2294545534","doi":"","title":"Quaternary quasi-cyclic codes with even length components","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Quaternary; Mathematics; Geology; Paleontology","score_opus":0.02518241983312978,"score_gpt":0.22015279862893525,"score_spread":0.19497037879580548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294545534","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54437435,0.003528494,0.32732597,0.0039060798,0.0012557384,0.00029123988,0.001472048,0.00096525036,0.116880916],"genre_scores_gemma":[0.923545,0.0014343162,0.042830516,0.0010561994,0.0006462295,0.00022149956,0.00049761985,0.00019319203,0.029575365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882513,0.00030760048,0.00009467269,0.00014644384,0.0003639101,0.00026233093],"domain_scores_gemma":[0.996657,0.0013352218,0.0005325171,0.00064739067,0.00056546903,0.00026243014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010277824,0.0008258259,0.00076945976,0.0017592191,0.0017610966,0.0029812101,0.00066059356,0.0012176742,0.007079951],"category_scores_gemma":[0.0033294363,0.00050221436,0.0005556441,0.0021344796,0.0019401661,0.0022558803,0.0017477684,0.0015948389,0.0020367864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023963778,0.00003568504,0.00049859384,0.00009073904,0.000011489008,0.00022207874,0.00023072724,0.001616498,0.011314971,0.9647836,0.0020871435,0.018868815],"study_design_scores_gemma":[0.000087929984,0.00019256661,0.000947171,0.00010098331,0.00004497093,0.0009436756,0.00015941102,0.018587805,0.01700453,0.9402454,0.021595014,0.00009054175],"about_ca_topic_score_codex":0.0004883387,"about_ca_topic_score_gemma":0.0005920722,"teacher_disagreement_score":0.007079951,"about_ca_system_score_codex":0.0012586879,"about_ca_system_score_gemma":0.0017341098,"threshold_uncertainty_score":0.0236848},"labels":[],"label_agreement":null},{"id":"W2394487339","doi":"","title":"Special minimum cuts in directed graphs NOTE.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.024485116995650837,"score_gpt":0.2921298065002501,"score_spread":0.2676446895045993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394487339","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16153918,0.0052940752,0.42972204,0.008713077,0.0046655047,0.0003147375,0.004043306,0.0012815042,0.38442665],"genre_scores_gemma":[0.777665,0.0046420265,0.14486986,0.0023264703,0.0031359133,0.00040935157,0.0052963146,0.0007505277,0.060904566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913126,0.0001790468,0.000058490714,0.00028305323,0.00024299814,0.00010523822],"domain_scores_gemma":[0.99604756,0.0024230676,0.0003227624,0.00044669662,0.00036484835,0.0003950723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007555298,0.0007762482,0.00092890643,0.0020536685,0.0012198037,0.002525827,0.0014109779,0.0014630641,0.026170045],"category_scores_gemma":[0.005816672,0.00070873165,0.0010687888,0.0023249614,0.0014988882,0.00376465,0.0017064583,0.0045540403,0.0028166294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019141218,0.00007524629,0.0009806843,0.00055245514,0.000064521235,0.0006518449,0.0003759467,0.0026655004,0.0037782346,0.9091182,0.039534487,0.042011462],"study_design_scores_gemma":[0.000025080897,0.000029638832,0.0007371429,0.000047361274,0.000033650856,0.0008553899,0.00013519327,0.0038538957,0.0011454638,0.9737646,0.019356968,0.000015680727],"about_ca_topic_score_codex":0.00080371863,"about_ca_topic_score_gemma":0.0013820805,"teacher_disagreement_score":0.026170045,"about_ca_system_score_codex":0.0008212184,"about_ca_system_score_gemma":0.00045366416,"threshold_uncertainty_score":0.08754754},"labels":[],"label_agreement":null},{"id":"W2394503390","doi":"","title":"Some considerations on the n-th commutativity degrees of finite groups","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Commutative property; Combinatorics; Integer (computer science); Degree (music); Element (criminal law); Group (periodic table); Finite group; Normal subgroup; Discrete mathematics; Chemistry; Physics","score_opus":0.16468342142275164,"score_gpt":0.34924345372809423,"score_spread":0.1845600323053426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394503390","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41593972,0.028098041,0.29966098,0.013631902,0.0015299434,0.000112673166,0.00046771663,0.0001607401,0.24039826],"genre_scores_gemma":[0.96552616,0.004873207,0.019162053,0.00087447936,0.0019597835,0.00010149281,0.00012566871,0.00004192064,0.007335195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760604,0.0009685828,0.0001593978,0.00048509776,0.0005646348,0.00021625115],"domain_scores_gemma":[0.9914983,0.006311602,0.0006813482,0.0005752983,0.0004299751,0.0005034482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052324,0.0007149159,0.0007850912,0.0024447679,0.002079453,0.0025320963,0.0015206169,0.0010970571,0.004535395],"category_scores_gemma":[0.010270498,0.0005258407,0.0011659391,0.0015605838,0.006395507,0.0054056463,0.0016115024,0.0025849077,0.00046933274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019926798,0.000017688762,0.00060697395,0.00004918196,0.000005467821,0.000081014536,0.00026197644,0.0017742204,0.00067055156,0.99364436,0.000374177,0.002494499],"study_design_scores_gemma":[0.000006453269,0.00006347646,0.0009273192,0.00004107364,0.000007642574,0.0001881987,0.000104845705,0.0074984357,0.00050225586,0.98503774,0.0056011807,0.000021258018],"about_ca_topic_score_codex":0.0009001816,"about_ca_topic_score_gemma":0.00085740007,"teacher_disagreement_score":0.0052324,"about_ca_system_score_codex":0.0023825704,"about_ca_system_score_gemma":0.0006417466,"threshold_uncertainty_score":0.027671874},"labels":[],"label_agreement":null},{"id":"W2394517787","doi":"","title":"Pseudo-outerplanar graphs and chromatic conjectures.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics; Outerplanar graph; Discrete mathematics; Pathwidth; Graph; Line graph","score_opus":0.008828477229429532,"score_gpt":0.2513453727960519,"score_spread":0.24251689556662237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394517787","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3188011,0.008928505,0.12783024,0.04153802,0.0025401225,0.00016105032,0.001992483,0.001012893,0.49719557],"genre_scores_gemma":[0.93409383,0.004188815,0.017074792,0.0030142951,0.0014300018,0.00010530449,0.0020696644,0.00022321829,0.037800115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860436,0.0004624347,0.000045250777,0.0003234083,0.00034047168,0.00022415537],"domain_scores_gemma":[0.9868707,0.00918539,0.0008584028,0.001574117,0.00082434533,0.00068707863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016636654,0.0006988778,0.0006649433,0.0015334812,0.00282823,0.0031803844,0.0019245828,0.0025161947,0.022324208],"category_scores_gemma":[0.0135669345,0.0006866437,0.00075356255,0.0021156631,0.0051214322,0.0097120255,0.0035102575,0.0045907903,0.0022572866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104441104,0.000055287946,0.0009921871,0.00015976951,0.000016581213,0.00018533216,0.0004508705,0.0024002413,0.00041641953,0.9678164,0.01683605,0.010566406],"study_design_scores_gemma":[0.000019458985,0.000010616436,0.00037407063,0.000030638894,0.000009686548,0.00011285268,0.00021384205,0.002761779,0.00019068307,0.98885196,0.007415812,0.000008657977],"about_ca_topic_score_codex":0.0027814726,"about_ca_topic_score_gemma":0.0040397868,"teacher_disagreement_score":0.022324208,"about_ca_system_score_codex":0.0016071162,"about_ca_system_score_gemma":0.0008496488,"threshold_uncertainty_score":0.07468188},"labels":[],"label_agreement":null},{"id":"W2394528912","doi":"","title":"End-completely-regular and End-inverse joins of graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Joins; Mathematics; Inverse; Combinatorics; Computer science; Geometry; Programming language","score_opus":0.015978604320760783,"score_gpt":0.2543213914225688,"score_spread":0.23834278710180803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394528912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26269117,0.0014393908,0.46058166,0.0015746985,0.0005588746,0.0001448301,0.0014354999,0.0014564615,0.2701174],"genre_scores_gemma":[0.86440545,0.00069004326,0.07576838,0.0006124985,0.00043428005,0.00012323097,0.0017602827,0.00062630506,0.055579524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980622,0.000399863,0.00012328957,0.0005949944,0.0005330279,0.00028662488],"domain_scores_gemma":[0.99521315,0.0020464982,0.0005621136,0.0009011108,0.00069032866,0.00058673316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013569891,0.00057321216,0.0007204957,0.001611896,0.0024631196,0.0040213894,0.0011838187,0.0011822523,0.007510923],"category_scores_gemma":[0.0051473947,0.00067562645,0.0011631137,0.0013564639,0.003658619,0.0077781077,0.003168088,0.0029873461,0.0021689795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067730296,0.00003668002,0.00035905227,0.0000342924,0.00001009535,0.00014720333,0.0003602096,0.00043677675,0.0009187119,0.9886641,0.0014106287,0.007554621],"study_design_scores_gemma":[0.00001160113,0.000019208816,0.0003113413,0.000015892638,0.00001410749,0.00030479807,0.00022468939,0.0016224651,0.001780151,0.9863267,0.009354954,0.000014241451],"about_ca_topic_score_codex":0.0007516787,"about_ca_topic_score_gemma":0.0011419023,"teacher_disagreement_score":0.007510923,"about_ca_system_score_codex":0.0009278954,"about_ca_system_score_gemma":0.0006373537,"threshold_uncertainty_score":0.025126576},"labels":[],"label_agreement":null},{"id":"W2394571210","doi":"","title":"On The Algebraic Study of Spanning Simplicial Complexes of r-cyclic Graphs G n, r .","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Algebraic number; Simplicial complex; Pure mathematics; Discrete mathematics; Mathematical analysis","score_opus":0.018313887383707515,"score_gpt":0.24943826611326936,"score_spread":0.23112437872956185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394571210","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.572205,0.011079726,0.2512962,0.008666097,0.0006285913,0.00015117256,0.00064896996,0.00025251464,0.1550718],"genre_scores_gemma":[0.9429529,0.003700609,0.03345179,0.00062040833,0.0005628553,0.000072872266,0.0004439848,0.0001037907,0.018090846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992384,0.0002725334,0.000044153738,0.00012610792,0.00019609787,0.00012278445],"domain_scores_gemma":[0.9971969,0.0016310057,0.00029263576,0.00018057691,0.00031167764,0.00038718613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001134203,0.0007501535,0.00077344757,0.0033474106,0.0017553463,0.0030594743,0.0013123475,0.0010622921,0.0069140326],"category_scores_gemma":[0.0067663854,0.0004820615,0.0007184275,0.0024399802,0.0034698218,0.006391618,0.0029871033,0.0017256227,0.0008449258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021250604,0.00003709439,0.0007535363,0.00010652881,0.000017073811,0.00018520503,0.0005017836,0.0031693582,0.0006844622,0.98414224,0.0022249112,0.008156436],"study_design_scores_gemma":[0.0000074215163,0.000021875047,0.000538666,0.000039396004,0.000011609242,0.000262683,0.00033024317,0.012589229,0.00029802893,0.9790375,0.0068471683,0.000016074395],"about_ca_topic_score_codex":0.0017636821,"about_ca_topic_score_gemma":0.0018539106,"teacher_disagreement_score":0.0069140326,"about_ca_system_score_codex":0.0013502834,"about_ca_system_score_gemma":0.0006249886,"threshold_uncertainty_score":0.023129702},"labels":[],"label_agreement":null},{"id":"W2394588418","doi":"","title":"On Component Order Edge Connectivity Of a Complete Bipartite Graph.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Enhanced Data Rates for GSM Evolution; Complete bipartite graph; Order (exchange); Component (thermodynamics); Graph; Computer science; Artificial intelligence","score_opus":0.017335751760802386,"score_gpt":0.22655301028302763,"score_spread":0.20921725852222525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394588418","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53662497,0.0021847822,0.30743402,0.0030815245,0.00032291823,0.00017529144,0.0029838576,0.00058604626,0.14660661],"genre_scores_gemma":[0.95073384,0.0020114973,0.028098758,0.000497338,0.00036957653,0.00022413874,0.002037902,0.00020204631,0.015824812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994184,0.0002000197,0.000028365064,0.00012463205,0.00013159814,0.000096950294],"domain_scores_gemma":[0.99495643,0.003414363,0.00051009934,0.00036562153,0.00044998535,0.00030339602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005633842,0.00047662467,0.0005657724,0.0025613362,0.000937174,0.0015872001,0.0010138584,0.0012223258,0.009944687],"category_scores_gemma":[0.006053283,0.00037748224,0.0004071543,0.0021222753,0.0015116006,0.0036611366,0.0010186349,0.0013481812,0.0010076761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013600182,0.000048758517,0.0024851218,0.00022032976,0.00003445229,0.00031100647,0.0004126661,0.020231664,0.00210311,0.94026566,0.011087904,0.02266342],"study_design_scores_gemma":[0.000025462,0.000039258637,0.0019878906,0.000069539135,0.000028312446,0.0003453296,0.000226089,0.06796338,0.0008422622,0.9221442,0.0063104937,0.000017876031],"about_ca_topic_score_codex":0.0020537886,"about_ca_topic_score_gemma":0.002665561,"teacher_disagreement_score":0.009944687,"about_ca_system_score_codex":0.0009853729,"about_ca_system_score_gemma":0.00039265346,"threshold_uncertainty_score":0.033268273},"labels":[],"label_agreement":null},{"id":"W2394610828","doi":"","title":"Spanning trees in subcubic graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Spanning tree; Discrete mathematics","score_opus":0.010568636526596462,"score_gpt":0.22141706556908922,"score_spread":0.21084842904249276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394610828","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46437755,0.00458724,0.27759755,0.0022612081,0.0004454751,0.00017872392,0.0016055895,0.00089683017,0.2480499],"genre_scores_gemma":[0.9002715,0.0029366321,0.04197466,0.000659676,0.00025143079,0.00014491123,0.0016179397,0.00018343284,0.051959846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999708,0.00007932511,0.000018060027,0.000052040938,0.00007918075,0.00006332243],"domain_scores_gemma":[0.998953,0.00046742684,0.00014321515,0.00013359029,0.00016425211,0.00013846777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025375254,0.0002529219,0.00037044822,0.0013525706,0.0008976198,0.0013502936,0.00048329664,0.00055451295,0.008268583],"category_scores_gemma":[0.0018973508,0.0002405612,0.00024968537,0.001649308,0.0005892574,0.0020091503,0.00082875765,0.00085537886,0.0013183276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044103657,0.000030574014,0.0007805469,0.00013847194,0.0000205284,0.00032300668,0.00031335285,0.0057294425,0.0023668213,0.9245587,0.010191914,0.055502526],"study_design_scores_gemma":[0.000009345756,0.000016899206,0.0008039576,0.000041767504,0.000020036328,0.00051133614,0.00027475948,0.021090345,0.0010146546,0.95418775,0.022021497,0.0000075988573],"about_ca_topic_score_codex":0.00112145,"about_ca_topic_score_gemma":0.002481435,"teacher_disagreement_score":0.008268583,"about_ca_system_score_codex":0.0005637965,"about_ca_system_score_gemma":0.00039682252,"threshold_uncertainty_score":0.027661204},"labels":[],"label_agreement":null},{"id":"W2394631425","doi":"","title":"Spanning trees whose stems have at most k leaves.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spanning tree; Horticulture; Combinatorics; Biology","score_opus":0.018599383170885917,"score_gpt":0.27352755899945186,"score_spread":0.2549281758285659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394631425","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5166692,0.0055957553,0.27008754,0.0035165292,0.0006268793,0.00038848314,0.014899762,0.003407588,0.18480818],"genre_scores_gemma":[0.80056995,0.0027767862,0.12695171,0.0010872199,0.0003537859,0.0002153598,0.013866062,0.00042046304,0.053758662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944526,0.00008682029,0.00007816998,0.00016206682,0.00008980361,0.00013782704],"domain_scores_gemma":[0.9974433,0.0010388319,0.00035140276,0.00050204864,0.00039221373,0.00027216188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033806404,0.0004884916,0.0007287116,0.00075810996,0.0014607065,0.0015177304,0.00096251006,0.0012092493,0.013100072],"category_scores_gemma":[0.003530707,0.0004795125,0.00060083694,0.0012339008,0.00053980417,0.0033846935,0.0016894893,0.0009273315,0.008987573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011117677,0.00059040525,0.01398908,0.0020550655,0.0003113569,0.0061937314,0.002318698,0.008024496,0.118561946,0.4767668,0.06385119,0.3062255],"study_design_scores_gemma":[0.000110666006,0.00022794433,0.009566158,0.0003909086,0.00023827972,0.01330893,0.0015196846,0.018736912,0.024129272,0.79123616,0.14043629,0.00009869514],"about_ca_topic_score_codex":0.00039947047,"about_ca_topic_score_gemma":0.0008580543,"teacher_disagreement_score":0.013100072,"about_ca_system_score_codex":0.00033134213,"about_ca_system_score_gemma":0.00038950544,"threshold_uncertainty_score":0.043824077},"labels":[],"label_agreement":null},{"id":"W2394642992","doi":"","title":"Unimodality of sequences associated to Pell numbers.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Unimodality; Mathematics; Combinatorics","score_opus":0.07226555500136286,"score_gpt":0.32351176439466467,"score_spread":0.2512462093933018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394642992","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2629717,0.0038105466,0.35068664,0.003755158,0.0009900627,0.00011133006,0.0011408584,0.0007338394,0.3757998],"genre_scores_gemma":[0.91225165,0.0017041013,0.03229866,0.0005745123,0.00076676364,0.00011695836,0.0005769559,0.00021632203,0.05149399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991296,0.0002142487,0.000049709888,0.00018570473,0.00025113104,0.00016972827],"domain_scores_gemma":[0.9974764,0.0011838248,0.00033121,0.00021127086,0.00046496373,0.00033242867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007337994,0.0005959612,0.00047855813,0.0034331684,0.0013627082,0.0039225644,0.0007296396,0.00081415795,0.017787812],"category_scores_gemma":[0.006707672,0.00039362418,0.0005118884,0.0016156181,0.0030104592,0.0060461033,0.00222101,0.002538898,0.0028936602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011461997,0.0000045216952,0.000096963966,0.000017184782,0.0000026538814,0.000023074823,0.00008430484,0.00017206308,0.00040745898,0.99455404,0.0007850753,0.0038412258],"study_design_scores_gemma":[0.00000336819,0.0000056198014,0.00014782201,0.000010059778,0.0000035239732,0.00008297006,0.0000483019,0.0013890825,0.0005239733,0.9943666,0.003410974,0.0000077555405],"about_ca_topic_score_codex":0.0008872721,"about_ca_topic_score_gemma":0.00077673694,"teacher_disagreement_score":0.017787812,"about_ca_system_score_codex":0.0014628571,"about_ca_system_score_gemma":0.0007120737,"threshold_uncertainty_score":0.059506178},"labels":[],"label_agreement":null},{"id":"W2394646298","doi":"","title":"Trees with the fourth largest number of maximal independent sets.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Tree (set theory)","score_opus":0.01201799064296281,"score_gpt":0.26269455306046785,"score_spread":0.250676562417505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394646298","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51544785,0.0031009724,0.2586301,0.0071223364,0.0008870558,0.00028860898,0.015101025,0.0025476308,0.19687438],"genre_scores_gemma":[0.84046245,0.0010285433,0.109976,0.0008838898,0.00046779646,0.00028384977,0.00661939,0.0004899781,0.039788138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991248,0.00019121538,0.000054715565,0.00017757625,0.00021291476,0.00023881554],"domain_scores_gemma":[0.99170285,0.0044842362,0.0009373644,0.0013724348,0.00077081675,0.00073230726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006946033,0.000557512,0.0010794953,0.0017969273,0.0020607274,0.0034875963,0.0015602398,0.0017868214,0.012801114],"category_scores_gemma":[0.008689505,0.0008533498,0.0010276464,0.0018263847,0.0014138152,0.0034918196,0.0017934607,0.0021001177,0.003331347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067522994,0.00017097604,0.0050956276,0.0004819486,0.00015568585,0.0012165254,0.0005102754,0.008471434,0.017753556,0.8601826,0.048061572,0.057224587],"study_design_scores_gemma":[0.000096794596,0.000051451705,0.002457267,0.00009542643,0.000142951,0.0017036158,0.00021142185,0.014926473,0.008730086,0.93665385,0.03489126,0.00003936611],"about_ca_topic_score_codex":0.0008555525,"about_ca_topic_score_gemma":0.0018677536,"teacher_disagreement_score":0.012801114,"about_ca_system_score_codex":0.0013027311,"about_ca_system_score_gemma":0.0013176923,"threshold_uncertainty_score":0.04282397},"labels":[],"label_agreement":null},{"id":"W2394677122","doi":"","title":"A new lower bound on critical graphs with maximum degree of 8 and 9.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Combinatorics; Upper and lower bounds; Mathematical analysis; Physics","score_opus":0.030099684101645117,"score_gpt":0.23942797927939116,"score_spread":0.20932829517774604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394677122","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09501296,0.024017483,0.51829207,0.012996057,0.0048348173,0.0004931356,0.0057970933,0.004249473,0.33430696],"genre_scores_gemma":[0.602207,0.012934315,0.2812591,0.0068518342,0.0069801346,0.0012016076,0.008949901,0.0035156799,0.07610045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99721366,0.00036285413,0.00011966778,0.0005999262,0.0009959072,0.0007079282],"domain_scores_gemma":[0.9854033,0.008995463,0.0008646481,0.0017248096,0.00155746,0.0014543321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025535382,0.0031171665,0.0020096572,0.0065412167,0.0029636503,0.006395743,0.005556134,0.0031556617,0.030821126],"category_scores_gemma":[0.017297324,0.001315706,0.0017930553,0.0043804753,0.00249501,0.012252961,0.005013547,0.0074123438,0.007452237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010672713,0.000543381,0.0029621269,0.0017100172,0.00023270401,0.0007556749,0.00060072786,0.035270434,0.01854214,0.6631059,0.14981286,0.12539673],"study_design_scores_gemma":[0.00012531278,0.00024065345,0.0018018361,0.00052443397,0.00023768216,0.0010846588,0.00023695861,0.10238591,0.008811076,0.81179625,0.07262451,0.0001307588],"about_ca_topic_score_codex":0.0015799167,"about_ca_topic_score_gemma":0.0034443815,"teacher_disagreement_score":0.030821126,"about_ca_system_score_codex":0.0042413115,"about_ca_system_score_gemma":0.0018812509,"threshold_uncertainty_score":0.103106916},"labels":[],"label_agreement":null},{"id":"W2394688611","doi":"","title":"Cube factorizations of complete multipartite graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Multipartite; Mathematics; Cube (algebra); Combinatorics; Discrete mathematics; Physics; Quantum mechanics","score_opus":0.025143166779268332,"score_gpt":0.19915297908471014,"score_spread":0.1740098123054418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394688611","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24253476,0.0021854849,0.50992507,0.0021237119,0.0005801732,0.00022622703,0.0027385468,0.0008061793,0.23887986],"genre_scores_gemma":[0.8398796,0.001293831,0.0980435,0.0006658849,0.00032236116,0.00021862256,0.0023224885,0.00031883596,0.056935005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937457,0.00016145098,0.000024308732,0.00011917098,0.0001708363,0.00014963749],"domain_scores_gemma":[0.99834096,0.000626553,0.00021476627,0.0003083893,0.00027828733,0.00023096851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004324548,0.00046757047,0.0005767233,0.0013231334,0.0015541695,0.0024064516,0.0005932607,0.00079355476,0.018254174],"category_scores_gemma":[0.0024580504,0.0004546302,0.0007028131,0.0010896568,0.0011786693,0.003274061,0.0015611828,0.0014998856,0.002641051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055375374,0.000028746399,0.00025242957,0.00005950715,0.000014348212,0.000121655685,0.0001562373,0.0051637148,0.001691573,0.9734935,0.0079789385,0.01098397],"study_design_scores_gemma":[0.000011972212,0.000013176645,0.00023244479,0.000029846542,0.00000825072,0.00015543046,0.00013065833,0.01732115,0.00085628725,0.9711483,0.0100809075,0.0000115298035],"about_ca_topic_score_codex":0.0018550563,"about_ca_topic_score_gemma":0.0034233301,"teacher_disagreement_score":0.018254174,"about_ca_system_score_codex":0.0009621942,"about_ca_system_score_gemma":0.0006524841,"threshold_uncertainty_score":0.06106627},"labels":[],"label_agreement":null},{"id":"W2394703894","doi":"","title":"The Crossing Number of K 2, 4, n .","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Crossing number (knot theory); Combinatorics; Geography; Cartography; Intersection (aeronautics)","score_opus":0.02219473891717427,"score_gpt":0.2610429872999888,"score_spread":0.23884824838281454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394703894","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7497344,0.0010141113,0.039525717,0.0018371802,0.00077857834,0.00005665517,0.0012253615,0.00052596803,0.20530203],"genre_scores_gemma":[0.95916,0.00037497835,0.011094804,0.00024004931,0.00007866895,0.00004163697,0.0005937069,0.00017857911,0.02823763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961275,0.00006424733,0.000019021874,0.000089506466,0.00010450893,0.00010996756],"domain_scores_gemma":[0.9991252,0.00031455493,0.00017433692,0.00010689891,0.00010037483,0.0001785393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005003497,0.00039581262,0.0003260846,0.001762462,0.0014354672,0.0021075346,0.00069911993,0.0008158649,0.016622288],"category_scores_gemma":[0.002931995,0.00022480036,0.0002749342,0.00091329485,0.00136469,0.0017800065,0.0011464434,0.0010362797,0.002041284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005625505,0.00010029077,0.0050196014,0.00021475271,0.00004572864,0.000649967,0.0006059719,0.010637416,0.012915841,0.87935215,0.031710714,0.058185127],"study_design_scores_gemma":[0.000053705357,0.00009761784,0.007758178,0.0001410546,0.000052888718,0.0013974613,0.00074434903,0.040565573,0.012224438,0.88725317,0.049634065,0.000077567565],"about_ca_topic_score_codex":0.0010472394,"about_ca_topic_score_gemma":0.0017899086,"teacher_disagreement_score":0.016622288,"about_ca_system_score_codex":0.0009401812,"about_ca_system_score_gemma":0.00051313534,"threshold_uncertainty_score":0.05560702},"labels":[],"label_agreement":null},{"id":"W2394711279","doi":"","title":"The t-Pebbling Conjecture on Products of Complete r-Partite Graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Discrete mathematics","score_opus":0.0442046350333334,"score_gpt":0.2703736874322913,"score_spread":0.2261690523989579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394711279","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46005055,0.0025835773,0.2104766,0.011544928,0.0011389665,0.00015610368,0.002325145,0.0013185721,0.3104055],"genre_scores_gemma":[0.9248663,0.001608601,0.02809827,0.0017636572,0.00060397945,0.00012900049,0.0022302247,0.000370584,0.040329322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998754,0.00029573307,0.000065013955,0.000320638,0.0002686783,0.00029583773],"domain_scores_gemma":[0.9917143,0.0043072123,0.00063507876,0.0017893338,0.000829309,0.00072475895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001368377,0.000626739,0.0010737558,0.0008559553,0.0029296416,0.004569674,0.001373747,0.0022832225,0.021032888],"category_scores_gemma":[0.010265094,0.001032931,0.0014693331,0.001629848,0.003096738,0.010283485,0.0026788688,0.0034582908,0.0045903674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020699766,0.00006915433,0.0009865065,0.00018452131,0.000030840783,0.00029713378,0.00039942065,0.004372427,0.0012092222,0.9624672,0.017918248,0.011858264],"study_design_scores_gemma":[0.0000252371,0.000024616937,0.0002277182,0.00002737761,0.000015801184,0.00020153062,0.00013117325,0.004910619,0.0005922049,0.988378,0.005453741,0.0000120361865],"about_ca_topic_score_codex":0.0019493187,"about_ca_topic_score_gemma":0.002113519,"teacher_disagreement_score":0.021032888,"about_ca_system_score_codex":0.0009615024,"about_ca_system_score_gemma":0.00090949435,"threshold_uncertainty_score":0.07036203},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Categorical variable; Enhanced Data Rates for GSM Evolution; Product (mathematics); Statistics; Geometry; Artificial intelligence; Computer science","score_opus":0.010530644588636907,"score_gpt":0.22939063971975704,"score_spread":0.21885999513112014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394717430","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8054592,0.0004145588,0.111820646,0.0014887493,0.00022550397,0.000056972734,0.0006709208,0.00041094064,0.07945236],"genre_scores_gemma":[0.9767833,0.0001310935,0.014846911,0.00018173024,0.000097199285,0.000040501418,0.00033184502,0.000116586314,0.0074707805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835014,0.00044539524,0.00010338338,0.00041763234,0.00038866446,0.00029473973],"domain_scores_gemma":[0.9910233,0.004467828,0.0011149654,0.0011778156,0.0009504282,0.001265665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001645564,0.00041468223,0.0008667045,0.0023878384,0.0024535835,0.0039070235,0.0014303876,0.0013066952,0.010726395],"category_scores_gemma":[0.0073146825,0.00065022195,0.00080775644,0.0016800002,0.003030914,0.0064232345,0.0029588577,0.0023684956,0.00092397653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013006682,0.000039305276,0.0015742424,0.0000618656,0.000018749413,0.00013644581,0.00025758118,0.0014556191,0.0017141654,0.9868859,0.001415218,0.0063108183],"study_design_scores_gemma":[0.000023951063,0.00003606896,0.0009429102,0.000027861091,0.000037097547,0.00032129834,0.00029550228,0.009513026,0.001726308,0.98304784,0.0040006805,0.000027354798],"about_ca_topic_score_codex":0.00091036304,"about_ca_topic_score_gemma":0.00095182535,"teacher_disagreement_score":0.010726395,"about_ca_system_score_codex":0.0012671382,"about_ca_system_score_gemma":0.0005245441,"threshold_uncertainty_score":0.035883367},"labels":[],"label_agreement":null},{"id":"W2394743037","doi":"","title":"Schultz and Zagreb indices in corona of two graphs","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Corona (planetary geology); Combinatorics; Physics; Astrobiology","score_opus":0.019386026211507246,"score_gpt":0.28585721840116823,"score_spread":0.266471192189661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394743037","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84644604,0.0009731682,0.03549755,0.0015030049,0.0003406762,0.00006373017,0.00040956849,0.0002107076,0.11455552],"genre_scores_gemma":[0.97461843,0.00044695233,0.0108142,0.00024695485,0.00022551509,0.000065687236,0.00034256832,0.00010312945,0.013136516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993388,0.0001616077,0.00003883515,0.00015269603,0.00012418814,0.00018384629],"domain_scores_gemma":[0.9985543,0.00048070378,0.00029661274,0.0001336287,0.0001997309,0.00033493384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009058106,0.00064865476,0.0013854766,0.0033748255,0.0029809307,0.005039187,0.0013123875,0.0016265088,0.0075980304],"category_scores_gemma":[0.0033309022,0.0005571375,0.0009173904,0.0022355365,0.0033883417,0.0051726927,0.0023495227,0.0020654977,0.00081860216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045480887,0.000015992524,0.00059557974,0.00002381734,0.0000073247743,0.00007966964,0.0004140908,0.0003374997,0.00050628383,0.995191,0.0006046929,0.0021785945],"study_design_scores_gemma":[0.00002374514,0.0000141200635,0.000863869,0.000023100427,0.00002405723,0.00013591902,0.00028801095,0.0026292286,0.00029112847,0.992159,0.0035338595,0.000014031589],"about_ca_topic_score_codex":0.002638958,"about_ca_topic_score_gemma":0.0028291526,"teacher_disagreement_score":0.0075980304,"about_ca_system_score_codex":0.002223611,"about_ca_system_score_gemma":0.00082210434,"threshold_uncertainty_score":0.025417984},"labels":[],"label_agreement":null},{"id":"W2394748596","doi":"","title":"Directed Hamilton cycle decompositions of the tensor product of symmetric digraphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Tensor product; Tensor product of Hilbert spaces; Combinatorics; Product (mathematics); Symmetric tensor; Tensor (intrinsic definition); Pure mathematics; Tensor contraction; Mathematical analysis; Geometry; Exact solutions in general relativity","score_opus":0.008798207608283664,"score_gpt":0.18263707831808992,"score_spread":0.17383887070980625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394748596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32300824,0.0019370974,0.46596053,0.0009662537,0.0003384493,0.00032983255,0.0038097596,0.000642816,0.2030071],"genre_scores_gemma":[0.8625559,0.00097208977,0.07431786,0.00027750037,0.00013646488,0.00019403156,0.0024681864,0.00018510224,0.05889282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997062,0.00007079741,0.00001882951,0.000060176335,0.00007209902,0.00007185041],"domain_scores_gemma":[0.99924505,0.00020686322,0.00013786738,0.00008863885,0.00018474735,0.00013691769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029588176,0.00047161404,0.00035828634,0.0018080239,0.00072974525,0.0014385688,0.0005366694,0.00045568298,0.013051215],"category_scores_gemma":[0.0012185937,0.00032677612,0.0004442419,0.0010353038,0.0006594581,0.0015430995,0.0006226989,0.00075169164,0.0012783568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041568837,0.000026589547,0.00026586617,0.000062708015,0.000013232722,0.000095864474,0.00012750171,0.0035631002,0.0017400515,0.97728217,0.0036814502,0.013099921],"study_design_scores_gemma":[0.000018298408,0.00002083849,0.00044757623,0.00003102617,0.00001925008,0.00014663365,0.000118844306,0.031814072,0.0010014917,0.95487183,0.01149495,0.00001518343],"about_ca_topic_score_codex":0.0026657423,"about_ca_topic_score_gemma":0.004631395,"teacher_disagreement_score":0.013051215,"about_ca_system_score_codex":0.001077845,"about_ca_system_score_gemma":0.0006841257,"threshold_uncertainty_score":0.04366064},"labels":[],"label_agreement":null},{"id":"W2394748621","doi":"","title":"Domination by Union of Complete Graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dominating set; Combinatorics; Vertex (graph theory); Graph; Induced subgraph; Discrete mathematics; Property (philosophy); Domination analysis; Set (abstract data type); Computer science","score_opus":0.011810092131149724,"score_gpt":0.2674976246667467,"score_spread":0.25568753253559695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394748621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4115205,0.0024274953,0.49844566,0.00058029976,0.00013161078,0.00022882862,0.00197398,0.00089662854,0.08379496],"genre_scores_gemma":[0.88946176,0.00093485543,0.08775449,0.00024143256,0.0001570079,0.0002743659,0.0029935509,0.0003265511,0.017855994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807453,0.0004975554,0.00010222342,0.00061598833,0.00047009366,0.00023955987],"domain_scores_gemma":[0.9917008,0.005226822,0.00091883086,0.00075665524,0.0006087662,0.00078813935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015175563,0.00047633468,0.0007007572,0.0014812232,0.0014426261,0.0018665201,0.00095853885,0.00051729294,0.0058239424],"category_scores_gemma":[0.007535581,0.00060245255,0.00094674545,0.0011954681,0.0017392815,0.0035697508,0.0019580603,0.00094153255,0.0005533646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000990062,0.0001275803,0.0059767775,0.00063953426,0.00020457756,0.0012347152,0.0016055082,0.03366084,0.02200653,0.83353114,0.00854377,0.09147897],"study_design_scores_gemma":[0.000111379064,0.0001701963,0.0036819472,0.00010311948,0.00013089526,0.0030389598,0.00045083577,0.09822663,0.01648674,0.8324171,0.045120683,0.000061568164],"about_ca_topic_score_codex":0.0010239737,"about_ca_topic_score_gemma":0.0011795082,"teacher_disagreement_score":0.0058239424,"about_ca_system_score_codex":0.000829896,"about_ca_system_score_gemma":0.00045884596,"threshold_uncertainty_score":0.01948303},"labels":[],"label_agreement":null},{"id":"W2394753218","doi":"","title":"Sums and products of the Jacobsthal and Jacobsthal-Lucas numbers and their determinantal representation.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Representation (politics); Mathematics; Lucas number; Combinatorics; Fibonacci number","score_opus":0.007934101605347462,"score_gpt":0.23737992236199157,"score_spread":0.2294458207566441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394753218","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37979743,0.008443632,0.13546313,0.003351743,0.0016585364,0.000069419075,0.00080871274,0.0003806277,0.4700267],"genre_scores_gemma":[0.9145719,0.0018889228,0.0228591,0.00048518254,0.0010793742,0.00006851112,0.00036615712,0.00018263535,0.05849822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994128,0.00013417538,0.0000370018,0.000098177545,0.00021140178,0.00010648812],"domain_scores_gemma":[0.99903893,0.00029337744,0.00016136687,0.000107242246,0.0002243954,0.00017469566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065142126,0.0006062849,0.0005520444,0.0029651073,0.0014152789,0.003434224,0.00084730895,0.0006099522,0.009417397],"category_scores_gemma":[0.003253784,0.00038604758,0.00054705807,0.001487324,0.0029458362,0.003919088,0.0019936515,0.0016909819,0.001998889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013252511,0.000008460272,0.00010452198,0.000013952022,0.0000029147045,0.0000318581,0.0001178881,0.00017387756,0.00031922717,0.9936931,0.0012535834,0.0042675114],"study_design_scores_gemma":[0.0000052803402,0.000011546122,0.0002797439,0.000011978562,0.0000048542306,0.00014253406,0.00007415536,0.0017004971,0.0003012121,0.9910347,0.0064223385,0.000011224361],"about_ca_topic_score_codex":0.0008949451,"about_ca_topic_score_gemma":0.0013881241,"teacher_disagreement_score":0.009417397,"about_ca_system_score_codex":0.0008516508,"about_ca_system_score_gemma":0.0006393596,"threshold_uncertainty_score":0.031504273},"labels":[],"label_agreement":null},{"id":"W2394758262","doi":"","title":"Extremal Wiener-Hosoya Index Of Acyclic Graphs With Short Diameter.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Wiener index; Combinatorics; Index (typography); Statistics; Graph; Computer science","score_opus":0.021298899970551743,"score_gpt":0.2618156374354236,"score_spread":0.24051673746487184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394758262","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8123218,0.0030461657,0.07808357,0.0012087823,0.0003287571,0.00003208763,0.0009851132,0.0003668948,0.103626885],"genre_scores_gemma":[0.9839215,0.00070446124,0.007703776,0.00011054415,0.00023279502,0.000033459608,0.0003076768,0.00008032323,0.0069053834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965227,0.000076633194,0.000017946035,0.00007233301,0.000087576795,0.000093211325],"domain_scores_gemma":[0.9975827,0.0011671372,0.0003887353,0.00018473344,0.00020764217,0.00046901137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062148285,0.0003579685,0.0007079098,0.0027557085,0.0011710358,0.0021231086,0.0009020048,0.00095635443,0.005834584],"category_scores_gemma":[0.004995622,0.00030271237,0.00031067804,0.0012986636,0.00134116,0.0036404084,0.0013139979,0.0010122147,0.0007017784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000114221344,0.000021033731,0.0011783763,0.000067980516,0.000013517908,0.00010118312,0.00019909977,0.002646032,0.0021578814,0.9817168,0.0029534725,0.008830333],"study_design_scores_gemma":[0.000015703274,0.000021959384,0.0015526635,0.000028526765,0.000017909812,0.0002324279,0.00015397675,0.018638182,0.0010164521,0.97456145,0.0037411642,0.000019534136],"about_ca_topic_score_codex":0.0006983598,"about_ca_topic_score_gemma":0.001091148,"teacher_disagreement_score":0.005834584,"about_ca_system_score_codex":0.0010752713,"about_ca_system_score_gemma":0.00034309126,"threshold_uncertainty_score":0.019518614},"labels":[],"label_agreement":null},{"id":"W2394771716","doi":"","title":"Distance two labelings of Cartesian products of complete graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cartesian product; Combinatorics; Discrete mathematics","score_opus":0.017017796823218065,"score_gpt":0.23480431987230163,"score_spread":0.21778652304908358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394771716","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53196365,0.0018498361,0.33181995,0.0030895148,0.0004086446,0.00012362012,0.0026200674,0.00067781634,0.12744685],"genre_scores_gemma":[0.8545773,0.0006198281,0.11382645,0.0004647968,0.00017010992,0.00011963113,0.002121103,0.00025583862,0.0278449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824715,0.0006120278,0.00013054756,0.00045938435,0.00032413172,0.00022674658],"domain_scores_gemma":[0.9919565,0.0046772836,0.0008246362,0.0010416742,0.0006499967,0.0008498934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013397544,0.00045697755,0.0006355182,0.0017966776,0.0018289037,0.004107393,0.0011281676,0.0013027088,0.010448339],"category_scores_gemma":[0.007765803,0.00075396977,0.00082979194,0.001986992,0.0025940249,0.0062003164,0.0028320167,0.002346749,0.0012517298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015761412,0.0000410858,0.0010117735,0.00008460197,0.000015462641,0.00006801571,0.00048543428,0.0013934858,0.0010481033,0.9758518,0.004384455,0.015458211],"study_design_scores_gemma":[0.000035367404,0.000035648023,0.00088865915,0.000053443433,0.000027570102,0.00027389967,0.00044588684,0.0073450753,0.0017183765,0.9733968,0.015755007,0.000024337118],"about_ca_topic_score_codex":0.0012555819,"about_ca_topic_score_gemma":0.0018404311,"teacher_disagreement_score":0.010448339,"about_ca_system_score_codex":0.0016339646,"about_ca_system_score_gemma":0.0006945921,"threshold_uncertainty_score":0.034953177},"labels":[],"label_agreement":null},{"id":"W2394775218","doi":"","title":"The Hamiltonian Numbers in Graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.037516865956538636,"score_gpt":0.29962870786811097,"score_spread":0.26211184191157233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394775218","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13366054,0.038073026,0.24541946,0.017402839,0.006927512,0.00010959207,0.0014277003,0.00069032656,0.55628896],"genre_scores_gemma":[0.85254437,0.012753185,0.04873286,0.0025009275,0.0042399233,0.00023043051,0.00059756817,0.00027314085,0.07812748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994598,0.0001960065,0.000026293344,0.000096569136,0.00015383685,0.00006751682],"domain_scores_gemma":[0.99854493,0.00074649806,0.00018752055,0.00016723339,0.00017714784,0.00017674419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066019036,0.0006898669,0.00060130644,0.003920562,0.0013036397,0.0026056687,0.0008315385,0.0012065473,0.011402181],"category_scores_gemma":[0.00457644,0.00044493526,0.00048625722,0.0021322994,0.0043370747,0.005972132,0.0017213877,0.002493476,0.0021202576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006224104,0.0000048342354,0.00007231495,0.00003727513,0.000003414003,0.000018401199,0.000093830306,0.00028272948,0.00017196704,0.98959327,0.0034619258,0.0062538367],"study_design_scores_gemma":[0.0000029748003,0.00000352257,0.00010899454,0.000014134358,0.000002634723,0.000042183754,0.000042220625,0.000749931,0.000082091494,0.9927429,0.006204101,0.000004315112],"about_ca_topic_score_codex":0.00087176304,"about_ca_topic_score_gemma":0.0012274313,"teacher_disagreement_score":0.011402181,"about_ca_system_score_codex":0.0011903554,"about_ca_system_score_gemma":0.00052266504,"threshold_uncertainty_score":0.03814411},"labels":[],"label_agreement":null},{"id":"W2394790471","doi":"","title":"An upper bound for total domination subdivision numbers.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Subdivision; Mathematics; Upper and lower bounds; Combinatorics; Geography; Mathematical analysis; Archaeology","score_opus":0.015582494609897855,"score_gpt":0.24706683429415507,"score_spread":0.23148433968425722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394790471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1036819,0.009236424,0.46351022,0.005836944,0.0013227075,0.00023876643,0.0027776693,0.0030729903,0.4103224],"genre_scores_gemma":[0.8069312,0.0048946906,0.11807007,0.0016272854,0.0010759579,0.0004927736,0.002631721,0.0010331445,0.063243255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99706984,0.00033753182,0.00011638185,0.0005039185,0.0012359094,0.00073643366],"domain_scores_gemma":[0.9881417,0.0072223726,0.00035253543,0.0023440432,0.0011999842,0.00073925883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026703493,0.0012207138,0.0012887672,0.003340901,0.0022312796,0.0055421144,0.0033868898,0.0014843097,0.022268225],"category_scores_gemma":[0.017460784,0.00062669633,0.0012141961,0.003732603,0.0029737528,0.008213724,0.00514448,0.004256072,0.005648375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038919598,0.000120265264,0.0019066148,0.000362802,0.00005926744,0.00011719766,0.00034648768,0.012097242,0.0061080167,0.8489347,0.026672745,0.102885485],"study_design_scores_gemma":[0.000042705928,0.00009127678,0.0012680874,0.00015351111,0.000108803884,0.00037712065,0.00011407531,0.041699905,0.006425965,0.897494,0.052180313,0.000044240085],"about_ca_topic_score_codex":0.0018460697,"about_ca_topic_score_gemma":0.0039794324,"teacher_disagreement_score":0.022268225,"about_ca_system_score_codex":0.0033600482,"about_ca_system_score_gemma":0.0016763094,"threshold_uncertainty_score":0.07449466},"labels":[],"label_agreement":null},{"id":"W2394816319","doi":"","title":"A class of minimally spectrally arbitrary sign patterns.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Sign (mathematics); Mathematics; Class (philosophy); Mathematical analysis; Artificial intelligence; Computer science","score_opus":0.011778897046882205,"score_gpt":0.22998445729959902,"score_spread":0.2182055602527168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394816319","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5156971,0.00092208246,0.17893766,0.0015666562,0.0007210526,0.00017197723,0.0016517703,0.0014647926,0.29886693],"genre_scores_gemma":[0.945248,0.00029907707,0.023767782,0.00047829858,0.00014142971,0.0001459072,0.00091702054,0.0001433416,0.028859241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995555,0.000074730204,0.000036090223,0.00011397983,0.000114263246,0.000105372805],"domain_scores_gemma":[0.99908686,0.00022139045,0.00014811322,0.00021773642,0.00018818554,0.00013766479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023560059,0.00040733695,0.00044099282,0.001086691,0.0011665779,0.0026259518,0.0006381852,0.00094472023,0.011132785],"category_scores_gemma":[0.0023581167,0.00026719124,0.00047738833,0.0007593535,0.001316544,0.0014727841,0.0012558588,0.00096000935,0.0021848308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009035149,0.000041269228,0.00094290334,0.000067090274,0.000010756404,0.00031040458,0.00015592886,0.00088479347,0.0064112293,0.9640458,0.0041932445,0.02284618],"study_design_scores_gemma":[0.00006027008,0.00004981378,0.0011241371,0.00004467928,0.000015667876,0.0013818179,0.00026494593,0.012778368,0.0037981463,0.9568184,0.023628652,0.00003499807],"about_ca_topic_score_codex":0.00047337168,"about_ca_topic_score_gemma":0.0006931921,"teacher_disagreement_score":0.011132785,"about_ca_system_score_codex":0.0004531516,"about_ca_system_score_gemma":0.00048884354,"threshold_uncertainty_score":0.03724283},"labels":[],"label_agreement":null},{"id":"W2394825792","doi":"","title":"4-regular bipartite matching extendable graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Matching (statistics); Combinatorics; Graph; Statistics","score_opus":0.012611972059304899,"score_gpt":0.25981203563062877,"score_spread":0.24720006357132387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394825792","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3649756,0.00092786853,0.28889245,0.0021229766,0.00042559157,0.0003438548,0.005302741,0.0027763837,0.33423254],"genre_scores_gemma":[0.827397,0.0007360392,0.07822893,0.000731089,0.00019090303,0.00020095306,0.005001884,0.0003727807,0.08714052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932826,0.00012655782,0.000043264736,0.00020089994,0.00014217789,0.00015890917],"domain_scores_gemma":[0.9984724,0.00045679722,0.0002618207,0.000377033,0.00017296828,0.00025895235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005188316,0.00054473145,0.00061173143,0.0010038405,0.0010160839,0.0014062311,0.0014119617,0.00091457664,0.025824687],"category_scores_gemma":[0.0025209542,0.000346163,0.0007495718,0.001329534,0.0008153232,0.003057539,0.0020222417,0.0015231124,0.004305089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053964736,0.00025265256,0.002192041,0.00039997464,0.00008680751,0.0011133838,0.0005245178,0.005180311,0.014182956,0.8698255,0.018106515,0.08759572],"study_design_scores_gemma":[0.00006184621,0.000064966254,0.0019061404,0.00007358103,0.00010084044,0.00087641657,0.00027199177,0.011112662,0.006005249,0.92076105,0.05873436,0.000030934152],"about_ca_topic_score_codex":0.0009054211,"about_ca_topic_score_gemma":0.0015423637,"teacher_disagreement_score":0.025824687,"about_ca_system_score_codex":0.00061438465,"about_ca_system_score_gemma":0.00046387973,"threshold_uncertainty_score":0.086392224},"labels":[],"label_agreement":null},{"id":"W2394827867","doi":"","title":"Banana Trees And Union Of Stars Are Integral Sum Graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Banana Cultivation and Research","field":"Agricultural and Biological Sciences","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Stars; Combinatorics; Astrophysics; Physics","score_opus":0.04036975866423101,"score_gpt":0.23564897708529958,"score_spread":0.19527921842106857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394827867","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42094648,0.0028944775,0.18104193,0.0023928063,0.00062100345,0.00011035419,0.0010466679,0.0007978555,0.39014837],"genre_scores_gemma":[0.86248666,0.0019467274,0.04549062,0.00059759076,0.00032130914,0.00007379828,0.0015317199,0.00022010338,0.08733145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944896,0.00011132773,0.0000332836,0.0001596236,0.00014603627,0.00010074028],"domain_scores_gemma":[0.99874336,0.00053312903,0.00019097293,0.00013268624,0.00019725184,0.00020260409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034620886,0.0003940041,0.0005348017,0.0015474056,0.002313062,0.0028141285,0.00096280215,0.0008736586,0.013253256],"category_scores_gemma":[0.0015828226,0.0005428417,0.0007831738,0.0016681643,0.0016226711,0.0049952166,0.0022461324,0.0017108023,0.0018062562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012874043,0.000045494664,0.0009841928,0.00014576991,0.000023765442,0.0002696726,0.00038625498,0.0010556623,0.0038950169,0.96088374,0.004052048,0.028129736],"study_design_scores_gemma":[0.000012631073,0.000020490215,0.001327571,0.00003742856,0.00004503578,0.00095850154,0.00036456482,0.0047501475,0.0028693175,0.96330583,0.026291685,0.000016808192],"about_ca_topic_score_codex":0.0011805935,"about_ca_topic_score_gemma":0.00210771,"teacher_disagreement_score":0.013253256,"about_ca_system_score_codex":0.000671417,"about_ca_system_score_gemma":0.00041986536,"threshold_uncertainty_score":0.044336498},"labels":[],"label_agreement":null},{"id":"W2394851076","doi":"","title":"E 3 -cordiality os some helm-related graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.020933417012222857,"score_gpt":0.23734712840693847,"score_spread":0.2164137113947156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394851076","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64402777,0.00086414354,0.074009806,0.0040830798,0.00040488713,0.000118468815,0.0019335299,0.00069928274,0.273859],"genre_scores_gemma":[0.92188513,0.0004092539,0.023854014,0.00091430004,0.00015581092,0.000074894124,0.0011447485,0.00016836674,0.0513935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995863,0.00009198647,0.000018881987,0.00011113669,0.00006370174,0.0001280353],"domain_scores_gemma":[0.99845636,0.00063538924,0.00024152009,0.00024474767,0.00017014757,0.00025183955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038440895,0.00047253293,0.00040857558,0.0014134935,0.0024708665,0.0018115685,0.0008948232,0.0010896132,0.020130293],"category_scores_gemma":[0.002195419,0.0003043233,0.0005177921,0.001226438,0.0014747566,0.0027556536,0.0018342145,0.0016936677,0.0019488259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014585082,0.00007023941,0.0017130732,0.00012598753,0.000019864983,0.0002807661,0.00041205765,0.0015886443,0.0031327505,0.9615398,0.010519301,0.020451725],"study_design_scores_gemma":[0.00002957953,0.000023793491,0.0015395476,0.00003799637,0.000026498792,0.00042951756,0.00046198958,0.0062669753,0.003008574,0.9662861,0.021870015,0.000019275725],"about_ca_topic_score_codex":0.0019412164,"about_ca_topic_score_gemma":0.0030450022,"teacher_disagreement_score":0.020130293,"about_ca_system_score_codex":0.0013695922,"about_ca_system_score_gemma":0.0004869623,"threshold_uncertainty_score":0.06734258},"labels":[],"label_agreement":null},{"id":"W2394857480","doi":"","title":"Edge-magic and Vertex-magic Total Labelings of Certain Cycles.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"MAGIC (telescope); Mathematics; Vertex (graph theory); Combinatorics; Enhanced Data Rates for GSM Evolution; Astronomy; Artificial intelligence; Physics; Computer science; Graph","score_opus":0.008514106933542641,"score_gpt":0.22291343160608967,"score_spread":0.21439932467254702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394857480","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6266563,0.0017001053,0.15421672,0.00260344,0.00022127184,0.00012069314,0.0039501702,0.0005299644,0.2100014],"genre_scores_gemma":[0.9245804,0.0007517712,0.044708267,0.0004153796,0.00015687912,0.0001309281,0.0024784664,0.00015936724,0.026618581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993656,0.000176546,0.00004296504,0.00014294336,0.00013517906,0.0001366394],"domain_scores_gemma":[0.99667466,0.0016795977,0.00046339104,0.0004588197,0.00035705662,0.00036648914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065291394,0.00041249758,0.0004507102,0.0015425899,0.0015701954,0.0026172788,0.0010117298,0.00082999526,0.01084565],"category_scores_gemma":[0.004388137,0.00046749756,0.0006472921,0.0018756426,0.0016381338,0.0037245331,0.0014727203,0.0012099307,0.00078673166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009745425,0.00002152853,0.00069563946,0.00007929778,0.000013544881,0.000050073093,0.00017937558,0.0023089543,0.00094065,0.9794679,0.0048284507,0.011317145],"study_design_scores_gemma":[0.00003276394,0.000017081233,0.00070561975,0.000031268344,0.000024553641,0.00018580492,0.00020019613,0.009941458,0.0011409611,0.97835976,0.009345077,0.000015602513],"about_ca_topic_score_codex":0.0020192743,"about_ca_topic_score_gemma":0.0030801878,"teacher_disagreement_score":0.01084565,"about_ca_system_score_codex":0.0013230515,"about_ca_system_score_gemma":0.0007699244,"threshold_uncertainty_score":0.03628236},"labels":[],"label_agreement":null},{"id":"W2394877446","doi":"","title":"On the Disarrangements with k Cycles.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.005115654826447854,"score_gpt":0.1832766747649926,"score_spread":0.17816101993854475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394877446","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33818442,0.0057186666,0.25688896,0.0135247605,0.0018750007,0.00022024947,0.001204431,0.00064122875,0.38174236],"genre_scores_gemma":[0.89089274,0.0025501507,0.03431995,0.0014618582,0.0007699294,0.00019856758,0.0006937233,0.00034821074,0.06876481],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831724,0.0005665287,0.00007867374,0.0003443683,0.00031054762,0.0003827849],"domain_scores_gemma":[0.99240017,0.0038440025,0.0007745553,0.0015222011,0.0007269529,0.00073213025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012617175,0.0006385938,0.0007283523,0.0022107225,0.004180507,0.0035147169,0.0015873157,0.0019812568,0.019612737],"category_scores_gemma":[0.014594911,0.00064180803,0.0008406682,0.0019364597,0.004695434,0.008952074,0.004323368,0.0037284405,0.0025137616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011675908,0.000029206338,0.0005620547,0.000074917036,0.000014663589,0.00025595335,0.0004808678,0.003160914,0.00050810934,0.9701184,0.008017609,0.016660525],"study_design_scores_gemma":[0.000011909029,0.000017206306,0.00028505723,0.000039872622,0.000012883831,0.00025856085,0.00030118183,0.007379575,0.00044106005,0.9799733,0.011263868,0.000015524098],"about_ca_topic_score_codex":0.0026743996,"about_ca_topic_score_gemma":0.0029691546,"teacher_disagreement_score":0.019612737,"about_ca_system_score_codex":0.0013572947,"about_ca_system_score_gemma":0.0009108945,"threshold_uncertainty_score":0.065611124},"labels":[],"label_agreement":null},{"id":"W2394920966","doi":"","title":"Enumeration of Labelled Essential Graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Enumeration; Mathematics; Combinatorics","score_opus":0.009554101312663859,"score_gpt":0.2594430963491188,"score_spread":0.24988899503645493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394920966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0913106,0.0012205715,0.6295584,0.002126871,0.00045969442,0.00022814391,0.004266716,0.0015606054,0.26926842],"genre_scores_gemma":[0.5867601,0.0013076002,0.29283497,0.0009532647,0.00020716092,0.00031933896,0.009678221,0.0009063029,0.10703299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900013,0.00033257058,0.00007285485,0.00016368316,0.00027348503,0.00015735012],"domain_scores_gemma":[0.9965933,0.0017681519,0.00020741073,0.000597141,0.00058170606,0.00025231807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000672192,0.0005248251,0.00054872397,0.0015479752,0.0015758092,0.0021723362,0.0013203884,0.0011128283,0.018311122],"category_scores_gemma":[0.0042573027,0.00049329246,0.0008659525,0.0019246286,0.0011195862,0.0040537296,0.0023701717,0.0020066001,0.0038779539],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009261565,0.00005610287,0.0005551769,0.0002195161,0.000016729433,0.00016625362,0.0003174303,0.0013705189,0.0031420132,0.9449244,0.010923573,0.038215674],"study_design_scores_gemma":[0.000011925844,0.000012135803,0.00030313685,0.00007610753,0.000017468092,0.00023246209,0.00013118348,0.0047462373,0.0021274374,0.9656929,0.02663817,0.000011001113],"about_ca_topic_score_codex":0.00088098686,"about_ca_topic_score_gemma":0.0024964083,"teacher_disagreement_score":0.018311122,"about_ca_system_score_codex":0.0010302818,"about_ca_system_score_gemma":0.0008330076,"threshold_uncertainty_score":0.061256766},"labels":[],"label_agreement":null},{"id":"W2394929640","doi":"","title":"A characterization of the lines external to a hyperbolic quadric in PG(3, q).","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Quadric; Mathematics; Characterization (materials science); Pure mathematics; Physics; Optics","score_opus":0.04598508196501959,"score_gpt":0.31839504422517745,"score_spread":0.27240996226015785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394929640","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65694994,0.0005199893,0.12418528,0.0013170742,0.00025174132,0.000110217814,0.000774319,0.00039474017,0.21549675],"genre_scores_gemma":[0.95761406,0.00020202587,0.010153754,0.00023463232,0.00022166227,0.000042636908,0.00067377934,0.00017358165,0.030683853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996866,0.00006581224,0.000014618449,0.000082974344,0.00008539313,0.000064539185],"domain_scores_gemma":[0.99922276,0.00014590021,0.00019796554,0.000085884574,0.000154992,0.00019248821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026048155,0.00051188475,0.00026073874,0.0016136457,0.0011377351,0.001954728,0.000609494,0.0006434384,0.012087567],"category_scores_gemma":[0.0010772953,0.00023652225,0.00029528548,0.00094118685,0.0021608132,0.0024427709,0.0014695654,0.0017169873,0.001955451],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010526527,0.00004514189,0.0020028765,0.00005424548,0.000009889281,0.00043227157,0.0007529282,0.0006823418,0.006031931,0.9715859,0.003820133,0.014476979],"study_design_scores_gemma":[0.000075833705,0.0001623258,0.005721898,0.000084673185,0.000030472347,0.0014937955,0.0014562245,0.008571383,0.005945445,0.9159846,0.06043046,0.00004290304],"about_ca_topic_score_codex":0.00059554895,"about_ca_topic_score_gemma":0.0005244986,"teacher_disagreement_score":0.012087567,"about_ca_system_score_codex":0.0004938179,"about_ca_system_score_gemma":0.00020622044,"threshold_uncertainty_score":0.040436924},"labels":[],"label_agreement":null},{"id":"W2394955060","doi":"","title":"On the normalized Laplacian eigenvalues of graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Laplace operator; Pure mathematics; Combinatorics; Mathematical analysis; Physics; Quantum mechanics","score_opus":0.054764152892298634,"score_gpt":0.30030683028246385,"score_spread":0.24554267739016522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394955060","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29859278,0.012122623,0.3969498,0.008226581,0.0028913857,0.00007353893,0.0009557807,0.0009398318,0.27924767],"genre_scores_gemma":[0.9257839,0.005729981,0.03099224,0.00102171,0.0018632389,0.000137843,0.00046947697,0.00039409366,0.033607554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941194,0.00020585739,0.000020338079,0.00010625957,0.00017375132,0.00008184748],"domain_scores_gemma":[0.99763346,0.0012054469,0.000300131,0.00021729634,0.00034732503,0.00029637283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085864495,0.00088061043,0.00065950933,0.003555978,0.00095203664,0.0017411286,0.0010632272,0.001055293,0.010360155],"category_scores_gemma":[0.007372648,0.0003216137,0.00040708136,0.0016010655,0.0028616062,0.003993367,0.0016259699,0.0017483068,0.001935613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027135819,0.000020774805,0.00028452216,0.0000713442,0.000010514181,0.00006113898,0.00015357457,0.004153285,0.0012103774,0.97889245,0.005221934,0.009892951],"study_design_scores_gemma":[0.0000050042595,0.000007584094,0.00026875018,0.00002456033,0.000003658325,0.00008877303,0.00007205731,0.014119956,0.00024664841,0.9829336,0.0022173328,0.000011992076],"about_ca_topic_score_codex":0.00088920526,"about_ca_topic_score_gemma":0.0010428354,"teacher_disagreement_score":0.010360155,"about_ca_system_score_codex":0.0009858533,"about_ca_system_score_gemma":0.00037508315,"threshold_uncertainty_score":0.034658134},"labels":[],"label_agreement":null},{"id":"W2394956211","doi":"","title":"Super edge-magic total labeling of subdivision of stars.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Stars; Subdivision; MAGIC (telescope); Mathematics; Enhanced Data Rates for GSM Evolution; Astronomy; Astrophysics; Combinatorics; Physics; Geography; Computer science; Artificial intelligence; Archaeology","score_opus":0.008959936414384752,"score_gpt":0.21667178830519146,"score_spread":0.2077118518908067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394956211","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4097848,0.0010869888,0.42263645,0.0011283676,0.0002428088,0.00010936895,0.0014512078,0.00084617164,0.16271389],"genre_scores_gemma":[0.7999354,0.00054454297,0.16657984,0.0005207897,0.00011164993,0.00009812711,0.0019602696,0.0003248543,0.029924506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999443,0.00015701102,0.000031600113,0.00011846513,0.00014538312,0.00010461682],"domain_scores_gemma":[0.99864453,0.00052558974,0.00010918599,0.0003737333,0.00018632416,0.0001606662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005347329,0.00033064318,0.00058110745,0.0008530384,0.0011219521,0.0015496513,0.0010065823,0.0007368701,0.009566825],"category_scores_gemma":[0.0021028926,0.00038012455,0.0006086053,0.0012947916,0.0013428669,0.0029208616,0.00211261,0.0013023764,0.0012210261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015716394,0.000035629637,0.00075076753,0.00014692119,0.000015629039,0.00005710403,0.00026442006,0.005836404,0.0040196134,0.94084376,0.0077290777,0.040143482],"study_design_scores_gemma":[0.000031216357,0.000036498543,0.00056799466,0.000033101413,0.000023831053,0.00014872252,0.00017354955,0.025023354,0.0028997327,0.95667845,0.014371039,0.000012585802],"about_ca_topic_score_codex":0.0016148215,"about_ca_topic_score_gemma":0.0027114633,"teacher_disagreement_score":0.009566825,"about_ca_system_score_codex":0.00093239476,"about_ca_system_score_gemma":0.00054712145,"threshold_uncertainty_score":0.032004178},"labels":[],"label_agreement":null},{"id":"W2394985079","doi":"","title":"On the total restrained domination edge critical graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Domination analysis; Dominating set; Mathematics; Combinatorics; Vertex (graph theory); Cardinality (data modeling); Graph; Upper and lower bounds; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science","score_opus":0.016586343730049507,"score_gpt":0.2840400107065568,"score_spread":0.2674536669765073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394985079","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28275007,0.004775266,0.64486426,0.0017225824,0.00020588946,0.00036436596,0.001192869,0.00031310134,0.06381167],"genre_scores_gemma":[0.8405012,0.0033529522,0.14606492,0.0006467226,0.00040312242,0.0003391224,0.0010293748,0.000116934985,0.007545719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895966,0.00026683285,0.00004437805,0.00023392492,0.00033574636,0.00015940476],"domain_scores_gemma":[0.9955649,0.0028227672,0.0004941333,0.00030657157,0.00046497595,0.00034654138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010820698,0.00093026244,0.00064209773,0.0028191844,0.0013096088,0.0013137877,0.0011806992,0.0006405947,0.002698643],"category_scores_gemma":[0.0047823456,0.00038331043,0.0005673481,0.002053852,0.002318833,0.0037452746,0.0014769842,0.0016121508,0.00031750606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025284907,0.000108882894,0.0032353108,0.0005885879,0.00009336156,0.00050494564,0.0009061789,0.06370916,0.014565968,0.84216875,0.009141567,0.06472429],"study_design_scores_gemma":[0.00004655891,0.00020268737,0.002598888,0.00019814078,0.00008928878,0.002053356,0.0005439436,0.12902324,0.0067382935,0.8256305,0.032812927,0.00006220345],"about_ca_topic_score_codex":0.001066582,"about_ca_topic_score_gemma":0.001360899,"teacher_disagreement_score":0.0028191844,"about_ca_system_score_codex":0.0016523894,"about_ca_system_score_gemma":0.000595215,"threshold_uncertainty_score":0.011988997},"labels":[],"label_agreement":null},{"id":"W2394988899","doi":"","title":"The optimal pebbling number of square of paths and cycles.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Square (algebra); Combinatorics; Arithmetic; Geometry","score_opus":0.0045918415482181126,"score_gpt":0.20267200801506943,"score_spread":0.1980801664668513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394988899","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5063661,0.0024640844,0.28818896,0.0033992368,0.0007922547,0.00021066415,0.0015264687,0.0012965632,0.19575566],"genre_scores_gemma":[0.9204446,0.00057538314,0.064449996,0.00026022203,0.00012601614,0.00011473297,0.00026974632,0.00021628497,0.013543064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992206,0.00023954968,0.00002956807,0.00017341251,0.00015186823,0.00018501222],"domain_scores_gemma":[0.99554527,0.0027778845,0.00027523792,0.00050543994,0.00037114936,0.00052511715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010311311,0.0005627252,0.0005544928,0.0011922915,0.0011203447,0.0021383099,0.0010508442,0.0010320628,0.014801406],"category_scores_gemma":[0.012557957,0.00039238483,0.00023593911,0.00089859706,0.0012078551,0.0034112548,0.0010668646,0.0012544619,0.0016619712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011481688,0.0001801258,0.0015562185,0.00036499643,0.000038600327,0.00013940776,0.00016802127,0.08656463,0.019054543,0.71246004,0.025048366,0.15327685],"study_design_scores_gemma":[0.000109064,0.00023907775,0.0010464309,0.000100419864,0.00004226961,0.00027431425,0.0002084118,0.25577176,0.011242862,0.7180177,0.012896824,0.000050854702],"about_ca_topic_score_codex":0.0013597861,"about_ca_topic_score_gemma":0.0034990567,"teacher_disagreement_score":0.014801406,"about_ca_system_score_codex":0.0013993531,"about_ca_system_score_gemma":0.0017331409,"threshold_uncertainty_score":0.049515665},"labels":[],"label_agreement":null},{"id":"W2395020125","doi":"","title":"Quasi-Twisted Codes over F 11 .","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics; Combinatorics","score_opus":0.02143000357924769,"score_gpt":0.2298188217612,"score_spread":0.20838881818195232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395020125","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55905914,0.0025543575,0.21845008,0.0032893606,0.0011754017,0.00011013519,0.0015214123,0.00070862914,0.21313144],"genre_scores_gemma":[0.955379,0.0007450755,0.013171755,0.00036036986,0.00028365338,0.000043811233,0.000409365,0.00009691771,0.029509986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898905,0.00024827357,0.000050386323,0.00012105347,0.00028130534,0.0003099397],"domain_scores_gemma":[0.9981343,0.0006621657,0.00026816406,0.0004234364,0.00025800898,0.0002539394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000906586,0.00046582185,0.0004292369,0.001289445,0.0010509243,0.001958434,0.0005107513,0.00075876294,0.009907746],"category_scores_gemma":[0.0029237655,0.0002446094,0.00047184672,0.001010144,0.0017796346,0.0031128132,0.0021663741,0.0017728659,0.00198195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013572577,0.00002287107,0.0005196404,0.00005105701,0.000008055375,0.00020700328,0.00021221273,0.0012173307,0.0020350139,0.97756267,0.0028025925,0.0152259115],"study_design_scores_gemma":[0.000029648343,0.000065283515,0.00072826946,0.00006235233,0.000015066804,0.0005504883,0.00014202758,0.0070927637,0.0031441713,0.9745156,0.013620048,0.00003423802],"about_ca_topic_score_codex":0.0006289698,"about_ca_topic_score_gemma":0.00061702094,"teacher_disagreement_score":0.009907746,"about_ca_system_score_codex":0.0009396623,"about_ca_system_score_gemma":0.00072550646,"threshold_uncertainty_score":0.033144712},"labels":[],"label_agreement":null},{"id":"W2395108022","doi":"","title":"Toughness and [a, b]-factors in graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Toughness; Combinatorics; Composite material; Materials science","score_opus":0.014504232643347797,"score_gpt":0.22933289122170963,"score_spread":0.21482865857836184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395108022","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5317949,0.004279052,0.24865052,0.009943079,0.00067239045,0.00013854404,0.0023459815,0.0010547617,0.20112085],"genre_scores_gemma":[0.9322949,0.0010861155,0.038396206,0.0008599795,0.00044271623,0.00014787883,0.0010251586,0.0002600317,0.025487004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980921,0.0005625327,0.00010828483,0.0004992402,0.00031557478,0.0004222644],"domain_scores_gemma":[0.990851,0.0055270838,0.0009089996,0.0009505498,0.00051889,0.0012434094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014230338,0.0007918737,0.0009828021,0.002672818,0.0040304177,0.004902976,0.0016982824,0.001911935,0.017264348],"category_scores_gemma":[0.008688561,0.00088379753,0.0011370134,0.0030969367,0.005151545,0.0107627455,0.0030766784,0.0033620864,0.0017025435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007528927,0.000032999338,0.0006852332,0.00005688869,0.000012921,0.000057896865,0.0003344993,0.0011378004,0.0005540856,0.98588145,0.0043007554,0.0068700714],"study_design_scores_gemma":[0.000013781398,0.00000878368,0.00041044445,0.000025552035,0.000010426214,0.00010684459,0.00022166135,0.0030146404,0.00028613853,0.9910239,0.004862275,0.000015579331],"about_ca_topic_score_codex":0.004740545,"about_ca_topic_score_gemma":0.0041743573,"teacher_disagreement_score":0.017264348,"about_ca_system_score_codex":0.002048713,"about_ca_system_score_gemma":0.000915732,"threshold_uncertainty_score":0.057754934},"labels":[],"label_agreement":null},{"id":"W2395113678","doi":"","title":"On the zeroth-order general Randic index of cacti.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Botanical Research and Applications","field":"Agricultural and Biological Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Order (exchange); Topological index; Combinatorics; Computer science; Business","score_opus":0.024517091646861135,"score_gpt":0.26035470955264006,"score_spread":0.23583761790577892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395113678","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6335909,0.005822229,0.033124175,0.0024009803,0.001252194,0.00006108904,0.0006728166,0.00032649777,0.3227492],"genre_scores_gemma":[0.9599215,0.0016303175,0.0069722333,0.00035072168,0.00084632775,0.000038165337,0.00030935556,0.00011074598,0.02982069],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947375,0.00009595001,0.000033691224,0.00010858706,0.00016471981,0.00012331955],"domain_scores_gemma":[0.998252,0.0006885297,0.00031390498,0.00017286975,0.00022671047,0.00034593063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007004674,0.0006405938,0.0008413378,0.004216873,0.0016416314,0.002961381,0.00095564453,0.0007550792,0.009517296],"category_scores_gemma":[0.0038824144,0.00030757382,0.00039233768,0.0014781717,0.003488929,0.003230804,0.0016720202,0.0017611913,0.0015770526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008674646,0.000021331143,0.00085738534,0.00007169545,0.000011218404,0.00013127788,0.0002450466,0.0010995175,0.0012986977,0.9814424,0.0026863257,0.01204842],"study_design_scores_gemma":[0.000021152418,0.000040751085,0.0017266661,0.000057685083,0.000016676751,0.00036985285,0.00013920247,0.0049071033,0.0007893038,0.981337,0.010553379,0.0000412296],"about_ca_topic_score_codex":0.0017440277,"about_ca_topic_score_gemma":0.0024284718,"teacher_disagreement_score":0.009517296,"about_ca_system_score_codex":0.0017797642,"about_ca_system_score_gemma":0.00062769995,"threshold_uncertainty_score":0.031838477},"labels":[],"label_agreement":null},{"id":"W2395123460","doi":"","title":"Some Identities On The Euler Numbers Arising From Euler Basis Polynomials.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Euler's formula; Basis (linear algebra); Euler number (physics); Pure mathematics; Semi-implicit Euler method; Algebra over a field; Backward Euler method; Mathematical analysis; Euler equations; Geometry","score_opus":0.032967087149131345,"score_gpt":0.27978365351494805,"score_spread":0.2468165663658167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395123460","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092443176,0.015758216,0.28248045,0.008181312,0.0031726477,0.00007466818,0.0012690861,0.0003840663,0.59623635],"genre_scores_gemma":[0.7420501,0.01604661,0.09189734,0.0030154008,0.004020619,0.00017851838,0.0012659616,0.00042249152,0.14110295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994747,0.00014120007,0.000035871886,0.00006679438,0.00020719273,0.00007425877],"domain_scores_gemma":[0.99918836,0.00033793913,0.00009356046,0.00009802845,0.00018979188,0.000092378345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012005068,0.0008106171,0.00053714967,0.00269132,0.0015627228,0.0025512995,0.0007650181,0.0009271743,0.01151172],"category_scores_gemma":[0.003365194,0.00041914018,0.0006588981,0.0021801456,0.002298417,0.0052172984,0.002120181,0.003373097,0.0041366485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053054414,0.000008667939,0.00008048535,0.0000245261,0.0000016543715,0.000045122924,0.00008807098,0.00018579767,0.00022231134,0.9901994,0.002936821,0.006201891],"study_design_scores_gemma":[0.0000030189503,0.0000044457656,0.00012752356,0.00002039793,0.0000029147398,0.000087760665,0.000036358942,0.00082109845,0.00016289619,0.9910779,0.0076496447,0.000005918455],"about_ca_topic_score_codex":0.0008903472,"about_ca_topic_score_gemma":0.0011713549,"teacher_disagreement_score":0.01151172,"about_ca_system_score_codex":0.0010772614,"about_ca_system_score_gemma":0.00061085453,"threshold_uncertainty_score":0.0385105},"labels":[],"label_agreement":null},{"id":"W2395134656","doi":"","title":"Super Connectivity and Super Edge-connectivity of Transformation Graphs G +-+ .","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Transformation (genetics); Combinatorics; Computer science; Artificial intelligence","score_opus":0.013625296934942431,"score_gpt":0.2280159920421776,"score_spread":0.21439069510723516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395134656","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6289192,0.00063066115,0.22522824,0.0016317392,0.00012860818,0.000092680275,0.0009894583,0.0005342591,0.14184527],"genre_scores_gemma":[0.9678641,0.00037081144,0.019821588,0.00025622066,0.000074568095,0.00007616219,0.0006665344,0.00008996361,0.01078012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962914,0.0001121735,0.000015563288,0.000083118466,0.00008973511,0.00007024641],"domain_scores_gemma":[0.9982108,0.00084678264,0.00030176772,0.00021289737,0.00020262625,0.00022508627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032197943,0.00026690276,0.00028868433,0.0010653163,0.0007217884,0.0011967055,0.00058834546,0.0005405878,0.011735848],"category_scores_gemma":[0.0023076467,0.0002273436,0.00032223153,0.0009584552,0.0011172987,0.002809472,0.0010849006,0.001001148,0.00077221467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009946082,0.000026909065,0.0013268281,0.00008351465,0.000012431541,0.00036662086,0.00025120607,0.0045627444,0.0033157591,0.9685801,0.0038625253,0.017511884],"study_design_scores_gemma":[0.000025059679,0.000040760446,0.0017884999,0.000026469206,0.0000209781,0.00064804615,0.0002581196,0.029197058,0.0016238805,0.9561792,0.010178488,0.000013414401],"about_ca_topic_score_codex":0.00082063524,"about_ca_topic_score_gemma":0.001115766,"teacher_disagreement_score":0.011735848,"about_ca_system_score_codex":0.00040843192,"about_ca_system_score_gemma":0.00030843125,"threshold_uncertainty_score":0.039260328},"labels":[],"label_agreement":null},{"id":"W2395139503","doi":"","title":"The scrambling indices of primitive digraphs with exactly two cycles.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Scrambling; Mathematics; Combinatorics; Algorithm","score_opus":0.02042772827843531,"score_gpt":0.2831502540776327,"score_spread":0.2627225257991974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395139503","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38930905,0.001823183,0.26916367,0.0010563589,0.0011881217,0.00019630442,0.0011971524,0.0014857173,0.33458048],"genre_scores_gemma":[0.8856288,0.00071572844,0.06712277,0.00058739807,0.00023572886,0.00019933487,0.00073404214,0.0005286722,0.044247504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995529,0.00011022524,0.00003282598,0.00008610801,0.0001075914,0.000110359455],"domain_scores_gemma":[0.9984257,0.00049840315,0.00017828896,0.00044439794,0.00022684164,0.0002264068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036939114,0.00050721964,0.00049230084,0.0013923753,0.001483625,0.001916792,0.00085114007,0.0010358795,0.009279544],"category_scores_gemma":[0.0032901058,0.00042921564,0.00047682147,0.0008351249,0.0014727617,0.0023332639,0.0017318446,0.0016709412,0.0027541223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091480644,0.000031123207,0.00019093406,0.000078909914,0.00000782619,0.0002158231,0.00023421411,0.0011031947,0.0047989856,0.96808136,0.004452392,0.020713737],"study_design_scores_gemma":[0.000028219562,0.000043863987,0.0002850371,0.000064476306,0.000016445387,0.00040771667,0.0001448548,0.008903478,0.005539769,0.9665078,0.018025808,0.000032565502],"about_ca_topic_score_codex":0.0006841169,"about_ca_topic_score_gemma":0.0012182182,"teacher_disagreement_score":0.009279544,"about_ca_system_score_codex":0.00066232996,"about_ca_system_score_gemma":0.0006847917,"threshold_uncertainty_score":0.031043172},"labels":[],"label_agreement":null},{"id":"W2395152572","doi":"","title":"Total chromatic number of folded hypercubes.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hypercube; Chromatic scale; Mathematics; Combinatorics","score_opus":0.01213662577506603,"score_gpt":0.269610672308851,"score_spread":0.257474046533785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395152572","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8461739,0.0006838634,0.032875422,0.00074359856,0.00014077021,0.00004801237,0.002608027,0.00034543267,0.116380915],"genre_scores_gemma":[0.9680576,0.0005338334,0.010113117,0.0001059452,0.000051987143,0.00006157139,0.0014482255,0.00012719464,0.019500498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997589,0.000047285735,0.00000979184,0.000053570107,0.000061850755,0.00006865333],"domain_scores_gemma":[0.9990453,0.00038822615,0.00014444828,0.00012841089,0.00013823302,0.00015528979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029204504,0.00037546956,0.00027586895,0.001472493,0.0010846588,0.0019765962,0.00066551456,0.00050630356,0.015315787],"category_scores_gemma":[0.0013491195,0.00025440732,0.00029710008,0.0014301696,0.0009831506,0.0016133117,0.0007552994,0.00049496896,0.001093581],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073766755,0.00008504695,0.007567036,0.0005012576,0.0000985991,0.00030928993,0.0007004848,0.043548834,0.03532007,0.8387749,0.0240649,0.04829187],"study_design_scores_gemma":[0.0001055019,0.00015364557,0.011579016,0.0001501482,0.00011246643,0.0008280786,0.0010312437,0.0961251,0.022155399,0.8361297,0.031578448,0.000051169805],"about_ca_topic_score_codex":0.0017675313,"about_ca_topic_score_gemma":0.0036530455,"teacher_disagreement_score":0.015315787,"about_ca_system_score_codex":0.0012834424,"about_ca_system_score_gemma":0.0005272882,"threshold_uncertainty_score":0.05123645},"labels":[],"label_agreement":null},{"id":"W2395201475","doi":"","title":"Matrices related to the idempotent numbers and the numbers of planted forests.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Idempotence; Vertex (graph theory); Combinatorics; Set (abstract data type); Matrix (chemical analysis); Graph; Computer science","score_opus":0.026612862887165113,"score_gpt":0.2770818972737939,"score_spread":0.25046903438662876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395201475","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.332056,0.0034576512,0.5450802,0.00099848,0.001000788,0.00011008841,0.0005420752,0.00022615187,0.11652858],"genre_scores_gemma":[0.9025381,0.0019507271,0.074681446,0.00024645124,0.0008585062,0.000111258254,0.00035827234,0.00008425368,0.019170968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941564,0.00012820639,0.00003209411,0.00013148147,0.00019821044,0.000094375464],"domain_scores_gemma":[0.9983553,0.000592632,0.0004525134,0.00012394789,0.00028427746,0.0001912641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006014328,0.0005851159,0.00033980078,0.0015363569,0.00067708775,0.0013585603,0.00071781833,0.00080319983,0.0061040935],"category_scores_gemma":[0.0039034714,0.0002607902,0.00044503066,0.00086964417,0.0013036565,0.0037979467,0.00062719407,0.0013323633,0.0009912144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003236381,0.000027550683,0.00040359492,0.000080234466,0.000007716938,0.00013873761,0.00015979799,0.0026904158,0.0055351225,0.9787177,0.001054877,0.011151964],"study_design_scores_gemma":[0.000009486396,0.000052629952,0.0007539558,0.00003290145,0.000012313268,0.00067456695,0.00012191343,0.02339528,0.0043735704,0.9631603,0.0073828967,0.000030182257],"about_ca_topic_score_codex":0.0003990708,"about_ca_topic_score_gemma":0.00060767034,"teacher_disagreement_score":0.0061040935,"about_ca_system_score_codex":0.00055660855,"about_ca_system_score_gemma":0.00038414646,"threshold_uncertainty_score":0.020420194},"labels":[],"label_agreement":null},{"id":"W2395208292","doi":"","title":"Broadcast domination of products of graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cartesian product; Domination analysis; Combinatorics; Vertex (graph theory); Hamming graph; Upper and lower bounds; Graph; Discrete mathematics; Hamming code; Algorithm","score_opus":0.014051285189737034,"score_gpt":0.27427578333410246,"score_spread":0.26022449814436543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395208292","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62409556,0.0016169482,0.33285958,0.00025669287,0.00006503611,0.00019268498,0.00065391324,0.00038970864,0.039869934],"genre_scores_gemma":[0.94275814,0.00063414796,0.049500722,0.000060377315,0.000050034363,0.00010982945,0.00039913345,0.00008696382,0.006400659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987791,0.00023032755,0.00007059516,0.00030452514,0.0004211831,0.0001943463],"domain_scores_gemma":[0.99397355,0.0033890367,0.0008120121,0.0007633479,0.000692874,0.0003692612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011076634,0.00046445822,0.00045771847,0.0011997112,0.0010106623,0.0014986863,0.0007019981,0.0003153052,0.0035165395],"category_scores_gemma":[0.0071063805,0.0003749216,0.00041601335,0.0010844413,0.001817521,0.002388436,0.0012098483,0.00070015236,0.0004095938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007395042,0.000087423046,0.0133967595,0.00060277793,0.00010718735,0.0004862103,0.0023355728,0.04694713,0.052177865,0.7655735,0.0045548216,0.11299121],"study_design_scores_gemma":[0.000100208075,0.0006922755,0.01080849,0.00015528007,0.0002187022,0.0030348767,0.0011471674,0.19008535,0.07550368,0.65504575,0.06309803,0.000110200075],"about_ca_topic_score_codex":0.00148441,"about_ca_topic_score_gemma":0.002301981,"teacher_disagreement_score":0.0035165395,"about_ca_system_score_codex":0.0013099051,"about_ca_system_score_gemma":0.0005606688,"threshold_uncertainty_score":0.01176393},"labels":[],"label_agreement":null},{"id":"W2395211072","doi":"","title":"On A Multivariable Extension Of The Hermite And Related Polynomials.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Extension (predicate logic); Mathematics; Hermite polynomials; Multivariable calculus; Pure mathematics; Algebra over a field; Computer science","score_opus":0.005336094320283439,"score_gpt":0.22618722570149238,"score_spread":0.22085113138120893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395211072","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1986866,0.010377205,0.280389,0.008274065,0.002573986,0.000071538285,0.00057954324,0.0003013743,0.4987467],"genre_scores_gemma":[0.89023256,0.0044406024,0.030412285,0.0016238643,0.002916401,0.000055883847,0.00027156886,0.000110489855,0.06993638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995435,0.00013700784,0.000014876451,0.000066607434,0.00013955055,0.00009843593],"domain_scores_gemma":[0.99926215,0.0002582394,0.00011200001,0.00008053897,0.00016783364,0.00011926353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007528379,0.0003950282,0.0004626477,0.0017522058,0.0013440743,0.0015186932,0.0005264688,0.0005668641,0.008448758],"category_scores_gemma":[0.0024842066,0.00018894566,0.0005589491,0.0013598527,0.0021722184,0.003610271,0.0019216832,0.001830663,0.0010981519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000577404,0.000007000475,0.000051574396,0.000012595063,0.0000018115222,0.00003486465,0.000054977314,0.00018318223,0.00016587041,0.9958003,0.0011283215,0.0025535852],"study_design_scores_gemma":[0.0000051537736,0.000012297936,0.00020424405,0.000011608782,0.0000036970312,0.000101453734,0.00005182758,0.0019870196,0.00009472955,0.98805934,0.00946098,0.000007754385],"about_ca_topic_score_codex":0.0012864377,"about_ca_topic_score_gemma":0.0015315601,"teacher_disagreement_score":0.008448758,"about_ca_system_score_codex":0.000719579,"about_ca_system_score_gemma":0.00048202724,"threshold_uncertainty_score":0.028263867},"labels":[],"label_agreement":null},{"id":"W2395211755","doi":"","title":"On product cordial graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Product (mathematics); Combinatorics; Pure mathematics; Geometry","score_opus":0.021410593883876842,"score_gpt":0.2174355615480047,"score_spread":0.19602496766412786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395211755","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24327423,0.004625001,0.34009016,0.0070179505,0.00087116356,0.00015321691,0.002402871,0.0014341932,0.40013117],"genre_scores_gemma":[0.7868281,0.0029092764,0.11405444,0.0015842259,0.00061187736,0.00021483118,0.0026490313,0.0004971331,0.090651184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991616,0.0002480819,0.00004870643,0.00021045943,0.00017684643,0.0001543063],"domain_scores_gemma":[0.9970709,0.0015083329,0.000311819,0.0005593983,0.00024028865,0.000309216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008276401,0.00065536646,0.0006892863,0.0016095939,0.0018029157,0.0027977629,0.0012431152,0.0011937056,0.018902624],"category_scores_gemma":[0.0042923656,0.00041704276,0.0006587728,0.0023215925,0.0021848662,0.008189246,0.002419675,0.0024254865,0.0027333484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033403685,0.000022363638,0.00029072084,0.00007347237,0.0000061106316,0.000036900536,0.00010960996,0.0010310577,0.00042248875,0.9740336,0.0065468512,0.017393375],"study_design_scores_gemma":[0.000009617927,0.000008996686,0.0002086629,0.000028988034,0.000007352615,0.000110212306,0.0000902227,0.0049354886,0.0005355317,0.9805611,0.013496054,0.000007803884],"about_ca_topic_score_codex":0.0013254554,"about_ca_topic_score_gemma":0.0024055107,"teacher_disagreement_score":0.018902624,"about_ca_system_score_codex":0.0018247031,"about_ca_system_score_gemma":0.00054947735,"threshold_uncertainty_score":0.06323558},"labels":[],"label_agreement":null},{"id":"W2395214934","doi":"","title":"PI Index of Some Simple Pericondensed Hexagonal Systems.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hexagonal crystal system; Simple (philosophy); Index (typography); Combinatorics; Pure mathematics; Crystallography; Chemistry; Computer science","score_opus":0.022692968910457936,"score_gpt":0.28351152684656555,"score_spread":0.26081855793610764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395214934","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76033044,0.00054222427,0.022113765,0.00063497655,0.0002363601,0.00007901571,0.00085059006,0.00020688825,0.21500571],"genre_scores_gemma":[0.9821936,0.00014438863,0.0061273417,0.00011246554,0.000038857488,0.000036802336,0.00034303698,0.000028679215,0.010974918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998041,0.00004621735,0.000010607428,0.0000250017,0.000055042863,0.0000590406],"domain_scores_gemma":[0.9996283,0.00008466744,0.00009057219,0.000045347315,0.0000626681,0.000088442204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001577559,0.00021610307,0.00025665652,0.0013264997,0.0011010284,0.0013192018,0.00046305027,0.00057916384,0.013667323],"category_scores_gemma":[0.0008454533,0.00016945938,0.0001480313,0.0007661084,0.0007630574,0.0007944082,0.0008024437,0.00057580415,0.0011866479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000178548,0.000051263327,0.0013788394,0.00012214063,0.000015234177,0.00032198496,0.0002903678,0.0032514287,0.0056994194,0.9651797,0.006586791,0.01692429],"study_design_scores_gemma":[0.000116408155,0.00011294108,0.0038140253,0.00004530887,0.000025815332,0.00070772,0.0007374724,0.045419097,0.007124607,0.9158216,0.026022848,0.000052160336],"about_ca_topic_score_codex":0.0011480494,"about_ca_topic_score_gemma":0.0015889185,"teacher_disagreement_score":0.013667323,"about_ca_system_score_codex":0.00057027984,"about_ca_system_score_gemma":0.00035478405,"threshold_uncertainty_score":0.04572171},"labels":[],"label_agreement":null},{"id":"W2395242983","doi":"","title":"A new product construction for large sets of resolvable Mendelsohn triple systems.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Triple product; Product (mathematics); Triple system; Pure mathematics; Geometry","score_opus":0.007003072323383166,"score_gpt":0.20933301408828323,"score_spread":0.20232994176490007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395242983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06288219,0.00046831073,0.8711167,0.00050303136,0.00029757156,0.00014055293,0.0005344048,0.00086832425,0.063188896],"genre_scores_gemma":[0.52045417,0.0005240288,0.45082894,0.0004140196,0.00020145247,0.00042901217,0.0010694842,0.00057540816,0.025503535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911433,0.00021865677,0.00005503359,0.00019828924,0.00032192862,0.00009176644],"domain_scores_gemma":[0.997985,0.0009906426,0.00012518872,0.00045869595,0.00024139225,0.00019915611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009466625,0.0004939512,0.0006728676,0.0014053007,0.0017441339,0.0020906914,0.001329586,0.000890418,0.01263858],"category_scores_gemma":[0.0032745479,0.0006638308,0.0009792793,0.0011157108,0.0016446969,0.0037596386,0.0036687339,0.002268864,0.0028609354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055827455,0.000036638106,0.00021627753,0.00010731835,0.000015388228,0.00014428145,0.0002531617,0.002450317,0.0049634036,0.9611081,0.0037246873,0.026924582],"study_design_scores_gemma":[0.000024907105,0.00006084892,0.00014715214,0.000041631913,0.000026013482,0.00037926267,0.000096709984,0.01718833,0.005936025,0.9531305,0.022933384,0.000035292436],"about_ca_topic_score_codex":0.0003366067,"about_ca_topic_score_gemma":0.00063213776,"teacher_disagreement_score":0.01263858,"about_ca_system_score_codex":0.00063899835,"about_ca_system_score_gemma":0.000536929,"threshold_uncertainty_score":0.042280197},"labels":[],"label_agreement":null},{"id":"W2395280968","doi":"","title":"On the strongly c-harmoniousness cycle with P 2 - or P 3 -chord.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Liquid Crystal Research Advancements","field":"Materials Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chord (peer-to-peer); Mathematics; Pure mathematics; Computer science; Distributed computing","score_opus":0.03343859949112611,"score_gpt":0.2746744527821307,"score_spread":0.2412358532910046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395280968","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3157468,0.001770174,0.09888618,0.0021857521,0.0009100003,0.00015224204,0.0009861866,0.0005269602,0.5788357],"genre_scores_gemma":[0.93324155,0.00056318485,0.015787644,0.0006846548,0.0002324658,0.00009886517,0.00051246985,0.00018925489,0.04868984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996884,0.0000554818,0.00001471677,0.00006408147,0.0000777104,0.00009966382],"domain_scores_gemma":[0.9996043,0.00012928918,0.000044939177,0.000068240246,0.000064441745,0.00008875905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003075926,0.00035385415,0.0003883453,0.0007753163,0.0016345233,0.0016117662,0.0006759929,0.0006141496,0.016482888],"category_scores_gemma":[0.001477243,0.00017010694,0.00033144985,0.00072918326,0.0014324138,0.0028047387,0.0018415581,0.0010646892,0.0017263629],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008236808,0.00001292781,0.00014059951,0.000036305762,0.0000051704064,0.00007259654,0.00010729011,0.00073249766,0.0008636263,0.98361015,0.0036376326,0.01069889],"study_design_scores_gemma":[0.000023167695,0.000027453556,0.00023449006,0.000015194875,0.000006011842,0.00009708609,0.00011304646,0.002927155,0.0007116352,0.9849423,0.010889847,0.000012443255],"about_ca_topic_score_codex":0.0013353874,"about_ca_topic_score_gemma":0.0018858712,"teacher_disagreement_score":0.016482888,"about_ca_system_score_codex":0.0008415522,"about_ca_system_score_gemma":0.0005496078,"threshold_uncertainty_score":0.055140734},"labels":[],"label_agreement":null},{"id":"W2395292102","doi":"","title":"A non-existence result and large sets for Sarvate-Beam designs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.011939420056740696,"score_gpt":0.2308398000720153,"score_spread":0.2189003800152746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395292102","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14307946,0.0012973008,0.77153695,0.0007193846,0.00021532476,0.00013440746,0.00022358354,0.0003077455,0.08248581],"genre_scores_gemma":[0.81325287,0.0009090574,0.16415413,0.00037207562,0.00012398305,0.00046133544,0.00036600753,0.000097519616,0.020263055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983455,0.00052964076,0.00012977463,0.0002689185,0.00054237724,0.00018390226],"domain_scores_gemma":[0.9920936,0.0056861383,0.00069717766,0.00073377124,0.0005079656,0.00028127883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019977193,0.00071143,0.00054669473,0.0015057091,0.0015819255,0.0021555463,0.00091890426,0.0014629727,0.0094286],"category_scores_gemma":[0.008104651,0.00092982023,0.0010030341,0.0010277315,0.001911459,0.0036325473,0.0020867358,0.002409259,0.001186844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009912831,0.000037844267,0.0006684078,0.00016532943,0.0000301395,0.0002061453,0.00030117275,0.007413118,0.0078057614,0.95939475,0.001821276,0.02205697],"study_design_scores_gemma":[0.000049121798,0.00036880234,0.00095374836,0.00018267262,0.000070705246,0.0018515495,0.00037605045,0.068560995,0.019957222,0.8877066,0.019852081,0.000070427646],"about_ca_topic_score_codex":0.00019611906,"about_ca_topic_score_gemma":0.00036280928,"teacher_disagreement_score":0.0094286,"about_ca_system_score_codex":0.0009779587,"about_ca_system_score_gemma":0.0005569904,"threshold_uncertainty_score":0.031541765},"labels":[],"label_agreement":null},{"id":"W2395304930","doi":"","title":"The 2-color Rado Number of x + y + kz = 3w.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Arithmetic","score_opus":0.00460549175608964,"score_gpt":0.20794727025486093,"score_spread":0.20334177849877128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395304930","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5624568,0.00086247304,0.03077742,0.004627468,0.0014315662,0.000090012254,0.0019348459,0.00066408765,0.39715526],"genre_scores_gemma":[0.9240524,0.00034237982,0.010191424,0.00065912725,0.00013355807,0.000080948295,0.0007316742,0.00023859786,0.06356985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965453,0.00006051108,0.000010614704,0.000061373205,0.00006737186,0.00014561192],"domain_scores_gemma":[0.99963295,0.00011940123,0.00005819057,0.000061392246,0.000041143132,0.0000869139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002859489,0.00050473365,0.00040798556,0.0011308931,0.002084339,0.0017533612,0.0006111964,0.0010373396,0.031496987],"category_scores_gemma":[0.0010817864,0.00021551253,0.00035919383,0.00071334105,0.0014908222,0.0018670567,0.0010153957,0.0010798023,0.0047835573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007810158,0.00012237397,0.0022823615,0.00029329152,0.000044278117,0.0009689468,0.00048389414,0.002420313,0.027905742,0.8814403,0.034468524,0.04878907],"study_design_scores_gemma":[0.00014897274,0.00011201619,0.0052996865,0.0001306441,0.000056610585,0.001429938,0.0007293065,0.009183811,0.026677562,0.86822987,0.087887816,0.00011379276],"about_ca_topic_score_codex":0.0009633183,"about_ca_topic_score_gemma":0.0015259942,"teacher_disagreement_score":0.031496987,"about_ca_system_score_codex":0.0006807726,"about_ca_system_score_gemma":0.000646633,"threshold_uncertainty_score":0.10536784},"labels":[],"label_agreement":null},{"id":"W2395328746","doi":"","title":"The Binet formula for the k-generalized Fibonacci numbers.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Mathematics; Lucas number; Fibonacci polynomials; Pisano period; Combinatorics; Orthogonal polynomials; Classical orthogonal polynomials","score_opus":0.008944670807297446,"score_gpt":0.2675256570132332,"score_spread":0.2585809862059358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395328746","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11932874,0.018864967,0.26566544,0.0068268855,0.0056338026,0.00013241913,0.0018285171,0.0006604412,0.5810587],"genre_scores_gemma":[0.8401465,0.0056519504,0.06576648,0.0023165746,0.0015979579,0.00021980861,0.0008195811,0.00030509866,0.08317604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995011,0.00011103029,0.00003284288,0.000065296685,0.00021095361,0.00007882806],"domain_scores_gemma":[0.9992367,0.00033695347,0.00006520332,0.00009612514,0.00020521489,0.000059849506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007565655,0.0006005793,0.00080799736,0.002446273,0.001996442,0.004158771,0.0010119558,0.0015647842,0.012921116],"category_scores_gemma":[0.004123136,0.00036795877,0.00075533905,0.0019220236,0.0026315001,0.0053819814,0.0013582316,0.0024916788,0.003733708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011405823,0.0000030922076,0.000052403226,0.00002987726,0.000002700286,0.000048435904,0.00004299364,0.00018422097,0.00021486101,0.99223715,0.0025799244,0.004592989],"study_design_scores_gemma":[0.000004780104,0.000004390295,0.000109028886,0.00002352567,0.0000036669837,0.00013547348,0.000027564638,0.0016103577,0.00018673905,0.99070215,0.0071818354,0.000010514881],"about_ca_topic_score_codex":0.0020141217,"about_ca_topic_score_gemma":0.002263159,"teacher_disagreement_score":0.012921116,"about_ca_system_score_codex":0.0016568453,"about_ca_system_score_gemma":0.0008273933,"threshold_uncertainty_score":0.043225467},"labels":[],"label_agreement":null},{"id":"W2395362637","doi":"","title":"Skolem-Gracefulness of k-Stars.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Historical Astronomy and Related Studies","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Stars; Horticulture; Astrophysics; Physics; Biology","score_opus":0.012578982035466119,"score_gpt":0.20688969446968625,"score_spread":0.19431071243422013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395362637","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18285498,0.008289125,0.090434335,0.0054125413,0.0010857868,0.00005171682,0.0011164224,0.0005966992,0.7101583],"genre_scores_gemma":[0.92517704,0.002110395,0.011867979,0.00081514736,0.0005005655,0.00003096322,0.00051884726,0.0001714706,0.058807626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994029,0.00014638467,0.000046049638,0.00015255081,0.00015523947,0.00009686598],"domain_scores_gemma":[0.9988507,0.00035599884,0.00014516925,0.00026624175,0.00025262736,0.00012921068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000799717,0.00040454665,0.00049506524,0.0016400487,0.002746692,0.0028537945,0.00065465947,0.00068471604,0.009805839],"category_scores_gemma":[0.0024925391,0.00030542637,0.0005820295,0.0017276364,0.0045734323,0.0062356987,0.0024968477,0.0021307506,0.002687924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027754833,0.000005826224,0.0001846991,0.000040827086,0.000004409485,0.000038591028,0.00019974868,0.000111454705,0.00019014835,0.9925835,0.0017644074,0.0048487093],"study_design_scores_gemma":[0.000009958346,0.000014046492,0.00040069225,0.000022588538,0.000007631783,0.0002100699,0.00013042838,0.0002913957,0.0003162841,0.9708363,0.027750531,0.000010140017],"about_ca_topic_score_codex":0.0012553553,"about_ca_topic_score_gemma":0.0013064016,"teacher_disagreement_score":0.009805839,"about_ca_system_score_codex":0.0015730477,"about_ca_system_score_gemma":0.0006553556,"threshold_uncertainty_score":0.032803774},"labels":[],"label_agreement":null},{"id":"W2395366427","doi":"","title":"On fractional (g, f, n)-critical graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.013403809083092168,"score_gpt":0.3065653111481694,"score_spread":0.2931615020650772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395366427","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6404915,0.0023561001,0.09021508,0.002975788,0.00060160476,0.00013944942,0.0006257126,0.00034160496,0.2622532],"genre_scores_gemma":[0.9540821,0.0008777013,0.018090889,0.00048130014,0.00020477652,0.00006678572,0.00051933044,0.000095277974,0.025581975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997389,0.000074268624,0.000008881913,0.000050412124,0.00004563612,0.00008190409],"domain_scores_gemma":[0.9988965,0.0004911566,0.00017436485,0.00008469959,0.0001249553,0.00022839378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003479382,0.0005268428,0.00044793182,0.002520719,0.0028580884,0.0015761033,0.000654955,0.0012158308,0.010210875],"category_scores_gemma":[0.0026772106,0.00035413253,0.00039712922,0.00091609673,0.0018615643,0.0024716354,0.0014924941,0.0011183599,0.0008130446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001226397,0.000024557596,0.00064899854,0.00009597565,0.000011066906,0.0003476795,0.0002976752,0.0030029486,0.0022417137,0.9794201,0.0052682157,0.008518393],"study_design_scores_gemma":[0.000023732011,0.000016019978,0.00046275376,0.000059346297,0.000011358978,0.00032496225,0.00030085698,0.0074040815,0.0010926625,0.9824928,0.007801304,0.000010013447],"about_ca_topic_score_codex":0.0023363605,"about_ca_topic_score_gemma":0.0038936203,"teacher_disagreement_score":0.010210875,"about_ca_system_score_codex":0.0015463135,"about_ca_system_score_gemma":0.00047487195,"threshold_uncertainty_score":0.034158766},"labels":[],"label_agreement":null},{"id":"W2395371912","doi":"","title":"Resolvable decompositions of λK n into the union of two 2-paths.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.004925125525984317,"score_gpt":0.21573895806039223,"score_spread":0.2108138325344079,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395371912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37703073,0.0008196759,0.42583466,0.0013144634,0.00034614146,0.0002397716,0.0029232106,0.0013789964,0.19011228],"genre_scores_gemma":[0.75629896,0.00053282117,0.16975185,0.00063991244,0.00011621475,0.00027352184,0.004051285,0.00057452923,0.0677608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990877,0.00020339307,0.000051304287,0.00022161708,0.00018069946,0.00025528215],"domain_scores_gemma":[0.9977871,0.0010545648,0.00027563472,0.00044772457,0.00020643476,0.00022844253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004968089,0.00053357356,0.0003939656,0.0011636436,0.001605498,0.0021814343,0.0010255069,0.0009491041,0.022005258],"category_scores_gemma":[0.0024505265,0.00063222455,0.00085659535,0.0009319516,0.0009516363,0.0027307356,0.0021408866,0.0018973371,0.0042621223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065846776,0.0002760314,0.0011310424,0.00026471508,0.000076771124,0.0009485973,0.0012728627,0.0072565796,0.015313251,0.9064954,0.013717432,0.05258887],"study_design_scores_gemma":[0.000078961966,0.00005700732,0.0012234949,0.00008698723,0.000036254754,0.0007377211,0.00049172755,0.013249608,0.006393697,0.95300573,0.024598364,0.000040415995],"about_ca_topic_score_codex":0.00085979764,"about_ca_topic_score_gemma":0.0018158624,"teacher_disagreement_score":0.022005258,"about_ca_system_score_codex":0.0008743765,"about_ca_system_score_gemma":0.00077819236,"threshold_uncertainty_score":0.073614955},"labels":[],"label_agreement":null},{"id":"W2395394216","doi":"","title":"On odd graceful graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.009157674903082835,"score_gpt":0.2104046251129762,"score_spread":0.20124695020989336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395394216","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4740932,0.0032074691,0.19793819,0.007118637,0.00065890676,0.00012952428,0.0024208478,0.0013985101,0.31303474],"genre_scores_gemma":[0.91852224,0.0014839415,0.03638182,0.0008607368,0.00039657814,0.00011464666,0.0013224555,0.00034740995,0.04057018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992235,0.0001935226,0.00003446781,0.0001799132,0.00015806427,0.00021062147],"domain_scores_gemma":[0.9974124,0.0012217963,0.00034118813,0.0005162834,0.00015075837,0.00035753805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000740736,0.00066484953,0.00063006324,0.0016484014,0.0020255444,0.002882643,0.0011161376,0.00092496397,0.011033044],"category_scores_gemma":[0.0030365703,0.00037717776,0.0006657746,0.0016394624,0.0026536211,0.0053766035,0.0024501265,0.001923409,0.0015237043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056516936,0.000022561297,0.00047636195,0.0000743751,0.0000074492764,0.000055489112,0.00015693235,0.0021467507,0.0008622054,0.97790456,0.006324287,0.011912422],"study_design_scores_gemma":[0.000010676947,0.000006724407,0.0002413723,0.000019604267,0.000007390177,0.000077405384,0.000096841846,0.0049555087,0.0005857027,0.9864347,0.007555456,0.000008633156],"about_ca_topic_score_codex":0.0019456022,"about_ca_topic_score_gemma":0.0030838065,"teacher_disagreement_score":0.011033044,"about_ca_system_score_codex":0.0017780631,"about_ca_system_score_gemma":0.0007303127,"threshold_uncertainty_score":0.036909282},"labels":[],"label_agreement":null},{"id":"W2395397426","doi":"","title":"Super connectivity and super arc connectivity of the Mycielskian of a digraph.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Digraph; Arc (geometry); Mathematics; Combinatorics; Geometry","score_opus":0.008938231889498707,"score_gpt":0.20313999902775584,"score_spread":0.19420176713825713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395397426","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5143766,0.0023165836,0.18165307,0.0024796363,0.00033688382,0.00008400429,0.0011580389,0.00024302164,0.2973522],"genre_scores_gemma":[0.95918775,0.0009945141,0.016650403,0.00040885952,0.00023649281,0.000083831066,0.0004054163,0.000059710743,0.021972997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997111,0.000085256484,0.000013900136,0.000058455826,0.000070603506,0.000060613445],"domain_scores_gemma":[0.99872965,0.00064289826,0.00017589804,0.00008537487,0.00016705645,0.00019921179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034805882,0.00031387756,0.00037234562,0.0015808761,0.0009829196,0.0013866791,0.00065008097,0.0006261378,0.010840412],"category_scores_gemma":[0.0022066652,0.0003106336,0.0004407241,0.0011293143,0.0014484513,0.0033710315,0.0012687589,0.0013334805,0.0007592664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018946535,0.0000059089975,0.00019677557,0.00002568005,0.0000035492567,0.00006206243,0.00007183134,0.00098536,0.0004285889,0.9943897,0.0010913236,0.0027201953],"study_design_scores_gemma":[0.000010579774,0.000014204434,0.0004766871,0.000015174815,0.000009483721,0.00019215108,0.000068574634,0.009953467,0.0002654344,0.9838071,0.0051779193,0.00000931936],"about_ca_topic_score_codex":0.0014685679,"about_ca_topic_score_gemma":0.0019986948,"teacher_disagreement_score":0.010840412,"about_ca_system_score_codex":0.0007449392,"about_ca_system_score_gemma":0.0004097418,"threshold_uncertainty_score":0.036264777},"labels":[],"label_agreement":null},{"id":"W2395417730","doi":"","title":"A Characterization of the planes secant to a non-singular quadric in PG(4, q).","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Quadric; Mathematics; Characterization (materials science); Pure mathematics; Mathematical analysis; Physics","score_opus":0.04788239277592627,"score_gpt":0.28328534372858466,"score_spread":0.2354029509526584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395417730","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7258536,0.00084622344,0.07587145,0.0017432501,0.00040231927,0.00011558403,0.0006483176,0.00030592302,0.19421332],"genre_scores_gemma":[0.96643996,0.00031547493,0.009725049,0.0002594781,0.0002477743,0.000031691343,0.0006141566,0.00011783391,0.02224864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994375,0.00011723516,0.000035559176,0.00012747911,0.0001789081,0.00010329641],"domain_scores_gemma":[0.9988373,0.00027345374,0.00026160834,0.00012409834,0.00021777985,0.00028582508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005367484,0.0008389805,0.00047583753,0.0027044485,0.0015511033,0.0029164115,0.0008643088,0.0007646038,0.012204683],"category_scores_gemma":[0.0019404533,0.0004104514,0.000496004,0.0014012061,0.0032618202,0.0029177386,0.0022097332,0.0024811954,0.0019619453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009411697,0.00002920642,0.0011724234,0.000038386832,0.0000110164865,0.0004358252,0.00056977273,0.0005043869,0.0026299357,0.9836078,0.0022360275,0.0086709745],"study_design_scores_gemma":[0.00005287235,0.00011866503,0.0030393878,0.000058035206,0.000025427873,0.0014526267,0.000855205,0.0071420716,0.0029971357,0.96016353,0.024058562,0.000036476933],"about_ca_topic_score_codex":0.0016047445,"about_ca_topic_score_gemma":0.0012087587,"teacher_disagreement_score":0.012204683,"about_ca_system_score_codex":0.0008420247,"about_ca_system_score_gemma":0.0003895095,"threshold_uncertainty_score":0.040828705},"labels":[],"label_agreement":null},{"id":"W2395430777","doi":"","title":"A summation formula related to q-Eulerian polynomials.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eulerian path; Pure mathematics; Lagrangian","score_opus":0.01847527406629998,"score_gpt":0.30680291567843326,"score_spread":0.2883276416121333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395430777","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11002162,0.008223823,0.36260852,0.005325783,0.0039243656,0.000055464687,0.00053338986,0.0004188346,0.50888824],"genre_scores_gemma":[0.7985044,0.0045262794,0.07463472,0.0018356966,0.0022994883,0.000081223065,0.00040839653,0.00037989567,0.11732999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996088,0.00009042164,0.000020952095,0.00006208173,0.00016094562,0.000056719702],"domain_scores_gemma":[0.9992631,0.00023617873,0.00008669113,0.000093137634,0.0002252662,0.0000956445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000837238,0.00046968917,0.00042353818,0.0015148369,0.0012317882,0.0016999397,0.00071693613,0.0006413993,0.008598024],"category_scores_gemma":[0.0029810583,0.00020869615,0.00048405852,0.0015481513,0.0015258539,0.0042972984,0.0015560455,0.0019132192,0.002719962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071474137,0.000007775763,0.00009328198,0.00002486631,0.0000023415573,0.00004997402,0.00007170864,0.000164567,0.0006080696,0.98901796,0.0028923852,0.0070598484],"study_design_scores_gemma":[0.000004753998,0.000008051647,0.00018761471,0.00001786893,0.000005774973,0.00018959792,0.00003236429,0.0029840958,0.00043279145,0.9856289,0.010501553,0.0000064664414],"about_ca_topic_score_codex":0.0007483795,"about_ca_topic_score_gemma":0.0009870209,"teacher_disagreement_score":0.008598024,"about_ca_system_score_codex":0.0007669707,"about_ca_system_score_gemma":0.0006121236,"threshold_uncertainty_score":0.028763294},"labels":[],"label_agreement":null},{"id":"W2395431039","doi":"","title":"Notes on Hamiltonian Graphs and Hamiltonian-Connected Graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hamiltonian path problem; Hamiltonian (control theory); Hamiltonian path; Indifference graph; Chordal graph; Combinatorics; Pancyclic graph; 1-planar graph; Graph; Mathematical optimization","score_opus":0.014352649610265684,"score_gpt":0.2559067875107385,"score_spread":0.24155413790047278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395431039","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015102259,0.08370073,0.051691465,0.032820415,0.021177763,0.00005718912,0.002107095,0.0004923952,0.7928507],"genre_scores_gemma":[0.3916003,0.12599279,0.047106553,0.020212905,0.033567127,0.0002808543,0.0036567918,0.0006079214,0.3769747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996151,0.00008649898,0.00002045801,0.00007083607,0.00015878206,0.00004838466],"domain_scores_gemma":[0.99870646,0.00085228984,0.00006735284,0.000111379944,0.000128117,0.00013440113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065371214,0.0010460404,0.00072425476,0.0027950453,0.0009611937,0.0015391653,0.001033305,0.0011367914,0.025154637],"category_scores_gemma":[0.002548344,0.00038553693,0.0005914763,0.0043348535,0.0025373418,0.0031678334,0.0012269906,0.003564822,0.00437643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025654112,0.000035244313,0.00017134567,0.00027556633,0.000027452197,0.00016029723,0.00020878427,0.00085306534,0.00051408634,0.86886966,0.10172522,0.027133588],"study_design_scores_gemma":[0.0000112903435,0.000012811974,0.00047848787,0.00006467094,0.000013653501,0.0001635026,0.00008545997,0.0005350257,0.0001937402,0.9120632,0.08636747,0.000010688676],"about_ca_topic_score_codex":0.0027007677,"about_ca_topic_score_gemma":0.004261161,"teacher_disagreement_score":0.025154637,"about_ca_system_score_codex":0.0015029766,"about_ca_system_score_gemma":0.000720405,"threshold_uncertainty_score":0.08415067},"labels":[],"label_agreement":null},{"id":"W2395438483","doi":"","title":"The 2-(v, 13, 1) designs with block transitive automorphism.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Transitive relation; Automorphism; Block (permutation group theory); Automorphism group; Combinatorics; Discrete mathematics; Pure mathematics","score_opus":0.0065916720524819014,"score_gpt":0.1721693952279605,"score_spread":0.16557772317547859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395438483","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2704145,0.0013034535,0.34128162,0.0014247183,0.0009832463,0.00049403874,0.0021407104,0.0012719592,0.38068566],"genre_scores_gemma":[0.834983,0.00063614507,0.08286335,0.00062091294,0.00016648462,0.00047370317,0.0009974341,0.00023632825,0.07902267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900216,0.0003426431,0.00005094759,0.00016323359,0.00021448919,0.00022654097],"domain_scores_gemma":[0.99905735,0.0002158439,0.0001695691,0.0002859486,0.00018102098,0.000090186564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006364769,0.00056775165,0.00042657412,0.0008935175,0.0011837453,0.002158308,0.00059847056,0.0011369924,0.016057089],"category_scores_gemma":[0.002087112,0.00040815127,0.00058151106,0.00068124256,0.0009508623,0.00135623,0.000976076,0.0008092541,0.004043549],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002331387,0.000046601956,0.00035306683,0.00009263593,0.000026939908,0.00019496994,0.00015365561,0.0035186766,0.0065077245,0.9544455,0.007778234,0.026648672],"study_design_scores_gemma":[0.00015416941,0.00017949441,0.00070845126,0.000107835134,0.000044026576,0.00055926555,0.00018539415,0.021339538,0.0099712415,0.9140991,0.052590586,0.000060935683],"about_ca_topic_score_codex":0.0011510388,"about_ca_topic_score_gemma":0.0019857292,"teacher_disagreement_score":0.016057089,"about_ca_system_score_codex":0.0008452567,"about_ca_system_score_gemma":0.0013120483,"threshold_uncertainty_score":0.05371636},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Wiener index; Polarity (international relations); Index (typography); Graph; Statistics; Combinatorics; Chemistry; Computer science","score_opus":0.01753218901229056,"score_gpt":0.26449621598101075,"score_spread":0.2469640269687202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395452549","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38374087,0.005752184,0.13543625,0.003716628,0.0015703647,0.00005646012,0.0012774154,0.00038564546,0.46806425],"genre_scores_gemma":[0.9479287,0.0029189263,0.012801828,0.00046686182,0.0011421607,0.000066393215,0.00053154025,0.00022603667,0.03391761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994473,0.00011130907,0.000032195094,0.00010164164,0.00019951242,0.0001080562],"domain_scores_gemma":[0.99873644,0.0004425741,0.00022172305,0.00014263377,0.00024456828,0.00021213372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061763346,0.00053970335,0.0005707886,0.004478958,0.0012172306,0.00380787,0.0006101659,0.000815366,0.008098797],"category_scores_gemma":[0.0036591615,0.00030968085,0.0003528797,0.0018689425,0.0021689867,0.007619707,0.0018041802,0.0015122513,0.002321502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026250109,0.000006779664,0.00027972972,0.000029144196,0.0000049817304,0.00003953301,0.00008937715,0.00023564998,0.0010547868,0.98737156,0.0019538016,0.008908387],"study_design_scores_gemma":[0.0000045139814,0.000009140398,0.0005011982,0.000020262196,0.000006537066,0.00014287874,0.00007870567,0.0021961688,0.00092028634,0.9899132,0.006195551,0.000011504956],"about_ca_topic_score_codex":0.000493724,"about_ca_topic_score_gemma":0.00054971175,"teacher_disagreement_score":0.008098797,"about_ca_system_score_codex":0.0009684731,"about_ca_system_score_gemma":0.00034434546,"threshold_uncertainty_score":0.027093232},"labels":[],"label_agreement":null},{"id":"W2395461626","doi":"","title":"Extremal degree resistance distances in fully loaded unicyclic graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Fiber-reinforced polymer composites","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Combinatorics; Physics; Acoustics","score_opus":0.021887201483474374,"score_gpt":0.2197334116105676,"score_spread":0.19784621012709325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395461626","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9131437,0.0006578453,0.033663034,0.0007558752,0.000100674515,0.000034924855,0.00041726115,0.00026438865,0.0509623],"genre_scores_gemma":[0.99064773,0.00025548614,0.0038074492,0.000062877276,0.000031894382,0.000028899434,0.00013987753,0.00005222158,0.004973561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996383,0.00009144764,0.000015573629,0.00006762271,0.00009401098,0.00009290784],"domain_scores_gemma":[0.9981122,0.00096485665,0.00033790962,0.00017373697,0.00013443879,0.0002768063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032253243,0.0003954157,0.00037354216,0.0012942151,0.0007741141,0.0013332627,0.0007701654,0.00096967485,0.007891294],"category_scores_gemma":[0.0040739784,0.00029241698,0.00020318912,0.0005432363,0.0008952517,0.0015091196,0.0012716522,0.0009486169,0.00086242653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052888534,0.00012563255,0.0020268813,0.00028824102,0.00005042942,0.0005678298,0.0004907996,0.0492939,0.024182802,0.8801384,0.0076333643,0.03467284],"study_design_scores_gemma":[0.00008254246,0.0001670383,0.003417734,0.000102237675,0.000045417994,0.0010116675,0.00052976335,0.16816762,0.01213941,0.80639,0.007872469,0.00007401444],"about_ca_topic_score_codex":0.00040965396,"about_ca_topic_score_gemma":0.0008561564,"teacher_disagreement_score":0.007891294,"about_ca_system_score_codex":0.00067713036,"about_ca_system_score_gemma":0.00022833723,"threshold_uncertainty_score":0.026399016},"labels":[],"label_agreement":null},{"id":"W2395515199","doi":"","title":"Equality of Domination and Inverse Domination Numbers.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dominating set; Domination analysis; Vertex (graph theory); Inverse; Combinatorics; Tamil; Graph; Cardinality (data modeling); Computer science; Database","score_opus":0.014905004661871913,"score_gpt":0.29407056282698424,"score_spread":0.27916555816511235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395515199","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53773123,0.0056713433,0.20793588,0.0019374297,0.00060951954,0.00016015364,0.001449408,0.00031169623,0.24419332],"genre_scores_gemma":[0.97823095,0.00053073175,0.01423853,0.00010018749,0.00016716933,0.0000529024,0.00024023255,0.000024849302,0.0064143087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971916,0.000646895,0.00021580908,0.00077039783,0.0007192608,0.0004560712],"domain_scores_gemma":[0.9916181,0.005534481,0.0007681656,0.00060229073,0.0009427024,0.0005342612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014625932,0.00045590088,0.0005233792,0.002272563,0.0011085295,0.0025311655,0.00069213985,0.0005432105,0.0047975387],"category_scores_gemma":[0.010786963,0.00030056707,0.00052029407,0.0018993979,0.0028509465,0.0035172328,0.0013472423,0.0010410026,0.00043660818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035345033,0.000054573808,0.0067772786,0.00026775367,0.000057466998,0.00050554227,0.00077171385,0.006508344,0.007012771,0.895449,0.0042315153,0.07801065],"study_design_scores_gemma":[0.000053389645,0.00011530141,0.007332901,0.000080721045,0.00008543593,0.003038529,0.00048744012,0.02232431,0.0072841286,0.9321201,0.027017778,0.000059965103],"about_ca_topic_score_codex":0.0007552444,"about_ca_topic_score_gemma":0.00073649734,"teacher_disagreement_score":0.0047975387,"about_ca_system_score_codex":0.0012882333,"about_ca_system_score_gemma":0.00045773725,"threshold_uncertainty_score":0.016049385},"labels":[],"label_agreement":null},{"id":"W2395538327","doi":"","title":"Applications of strongly transitive geometric spacves to n-ary hypergroups.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Transitive relation; Pure mathematics; Combinatorics","score_opus":0.017167621558094127,"score_gpt":0.2812122398902764,"score_spread":0.26404461833218223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395538327","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18267213,0.0060331235,0.24684967,0.004229382,0.0019343322,0.00011865357,0.000358299,0.0006876123,0.5571167],"genre_scores_gemma":[0.90161663,0.002542818,0.043575518,0.0005977937,0.0007872353,0.000094104595,0.00028738883,0.00018910509,0.05030939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937695,0.00023056919,0.000038251375,0.0000999068,0.00016621029,0.00008819931],"domain_scores_gemma":[0.9992236,0.0002770836,0.00008090013,0.00015270608,0.000110230336,0.00015551092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005795634,0.0006737037,0.00054611586,0.0017022103,0.0020391238,0.0019949935,0.0006870787,0.0007554938,0.010961619],"category_scores_gemma":[0.0025079085,0.0003035117,0.0008450485,0.0011833197,0.0027615998,0.003203855,0.003976874,0.0019731028,0.0015148838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016786918,0.000014219832,0.00013532468,0.000030745818,0.000007687501,0.00007956504,0.00019704165,0.0007199124,0.00045348998,0.98829365,0.0013309371,0.008720582],"study_design_scores_gemma":[0.0000068702416,0.0000112177095,0.000109667024,0.000013658573,0.0000046680207,0.00010189718,0.00011793244,0.0020514657,0.00030527796,0.98863643,0.008633917,0.0000069614493],"about_ca_topic_score_codex":0.0010331568,"about_ca_topic_score_gemma":0.0015531464,"teacher_disagreement_score":0.010961619,"about_ca_system_score_codex":0.0011110356,"about_ca_system_score_gemma":0.00048076973,"threshold_uncertainty_score":0.036670268},"labels":[],"label_agreement":null},{"id":"W2395553504","doi":"","title":"A Fixed Point Theorem For Weakly Compatible Mappings Satisfying A General Contractive Condition Of Operator Type.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Fixed Point Theorems Analysis","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Type (biology); Fixed-point theorem; Operator (biology); Fixed point; Pure mathematics; Discrete mathematics; Mathematical analysis","score_opus":0.020838612261064253,"score_gpt":0.2841351569847702,"score_spread":0.26329654472370595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395553504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15278144,0.0025460382,0.6436936,0.003669093,0.0006930535,0.00015369707,0.00055740325,0.00026013138,0.19564556],"genre_scores_gemma":[0.85873485,0.0017304933,0.09339277,0.0009499142,0.0007836527,0.00037329775,0.0005452381,0.00019141793,0.04329834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892104,0.00030242192,0.000063799496,0.00025792437,0.00033790027,0.00011691618],"domain_scores_gemma":[0.9967981,0.0019161477,0.0002076806,0.00033901617,0.00047631387,0.00026277485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029964808,0.00080107606,0.0009289648,0.0023188528,0.0018558328,0.0028024097,0.0014392094,0.0019325562,0.008309473],"category_scores_gemma":[0.007564909,0.00045163726,0.0019468793,0.0014430116,0.0038436775,0.007930251,0.003386787,0.0037377242,0.0009082802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013214538,0.000009860047,0.00011309715,0.000021522032,0.000009807033,0.000059587957,0.000068681664,0.00030635844,0.0005504866,0.9965222,0.00051898055,0.0018061642],"study_design_scores_gemma":[0.000021064925,0.00002521454,0.00019897278,0.000019794214,0.000018434619,0.00015611046,0.000059204776,0.0061287554,0.00052378344,0.9899885,0.0028503914,0.000009764815],"about_ca_topic_score_codex":0.0009570012,"about_ca_topic_score_gemma":0.0006373774,"teacher_disagreement_score":0.008309473,"about_ca_system_score_codex":0.00172473,"about_ca_system_score_gemma":0.00091489614,"threshold_uncertainty_score":0.027797997},"labels":[],"label_agreement":null},{"id":"W2395566361","doi":"","title":"Calculation of the Wiener, Szeged, and PI indices of a certain nanostar dendrimer.","year":2011,"lang":"hu","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Dendrimer; Mathematics; Pi; Pure mathematics; Chemistry; Polymer chemistry; Geometry","score_opus":0.029903053051812418,"score_gpt":0.25670870922202754,"score_spread":0.22680565617021511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395566361","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86521465,0.0006690768,0.07251631,0.00028748516,0.00016052682,0.000038500944,0.00026341176,0.00021735314,0.06063274],"genre_scores_gemma":[0.9683515,0.00031793074,0.020089425,0.000047732854,0.000017512624,0.000040392224,0.00021492051,0.00008760714,0.010833076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9999473,0.000004975828,0.0000031349757,0.000007980706,0.000024772764,0.000011852575],"domain_scores_gemma":[0.9999137,0.000017712853,0.000013523391,0.000018038781,0.00001800312,0.000019084846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001490403,0.00024587297,0.000248776,0.0009999841,0.00052033126,0.00046362003,0.00049913075,0.00041608536,0.004399969],"category_scores_gemma":[0.00036343344,0.000113012386,0.00021743121,0.00043012798,0.00043835593,0.0010451453,0.00054280314,0.00050761935,0.00065235316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009787338,0.000053808166,0.0007379396,0.00013249432,0.000017600843,0.00030019428,0.00021897952,0.008056126,0.04841597,0.9242876,0.001873459,0.01580811],"study_design_scores_gemma":[0.000059065052,0.00017747226,0.0033129728,0.000065306136,0.000037016005,0.0009490935,0.00038301374,0.18746203,0.10554304,0.68401766,0.017904023,0.00008942907],"about_ca_topic_score_codex":0.0002769806,"about_ca_topic_score_gemma":0.0006157532,"teacher_disagreement_score":0.004399969,"about_ca_system_score_codex":0.00042055416,"about_ca_system_score_gemma":0.00027473114,"threshold_uncertainty_score":0.014719307},"labels":[],"label_agreement":null},{"id":"W2395605843","doi":"","title":"Continuous Mappings And Bounded Linear Operators In Fuzzy n-Normed Linear Spaces.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Fixed Point Theorems Analysis","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Continuous linear operator; Linear operators; Bounded operator; Bounded function; Fuzzy logic; Bounded inverse theorem; Operator theory; Operator norm; Pure mathematics; Discrete mathematics; Mathematical analysis; Computer science; Artificial intelligence","score_opus":0.018286576415024056,"score_gpt":0.27335548828458694,"score_spread":0.2550689118695629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395605843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24530804,0.010305977,0.6041546,0.0050825304,0.0008081833,0.0000693412,0.000447477,0.0002914383,0.13353245],"genre_scores_gemma":[0.8941545,0.003096636,0.062104005,0.0005425506,0.00065523747,0.00012213891,0.00030184444,0.00008872789,0.038934413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919575,0.00031537013,0.000043815657,0.00012775225,0.00024152058,0.00007572841],"domain_scores_gemma":[0.9978483,0.0012334365,0.00021918694,0.00016003031,0.00031307503,0.00022592397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017558684,0.00079698506,0.0006608816,0.0020348227,0.0012218824,0.0021974265,0.0008823537,0.0009144002,0.0055564423],"category_scores_gemma":[0.004508102,0.00032627306,0.0009797912,0.0012202407,0.003006046,0.0040978873,0.0020290348,0.00256274,0.00072749244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016732534,0.000010257268,0.00012997819,0.000034874458,0.000013437981,0.00006333839,0.000112721806,0.0010274651,0.00061768637,0.9935057,0.0006894651,0.0037782183],"study_design_scores_gemma":[0.0000082950955,0.000021128439,0.0002326782,0.000020300118,0.000010190791,0.00006981518,0.000091870585,0.010391207,0.00028386465,0.98657376,0.002287167,0.00000957612],"about_ca_topic_score_codex":0.0018132378,"about_ca_topic_score_gemma":0.0017997168,"teacher_disagreement_score":0.0055564423,"about_ca_system_score_codex":0.0016536484,"about_ca_system_score_gemma":0.0005331049,"threshold_uncertainty_score":0.018588126},"labels":[],"label_agreement":null},{"id":"W2395608997","doi":"","title":"Signed total k-domination in graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.010246913771740866,"score_gpt":0.25610357869985884,"score_spread":0.24585666492811797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395608997","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6073851,0.0016206767,0.19645895,0.002304457,0.00042297298,0.00011942858,0.001414023,0.0008109688,0.1894633],"genre_scores_gemma":[0.9509081,0.00059585716,0.01409698,0.00037630415,0.00013167784,0.00007042268,0.0006379386,0.00014834406,0.03303427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992187,0.00018495189,0.000056658162,0.00015046926,0.00022709867,0.00016197555],"domain_scores_gemma":[0.99671715,0.0014247762,0.00044858872,0.0004406794,0.0005562433,0.0004126363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006402242,0.00041688397,0.0004334137,0.0013197906,0.0013649208,0.002481107,0.0008218705,0.0006846893,0.009506713],"category_scores_gemma":[0.00421504,0.00030827164,0.00049623055,0.0015296725,0.001601912,0.003835585,0.0017712936,0.0010465916,0.0012335518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015658773,0.000056834622,0.0022028447,0.00027425028,0.00005203202,0.00039331513,0.00072705623,0.0034657973,0.0060343095,0.9305075,0.008348766,0.047780674],"study_design_scores_gemma":[0.000032049134,0.000032492982,0.0011430971,0.000054253625,0.00003521403,0.0006409152,0.0003298917,0.009580099,0.0031518145,0.97165304,0.013320889,0.00002627653],"about_ca_topic_score_codex":0.00085958175,"about_ca_topic_score_gemma":0.0017060123,"teacher_disagreement_score":0.009506713,"about_ca_system_score_codex":0.0010190596,"about_ca_system_score_gemma":0.0006822564,"threshold_uncertainty_score":0.03180307},"labels":[],"label_agreement":null},{"id":"W2395614034","doi":"","title":"Fundamental relation on (m, n)-ary hypermodules over (m, n)-ary hyperrings.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Fuzzy and Soft Set Theory","field":"Decision Sciences","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Relation (database); Pure mathematics; Computer science; Data mining","score_opus":0.03548676890682726,"score_gpt":0.31734998585505175,"score_spread":0.28186321694822447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395614034","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36587414,0.00359721,0.44956732,0.0028125448,0.00061502523,0.00019946524,0.0009801768,0.00027526804,0.17607878],"genre_scores_gemma":[0.9206085,0.00084826106,0.05738979,0.0005022961,0.00066432776,0.00017810057,0.00039224763,0.00005316383,0.019363264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790466,0.0006222894,0.00020421592,0.00046573242,0.00048872497,0.0003144227],"domain_scores_gemma":[0.99721235,0.0011602378,0.00047246032,0.0002931699,0.00039133464,0.000470532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025213223,0.0004145848,0.0005829753,0.0022712057,0.0020415918,0.0040322766,0.00077220623,0.0010514446,0.0064840135],"category_scores_gemma":[0.0034573034,0.00042654114,0.00090960914,0.0014030995,0.004341912,0.006540461,0.003311031,0.0018855392,0.0008900685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021046475,0.000012344404,0.00018008692,0.000026736152,0.000009916217,0.000045303972,0.00018838908,0.00023888331,0.00079777325,0.99347866,0.0004913118,0.004509517],"study_design_scores_gemma":[0.000014027859,0.000029923613,0.00038649508,0.000018362234,0.000009627985,0.0001630674,0.00009639142,0.0016558354,0.00057927455,0.9914858,0.005547494,0.000013755237],"about_ca_topic_score_codex":0.0004881581,"about_ca_topic_score_gemma":0.00063574425,"teacher_disagreement_score":0.0064840135,"about_ca_system_score_codex":0.0014583368,"about_ca_system_score_gemma":0.0007310835,"threshold_uncertainty_score":0.021691144},"labels":[],"label_agreement":null},{"id":"W2395619758","doi":"","title":"Some Algebraic Properties of Bi-Circulant Digraphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Circulant matrix; Algebraic number; Algebra over a field; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.008606228150471393,"score_gpt":0.1786170384313558,"score_spread":0.17001081028088438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395619758","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34251767,0.002735116,0.28286168,0.0030123512,0.0004887669,0.00020529427,0.0022319844,0.00048755202,0.36545962],"genre_scores_gemma":[0.9358935,0.0014568872,0.030818775,0.00066496513,0.00040278476,0.000107551175,0.0010266233,0.0000957595,0.029533224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949193,0.00011875734,0.00003263576,0.00011457502,0.00015050467,0.00009158749],"domain_scores_gemma":[0.9975145,0.0011503755,0.00039163954,0.00020543383,0.0004219029,0.0003162017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043685257,0.00038928122,0.0004102853,0.002145544,0.0017205554,0.0030527185,0.0006437384,0.00081074995,0.010841937],"category_scores_gemma":[0.0032582115,0.00038342996,0.00045641986,0.002155096,0.0013979297,0.0026982902,0.0010139719,0.0014588104,0.0012902478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015862171,0.000023943056,0.0002294045,0.00004902527,0.000008051246,0.00012103903,0.0001453473,0.00092749734,0.0009512053,0.98946,0.002052461,0.006016213],"study_design_scores_gemma":[0.00001531661,0.000019160958,0.00044449474,0.000026374726,0.000014985377,0.00037123114,0.00013299123,0.008073415,0.0005917121,0.98013365,0.010160794,0.000015855767],"about_ca_topic_score_codex":0.0014398812,"about_ca_topic_score_gemma":0.002418423,"teacher_disagreement_score":0.010841937,"about_ca_system_score_codex":0.0014042023,"about_ca_system_score_gemma":0.00069174456,"threshold_uncertainty_score":0.036269903},"labels":[],"label_agreement":null},{"id":"W2395632454","doi":"","title":"On Graceful Unicyclic Wheels.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematics and Applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.026892220709214817,"score_gpt":0.29477144574490555,"score_spread":0.2678792250356907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395632454","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43275174,0.0039101862,0.13767396,0.0021683846,0.0018463699,0.0001497011,0.001683215,0.0010597399,0.41875663],"genre_scores_gemma":[0.907093,0.0017272064,0.010613439,0.00044300134,0.0004018467,0.0000683783,0.0006751902,0.00028672547,0.078691185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993735,0.000087970264,0.00003153873,0.00010783699,0.00019585411,0.0002033114],"domain_scores_gemma":[0.9991073,0.00025002687,0.00014720741,0.00015383832,0.0001058943,0.00023576793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003974978,0.000623528,0.00057384634,0.0019102696,0.0017399663,0.0022816728,0.00069481024,0.0006805413,0.015486562],"category_scores_gemma":[0.0019431075,0.00033736374,0.0005810382,0.0012452697,0.0020766933,0.0024138843,0.003720632,0.0015771826,0.002876214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004157503,0.000014212614,0.00025625937,0.00005242011,0.0000072637667,0.00012362443,0.00017846657,0.0011475869,0.001027837,0.9839653,0.0030112907,0.010174239],"study_design_scores_gemma":[0.000017111983,0.00002220999,0.00045057829,0.00003711359,0.000011941579,0.00019751045,0.00012756174,0.0038527143,0.0008408183,0.9760671,0.018355193,0.00002007135],"about_ca_topic_score_codex":0.0028082165,"about_ca_topic_score_gemma":0.0035908138,"teacher_disagreement_score":0.015486562,"about_ca_system_score_codex":0.0012044304,"about_ca_system_score_gemma":0.0005160868,"threshold_uncertainty_score":0.05180776},"labels":[],"label_agreement":null},{"id":"W2395649781","doi":"","title":"Decompositions of graphs into cycles of length seven and single edges","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Partition (number theory); Graph; Enhanced Data Rates for GSM Evolution; 1-planar graph; Discrete mathematics; Chordal graph; Computer science","score_opus":0.013324479199732673,"score_gpt":0.21480825437378137,"score_spread":0.2014837751740487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395649781","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74312294,0.0014269971,0.2007154,0.0007118636,0.00011538901,0.00027173618,0.00149993,0.0003835182,0.05175219],"genre_scores_gemma":[0.88269943,0.00049329264,0.10386462,0.00030500616,0.000054333203,0.00020299361,0.0020089375,0.00012287893,0.010248553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943644,0.00010942211,0.000039210106,0.00013666785,0.00011969308,0.00015851994],"domain_scores_gemma":[0.9981741,0.00056972035,0.00030529674,0.0003983307,0.00021401176,0.00033843116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046226324,0.00050129084,0.0003402194,0.0014500458,0.00086949795,0.0011140386,0.000465251,0.00045254378,0.0040756213],"category_scores_gemma":[0.0017135213,0.00040472505,0.0006668911,0.00080694316,0.000990398,0.0012807302,0.0010544037,0.0008685055,0.00062944775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071350415,0.00023066475,0.006276287,0.00054137746,0.00012224616,0.0007831701,0.0013858767,0.03994117,0.047086395,0.7974787,0.01317812,0.09226255],"study_design_scores_gemma":[0.000113667316,0.00015838062,0.0042687124,0.00016722409,0.00008337853,0.0010013209,0.0008117544,0.08510556,0.01747009,0.86702955,0.02374519,0.000045221583],"about_ca_topic_score_codex":0.001442651,"about_ca_topic_score_gemma":0.0028348363,"teacher_disagreement_score":0.0040756213,"about_ca_system_score_codex":0.0010885493,"about_ca_system_score_gemma":0.00061048265,"threshold_uncertainty_score":0.013634324},"labels":[],"label_agreement":null},{"id":"W2395661573","doi":"","title":"A Note on General Neighbor-Distinguishing Total Coloring of Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Complete coloring; Combinatorics; Edge coloring; Brooks' theorem; 1-planar graph; Graph; Chordal graph; Line graph","score_opus":0.016497075075628122,"score_gpt":0.24646415658847246,"score_spread":0.22996708151284434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395661573","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04921685,0.009851089,0.55529934,0.012326761,0.0054717916,0.00015632709,0.0014150823,0.0013558561,0.3649069],"genre_scores_gemma":[0.614294,0.0124943685,0.29777578,0.0076527107,0.004496036,0.00030726235,0.001942977,0.0010113212,0.060025714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984956,0.0003994168,0.000065631844,0.00042311708,0.00044333813,0.0001728872],"domain_scores_gemma":[0.99484766,0.0032576036,0.00014451772,0.0010883348,0.00035517468,0.00030662576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021522902,0.0009807723,0.0010319774,0.0016499378,0.0021300348,0.0027309046,0.0026363817,0.0014720093,0.009362495],"category_scores_gemma":[0.0067977156,0.0006557679,0.001183667,0.002839342,0.0036291957,0.0066051604,0.0034728453,0.0057289293,0.001311122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074051655,0.0000459507,0.00055914663,0.00022423166,0.00002131173,0.00013484785,0.00015200471,0.0039465656,0.0013058598,0.94531786,0.024905104,0.023312964],"study_design_scores_gemma":[0.000012473722,0.000021856913,0.00039313582,0.000034800934,0.000023142944,0.00022990817,0.00006629379,0.009399023,0.0006487091,0.9596027,0.02954985,0.00001800301],"about_ca_topic_score_codex":0.0033248258,"about_ca_topic_score_gemma":0.0061282967,"teacher_disagreement_score":0.009362495,"about_ca_system_score_codex":0.0021071336,"about_ca_system_score_gemma":0.0011577735,"threshold_uncertainty_score":0.03132063},"labels":[],"label_agreement":null},{"id":"W2395673640","doi":"","title":"Feedback Number of Generalized Kautz Digraphs GK(2, n).","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arithmetic; Combinatorics","score_opus":0.008347526522832854,"score_gpt":0.2317459165341247,"score_spread":0.22339839001129186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395673640","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8719683,0.0007382327,0.049154464,0.0024265253,0.00016340798,0.00010086687,0.0026105465,0.0007114829,0.07212612],"genre_scores_gemma":[0.9856631,0.00015143513,0.0041340254,0.00021067378,0.000055501147,0.00005741398,0.00046879437,0.000039820658,0.009219276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999514,0.00011777218,0.000018938435,0.00010808269,0.000104559906,0.00013665199],"domain_scores_gemma":[0.9975108,0.0013132296,0.00030958414,0.00023418452,0.00023846158,0.0003937993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044503657,0.00034772465,0.00054841413,0.00081519235,0.001224673,0.0017471727,0.0008329215,0.0008022945,0.010220365],"category_scores_gemma":[0.003527362,0.00024968825,0.00026496945,0.0005964621,0.001025737,0.0025913294,0.0009441629,0.0008978567,0.0008975014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000633436,0.000086167216,0.0016095471,0.00027322245,0.000032521883,0.00023021857,0.00033549644,0.013523867,0.007723132,0.9440507,0.010336764,0.02116475],"study_design_scores_gemma":[0.00015904335,0.000100122925,0.0018697962,0.00006790497,0.00004188398,0.00037993045,0.00018123332,0.04580529,0.005211139,0.9380034,0.008127281,0.000052988995],"about_ca_topic_score_codex":0.0012825845,"about_ca_topic_score_gemma":0.0023131894,"teacher_disagreement_score":0.010220365,"about_ca_system_score_codex":0.0015428894,"about_ca_system_score_gemma":0.0011272571,"threshold_uncertainty_score":0.034190595},"labels":[],"label_agreement":null},{"id":"W2395698093","doi":"","title":"The hyper-Wiener index of trees with given parameters.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Wiener index; Index (typography); Statistics; Combinatorics; Computer science; Graph","score_opus":0.015507102631195598,"score_gpt":0.2561871999893441,"score_spread":0.2406800973581485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395698093","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5590819,0.004290449,0.23859605,0.002148612,0.000644674,0.000056942783,0.0011973799,0.0005897919,0.19339411],"genre_scores_gemma":[0.94335693,0.0016003414,0.025483985,0.00028902278,0.0005043248,0.00008600156,0.00051590946,0.0003080395,0.027855394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993643,0.00016577097,0.000037698974,0.00011900973,0.00019031999,0.00012293877],"domain_scores_gemma":[0.9979803,0.00076708954,0.00039543217,0.00023651075,0.00027711017,0.00034355873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087786716,0.00051620166,0.00073290453,0.004134893,0.0012476399,0.0039020032,0.00097497925,0.0013805322,0.007251084],"category_scores_gemma":[0.005295672,0.0004026969,0.0004121513,0.0023924788,0.0021771207,0.0066574183,0.0020466968,0.0017053101,0.0021646246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040935138,0.000010331602,0.00040251162,0.00003791171,0.000010546824,0.000058298585,0.00016664821,0.0010352067,0.0017182436,0.98749197,0.0012757711,0.0077516222],"study_design_scores_gemma":[0.0000059882536,0.000009895829,0.0005275242,0.000026146787,0.000009082577,0.00013828576,0.00008653298,0.008283809,0.00094987283,0.98646104,0.0034872394,0.000014612164],"about_ca_topic_score_codex":0.0005610379,"about_ca_topic_score_gemma":0.00081750855,"teacher_disagreement_score":0.007251084,"about_ca_system_score_codex":0.0011872131,"about_ca_system_score_gemma":0.0004094008,"threshold_uncertainty_score":0.024257302},"labels":[],"label_agreement":null},{"id":"W2395706617","doi":"","title":"Trees with the second and third largest number of maximal independent sets.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Statistics","score_opus":0.010027530289241016,"score_gpt":0.26499360853963644,"score_spread":0.2549660782503954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395706617","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49305558,0.003288648,0.27544805,0.005751435,0.0007909393,0.00028744675,0.014723969,0.0025837698,0.20407006],"genre_scores_gemma":[0.86316144,0.00082128786,0.09795861,0.00081436825,0.00034252193,0.00020775333,0.0057266606,0.0003970017,0.03057037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999231,0.00013001566,0.000044546756,0.00016967622,0.00019509844,0.00022969894],"domain_scores_gemma":[0.99432206,0.0028133306,0.0006536715,0.0008803707,0.0005267412,0.00080376636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005635937,0.00045934442,0.00087686605,0.0012573184,0.0022125388,0.0030004636,0.0011123562,0.0017471695,0.010750588],"category_scores_gemma":[0.006319824,0.0006484542,0.0009933558,0.0015763547,0.0011985376,0.002942884,0.0014769969,0.0018169095,0.002813933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062229275,0.00020147447,0.005294916,0.0003971121,0.0001211451,0.0013852725,0.0005867638,0.0056081843,0.023684166,0.85467327,0.048692074,0.058733445],"study_design_scores_gemma":[0.00010208305,0.00006871681,0.005385533,0.000121127814,0.00015530204,0.0035566136,0.00033484498,0.014743532,0.014285535,0.91635835,0.044837918,0.00005054615],"about_ca_topic_score_codex":0.0009148006,"about_ca_topic_score_gemma":0.0021268548,"teacher_disagreement_score":0.010750588,"about_ca_system_score_codex":0.0010590749,"about_ca_system_score_gemma":0.0012372679,"threshold_uncertainty_score":0.03596431},"labels":[],"label_agreement":null},{"id":"W2395713685","doi":"","title":"On Szeged polynomial of graphs with even number of vertices.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.012713214060469302,"score_gpt":0.27015730312837455,"score_spread":0.2574440890679052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395713685","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6049342,0.0064410255,0.1493345,0.006973162,0.0013386236,0.00009017894,0.0018907328,0.0005112094,0.22848628],"genre_scores_gemma":[0.953901,0.0024579687,0.014494329,0.0005592686,0.00076134945,0.00006336394,0.00081174873,0.00017144263,0.026779583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931014,0.0001621853,0.000024366907,0.00013328702,0.00016026734,0.00020971609],"domain_scores_gemma":[0.9983028,0.0008555747,0.0002983307,0.00015286614,0.00017026099,0.00022006089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007016975,0.0008542134,0.001021437,0.003266156,0.0014294118,0.0022684215,0.0013281456,0.000950855,0.010616779],"category_scores_gemma":[0.0037728802,0.00042930685,0.0010894337,0.0024764072,0.0033339064,0.0052133203,0.0019982213,0.0030733105,0.002019997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007870688,0.000027869664,0.00035731017,0.00011486292,0.000012915894,0.00009772109,0.00023782952,0.0021915368,0.0008661111,0.98352575,0.0035498666,0.008939525],"study_design_scores_gemma":[0.000021877326,0.000016850501,0.0004246148,0.00003241156,0.000013864917,0.00015347496,0.00008833428,0.007418345,0.0004600753,0.98714846,0.0042049373,0.000016795088],"about_ca_topic_score_codex":0.0024678714,"about_ca_topic_score_gemma":0.0024226073,"teacher_disagreement_score":0.010616779,"about_ca_system_score_codex":0.0021618549,"about_ca_system_score_gemma":0.00079649204,"threshold_uncertainty_score":0.03551668},"labels":[],"label_agreement":null},{"id":"W2395748981","doi":"","title":"Domino Tiling Graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Domino; Mathematics; Domino effect; Combinatorics; Political science; Law; Biology","score_opus":0.00912141063806442,"score_gpt":0.2194753404520739,"score_spread":0.21035392981400947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395748981","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20586589,0.0020457532,0.2042238,0.0013986126,0.0007178927,0.00012335481,0.0018415878,0.0014210996,0.582362],"genre_scores_gemma":[0.8834154,0.0008197428,0.023676762,0.0004709021,0.00016581817,0.00012897697,0.0010883143,0.0001840716,0.09004994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997924,0.000030436564,0.000011411764,0.000054222986,0.000052260537,0.000059297785],"domain_scores_gemma":[0.9995484,0.00015807134,0.00006215896,0.00009030079,0.00006924916,0.000071800845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012615997,0.00027058364,0.00031742678,0.00085344573,0.00087796,0.0012718218,0.00040774336,0.0005401228,0.017483024],"category_scores_gemma":[0.0011032694,0.00017305337,0.00031851718,0.0005819616,0.0008456421,0.0011563943,0.0009761727,0.0006128279,0.00200144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047774985,0.00001966869,0.00050915533,0.000051148723,0.000009411194,0.00016647381,0.00013055754,0.0030978287,0.004508621,0.9557646,0.007430221,0.028264591],"study_design_scores_gemma":[0.000020806394,0.000018154687,0.000637851,0.000029204228,0.000013780807,0.0003847497,0.0001980497,0.017195793,0.004321818,0.9166286,0.060533866,0.000017386483],"about_ca_topic_score_codex":0.0013552326,"about_ca_topic_score_gemma":0.0028615107,"teacher_disagreement_score":0.017483024,"about_ca_system_score_codex":0.0005854378,"about_ca_system_score_gemma":0.00031740105,"threshold_uncertainty_score":0.05848652},"labels":[],"label_agreement":null},{"id":"W2395759456","doi":"","title":"Genralization of Some Results on Cordial Graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.026204220053683995,"score_gpt":0.2261788376885054,"score_spread":0.1999746176348214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395759456","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072167136,0.018163057,0.24841881,0.023367627,0.0035541547,0.0001939667,0.0028614374,0.001650904,0.62962294],"genre_scores_gemma":[0.6745762,0.018789422,0.1269215,0.011265668,0.005778058,0.00049635756,0.005903947,0.0012315096,0.1550374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904424,0.00025598047,0.00004577692,0.00023416414,0.00026005227,0.00015976116],"domain_scores_gemma":[0.99468505,0.0029777137,0.00031470155,0.00092782266,0.00059347413,0.00050119107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001234488,0.0012270901,0.0009193627,0.003729317,0.0026096422,0.0032086265,0.0021581836,0.0015481898,0.031087046],"category_scores_gemma":[0.007653577,0.00045731745,0.0012418678,0.0039623133,0.0025060996,0.0078327395,0.0032981166,0.005448523,0.0042823465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068470465,0.00008001162,0.00057119614,0.00036862987,0.000023923725,0.00015839475,0.00019380594,0.0017646527,0.0009136058,0.9380375,0.03208929,0.02573044],"study_design_scores_gemma":[0.000016969252,0.000028650324,0.00054057856,0.0000934859,0.000027575881,0.00025740502,0.00015773797,0.0066106454,0.0009542517,0.94255084,0.048745193,0.000016692617],"about_ca_topic_score_codex":0.0024487122,"about_ca_topic_score_gemma":0.0028138075,"teacher_disagreement_score":0.031087046,"about_ca_system_score_codex":0.0027742551,"about_ca_system_score_gemma":0.0010587429,"threshold_uncertainty_score":0.103996515},"labels":[],"label_agreement":null},{"id":"W2395769526","doi":"","title":"On Cordial Labelings of Wheels with Other Graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.017006999747110653,"score_gpt":0.2074423818902472,"score_spread":0.19043538214313654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395769526","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23358573,0.002984793,0.4470918,0.0051560104,0.0009565698,0.0001990605,0.0015700758,0.0018975249,0.30655837],"genre_scores_gemma":[0.7296928,0.001980978,0.17311879,0.0015535506,0.0005741996,0.00028455615,0.0020125099,0.0008137946,0.08996878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99878305,0.000423204,0.00007620211,0.0002625281,0.00021319704,0.00024174868],"domain_scores_gemma":[0.996267,0.0018513913,0.00038422827,0.0007552959,0.00027266814,0.00046948358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011066345,0.0007024301,0.0007470335,0.0017626993,0.0030588664,0.003019628,0.0017515153,0.00162747,0.01965992],"category_scores_gemma":[0.0061030556,0.00062253245,0.0010419278,0.0025396768,0.002855969,0.008433193,0.0036790995,0.0028144966,0.0029351737],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004207616,0.000034202327,0.0003346799,0.00005853664,0.0000057865786,0.00004366791,0.0001775723,0.0020469807,0.0003742868,0.9746721,0.0061552622,0.01605481],"study_design_scores_gemma":[0.000013185824,0.000011643231,0.00025149656,0.000040094383,0.000008233706,0.00009911009,0.00015361248,0.009828059,0.0005627012,0.97323,0.01578997,0.0000119972565],"about_ca_topic_score_codex":0.0042954297,"about_ca_topic_score_gemma":0.0063775303,"teacher_disagreement_score":0.01965992,"about_ca_system_score_codex":0.0023822745,"about_ca_system_score_gemma":0.00076346,"threshold_uncertainty_score":0.06576896},"labels":[],"label_agreement":null},{"id":"W2395782104","doi":"","title":"L(2, 1)-labeling of Block Graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Block (permutation group theory); Combinatorics","score_opus":0.023279207680456576,"score_gpt":0.23850903038741647,"score_spread":0.2152298227069599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395782104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3130166,0.0016180816,0.44618955,0.0069307527,0.00053027866,0.00023501289,0.0068807104,0.0020181905,0.22258082],"genre_scores_gemma":[0.7501744,0.000815919,0.18249974,0.0015746958,0.00028825074,0.0003046658,0.005023322,0.0006213878,0.05869757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989712,0.00034897288,0.000052387306,0.00023448712,0.0001602301,0.00023278018],"domain_scores_gemma":[0.99657696,0.0016355404,0.00042567204,0.00067793945,0.00031196073,0.0003719043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080108066,0.00050078746,0.00067385775,0.0011333681,0.0018273166,0.0028525668,0.001368959,0.0014791574,0.015951343],"category_scores_gemma":[0.0041376976,0.0004845492,0.0006534898,0.001411705,0.0014042137,0.0044000964,0.0018173524,0.00205753,0.002856204],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020157846,0.000093066235,0.0011869079,0.00020597967,0.000021268836,0.00007957553,0.00021728419,0.0056342813,0.0036504325,0.9309963,0.022770405,0.034942918],"study_design_scores_gemma":[0.00003497361,0.000026996247,0.00066839263,0.00004046534,0.000017406466,0.00015704473,0.00017585274,0.022171216,0.002266143,0.95751476,0.0169087,0.00001801211],"about_ca_topic_score_codex":0.002363017,"about_ca_topic_score_gemma":0.0040920204,"teacher_disagreement_score":0.015951343,"about_ca_system_score_codex":0.0019622133,"about_ca_system_score_gemma":0.0010721337,"threshold_uncertainty_score":0.05336255},"labels":[],"label_agreement":null},{"id":"W2395803651","doi":"","title":"Union Distinct Families Of Sets, With An Application To Cryptography.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cryptography; Theoretical computer science; Computer science; Algorithm","score_opus":0.0037222043483265163,"score_gpt":0.18728487938225755,"score_spread":0.18356267503393103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395803651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060921125,0.0075009833,0.7196613,0.005306244,0.0014326182,0.00012414414,0.0006848765,0.00067637675,0.20369245],"genre_scores_gemma":[0.6620886,0.0070738266,0.24046668,0.0019014078,0.0028830634,0.00042703658,0.0008933184,0.00051063544,0.08375543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862444,0.000585326,0.00006964085,0.00029661375,0.00029528415,0.00012880316],"domain_scores_gemma":[0.9949185,0.0034237017,0.0003026017,0.0005464666,0.00046995384,0.00033885258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019846428,0.000798881,0.0009815164,0.004815396,0.004590908,0.004377972,0.0013567474,0.0016545549,0.011076526],"category_scores_gemma":[0.008986656,0.0007229428,0.0016172556,0.0049509425,0.0040691076,0.0077917716,0.0038504496,0.003744547,0.0016510772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018523082,0.0000126848345,0.00017549524,0.00002779711,0.000007564657,0.00006981764,0.000098350356,0.0009781233,0.00015342979,0.9883583,0.0029257187,0.00717402],"study_design_scores_gemma":[0.000008349104,0.000011432394,0.00015989911,0.000032404685,0.00001212216,0.00028700076,0.00012089897,0.010443889,0.00020177242,0.97827005,0.010440806,0.00001136439],"about_ca_topic_score_codex":0.0011295833,"about_ca_topic_score_gemma":0.0014470574,"teacher_disagreement_score":0.011076526,"about_ca_system_score_codex":0.0020714821,"about_ca_system_score_gemma":0.000875127,"threshold_uncertainty_score":0.037054718},"labels":[],"label_agreement":null},{"id":"W2395806069","doi":"","title":"Eulerian Zero-Divisor Graphs","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Zero divisor; Eulerian path; Vertex (graph theory); Graph; Complement graph; Distance-regular graph; Graph power; Discrete mathematics; Line graph; Pure mathematics","score_opus":0.022641818715055793,"score_gpt":0.2505298076407787,"score_spread":0.2278879889257229,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395806069","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8861195,0.00078012084,0.057618316,0.0004134288,0.00003953254,0.000031846215,0.00042987682,0.00020779794,0.054359484],"genre_scores_gemma":[0.9890941,0.0001933385,0.005316848,0.00004174521,0.000022479899,0.000010266266,0.00025463116,0.000014568446,0.0050520673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997634,0.000037489335,0.000009383575,0.000070583505,0.000063376756,0.0000557289],"domain_scores_gemma":[0.9993643,0.00017528718,0.00014271624,0.00007102425,0.00013291278,0.00011370964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023076379,0.000210384,0.00023300853,0.0012443104,0.00044724936,0.0010816421,0.00030242134,0.00023963934,0.004844306],"category_scores_gemma":[0.0008286743,0.00008472099,0.00017256678,0.00064726686,0.0012877126,0.0016499966,0.0006316698,0.0003346022,0.00029657935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004546133,0.000019432122,0.0042454307,0.000043203625,0.0000072748185,0.00011302722,0.00020393405,0.0036491968,0.0024741294,0.97369623,0.0013837712,0.014118988],"study_design_scores_gemma":[0.00001996935,0.000033225246,0.0045213313,0.000028841634,0.000014821489,0.000440667,0.00037854188,0.019186324,0.005485887,0.95190537,0.017967885,0.00001714859],"about_ca_topic_score_codex":0.00076958217,"about_ca_topic_score_gemma":0.00089692813,"teacher_disagreement_score":0.004844306,"about_ca_system_score_codex":0.0008646049,"about_ca_system_score_gemma":0.00021885261,"threshold_uncertainty_score":0.016205847},"labels":[],"label_agreement":null},{"id":"W2395810761","doi":"","title":"Effect of parallelism on the efficiency of binary tree search.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Parallelism (grammar); Tree (set theory); Binary tree; Binary number; Binary search tree; Parallel computing; Arithmetic; Computer science; Algorithm; Combinatorics","score_opus":0.029611683932986674,"score_gpt":0.27663260161618075,"score_spread":0.24702091768319406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395810761","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85446393,0.0035920362,0.0850826,0.0015258081,0.00028244202,0.000080235375,0.00040410424,0.001004503,0.05356437],"genre_scores_gemma":[0.97826433,0.00039259897,0.019197669,0.000058380123,0.000044055905,0.000028337787,0.00011573583,0.00012327866,0.001775613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986261,0.00069693226,0.000050865892,0.00012659718,0.0002764496,0.00022312222],"domain_scores_gemma":[0.98280233,0.014549642,0.000507261,0.0011605064,0.0007043145,0.0002759206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026686888,0.00032399662,0.00048561895,0.0005665133,0.00053545943,0.000930672,0.0007320442,0.0007465542,0.0034718981],"category_scores_gemma":[0.018806675,0.00024335462,0.0002965022,0.0010003543,0.0006380633,0.0019327216,0.00055489835,0.00075640617,0.0007238411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004943001,0.0009084018,0.009637057,0.00039584044,0.00018763253,0.00037271105,0.00029398245,0.66079897,0.03150275,0.0488825,0.010963303,0.23111394],"study_design_scores_gemma":[0.00026913988,0.0006242517,0.0019930042,0.00003484512,0.000109464134,0.00019434789,0.00010484802,0.9418706,0.018143,0.0335058,0.0031281067,0.000022532251],"about_ca_topic_score_codex":0.0013166637,"about_ca_topic_score_gemma":0.002075498,"teacher_disagreement_score":0.0034718981,"about_ca_system_score_codex":0.0004963987,"about_ca_system_score_gemma":0.0011008946,"threshold_uncertainty_score":0.014113545},"labels":[],"label_agreement":null},{"id":"W2395845705","doi":"","title":"The full metamorphosis of λ-fold block designs with block size four into λ-fold 4-cycle systems.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fold (higher-order function); Mathematics; Metamorphosis; Block size; Block (permutation group theory); Combinatorics; Computer science; Biology; Programming language; Operating system","score_opus":0.010631018100239835,"score_gpt":0.1924355675773135,"score_spread":0.18180454947707367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395845705","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4400506,0.0008993422,0.33133203,0.000653952,0.0004996105,0.00026943893,0.0007133525,0.0012794969,0.22430216],"genre_scores_gemma":[0.8756981,0.00043924837,0.08046907,0.00038277337,0.000051220126,0.00020856189,0.00038309148,0.00016123963,0.0422067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999726,0.00006678594,0.0000169149,0.00004752206,0.000077174765,0.000065479384],"domain_scores_gemma":[0.9995989,0.00009860403,0.000051306364,0.00012250552,0.00006988727,0.000058859285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022676427,0.00020407254,0.00020211267,0.000459344,0.0005636273,0.000776067,0.00035465165,0.00056391204,0.015275739],"category_scores_gemma":[0.0010631406,0.00033349267,0.00042931095,0.00030240664,0.00060192856,0.0010921119,0.0009839779,0.0007072001,0.0021138971],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019550236,0.000055238503,0.00057690527,0.00014180652,0.000022630738,0.00033752117,0.0002727276,0.011997567,0.03485274,0.8923436,0.0045151156,0.054688655],"study_design_scores_gemma":[0.00009527575,0.00027995248,0.001196077,0.000102271435,0.000035910718,0.0007723524,0.00019156448,0.049164742,0.027913306,0.8565302,0.06366611,0.000052322284],"about_ca_topic_score_codex":0.0007812391,"about_ca_topic_score_gemma":0.001033371,"teacher_disagreement_score":0.015275739,"about_ca_system_score_codex":0.00043923248,"about_ca_system_score_gemma":0.00046741668,"threshold_uncertainty_score":0.05110246},"labels":[],"label_agreement":null},{"id":"W2395847372","doi":"","title":"On questions on (total) domination vertex critical graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Graph","score_opus":0.010794027808564482,"score_gpt":0.3019416141110427,"score_spread":0.2911475863024782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395847372","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2602114,0.021147905,0.17893325,0.07755912,0.002372679,0.0001716897,0.0012189406,0.00042030594,0.4579648],"genre_scores_gemma":[0.9163329,0.011376908,0.019684883,0.0061488934,0.004234557,0.00016877518,0.0011155758,0.00023481683,0.04070276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905115,0.0003540658,0.000037950664,0.00018353293,0.00020614822,0.0001670903],"domain_scores_gemma":[0.988381,0.009469608,0.0005300443,0.0004373264,0.0006469969,0.00053505274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017938977,0.0006451095,0.000817849,0.002430174,0.0027149236,0.0034814104,0.0015621352,0.0033832737,0.011537831],"category_scores_gemma":[0.013012821,0.00048746457,0.0006554817,0.0027195986,0.0054211635,0.013291524,0.002386418,0.003535542,0.0010978203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032140044,0.000022479499,0.0004006884,0.00011865056,0.000009972724,0.00009670327,0.00027229846,0.0015771891,0.00024494584,0.9816134,0.008560873,0.0070507815],"study_design_scores_gemma":[0.0000061563865,0.000004715028,0.00017718984,0.00002608254,0.0000040977147,0.00007158803,0.00017843809,0.0011081661,0.000089668705,0.9936324,0.004696779,0.0000047172502],"about_ca_topic_score_codex":0.001965984,"about_ca_topic_score_gemma":0.0017349701,"teacher_disagreement_score":0.011537831,"about_ca_system_score_codex":0.0024691208,"about_ca_system_score_gemma":0.0006156006,"threshold_uncertainty_score":0.03859788},"labels":[],"label_agreement":null},{"id":"W2395847857","doi":"","title":"On Antimagic Labeling For Power of Cycles.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Power (physics); Physics","score_opus":0.023664572988591624,"score_gpt":0.24013102645914747,"score_spread":0.21646645347055585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395847857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20179567,0.004899231,0.4239327,0.0099750385,0.0010121939,0.00024638273,0.0018869466,0.0013638786,0.35488793],"genre_scores_gemma":[0.79642445,0.0034339428,0.12650773,0.0028503253,0.0010341256,0.0003606757,0.002212793,0.00075896725,0.06641707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985813,0.00047278372,0.000085995845,0.0003131846,0.00027764327,0.00026919477],"domain_scores_gemma":[0.99464464,0.0033118203,0.00030122895,0.00088531885,0.0004023622,0.00045479918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013954,0.0007024663,0.0010380469,0.002261991,0.0030889607,0.0039663767,0.0017730802,0.002299552,0.017451191],"category_scores_gemma":[0.0077505885,0.0006259323,0.0011010965,0.003164703,0.0032016202,0.012337622,0.0039101127,0.0032711334,0.0029189666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003381427,0.00002578366,0.000209857,0.00007550372,0.0000065114064,0.00003861792,0.00016539266,0.001042934,0.0003859872,0.97899365,0.006418896,0.012603092],"study_design_scores_gemma":[0.000008299699,0.0000070977553,0.00009815778,0.000022385779,0.000007162188,0.000057417325,0.00008565402,0.0035418603,0.00028392195,0.9887362,0.0071442234,0.000007675975],"about_ca_topic_score_codex":0.0020703813,"about_ca_topic_score_gemma":0.003031985,"teacher_disagreement_score":0.017451191,"about_ca_system_score_codex":0.002669694,"about_ca_system_score_gemma":0.00097381516,"threshold_uncertainty_score":0.058380067},"labels":[],"label_agreement":null},{"id":"W2395855926","doi":"","title":"Connected even factors in {K 1, l , K 1, l +e}-free graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.015237217422907135,"score_gpt":0.26248963372693973,"score_spread":0.2472524163040326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395855926","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7783322,0.0018022505,0.05290725,0.0018018938,0.00034911907,0.000099588346,0.001395515,0.0007869197,0.16252525],"genre_scores_gemma":[0.9511217,0.0006215185,0.008184692,0.0003111926,0.00008161281,0.000050168786,0.000721553,0.00021800537,0.038689595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996761,0.000055587992,0.000017409975,0.00008188614,0.000048891412,0.00012020893],"domain_scores_gemma":[0.999141,0.0003680581,0.00018001934,0.000087603905,0.00007180423,0.00015153727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023210517,0.0004388932,0.00034063502,0.0010043704,0.0014974417,0.0021082126,0.0005262247,0.00070083066,0.016116517],"category_scores_gemma":[0.0014372345,0.00042655575,0.0004121191,0.00087563373,0.0013325708,0.0023859218,0.001294635,0.0007861021,0.0029158234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006078755,0.00014663766,0.0048086867,0.00034593188,0.00006141597,0.0017189403,0.0015613576,0.002708308,0.0147161735,0.9156036,0.015304078,0.04241696],"study_design_scores_gemma":[0.00006178445,0.00003872686,0.0020696037,0.00010535177,0.00006148959,0.00064046506,0.0006770936,0.0032137504,0.0067159794,0.95654404,0.029834397,0.00003726816],"about_ca_topic_score_codex":0.0015809204,"about_ca_topic_score_gemma":0.003818339,"teacher_disagreement_score":0.016116517,"about_ca_system_score_codex":0.000538781,"about_ca_system_score_gemma":0.0005105338,"threshold_uncertainty_score":0.053915143},"labels":[],"label_agreement":null},{"id":"W2395864634","doi":"","title":"Finding A Biplanar Imbedding Of C n x C n x C t x P m .","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematics and Applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Crystallography; Combinatorics; Chemistry","score_opus":0.09457721495236532,"score_gpt":0.34531729009479556,"score_spread":0.25074007514243024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395864634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33467266,0.0011109161,0.58637255,0.00091506355,0.0006860441,0.00021432008,0.0011217303,0.0012767332,0.07362998],"genre_scores_gemma":[0.6737257,0.00057387387,0.28451177,0.00033193672,0.00011902759,0.00012184479,0.0014112323,0.0006292021,0.03857539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997775,0.00003124614,0.000014870541,0.00008762169,0.000046684658,0.00004200876],"domain_scores_gemma":[0.9997267,0.0000652208,0.000041284642,0.000055729724,0.00003635634,0.00007476268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015644844,0.00069921487,0.00057000294,0.00079412025,0.00074745005,0.0009012127,0.0007940438,0.0010803554,0.013416888],"category_scores_gemma":[0.00094211986,0.00036697893,0.00045121319,0.00043016367,0.00079776807,0.0015272384,0.002153631,0.0012698808,0.00429899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006417615,0.000329364,0.0037169007,0.0009251396,0.00015596946,0.0042208256,0.0013130683,0.020303622,0.15751086,0.5247883,0.043505043,0.2425891],"study_design_scores_gemma":[0.00010583941,0.0005015792,0.0026570316,0.0002511691,0.00009190989,0.004345261,0.001572675,0.0968502,0.069242455,0.72367483,0.100618556,0.00008848216],"about_ca_topic_score_codex":0.00044446447,"about_ca_topic_score_gemma":0.00046886227,"teacher_disagreement_score":0.013416888,"about_ca_system_score_codex":0.00030095186,"about_ca_system_score_gemma":0.00020443671,"threshold_uncertainty_score":0.044883966},"labels":[],"label_agreement":null},{"id":"W2395867717","doi":"","title":"Degree-type Conditions for Bipartite Matching Extendability.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Degree (music); Type (biology); Matching (statistics); Combinatorics; Statistics; Physics","score_opus":0.02056211590943097,"score_gpt":0.29426329146339497,"score_spread":0.273701175553964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395867717","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23642154,0.0012980775,0.47249392,0.0053231376,0.00068570295,0.00032144718,0.004587733,0.00091862265,0.2779499],"genre_scores_gemma":[0.93784016,0.00095135556,0.035489324,0.0009501595,0.0007841796,0.00028834492,0.0027065666,0.00021962877,0.020770296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99739,0.0007380298,0.00023950997,0.0005560379,0.00066328334,0.00041320396],"domain_scores_gemma":[0.9831234,0.010584041,0.0011952954,0.002141936,0.0015141973,0.0014410797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029722857,0.00057088543,0.000877758,0.0021702617,0.0015572973,0.0032286886,0.0016086425,0.0018805213,0.023548178],"category_scores_gemma":[0.024272345,0.0005444055,0.0011549966,0.0024634686,0.002873894,0.010419607,0.003343228,0.0036467805,0.0024926686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110245746,0.00004995436,0.0011306199,0.000097056334,0.000018298555,0.00018820586,0.00015541584,0.0020351098,0.0010254189,0.9815314,0.0043106624,0.009347669],"study_design_scores_gemma":[0.000028797107,0.000020221994,0.00057790335,0.000030290406,0.000013983234,0.00031767864,0.00009306659,0.0065111765,0.00075004605,0.98780966,0.0038294157,0.000017616685],"about_ca_topic_score_codex":0.0007537654,"about_ca_topic_score_gemma":0.0010628266,"teacher_disagreement_score":0.023548178,"about_ca_system_score_codex":0.0010152725,"about_ca_system_score_gemma":0.00081801583,"threshold_uncertainty_score":0.07877654},"labels":[],"label_agreement":null},{"id":"W2395905535","doi":"","title":"A Unified Approach to the Extremal Trees without Perfect Matching for Different Indices.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Matching (statistics); Statistics; Combinatorics","score_opus":0.048556711760604915,"score_gpt":0.3000654741873985,"score_spread":0.25150876242679354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395905535","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025944883,0.003424577,0.780938,0.0024705548,0.0010876404,0.00013097507,0.00042886706,0.00055882457,0.18501571],"genre_scores_gemma":[0.47627956,0.0042557158,0.45472795,0.0022926284,0.0019052686,0.00043263275,0.000718768,0.0010243718,0.05836318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988998,0.00035402854,0.00007142627,0.00022378271,0.0003053777,0.00014552654],"domain_scores_gemma":[0.998516,0.000424601,0.00012514906,0.00051250804,0.00026609396,0.0001556975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001379854,0.00080273696,0.0011252182,0.0034025689,0.0023607744,0.003680535,0.003251867,0.003019221,0.009601187],"category_scores_gemma":[0.0049059456,0.0007487116,0.0013568152,0.0019370513,0.0034350778,0.009824576,0.004328544,0.005114127,0.0029442583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037962175,0.0000053716385,0.00002196754,0.000015303018,0.0000020851826,0.000020333386,0.000029210067,0.00044595732,0.00014726714,0.9964349,0.00086545665,0.002008342],"study_design_scores_gemma":[0.0000028862999,0.000003967909,0.000023140694,0.000011972695,0.0000036845431,0.000059041475,0.000022594813,0.004869754,0.00010084852,0.9918698,0.0030271641,0.000005182439],"about_ca_topic_score_codex":0.00062033633,"about_ca_topic_score_gemma":0.0011960486,"teacher_disagreement_score":0.009601187,"about_ca_system_score_codex":0.0013595859,"about_ca_system_score_gemma":0.000767522,"threshold_uncertainty_score":0.032119155},"labels":[],"label_agreement":null},{"id":"W2395908865","doi":"","title":"On γ-labelings of complete bipartite graphs","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Complete bipartite graph; Discrete mathematics; Graph","score_opus":0.014358928298667419,"score_gpt":0.21788850341307503,"score_spread":0.2035295751144076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395908865","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49670428,0.0016133578,0.40048394,0.0053051882,0.00024966674,0.00017978407,0.0024398407,0.00083945465,0.092184395],"genre_scores_gemma":[0.8364234,0.0020002439,0.12573792,0.0013608196,0.0005304603,0.0004290448,0.0034040355,0.00057389104,0.029540228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997336,0.0010851949,0.00016943683,0.00057882577,0.0004165958,0.00041402018],"domain_scores_gemma":[0.9809378,0.013279289,0.0019351891,0.0017308247,0.00076444284,0.0013525164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025856355,0.0013724242,0.0015876037,0.00326538,0.003173823,0.006549288,0.0029756594,0.002594422,0.010565892],"category_scores_gemma":[0.012800686,0.0015755517,0.0016536037,0.0045351926,0.004963797,0.011641422,0.0045706825,0.0048198104,0.0014476749],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010613202,0.00005649254,0.0007583406,0.00010356211,0.000015142146,0.000058958576,0.0004150017,0.005798305,0.000706338,0.9771274,0.0036013531,0.011252974],"study_design_scores_gemma":[0.00001980953,0.000008792681,0.00020874951,0.000030180903,0.000009044458,0.00004680108,0.00013787976,0.011273883,0.00025005976,0.9862831,0.0017204263,0.000011319241],"about_ca_topic_score_codex":0.002292737,"about_ca_topic_score_gemma":0.0029383292,"teacher_disagreement_score":0.010565892,"about_ca_system_score_codex":0.0033271967,"about_ca_system_score_gemma":0.001061497,"threshold_uncertainty_score":0.035346508},"labels":[],"label_agreement":null},{"id":"W2395930029","doi":"","title":"The valuations of the near 2n-gon I n .","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Valuation (finance); Converse; Quadric; Combinatorics; Linear subspace; Invertible matrix; Discrete mathematics; Pure mathematics; Geometry","score_opus":0.1146490278509148,"score_gpt":0.3307460738799862,"score_spread":0.21609704602907143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395930029","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9258912,0.00027793171,0.015694318,0.00022223493,0.0000725159,0.000028152494,0.00024321993,0.000032943557,0.057537384],"genre_scores_gemma":[0.98590356,0.00017382631,0.0038559833,0.000039298404,0.00004700771,0.000027519478,0.00024182095,0.000026670097,0.009684387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975806,0.000052870168,0.000009852343,0.000046961093,0.000061704595,0.0000704905],"domain_scores_gemma":[0.9996848,0.000050045353,0.00007773984,0.000026511903,0.000032550073,0.00012842302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002822743,0.0002645575,0.00022518521,0.00085121026,0.00082537945,0.0016580605,0.0003762053,0.00018663943,0.003224902],"category_scores_gemma":[0.00072269037,0.00021124793,0.00027986174,0.00047284114,0.0020502664,0.0014821953,0.0016343879,0.00079106103,0.0003305656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018070352,0.000048748254,0.0033701204,0.000052994612,0.000014203038,0.0004814665,0.0014713441,0.0026955807,0.007890717,0.96744674,0.0010393028,0.015308017],"study_design_scores_gemma":[0.00006703686,0.00020435099,0.011356287,0.00006234416,0.000023605338,0.0013879178,0.0020826773,0.011506891,0.007769044,0.9336984,0.03177985,0.00006164463],"about_ca_topic_score_codex":0.00055275124,"about_ca_topic_score_gemma":0.00040824802,"teacher_disagreement_score":0.003224902,"about_ca_system_score_codex":0.00062947953,"about_ca_system_score_gemma":0.00024727482,"threshold_uncertainty_score":0.010788381},"labels":[],"label_agreement":null},{"id":"W2395940650","doi":"","title":"Hamilton Cycles in Cubic Polyhex Graphs on the Klein Bottle.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Klein bottle; Mathematics; Bottle; Combinatorics; Cubic graph; Geometry; Graph; Composite material; Materials science; Line graph","score_opus":0.017187316849342375,"score_gpt":0.2631006797914168,"score_spread":0.24591336294207444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395940650","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79764616,0.0011770381,0.039902914,0.0022208677,0.00047663788,0.0001401272,0.0007732839,0.00052272656,0.15714008],"genre_scores_gemma":[0.9532898,0.0005589343,0.008693102,0.00033649287,0.00010582247,0.00008766685,0.00035672705,0.00012594709,0.036445618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997563,0.000049559952,0.000010782033,0.000036722544,0.00006202621,0.000084796106],"domain_scores_gemma":[0.9994205,0.00018729232,0.00011502006,0.00006556809,0.00007043807,0.00014122609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011967582,0.0003151084,0.00037428056,0.0009668874,0.001807622,0.0020305803,0.0007233042,0.0010554468,0.012472262],"category_scores_gemma":[0.0012353607,0.00043235507,0.0003853532,0.00093309325,0.0011748138,0.0018677348,0.0014012428,0.0010196664,0.0013732055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001245128,0.000041478088,0.00069618813,0.00009193807,0.000014861135,0.00044116873,0.00035234794,0.004378693,0.0027349028,0.96742713,0.008284506,0.015412355],"study_design_scores_gemma":[0.000038664544,0.000023271306,0.0008120157,0.000035027715,0.000017500826,0.00019277906,0.00050894014,0.018025592,0.0016077744,0.9708576,0.007856603,0.000024189241],"about_ca_topic_score_codex":0.0061720596,"about_ca_topic_score_gemma":0.00992773,"teacher_disagreement_score":0.012472262,"about_ca_system_score_codex":0.0010342269,"about_ca_system_score_gemma":0.0007338176,"threshold_uncertainty_score":0.041723907},"labels":[],"label_agreement":null},{"id":"W2395948282","doi":"","title":"H-kernels in the D-join.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Stability and Controllability of Differential Equations","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Join (topology); Mathematics; Combinatorics","score_opus":0.024129755524656016,"score_gpt":0.21278568487387797,"score_spread":0.18865592934922196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395948282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18582837,0.0018968128,0.57246196,0.0019775727,0.00093124347,0.00011817131,0.00087682187,0.00062206254,0.23528698],"genre_scores_gemma":[0.89525723,0.0008758268,0.04170991,0.0006153023,0.00057037297,0.00012301735,0.0005734611,0.00026672106,0.060008142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992811,0.00012234366,0.000049096696,0.00020599952,0.00020077899,0.00014081023],"domain_scores_gemma":[0.9986045,0.0003909338,0.00019310103,0.00019607235,0.000295245,0.00032024618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090571656,0.0004990596,0.000653307,0.001903087,0.0015073546,0.0028576984,0.00076388934,0.0007574871,0.014685489],"category_scores_gemma":[0.0024929743,0.00027456746,0.0007229518,0.0008326878,0.0021382938,0.00448568,0.003190561,0.0018577478,0.0023334404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030879604,0.000018161183,0.0001800567,0.000023539957,0.000008535792,0.000062046856,0.0000899443,0.0003808463,0.0005754349,0.992331,0.0012899103,0.005009519],"study_design_scores_gemma":[0.00001878028,0.000025193902,0.00028474163,0.000013164899,0.000010639991,0.00012232226,0.00012676998,0.006333007,0.0010289788,0.98248243,0.009540893,0.000013189795],"about_ca_topic_score_codex":0.0010067219,"about_ca_topic_score_gemma":0.00090724276,"teacher_disagreement_score":0.014685489,"about_ca_system_score_codex":0.0009835815,"about_ca_system_score_gemma":0.0004696518,"threshold_uncertainty_score":0.049127817},"labels":[],"label_agreement":null},{"id":"W2395961356","doi":"","title":"Super Mean Labeling Of Graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01093251859470826,"score_gpt":0.2115813766574638,"score_spread":0.20064885806275554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395961356","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17628843,0.003167057,0.6024905,0.007928626,0.00081803964,0.000094095325,0.0020653172,0.0014616117,0.20568632],"genre_scores_gemma":[0.7267428,0.001605586,0.21531418,0.0021614302,0.0009780133,0.00023806375,0.0024967324,0.0007003004,0.04976296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863356,0.00044489777,0.000053538803,0.0003200809,0.00033137327,0.00021648896],"domain_scores_gemma":[0.9954125,0.0022236446,0.00034971297,0.0011279171,0.00045732845,0.00042888304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013027547,0.0005234852,0.0009232435,0.0018089603,0.0024189984,0.0028420202,0.0017645461,0.0016341584,0.011668733],"category_scores_gemma":[0.0057555623,0.00057603634,0.0009764206,0.0021897117,0.002154526,0.006383622,0.0026203305,0.0035827581,0.0018744932],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045820714,0.000026385771,0.00027232812,0.000074704556,0.000009687861,0.000020254476,0.00009944477,0.0016269886,0.00078354875,0.97293663,0.008527185,0.015576971],"study_design_scores_gemma":[0.0000072306448,0.0000094709085,0.00025151475,0.000017405831,0.000008931457,0.000059922124,0.00006212788,0.011562846,0.00062471075,0.980357,0.0070307655,0.000007976855],"about_ca_topic_score_codex":0.001604313,"about_ca_topic_score_gemma":0.0033460031,"teacher_disagreement_score":0.011668733,"about_ca_system_score_codex":0.0023560366,"about_ca_system_score_gemma":0.0010804717,"threshold_uncertainty_score":0.039035857},"labels":[],"label_agreement":null},{"id":"W2395992115","doi":"","title":"Hamiltonicity of transformation graph G","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Transformation (genetics); Graph; Combinatorics; Chemistry; Gene; Biochemistry","score_opus":0.013523889369996234,"score_gpt":0.25909371013837557,"score_spread":0.24556982076837933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395992115","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73521495,0.00017546258,0.12869224,0.0012523677,0.00011405423,0.00026266405,0.0015285353,0.0006741086,0.13208573],"genre_scores_gemma":[0.9622458,0.00013636636,0.009344575,0.00022176682,0.000032845273,0.00010955016,0.0011407858,0.00008537928,0.02668298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974436,0.00004998571,0.000007713331,0.000073602,0.000047193236,0.00007706975],"domain_scores_gemma":[0.99952793,0.00018853114,0.00007629866,0.00006916307,0.000068495116,0.00006960667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014150092,0.00026242566,0.00033523474,0.0006781565,0.0010520312,0.0011650559,0.0004805223,0.0005275948,0.012013421],"category_scores_gemma":[0.0006328531,0.00024488475,0.00042437538,0.00063640496,0.00074329047,0.00074027525,0.0006681045,0.00074809213,0.0011216978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001970978,0.00007541108,0.0027585388,0.00009727726,0.000038685368,0.00088465976,0.0012645443,0.0043315208,0.017877866,0.94526833,0.0061809993,0.02102509],"study_design_scores_gemma":[0.00009811897,0.00008422098,0.003701372,0.00002217953,0.000043851647,0.0005233172,0.0006562384,0.01862717,0.006898537,0.9581061,0.01121268,0.000026222226],"about_ca_topic_score_codex":0.0034596534,"about_ca_topic_score_gemma":0.0026755102,"teacher_disagreement_score":0.012013421,"about_ca_system_score_codex":0.00057349144,"about_ca_system_score_gemma":0.000694196,"threshold_uncertainty_score":0.04018897},"labels":[],"label_agreement":null},{"id":"W2396005365","doi":"","title":"Staircase Visibility And Krasnosel'skii-Type Results For Planar Compact Sets.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Planar; Visibility; Type (biology); Combinatorics; Computer science; Computer graphics (images); Geography","score_opus":0.04092875928217528,"score_gpt":0.2799510891183039,"score_spread":0.23902232983612864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396005365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22987622,0.0043533086,0.43057072,0.0029943273,0.0005578163,0.00010549237,0.0012693377,0.00079323613,0.3294796],"genre_scores_gemma":[0.9094233,0.0019617134,0.03971785,0.0004582451,0.0002455707,0.00008681509,0.0012081593,0.00025381093,0.0466446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996642,0.000045649038,0.000017797829,0.000058613183,0.0001434581,0.00007035534],"domain_scores_gemma":[0.9985537,0.00083032966,0.00012436458,0.00017899997,0.00018386959,0.00012869849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003870763,0.00057283125,0.0005600965,0.001532577,0.0011984434,0.0025840914,0.0010997007,0.0008733589,0.011016365],"category_scores_gemma":[0.0037719877,0.0004426725,0.0007668176,0.0017329331,0.001634577,0.0045743985,0.002310183,0.002749363,0.0014030461],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072994706,0.000039550516,0.0005797745,0.0001297529,0.000020323827,0.00013737679,0.00027902055,0.0032845757,0.0015345986,0.970843,0.005956257,0.01712268],"study_design_scores_gemma":[0.000021281801,0.000028917564,0.0006743242,0.000032602842,0.000025132018,0.00023341067,0.00021540973,0.011060067,0.0021285,0.97391415,0.011651445,0.000014825728],"about_ca_topic_score_codex":0.0017124783,"about_ca_topic_score_gemma":0.0021279268,"teacher_disagreement_score":0.011016365,"about_ca_system_score_codex":0.0009997898,"about_ca_system_score_gemma":0.0004986307,"threshold_uncertainty_score":0.036853433},"labels":[],"label_agreement":null},{"id":"W2396025375","doi":"","title":"Simple Kirkman Packing Designs SKPD({3, 4}, v) with index two.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Simple (philosophy); Mathematics; Index (typography); Combinatorics; Computer science; Programming language","score_opus":0.0201498359773477,"score_gpt":0.206391089510782,"score_spread":0.1862412535334343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396025375","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4642581,0.00095493085,0.22060339,0.0010683612,0.00054987345,0.00037896822,0.0016162888,0.0013566236,0.3092135],"genre_scores_gemma":[0.8855624,0.00036978236,0.07588116,0.00034764133,0.00007324589,0.0001934873,0.0009077363,0.00016057635,0.036503874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993642,0.00015236852,0.000042722604,0.000095051,0.00019022323,0.00015537952],"domain_scores_gemma":[0.9992316,0.00019779857,0.000117694675,0.00021628503,0.00011495808,0.00012173159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032164654,0.0006352339,0.00051109196,0.0006273803,0.0012694442,0.0016467347,0.0009441435,0.0009416828,0.018668925],"category_scores_gemma":[0.0017821523,0.00044219595,0.00031352017,0.0009984652,0.0007101978,0.0015619313,0.0014023661,0.00081392325,0.0039052705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013063924,0.0002944095,0.0013160849,0.00039851648,0.000083783554,0.0007794103,0.00046689733,0.012529204,0.03183514,0.83729655,0.02085473,0.09283879],"study_design_scores_gemma":[0.00033138302,0.0006336026,0.0014137416,0.00014579407,0.000093910254,0.0014066704,0.0004975291,0.053702574,0.028882595,0.85106826,0.06171954,0.00010441257],"about_ca_topic_score_codex":0.00052177627,"about_ca_topic_score_gemma":0.0012621057,"teacher_disagreement_score":0.018668925,"about_ca_system_score_codex":0.00058896514,"about_ca_system_score_gemma":0.0007364058,"threshold_uncertainty_score":0.062453747},"labels":[],"label_agreement":null},{"id":"W2396029996","doi":"","title":"Clique number and distance spectral radii of graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Clique; Clique number; Combinatorics; Graph","score_opus":0.017840797435686263,"score_gpt":0.28660204694632035,"score_spread":0.26876124951063407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396029996","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.582962,0.0069161262,0.22850929,0.0057761404,0.00054836133,0.0000965522,0.0018733329,0.000642064,0.1726761],"genre_scores_gemma":[0.96513134,0.0015048288,0.023736306,0.00027949267,0.0005315141,0.00010420291,0.00061214255,0.00012688502,0.007973217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986475,0.00050932006,0.000049130183,0.00034145333,0.00030008017,0.00015240003],"domain_scores_gemma":[0.9911404,0.005679941,0.0011771759,0.0006488422,0.00048123568,0.00087241514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010986709,0.0006321239,0.00080099975,0.002951876,0.0012668686,0.002497709,0.0017016311,0.0013148065,0.007855197],"category_scores_gemma":[0.013301565,0.0004405252,0.00043174857,0.0018141676,0.0025157447,0.004896422,0.0019148369,0.001637493,0.0016146909],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018372017,0.00005787526,0.0020648462,0.00015941878,0.00004039462,0.00007315051,0.0003200243,0.0070369937,0.002837943,0.9632251,0.006889428,0.017111052],"study_design_scores_gemma":[0.000025998874,0.000025273097,0.0017862656,0.000035828558,0.000026290341,0.00033299733,0.00019782418,0.029545395,0.001411698,0.9598468,0.0067441803,0.000021426387],"about_ca_topic_score_codex":0.0006406964,"about_ca_topic_score_gemma":0.0006959308,"teacher_disagreement_score":0.007855197,"about_ca_system_score_codex":0.001001312,"about_ca_system_score_gemma":0.00029370925,"threshold_uncertainty_score":0.026278257},"labels":[],"label_agreement":null},{"id":"W2396043225","doi":"","title":"Finite Groups of Derangements on the n-Cube.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cube (algebra); Derangement; Pure mathematics; Combinatorics","score_opus":0.00814245759577872,"score_gpt":0.18607401241904867,"score_spread":0.17793155482326994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396043225","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48411107,0.001474758,0.17917089,0.0028533854,0.0007957495,0.00012432956,0.00089229795,0.00040008387,0.3301774],"genre_scores_gemma":[0.93530685,0.00064880686,0.020043805,0.00051539636,0.00028702247,0.00013731226,0.0005232292,0.00008536905,0.042452287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990408,0.00026870624,0.000055078475,0.00017097054,0.00020771615,0.00025683813],"domain_scores_gemma":[0.998278,0.0007095324,0.00029867174,0.00028800248,0.00018183813,0.00024390062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048318953,0.0006075971,0.00057369017,0.0012444035,0.0015729683,0.0025444576,0.0010827044,0.0006782092,0.011059846],"category_scores_gemma":[0.0022059986,0.0002934867,0.0006745948,0.00090174004,0.0028683762,0.0036177922,0.0031132468,0.001548273,0.0019251535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055689095,0.00001354748,0.0001314249,0.000016732958,0.000006805685,0.00010041537,0.00014792585,0.0010903287,0.0006521764,0.9915167,0.0011734928,0.0050947084],"study_design_scores_gemma":[0.000013760998,0.000018842933,0.00015956302,0.000016973694,0.0000062478475,0.00014336294,0.0001823141,0.0032126587,0.0010682169,0.988279,0.0068856096,0.000013375217],"about_ca_topic_score_codex":0.0014952025,"about_ca_topic_score_gemma":0.0014798336,"teacher_disagreement_score":0.011059846,"about_ca_system_score_codex":0.0010122813,"about_ca_system_score_gemma":0.0007880406,"threshold_uncertainty_score":0.036998868},"labels":[],"label_agreement":null},{"id":"W2396060534","doi":"","title":"Constructions and Bounds for Splitting and Separating Systems.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.025603991039013358,"score_gpt":0.2728381107831731,"score_spread":0.24723411974415974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396060534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036589574,0.0051822597,0.7384467,0.005354419,0.0006542845,0.0002462315,0.0023906648,0.002703869,0.20843205],"genre_scores_gemma":[0.55676574,0.004742744,0.36016372,0.002509403,0.0010848191,0.00078461034,0.005733403,0.001987539,0.06622806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99348176,0.0013188797,0.00063273474,0.0012047474,0.0022851299,0.0010767519],"domain_scores_gemma":[0.9807585,0.011738565,0.00092785823,0.003537879,0.0018231763,0.001213979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004983395,0.0015100145,0.0013010962,0.0042118225,0.0037903553,0.009524514,0.0037481277,0.0024085885,0.025370557],"category_scores_gemma":[0.021548193,0.0019584144,0.0024788845,0.00686848,0.005052411,0.026413819,0.010612654,0.009731094,0.007403781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003927469,0.000040023697,0.0002813121,0.00012745404,0.000014643502,0.000044196066,0.00030850898,0.000806496,0.00066454086,0.97844964,0.0063689966,0.012854928],"study_design_scores_gemma":[0.000011880829,0.000012907506,0.0001989601,0.00006693182,0.000030223107,0.00014357713,0.00013078544,0.0030737997,0.0010350639,0.9783952,0.016876686,0.000023947945],"about_ca_topic_score_codex":0.0028646295,"about_ca_topic_score_gemma":0.003133675,"teacher_disagreement_score":0.025370557,"about_ca_system_score_codex":0.0045216656,"about_ca_system_score_gemma":0.0023891542,"threshold_uncertainty_score":0.08487302},"labels":[],"label_agreement":null},{"id":"W2396061165","doi":"","title":"On the Domination Number of the Circulant Graphs C(n;{1, 2}), C(n;{1, 3}) and C(n;{1, 4}).","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Circulant matrix; Mathematics; Combinatorics","score_opus":0.03301400109676463,"score_gpt":0.26581661696177394,"score_spread":0.2328026158650093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396061165","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82185966,0.0029830472,0.03853165,0.004653745,0.00032263168,0.000052203814,0.0012699078,0.00021089481,0.13011627],"genre_scores_gemma":[0.9850846,0.0008576509,0.0062077683,0.00025429306,0.0002666153,0.00006568337,0.00038472176,0.00006984495,0.0068088514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992706,0.00026306688,0.000024511914,0.00012980175,0.00014710067,0.00016487428],"domain_scores_gemma":[0.98717993,0.009344991,0.0012568645,0.0005147493,0.0005889232,0.0011146251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013267909,0.0005965758,0.00062393694,0.0033931262,0.0015962457,0.002043779,0.0013987581,0.0010017663,0.007088131],"category_scores_gemma":[0.010859808,0.0003741204,0.00035333954,0.0014947648,0.0023885781,0.0029686887,0.0011490324,0.0018231934,0.0005755079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048384507,0.00010895962,0.004496775,0.00018576453,0.000049073744,0.00020386098,0.00053868827,0.023280237,0.0051808236,0.9227956,0.014400286,0.028276103],"study_design_scores_gemma":[0.00008704073,0.000055377444,0.0053487183,0.000117827665,0.000045672256,0.0003925692,0.00024067577,0.111603536,0.0026883695,0.87332094,0.0060431003,0.000056156252],"about_ca_topic_score_codex":0.002324874,"about_ca_topic_score_gemma":0.0036780878,"teacher_disagreement_score":0.007088131,"about_ca_system_score_codex":0.0018657892,"about_ca_system_score_gemma":0.0007035868,"threshold_uncertainty_score":0.023712158},"labels":[],"label_agreement":null},{"id":"W2396071362","doi":"","title":"Symmetric f Bi-Derivations Of Lattices.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.012724656036076804,"score_gpt":0.24564460520084191,"score_spread":0.2329199491647651,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396071362","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10878609,0.003473059,0.3713752,0.0032783959,0.0016643058,0.00013977785,0.0022074927,0.001075232,0.50800043],"genre_scores_gemma":[0.7843869,0.0014917167,0.093979985,0.0011961969,0.0005524956,0.00007984604,0.0013320084,0.00036610517,0.11661477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986695,0.00038982125,0.000103627724,0.00022051846,0.00043378398,0.00018279774],"domain_scores_gemma":[0.998752,0.0002926349,0.00010315578,0.00023201662,0.00041914417,0.00020115975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001198113,0.0004892437,0.00048071652,0.0015908342,0.001937565,0.0028159434,0.00083943945,0.0008039307,0.0149801895],"category_scores_gemma":[0.0029030738,0.00042069028,0.00063678174,0.0011652219,0.0019836815,0.0054975194,0.002520888,0.0021186813,0.0053430633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002137622,0.0000137923935,0.00015191475,0.000029768364,0.000006920795,0.00009271036,0.00014137315,0.00012028247,0.00074612256,0.98653746,0.0028087783,0.009329629],"study_design_scores_gemma":[0.000011609428,0.000009600847,0.00013490432,0.000015896956,0.0000060912444,0.0002753786,0.00010013723,0.0010418536,0.0013015632,0.9797686,0.017321944,0.000012457937],"about_ca_topic_score_codex":0.0011983269,"about_ca_topic_score_gemma":0.001876691,"teacher_disagreement_score":0.0149801895,"about_ca_system_score_codex":0.0012913056,"about_ca_system_score_gemma":0.0008472306,"threshold_uncertainty_score":0.050113738},"labels":[],"label_agreement":null},{"id":"W2396084200","doi":"","title":"Extremal polyphenyl chains concerning k-matchings and k-independent sets","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01543485829817315,"score_gpt":0.27582726063342067,"score_spread":0.2603924023352475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396084200","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7733595,0.00091168506,0.07374121,0.0036751158,0.00036123753,0.000108886336,0.0008862073,0.0002840008,0.14667217],"genre_scores_gemma":[0.948989,0.00056558056,0.015017854,0.0005772892,0.0003898044,0.00014054227,0.00071129785,0.00016847035,0.033440154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992034,0.00017939422,0.0000358156,0.00016874318,0.00020211928,0.00021054111],"domain_scores_gemma":[0.99826306,0.0007935283,0.00031482676,0.00018002659,0.00015444656,0.0002940657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007730607,0.00070570444,0.0010921323,0.0027857781,0.0036812534,0.0027904385,0.0013021315,0.0019364798,0.012042444],"category_scores_gemma":[0.002576695,0.00072269246,0.0010897041,0.0030705244,0.002152908,0.004780083,0.0025748536,0.0033892584,0.0007559115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087205,0.000035335128,0.00042422416,0.0000612796,0.000015148194,0.00014105327,0.00021045639,0.0014073926,0.0012355356,0.98849887,0.0020102374,0.005873189],"study_design_scores_gemma":[0.000025508945,0.000014547026,0.00038341116,0.000011954605,0.000017170967,0.000098950244,0.000069512585,0.005406521,0.00055400416,0.99185705,0.0015501748,0.000011149252],"about_ca_topic_score_codex":0.0009543461,"about_ca_topic_score_gemma":0.0015652566,"teacher_disagreement_score":0.012042444,"about_ca_system_score_codex":0.0017038853,"about_ca_system_score_gemma":0.0007327617,"threshold_uncertainty_score":0.040285945},"labels":[],"label_agreement":null},{"id":"W2396090462","doi":"","title":"Maximal Separation On 2-D Arrays.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Separation (statistics); Combinatorics; Statistics","score_opus":0.017611880251572173,"score_gpt":0.27098344384787426,"score_spread":0.2533715635963021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396090462","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050702192,0.002408626,0.8712729,0.001003099,0.00042520612,0.0000785795,0.0013139732,0.0028355892,0.069959775],"genre_scores_gemma":[0.5282621,0.0018182774,0.42683473,0.0009308474,0.00034009924,0.00026971992,0.0029888023,0.00080834946,0.03774712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920243,0.00019309876,0.00007362359,0.00014594887,0.00023352077,0.000151494],"domain_scores_gemma":[0.99856347,0.0006408727,0.00012209127,0.00041824416,0.00014324179,0.000112063324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004655218,0.00065322197,0.00069697754,0.0013096406,0.0007761399,0.0019472204,0.00086684333,0.0007199885,0.011293983],"category_scores_gemma":[0.003235977,0.00036121605,0.00051670696,0.0022347122,0.0008028483,0.003289843,0.003067904,0.0012075084,0.004604167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006010703,0.0001384759,0.0008124581,0.00043365805,0.00005927086,0.00019731213,0.00031126218,0.022456942,0.014677445,0.6173184,0.033151247,0.3098425],"study_design_scores_gemma":[0.00007982312,0.00009445985,0.00045192052,0.00012504235,0.000028780809,0.00042441094,0.00023274016,0.08445154,0.021593867,0.8370357,0.055438913,0.000042784384],"about_ca_topic_score_codex":0.0005446331,"about_ca_topic_score_gemma":0.001064274,"teacher_disagreement_score":0.011293983,"about_ca_system_score_codex":0.00066168077,"about_ca_system_score_gemma":0.0008252988,"threshold_uncertainty_score":0.037782133},"labels":[],"label_agreement":null},{"id":"W2396102698","doi":"","title":"Utility And Expandabilty Of Channel Assignments.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Channel (broadcasting); Mathematics; Computer science; Telecommunications","score_opus":0.011071127851217293,"score_gpt":0.2243109670607269,"score_spread":0.2132398392095096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396102698","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2074977,0.0018926538,0.6133688,0.0047910362,0.00038715202,0.00015041091,0.0016146518,0.0010033463,0.16929428],"genre_scores_gemma":[0.9548166,0.00054715655,0.027869903,0.0003663255,0.00031667502,0.00015749047,0.0004269863,0.00017914045,0.015319775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955954,0.0018360454,0.0002918853,0.0008740012,0.00078912074,0.0006136063],"domain_scores_gemma":[0.97182894,0.02225682,0.0010565316,0.0021816583,0.0015801756,0.001095753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037676594,0.0006324259,0.00080135744,0.00206841,0.0018522984,0.0045545157,0.0014560318,0.0012529739,0.012590935],"category_scores_gemma":[0.024456935,0.00070957805,0.0013219827,0.0016394453,0.0060810572,0.0113782715,0.0032124354,0.0030409966,0.0014507594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006404158,0.000029853703,0.0002718666,0.00004787106,0.000013739731,0.00008864504,0.00031263524,0.0022908913,0.00073139666,0.9874182,0.0012325956,0.0074982597],"study_design_scores_gemma":[0.000013703195,0.000014571458,0.00015793814,0.000019431676,0.000015271995,0.00011655449,0.00007547582,0.0087880995,0.00070708204,0.98793334,0.002144255,0.00001421942],"about_ca_topic_score_codex":0.00145847,"about_ca_topic_score_gemma":0.0014801007,"teacher_disagreement_score":0.012590935,"about_ca_system_score_codex":0.0017320943,"about_ca_system_score_gemma":0.0011923948,"threshold_uncertainty_score":0.042120934},"labels":[],"label_agreement":null},{"id":"W2396161277","doi":"","title":"Up-embeddable graphs via the degree-sum of nonadjacent vertices: non-simple graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Degree (music); Simple (philosophy); Discrete mathematics; Physics","score_opus":0.023782001337334224,"score_gpt":0.2798523484529674,"score_spread":0.2560703471156332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396161277","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.665614,0.0009253211,0.25820842,0.0008281021,0.000286961,0.00010557763,0.00043374882,0.00057901465,0.07301875],"genre_scores_gemma":[0.9416428,0.0006554898,0.035147622,0.00015350366,0.00012197411,0.00004796889,0.0003622714,0.00016114455,0.021707233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996315,0.0000769934,0.000020172847,0.00008467514,0.00012806957,0.000058532725],"domain_scores_gemma":[0.9984237,0.00067627366,0.00027171636,0.00026648326,0.00012510024,0.0002367551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002544146,0.00055275596,0.00042432704,0.0009903022,0.0010689517,0.0018230904,0.00094512006,0.00080623146,0.0064093424],"category_scores_gemma":[0.0022776946,0.0005048749,0.0003921412,0.0008853513,0.0013801274,0.003702937,0.0018466928,0.0015805756,0.00097218127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017671417,0.000114352966,0.0016044521,0.00022173463,0.000039596856,0.0018051817,0.000985763,0.0061384924,0.019000601,0.92030615,0.0033289278,0.046278074],"study_design_scores_gemma":[0.000024814353,0.00003923137,0.0013023514,0.000033959663,0.00005478426,0.0010464652,0.0003696413,0.016774641,0.007741193,0.96601224,0.0065787304,0.000021896876],"about_ca_topic_score_codex":0.00027595102,"about_ca_topic_score_gemma":0.00081239105,"teacher_disagreement_score":0.0064093424,"about_ca_system_score_codex":0.00031515464,"about_ca_system_score_gemma":0.00021648502,"threshold_uncertainty_score":0.0214414},"labels":[],"label_agreement":null},{"id":"W2396189861","doi":"","title":"Note On (m, 2, m-1, m-2/2) Relative Difference Sets.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Statistics; Combinatorics","score_opus":0.007764796662602648,"score_gpt":0.2137237932176288,"score_spread":0.20595899655502614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396189861","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037288398,0.0049147485,0.23360208,0.01553535,0.018171778,0.000182153,0.0010929911,0.00076274626,0.68844974],"genre_scores_gemma":[0.65672535,0.0045778346,0.19744542,0.011658704,0.006393373,0.00052289513,0.0009692205,0.00061932876,0.12108789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990747,0.00022214046,0.00004338265,0.00021132705,0.00030999823,0.00013840859],"domain_scores_gemma":[0.9983651,0.0009465689,0.000083452636,0.00028313926,0.00019957143,0.00012220505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010654401,0.00073083694,0.0008056417,0.001589639,0.002402269,0.0017262241,0.0018755918,0.0011379388,0.02823217],"category_scores_gemma":[0.0030731456,0.00033391325,0.0006762165,0.001468793,0.0032528825,0.0047422303,0.0036671357,0.00409238,0.004483093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087102315,0.000024867284,0.000100728255,0.00007975856,0.000007806234,0.00013749878,0.00012971871,0.00039396936,0.0013827892,0.9699636,0.013855487,0.013836658],"study_design_scores_gemma":[0.000018815095,0.00006482272,0.00042726402,0.000042567517,0.000013963403,0.0004220849,0.000079239595,0.0012447576,0.0023063195,0.9122233,0.083128065,0.000028960669],"about_ca_topic_score_codex":0.00073762186,"about_ca_topic_score_gemma":0.0011095321,"teacher_disagreement_score":0.02823217,"about_ca_system_score_codex":0.00086329115,"about_ca_system_score_gemma":0.00045520088,"threshold_uncertainty_score":0.094446},"labels":[],"label_agreement":null},{"id":"W2396205519","doi":"","title":"Bi-Periodic Incomplete Lucas Sequences.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.025827035093350586,"score_gpt":0.2852814226247694,"score_spread":0.2594543875314188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396205519","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31594387,0.004397043,0.14050603,0.0023678758,0.0013619864,0.00012525835,0.002628469,0.00072179985,0.5319477],"genre_scores_gemma":[0.84059024,0.0016119748,0.035630204,0.0005278045,0.0003942433,0.00010916881,0.0016749684,0.00022777331,0.119233765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997216,0.000049604525,0.000018388382,0.00004979506,0.000102871025,0.000057781686],"domain_scores_gemma":[0.99928004,0.00013598021,0.00016766498,0.000098135286,0.00019511417,0.00012311929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002977784,0.000558735,0.0004390667,0.001577945,0.0010605191,0.0017001785,0.000525792,0.0006559651,0.017228335],"category_scores_gemma":[0.0020114626,0.00025762935,0.00029192114,0.0009237539,0.0009298995,0.0020639405,0.0012027714,0.001268771,0.00390612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000719949,0.000013483958,0.00026335142,0.00007411157,0.000007868709,0.00017609313,0.00013187234,0.00080071314,0.002863496,0.97842604,0.00424804,0.012922922],"study_design_scores_gemma":[0.000025202437,0.00003838268,0.0011243368,0.00007941511,0.00001811236,0.0005773229,0.00025941653,0.007384686,0.0022741477,0.93125737,0.056934036,0.000027637021],"about_ca_topic_score_codex":0.00084450154,"about_ca_topic_score_gemma":0.0016083675,"teacher_disagreement_score":0.017228335,"about_ca_system_score_codex":0.00092272245,"about_ca_system_score_gemma":0.00053267233,"threshold_uncertainty_score":0.057634532},"labels":[],"label_agreement":null},{"id":"W2396209512","doi":"","title":"Edge-choosability of planar graphs without chordal 7-Cycles.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chordal graph; Mathematics; Planar graph; Outerplanar graph; Enhanced Data Rates for GSM Evolution; Combinatorics; Planar; Pathwidth; Computer science; Graph; Telecommunications; Line graph","score_opus":0.02951463565057108,"score_gpt":0.27835382407437037,"score_spread":0.2488391884237993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396209512","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79457337,0.00095299655,0.07414938,0.0015229705,0.00012913294,0.00017248055,0.0020649729,0.0005393388,0.12589541],"genre_scores_gemma":[0.9766609,0.0005079886,0.010055359,0.000201812,0.00006539417,0.000060536844,0.001666718,0.0001415609,0.010639717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994504,0.00009694184,0.000041493648,0.00014039049,0.00014370384,0.00012714165],"domain_scores_gemma":[0.9970095,0.0018650725,0.000381115,0.00034100743,0.00014000956,0.0002632633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038295944,0.00037767645,0.00053632754,0.0005478011,0.00082617934,0.0019432895,0.0012854548,0.0010713434,0.018835494],"category_scores_gemma":[0.0035903924,0.00049554586,0.0006193842,0.0009943538,0.0009880055,0.0029271257,0.0014336393,0.0014648869,0.0014833509],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013993115,0.00037127474,0.009164175,0.00095441955,0.00015038486,0.0014250032,0.0009638092,0.022918327,0.032129075,0.80888,0.015525349,0.106119],"study_design_scores_gemma":[0.00033532042,0.00018055984,0.0058675134,0.000095169315,0.000136568,0.0014605061,0.0006358553,0.0364715,0.016757678,0.9265858,0.011416028,0.000057540143],"about_ca_topic_score_codex":0.0013825044,"about_ca_topic_score_gemma":0.0018186286,"teacher_disagreement_score":0.018835494,"about_ca_system_score_codex":0.00065681903,"about_ca_system_score_gemma":0.0005195651,"threshold_uncertainty_score":0.06301099},"labels":[],"label_agreement":null},{"id":"W2396212747","doi":"","title":"Nearly antipodal chromatc number of even paths.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Cultural Heritage Materials Analysis","field":"Arts and Humanities","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Antipodal point; Mathematics; Combinatorics; Geometry","score_opus":0.03402116109530679,"score_gpt":0.22672060825638093,"score_spread":0.19269944716107415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396212747","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42335412,0.00080480194,0.161172,0.0010719496,0.0006007347,0.00012906514,0.0035226382,0.0013515113,0.4079932],"genre_scores_gemma":[0.8988514,0.00039705535,0.03976412,0.00047874518,0.00014762788,0.000109479566,0.0017622904,0.0005953587,0.057893902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928904,0.00009630802,0.0000384661,0.00019106797,0.00021461195,0.00017038823],"domain_scores_gemma":[0.9983694,0.0005631839,0.0001698361,0.00036821642,0.00035374812,0.0001757211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042071554,0.00047571352,0.0005167237,0.00279536,0.0016085277,0.0029231538,0.0008336103,0.0007599809,0.032648712],"category_scores_gemma":[0.0031240939,0.00030615256,0.000569941,0.0013759396,0.0015632095,0.0030087568,0.0014356086,0.0010611917,0.0045916094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031732325,0.0000678412,0.0034125065,0.00019642564,0.000033382184,0.00040674262,0.0001869465,0.0021579473,0.0067457436,0.9172686,0.010443151,0.058763485],"study_design_scores_gemma":[0.000043330652,0.00006376955,0.0035647585,0.00011311786,0.000056030094,0.001321523,0.00044975895,0.016863404,0.010607136,0.90987825,0.056984756,0.000054138378],"about_ca_topic_score_codex":0.0011704832,"about_ca_topic_score_gemma":0.0020276536,"teacher_disagreement_score":0.032648712,"about_ca_system_score_codex":0.00075049343,"about_ca_system_score_gemma":0.0007886288,"threshold_uncertainty_score":0.1092208},"labels":[],"label_agreement":null},{"id":"W2396217519","doi":"","title":"Large sets of λ-fold K 1, 3 -factors of complete bipartite graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Fold (higher-order function); Bipartite graph; Combinatorics; Complete bipartite graph; Graph; Computer science","score_opus":0.08609816720326244,"score_gpt":0.3383047974797615,"score_spread":0.25220663027649903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396217519","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8371614,0.00085355603,0.08420371,0.0011773092,0.00014582595,0.00007061285,0.0012841669,0.000552606,0.074550755],"genre_scores_gemma":[0.97020054,0.00022161393,0.013450842,0.00026174283,0.00011079105,0.00011636387,0.0011181035,0.00013821162,0.014381819],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912304,0.00021628937,0.00004873424,0.00019852503,0.00024268327,0.00017072457],"domain_scores_gemma":[0.9964263,0.0018846212,0.00044820213,0.00039739802,0.0002956717,0.0005478489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063266006,0.0004618959,0.0007751816,0.001648742,0.0020471907,0.0029385777,0.0011133454,0.0010485312,0.009216282],"category_scores_gemma":[0.004682858,0.00061285275,0.0009365045,0.00082229543,0.0024016418,0.002778403,0.0018555596,0.0012085255,0.0011478558],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030957162,0.00006439458,0.0024908285,0.00013681722,0.00004640987,0.00034024025,0.00068395346,0.004140054,0.0053112595,0.9738858,0.0045424635,0.00804815],"study_design_scores_gemma":[0.000051466206,0.000033951357,0.0019164088,0.000057913705,0.000030814957,0.00041923672,0.00038446454,0.014789826,0.0025335308,0.97463065,0.005124987,0.000026876387],"about_ca_topic_score_codex":0.0011553911,"about_ca_topic_score_gemma":0.0015998633,"teacher_disagreement_score":0.009216282,"about_ca_system_score_codex":0.0012162871,"about_ca_system_score_gemma":0.0005226964,"threshold_uncertainty_score":0.030831516},"labels":[],"label_agreement":null},{"id":"W2396218735","doi":"","title":"Automorphism groups of a family of Cayley graphs of the alternating groups","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Automorphism; Cayley graph; Combinatorics; Alternating group; Vertex-transitive graph; Automorphism group; Graph; Voltage graph; Line graph","score_opus":0.08439857283584068,"score_gpt":0.32356503051547897,"score_spread":0.2391664576796383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396218735","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9261146,0.00052474486,0.032508902,0.0006415442,0.00015423507,0.000050604798,0.0001874006,0.00027796513,0.03954002],"genre_scores_gemma":[0.9826863,0.00028514964,0.006054688,0.0001101786,0.000084774256,0.000048349648,0.00029354717,0.00005145944,0.0103855515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964607,0.00009426552,0.000017053619,0.00008959982,0.00009046702,0.00006252237],"domain_scores_gemma":[0.9988493,0.00039167734,0.00022060465,0.00015952616,0.00015296118,0.0002258622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038984758,0.0005400734,0.00038826352,0.0018626968,0.001485607,0.0016224857,0.00080920436,0.0007174077,0.0039847577],"category_scores_gemma":[0.0014377274,0.00040766055,0.00071613886,0.0008835719,0.0016376551,0.001566143,0.00086890324,0.0011651076,0.00040951846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000833071,0.000045476674,0.0024868646,0.000031019707,0.000033223347,0.00059368875,0.0008090655,0.0021968468,0.0064682225,0.9750872,0.0012110125,0.0109541165],"study_design_scores_gemma":[0.00004750672,0.000081740305,0.0039483854,0.000030566618,0.000040618263,0.0008937212,0.00046907266,0.0133493645,0.0036247976,0.96678424,0.010694973,0.000035062116],"about_ca_topic_score_codex":0.0012612123,"about_ca_topic_score_gemma":0.0012172125,"teacher_disagreement_score":0.0039847577,"about_ca_system_score_codex":0.00079949026,"about_ca_system_score_gemma":0.00050625554,"threshold_uncertainty_score":0.01333034},"labels":[],"label_agreement":null},{"id":"W2396221740","doi":"","title":"Hamilton-Connectivity of Claw-Free Graphs with Bounded Dilworth Numbers.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Claw; Bounded function; Combinatorics; Mathematical analysis; Biology; Ecology","score_opus":0.021254876623232465,"score_gpt":0.24769977161974074,"score_spread":0.22644489499650827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396221740","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83044624,0.0008127328,0.05471681,0.0012975386,0.00009428395,0.00009698478,0.0012029707,0.00042508982,0.11090745],"genre_scores_gemma":[0.9806311,0.0002835023,0.007146649,0.00017891558,0.000038078255,0.000063785075,0.00073168456,0.00005607265,0.010870083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997693,0.00004846593,0.0000108921895,0.00004893632,0.000058380836,0.00006407707],"domain_scores_gemma":[0.9978289,0.0011215921,0.0003854995,0.00014614005,0.00021215652,0.00030568228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019483487,0.0003369597,0.00027684701,0.0014321622,0.0009497535,0.0013272775,0.0009278184,0.00088809896,0.012877524],"category_scores_gemma":[0.002863615,0.00037990464,0.00021710493,0.00097358646,0.0010908357,0.0019749394,0.0011133909,0.00080719736,0.0009407614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002181639,0.00008181006,0.0029040582,0.00018184677,0.00003131523,0.00064726186,0.00070474326,0.005998961,0.00810982,0.94746983,0.009903167,0.023749018],"study_design_scores_gemma":[0.000069494425,0.000041369978,0.0031188605,0.00004736022,0.000028469934,0.00040316276,0.0005192745,0.021564294,0.0028648127,0.9645799,0.00673652,0.000026514484],"about_ca_topic_score_codex":0.0030699188,"about_ca_topic_score_gemma":0.0062192557,"teacher_disagreement_score":0.012877524,"about_ca_system_score_codex":0.0007483877,"about_ca_system_score_gemma":0.00038038444,"threshold_uncertainty_score":0.043079615},"labels":[],"label_agreement":null},{"id":"W2396222681","doi":"","title":"Molds of regular tournaments.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.012643959749659733,"score_gpt":0.262233958986099,"score_spread":0.2495899992364393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396222681","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6160288,0.0011161622,0.1452728,0.001009191,0.0006912488,0.00015847858,0.0012824951,0.001064926,0.23337586],"genre_scores_gemma":[0.9456073,0.00031955965,0.01577351,0.00020888694,0.00015184752,0.00007591119,0.0006855477,0.00020431173,0.036973167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996203,0.000071306014,0.000021444994,0.00009788835,0.00008531632,0.00010369424],"domain_scores_gemma":[0.9992574,0.00019382693,0.00014203988,0.00017015047,0.0000604781,0.0001761737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021344241,0.000332879,0.00049222854,0.0008379694,0.0010797395,0.0024836527,0.00067074865,0.00057543244,0.015423523],"category_scores_gemma":[0.0015182709,0.000413949,0.00066940626,0.0005085531,0.0012271194,0.0011328436,0.0014871852,0.000859188,0.0018620852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013541312,0.00006429936,0.0015300531,0.000072779614,0.00003595729,0.0002834484,0.00026476648,0.006630234,0.0039743916,0.95896286,0.007594279,0.020451687],"study_design_scores_gemma":[0.0000918269,0.000090093934,0.001941604,0.00005202514,0.00003567049,0.000443651,0.0003180127,0.028987363,0.0024702211,0.9412277,0.024316503,0.00002535133],"about_ca_topic_score_codex":0.0012521234,"about_ca_topic_score_gemma":0.0022138488,"teacher_disagreement_score":0.015423523,"about_ca_system_score_codex":0.00053354126,"about_ca_system_score_gemma":0.0002906933,"threshold_uncertainty_score":0.05159688},"labels":[],"label_agreement":null},{"id":"W2396228699","doi":"","title":"Extremal Values for the Maximum Degree in a Twin-Free Graph.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Graph; Combinatorics; Physics","score_opus":0.06866065517937235,"score_gpt":0.3091354455956739,"score_spread":0.24047479041630154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396228699","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7670706,0.001538301,0.15240702,0.0020961983,0.00030305143,0.000046745325,0.0008566271,0.00034706236,0.07533442],"genre_scores_gemma":[0.9829161,0.00031136474,0.012594991,0.00007618542,0.00009467261,0.0000372553,0.00016221224,0.000059540613,0.0037477093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961144,0.00010457998,0.000019341089,0.00008716494,0.000089296955,0.00008825215],"domain_scores_gemma":[0.9978998,0.0011188993,0.00025834667,0.00021335737,0.00017171662,0.0003379813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074706593,0.00046501574,0.00048037578,0.002583562,0.0011479302,0.0019390049,0.0011090693,0.001106566,0.0055084117],"category_scores_gemma":[0.0057540834,0.00035505238,0.0003614572,0.0011144361,0.001913244,0.0031907626,0.0013812411,0.0014056774,0.00057463197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014909387,0.000036719088,0.0010933082,0.00009830605,0.000020854734,0.0001651287,0.0002283107,0.007068771,0.0031657547,0.9746908,0.0031212398,0.010161732],"study_design_scores_gemma":[0.000018070134,0.000017965249,0.0008368851,0.00003636716,0.000015603331,0.0002754934,0.00018007301,0.029685397,0.001619703,0.9652883,0.0020016192,0.00002449038],"about_ca_topic_score_codex":0.00037135038,"about_ca_topic_score_gemma":0.0008112951,"teacher_disagreement_score":0.0055084117,"about_ca_system_score_codex":0.0007419208,"about_ca_system_score_gemma":0.00026163945,"threshold_uncertainty_score":0.018427491},"labels":[],"label_agreement":null},{"id":"W2396250052","doi":"","title":"On the sum of reciprocal Tribonacci numbers.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Reciprocal; Mathematics; Combinatorics; Linguistics; Philosophy","score_opus":0.020628242632272857,"score_gpt":0.25630879208869095,"score_spread":0.2356805494564181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396250052","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13006973,0.008730523,0.23488581,0.0036428128,0.005304155,0.00009740169,0.0005050033,0.00044571445,0.6163188],"genre_scores_gemma":[0.82112885,0.0038540163,0.064597316,0.0016424337,0.0026340385,0.00024345207,0.00052832457,0.00046651036,0.10490511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989102,0.00024452267,0.00006922574,0.00017777988,0.00042311012,0.00017518464],"domain_scores_gemma":[0.9985643,0.00068344845,0.00014162468,0.00016646631,0.00025420365,0.00019002042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094508,0.0008460657,0.001032082,0.003123607,0.002585643,0.0034754567,0.0010878288,0.0013647551,0.015047732],"category_scores_gemma":[0.0055521675,0.00044824788,0.0005977386,0.0018244418,0.0030622913,0.006150902,0.0024869072,0.0025217708,0.0042445324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016775477,0.0000056981166,0.000052915086,0.00002865801,0.0000037569123,0.000049420643,0.000060448507,0.0002959351,0.00034899157,0.99145913,0.002698278,0.0049801013],"study_design_scores_gemma":[0.000005018836,0.000007981774,0.00009329757,0.000020854819,0.0000058135356,0.00021775928,0.000035877023,0.0027848529,0.00040957297,0.9879106,0.008495279,0.000013121774],"about_ca_topic_score_codex":0.0006702023,"about_ca_topic_score_gemma":0.0011641042,"teacher_disagreement_score":0.015047732,"about_ca_system_score_codex":0.0012527198,"about_ca_system_score_gemma":0.0005240376,"threshold_uncertainty_score":0.05033964},"labels":[],"label_agreement":null},{"id":"W2396269925","doi":"","title":"Atom-bond connectivity index of unicyclic graphs with perfect matchings.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Atom (system on chip); Index (typography); Topological index; Computer science; World Wide Web","score_opus":0.013613071246342158,"score_gpt":0.2545618158380783,"score_spread":0.24094874459173615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396269925","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.874518,0.0016733003,0.02288502,0.0011229443,0.00014166831,0.000051727064,0.0018890422,0.0002809372,0.097437456],"genre_scores_gemma":[0.99254507,0.0004111519,0.0032357478,0.00006150803,0.00005612153,0.000036170328,0.0005271363,0.000033511536,0.0030936543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974483,0.000061382605,0.00001359268,0.000051721636,0.00007316862,0.000055240896],"domain_scores_gemma":[0.998128,0.0007928513,0.00045324728,0.00016505101,0.00018671755,0.00027423698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033588847,0.00028083628,0.00046657622,0.0022566488,0.0009541388,0.001593372,0.0010036175,0.00081871374,0.008277307],"category_scores_gemma":[0.0033459472,0.00021875289,0.00015661366,0.0017226607,0.0008102387,0.002024336,0.0009076768,0.00060752645,0.0006129698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003953631,0.00009388037,0.0053486987,0.00029069823,0.000048771195,0.00025304253,0.00044509838,0.011966404,0.006627192,0.92358565,0.016461693,0.034483556],"study_design_scores_gemma":[0.000062831146,0.000084486725,0.006224441,0.000091961796,0.00006462834,0.0006083421,0.00053245993,0.071627416,0.0043458343,0.9045823,0.011742031,0.000033340995],"about_ca_topic_score_codex":0.0010042833,"about_ca_topic_score_gemma":0.00140407,"teacher_disagreement_score":0.008277307,"about_ca_system_score_codex":0.0007600014,"about_ca_system_score_gemma":0.0003296316,"threshold_uncertainty_score":0.027690291},"labels":[],"label_agreement":null},{"id":"W2396292359","doi":"","title":"On f-Derivations Of B-Algebras.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Fuzzy and Soft Set Theory","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics; Algebra over a field","score_opus":0.09042736313132466,"score_gpt":0.32289953565340757,"score_spread":0.2324721725220829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396292359","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1000513,0.009482695,0.60967064,0.0042794636,0.0008109884,0.00014918286,0.0010044805,0.00028887382,0.2742625],"genre_scores_gemma":[0.8158939,0.0051333453,0.13588205,0.0017067919,0.00083172525,0.00018063471,0.00078409165,0.00012618335,0.039461356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979631,0.0008615749,0.00015349957,0.00027386344,0.00054367544,0.00020433388],"domain_scores_gemma":[0.9971444,0.0013535145,0.00027737257,0.00030112613,0.0005806805,0.00034293265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025548465,0.00057129364,0.0008052633,0.0034828947,0.0024420645,0.0030343854,0.0008344257,0.0012206796,0.008421172],"category_scores_gemma":[0.0053489357,0.00041995445,0.0011675361,0.0023086492,0.0045542778,0.0068238904,0.0030269572,0.0022721943,0.0021679094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062977592,0.000006711798,0.000103532344,0.000021704582,0.0000072708176,0.000048980084,0.00009568887,0.000312267,0.00013380499,0.99467975,0.0006235327,0.00396036],"study_design_scores_gemma":[0.000004334694,0.0000044288176,0.00006733773,0.0000138874875,0.0000025418906,0.00005813573,0.000034819437,0.0008877589,0.000076636046,0.99609417,0.0027511667,0.000004734605],"about_ca_topic_score_codex":0.0015237391,"about_ca_topic_score_gemma":0.0018020236,"teacher_disagreement_score":0.008421172,"about_ca_system_score_codex":0.00179226,"about_ca_system_score_gemma":0.0009420324,"threshold_uncertainty_score":0.028171659},"labels":[],"label_agreement":null},{"id":"W2396321070","doi":"","title":"Relationship Between Modified Zagreb Indices And Reformulated Modified Zagreb Indices With Respect To Trees.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Theoretical and Computational Physics","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Statistics; Applied mathematics","score_opus":0.028542346157416316,"score_gpt":0.2628013684247949,"score_spread":0.23425902226737857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396321070","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37776062,0.0031132856,0.30966696,0.0022504276,0.0019205252,0.00015301543,0.0010536242,0.0006410811,0.30344048],"genre_scores_gemma":[0.8884317,0.0011491042,0.06880416,0.000661453,0.001051394,0.00013888365,0.0006089908,0.00044148308,0.03871285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988642,0.00033000775,0.000088586814,0.00019471481,0.00032604768,0.00019655176],"domain_scores_gemma":[0.9969472,0.00085405284,0.0006780507,0.00046793505,0.00056538126,0.00048746026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014899508,0.00056422414,0.0007392943,0.0027069012,0.0019091172,0.003719218,0.0015124399,0.0009917842,0.012149538],"category_scores_gemma":[0.008052148,0.00035015141,0.00054465304,0.002105582,0.002447897,0.0068413247,0.0020812647,0.003226098,0.0022379318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019701978,0.000010408683,0.00015103475,0.000013657734,0.00000373796,0.00003084991,0.0000677378,0.0004607844,0.00025153847,0.9937888,0.0007402898,0.0044614463],"study_design_scores_gemma":[0.00001005697,0.000021283378,0.00032451833,0.00001916031,0.000009061685,0.00011122919,0.00005621355,0.0058445265,0.0003675739,0.986479,0.0067404206,0.000016854949],"about_ca_topic_score_codex":0.0011505284,"about_ca_topic_score_gemma":0.0013669039,"teacher_disagreement_score":0.012149538,"about_ca_system_score_codex":0.0012176093,"about_ca_system_score_gemma":0.00067127176,"threshold_uncertainty_score":0.040644288},"labels":[],"label_agreement":null},{"id":"W2396335147","doi":"","title":"A note on Lagrangians of 4-uniform hypergraphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.03103752284669656,"score_gpt":0.30422361072703535,"score_spread":0.27318608788033877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396335147","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07547606,0.0076068537,0.17874634,0.008250517,0.0025876598,0.000060691495,0.0009064468,0.00042848024,0.72593695],"genre_scores_gemma":[0.68586504,0.007966878,0.1118643,0.004307798,0.0020438675,0.00014310297,0.0009644388,0.0006634878,0.18618114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960107,0.00015589969,0.00002182487,0.000063888125,0.0001002636,0.00005715316],"domain_scores_gemma":[0.9994286,0.00023313765,0.00006689023,0.00008572206,0.00008374493,0.00010193969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066657685,0.00045716384,0.0004616402,0.0016493244,0.0016424819,0.0019371003,0.0008252937,0.00069412915,0.01611889],"category_scores_gemma":[0.0015983947,0.00041421145,0.0006166012,0.0013826368,0.0024215104,0.00487331,0.0027321994,0.0026553164,0.0025483284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001034468,0.0000050809035,0.000070430615,0.00003344827,0.000003020245,0.00006661003,0.0001337381,0.00028940043,0.00037065143,0.9901215,0.0041330843,0.0047628386],"study_design_scores_gemma":[0.000004313193,0.000010389785,0.0001732728,0.00002971228,0.0000050443023,0.0001078932,0.000100198755,0.0012931562,0.00026527565,0.96276265,0.035239905,0.000008151071],"about_ca_topic_score_codex":0.0013776498,"about_ca_topic_score_gemma":0.00276323,"teacher_disagreement_score":0.01611889,"about_ca_system_score_codex":0.0011496225,"about_ca_system_score_gemma":0.00040143475,"threshold_uncertainty_score":0.05392301},"labels":[],"label_agreement":null},{"id":"W2396337055","doi":"","title":"Gaussian Jacobsthal and Gaussian Jacobsthal Lucas numbers","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Gaussian; Lucas number; Combinatorics; Chemistry; Computational chemistry","score_opus":0.007031554603754949,"score_gpt":0.2455159591631932,"score_spread":0.23848440455943823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396337055","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38300154,0.002693025,0.17049558,0.011113444,0.0016771047,0.00012064236,0.0008502586,0.0008096452,0.42923877],"genre_scores_gemma":[0.86950874,0.0011883198,0.01977046,0.0014103649,0.0014276343,0.0000872533,0.00022527561,0.000218103,0.10616388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991352,0.00014296574,0.000034617282,0.00013965115,0.00033143352,0.00021608891],"domain_scores_gemma":[0.99824905,0.00043020386,0.0003110537,0.0002541239,0.0004063596,0.00034913787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009552553,0.0008314747,0.00083255256,0.0030926703,0.002472409,0.003700083,0.0010857261,0.0015474174,0.012649569],"category_scores_gemma":[0.0043750857,0.00044080816,0.00074344315,0.0021829482,0.0052666124,0.0061064167,0.0026899215,0.0032429532,0.0021011701],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060562243,0.0000030257868,0.000035103578,0.000004406156,6.7320775e-7,0.000011236588,0.000048774986,0.00009462937,0.0000662019,0.99822813,0.0005590803,0.0009428225],"study_design_scores_gemma":[0.0000054264005,0.0000040882605,0.00010676997,0.0000050470867,0.0000020747798,0.00004208339,0.000038328613,0.0010017229,0.00010187158,0.9953187,0.0033646298,0.0000092801265],"about_ca_topic_score_codex":0.0017900637,"about_ca_topic_score_gemma":0.0016825389,"teacher_disagreement_score":0.012649569,"about_ca_system_score_codex":0.0021417232,"about_ca_system_score_gemma":0.001314898,"threshold_uncertainty_score":0.042317033},"labels":[],"label_agreement":null},{"id":"W2396340122","doi":"","title":"A Census of all 5-regular planar graphs with diameter 3.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Planar; Planar graph; Census; Combinatorics; Graph; Demography; Computer science; Sociology; Computer graphics (images); Population","score_opus":0.014944318178495206,"score_gpt":0.23064858164499977,"score_spread":0.21570426346650456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396340122","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8395932,0.0037033984,0.022375368,0.0014294487,0.00013779852,0.00016099344,0.056243062,0.0011775449,0.07517922],"genre_scores_gemma":[0.9347653,0.001801867,0.012151381,0.00022091216,0.00006190446,0.00014617913,0.03977539,0.00029757727,0.0107794115],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932647,0.00008598225,0.000032366854,0.00018979801,0.00019637079,0.0001689901],"domain_scores_gemma":[0.99772197,0.0008444716,0.00026172053,0.00031468342,0.0004747977,0.0003823721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034141514,0.00031037309,0.0004516672,0.0024203944,0.0009567586,0.0014493936,0.0007552703,0.000619036,0.017085157],"category_scores_gemma":[0.003144589,0.00030137278,0.00044143596,0.00331111,0.0005682979,0.001425034,0.0008955623,0.0006856632,0.0029369143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020807143,0.0004090388,0.07361237,0.001605406,0.00027144983,0.00299573,0.002874709,0.028599642,0.044113275,0.28022668,0.2050458,0.3581652],"study_design_scores_gemma":[0.00029041633,0.000583961,0.162974,0.00032121886,0.00024846784,0.015773693,0.0051053255,0.06515743,0.018493801,0.18111515,0.5497898,0.00014679399],"about_ca_topic_score_codex":0.004789875,"about_ca_topic_score_gemma":0.0061292606,"teacher_disagreement_score":0.017085157,"about_ca_system_score_codex":0.00058194716,"about_ca_system_score_gemma":0.00089108344,"threshold_uncertainty_score":0.05715555},"labels":[],"label_agreement":null},{"id":"W2396374426","doi":"","title":"An Inductive Proof Of A Result About Bulgarian Solitaire.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Literary, Cultural, Historical Analysis","field":"Arts and Humanities","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bulgarian; Mathematics; Solitaire Cryptographic Algorithm; Linguistics; Psychology; Philosophy","score_opus":0.014410385376503607,"score_gpt":0.22873519027626552,"score_spread":0.2143248048997619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396374426","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048788525,0.0063027893,0.10397258,0.016898682,0.0019311684,0.00012615169,0.0013698012,0.00080805714,0.8198021],"genre_scores_gemma":[0.8684336,0.0031221593,0.041868065,0.0030719028,0.0006013013,0.0002216227,0.0011012863,0.00037526485,0.08120488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931204,0.00022032076,0.000034128258,0.00012859814,0.000148014,0.00015699088],"domain_scores_gemma":[0.9989089,0.00061915943,0.00005836905,0.00010408167,0.0002354205,0.000074121526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011131257,0.00076644507,0.0006327037,0.0016265002,0.0031478445,0.0024038248,0.0010986839,0.0009188754,0.02011259],"category_scores_gemma":[0.003093007,0.00046433054,0.0011671704,0.0017762885,0.0064825853,0.0048820595,0.004539795,0.0032412368,0.0022123377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019558305,0.000013874762,0.00020491406,0.000118267955,0.000014854801,0.00025569447,0.001094298,0.00022393906,0.00036505694,0.98517936,0.0067526363,0.0057576704],"study_design_scores_gemma":[0.00002452125,0.00001560529,0.0013034171,0.00013032237,0.000033248194,0.00032280394,0.0011104845,0.00045354347,0.0011736925,0.8988992,0.09651594,0.000017304925],"about_ca_topic_score_codex":0.009272148,"about_ca_topic_score_gemma":0.010140999,"teacher_disagreement_score":0.02011259,"about_ca_system_score_codex":0.0035546974,"about_ca_system_score_gemma":0.0009854105,"threshold_uncertainty_score":0.06728339},"labels":[],"label_agreement":null},{"id":"W2396398939","doi":"","title":"Newton's Identities.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Historical Philosophy and Science","field":"Arts and Humanities","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics; Applied mathematics; Calculus (dental); Medicine","score_opus":0.026177092300850965,"score_gpt":0.2228543927993285,"score_spread":0.19667730049847754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396398939","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020052153,0.0068577244,0.01574756,0.005878993,0.0009572296,0.00001047602,0.000531012,0.00016357351,0.9678481],"genre_scores_gemma":[0.2676512,0.00960633,0.024374748,0.0035871596,0.002189155,0.00010497006,0.0010057343,0.00042252857,0.69105816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958485,0.00011844273,0.000017507482,0.00009376609,0.00014675158,0.000038664977],"domain_scores_gemma":[0.99963605,0.00013247217,0.000026052796,0.00007394016,0.0001060029,0.000025375391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005006481,0.00042887166,0.00038736718,0.0010422916,0.0019093362,0.002167494,0.0005450849,0.00086973194,0.036489323],"category_scores_gemma":[0.0014955542,0.00027251683,0.00039039316,0.0009102143,0.0024454715,0.0033995756,0.0011534359,0.0022763698,0.010773428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004158482,0.0000030751837,0.000041527852,0.000018051827,0.000002170693,0.000009489964,0.0001281222,0.0000427673,0.000038917904,0.96437377,0.027300887,0.008036976],"study_design_scores_gemma":[0.000005496781,0.000002977578,0.00022512903,0.00002871145,0.000004605636,0.00006133369,0.00009388767,0.00018514653,0.00011602716,0.6789708,0.32030216,0.000003702777],"about_ca_topic_score_codex":0.003505948,"about_ca_topic_score_gemma":0.004831984,"teacher_disagreement_score":0.036489323,"about_ca_system_score_codex":0.0014499935,"about_ca_system_score_gemma":0.00075332733,"threshold_uncertainty_score":0.122069},"labels":[],"label_agreement":null},{"id":"W2396405335","doi":"","title":"Component Order Edge Connectivity For Graphs Of Fixed Size And Order.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Order (exchange); Component (thermodynamics); Combinatorics; Computer science; Telecommunications; Business; Physics","score_opus":0.01096187036302483,"score_gpt":0.22925398175697692,"score_spread":0.2182921113939521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396405335","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52341104,0.0029754224,0.3582863,0.0028531558,0.00036647913,0.0001446309,0.0025516143,0.001461516,0.107949905],"genre_scores_gemma":[0.95246786,0.0015079443,0.027142867,0.00025065336,0.0001872597,0.00011081129,0.0010918851,0.00022076225,0.017019957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961746,0.000079360216,0.000024922101,0.000091743066,0.000097025666,0.00008953404],"domain_scores_gemma":[0.9956328,0.0024676595,0.00051884115,0.0006214509,0.00047946078,0.00027976517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004502072,0.00036471902,0.00046060942,0.0020042066,0.0008991954,0.0019495256,0.0010155573,0.000964765,0.008491588],"category_scores_gemma":[0.0067611546,0.00038324573,0.000440651,0.0014748985,0.001362481,0.0034318473,0.00073446194,0.0011041658,0.00083090604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015090923,0.000037962407,0.0020482454,0.00021036863,0.000024832709,0.0002465012,0.00024922236,0.018729493,0.0033490928,0.9412954,0.009887478,0.02377049],"study_design_scores_gemma":[0.00003791685,0.000054214222,0.0019087393,0.000047037316,0.000047143298,0.0006433873,0.00018546826,0.06288183,0.0020881721,0.9199296,0.012153109,0.000023402215],"about_ca_topic_score_codex":0.0023259304,"about_ca_topic_score_gemma":0.0040192357,"teacher_disagreement_score":0.008491588,"about_ca_system_score_codex":0.001212492,"about_ca_system_score_gemma":0.0006013669,"threshold_uncertainty_score":0.028407156},"labels":[],"label_agreement":null},{"id":"W2396433490","doi":"","title":"Asymptotic behavior of Laplacian-energy-like invariant of some graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Invariant (physics); Laplace operator; Pure mathematics; Mathematical analysis; Mathematical physics","score_opus":0.01712936372317403,"score_gpt":0.25606075154094093,"score_spread":0.2389313878177669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396433490","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8365012,0.0015475935,0.09352054,0.0025209403,0.00037363273,0.00004369186,0.00050289,0.0009838267,0.06400574],"genre_scores_gemma":[0.9887982,0.00030508227,0.004322347,0.00017588004,0.0002059492,0.00003713811,0.00031773438,0.00014288559,0.005694757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969363,0.000095153366,0.000009495614,0.00005326641,0.00007742202,0.000070997536],"domain_scores_gemma":[0.99727637,0.001090842,0.0003910484,0.00022618995,0.0004471609,0.0005685016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006180875,0.0005343502,0.0004965395,0.0025264637,0.0009242385,0.0009802277,0.0013439078,0.0009129764,0.007138343],"category_scores_gemma":[0.006903341,0.00022293632,0.0005150857,0.00071476464,0.0014620577,0.002196464,0.0010136743,0.0010907623,0.0006606577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013617113,0.000115572686,0.0031553402,0.00015060471,0.00004978822,0.00047119148,0.0003371374,0.012671176,0.009839665,0.9570337,0.0077458206,0.008293881],"study_design_scores_gemma":[0.0000314073,0.000062908264,0.0055262963,0.000053462416,0.000028667202,0.0006199623,0.00028646897,0.27912903,0.001900014,0.7101572,0.0021525228,0.000052055886],"about_ca_topic_score_codex":0.0011396799,"about_ca_topic_score_gemma":0.001258938,"teacher_disagreement_score":0.007138343,"about_ca_system_score_codex":0.0008877128,"about_ca_system_score_gemma":0.00041466896,"threshold_uncertainty_score":0.023880124},"labels":[],"label_agreement":null},{"id":"W2396453406","doi":"","title":"On B 5 -Groups.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.004271150010058413,"score_gpt":0.1785782616277607,"score_spread":0.1743071116177023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396453406","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16599399,0.0029236344,0.1823714,0.0044549415,0.0016346878,0.0001426582,0.0008120931,0.0005494394,0.64111716],"genre_scores_gemma":[0.8142364,0.0017229171,0.046135172,0.0018808272,0.0007592249,0.0001987512,0.00088479003,0.00022670474,0.13395512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913245,0.00024978057,0.000040067316,0.00014566847,0.00022038707,0.00021178779],"domain_scores_gemma":[0.9990814,0.0002814832,0.00018338974,0.00011764691,0.00016939893,0.00016666882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054032303,0.0008055158,0.0004623459,0.0028329394,0.001764951,0.0024788266,0.0006901099,0.0009063981,0.022118224],"category_scores_gemma":[0.0014319863,0.0002742896,0.0006453638,0.0012739543,0.0019017643,0.0028664432,0.002674004,0.0019120278,0.0049715796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029174686,0.000016641477,0.00011395618,0.00002818696,0.0000066999205,0.000055876964,0.00012799064,0.0003910803,0.00059980375,0.9883781,0.002871868,0.00738063],"study_design_scores_gemma":[0.000014425162,0.000019424548,0.00023796968,0.00003323153,0.0000057038064,0.00011349201,0.00013633465,0.0022951993,0.0006047616,0.97942114,0.017107472,0.0000108999775],"about_ca_topic_score_codex":0.0012851182,"about_ca_topic_score_gemma":0.001512671,"teacher_disagreement_score":0.022118224,"about_ca_system_score_codex":0.0012165236,"about_ca_system_score_gemma":0.00055179896,"threshold_uncertainty_score":0.07399279},"labels":[],"label_agreement":null},{"id":"W2396457618","doi":"","title":"Maximum Randic Index on Unicyclic Graphs with k Pendant Vertices.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Index (typography); Topological index; Computer science; World Wide Web","score_opus":0.016064164616172733,"score_gpt":0.25934707514566663,"score_spread":0.24328291052949388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396457618","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7662483,0.0036047408,0.03847609,0.0014553634,0.00021643724,0.00007587221,0.0022601013,0.0005199586,0.18714324],"genre_scores_gemma":[0.97702855,0.0009126141,0.010676957,0.00013452859,0.00008972293,0.00004631354,0.0006767094,0.000082371225,0.010352296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949837,0.00012520852,0.000032514097,0.00010159082,0.00010948348,0.00013274503],"domain_scores_gemma":[0.9976895,0.0010521366,0.0004424069,0.0002902958,0.00019745452,0.00032823722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004081779,0.00038527587,0.0007331305,0.0020577398,0.0012695965,0.002201667,0.0009693889,0.00077844126,0.0076426365],"category_scores_gemma":[0.0041077225,0.00030845922,0.00024595903,0.0015479097,0.0010780385,0.002014667,0.0013168794,0.0006867596,0.0013464135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013957166,0.00010947403,0.005097593,0.0007827043,0.000067921865,0.0006502088,0.00085887284,0.017652975,0.02117798,0.8484788,0.021973772,0.08175408],"study_design_scores_gemma":[0.00015355089,0.00016983975,0.0055558668,0.00021212161,0.000092151575,0.0019498939,0.0006500201,0.044433277,0.013765552,0.9083971,0.024551526,0.00006922163],"about_ca_topic_score_codex":0.0006495338,"about_ca_topic_score_gemma":0.0014379778,"teacher_disagreement_score":0.0076426365,"about_ca_system_score_codex":0.0008717938,"about_ca_system_score_gemma":0.00036734974,"threshold_uncertainty_score":0.025567114},"labels":[],"label_agreement":null},{"id":"W2396468862","doi":"","title":"On the Laplacian-Energy-Like of graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Laplace operator; Mathematical analysis","score_opus":0.018393152521764877,"score_gpt":0.24685145570362318,"score_spread":0.2284583031818583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396468862","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28006172,0.012051413,0.23672521,0.016986907,0.002246501,0.0000785635,0.0010005217,0.0005023338,0.4503467],"genre_scores_gemma":[0.912957,0.0043262616,0.023578549,0.002772148,0.0018996567,0.000091223104,0.0005354665,0.00022810225,0.05361153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996371,0.00013200633,0.000013605301,0.00006463565,0.000100106314,0.000052503226],"domain_scores_gemma":[0.9987784,0.0005453495,0.00014285868,0.00013849005,0.00017212288,0.00022275311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058532675,0.0005769589,0.00044058758,0.0023595777,0.0011231359,0.0017636855,0.0009917842,0.0015158043,0.00762345],"category_scores_gemma":[0.0037895706,0.00028001922,0.0004754648,0.0011277362,0.0028400645,0.0044316608,0.0016153866,0.0018846886,0.0010401857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053641306,0.0000062424,0.00009955545,0.00002044157,0.0000025897318,0.00002817702,0.00006333575,0.00055947196,0.00021553435,0.99423015,0.002379343,0.002389732],"study_design_scores_gemma":[0.0000020165157,0.0000038698518,0.00011266358,0.0000075070707,0.0000014559575,0.00005545266,0.000039780058,0.0027390765,0.00004481597,0.99527174,0.0017184889,0.0000031525315],"about_ca_topic_score_codex":0.0009086714,"about_ca_topic_score_gemma":0.0011281611,"teacher_disagreement_score":0.00762345,"about_ca_system_score_codex":0.0007926448,"about_ca_system_score_gemma":0.000269142,"threshold_uncertainty_score":0.02550304},"labels":[],"label_agreement":null},{"id":"W2396479523","doi":"","title":"The t-Pebbling Number And 2t-Pebbling Property On The Graph D n , C 2m .","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Property (philosophy); Graph; Discrete mathematics","score_opus":0.018688157710293724,"score_gpt":0.20891783927471635,"score_spread":0.19022968156442263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396479523","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41240925,0.0013390001,0.2511489,0.005710272,0.00083275704,0.00016039555,0.0016036655,0.0006751555,0.32612053],"genre_scores_gemma":[0.9178841,0.0008272892,0.03440366,0.0007844802,0.00036587776,0.00019677894,0.0006719435,0.00018775775,0.044678155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994404,0.00009006176,0.000024805018,0.00015740383,0.00013611169,0.00015129586],"domain_scores_gemma":[0.99789256,0.0008763119,0.0003079226,0.00032353334,0.00028114024,0.00031860432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043917613,0.0004630333,0.00053684687,0.0013490032,0.0018789896,0.002283256,0.0006256409,0.0012802638,0.016079359],"category_scores_gemma":[0.0033222574,0.00032940164,0.00042836196,0.0011791105,0.0023180733,0.0039453767,0.0014001449,0.0020355645,0.0026792677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008894155,0.000035738605,0.0003515641,0.00007319685,0.000006345401,0.0002326029,0.00016982379,0.0017363349,0.004397121,0.9714485,0.0076659806,0.013793786],"study_design_scores_gemma":[0.000022174028,0.00003582543,0.00069280167,0.000024331119,0.0000066485363,0.0005261357,0.00008343226,0.00807919,0.002760399,0.9795518,0.008193258,0.000024077006],"about_ca_topic_score_codex":0.0011622449,"about_ca_topic_score_gemma":0.0014186125,"teacher_disagreement_score":0.016079359,"about_ca_system_score_codex":0.0009007324,"about_ca_system_score_gemma":0.0008315603,"threshold_uncertainty_score":0.053790867},"labels":[],"label_agreement":null},{"id":"W2396482382","doi":"","title":"An operation based on complete graphs with an application to the line graphs of trees.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Line (geometry); Pathwidth; Combinatorics; 1-planar graph; Indifference graph; Chordal graph; Line graph; Graph; Geometry","score_opus":0.020715606604939138,"score_gpt":0.2927934108021639,"score_spread":0.27207780419722477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396482382","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059388574,0.0011496947,0.84311247,0.001482722,0.0015430917,0.00018699646,0.00068331906,0.0019579546,0.09049516],"genre_scores_gemma":[0.49921423,0.0018802998,0.43739435,0.0012239937,0.0017020368,0.00035749224,0.0010021534,0.0014729339,0.05575249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991425,0.00023826491,0.00005553496,0.0002511144,0.00021214307,0.00010040004],"domain_scores_gemma":[0.99814975,0.00074331544,0.0001571676,0.0003512133,0.00034736248,0.00025118067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008148875,0.00043103448,0.0005013234,0.0018716466,0.0015192595,0.002058155,0.000925325,0.0007591889,0.007780378],"category_scores_gemma":[0.00350981,0.0002868259,0.0011536606,0.001926853,0.002689658,0.005646929,0.0028032984,0.0018655956,0.0016191184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078254634,0.000050364502,0.0002505995,0.00008693778,0.000016251342,0.00019381364,0.0003672336,0.0010890717,0.0031521663,0.9288256,0.008803156,0.05708653],"study_design_scores_gemma":[0.000027656753,0.00014394522,0.0007620259,0.000054091903,0.00005182655,0.0009786385,0.00041270367,0.012429811,0.006172251,0.8854384,0.09346076,0.00006776264],"about_ca_topic_score_codex":0.000827121,"about_ca_topic_score_gemma":0.0010324636,"teacher_disagreement_score":0.007780378,"about_ca_system_score_codex":0.0005450989,"about_ca_system_score_gemma":0.00052209245,"threshold_uncertainty_score":0.026027918},"labels":[],"label_agreement":null},{"id":"W2396519162","doi":"","title":"On cycle resonant outerplanar graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Outerplanar graph; Combinatorics; 1-planar graph; Pathwidth; Chordal graph; Graph; Line graph","score_opus":0.004088020985194442,"score_gpt":0.1838476270716802,"score_spread":0.17975960608648575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396519162","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26714152,0.0034067617,0.37493938,0.0029345443,0.0006705116,0.0001192455,0.0006943211,0.0005198628,0.34957394],"genre_scores_gemma":[0.9083832,0.0022898507,0.030597862,0.0008331845,0.00032978502,0.000097581564,0.00045139634,0.00016082021,0.05685649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995523,0.00012880289,0.000013942853,0.00008570095,0.000107015,0.000112256166],"domain_scores_gemma":[0.9986193,0.0008144392,0.00017045227,0.00014177465,0.00014179223,0.00011220808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003027687,0.00045179724,0.0003654877,0.0015310504,0.00093251653,0.0010639633,0.00068925344,0.0007271944,0.014140875],"category_scores_gemma":[0.0028253011,0.00024479977,0.00031095956,0.0010043967,0.0012391512,0.002290454,0.0015277155,0.001162128,0.0015741993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000377879,0.000017470673,0.000260648,0.000081903505,0.000008312046,0.00011836348,0.00016963795,0.006031554,0.0016797811,0.9727806,0.005285557,0.013528336],"study_design_scores_gemma":[0.0000119976185,0.00001779596,0.00031793557,0.000036269914,0.000008064075,0.00019868446,0.00016418105,0.02392605,0.0008432718,0.9618077,0.012656728,0.000011260181],"about_ca_topic_score_codex":0.0014493212,"about_ca_topic_score_gemma":0.0021832618,"teacher_disagreement_score":0.014140875,"about_ca_system_score_codex":0.00092690263,"about_ca_system_score_gemma":0.00038297952,"threshold_uncertainty_score":0.04730594},"labels":[],"label_agreement":null},{"id":"W2396520109","doi":"","title":"On The Tree Domination Number Of A Random Graph.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Tree (set theory); Graph; Random graph; Discrete mathematics","score_opus":0.024008109633209703,"score_gpt":0.2956903190151385,"score_spread":0.2716822093819288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396520109","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6658047,0.005930978,0.20439534,0.01299149,0.00079924817,0.00021535541,0.0027338967,0.0008359527,0.106293045],"genre_scores_gemma":[0.9747004,0.0018958746,0.013922572,0.00065012986,0.0008544488,0.00027255912,0.000647002,0.00022197713,0.0068349126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975775,0.0011471236,0.000087596876,0.00040717146,0.00043082784,0.00034976288],"domain_scores_gemma":[0.9422609,0.04829723,0.003120842,0.0023445445,0.001388502,0.0025880116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041220672,0.0007939129,0.0014711784,0.0046354434,0.0016456869,0.0032825198,0.0023822088,0.002072397,0.008861633],"category_scores_gemma":[0.040619083,0.0006665775,0.0006040544,0.0026405014,0.0040917094,0.0079974085,0.002299433,0.0028625545,0.0010791672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042685762,0.00008076833,0.0038809564,0.0002545186,0.000070380505,0.00014975539,0.00037636887,0.03867874,0.0027371866,0.9189371,0.015364478,0.019042963],"study_design_scores_gemma":[0.000092264934,0.00006587881,0.002311206,0.00011230178,0.000049972627,0.00034377392,0.00012295136,0.16491139,0.0013463766,0.8265925,0.003989392,0.00006195952],"about_ca_topic_score_codex":0.0010788753,"about_ca_topic_score_gemma":0.0013055477,"teacher_disagreement_score":0.008861633,"about_ca_system_score_codex":0.002541672,"about_ca_system_score_gemma":0.00093402725,"threshold_uncertainty_score":0.029645085},"labels":[],"label_agreement":null},{"id":"W2396528065","doi":"","title":"Binomial Identities Involving The Generalized Fibonacci Type Polynomials.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Fibonacci number; Type (biology); Fibonacci polynomials; Binomial coefficient; Binomial (polynomial); Pure mathematics; Combinatorics; Discrete mathematics; Orthogonal polynomials; Difference polynomials; Statistics","score_opus":0.026385790795260773,"score_gpt":0.25866857092214257,"score_spread":0.2322827801268818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396528065","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10755052,0.011162902,0.24435924,0.0041914573,0.0048272875,0.00012772066,0.0007980943,0.00045000997,0.6265328],"genre_scores_gemma":[0.7931937,0.0061884685,0.07113316,0.002082359,0.0029862232,0.00017844132,0.00050877844,0.00024867672,0.12348021],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991365,0.00021134112,0.00004074113,0.00009153982,0.00037588133,0.00014401482],"domain_scores_gemma":[0.9989968,0.0003767884,0.00011291607,0.0001291553,0.0002743137,0.00011016245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010942349,0.00066201034,0.0009463693,0.0026464208,0.002147932,0.0032511237,0.0008460552,0.0012079092,0.012893292],"category_scores_gemma":[0.0045286575,0.00043117994,0.00093120075,0.0019753878,0.0024046367,0.0041773855,0.0013723733,0.0021667257,0.0033916202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000651308,0.0000038075625,0.000055231605,0.000021453365,0.0000024009757,0.00007137618,0.00004514907,0.00020258003,0.0002805385,0.9937616,0.0021925506,0.003356764],"study_design_scores_gemma":[0.0000060933426,0.00000548536,0.00014488341,0.000021035177,0.0000052608207,0.0002891398,0.000037308382,0.0026140492,0.00023228404,0.98927796,0.0073539745,0.000012427833],"about_ca_topic_score_codex":0.0013484258,"about_ca_topic_score_gemma":0.0025197638,"teacher_disagreement_score":0.012893292,"about_ca_system_score_codex":0.001145251,"about_ca_system_score_gemma":0.0009804304,"threshold_uncertainty_score":0.043132365},"labels":[],"label_agreement":null},{"id":"W2396528273","doi":"","title":"On the generalized antiaverage problem.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.00804163962185088,"score_gpt":0.22174068237473257,"score_spread":0.2136990427528817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396528273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20728362,0.00535809,0.53048116,0.014075807,0.0019011694,0.00010401361,0.0011992679,0.0010762176,0.23852079],"genre_scores_gemma":[0.8553506,0.0030390627,0.087468565,0.0022477724,0.002412093,0.00015278097,0.0016097222,0.000490045,0.047229365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990299,0.00031995057,0.000035636993,0.00018897276,0.00021405498,0.00021155208],"domain_scores_gemma":[0.99672323,0.0020351028,0.0002446901,0.00040051693,0.0002920048,0.00030443174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001064013,0.0006735528,0.0011208048,0.0011129407,0.0019320898,0.002325189,0.001742967,0.0015549251,0.016711472],"category_scores_gemma":[0.0068640285,0.0002775685,0.00050196244,0.0017162437,0.0016862497,0.0063971854,0.0023850594,0.0023919677,0.0023991822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010029498,0.000060960032,0.0006190865,0.00010282745,0.000028986862,0.00011120641,0.000089349196,0.008205222,0.0005386283,0.9240252,0.02379094,0.0423274],"study_design_scores_gemma":[0.000013488841,0.000011052118,0.00021076127,0.000012169196,0.0000068256954,0.0000813534,0.000057367415,0.023054985,0.00022693149,0.9712524,0.0050655673,0.0000070541832],"about_ca_topic_score_codex":0.0015925417,"about_ca_topic_score_gemma":0.0026145657,"teacher_disagreement_score":0.016711472,"about_ca_system_score_codex":0.0009901399,"about_ca_system_score_gemma":0.00087104854,"threshold_uncertainty_score":0.05590546},"labels":[],"label_agreement":null},{"id":"W2396534911","doi":"","title":"On 3-chromatically unique and 3-chromatically equivalent hypergraphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.005373679332127583,"score_gpt":0.19919617429079325,"score_spread":0.19382249495866566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396534911","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4077579,0.0024298148,0.25132903,0.0029938137,0.0007723614,0.00014646274,0.0010643016,0.00045719024,0.33304912],"genre_scores_gemma":[0.8946622,0.0015151823,0.05735081,0.0011080268,0.00048051335,0.000109261324,0.0009061697,0.0002458647,0.04362192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986929,0.0004567709,0.000056593635,0.00028788543,0.00024687467,0.00025891647],"domain_scores_gemma":[0.9967789,0.0017699896,0.0004118881,0.0003407207,0.00036326057,0.00033530282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008257987,0.0005971959,0.000588781,0.002377782,0.0026656839,0.002669208,0.001065058,0.0013620782,0.013187555],"category_scores_gemma":[0.0045743203,0.0005587307,0.00075620867,0.0017742729,0.0028498934,0.005236307,0.0029450536,0.0024031377,0.0016026091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006966772,0.00003075416,0.00040347181,0.0000686272,0.000015027138,0.00030072138,0.00039425978,0.0017839673,0.0012840352,0.98328143,0.0027954155,0.009572554],"study_design_scores_gemma":[0.000010301765,0.000011079788,0.00037938435,0.000030095418,0.000013524146,0.00032253435,0.00024844994,0.0035890813,0.0005653667,0.9891861,0.005630308,0.000013698005],"about_ca_topic_score_codex":0.0018063551,"about_ca_topic_score_gemma":0.002977949,"teacher_disagreement_score":0.013187555,"about_ca_system_score_codex":0.0016897556,"about_ca_system_score_gemma":0.00065302063,"threshold_uncertainty_score":0.044116795},"labels":[],"label_agreement":null},{"id":"W2396539498","doi":"","title":"Asymptotic upper bounds for K 1, m, k complete graph Ramsey Numbers.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Ramsey's theorem; Combinatorics; Graph; Discrete mathematics","score_opus":0.02442332463205251,"score_gpt":0.27251566112010167,"score_spread":0.24809233648804915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396539498","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18406163,0.024857437,0.31536752,0.016905297,0.0019130607,0.00020407564,0.0030164525,0.0032183991,0.4504562],"genre_scores_gemma":[0.91563416,0.0063842507,0.04792886,0.001880619,0.0015809358,0.00049685664,0.0014711831,0.00062231347,0.02400076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99715376,0.00071964785,0.00011178768,0.00046685044,0.0009276955,0.0006203356],"domain_scores_gemma":[0.9713705,0.021083742,0.0013610626,0.00265132,0.0017609292,0.0017724705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004261892,0.0016195579,0.0015994476,0.005180042,0.0026019115,0.005520666,0.0045772633,0.002299292,0.018644027],"category_scores_gemma":[0.04721404,0.0008972842,0.0010804912,0.0037653064,0.0038380509,0.013714637,0.0060114404,0.005783226,0.004371054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003468987,0.00015930069,0.0014438255,0.00043787123,0.000055354143,0.00013761432,0.00044191466,0.012455378,0.0022054093,0.92835057,0.02646543,0.027500588],"study_design_scores_gemma":[0.000026717955,0.000044512664,0.00093340455,0.00017272559,0.00004818965,0.00032358387,0.00013736205,0.035545267,0.0013002027,0.9518314,0.009592252,0.000044298722],"about_ca_topic_score_codex":0.0013025686,"about_ca_topic_score_gemma":0.0025202853,"teacher_disagreement_score":0.018644027,"about_ca_system_score_codex":0.0042746025,"about_ca_system_score_gemma":0.0015679118,"threshold_uncertainty_score":0.06237054},"labels":[],"label_agreement":null},{"id":"W2396546079","doi":"","title":"Some classes of antimagic graphs with regular subgraphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.007502609494251957,"score_gpt":0.20052203171615424,"score_spread":0.19301942222190227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396546079","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4922121,0.002776763,0.17119406,0.006862874,0.000451249,0.00029151444,0.0049656807,0.0013674395,0.31987846],"genre_scores_gemma":[0.9100577,0.0013736828,0.048250668,0.0012897782,0.00043978036,0.00028585328,0.0041620876,0.00026346653,0.03387699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990212,0.00023493603,0.00006705153,0.00028415906,0.0002016385,0.00019107177],"domain_scores_gemma":[0.99602544,0.0020762524,0.0005221119,0.0005666304,0.0002848835,0.0005246845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007089785,0.000603353,0.00062649266,0.002318029,0.002428837,0.004364315,0.0015120698,0.0017552034,0.012346771],"category_scores_gemma":[0.0045762206,0.0006443682,0.0009961439,0.002336435,0.0018041545,0.0051710242,0.0021870732,0.002128835,0.001580155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006659138,0.000050147068,0.0008936396,0.00010270677,0.000016651607,0.00012318666,0.0002172986,0.0012542304,0.00086733047,0.9733074,0.010701337,0.012399523],"study_design_scores_gemma":[0.000032289732,0.000016905955,0.0007738859,0.000037941736,0.000026773465,0.0003996037,0.00023448629,0.0074588056,0.00082843297,0.97198415,0.01819183,0.000014799058],"about_ca_topic_score_codex":0.0013208626,"about_ca_topic_score_gemma":0.001715895,"teacher_disagreement_score":0.012346771,"about_ca_system_score_codex":0.001956976,"about_ca_system_score_gemma":0.0007289053,"threshold_uncertainty_score":0.041304052},"labels":[],"label_agreement":null},{"id":"W2396558483","doi":"","title":"Ascents Of Size Less Than d In Samples Of Geometric Random Variables: Mean, Variance and Distribution.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Statistical Methods and Models","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Statistics; Variance (accounting); Random variable","score_opus":0.08896468498957749,"score_gpt":0.3372177368643309,"score_spread":0.24825305187475338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396558483","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11897563,0.0015408858,0.86921436,0.0020731534,0.00042136342,0.00041495543,0.0011658935,0.00085653155,0.005337242],"genre_scores_gemma":[0.7861031,0.0013781434,0.19683555,0.0013692201,0.0014146704,0.0018563933,0.0034369458,0.0003686413,0.0072373156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98433316,0.00763567,0.0010757443,0.0027581155,0.003330373,0.0008668593],"domain_scores_gemma":[0.7501085,0.2086259,0.010627376,0.020703243,0.0067346324,0.0032003552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.029473415,0.0011657564,0.0027102088,0.0036108163,0.0017791349,0.0042147455,0.004607647,0.002639543,0.003313621],"category_scores_gemma":[0.1602801,0.0013503998,0.0025688282,0.002607749,0.0077604805,0.0061405683,0.0050916644,0.004250177,0.0006216096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012866033,0.00033660984,0.023379503,0.00084262236,0.00049602933,0.0012497344,0.0014059017,0.056859784,0.0056725605,0.8314566,0.012440332,0.064573735],"study_design_scores_gemma":[0.00022719488,0.00026597668,0.006532,0.00022125694,0.00020124724,0.0008648547,0.00030945125,0.40749174,0.0050833854,0.57259774,0.006095817,0.00010932767],"about_ca_topic_score_codex":0.0017417065,"about_ca_topic_score_gemma":0.0016712744,"teacher_disagreement_score":0.029473415,"about_ca_system_score_codex":0.002276998,"about_ca_system_score_gemma":0.00190885,"threshold_uncertainty_score":0.15587217},"labels":[],"label_agreement":null},{"id":"W2396568998","doi":"","title":"The rainbow connectivities of small cubic graphs","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Rainbow; Combinatorics; Physics; Optics","score_opus":0.016780936543446614,"score_gpt":0.22277287544128224,"score_spread":0.20599193889783562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396568998","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86787266,0.00079126377,0.04332527,0.00085740775,0.000083067825,0.000050494396,0.00035143993,0.00026928968,0.08639904],"genre_scores_gemma":[0.98303336,0.00053989846,0.00674961,0.00011926335,0.00006714094,0.00006861564,0.00017239874,0.00006491097,0.009184859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996853,0.00007271553,0.000012325235,0.00006562075,0.00009555679,0.00006854536],"domain_scores_gemma":[0.9975153,0.0014765026,0.00034004494,0.00019394014,0.00018043967,0.000293797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043184817,0.0003396706,0.0003414254,0.002500626,0.0011848994,0.0018258813,0.0008498908,0.0007127907,0.008693359],"category_scores_gemma":[0.00487141,0.0004892661,0.00034630296,0.0017034659,0.0019430214,0.002215073,0.0014873722,0.001341981,0.00037330633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013531059,0.000023580442,0.0013276091,0.000111612666,0.000014227073,0.00013503962,0.00044600913,0.010914951,0.0028224853,0.96965605,0.0020085655,0.01240469],"study_design_scores_gemma":[0.0000423986,0.000027754388,0.0016538444,0.000038198294,0.000021370692,0.00016824123,0.0002748248,0.026133422,0.001162289,0.96725756,0.0031959855,0.000024041605],"about_ca_topic_score_codex":0.0025757072,"about_ca_topic_score_gemma":0.0047712876,"teacher_disagreement_score":0.008693359,"about_ca_system_score_codex":0.0009897607,"about_ca_system_score_gemma":0.00059152505,"threshold_uncertainty_score":0.029082239},"labels":[],"label_agreement":null},{"id":"W2396610418","doi":"","title":"On the Laplacian spectral radii of tricyclic graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tricyclic; Mathematics; Laplace operator; Combinatorics; Chemistry; Mathematical analysis; Stereochemistry","score_opus":0.01987101167511251,"score_gpt":0.2626211146724926,"score_spread":0.2427501029973801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396610418","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5389965,0.012438882,0.15232298,0.007138786,0.0010516779,0.00008801631,0.0013083181,0.00093343365,0.28572133],"genre_scores_gemma":[0.9706224,0.0038286902,0.012203973,0.0005824034,0.00078229874,0.00010354217,0.00040468713,0.00026056176,0.011211413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991998,0.00030187576,0.00003166249,0.00013480637,0.00019815195,0.0001336739],"domain_scores_gemma":[0.9938257,0.004025786,0.00071010774,0.00036933494,0.00047148304,0.0005975597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009436691,0.00076387695,0.0007305792,0.003777607,0.0009499902,0.0019990364,0.0014775286,0.0012414013,0.00862192],"category_scores_gemma":[0.01186608,0.00043889383,0.00031301068,0.0018263889,0.0024226084,0.0035488987,0.002097576,0.0018058014,0.0022965206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010832571,0.000038001428,0.00091914105,0.00014920518,0.000018479415,0.000115963434,0.0003776438,0.007661744,0.0029162213,0.95139825,0.012692248,0.023604797],"study_design_scores_gemma":[0.000024239369,0.000026943306,0.0011413428,0.00007119864,0.000018508807,0.00034166223,0.0003794555,0.030954024,0.0012856085,0.95840067,0.0073240655,0.000032398944],"about_ca_topic_score_codex":0.000879096,"about_ca_topic_score_gemma":0.0008262533,"teacher_disagreement_score":0.00862192,"about_ca_system_score_codex":0.0009920885,"about_ca_system_score_gemma":0.00028086625,"threshold_uncertainty_score":0.028843224},"labels":[],"label_agreement":null},{"id":"W2396662119","doi":"","title":"Intuitionistic Fuzzy Subcoalgebras of Coalgebras.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Fuzzy logic; Algebra over a field; Pure mathematics; Mathematics education; Artificial intelligence; Computer science","score_opus":0.013955107225797106,"score_gpt":0.2432670885372798,"score_spread":0.2293119813114827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396662119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17417245,0.004318919,0.602751,0.0017632594,0.00078743685,0.00015895841,0.0011963351,0.001072219,0.21377948],"genre_scores_gemma":[0.8699106,0.0008516212,0.09176028,0.0005675705,0.00039117702,0.00008198952,0.0005743221,0.00012356316,0.035738815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874866,0.00022212662,0.00013425385,0.00024097732,0.00052382454,0.00013008568],"domain_scores_gemma":[0.9985934,0.00040125215,0.00013275379,0.00024978467,0.00041987252,0.0002029335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012462699,0.00036117408,0.00049276254,0.0015414585,0.0015820994,0.003167046,0.0006096349,0.0006014222,0.0070376066],"category_scores_gemma":[0.0026534256,0.00039196425,0.00085640524,0.001020686,0.0029995036,0.0051201303,0.001690829,0.0017626305,0.0013975198],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028996854,0.000015167866,0.00028071462,0.00004085349,0.000012269485,0.000065965854,0.00026463205,0.00031628512,0.0009744122,0.98924375,0.0008932427,0.007863693],"study_design_scores_gemma":[0.00000931097,0.000015640047,0.00045607862,0.000020437568,0.000015122944,0.00020407428,0.00013722973,0.0024028076,0.0012222105,0.9824163,0.013084742,0.000015933378],"about_ca_topic_score_codex":0.0015103307,"about_ca_topic_score_gemma":0.0019116829,"teacher_disagreement_score":0.0070376066,"about_ca_system_score_codex":0.0010699455,"about_ca_system_score_gemma":0.00073568994,"threshold_uncertainty_score":0.023543179},"labels":[],"label_agreement":null},{"id":"W2396667257","doi":"","title":"The zero divisor graph of partially ordered set with respect to a semi-ideal.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Zero divisor; Ideal (ethics); Zero (linguistics); Graph; Combinatorics; Divisor (algebraic geometry); Set (abstract data type); Discrete mathematics; Computer science; Linguistics","score_opus":0.021145842011595462,"score_gpt":0.2609286746416688,"score_spread":0.23978283263007333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396667257","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6380698,0.0012846786,0.12871055,0.002203199,0.0004969794,0.000101712874,0.0016221005,0.00085686817,0.22665408],"genre_scores_gemma":[0.9686636,0.00045599794,0.011559275,0.00020805553,0.00020347719,0.000040502,0.00069494953,0.0001305111,0.018043708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943906,0.000121357494,0.000033284858,0.00014191715,0.00014782135,0.00011660757],"domain_scores_gemma":[0.9988482,0.00034749764,0.00021538872,0.0001326445,0.00016008285,0.00029619172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066100346,0.00047495594,0.00078319316,0.0030746725,0.0020305598,0.0034975638,0.0007517708,0.00070782244,0.010529981],"category_scores_gemma":[0.0016330859,0.00037719985,0.0006428411,0.0014141472,0.0031363517,0.0054807556,0.0017460388,0.001359259,0.0012531333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023979084,0.000009851447,0.00020809632,0.000019365276,0.0000060780185,0.00006102759,0.00012712086,0.0002307136,0.0004519607,0.99537116,0.00073732797,0.0027533364],"study_design_scores_gemma":[0.00001501595,0.000020662119,0.0006179984,0.000020188698,0.000013384125,0.00021821332,0.00020182799,0.0020055454,0.0008387042,0.9910624,0.0049731648,0.0000128688835],"about_ca_topic_score_codex":0.0013959749,"about_ca_topic_score_gemma":0.0012036826,"teacher_disagreement_score":0.010529981,"about_ca_system_score_codex":0.0012954879,"about_ca_system_score_gemma":0.00062127376,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W239667665","doi":"","title":"Combinatorics of geometrically distributed random variables: Words and permutations avoiding two or three adjacent patterns.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.014683049783149306,"score_gpt":0.2530496073354097,"score_spread":0.2383665575522604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W239667665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09947855,0.010286204,0.7858223,0.0071140593,0.0013967486,0.00019754039,0.0019728737,0.000877125,0.09285467],"genre_scores_gemma":[0.8174292,0.007395942,0.11443778,0.0019342918,0.0023052888,0.000751038,0.0017354015,0.00040182352,0.053609293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970186,0.0013657648,0.00019344098,0.00046325108,0.0006561228,0.0003029089],"domain_scores_gemma":[0.99343735,0.003926124,0.00086962344,0.00085199944,0.0004336673,0.00048125462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023314164,0.0012587934,0.0012443104,0.0028711872,0.0015642466,0.0055583236,0.0017257426,0.0017627607,0.009206099],"category_scores_gemma":[0.0132479435,0.00070545165,0.0012061594,0.0024740244,0.0050719096,0.006204437,0.0021976628,0.0024626448,0.0026247406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023042916,0.000009827659,0.00015298865,0.00004297911,0.0000102113545,0.00007102288,0.000045958306,0.0025250497,0.00025457182,0.9895682,0.0024180585,0.004878218],"study_design_scores_gemma":[0.000013769555,0.000014236444,0.000101972386,0.000022801729,0.000009197246,0.0001610413,0.000039588132,0.010278198,0.0002453606,0.9829662,0.0061333193,0.000014369108],"about_ca_topic_score_codex":0.00071253494,"about_ca_topic_score_gemma":0.0011614873,"teacher_disagreement_score":0.009206099,"about_ca_system_score_codex":0.0015381009,"about_ca_system_score_gemma":0.0012924469,"threshold_uncertainty_score":0.030797422},"labels":[],"label_agreement":null},{"id":"W2396687675","doi":"","title":"Properties of total restrained domination vertex critical graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Graph","score_opus":0.038530119723588774,"score_gpt":0.2966074414444802,"score_spread":0.25807732172089143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396687675","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82069504,0.00053409516,0.07400882,0.0004970634,0.000062203384,0.00015632458,0.001239509,0.0004651278,0.10234184],"genre_scores_gemma":[0.9853677,0.00020288194,0.0061152,0.000089571855,0.000030084186,0.000050887204,0.00065865746,0.000067180976,0.007417777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996526,0.000057608344,0.000017536275,0.00007641668,0.00011570851,0.000080132355],"domain_scores_gemma":[0.9960943,0.001866326,0.00053032255,0.00045603293,0.0005737064,0.00047941113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038091082,0.00033591632,0.00032924218,0.0019874072,0.0011907802,0.0017600122,0.00087530504,0.00046142505,0.008202017],"category_scores_gemma":[0.0042120824,0.00035667844,0.00033556393,0.0013620205,0.0012456255,0.0016955853,0.00086190534,0.0007417497,0.0005786011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028441436,0.000078151985,0.007099555,0.0002959823,0.000064284235,0.001048025,0.0012499114,0.010916424,0.01692094,0.92354774,0.00804414,0.030450452],"study_design_scores_gemma":[0.00007756192,0.00007512649,0.00481373,0.00008515618,0.00008227065,0.0022111174,0.0008206066,0.032541443,0.010808089,0.93134516,0.017104395,0.000035366935],"about_ca_topic_score_codex":0.0016053619,"about_ca_topic_score_gemma":0.0018021772,"teacher_disagreement_score":0.008202017,"about_ca_system_score_codex":0.0007836209,"about_ca_system_score_gemma":0.00048651962,"threshold_uncertainty_score":0.027438462},"labels":[],"label_agreement":null},{"id":"W2396716783","doi":"","title":"A construction of distance-regular graphs from subspaces in d-bounded distance-regular graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Linear subspace; Bounded function; Combinatorics; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.008187617173141315,"score_gpt":0.1793967551282531,"score_spread":0.17120913795511178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396716783","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07023521,0.00044368088,0.8704628,0.00062447874,0.00017677549,0.00013033315,0.0006911855,0.0010582523,0.056177307],"genre_scores_gemma":[0.54559666,0.0007309991,0.43015325,0.00047939454,0.00011329049,0.00021087115,0.0015663598,0.00044231248,0.020706883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946386,0.0001888732,0.000029104642,0.00011299213,0.00013499227,0.000070211754],"domain_scores_gemma":[0.9984315,0.0005369603,0.00015120253,0.000399802,0.00021605084,0.0002645407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040958697,0.00038623755,0.00041420868,0.001167281,0.001182527,0.0012695217,0.000830051,0.000529796,0.0057672965],"category_scores_gemma":[0.002203177,0.0004438867,0.00060276187,0.0012327108,0.001233076,0.0018692554,0.0026761312,0.0015823027,0.0016736272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006403268,0.000048502487,0.00038717804,0.00010126096,0.000011954846,0.00018332739,0.00036142484,0.0036265436,0.005538065,0.9520612,0.0051368265,0.032479737],"study_design_scores_gemma":[0.000027206095,0.000049835737,0.00042302892,0.000049949795,0.000020092779,0.00056442677,0.00030213434,0.025805928,0.00462835,0.9408254,0.027275527,0.00002815279],"about_ca_topic_score_codex":0.0005812381,"about_ca_topic_score_gemma":0.0009343246,"teacher_disagreement_score":0.0057672965,"about_ca_system_score_codex":0.0005113988,"about_ca_system_score_gemma":0.0003969979,"threshold_uncertainty_score":0.019293487},"labels":[],"label_agreement":null},{"id":"W2396719912","doi":"","title":"Fault tolerant path-embedding in locally twisted cubes.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Embedding; Path (computing); Fault tolerance; Topology (electrical circuits); Combinatorics; Computer science; Distributed computing; Computer network; Artificial intelligence","score_opus":0.01413941125520222,"score_gpt":0.2507848579107628,"score_spread":0.23664544665556062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396719912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43772012,0.0011636266,0.5113324,0.0009208415,0.00035637035,0.000090738424,0.0006332669,0.0010141073,0.04676861],"genre_scores_gemma":[0.9504304,0.0004740337,0.03649289,0.00011589409,0.00005306104,0.00005891902,0.00034893703,0.00009100692,0.011934916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999757,0.00006446032,0.000016754395,0.000033933393,0.00007050609,0.000057288416],"domain_scores_gemma":[0.99926656,0.00026572848,0.000120748875,0.00015855393,0.00011316575,0.00007514569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023110196,0.00027757118,0.00028492542,0.0004834957,0.0005008872,0.0007668622,0.0005487046,0.00039624132,0.0054074028],"category_scores_gemma":[0.001703038,0.00013792477,0.00020996916,0.0005930196,0.00058276305,0.0022650494,0.0014935547,0.0007915802,0.0007155907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037025617,0.000054065193,0.0007831397,0.00021378532,0.000034423003,0.00066648435,0.00036680192,0.06853753,0.01484686,0.82708126,0.007057152,0.07998825],"study_design_scores_gemma":[0.000036276408,0.00013765354,0.0003233096,0.000046252528,0.000024468764,0.0004632636,0.00023410433,0.15354416,0.010049688,0.8247939,0.010324602,0.000022359287],"about_ca_topic_score_codex":0.0004816984,"about_ca_topic_score_gemma":0.0007334114,"teacher_disagreement_score":0.0054074028,"about_ca_system_score_codex":0.00042812192,"about_ca_system_score_gemma":0.00029442893,"threshold_uncertainty_score":0.018089533},"labels":[],"label_agreement":null},{"id":"W2396731731","doi":"","title":"P r -free colorings of Sierpinski-like graphs.","year":2012,"lang":"de","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Sierpinski triangle; Combinatorics; Mathematical analysis; Fractal","score_opus":0.0177325541123651,"score_gpt":0.25510739386005626,"score_spread":0.23737483974769116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396731731","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47424233,0.0014476654,0.14085111,0.0014105461,0.00053385645,0.00008637915,0.0006482623,0.0012414546,0.3795384],"genre_scores_gemma":[0.9603086,0.00040921668,0.014187844,0.00033911376,0.00014457294,0.00006830902,0.00033922345,0.00015267282,0.02405041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952435,0.00014000604,0.000025850764,0.00008592803,0.000116052586,0.00010783835],"domain_scores_gemma":[0.99848074,0.00068178866,0.00021905894,0.00019066251,0.00016114696,0.0002666996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043541862,0.0004377659,0.0003155599,0.0016488676,0.0013415375,0.0025259615,0.00079175935,0.0007772401,0.00850135],"category_scores_gemma":[0.0025606519,0.00049084873,0.00045413448,0.00080494955,0.0015701873,0.0029035485,0.0015802085,0.0012979698,0.0012364008],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022759592,0.00002384814,0.0002727914,0.00003141623,0.0000048162415,0.000118554926,0.00014241645,0.00060416263,0.0010816195,0.99123085,0.0021281638,0.0043386],"study_design_scores_gemma":[0.000014452303,0.000011949315,0.00034543764,0.00001777545,0.000008947712,0.0003410298,0.00014133324,0.004357502,0.0010388218,0.98817855,0.0055316873,0.000012539505],"about_ca_topic_score_codex":0.0008647747,"about_ca_topic_score_gemma":0.0014522424,"teacher_disagreement_score":0.00850135,"about_ca_system_score_codex":0.00067223754,"about_ca_system_score_gemma":0.00036212974,"threshold_uncertainty_score":0.02843988},"labels":[],"label_agreement":null},{"id":"W2396734982","doi":"","title":"A Characterization Of Graphic Matroids Which Yield Biographic Splittings Matroids.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Matroid; Characterization (materials science); Yield (engineering); Mathematics; Combinatorics; Graphic matroid; Materials science; Nanotechnology; Composite material","score_opus":0.018457838717400518,"score_gpt":0.23813036247594513,"score_spread":0.21967252375854462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396734982","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6124926,0.0010342626,0.22969176,0.0024779716,0.00022401116,0.00023928718,0.003399708,0.00106374,0.1493767],"genre_scores_gemma":[0.9165836,0.00057159096,0.05202176,0.0004909303,0.00031060594,0.00015333203,0.0038634108,0.0003339394,0.025670769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993162,0.00011975632,0.00005373864,0.00017380693,0.00022752385,0.00010902065],"domain_scores_gemma":[0.9968438,0.0010442752,0.00071707816,0.00048353086,0.0003610702,0.0005503695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005355212,0.0007164682,0.00059859833,0.0020902804,0.0011179536,0.0037207063,0.0008439087,0.00113754,0.014367257],"category_scores_gemma":[0.0036277026,0.00064606074,0.00076620036,0.0019446875,0.001423708,0.0031681014,0.0017581282,0.0021981595,0.0024176408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000168249,0.00017646307,0.002988493,0.00021340755,0.000035672758,0.0005164444,0.00072534865,0.00634792,0.010224414,0.91779685,0.014339377,0.04646736],"study_design_scores_gemma":[0.000037553586,0.00010167637,0.002712954,0.0000836347,0.000037162863,0.0016459434,0.00052887225,0.03760195,0.004370651,0.932825,0.020016933,0.00003769327],"about_ca_topic_score_codex":0.00065521226,"about_ca_topic_score_gemma":0.0007376485,"teacher_disagreement_score":0.014367257,"about_ca_system_score_codex":0.0010354266,"about_ca_system_score_gemma":0.0004166323,"threshold_uncertainty_score":0.04806322},"labels":[],"label_agreement":null},{"id":"W2396751065","doi":"","title":"Maximum Packings of Complete Graphs with Octagons.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.014019520243766188,"score_gpt":0.25703634742635195,"score_spread":0.24301682718258577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396751065","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6267141,0.002723507,0.23630741,0.0012553146,0.00032170393,0.00015390155,0.0026857255,0.0010596764,0.12877856],"genre_scores_gemma":[0.87872994,0.0010985677,0.091879606,0.00032377028,0.00018037998,0.00015327963,0.003288881,0.0003991871,0.023946406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923694,0.00021846495,0.000053615313,0.00013694337,0.00021008565,0.00014394251],"domain_scores_gemma":[0.9976139,0.0011100167,0.0004204651,0.00040116662,0.00017510702,0.00027935978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038081442,0.00063838536,0.00090961956,0.0014324725,0.0014113131,0.0029082322,0.0010958663,0.0012805418,0.012689168],"category_scores_gemma":[0.0051254285,0.001248069,0.0007065756,0.002147183,0.001230895,0.0036852714,0.0022228835,0.0015220207,0.0018852672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077530195,0.00033897077,0.0031329677,0.00066837214,0.00011496706,0.000700033,0.0008226813,0.034129634,0.009383607,0.8188752,0.02961959,0.10143878],"study_design_scores_gemma":[0.00010758669,0.00012557542,0.0023638168,0.00017931723,0.000057169163,0.0009026715,0.00064592285,0.081076875,0.0048991777,0.8860448,0.02356163,0.000035365763],"about_ca_topic_score_codex":0.0009805374,"about_ca_topic_score_gemma":0.002043666,"teacher_disagreement_score":0.012689168,"about_ca_system_score_codex":0.0006034551,"about_ca_system_score_gemma":0.00039695724,"threshold_uncertainty_score":0.042449534},"labels":[],"label_agreement":null},{"id":"W2396761519","doi":"","title":"3-Connected Simple Graphs With The Same Genus Distributions.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Genus; Simple (philosophy); Combinatorics; Botany; Biology","score_opus":0.007729190735094693,"score_gpt":0.20596408972855457,"score_spread":0.19823489899345986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396761519","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7690839,0.0007570354,0.10042812,0.0025847065,0.00024320801,0.00008471273,0.0019291572,0.0008840833,0.12400508],"genre_scores_gemma":[0.9632397,0.00033171303,0.021561326,0.00044533712,0.000085098785,0.00007506039,0.00093474146,0.00015795643,0.013169114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994634,0.00014868329,0.000029345993,0.0001230719,0.00012758908,0.000107995205],"domain_scores_gemma":[0.99746007,0.0010598496,0.0004304798,0.000490145,0.00021799911,0.0003415253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053740415,0.00055567373,0.0005292527,0.0017082293,0.0017245798,0.0027177797,0.0010498606,0.0015942384,0.00902039],"category_scores_gemma":[0.0030385545,0.000387434,0.0006026955,0.001444586,0.0017995336,0.003908455,0.0017402007,0.0012380743,0.0012850062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016465041,0.00006502261,0.0015291204,0.00009237532,0.000022359965,0.0001851744,0.00028260052,0.0033343476,0.004331198,0.97048765,0.004913794,0.014591713],"study_design_scores_gemma":[0.000037471425,0.000017322685,0.0016882432,0.000033096494,0.00002300756,0.0003276347,0.00025481588,0.010457927,0.0026788064,0.97707343,0.0073874546,0.000020707072],"about_ca_topic_score_codex":0.0008217167,"about_ca_topic_score_gemma":0.0013420294,"teacher_disagreement_score":0.00902039,"about_ca_system_score_codex":0.0009517092,"about_ca_system_score_gemma":0.00039032806,"threshold_uncertainty_score":0.030176222},"labels":[],"label_agreement":null},{"id":"W2396784877","doi":"","title":"H-equipackable paths and cycles for H = P 4 and H = M 3 .","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.006656786457512131,"score_gpt":0.20383614986685666,"score_spread":0.19717936340934453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396784877","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48210135,0.0013327013,0.15732615,0.0023373691,0.0005009504,0.00022501797,0.0036736769,0.0006587799,0.351844],"genre_scores_gemma":[0.9262311,0.000625849,0.030834053,0.000570374,0.00015240427,0.00014033461,0.0016790369,0.00012821898,0.03963863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995408,0.000103056846,0.00002334131,0.00008846424,0.00008041429,0.00016385797],"domain_scores_gemma":[0.998408,0.0007277432,0.00030032624,0.00023422265,0.00013247799,0.00019723148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002730729,0.0004609204,0.00030622995,0.0014682127,0.0016956845,0.0015741265,0.00088256394,0.0010575041,0.023754882],"category_scores_gemma":[0.0020087175,0.00031111226,0.0005187463,0.0010887971,0.0012416111,0.0021112845,0.00163368,0.0014323007,0.0018996105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020257506,0.00005335246,0.00071644963,0.00009623714,0.000018751172,0.0004776408,0.0003105021,0.0024604634,0.0019684571,0.96886015,0.008274981,0.016560381],"study_design_scores_gemma":[0.000023920971,0.000029323488,0.0010456301,0.000036638492,0.000016104379,0.000280229,0.00027146924,0.0071485694,0.001711962,0.9759902,0.013425803,0.000020223533],"about_ca_topic_score_codex":0.0017169742,"about_ca_topic_score_gemma":0.002428845,"teacher_disagreement_score":0.023754882,"about_ca_system_score_codex":0.000659067,"about_ca_system_score_gemma":0.0005126174,"threshold_uncertainty_score":0.07946801},"labels":[],"label_agreement":null},{"id":"W2396789099","doi":"","title":"Uniquely colorable graphs on surfaces","year":2014,"lang":"fr","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.026336558821799402,"score_gpt":0.28627553334482503,"score_spread":0.2599389745230256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396789099","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5948261,0.0010745402,0.16573507,0.0024174422,0.0011295093,0.00013459641,0.0008631933,0.0015676966,0.23225184],"genre_scores_gemma":[0.8731979,0.0009930781,0.045694645,0.00084926275,0.00042534978,0.000115816554,0.00074497913,0.0009673468,0.07701161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904937,0.00017532521,0.00004292589,0.0002690927,0.00024579055,0.00021747715],"domain_scores_gemma":[0.9984642,0.0005803237,0.00018383155,0.000301102,0.00018780265,0.00028279817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047219725,0.001269789,0.0011798026,0.0024420924,0.002239065,0.0034708655,0.0014637114,0.0017450484,0.014247136],"category_scores_gemma":[0.0021695956,0.0011556129,0.0011208326,0.0017692584,0.002581858,0.0053450763,0.0031359056,0.0043196566,0.0021126312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002504982,0.000023530423,0.00024187658,0.000041519113,0.0000065785307,0.00012971538,0.00030059856,0.0009392004,0.0020355296,0.9848221,0.0022680657,0.0091662705],"study_design_scores_gemma":[0.00001131415,0.000009661175,0.00035317225,0.00001584628,0.000011070814,0.00018017454,0.00018016784,0.0018000426,0.0010704832,0.9900614,0.0062912498,0.00001536025],"about_ca_topic_score_codex":0.0011171396,"about_ca_topic_score_gemma":0.0019107088,"teacher_disagreement_score":0.014247136,"about_ca_system_score_codex":0.0011772744,"about_ca_system_score_gemma":0.0004745848,"threshold_uncertainty_score":0.047661483},"labels":[],"label_agreement":null},{"id":"W2396799827","doi":"","title":"On minimal energy of bipartite unicyclic graphs of a given bipartition.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Combinatorics; Complete bipartite graph; Graph","score_opus":0.027103618686472843,"score_gpt":0.28228496899505096,"score_spread":0.25518135030857814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396799827","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6807008,0.003277581,0.13080975,0.0027877614,0.00041923134,0.00006272308,0.0013945436,0.00026239405,0.18028526],"genre_scores_gemma":[0.96678203,0.0009087693,0.012131655,0.00028543765,0.00017819203,0.00007314807,0.0007225831,0.00013416613,0.018784095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969053,0.000088364235,0.000013302586,0.000058734917,0.00007975085,0.000069334346],"domain_scores_gemma":[0.99900573,0.00053909526,0.00013140461,0.00008941578,0.00009740504,0.00013696808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002693751,0.00043631444,0.00062629086,0.0019757403,0.0010601645,0.0012798017,0.0010987227,0.0013164744,0.01392897],"category_scores_gemma":[0.0023438102,0.00029965062,0.00037431074,0.0012815514,0.0012046278,0.0018339141,0.0014296032,0.0010618845,0.0010767509],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096431715,0.000036131903,0.00083864346,0.00021024453,0.000026392547,0.0001431904,0.00018852741,0.00812109,0.003516284,0.9648859,0.0061037433,0.015833424],"study_design_scores_gemma":[0.000013880872,0.0000208573,0.0011251327,0.000057245907,0.000013955894,0.00026158185,0.00020910207,0.024755787,0.0011018522,0.96852434,0.0039021103,0.000014088254],"about_ca_topic_score_codex":0.0004934335,"about_ca_topic_score_gemma":0.0008176854,"teacher_disagreement_score":0.01392897,"about_ca_system_score_codex":0.0006800393,"about_ca_system_score_gemma":0.00018434234,"threshold_uncertainty_score":0.046597064},"labels":[],"label_agreement":null},{"id":"W2396805066","doi":"","title":"Caterpillar Factorizations of Crowns.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Caterpillar; Mathematics; Biology; Botany; Lepidoptera genitalia","score_opus":0.004459163025853725,"score_gpt":0.18773826536373572,"score_spread":0.183279102337882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396805066","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23115204,0.001971774,0.37831852,0.0013022523,0.00065022666,0.00015219362,0.0013448043,0.0010619494,0.3840462],"genre_scores_gemma":[0.870458,0.00076736213,0.058014005,0.00040785654,0.00024461793,0.000055828437,0.0008228124,0.00019963265,0.06902992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995902,0.00005838285,0.000017005324,0.00010325407,0.00008412737,0.00014697913],"domain_scores_gemma":[0.9992435,0.00019962208,0.00009875114,0.0001748773,0.00013639944,0.00014690432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022666765,0.0003641642,0.000470574,0.0011394,0.0018762704,0.0020984276,0.0004468573,0.00065863814,0.023198416],"category_scores_gemma":[0.0014249906,0.0003263032,0.00052299094,0.000728856,0.0011292138,0.0019553665,0.0012759422,0.0010981293,0.0045033405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006378242,0.00002209837,0.00037905356,0.000052135645,0.000011299064,0.00021228228,0.0002517923,0.0012828854,0.0044025467,0.9660701,0.008716706,0.018535335],"study_design_scores_gemma":[0.000019413368,0.000033861197,0.00081314356,0.00004978052,0.000018261606,0.00053058827,0.00038786288,0.00888411,0.0024575002,0.946732,0.040052403,0.000021147178],"about_ca_topic_score_codex":0.001985012,"about_ca_topic_score_gemma":0.00402205,"teacher_disagreement_score":0.023198416,"about_ca_system_score_codex":0.0008323194,"about_ca_system_score_gemma":0.00043044752,"threshold_uncertainty_score":0.07760644},"labels":[],"label_agreement":null},{"id":"W2396838939","doi":"","title":"Injectively (Δ+1)-choosable graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.009431040274922177,"score_gpt":0.20867477830843104,"score_spread":0.19924373803350887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396838939","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55190414,0.0014758081,0.23081832,0.0046620346,0.00032511837,0.00015241507,0.0077175493,0.0015282532,0.20141636],"genre_scores_gemma":[0.9122402,0.00062271894,0.052963242,0.00067350024,0.00010787684,0.00011073912,0.0033303325,0.00023840329,0.029713014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993604,0.00014178829,0.000039918883,0.00018027743,0.00011317519,0.00016449706],"domain_scores_gemma":[0.9960936,0.002273227,0.0003868743,0.000725444,0.00018454813,0.00033640378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056145067,0.00046122298,0.00049007544,0.00066120166,0.000908817,0.0024798797,0.0014614975,0.00090315373,0.013578586],"category_scores_gemma":[0.0031563384,0.00046542022,0.0004990724,0.00096538005,0.0012640035,0.0035553765,0.0014344457,0.001959591,0.0015928904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040901374,0.00018121008,0.005132413,0.00037759935,0.00005295583,0.00024875716,0.0003681782,0.010527006,0.013310771,0.88979584,0.018523384,0.061072994],"study_design_scores_gemma":[0.00008690366,0.00006270131,0.0033239974,0.000067975474,0.000063910906,0.00069371663,0.00039286938,0.022596886,0.009594343,0.94430447,0.018774478,0.00003765907],"about_ca_topic_score_codex":0.0010182947,"about_ca_topic_score_gemma":0.002158883,"teacher_disagreement_score":0.013578586,"about_ca_system_score_codex":0.0011424506,"about_ca_system_score_gemma":0.0006281168,"threshold_uncertainty_score":0.04542494},"labels":[],"label_agreement":null},{"id":"W2396843881","doi":"","title":"A note on leaf-constrained spanning trees in a graph","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Cell Adhesion Molecules Research","field":"Medicine","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Spanning tree; Graph; Vertex (graph theory); Connectivity; Discrete mathematics; Vertex connectivity","score_opus":0.018283294317446373,"score_gpt":0.29249122964868446,"score_spread":0.2742079353312381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396843881","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27346656,0.011915136,0.62855285,0.0051739225,0.0015375816,0.0001506233,0.0011010827,0.00081503176,0.077287234],"genre_scores_gemma":[0.7994262,0.008351716,0.17139047,0.0012189507,0.002219875,0.0001866587,0.0010707092,0.00025818567,0.015877146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955994,0.00009890872,0.000026664116,0.00012446876,0.00009467414,0.00009519419],"domain_scores_gemma":[0.9983975,0.0009898992,0.00014488879,0.0001550666,0.00014225776,0.00017038175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008449761,0.0005644299,0.0006637138,0.0016709166,0.0014638418,0.0011537398,0.00079062884,0.0008755945,0.0029417202],"category_scores_gemma":[0.0034145422,0.00038641837,0.0007653984,0.0021440214,0.0014859501,0.0033050915,0.0013098015,0.0021499107,0.0006020631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022364935,0.00010920128,0.0029321255,0.0003730763,0.00006728646,0.0014011024,0.001153982,0.021555986,0.0102554755,0.85061485,0.017016854,0.09429645],"study_design_scores_gemma":[0.000034888857,0.00027481132,0.0032844294,0.00010823665,0.00009043994,0.00077995006,0.00033743505,0.0553916,0.0031488722,0.89032555,0.04617122,0.000052498846],"about_ca_topic_score_codex":0.0030633337,"about_ca_topic_score_gemma":0.0028918819,"teacher_disagreement_score":0.0030633337,"about_ca_system_score_codex":0.0009814898,"about_ca_system_score_gemma":0.0003894089,"threshold_uncertainty_score":0.0098410845},"labels":[],"label_agreement":null},{"id":"W2396884769","doi":"","title":"Magic graphs with pendant edges.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"MAGIC (telescope); Mathematics; Combinatorics; Physics; Astronomy","score_opus":0.022055702923060992,"score_gpt":0.2063858009166787,"score_spread":0.18433009799361771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396884769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24871123,0.0038742817,0.4401391,0.0064227805,0.0008585868,0.00018715589,0.0043025226,0.0012324825,0.29427192],"genre_scores_gemma":[0.7844569,0.0017358706,0.16026302,0.0012470158,0.00034393172,0.00021265542,0.0031022273,0.0002895094,0.04834893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926895,0.00020096025,0.000048800845,0.00018653813,0.00015775341,0.00013701333],"domain_scores_gemma":[0.9969489,0.0016362186,0.0003340024,0.00057546387,0.00021826715,0.00028717666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006654774,0.0005366067,0.0006635199,0.0013189424,0.0020001554,0.0026280545,0.0015005692,0.0014717053,0.0144382],"category_scores_gemma":[0.004209223,0.00064540905,0.00063458254,0.0017247547,0.0017429407,0.0054147854,0.0023899113,0.0021147172,0.0020673797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087008404,0.000031427422,0.00040624387,0.000102057595,0.000014676564,0.00007797182,0.00010256378,0.0019617465,0.0014621989,0.9649286,0.010958114,0.019867394],"study_design_scores_gemma":[0.000025840915,0.000014174473,0.0002886786,0.000039399758,0.000017822927,0.0001956399,0.000114756156,0.008432624,0.0014082347,0.97266996,0.016779019,0.000014013758],"about_ca_topic_score_codex":0.0011382912,"about_ca_topic_score_gemma":0.0023409151,"teacher_disagreement_score":0.0144382,"about_ca_system_score_codex":0.0010664155,"about_ca_system_score_gemma":0.0007401969,"threshold_uncertainty_score":0.048300624},"labels":[],"label_agreement":null},{"id":"W2396894320","doi":"","title":"Paving matroids of arbitrary cardinality.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Matroid; Cardinality (data modeling); Mathematics; Combinatorics; Graphic matroid; Discrete mathematics; Computer science; Data mining","score_opus":0.010330089763355196,"score_gpt":0.2404665559055575,"score_spread":0.2301364661422023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396894320","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2952626,0.00190218,0.47770965,0.003183027,0.0007393222,0.0001994521,0.0030502465,0.002068383,0.21588518],"genre_scores_gemma":[0.7968956,0.0017920457,0.11716337,0.00048560803,0.00030574764,0.00014820903,0.0019007337,0.0005095388,0.08079914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992229,0.00018713302,0.000053127664,0.00017452797,0.00019902868,0.00016328243],"domain_scores_gemma":[0.9971951,0.0012962918,0.00031250392,0.00058540475,0.00025527485,0.00035535556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007055794,0.0005151093,0.00066269713,0.0009790615,0.0013366713,0.0027480363,0.0010823333,0.001147284,0.016711503],"category_scores_gemma":[0.005007675,0.0006835587,0.00075437763,0.0010209549,0.0012135474,0.0062671877,0.00264323,0.002805779,0.0032728454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014829986,0.00005381648,0.00071117474,0.00014518121,0.00003185111,0.00012583958,0.00014586945,0.012453035,0.0026804472,0.9371407,0.012205988,0.034157757],"study_design_scores_gemma":[0.00002478186,0.000059509173,0.0004604017,0.00006493978,0.000026018119,0.00030678845,0.00013374072,0.031704932,0.0027434262,0.9370416,0.027415106,0.000018721124],"about_ca_topic_score_codex":0.0007454299,"about_ca_topic_score_gemma":0.0013371222,"teacher_disagreement_score":0.016711503,"about_ca_system_score_codex":0.000942528,"about_ca_system_score_gemma":0.0005667976,"threshold_uncertainty_score":0.05590552},"labels":[],"label_agreement":null},{"id":"W2396899056","doi":"","title":"On the Erdos-Sos Conjecture for Graphs on n = k+3 Vertices.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Discrete mathematics","score_opus":0.011043264951391055,"score_gpt":0.22801828055504764,"score_spread":0.2169750156036566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396899056","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50190353,0.0060049733,0.13053666,0.03768906,0.001831918,0.00016915501,0.005099478,0.0013392013,0.31542605],"genre_scores_gemma":[0.9370045,0.0036185319,0.027936332,0.0030421645,0.00089431193,0.0001554975,0.0030558468,0.00030716683,0.023985755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985373,0.00040036062,0.00007153161,0.00032901563,0.00026397343,0.00039778405],"domain_scores_gemma":[0.99081486,0.0058486983,0.0007963511,0.0012914122,0.0005233198,0.000725354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022853795,0.0008066469,0.0013449789,0.001464101,0.0027517998,0.004321283,0.0016932349,0.002495575,0.013871121],"category_scores_gemma":[0.010197069,0.0007170311,0.0010609784,0.0022012575,0.0039652805,0.0106387595,0.0037448457,0.003578996,0.0024127283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054951856,0.00012835352,0.0031818664,0.00033084425,0.000042557615,0.00015335878,0.00038991717,0.011041818,0.0011087175,0.9255157,0.034189306,0.023368089],"study_design_scores_gemma":[0.000057810532,0.000016592718,0.00077888375,0.000050439452,0.000018055664,0.00009812357,0.0002772982,0.010892533,0.00035858204,0.98022574,0.007206212,0.000019763696],"about_ca_topic_score_codex":0.0036264376,"about_ca_topic_score_gemma":0.004289045,"teacher_disagreement_score":0.013871121,"about_ca_system_score_codex":0.0021295808,"about_ca_system_score_gemma":0.0013011316,"threshold_uncertainty_score":0.046403587},"labels":[],"label_agreement":null},{"id":"W2396910810","doi":"","title":"Signed cycle domination numbers of digraphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Arithmetic","score_opus":0.007712485541944295,"score_gpt":0.25763933095743385,"score_spread":0.24992684541548957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396910810","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5853643,0.0015310004,0.15256165,0.0017717978,0.00050989876,0.0001397769,0.0022528146,0.00067485834,0.25519392],"genre_scores_gemma":[0.96312654,0.0005054701,0.016429018,0.00019382499,0.00014404042,0.00009407474,0.00062192,0.000083777515,0.018801177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994306,0.00013890082,0.000045577646,0.00010147916,0.00018455375,0.000098820594],"domain_scores_gemma":[0.9968742,0.0016563332,0.00041876186,0.00021157105,0.00042889596,0.00041022486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000523599,0.0003466683,0.0003230639,0.0027074327,0.0009240796,0.0029649846,0.00062211754,0.00068153214,0.011185734],"category_scores_gemma":[0.00505876,0.00025889993,0.0002785664,0.001614654,0.0011343823,0.0035685264,0.00090881134,0.001016291,0.0010629816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009519009,0.000030843632,0.0010672457,0.00008752887,0.000012919378,0.00008817247,0.00021623376,0.0025819223,0.002386876,0.96040046,0.0041917865,0.028840965],"study_design_scores_gemma":[0.000029581635,0.00003523112,0.0011017583,0.00004930877,0.000017532591,0.00024394123,0.00015003237,0.011932673,0.0024036332,0.970922,0.013089563,0.000024754834],"about_ca_topic_score_codex":0.0006373084,"about_ca_topic_score_gemma":0.0012268177,"teacher_disagreement_score":0.011185734,"about_ca_system_score_codex":0.0012638897,"about_ca_system_score_gemma":0.0005432967,"threshold_uncertainty_score":0.037420034},"labels":[],"label_agreement":null},{"id":"W2396930582","doi":"","title":"Toughness of graphs and 2-factors with given properties.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Toughness; Composite material; Materials science","score_opus":0.01074919408569923,"score_gpt":0.1981150459963607,"score_spread":0.18736585191066146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396930582","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.648038,0.002049631,0.20847996,0.0055679344,0.00037344286,0.0001217038,0.0027314918,0.00072812516,0.13190976],"genre_scores_gemma":[0.9595137,0.00054173445,0.023071717,0.00038165977,0.00027581846,0.00010414914,0.0010637962,0.00012580962,0.014921721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864477,0.0003647487,0.00009062341,0.00035644328,0.00027433972,0.0002691192],"domain_scores_gemma":[0.9934487,0.004103654,0.00076573796,0.0005901205,0.00035060415,0.0007413023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011856649,0.0005755024,0.0007942432,0.0020501015,0.0020764216,0.0038721669,0.001200345,0.0012666091,0.014325964],"category_scores_gemma":[0.00641009,0.0006743701,0.0010534478,0.001989774,0.003362377,0.007358814,0.0023416537,0.0022782702,0.0010280713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013175014,0.000050971474,0.0014135975,0.0001140096,0.000023283908,0.00010206965,0.00039534978,0.0032278856,0.0011199735,0.9797763,0.0046632932,0.0089815045],"study_design_scores_gemma":[0.000020151967,0.000018666837,0.0008877142,0.000030358848,0.000014997924,0.000172075,0.00023194164,0.007759188,0.00063930266,0.9858358,0.004370433,0.000019300463],"about_ca_topic_score_codex":0.0018352276,"about_ca_topic_score_gemma":0.0017185818,"teacher_disagreement_score":0.014325964,"about_ca_system_score_codex":0.001482428,"about_ca_system_score_gemma":0.0005680272,"threshold_uncertainty_score":0.047925174},"labels":[],"label_agreement":null},{"id":"W2396935404","doi":"","title":"Distinct Rado Numbers for x 1 + x 2 + c = x 3 .","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Arithmetic","score_opus":0.034755636333408176,"score_gpt":0.2996470162715603,"score_spread":0.26489137993815215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396935404","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16551748,0.0031291044,0.13581558,0.004548845,0.003232953,0.000107833665,0.00084705907,0.0006576196,0.6861435],"genre_scores_gemma":[0.85136193,0.0011884648,0.044213627,0.001283173,0.00060884806,0.00015347928,0.00055050594,0.0002598061,0.100380115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929094,0.00014766984,0.00003920387,0.00014312663,0.00019944545,0.00017962341],"domain_scores_gemma":[0.99913675,0.00029117893,0.00012728942,0.00014965738,0.00012896796,0.00016614498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007498161,0.00086035987,0.00050189043,0.0022949532,0.0021670535,0.0034870477,0.0010279259,0.0012891539,0.02002894],"category_scores_gemma":[0.003280238,0.0003100803,0.00071100163,0.0010901624,0.003464299,0.0033206283,0.0024704624,0.003139278,0.00491867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037261707,0.000009884392,0.00013919866,0.000024140267,0.0000035497008,0.00006699781,0.000108762804,0.0001380435,0.00052442297,0.99134,0.002892763,0.004714964],"study_design_scores_gemma":[0.000027258407,0.000022067397,0.0004586698,0.000060056955,0.000014966918,0.0003553782,0.00020256703,0.0015809438,0.0016852412,0.9633416,0.032218948,0.000032288397],"about_ca_topic_score_codex":0.00070673553,"about_ca_topic_score_gemma":0.0010637185,"teacher_disagreement_score":0.02002894,"about_ca_system_score_codex":0.0011204653,"about_ca_system_score_gemma":0.0008438681,"threshold_uncertainty_score":0.06700349},"labels":[],"label_agreement":null},{"id":"W2396949595","doi":"","title":"No 4-isosceles set with eight points on a circle.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Isosceles triangle; Mathematics; Set (abstract data type); Combinatorics; Geometry; Computer science","score_opus":0.01413272286756431,"score_gpt":0.24641789016791826,"score_spread":0.23228516730035395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396949595","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42380774,0.0016471165,0.109581806,0.0035446598,0.0022670059,0.00019076752,0.0031820827,0.0010765648,0.4547022],"genre_scores_gemma":[0.78531194,0.00090147834,0.064099,0.000922521,0.00061557966,0.00024312458,0.005393911,0.00038202567,0.1421303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987703,0.00022677412,0.00010940634,0.00031841383,0.0003759113,0.00019914469],"domain_scores_gemma":[0.9986608,0.0003833661,0.0002069936,0.00026170362,0.00023896131,0.0002482192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000602533,0.0010910014,0.0015448529,0.002747792,0.0030654096,0.0035496086,0.001549006,0.0014496283,0.031689715],"category_scores_gemma":[0.0021757549,0.0006868401,0.0013748792,0.0013703959,0.0029192248,0.0027410553,0.003398655,0.0025379537,0.009402018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007315041,0.00013337213,0.0014226517,0.00037407278,0.00012933233,0.0012097424,0.00058544223,0.0024021047,0.0058276057,0.9192754,0.018808743,0.04910005],"study_design_scores_gemma":[0.00021050265,0.000150585,0.002881044,0.00014157638,0.00009381431,0.0024038714,0.00084921165,0.0066708843,0.0077079013,0.8437909,0.13495304,0.00014668542],"about_ca_topic_score_codex":0.0011604092,"about_ca_topic_score_gemma":0.0014665066,"teacher_disagreement_score":0.031689715,"about_ca_system_score_codex":0.0013221534,"about_ca_system_score_gemma":0.000786602,"threshold_uncertainty_score":0.10601264},"labels":[],"label_agreement":null},{"id":"W2396958062","doi":"","title":"Unicyclic graphs with equal total and total outer-connected domination numbers.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Dominating set; Combinatorics; Mathematics; Domination analysis; Vertex (graph theory); Induced subgraph; Graph; Cardinality (data modeling); Connectivity; Discrete mathematics; Computer science","score_opus":0.017967320349802873,"score_gpt":0.26817489131317584,"score_spread":0.250207570963373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396958062","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8380293,0.0017262517,0.095325544,0.00042569326,0.00007218698,0.00017946403,0.0030800262,0.00028916044,0.06087228],"genre_scores_gemma":[0.98048043,0.000603714,0.013622497,0.00008296299,0.000035144556,0.00009225528,0.0010132613,0.000032893124,0.0040367646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991209,0.00018136585,0.00006820302,0.00022597125,0.00015741761,0.00024611168],"domain_scores_gemma":[0.9954939,0.0019850957,0.001095825,0.0004133702,0.0005252113,0.0004866192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039110388,0.0006494475,0.0005817176,0.0018532905,0.0009691415,0.001555467,0.0008575219,0.0005561999,0.002296878],"category_scores_gemma":[0.0039576394,0.00027566968,0.00043360793,0.0025453605,0.0010382596,0.0015539497,0.0011283272,0.00041945733,0.0002501939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012931764,0.00022156369,0.015370045,0.0012318484,0.00026714342,0.002709211,0.0017104975,0.0851754,0.031813674,0.71683383,0.013711893,0.12966177],"study_design_scores_gemma":[0.00015150824,0.00045274425,0.016080623,0.00030461917,0.00039394456,0.012699906,0.0015345879,0.16641982,0.019361246,0.7299123,0.052552834,0.0001359123],"about_ca_topic_score_codex":0.0012134237,"about_ca_topic_score_gemma":0.0017362392,"teacher_disagreement_score":0.002296878,"about_ca_system_score_codex":0.0008572711,"about_ca_system_score_gemma":0.0004012991,"threshold_uncertainty_score":0.007683754},"labels":[],"label_agreement":null},{"id":"W2397001187","doi":"","title":"Unsolvable Block-Transitive Automorphism Groups of 2-(v, 31, 1) Designs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Transitive relation; Automorphism; Block (permutation group theory); Automorphism group; Pure mathematics; Combinatorics","score_opus":0.011688458019668297,"score_gpt":0.21346335886833115,"score_spread":0.20177490084866284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397001187","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69777673,0.0008866823,0.13936095,0.0013132896,0.00029839267,0.00024664594,0.001473728,0.0009504429,0.1576931],"genre_scores_gemma":[0.9525454,0.00022376757,0.019273484,0.00026689758,0.00006344423,0.00015480781,0.00080253015,0.00014739245,0.02652229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987264,0.0003810907,0.00007203743,0.00016232506,0.0003193395,0.00033879463],"domain_scores_gemma":[0.99760157,0.0009981825,0.00042853772,0.0005965509,0.00022545124,0.00014971099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070562074,0.0005620921,0.00048669797,0.0006783938,0.001309698,0.001998652,0.00068933854,0.0011038634,0.010524675],"category_scores_gemma":[0.003305563,0.0004937398,0.0006192715,0.0004765549,0.0013484451,0.002189088,0.0015438154,0.0011088516,0.002304705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004617787,0.000076808836,0.00077463663,0.00011236117,0.00002933373,0.00032173708,0.0005146292,0.0073831095,0.007946695,0.9561396,0.005361623,0.020877695],"study_design_scores_gemma":[0.000097911216,0.00008930813,0.000364932,0.000052083138,0.000023533563,0.00024399275,0.00015294921,0.015727064,0.0064904345,0.9673492,0.009379705,0.000028986695],"about_ca_topic_score_codex":0.0010924522,"about_ca_topic_score_gemma":0.0016315916,"teacher_disagreement_score":0.010524675,"about_ca_system_score_codex":0.0009410227,"about_ca_system_score_gemma":0.0013026213,"threshold_uncertainty_score":0.035208523},"labels":[],"label_agreement":null},{"id":"W2397002994","doi":"","title":"On Families Of Bipartite Graphs Associated With Sums Of Generalized Order-k Fibonacci And Lucas Numbers.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Combinatorics; Mathematics; Lucas number; Bipartite graph; Order (exchange); Sequence (biology); Fibonacci polynomials; Lucas sequence; Pisano period; Discrete mathematics; Graph; Orthogonal polynomials; Chemistry","score_opus":0.00583559572550381,"score_gpt":0.24083337682739422,"score_spread":0.2349977811018904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397002994","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5774499,0.003449209,0.31092757,0.0012406451,0.00049079955,0.00015704901,0.0011174893,0.00054624036,0.10462111],"genre_scores_gemma":[0.93782485,0.0014936727,0.040293,0.00034174568,0.00035344192,0.00023065566,0.00089249,0.00015910559,0.018411068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870205,0.00039543712,0.000050164846,0.00028347128,0.00032019473,0.00024873042],"domain_scores_gemma":[0.99683505,0.0016340811,0.0006923762,0.00016301549,0.00034777942,0.00032766256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008884942,0.0006853989,0.0006347773,0.0031739406,0.0026933046,0.0019109879,0.00073070626,0.0013630288,0.009243732],"category_scores_gemma":[0.0053819967,0.00061708386,0.0010137932,0.0017175889,0.0020246964,0.0030620832,0.0013638404,0.000920097,0.0008564705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055097695,0.000015915937,0.0011777487,0.00008036087,0.000018979683,0.00045278104,0.00039750873,0.0027863926,0.0014433229,0.98451483,0.0020380453,0.0070190495],"study_design_scores_gemma":[0.0000188741,0.00002931877,0.0014875648,0.00007347339,0.000021803116,0.0013217388,0.00032151045,0.02177762,0.0007601212,0.9645766,0.009575074,0.000036206715],"about_ca_topic_score_codex":0.0016662405,"about_ca_topic_score_gemma":0.0019974816,"teacher_disagreement_score":0.009243732,"about_ca_system_score_codex":0.0014153558,"about_ca_system_score_gemma":0.0004972199,"threshold_uncertainty_score":0.030923367},"labels":[],"label_agreement":null},{"id":"W2397005811","doi":"","title":"The Signless Laplacian specttral radius of bicyclic graphs with order n and girth g.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Girth (graph theory); Combinatorics; Discrete mathematics","score_opus":0.026843991954859456,"score_gpt":0.2695828428488755,"score_spread":0.24273885089401606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397005811","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85891956,0.0016928253,0.031690557,0.0014923547,0.00023419123,0.000052492273,0.00072622846,0.0004446517,0.10474718],"genre_scores_gemma":[0.99174494,0.00038561682,0.0029574756,0.0001246469,0.000058416816,0.000033214917,0.00016466044,0.00004310176,0.0044879327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996947,0.00010370631,0.000012584615,0.00005183098,0.00007135097,0.00006574891],"domain_scores_gemma":[0.9984092,0.00067902554,0.0003352335,0.000113048816,0.00015384641,0.00030957407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030014582,0.00036087428,0.00039795975,0.0015223694,0.0006303173,0.0011840888,0.0008173695,0.0007380859,0.0047577843],"category_scores_gemma":[0.0039868914,0.00021504452,0.00015807345,0.00060295063,0.0013056913,0.001120862,0.0011138831,0.0005820894,0.0008629843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006736251,0.000069155525,0.0029222763,0.00031532306,0.00003947314,0.0005211155,0.0005476246,0.021946691,0.021338273,0.89911395,0.01827192,0.03424062],"study_design_scores_gemma":[0.00010852491,0.00016794408,0.0056688753,0.000109807945,0.000049973165,0.0012200371,0.0007191049,0.11784452,0.008179307,0.8542479,0.01158871,0.000095228264],"about_ca_topic_score_codex":0.0010639264,"about_ca_topic_score_gemma":0.0009924718,"teacher_disagreement_score":0.0047577843,"about_ca_system_score_codex":0.0005781055,"about_ca_system_score_gemma":0.00033784797,"threshold_uncertainty_score":0.015916407},"labels":[],"label_agreement":null},{"id":"W2397010240","doi":"","title":"On the signless Laplacian spectra of bicyclic and tricyclic graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tricyclic; Combinatorics; Mathematics; Bicyclic molecule; Stereochemistry; Chemistry","score_opus":0.045852315010755845,"score_gpt":0.28717936069790356,"score_spread":0.24132704568714772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397010240","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6181733,0.0057609854,0.08515714,0.0056568286,0.0012288293,0.0000691336,0.00088743743,0.0004794768,0.28258696],"genre_scores_gemma":[0.9720043,0.001944123,0.0071751205,0.00067630934,0.0006087419,0.000045774403,0.00031418563,0.00011277295,0.017118698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996363,0.000092431656,0.000014176773,0.00006126069,0.00011418576,0.0000816206],"domain_scores_gemma":[0.9986557,0.00058166153,0.00021299651,0.00009820417,0.00016388878,0.00028756325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040344615,0.00067094207,0.000590805,0.003215749,0.001288118,0.0021329385,0.000961647,0.0011210536,0.01040525],"category_scores_gemma":[0.0032639648,0.00034025576,0.00037184174,0.0014612735,0.0025267822,0.0028567798,0.0017126634,0.0016234012,0.0013778796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004133064,0.000028712348,0.00030010458,0.000054039203,0.000005404633,0.00013864174,0.00024247762,0.0014991041,0.0015464849,0.983108,0.004596432,0.008439278],"study_design_scores_gemma":[0.000013296024,0.000011397622,0.0003488306,0.00002893423,0.0000041644057,0.00020455362,0.00018258208,0.006709643,0.0002912777,0.99004024,0.0021522355,0.000012914938],"about_ca_topic_score_codex":0.0009896023,"about_ca_topic_score_gemma":0.0012310933,"teacher_disagreement_score":0.01040525,"about_ca_system_score_codex":0.00079938513,"about_ca_system_score_gemma":0.0003678374,"threshold_uncertainty_score":0.034808993},"labels":[],"label_agreement":null},{"id":"W2397010370","doi":"","title":"Cographic and global cographic domination number of a graph.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Domination analysis; Combinatorics","score_opus":0.00815285498671749,"score_gpt":0.2841116367541711,"score_spread":0.27595878176745364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397010370","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7339883,0.001308335,0.06802814,0.0018606383,0.0002491176,0.00008222112,0.0032537247,0.0003972298,0.19083238],"genre_scores_gemma":[0.9758504,0.00038339998,0.010471202,0.00013201137,0.00012834577,0.00006929931,0.0007296224,0.000049735143,0.012185972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994123,0.00013161502,0.000029378652,0.00016456617,0.0001356873,0.00012639175],"domain_scores_gemma":[0.99644536,0.0017769155,0.0004733083,0.00033594764,0.00039315684,0.0005752944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000596832,0.0003521516,0.00040877506,0.0024801488,0.0010820333,0.002462946,0.00085547747,0.00059259584,0.009703719],"category_scores_gemma":[0.0033176234,0.00017124842,0.0003393212,0.0016165706,0.0019794577,0.0027585917,0.0010564479,0.0008641087,0.0007863962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020969115,0.000054171476,0.004652029,0.00016452947,0.00004198293,0.00016422753,0.00045855978,0.0046883025,0.0044574053,0.9524262,0.007188151,0.025494918],"study_design_scores_gemma":[0.000055063567,0.0000731367,0.008080968,0.00006894312,0.000075949174,0.00083612447,0.00048065328,0.017991971,0.0041799946,0.9481344,0.019986095,0.000036695426],"about_ca_topic_score_codex":0.0008791396,"about_ca_topic_score_gemma":0.0014103565,"teacher_disagreement_score":0.009703719,"about_ca_system_score_codex":0.0011270194,"about_ca_system_score_gemma":0.000663586,"threshold_uncertainty_score":0.03246218},"labels":[],"label_agreement":null},{"id":"W2397017387","doi":"","title":"Isomorphisms of directed P 3 -graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.011835137230630415,"score_gpt":0.17962634667421892,"score_spread":0.1677912094435885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397017387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15632506,0.0010103909,0.4550536,0.0017212187,0.0007643804,0.0002020747,0.0010253116,0.0011746499,0.3827234],"genre_scores_gemma":[0.8249571,0.001019352,0.09768373,0.0009999792,0.00032072427,0.00026719607,0.0015107301,0.00042413844,0.072817035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873143,0.00040397904,0.00007397702,0.00028553137,0.00028377172,0.00022145019],"domain_scores_gemma":[0.9977609,0.0010120306,0.00026835996,0.00037090015,0.0003019964,0.00028578023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006202902,0.0004870159,0.00031935395,0.0029599934,0.0016448159,0.002763652,0.0006391637,0.0010120026,0.019092193],"category_scores_gemma":[0.0033141514,0.00041608873,0.00082224293,0.0014909471,0.0014805638,0.0037723281,0.0025440606,0.0018359353,0.0028737972],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002624459,0.000034705095,0.0002882637,0.00003352646,0.000008671699,0.00018662501,0.00024320488,0.0005402208,0.0010235154,0.98025185,0.002842407,0.014520751],"study_design_scores_gemma":[0.000009934584,0.00001255339,0.00034972923,0.000025953272,0.0000091355905,0.00032756128,0.00021351685,0.003183542,0.0011255695,0.97762054,0.017108753,0.000013053],"about_ca_topic_score_codex":0.0010248051,"about_ca_topic_score_gemma":0.0012621159,"teacher_disagreement_score":0.019092193,"about_ca_system_score_codex":0.0009928955,"about_ca_system_score_gemma":0.0006126635,"threshold_uncertainty_score":0.063869774},"labels":[],"label_agreement":null},{"id":"W2397019729","doi":"","title":"A note on transversals.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematics and Applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.029629286745153288,"score_gpt":0.3104211457902796,"score_spread":0.28079185904512627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397019729","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021807604,0.030989585,0.2161119,0.02652145,0.023072198,0.0000826902,0.0010437975,0.00072497485,0.6796459],"genre_scores_gemma":[0.40000713,0.058272064,0.1820015,0.018522283,0.016469339,0.0003622349,0.0022312123,0.0017821318,0.32035208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985952,0.00049937534,0.00010785345,0.00030622032,0.00031542234,0.00017593493],"domain_scores_gemma":[0.9954857,0.0023242806,0.00017974054,0.0009163573,0.00071879936,0.00037502934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021915794,0.0007923824,0.00083989796,0.002137602,0.0031954371,0.003001615,0.0015341311,0.0014603275,0.027430553],"category_scores_gemma":[0.0061146067,0.00053302635,0.0014283375,0.002457196,0.004223518,0.011687865,0.0053845216,0.007863645,0.0068869926],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003265457,0.000010684188,0.0001708269,0.00010953137,0.000007913901,0.00013498528,0.0003226872,0.000115415874,0.00049279793,0.96084297,0.020836627,0.016922973],"study_design_scores_gemma":[0.000007982981,0.00003560504,0.00027623118,0.00010614902,0.000016326427,0.00056309707,0.0003827908,0.00028172258,0.0005582392,0.7485945,0.24915946,0.00001780139],"about_ca_topic_score_codex":0.002048598,"about_ca_topic_score_gemma":0.0035560506,"teacher_disagreement_score":0.027430553,"about_ca_system_score_codex":0.0012570897,"about_ca_system_score_gemma":0.0009872533,"threshold_uncertainty_score":0.09176439},"labels":[],"label_agreement":null},{"id":"W2397069087","doi":"","title":"Minimum degree and nowhere-zero 3-flows.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Zero (linguistics); Physics; Philosophy","score_opus":0.021657299920637,"score_gpt":0.23882028423757679,"score_spread":0.21716298431693978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397069087","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5682374,0.003429939,0.1865114,0.008290999,0.000762494,0.00012416001,0.0026783433,0.00040310682,0.2295622],"genre_scores_gemma":[0.8961429,0.0012353915,0.053892452,0.0006725194,0.00025248138,0.00009170197,0.001204381,0.00016672157,0.04634149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996201,0.000102632956,0.000018210907,0.00007613153,0.00006258672,0.00012031493],"domain_scores_gemma":[0.99844116,0.00086015806,0.00021833218,0.00013023167,0.000134731,0.00021540055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057027687,0.0005122171,0.0006206453,0.0008826303,0.0012996861,0.0021264206,0.001046611,0.0013154993,0.012793826],"category_scores_gemma":[0.0041574105,0.0003795296,0.00058024906,0.00073070073,0.0014488644,0.003279758,0.0015938916,0.0022555443,0.0016528213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021218573,0.00008210596,0.0006454088,0.00014680333,0.000020437301,0.00012795613,0.00016429125,0.0067653656,0.0021033692,0.9615451,0.009550166,0.018636802],"study_design_scores_gemma":[0.000039401166,0.000013793885,0.00034454226,0.00003152003,0.0000099747995,0.00012367996,0.000103969745,0.008222213,0.00096096157,0.98437816,0.0057598343,0.000011792629],"about_ca_topic_score_codex":0.0014093737,"about_ca_topic_score_gemma":0.0023775501,"teacher_disagreement_score":0.012793826,"about_ca_system_score_codex":0.0010982068,"about_ca_system_score_gemma":0.000798921,"threshold_uncertainty_score":0.04279965},"labels":[],"label_agreement":null},{"id":"W2397069554","doi":"","title":"The Geo-Number Of A Graph.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.01146641964436046,"score_gpt":0.2411054631725974,"score_spread":0.22963904352823694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397069554","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4699649,0.0041754018,0.21774945,0.018183134,0.0016292868,0.000115274044,0.0096243555,0.0009200951,0.27763808],"genre_scores_gemma":[0.9129148,0.0018141862,0.047501914,0.00091910956,0.0006274431,0.00015670354,0.0024740875,0.0002706007,0.033321235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991868,0.00023207116,0.000041640462,0.00021392982,0.00015773322,0.0001678317],"domain_scores_gemma":[0.9964232,0.0018734182,0.00044120787,0.00049592095,0.00028278964,0.00048347944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007121687,0.0005282276,0.0006685889,0.00238724,0.0020364851,0.0035109275,0.0012828477,0.0014042752,0.013481759],"category_scores_gemma":[0.0049058106,0.00035343657,0.0005720251,0.0023555614,0.0029226104,0.007010504,0.0021171968,0.0022421277,0.0022132662],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095574214,0.000020261185,0.001436366,0.00010826756,0.000015884012,0.00006291877,0.00021754552,0.0023918224,0.0011268705,0.9673976,0.0117780715,0.015348708],"study_design_scores_gemma":[0.000016572982,0.000020164824,0.0012502214,0.000050487914,0.000022856933,0.00035332417,0.0003342706,0.0073565696,0.0015770021,0.96106845,0.027930832,0.000019210203],"about_ca_topic_score_codex":0.0010244454,"about_ca_topic_score_gemma":0.0011710192,"teacher_disagreement_score":0.013481759,"about_ca_system_score_codex":0.0013726739,"about_ca_system_score_gemma":0.0006571518,"threshold_uncertainty_score":0.045100987},"labels":[],"label_agreement":null},{"id":"W2397079889","doi":"","title":"The Smarandachely Adjacent Vertex Total Coloring of a kind of 3-regular Grapsh.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Fractional coloring; Combinatorics; Total coloring; Complete coloring; Graph","score_opus":0.01918617832098076,"score_gpt":0.20443989668335377,"score_spread":0.185253718362373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397079889","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6499531,0.0005690004,0.11748404,0.0016340805,0.0005317878,0.00008837582,0.0017027634,0.00097204506,0.2270648],"genre_scores_gemma":[0.9188535,0.00020229364,0.039053127,0.0004407773,0.000091329355,0.00004763258,0.0012898574,0.00020757038,0.03981391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998031,0.00004696845,0.0000069573825,0.00004738913,0.00003455833,0.00006106126],"domain_scores_gemma":[0.9996245,0.000097616634,0.000042790787,0.0000903797,0.00005682628,0.00008788719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016669855,0.00028619627,0.0002737389,0.00065852393,0.001400117,0.0011569466,0.0005182775,0.0007268626,0.013113433],"category_scores_gemma":[0.00071741693,0.0002663971,0.00041192136,0.0007172381,0.0010795909,0.0010650428,0.00089896104,0.0009595933,0.0012983178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022560528,0.00004283039,0.001255136,0.00012240635,0.00002276606,0.00042929986,0.00041158267,0.0039911564,0.009260223,0.9541277,0.01470794,0.015403333],"study_design_scores_gemma":[0.00006733197,0.00006402706,0.0024444254,0.000046128047,0.0000348136,0.00090498885,0.0004764267,0.02000622,0.004484985,0.927454,0.04398207,0.00003458309],"about_ca_topic_score_codex":0.0018117013,"about_ca_topic_score_gemma":0.0034638797,"teacher_disagreement_score":0.013113433,"about_ca_system_score_codex":0.00052697863,"about_ca_system_score_gemma":0.0003901292,"threshold_uncertainty_score":0.04386884},"labels":[],"label_agreement":null},{"id":"W2397109063","doi":"","title":"On the adjacent vertex distinguishing total chromatic number of outer plane graph.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Chromatic scale; Graph; Windmill graph; Friendship graph; Graph power; Line graph","score_opus":0.013693243711513285,"score_gpt":0.232055090437218,"score_spread":0.21836184672570472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397109063","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74707,0.0023509348,0.13120198,0.0045506437,0.0004032383,0.00010004959,0.0017964848,0.000466859,0.112059794],"genre_scores_gemma":[0.96144384,0.000794965,0.026814839,0.00039126302,0.0002619231,0.00008822905,0.0010385719,0.00014037394,0.009026098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990339,0.00027237655,0.000030298139,0.00027932524,0.00016066417,0.00022345167],"domain_scores_gemma":[0.99478006,0.0035979627,0.0004708551,0.00045944843,0.00028929472,0.00040226505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011251051,0.00059408427,0.00081073184,0.0021471095,0.002191002,0.002618138,0.0021319126,0.0013934837,0.009890229],"category_scores_gemma":[0.0062415428,0.00044588392,0.00056410534,0.002078453,0.0025061604,0.0060097883,0.0018378105,0.0025701395,0.00083761616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054284645,0.00014965166,0.0049871835,0.0003302083,0.000043974393,0.0001335039,0.0004971188,0.027567385,0.0044722133,0.9125248,0.017174086,0.031577058],"study_design_scores_gemma":[0.00007656875,0.0000701644,0.0034148733,0.0000676701,0.00006955573,0.00028876637,0.0004765056,0.09777718,0.0026764157,0.8864007,0.008634626,0.000046882917],"about_ca_topic_score_codex":0.0034170258,"about_ca_topic_score_gemma":0.0033898589,"teacher_disagreement_score":0.009890229,"about_ca_system_score_codex":0.0026658424,"about_ca_system_score_gemma":0.0009969572,"threshold_uncertainty_score":0.03308612},"labels":[],"label_agreement":null},{"id":"W2397111251","doi":"","title":"On the spectral radius of quasi-unicycle graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; RADIUS; Pure mathematics; Combinatorics; Computer science; Physics; Eigenvalues and eigenvectors; Computer security; Quantum mechanics","score_opus":0.02091164492999859,"score_gpt":0.2614589640855233,"score_spread":0.24054731915552474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397111251","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5821225,0.0106295785,0.21554334,0.00527646,0.00089110003,0.00008448645,0.0008297249,0.00066227245,0.18396047],"genre_scores_gemma":[0.9729546,0.0025140957,0.014882525,0.00049322756,0.0005533498,0.00011771289,0.0003154796,0.00024695706,0.007922029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987888,0.0005593073,0.000046103316,0.00020471659,0.0002150102,0.00018612409],"domain_scores_gemma":[0.98902994,0.007443287,0.0011314692,0.00060382724,0.00068054645,0.0011109138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015940305,0.0007113388,0.000994767,0.004015336,0.0015620756,0.0022756886,0.0018149914,0.0015471256,0.008541681],"category_scores_gemma":[0.014249332,0.00051966956,0.00040860754,0.0016967964,0.0033967448,0.0053098197,0.0025882833,0.001817662,0.0018114264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009541582,0.000026067302,0.000698066,0.000098459284,0.000014890882,0.00006994571,0.00026506238,0.004242149,0.0013562079,0.98073673,0.0044118944,0.007985138],"study_design_scores_gemma":[0.000015508249,0.000022772227,0.0007465832,0.00005503319,0.000014656278,0.00018059683,0.0002842694,0.022744302,0.0006361739,0.97152483,0.0037561818,0.000019082423],"about_ca_topic_score_codex":0.0008867739,"about_ca_topic_score_gemma":0.0007578206,"teacher_disagreement_score":0.008541681,"about_ca_system_score_codex":0.001259933,"about_ca_system_score_gemma":0.00035207978,"threshold_uncertainty_score":0.028574765},"labels":[],"label_agreement":null},{"id":"W2397155156","doi":"","title":"PI Index of Extremal Simple Pericondensed Hexagonal Systems.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Simple (philosophy); Hexagonal crystal system; Index (typography); Combinatorics; Pure mathematics; Discrete mathematics; Crystallography; Computer science; Chemistry","score_opus":0.03641791523662894,"score_gpt":0.29244438985618293,"score_spread":0.25602647461955397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397155156","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7489941,0.00059924286,0.020892391,0.00071195216,0.0002638613,0.00005037464,0.0006335698,0.0002592309,0.22759531],"genre_scores_gemma":[0.98844576,0.00015297697,0.0035221297,0.00010275366,0.00005832669,0.000028074037,0.00023878708,0.000032279047,0.0074189436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973935,0.000060405968,0.000012215993,0.000031530875,0.00008098474,0.00007536976],"domain_scores_gemma":[0.99948186,0.00012948632,0.00012149517,0.000069581554,0.000071327086,0.00012620735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023290656,0.0002754033,0.00033009765,0.0017479123,0.0010918754,0.0019821508,0.00064448727,0.00076555525,0.012707325],"category_scores_gemma":[0.0013644717,0.00019492797,0.00014115538,0.0007492658,0.0011074725,0.0012593325,0.001189139,0.0007740957,0.0011207456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014622012,0.000037298985,0.00095185183,0.000073543655,0.000011415856,0.00018921874,0.00015923029,0.0024014118,0.0033278053,0.975906,0.00409558,0.012700457],"study_design_scores_gemma":[0.000058151025,0.00006660445,0.002501357,0.00003369936,0.000015102148,0.0004852331,0.00038676395,0.029588176,0.003516725,0.9548522,0.008464661,0.000031227388],"about_ca_topic_score_codex":0.00071476906,"about_ca_topic_score_gemma":0.0009891584,"teacher_disagreement_score":0.012707325,"about_ca_system_score_codex":0.00058267615,"about_ca_system_score_gemma":0.0003222045,"threshold_uncertainty_score":0.04251021},"labels":[],"label_agreement":null},{"id":"W2397175735","doi":"","title":"Distance in the non-commuting graph of groups.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.037561555992187724,"score_gpt":0.2741475088030474,"score_spread":0.23658595281085967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397175735","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5253145,0.006426639,0.27187842,0.0068059685,0.001253603,0.00007861027,0.0005889808,0.000388073,0.18726519],"genre_scores_gemma":[0.93593293,0.0017708639,0.03325352,0.0007194646,0.0007005993,0.000080913844,0.00032474613,0.0001353493,0.027081603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991424,0.00029626934,0.000047106652,0.00021667323,0.00020298854,0.000094565126],"domain_scores_gemma":[0.99725,0.0014170514,0.0003942225,0.00027450264,0.00028629825,0.00037793315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007603691,0.00040428643,0.0006860505,0.0018786311,0.0018685458,0.0021857074,0.0010502372,0.0011378656,0.006866086],"category_scores_gemma":[0.0038117408,0.0003131489,0.00050096173,0.0012875925,0.0028185719,0.006337363,0.0019000754,0.0021615482,0.0009551534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013155782,0.000009184925,0.00017138217,0.000028035947,0.000003893792,0.00002914232,0.00016326006,0.00024232946,0.00024986066,0.9942092,0.0008496717,0.0040309266],"study_design_scores_gemma":[0.0000057591506,0.000006991091,0.00017401755,0.000006548478,0.0000032037046,0.00005834564,0.000072476796,0.0013651319,0.00012606083,0.99589866,0.0022785466,0.000004324843],"about_ca_topic_score_codex":0.0011654644,"about_ca_topic_score_gemma":0.0013807137,"teacher_disagreement_score":0.006866086,"about_ca_system_score_codex":0.0010453679,"about_ca_system_score_gemma":0.00045539552,"threshold_uncertainty_score":0.022969365},"labels":[],"label_agreement":null},{"id":"W2397243317","doi":"","title":"Some new optimal generalized Sidon sequences.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Nonlinear Waves and Solitons","field":"Physics and Astronomy","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.01616632642970176,"score_gpt":0.26713065762031113,"score_spread":0.25096433119060935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397243317","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2718679,0.00435064,0.33556798,0.0027399056,0.0021778627,0.00028533692,0.0014112483,0.00055382645,0.3810453],"genre_scores_gemma":[0.7454391,0.0029807156,0.13803482,0.0014011461,0.00056887814,0.00042865396,0.0016377885,0.00039878275,0.109110065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959546,0.00010554639,0.000031066644,0.000063207066,0.000120293036,0.000084476735],"domain_scores_gemma":[0.99941504,0.00016962529,0.00008102065,0.00006444183,0.00012507789,0.00014482264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006204785,0.0007927461,0.00048561525,0.0016758913,0.0010583658,0.0017363029,0.00077858777,0.00092412526,0.015919728],"category_scores_gemma":[0.002653095,0.00030722245,0.000481042,0.0010731411,0.0009631852,0.0023131918,0.0018655023,0.0014618782,0.0021228965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006993332,0.000034582677,0.00014304243,0.000073997275,0.000006630091,0.00006075935,0.000089205845,0.0026369034,0.0016870935,0.9671816,0.0042244024,0.023791865],"study_design_scores_gemma":[0.000036108682,0.00005620334,0.00019751432,0.000055353732,0.000008349309,0.0001335678,0.000098589626,0.020379119,0.0013858958,0.95644337,0.0211826,0.000023310471],"about_ca_topic_score_codex":0.00060248736,"about_ca_topic_score_gemma":0.0013503798,"teacher_disagreement_score":0.015919728,"about_ca_system_score_codex":0.0012153422,"about_ca_system_score_gemma":0.0009121638,"threshold_uncertainty_score":0.05325675},"labels":[],"label_agreement":null},{"id":"W2397245036","doi":"","title":"On Removable Series Classes In Critically Connected Binary Matroids.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Series (stratigraphy); Matroid; Binary number; Combinatorics; Arithmetic","score_opus":0.02156686619076014,"score_gpt":0.25736330640285743,"score_spread":0.23579644021209728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397245036","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6432419,0.0018083232,0.16413243,0.0027690176,0.00035737714,0.00011455317,0.000687209,0.000570719,0.1863185],"genre_scores_gemma":[0.95810187,0.00094720314,0.013834544,0.00032161002,0.00040156653,0.000076703414,0.0006106229,0.00013716452,0.025568647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946743,0.00012405188,0.000031645188,0.0001091264,0.00014622933,0.00012156864],"domain_scores_gemma":[0.9970246,0.0019191144,0.00035225664,0.0002373541,0.000145902,0.00032074892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063980574,0.00061261974,0.000742533,0.0019922915,0.001651438,0.0030613844,0.0012291553,0.0011419076,0.01598575],"category_scores_gemma":[0.0050896937,0.00047937012,0.00083510857,0.0015040275,0.0028356372,0.005401446,0.0019716271,0.0025711202,0.0010485407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007443275,0.000040146642,0.00068347994,0.00008723516,0.000013846548,0.00014827149,0.0001854099,0.0030739666,0.0009248961,0.98176414,0.0026721593,0.010332033],"study_design_scores_gemma":[0.000024076664,0.000024317276,0.00034815536,0.000031224266,0.000017000413,0.00022393612,0.0001081095,0.01024727,0.0007310055,0.98430717,0.003927839,0.000010008841],"about_ca_topic_score_codex":0.0007146731,"about_ca_topic_score_gemma":0.0010662682,"teacher_disagreement_score":0.01598575,"about_ca_system_score_codex":0.0015550739,"about_ca_system_score_gemma":0.0003768171,"threshold_uncertainty_score":0.053477705},"labels":[],"label_agreement":null},{"id":"W2397253249","doi":"","title":"Monophonic and Geodetic Domination in the Join, Corona and Composition of Graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Join (topology); Geodetic datum; Mathematics; Corona (planetary geology); Composition (language); Combinatorics; Geography; Geodesy; Linguistics; Physics; Astrobiology","score_opus":0.006414856909951176,"score_gpt":0.2134124954096739,"score_spread":0.20699763849972275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397253249","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6196794,0.0023647777,0.2573768,0.0020684176,0.00028595683,0.00008232701,0.00060271437,0.00048782633,0.11705178],"genre_scores_gemma":[0.95492876,0.0005855524,0.023964407,0.0002683517,0.00032592108,0.00007678769,0.00036227066,0.000106623695,0.019381357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924916,0.00021300401,0.000050313865,0.00019150489,0.00016791085,0.00012811487],"domain_scores_gemma":[0.9967464,0.0018785836,0.00042222583,0.0003162057,0.00026022107,0.00037633174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087269384,0.00025385563,0.0005499219,0.0016604664,0.0015371207,0.0021923555,0.00060518796,0.0007339819,0.004996165],"category_scores_gemma":[0.005068191,0.000353872,0.0005906747,0.0010176116,0.00272226,0.0036585496,0.0015905845,0.0009609117,0.00052833406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000557462,0.000015558751,0.0010585632,0.000039699757,0.000010557237,0.00012954262,0.00031602292,0.0014857852,0.0012136077,0.9852604,0.0010777613,0.009336694],"study_design_scores_gemma":[0.000014864083,0.000015798321,0.0011484431,0.000018191355,0.000017761278,0.00040468937,0.0001998529,0.010138209,0.0010340039,0.9806528,0.0063394485,0.00001592577],"about_ca_topic_score_codex":0.0016104033,"about_ca_topic_score_gemma":0.0028604155,"teacher_disagreement_score":0.004996165,"about_ca_system_score_codex":0.00089236937,"about_ca_system_score_gemma":0.0005812559,"threshold_uncertainty_score":0.016713798},"labels":[],"label_agreement":null},{"id":"W2397285971","doi":"","title":"On The Two-Square Theorem And The Modular Group.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Modular design; Square (algebra); Group (periodic table); Modular group; Pure mathematics; Combinatorics; Discrete mathematics; Geometry; Computer science; Physics","score_opus":0.007432687003532273,"score_gpt":0.21685436308465952,"score_spread":0.20942167608112724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397285971","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06076217,0.02295255,0.2652488,0.03113801,0.0030531823,0.000060919014,0.0004186298,0.00053854444,0.61582714],"genre_scores_gemma":[0.83869916,0.0098979,0.059061617,0.0060238307,0.004331712,0.00015189093,0.00042269778,0.00028962735,0.08112154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992065,0.00029490225,0.00003407379,0.00014144937,0.00020004195,0.00012308711],"domain_scores_gemma":[0.9975896,0.0017068208,0.000104042985,0.00028162744,0.00018172902,0.00013625174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016442094,0.0005939252,0.00066510466,0.0013375169,0.0019126912,0.0026316615,0.0009616388,0.0013422602,0.012533384],"category_scores_gemma":[0.0050001326,0.00035581138,0.00064847025,0.0014111251,0.0072825765,0.011139675,0.003084679,0.0028585475,0.0022115717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008807228,0.0000061837777,0.000059551476,0.000017736491,0.0000030296453,0.000024890413,0.000054275104,0.00016628375,0.000056378063,0.9913031,0.003499302,0.0048004393],"study_design_scores_gemma":[0.0000036138495,0.000002476754,0.000048491034,0.0000058871533,0.0000014263564,0.000021168915,0.000016096232,0.00030987398,0.000043454274,0.99512154,0.0044238544,0.000002207038],"about_ca_topic_score_codex":0.0011365598,"about_ca_topic_score_gemma":0.001342009,"teacher_disagreement_score":0.012533384,"about_ca_system_score_codex":0.0013053418,"about_ca_system_score_gemma":0.00052517094,"threshold_uncertainty_score":0.04192841},"labels":[],"label_agreement":null},{"id":"W2397286050","doi":"","title":"A New Construction of Multisender Authentication Codes with Simultaneous Model from Singular Symplectic Geometry over Finite Fields.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Symplectic geometry; Mathematics; Finite field; Geometry; Finite geometry; Pure mathematics; Discrete mathematics","score_opus":0.014897913783867345,"score_gpt":0.2313137153047273,"score_spread":0.21641580152085996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397286050","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22785681,0.00072821986,0.6739981,0.0019262196,0.0006494389,0.00024554567,0.00049500697,0.0013181278,0.09278256],"genre_scores_gemma":[0.9154501,0.00030217296,0.06814988,0.00035847002,0.00015698325,0.00012169797,0.0002748007,0.00018570959,0.015000203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914753,0.00017820323,0.00005260163,0.00015562934,0.00027828966,0.0001876985],"domain_scores_gemma":[0.9986199,0.00029288346,0.00016230762,0.00052971364,0.00015122039,0.00024402373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061192294,0.0005955552,0.0007005078,0.0010844516,0.0015091226,0.0018876655,0.001005777,0.0013150615,0.006185625],"category_scores_gemma":[0.0017932694,0.00049671374,0.0008980574,0.0007769083,0.0023266731,0.004009996,0.005431833,0.002359729,0.0015635852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037838967,0.000022557562,0.00015333027,0.000031300697,0.000006028475,0.00015587074,0.0001709603,0.0013114252,0.0022504404,0.989553,0.0013266245,0.004980733],"study_design_scores_gemma":[0.000038347112,0.0000691994,0.00014647907,0.00003724948,0.000018303537,0.0004874131,0.00010957318,0.02973077,0.004630287,0.95599526,0.008698343,0.000038845563],"about_ca_topic_score_codex":0.000348291,"about_ca_topic_score_gemma":0.00049235154,"teacher_disagreement_score":0.006185625,"about_ca_system_score_codex":0.00065873604,"about_ca_system_score_gemma":0.000959943,"threshold_uncertainty_score":0.020692945},"labels":[],"label_agreement":null},{"id":"W2397289802","doi":"","title":"The hyper-Wiener index of unicyclic graphs with given matching number.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Wiener index; Matching (statistics); Index (typography); Combinatorics; Statistics; Graph; Computer science; World Wide Web","score_opus":0.02673195540462121,"score_gpt":0.26354293707610066,"score_spread":0.23681098167147946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397289802","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82659024,0.0021583734,0.06694103,0.0010156082,0.00028876952,0.00004027395,0.00077807327,0.00028347832,0.101904064],"genre_scores_gemma":[0.9829444,0.00073250016,0.0064261425,0.00008683392,0.00012997664,0.000039710823,0.00024989486,0.000068597925,0.009321892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996275,0.00008541773,0.000023099183,0.0000679472,0.000103318496,0.00009272608],"domain_scores_gemma":[0.99838936,0.00058930274,0.00038556763,0.00013583699,0.00018497788,0.00031492877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058282807,0.00035570542,0.0005590938,0.0032914882,0.000938538,0.0024259745,0.00083095714,0.00073790725,0.0054957992],"category_scores_gemma":[0.0040856963,0.00027478483,0.00025572904,0.0018323726,0.0014314422,0.0032583494,0.0014095274,0.0007726781,0.00104525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017130452,0.000024571831,0.0015091146,0.00008581599,0.000022478516,0.00012923716,0.00024055803,0.0034577185,0.0047780243,0.9732782,0.0024674733,0.013835385],"study_design_scores_gemma":[0.00002132853,0.00003076981,0.001929674,0.000052956326,0.000023891856,0.00030573964,0.00021616249,0.025077296,0.0032512157,0.96423876,0.004822982,0.000029211924],"about_ca_topic_score_codex":0.0005132403,"about_ca_topic_score_gemma":0.0007581074,"teacher_disagreement_score":0.0054957992,"about_ca_system_score_codex":0.00095025904,"about_ca_system_score_gemma":0.00035093186,"threshold_uncertainty_score":0.018385231},"labels":[],"label_agreement":null},{"id":"W2397294813","doi":"","title":"A new bound on maximum genus of simple graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Genus; Simple (philosophy); Combinatorics; Zoology; Biology","score_opus":0.023759588533645397,"score_gpt":0.2271392968319619,"score_spread":0.2033797082983165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397294813","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10647758,0.016761025,0.47322297,0.017452333,0.004096383,0.0001675571,0.0030241858,0.0028373275,0.37596074],"genre_scores_gemma":[0.7151709,0.009951654,0.20638816,0.005555488,0.0059357774,0.0005928126,0.0034727645,0.0024267123,0.050505653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974706,0.00045200935,0.00013120132,0.0006806544,0.0008330625,0.0004324869],"domain_scores_gemma":[0.9831638,0.011145544,0.000829718,0.0023875341,0.0009997276,0.001473769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023963205,0.0019121142,0.0020059997,0.0050337007,0.0027407228,0.006623279,0.0040223943,0.0032390251,0.01715777],"category_scores_gemma":[0.017386511,0.0011953464,0.0017177411,0.0041751303,0.0044565657,0.019029604,0.007290896,0.008293025,0.004244375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020179065,0.00012200578,0.0016349697,0.000384443,0.000047959755,0.00015714439,0.00027975676,0.0055960645,0.0038681803,0.9080166,0.033991624,0.04569935],"study_design_scores_gemma":[0.000027269227,0.000036971553,0.00084060314,0.00013020987,0.000050122308,0.00032925227,0.00012465921,0.019645352,0.0017941985,0.9520257,0.02495492,0.00004074701],"about_ca_topic_score_codex":0.00081161456,"about_ca_topic_score_gemma":0.0014423996,"teacher_disagreement_score":0.01715777,"about_ca_system_score_codex":0.0030173613,"about_ca_system_score_gemma":0.0009118519,"threshold_uncertainty_score":0.05739844},"labels":[],"label_agreement":null},{"id":"W2397312785","doi":"","title":"Walk Regular Digraphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics; Pure mathematics","score_opus":0.00967793685079788,"score_gpt":0.2614910553113739,"score_spread":0.251813118460576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397312785","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17541601,0.0023808337,0.28548574,0.0027407198,0.00087212276,0.00029369554,0.006890314,0.0021239566,0.52379674],"genre_scores_gemma":[0.74554497,0.0018288712,0.05179825,0.0010967974,0.00023431335,0.0001708344,0.0052640303,0.0003504392,0.19371147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966633,0.000058369038,0.000023807048,0.00010632768,0.00007753887,0.00006756002],"domain_scores_gemma":[0.99920326,0.00024970944,0.00008896814,0.00014064398,0.00015048946,0.0001669652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018526903,0.00039368946,0.0004293169,0.001235489,0.0010750275,0.0019073935,0.00060800265,0.00068529113,0.022658069],"category_scores_gemma":[0.0015675782,0.0003244204,0.00039216457,0.0012023167,0.0006059873,0.0023254934,0.001131469,0.0010369612,0.005279323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077828976,0.00006767608,0.00052493275,0.00014823361,0.00002477433,0.00037780975,0.00025385828,0.0008706774,0.002279683,0.9413744,0.01768517,0.036315005],"study_design_scores_gemma":[0.000034443685,0.000035382534,0.0006528709,0.000057882626,0.000034555418,0.0007304852,0.00023167826,0.0050907508,0.0018863697,0.90193135,0.089294836,0.000019424877],"about_ca_topic_score_codex":0.0010064585,"about_ca_topic_score_gemma":0.002387959,"teacher_disagreement_score":0.022658069,"about_ca_system_score_codex":0.0005990558,"about_ca_system_score_gemma":0.00037807482,"threshold_uncertainty_score":0.07579881},"labels":[],"label_agreement":null},{"id":"W2397334390","doi":"","title":"The commutativity degree of 2-generated groups of nilpotency class 2.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Commutative property; Class (philosophy); Degree (music); Pure mathematics; Artificial intelligence; Computer science","score_opus":0.13475641222503995,"score_gpt":0.3430319986939599,"score_spread":0.20827558646891994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397334390","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8438963,0.00071964925,0.02345783,0.0015608501,0.00045991756,0.000040936706,0.0004555445,0.0001804597,0.12922843],"genre_scores_gemma":[0.9897063,0.00017630533,0.0015157239,0.00012350355,0.00017802107,0.000029731898,0.00015028768,0.000029545177,0.008090509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909806,0.00020277077,0.000054961885,0.00020120142,0.00019806188,0.00024506293],"domain_scores_gemma":[0.99767226,0.0010656129,0.00036822437,0.00021041826,0.00026579862,0.00041766133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011302459,0.0004351091,0.00049247587,0.0022941618,0.0014558779,0.002852705,0.00070368435,0.0006305697,0.009446448],"category_scores_gemma":[0.0030231432,0.0003095516,0.00038577977,0.0007151473,0.0034778158,0.0041548703,0.0020287307,0.0011984457,0.0010718018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020587366,0.00004827983,0.0019939959,0.00006221345,0.000018360362,0.00013882366,0.0011000786,0.0005913823,0.0037546821,0.9808837,0.0020673047,0.009135236],"study_design_scores_gemma":[0.000038271362,0.0000836169,0.0027299307,0.000029189465,0.000019338022,0.00034660654,0.0004612614,0.0032926458,0.0042868187,0.9782103,0.010461881,0.000040181203],"about_ca_topic_score_codex":0.00061882427,"about_ca_topic_score_gemma":0.0006452036,"teacher_disagreement_score":0.009446448,"about_ca_system_score_codex":0.00092462875,"about_ca_system_score_gemma":0.00037353465,"threshold_uncertainty_score":0.03160149},"labels":[],"label_agreement":null},{"id":"W2397344195","doi":"","title":"Independence number and [a, b]-factors of graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Independence number; Independence (probability theory); Combinatorics; Statistics; Discrete mathematics; Graph","score_opus":0.013651687669112214,"score_gpt":0.23558931326629623,"score_spread":0.22193762559718402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397344195","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.428957,0.004251796,0.18096933,0.006363887,0.00048497817,0.0001089425,0.0030720716,0.0008009783,0.37499112],"genre_scores_gemma":[0.93433344,0.0013882838,0.028121449,0.0005440303,0.0004986928,0.00012484413,0.0016095,0.00020888742,0.033170853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987072,0.000363642,0.00005599012,0.00035380435,0.0002500505,0.00026936713],"domain_scores_gemma":[0.99409145,0.0036309552,0.0006109161,0.0005294024,0.0003583038,0.00077894627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009398311,0.0006461457,0.0007293299,0.0021861817,0.002448746,0.003700104,0.0011598555,0.0011804646,0.013113814],"category_scores_gemma":[0.0056026466,0.000638431,0.00070755975,0.002755027,0.0032283724,0.0058086505,0.001412604,0.0025539207,0.0019179473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091302725,0.000038997838,0.0007973666,0.000049054244,0.000012215062,0.00003679744,0.00014180015,0.0012073456,0.00087148976,0.98150486,0.0060052844,0.009243556],"study_design_scores_gemma":[0.00001769819,0.000009297234,0.0007491153,0.000018194145,0.000011045606,0.00010102766,0.00009144897,0.0038887002,0.0005874775,0.9867025,0.0078086224,0.000014933105],"about_ca_topic_score_codex":0.002683991,"about_ca_topic_score_gemma":0.002750528,"teacher_disagreement_score":0.013113814,"about_ca_system_score_codex":0.0017892017,"about_ca_system_score_gemma":0.00086457276,"threshold_uncertainty_score":0.04387009},"labels":[],"label_agreement":null},{"id":"W2397357283","doi":"","title":"Binding Number and Fractional k-Factors of Graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.024040772452082925,"score_gpt":0.23203429680371693,"score_spread":0.207993524351634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397357283","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47576886,0.0051518776,0.23612635,0.009007366,0.00075802294,0.00009016269,0.001366671,0.0010534158,0.27067736],"genre_scores_gemma":[0.92806697,0.0013806458,0.03580275,0.0007042267,0.00029228424,0.000085736676,0.0005457616,0.00022823007,0.03289336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985631,0.00033554522,0.000060362523,0.0003448459,0.00029595188,0.00040024574],"domain_scores_gemma":[0.9955754,0.0026727505,0.00037165068,0.0005502781,0.0002591073,0.0005709068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012367058,0.0006828113,0.0009684283,0.0021510914,0.0034650168,0.0044402354,0.0017973207,0.0020073652,0.01692651],"category_scores_gemma":[0.006866408,0.0006601033,0.0008064228,0.0025143092,0.0041899863,0.008026207,0.00218554,0.0027274678,0.0024819225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007201317,0.000029799041,0.0004063279,0.000053903696,0.0000073797764,0.00002766122,0.00014757342,0.002052765,0.0007641373,0.9842876,0.003295853,0.008854887],"study_design_scores_gemma":[0.00001317743,0.000008209157,0.00023685681,0.00002274616,0.00000864281,0.00007589006,0.00012489193,0.00543426,0.00061534025,0.9874285,0.0060165226,0.000014939733],"about_ca_topic_score_codex":0.003605694,"about_ca_topic_score_gemma":0.004272338,"teacher_disagreement_score":0.01692651,"about_ca_system_score_codex":0.0026628762,"about_ca_system_score_gemma":0.0011027477,"threshold_uncertainty_score":0.05662477},"labels":[],"label_agreement":null},{"id":"W2397365124","doi":"","title":"On some important classes of row-cyclic array codes.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arithmetic","score_opus":0.01814946058551173,"score_gpt":0.24532041511584582,"score_spread":0.2271709545303341,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397365124","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16322355,0.015632803,0.2761962,0.011550107,0.0020092996,0.00035467633,0.0031039114,0.0007239651,0.5272055],"genre_scores_gemma":[0.8239598,0.016386395,0.06359365,0.0057672714,0.004259589,0.00067261554,0.002854421,0.0004328602,0.08207341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987035,0.000294873,0.000057804038,0.00019842634,0.0004212641,0.0003241024],"domain_scores_gemma":[0.9959908,0.002354398,0.00042046414,0.00051862496,0.0004059915,0.00030978167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009858232,0.0009536325,0.00077518896,0.0037469245,0.0023233392,0.002964259,0.0011596002,0.0020334125,0.0136691285],"category_scores_gemma":[0.0066355728,0.00042444014,0.0009195923,0.003939078,0.0028548695,0.0049338792,0.0024483476,0.003442153,0.0026730723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019355111,0.000021113015,0.00017586137,0.000062585576,0.0000068450313,0.00009481401,0.00009841839,0.0011423449,0.00038947325,0.9818939,0.007259773,0.008835611],"study_design_scores_gemma":[0.000013480303,0.000015652106,0.00015663165,0.000047822326,0.0000068833256,0.00029987373,0.000050374354,0.00555745,0.00028954208,0.98043686,0.013110789,0.000014691726],"about_ca_topic_score_codex":0.0012491846,"about_ca_topic_score_gemma":0.0012791996,"teacher_disagreement_score":0.0136691285,"about_ca_system_score_codex":0.0015799128,"about_ca_system_score_gemma":0.0009885809,"threshold_uncertainty_score":0.04572779},"labels":[],"label_agreement":null},{"id":"W2397368910","doi":"","title":"More General Identities Involving The Terms Of {W n (a, b;p, q)}.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Pure mathematics","score_opus":0.0057556765555992215,"score_gpt":0.19906240242226816,"score_spread":0.19330672586666894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397368910","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0500274,0.0012143184,0.3126708,0.004978266,0.0021883743,0.00019401617,0.0012277535,0.0004573523,0.6270417],"genre_scores_gemma":[0.5174322,0.0010359801,0.13805339,0.003869449,0.001030585,0.00029798408,0.0011290257,0.000501594,0.33664978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890876,0.00029615714,0.00006931885,0.00021169575,0.00027633825,0.00023774005],"domain_scores_gemma":[0.99909127,0.00023930999,0.00009578559,0.00030872467,0.000183628,0.000081269536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001330799,0.0006524477,0.00063344475,0.001518036,0.0032425525,0.0026118474,0.0012974105,0.0021605704,0.033087794],"category_scores_gemma":[0.0024823123,0.00034311725,0.0010871083,0.0016585119,0.002179462,0.0077111092,0.0021867133,0.0029728552,0.006010158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013159796,0.000021557411,0.000111250374,0.000024209025,0.0000037646537,0.00010359623,0.00023648934,0.00022111596,0.00045665423,0.9899856,0.0055460692,0.0032765262],"study_design_scores_gemma":[0.000008962228,0.0000058019154,0.00018427402,0.00002474732,0.000010053227,0.00020323742,0.00010644467,0.0027301651,0.0006831436,0.9600166,0.03600945,0.00001705525],"about_ca_topic_score_codex":0.003159869,"about_ca_topic_score_gemma":0.006466326,"teacher_disagreement_score":0.033087794,"about_ca_system_score_codex":0.0014404462,"about_ca_system_score_gemma":0.0010011275,"threshold_uncertainty_score":0.1106897},"labels":[],"label_agreement":null},{"id":"W2397378149","doi":"","title":"Large sets of t-designs from t-homogeneous groups.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Permutation group; Divisibility rule; Orbit (dynamics); Homogeneous; Set (abstract data type); Permutation (music); Block (permutation group theory); Simple (philosophy); Combinatorics; Group (periodic table); Discrete mathematics; Computer science","score_opus":0.007412164735808028,"score_gpt":0.20132374181516868,"score_spread":0.19391157707936066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397378149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19607945,0.00046803543,0.7740083,0.00020911239,0.00008693556,0.0002795515,0.00046013657,0.00036979708,0.02803876],"genre_scores_gemma":[0.65686506,0.00040951456,0.32441506,0.00024572288,0.00016063527,0.0007649075,0.0011207988,0.00016038303,0.01585807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986815,0.0004157178,0.00014067622,0.00031340038,0.00031255063,0.0001360959],"domain_scores_gemma":[0.9943538,0.0027878333,0.00073121453,0.0014377667,0.00036792646,0.00032143464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014789299,0.00058455433,0.00059041375,0.0012835066,0.0010189844,0.0013869368,0.0006053079,0.0006722778,0.0069309734],"category_scores_gemma":[0.0047016223,0.00061646843,0.0014494538,0.0008645621,0.0018149974,0.0023817602,0.002417174,0.0013490579,0.0011214028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034334598,0.00010392647,0.0012194191,0.00039421086,0.00008750618,0.00037989026,0.00065119955,0.023982652,0.030152492,0.8785036,0.001997248,0.062184528],"study_design_scores_gemma":[0.00013101516,0.00043989232,0.0010471428,0.00010397208,0.00008900551,0.0007537454,0.00024088022,0.056552276,0.03385187,0.8862573,0.020468459,0.00006448826],"about_ca_topic_score_codex":0.00017864873,"about_ca_topic_score_gemma":0.0003035699,"teacher_disagreement_score":0.0069309734,"about_ca_system_score_codex":0.00067594275,"about_ca_system_score_gemma":0.0004576822,"threshold_uncertainty_score":0.023186445},"labels":[],"label_agreement":null},{"id":"W2397378656","doi":"","title":"Cyclic 9-coloring of plane graphs with maximum face degree six.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Combinatorics; Plane (geometry); Face (sociological concept); Geometry; Physics; Sociology","score_opus":0.032932431566620075,"score_gpt":0.23195513514400512,"score_spread":0.19902270357738505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397378656","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7543138,0.0012205289,0.10278695,0.003323679,0.00030185483,0.00013628032,0.0034281034,0.0006279569,0.13386084],"genre_scores_gemma":[0.92685163,0.00064280647,0.05073332,0.00051542744,0.00013414318,0.00009883658,0.0027222603,0.00019777205,0.018103808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995084,0.00012830598,0.000024031931,0.0001048387,0.000077054654,0.00015736697],"domain_scores_gemma":[0.99802774,0.0009958295,0.00030175352,0.00029801225,0.00014973541,0.00022684401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003735397,0.000435723,0.00041448398,0.0007884691,0.0014682771,0.00200635,0.0011402869,0.0009100995,0.010119282],"category_scores_gemma":[0.0019304024,0.00044622517,0.0005331115,0.0012142684,0.0010573963,0.001989044,0.0010993388,0.001178964,0.0011801398],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004934265,0.00017977167,0.004283476,0.00029164882,0.000048164595,0.00041359928,0.00047050012,0.01931582,0.010112003,0.88396865,0.029411241,0.051011596],"study_design_scores_gemma":[0.00009658147,0.00006728021,0.0034617067,0.00007633231,0.00004867647,0.0005930296,0.00061885576,0.044021346,0.00728508,0.91428435,0.029405018,0.000041757386],"about_ca_topic_score_codex":0.0038052534,"about_ca_topic_score_gemma":0.0054498254,"teacher_disagreement_score":0.010119282,"about_ca_system_score_codex":0.0014276733,"about_ca_system_score_gemma":0.0008729854,"threshold_uncertainty_score":0.0338524},"labels":[],"label_agreement":null},{"id":"W2397387574","doi":"","title":"Harmonious Colorings of Digraphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.024477302310895392,"score_gpt":0.24380402907164606,"score_spread":0.21932672676075066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397387574","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1753536,0.00097477785,0.5483639,0.0014835462,0.0005308063,0.00022585446,0.0017196574,0.0015636247,0.2697842],"genre_scores_gemma":[0.81155473,0.00074014405,0.1106949,0.00080450514,0.00020696515,0.00018613749,0.0014306427,0.00049292535,0.073889084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988807,0.0003343851,0.000062634375,0.0003208273,0.00017660225,0.0002248714],"domain_scores_gemma":[0.9973802,0.0009101007,0.00023739302,0.00076046295,0.0003285651,0.00038331214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007390872,0.0004441847,0.0005846926,0.0014784695,0.0023059829,0.0029691644,0.001118249,0.0007716439,0.019663284],"category_scores_gemma":[0.003525232,0.0006459487,0.0008456861,0.0014461522,0.0017020669,0.003901099,0.0025751966,0.0015833472,0.0031775075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000348137,0.000028012893,0.00031519856,0.000049311977,0.000018341472,0.00008865632,0.0002437283,0.0016548522,0.0009165849,0.9788826,0.004159663,0.013608127],"study_design_scores_gemma":[0.000020778443,0.000015932192,0.00025439463,0.000022196236,0.000020829653,0.00015062238,0.00017707297,0.0057640346,0.0009943135,0.9750405,0.017524835,0.000014437156],"about_ca_topic_score_codex":0.0017161302,"about_ca_topic_score_gemma":0.0031757862,"teacher_disagreement_score":0.019663284,"about_ca_system_score_codex":0.0014466454,"about_ca_system_score_gemma":0.0007508794,"threshold_uncertainty_score":0.06578022},"labels":[],"label_agreement":null},{"id":"W2397389769","doi":"","title":"Multidecompositions of complete bipartite graphs into cycles and stars.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Stars; Complete bipartite graph; Combinatorics; Cograph; 1-planar graph; Astrophysics; Graph; Chordal graph; Physics","score_opus":0.007414974807594172,"score_gpt":0.2011813851917039,"score_spread":0.19376641038410972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397389769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20853887,0.0018041724,0.67147934,0.0012923398,0.00033704983,0.00024535117,0.0014910827,0.0006791609,0.11413262],"genre_scores_gemma":[0.70687217,0.0011107827,0.23543164,0.00083067885,0.00035453556,0.00033367748,0.0023917574,0.00044100196,0.052233797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844944,0.00048871414,0.00013940393,0.0004079191,0.00034417716,0.0001703599],"domain_scores_gemma":[0.9951735,0.002162818,0.00073704735,0.00080564007,0.0006906502,0.00043026966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009560571,0.00049424695,0.00066328346,0.0018379041,0.0014635079,0.0027308434,0.0010400668,0.00088247773,0.014207118],"category_scores_gemma":[0.005213093,0.0008717456,0.001018531,0.001960913,0.0013223271,0.0053046164,0.0024515372,0.0020613277,0.0024634863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010263777,0.000064560074,0.0006122568,0.00016160728,0.00003916196,0.00019185503,0.00032072974,0.0039242757,0.0024020907,0.9574123,0.0053578527,0.029410677],"study_design_scores_gemma":[0.000021974487,0.000034666664,0.00037568688,0.00006700367,0.000022966735,0.00045456318,0.00021250757,0.018535169,0.002784841,0.96538234,0.012088713,0.000019548355],"about_ca_topic_score_codex":0.00044366994,"about_ca_topic_score_gemma":0.0009828925,"teacher_disagreement_score":0.014207118,"about_ca_system_score_codex":0.0007181841,"about_ca_system_score_gemma":0.0005636522,"threshold_uncertainty_score":0.04752755},"labels":[],"label_agreement":null},{"id":"W2397391144","doi":"","title":"Extremal Multi-bridge Graphs With Respect To Merrifield-Simmons Index.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Bridge (graph theory); Combinatorics; Discrete mathematics; Computer science; Medicine; Surgery","score_opus":0.05144812537959317,"score_gpt":0.29315717067934705,"score_spread":0.24170904529975387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397391144","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48678997,0.0011140708,0.08055707,0.0035206238,0.0005687775,0.00011775615,0.0010878886,0.00063588563,0.42560804],"genre_scores_gemma":[0.95924354,0.00044744214,0.0126387775,0.0004533308,0.00030252273,0.00008896154,0.00052318675,0.00013182832,0.026170265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994136,0.00012453283,0.000025694368,0.00011503211,0.00019553312,0.00012556126],"domain_scores_gemma":[0.9979473,0.0007051676,0.00034618407,0.0002654875,0.00027992038,0.00045601156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008770788,0.00045877468,0.0007299007,0.0035902334,0.002409102,0.0029904195,0.0012074853,0.0015142981,0.019833233],"category_scores_gemma":[0.0040191896,0.00031739863,0.00040973834,0.0016151875,0.0016845947,0.003774063,0.0022687658,0.0020036623,0.0019308187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007274323,0.000021482727,0.00035481085,0.000029669665,0.000007782206,0.00009655605,0.00011366108,0.00057947607,0.0009061743,0.9865672,0.0036595995,0.007590851],"study_design_scores_gemma":[0.000025678657,0.000023805473,0.0005898456,0.000023075565,0.000011070974,0.00027366832,0.00014198456,0.0046979096,0.0007555537,0.98696566,0.0064783315,0.000013459781],"about_ca_topic_score_codex":0.0004909318,"about_ca_topic_score_gemma":0.0008221031,"teacher_disagreement_score":0.019833233,"about_ca_system_score_codex":0.0010391476,"about_ca_system_score_gemma":0.00041924426,"threshold_uncertainty_score":0.06634879},"labels":[],"label_agreement":null},{"id":"W2397394671","doi":"","title":"Genus polynomials for three types of graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Genus; Combinatorics; Zoology; Biology","score_opus":0.030688739652745198,"score_gpt":0.30602942785072784,"score_spread":0.27534068819798263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397394671","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5211594,0.0020997066,0.08066462,0.005247001,0.0011458367,0.000102752456,0.0010102874,0.00079870905,0.3877718],"genre_scores_gemma":[0.96738654,0.0008518576,0.009143042,0.00028630774,0.00019115747,0.00003850941,0.0003039339,0.00011810939,0.021680463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994031,0.00009393116,0.000019894036,0.000068990536,0.00019641958,0.0002175469],"domain_scores_gemma":[0.9987451,0.00050758116,0.00020451211,0.00016865051,0.00012344173,0.00025064973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051932444,0.0006164238,0.0004223921,0.0033295788,0.0018483204,0.003105874,0.0012375301,0.0014684477,0.010709883],"category_scores_gemma":[0.0032067557,0.00035306814,0.0010068283,0.0015660282,0.0039040556,0.0033238935,0.00229384,0.0023499462,0.0012924463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005661427,0.000012192089,0.00056549715,0.00004307172,0.0000055224828,0.00013929734,0.00032126028,0.0007361741,0.0006603322,0.9882637,0.0023946003,0.0068018455],"study_design_scores_gemma":[0.000018342134,0.000015429901,0.0014587328,0.00004267091,0.000018055407,0.00058548304,0.0003769652,0.004113517,0.00089313864,0.9845636,0.00788355,0.000030653155],"about_ca_topic_score_codex":0.0014707331,"about_ca_topic_score_gemma":0.0021208953,"teacher_disagreement_score":0.010709883,"about_ca_system_score_codex":0.0015402267,"about_ca_system_score_gemma":0.00050180766,"threshold_uncertainty_score":0.035828114},"labels":[],"label_agreement":null},{"id":"W2397397044","doi":"10.5072/zenodo.240189","title":"COMPLEX FACTORIZATIONS OF THE JACOBSTHAL AND JACOBSTHAL LUCAS NUMBERS","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Lucas number; Lucas sequence; Arithmetic; Algebra over a field; Combinatorics; Fibonacci polynomials; Pure mathematics; Fibonacci number; Difference polynomials","score_opus":0.03518040847738857,"score_gpt":0.30702251908223205,"score_spread":0.2718421106048435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397397044","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35078466,0.0028394454,0.18058361,0.0052345563,0.0019843765,0.0001276743,0.0006314161,0.00054371654,0.4572706],"genre_scores_gemma":[0.8395035,0.0014662975,0.042396642,0.000638164,0.001048822,0.00012558346,0.00031171914,0.0003243809,0.114184834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935,0.00012440549,0.000028591903,0.0000991085,0.00027237937,0.00012556861],"domain_scores_gemma":[0.9990988,0.00021813538,0.00016503342,0.000102676524,0.00023158359,0.00018385894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008739367,0.0009498065,0.00069907797,0.0036029252,0.0021262425,0.0038348255,0.00087531755,0.0010889081,0.013709832],"category_scores_gemma":[0.003319265,0.0004824812,0.00066202926,0.0016368242,0.003403562,0.003629716,0.0018213885,0.0025132692,0.002751143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011707271,0.000005306433,0.00005497593,0.000009512264,0.0000013515793,0.000029476545,0.00012572072,0.00019256442,0.0002941262,0.9957734,0.0008691242,0.0026327854],"study_design_scores_gemma":[0.000013330688,0.00001091663,0.00020837932,0.000013434139,0.0000035153366,0.000078089724,0.00010494562,0.0018964272,0.0003151272,0.9891221,0.008217512,0.000016190423],"about_ca_topic_score_codex":0.0018099593,"about_ca_topic_score_gemma":0.001865559,"teacher_disagreement_score":0.013709832,"about_ca_system_score_codex":0.0020606432,"about_ca_system_score_gemma":0.00088611344,"threshold_uncertainty_score":0.045863986},"labels":[],"label_agreement":null},{"id":"W2397477242","doi":"","title":"On Super Vertex-Magic Total Labeling of the Disjoint Union of k Copies of K n .","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; MAGIC (telescope); Disjoint sets; Vertex (graph theory); Disjoint union (topology); Physics; Graph; Astrophysics","score_opus":0.006855100886390618,"score_gpt":0.19932393653946764,"score_spread":0.19246883565307701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397477242","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5047869,0.0015730407,0.31932276,0.0033624193,0.00040692434,0.00013405381,0.0020345035,0.0010282593,0.16735125],"genre_scores_gemma":[0.8491237,0.0008319003,0.116389565,0.0009071106,0.00023507114,0.00015506522,0.0021741989,0.0004625509,0.029720953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989556,0.00034087873,0.00005333364,0.00023779928,0.0002038903,0.00020852408],"domain_scores_gemma":[0.9969451,0.0015973405,0.00030609648,0.0006353975,0.00022606587,0.00028998684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010753609,0.00054567546,0.00069062214,0.0013087515,0.0021635878,0.0023878147,0.0014497987,0.0011829591,0.0097466335],"category_scores_gemma":[0.003969784,0.0006137108,0.0008081275,0.0018735727,0.0021298788,0.0053491388,0.0027767797,0.00177294,0.0011798544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017599582,0.000038667014,0.00067454454,0.00014268693,0.000017617089,0.00007572793,0.00032057657,0.006696118,0.0018053348,0.963148,0.008216541,0.018688085],"study_design_scores_gemma":[0.000027144968,0.000021641465,0.0004461801,0.000031167514,0.000020312755,0.00010488363,0.00018666635,0.022746328,0.0011643324,0.96957964,0.0056568584,0.000014956846],"about_ca_topic_score_codex":0.0026712676,"about_ca_topic_score_gemma":0.0047890744,"teacher_disagreement_score":0.0097466335,"about_ca_system_score_codex":0.0017530825,"about_ca_system_score_gemma":0.00087273173,"threshold_uncertainty_score":0.032605767},"labels":[],"label_agreement":null},{"id":"W2397482252","doi":"","title":"Finding Hamiltonian Cycles in Four Subfamilies of Quasi-Claw-Free Graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Claw; Mathematics; Combinatorics; Hamiltonian (control theory); Biology; Mathematical optimization; Ecology","score_opus":0.022172388187462966,"score_gpt":0.284372922292056,"score_spread":0.26220053410459304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397482252","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94796383,0.0005434441,0.032156345,0.00066568033,0.000032100328,0.00018754865,0.0009513045,0.0003814094,0.017118389],"genre_scores_gemma":[0.9471002,0.00025908937,0.04061402,0.00024206367,0.000018362927,0.000091600195,0.0028085422,0.00011247799,0.008753648],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977285,0.000034085562,0.000012338476,0.00006584302,0.00003847632,0.000076342105],"domain_scores_gemma":[0.9988273,0.0006038572,0.00011710728,0.00018074593,0.00011989732,0.00015106454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023358152,0.00031175627,0.00043959563,0.0010666252,0.0014880147,0.00086111407,0.0010467127,0.0009870764,0.010325877],"category_scores_gemma":[0.0019347003,0.00034479355,0.00047306382,0.000988521,0.0005754623,0.0014777544,0.0009048907,0.00069837377,0.0007954945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016272448,0.0012947973,0.05159495,0.0021382682,0.00029845754,0.002858979,0.004595685,0.04399642,0.113287844,0.24415347,0.035648838,0.498505],"study_design_scores_gemma":[0.0003189708,0.0006720111,0.033099867,0.0004192896,0.0004319825,0.0033625963,0.0069119446,0.251192,0.03994977,0.6262045,0.037299424,0.0001376853],"about_ca_topic_score_codex":0.0024698772,"about_ca_topic_score_gemma":0.007012523,"teacher_disagreement_score":0.010325877,"about_ca_system_score_codex":0.00055148086,"about_ca_system_score_gemma":0.00056574435,"threshold_uncertainty_score":0.034543514},"labels":[],"label_agreement":null},{"id":"W2397530947","doi":"","title":"A Relationship Between Balanced Modular Tableaux and k-Ribbon Shapes.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Ribbon; Modular design; Mathematics; Combinatorics; Pure mathematics; Arithmetic; Geometry; Computer science; Programming language","score_opus":0.018803994930197788,"score_gpt":0.23826742004078735,"score_spread":0.21946342511058956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397530947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15677609,0.0016635116,0.7036099,0.0016300494,0.00053497317,0.00011745122,0.00095963344,0.0016998039,0.13300861],"genre_scores_gemma":[0.7712122,0.0011027141,0.18822594,0.0009556929,0.00034267217,0.00019799103,0.0009649216,0.0006314968,0.03636646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928916,0.00014432806,0.000058066245,0.00015773885,0.00026491086,0.000085768],"domain_scores_gemma":[0.9964592,0.00191515,0.00039293777,0.0007530327,0.00030558396,0.00017403248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053237926,0.00037235484,0.0005206041,0.0012102374,0.0010096851,0.0028581207,0.0010568233,0.0010011537,0.014480084],"category_scores_gemma":[0.007869856,0.0004239795,0.00041133625,0.0022311192,0.0019019672,0.003985481,0.0021407125,0.0016984799,0.0030635027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008164345,0.000022423277,0.0003205242,0.00004140102,0.00000571603,0.00015479322,0.000114182985,0.003411948,0.0017542061,0.95146704,0.0036214176,0.039004624],"study_design_scores_gemma":[0.00001499034,0.000029995452,0.00019180974,0.000031063282,0.0000075119106,0.00037516726,0.00006107516,0.017010495,0.002259693,0.9686328,0.011364417,0.000020969735],"about_ca_topic_score_codex":0.0005029893,"about_ca_topic_score_gemma":0.0008496435,"teacher_disagreement_score":0.014480084,"about_ca_system_score_codex":0.00081594585,"about_ca_system_score_gemma":0.00048017892,"threshold_uncertainty_score":0.048440695},"labels":[],"label_agreement":null},{"id":"W2397532180","doi":"","title":"On E 4 -Cordial Graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.020595489135659874,"score_gpt":0.23669442436000132,"score_spread":0.21609893522434145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397532180","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3583101,0.00271576,0.22239943,0.00811335,0.0007656198,0.0002372569,0.0042088055,0.001490558,0.40175915],"genre_scores_gemma":[0.7804872,0.0019714185,0.106987774,0.002235795,0.0004111268,0.00022436165,0.0035988565,0.0004342646,0.103649266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911565,0.00024372192,0.0000504972,0.00021419139,0.00015075105,0.00022515243],"domain_scores_gemma":[0.99737144,0.0012647002,0.0003733323,0.00042457035,0.00020619374,0.00035983024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006648641,0.0008010578,0.0006235389,0.0016168131,0.0019579448,0.0027778826,0.001454925,0.00135157,0.023311362],"category_scores_gemma":[0.003537851,0.00037376996,0.0006408594,0.0021797286,0.0019344895,0.00565931,0.0028222546,0.0024843602,0.0033305509],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010908342,0.00006306651,0.0006326943,0.00015770437,0.000014140892,0.00010232117,0.00024154059,0.0030386664,0.0014859238,0.95052034,0.013491359,0.030143075],"study_design_scores_gemma":[0.000025793008,0.000015104633,0.00047554073,0.00005275591,0.000010733427,0.00014996689,0.00020668448,0.008643424,0.0011666702,0.96899545,0.020244455,0.000013419715],"about_ca_topic_score_codex":0.002222493,"about_ca_topic_score_gemma":0.0039787916,"teacher_disagreement_score":0.023311362,"about_ca_system_score_codex":0.0019171668,"about_ca_system_score_gemma":0.00060345774,"threshold_uncertainty_score":0.077984214},"labels":[],"label_agreement":null},{"id":"W2397538458","doi":"","title":"On E k -cordial labeling.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.01360159055842084,"score_gpt":0.23451773613202306,"score_spread":0.22091614557360223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397538458","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11034712,0.0044957283,0.39755264,0.013876584,0.0013000771,0.00022332263,0.003685483,0.002328545,0.46619052],"genre_scores_gemma":[0.6369606,0.0037404431,0.20401263,0.00524713,0.0010066705,0.00038998752,0.0044491678,0.0008857256,0.14330763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987293,0.0003697452,0.000076431774,0.0003174027,0.00023529043,0.00027190533],"domain_scores_gemma":[0.9964504,0.0017079671,0.00029632982,0.0009050621,0.0002874747,0.00035275114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011797177,0.0008718229,0.0008567913,0.0016018548,0.0022681518,0.0033140131,0.001685538,0.0017593723,0.027679043],"category_scores_gemma":[0.005823666,0.00044980185,0.00075997645,0.0030749387,0.0027569316,0.009437587,0.004238628,0.0038433068,0.0051254183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000775168,0.000054622276,0.0003313421,0.0001313289,0.000010566344,0.000055613193,0.00020369717,0.0017632069,0.0005440408,0.94108766,0.018371943,0.037368447],"study_design_scores_gemma":[0.000015378348,0.000009756175,0.00020824501,0.000032325723,0.000007518267,0.000093238334,0.00010981572,0.0047794874,0.00037982783,0.9765985,0.017756766,0.000009143376],"about_ca_topic_score_codex":0.0022785866,"about_ca_topic_score_gemma":0.0040960526,"teacher_disagreement_score":0.027679043,"about_ca_system_score_codex":0.0026439554,"about_ca_system_score_gemma":0.0010080683,"threshold_uncertainty_score":0.09259564},"labels":[],"label_agreement":null},{"id":"W2397545861","doi":"","title":"On Potentially K 6 -3K 2 -graphic sequences.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.009171763233905216,"score_gpt":0.2351543934691195,"score_spread":0.22598263023521428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397545861","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44971088,0.002006216,0.23694623,0.0018448404,0.00080879265,0.00021812238,0.0023446542,0.0018997543,0.30422053],"genre_scores_gemma":[0.80952734,0.0010409256,0.0687876,0.0005197773,0.00023169036,0.0001709657,0.002192309,0.0005525702,0.116976835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990957,0.00017045993,0.000070435664,0.00014598618,0.00026240374,0.00025509147],"domain_scores_gemma":[0.9989624,0.00040309888,0.000145885,0.00017011387,0.00017678252,0.00014174223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036563547,0.0010114773,0.000582885,0.002084968,0.0014370852,0.0028643992,0.00077962835,0.001118486,0.034509446],"category_scores_gemma":[0.0023587046,0.00046278047,0.00062317087,0.001908939,0.0013245082,0.002822457,0.0025616419,0.0012802448,0.010593119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009442569,0.00013648774,0.0015052411,0.0005506865,0.000053152613,0.0021074647,0.0009825393,0.012713961,0.02258927,0.82672065,0.018138329,0.11355801],"study_design_scores_gemma":[0.000089720685,0.00014331038,0.0018553948,0.00020712998,0.000036208698,0.0019015103,0.00051595987,0.02851156,0.013631803,0.87924284,0.07376177,0.00010278898],"about_ca_topic_score_codex":0.0010735057,"about_ca_topic_score_gemma":0.0027992532,"teacher_disagreement_score":0.034509446,"about_ca_system_score_codex":0.0009623491,"about_ca_system_score_gemma":0.0005475946,"threshold_uncertainty_score":0.115445614},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Type (biology); Composition (language); Pure mathematics; Linguistics; Geology","score_opus":0.018932016159648814,"score_gpt":0.2739481385122142,"score_spread":0.25501612235256543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397563057","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14305116,0.0030689498,0.6199329,0.0021008698,0.0013926576,0.00009175933,0.0004035967,0.00060344674,0.2293548],"genre_scores_gemma":[0.74369824,0.0028850266,0.13493896,0.00097584625,0.0010140443,0.0001731077,0.0004241406,0.0004572563,0.11543344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993611,0.000188061,0.00004151044,0.000093132294,0.00023589439,0.00008033598],"domain_scores_gemma":[0.99909294,0.00022490909,0.00011994739,0.0001394669,0.00025362053,0.00016921168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010453077,0.0005884029,0.00039986914,0.0018416712,0.0011449138,0.0023235218,0.0006687846,0.00067550415,0.008799881],"category_scores_gemma":[0.0028224892,0.00032421044,0.0006179708,0.0013933125,0.0019007906,0.0067427983,0.0027125864,0.0018796113,0.0014249289],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007843986,0.00000644205,0.000050424456,0.000016187529,0.000003811147,0.000027850245,0.000069771144,0.00012911751,0.0005386262,0.9938921,0.00078300294,0.004474871],"study_design_scores_gemma":[0.000004986829,0.000009474355,0.000107992346,0.000010513291,0.00000622981,0.00012531143,0.00007831498,0.0021795724,0.0006150359,0.98940533,0.0074504456,0.0000068525037],"about_ca_topic_score_codex":0.00041402693,"about_ca_topic_score_gemma":0.0005688497,"teacher_disagreement_score":0.008799881,"about_ca_system_score_codex":0.00073792913,"about_ca_system_score_gemma":0.00044469922,"threshold_uncertainty_score":0.029438555},"labels":[],"label_agreement":null},{"id":"W2397586764","doi":"","title":"On the product C mxh {C n , C n } and other related topics.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Product (mathematics); Combinatorics; Geometry","score_opus":0.023334229882687765,"score_gpt":0.28214016351461885,"score_spread":0.2588059336319311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397586764","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12320883,0.022245709,0.11689505,0.017114539,0.0028510166,0.00005794162,0.0007076231,0.00026722346,0.71665204],"genre_scores_gemma":[0.8127323,0.009563415,0.041320357,0.003917621,0.0034465382,0.00012149662,0.0006260349,0.00027629663,0.12799609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992392,0.00030436742,0.000030098601,0.00014295743,0.00015650305,0.00012686106],"domain_scores_gemma":[0.9989015,0.0004866824,0.00018672133,0.0001450377,0.00013695615,0.00014309965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010300026,0.00072487857,0.00063236046,0.0024433427,0.0024916288,0.002561318,0.0009502812,0.001502254,0.016055115],"category_scores_gemma":[0.0021635734,0.00029215947,0.000746024,0.002376357,0.003779853,0.008316919,0.0024221682,0.0028226464,0.0019511535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006332614,0.000005134218,0.000055492303,0.000026737074,0.0000032703963,0.000036297835,0.00006143639,0.00009356743,0.00008957973,0.9960251,0.0017969497,0.0018001262],"study_design_scores_gemma":[0.000003762158,0.00000840678,0.00025178547,0.000022122842,0.000004864738,0.00011804618,0.000077004,0.00078497763,0.00010369663,0.9878803,0.010737612,0.0000075732373],"about_ca_topic_score_codex":0.0015070969,"about_ca_topic_score_gemma":0.0016885132,"teacher_disagreement_score":0.016055115,"about_ca_system_score_codex":0.0016142726,"about_ca_system_score_gemma":0.0005552152,"threshold_uncertainty_score":0.053709686},"labels":[],"label_agreement":null},{"id":"W2397594383","doi":"","title":"On the super edge-magic deficiency of a star forest.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Star (game theory); Mathematics; MAGIC (telescope); Enhanced Data Rates for GSM Evolution; Astrophysics; Computer science; Physics; Artificial intelligence; Mathematical analysis","score_opus":0.010804418947892894,"score_gpt":0.20937661467207125,"score_spread":0.19857219572417836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397594383","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6430112,0.0032935794,0.1807159,0.008279726,0.00049850036,0.00008858831,0.0016682956,0.00045910125,0.16198517],"genre_scores_gemma":[0.9359761,0.0011299568,0.048340842,0.0008629232,0.00022969965,0.00005715283,0.0007896924,0.00012297306,0.012490688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939513,0.00021405298,0.000029770692,0.000108877764,0.00013250201,0.00011965994],"domain_scores_gemma":[0.99631727,0.0024229654,0.00023941694,0.00038693167,0.00028163005,0.00035174112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010707496,0.00031931288,0.00072838424,0.0012956928,0.0014436336,0.001980828,0.0009614327,0.001293453,0.008068812],"category_scores_gemma":[0.006150243,0.0004123594,0.0004070466,0.0011972494,0.0021461598,0.0052889246,0.0018351524,0.0019325276,0.0009683476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016607171,0.000041062376,0.0013472916,0.00011926147,0.000012515639,0.00010263397,0.00020321178,0.00431704,0.0014518155,0.9654029,0.009507402,0.017328735],"study_design_scores_gemma":[0.00002853875,0.000020759573,0.00049382995,0.000032058473,0.000012449217,0.00026007378,0.00016503618,0.013900232,0.00063566375,0.9787066,0.0057332413,0.000011565411],"about_ca_topic_score_codex":0.0016986949,"about_ca_topic_score_gemma":0.0020638688,"teacher_disagreement_score":0.008068812,"about_ca_system_score_codex":0.00096716103,"about_ca_system_score_gemma":0.0006441729,"threshold_uncertainty_score":0.026992798},"labels":[],"label_agreement":null},{"id":"W2397618262","doi":"","title":"Graph Eigenvalues Under a Graph Transformation.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Eigenvalues and eigenvectors; Combinatorics; Transformation (genetics); Voltage graph; Line graph; Discrete mathematics; Chemistry; Physics","score_opus":0.014570428681345298,"score_gpt":0.23588335988175202,"score_spread":0.2213129312004067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397618262","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5368143,0.00048088495,0.16923869,0.0037263585,0.0011903174,0.00019760808,0.0007152588,0.0019038478,0.28573266],"genre_scores_gemma":[0.94867647,0.00026061828,0.01015709,0.0004353417,0.00031122335,0.00010061001,0.0002633378,0.00033434798,0.03946095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939406,0.00012578748,0.000015089295,0.00011615482,0.00021691617,0.00013187835],"domain_scores_gemma":[0.9991455,0.00017844234,0.00016434613,0.00021826502,0.00013560297,0.00015788608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035184607,0.00038383936,0.00034177775,0.0015722257,0.0010834953,0.0016638832,0.0005409084,0.0011584647,0.016999017],"category_scores_gemma":[0.0024043748,0.00022705593,0.00051114365,0.0006492173,0.0016237948,0.0019421608,0.0012121241,0.0011444057,0.003022623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010522964,0.00007545568,0.00042171575,0.000036811598,0.000014468849,0.00028501017,0.00027383558,0.0024969287,0.007987834,0.96562976,0.00782424,0.014848734],"study_design_scores_gemma":[0.00003986137,0.000036289348,0.0008764929,0.000012394431,0.0000088383995,0.00044421334,0.00022427936,0.014963977,0.003000477,0.975827,0.0045471895,0.00001899828],"about_ca_topic_score_codex":0.0006313346,"about_ca_topic_score_gemma":0.0006059567,"teacher_disagreement_score":0.016999017,"about_ca_system_score_codex":0.00061463244,"about_ca_system_score_gemma":0.00044943494,"threshold_uncertainty_score":0.05686736},"labels":[],"label_agreement":null},{"id":"W2397618970","doi":"","title":"On a Conjecture Concerning the Friendly Index Sets of Trees.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Conjecture; Mathematics; Combinatorics; Vertex (graph theory); Graph; Index (typography); Discrete mathematics; Computer science","score_opus":0.011230473208990541,"score_gpt":0.23369184242194688,"score_spread":0.22246136921295634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397618970","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7517521,0.002486415,0.14778286,0.0075903153,0.00063866866,0.0001453301,0.0020371361,0.0007380795,0.08682916],"genre_scores_gemma":[0.95655525,0.0009266764,0.032724526,0.001316367,0.0006178461,0.00015378291,0.0015854426,0.00007430897,0.0060458127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99708706,0.00048777278,0.00021162107,0.0007807327,0.0007651747,0.00066760473],"domain_scores_gemma":[0.97779787,0.015722713,0.0019277,0.002690996,0.00091892,0.0009418229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030717885,0.00070390204,0.0011523997,0.0024548129,0.0032970856,0.0035270012,0.001831382,0.0022643458,0.004663925],"category_scores_gemma":[0.018671652,0.00076747086,0.0011064396,0.0023880396,0.0057126745,0.0083414605,0.0031276096,0.003102502,0.0008407523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00088683935,0.0001841104,0.010837516,0.0002810335,0.000039868533,0.00048088704,0.0021484622,0.011517792,0.0062782275,0.91246337,0.01497197,0.039909914],"study_design_scores_gemma":[0.000113777016,0.00022728802,0.005685947,0.00010031809,0.00004975359,0.0011401707,0.00063958514,0.01885742,0.0050934046,0.94798654,0.020018842,0.00008699394],"about_ca_topic_score_codex":0.0012300835,"about_ca_topic_score_gemma":0.0008534514,"teacher_disagreement_score":0.004663925,"about_ca_system_score_codex":0.0019078801,"about_ca_system_score_gemma":0.0006171039,"threshold_uncertainty_score":0.016245365},"labels":[],"label_agreement":null},{"id":"W2397621990","doi":"","title":"Large sets of λ-fold P 3 -factors in K v, v .","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fold (higher-order function); Mathematics; Combinatorics; Computer science; Programming language","score_opus":0.038802356782931924,"score_gpt":0.33119174013397856,"score_spread":0.29238938335104664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397621990","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7000721,0.0014828956,0.09981396,0.0017392002,0.00034722424,0.000080628604,0.0008663308,0.0007583282,0.19483918],"genre_scores_gemma":[0.9635753,0.0003049535,0.009674737,0.00021401836,0.00013055174,0.000079715304,0.0005635585,0.00012031981,0.025336782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991767,0.0001593678,0.000044431097,0.00017225475,0.0002608471,0.00018644087],"domain_scores_gemma":[0.99806565,0.00088580983,0.00023285746,0.00022136758,0.000252884,0.00034155246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006827273,0.0006801731,0.0007395793,0.0021363432,0.0027904464,0.0044347397,0.0009937652,0.0008348433,0.010134391],"category_scores_gemma":[0.003272645,0.00060323346,0.0009099689,0.001088387,0.0031677086,0.0036837973,0.0034999894,0.0019331292,0.0014822128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019792457,0.00003864695,0.0013848331,0.00007274451,0.000031115716,0.00039615677,0.00061000336,0.0010862114,0.0024623964,0.9841929,0.0023203383,0.007206694],"study_design_scores_gemma":[0.000035446505,0.00003426588,0.0013193074,0.000053084288,0.000025181811,0.00039890973,0.0005369838,0.003597188,0.0023169597,0.9849043,0.0067535294,0.000024821495],"about_ca_topic_score_codex":0.0013421087,"about_ca_topic_score_gemma":0.0014797576,"teacher_disagreement_score":0.010134391,"about_ca_system_score_codex":0.0015581464,"about_ca_system_score_gemma":0.00060448755,"threshold_uncertainty_score":0.033902943},"labels":[],"label_agreement":null},{"id":"W2397631537","doi":"","title":"Color degree and heterochromatic paths in edge-colored graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Colored; Mathematics; Degree (music); Enhanced Data Rates for GSM Evolution; Edge coloring; Combinatorics; Graph; Computer science; Artificial intelligence; Sociology; Line graph; Physics","score_opus":0.01347766623012939,"score_gpt":0.21611053707672057,"score_spread":0.20263287084659118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397631537","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70126027,0.0020584967,0.20902899,0.0060557653,0.00035248193,0.00009670368,0.0017613495,0.00046785775,0.07891808],"genre_scores_gemma":[0.9503897,0.0008443903,0.03385288,0.0004928196,0.00019313519,0.000086233995,0.0006405706,0.00012238018,0.013377925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989479,0.00034600846,0.000044893783,0.00028375123,0.00015312122,0.00022432554],"domain_scores_gemma":[0.99278146,0.004604822,0.00084964186,0.00078090525,0.0003758771,0.0006073206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010475273,0.00044790294,0.0006409895,0.0013378361,0.0019833029,0.002937367,0.0015016526,0.0013368216,0.008082074],"category_scores_gemma":[0.0058110883,0.00057200005,0.00060016563,0.0019434246,0.002709379,0.005009878,0.001802854,0.0019558857,0.0007125299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015786634,0.000069023285,0.0023216137,0.000112811336,0.000026871581,0.00011921139,0.0002910085,0.007309345,0.0022345518,0.9658197,0.0060973777,0.015440628],"study_design_scores_gemma":[0.000033394732,0.000017668364,0.0010704277,0.000025960984,0.000024869314,0.00026752744,0.0002671162,0.016353406,0.0013341026,0.97587454,0.004711295,0.000019569019],"about_ca_topic_score_codex":0.0019975414,"about_ca_topic_score_gemma":0.00267211,"teacher_disagreement_score":0.008082074,"about_ca_system_score_codex":0.0016655133,"about_ca_system_score_gemma":0.00079126726,"threshold_uncertainty_score":0.027037203},"labels":[],"label_agreement":null},{"id":"W2397650992","doi":"","title":"A note on the independence number of strong products of odd cycles.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Independence (probability theory); Independence number; Combinatorics; Statistics","score_opus":0.028981487079609805,"score_gpt":0.30218417687945553,"score_spread":0.27320268979984574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397650992","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2693861,0.010671982,0.13228346,0.006294376,0.002346158,0.00006184339,0.0009849122,0.00040905332,0.5775621],"genre_scores_gemma":[0.9566991,0.0031185015,0.020367742,0.0007287005,0.001367402,0.00008366796,0.00030169124,0.00016025237,0.017173087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988971,0.000267794,0.00006128583,0.0002809384,0.00035916947,0.0001337438],"domain_scores_gemma":[0.9911527,0.006169111,0.0005527967,0.0009136216,0.0004954973,0.00071615237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014988177,0.00054326066,0.00072181865,0.00255005,0.0016186723,0.0023018967,0.0013894446,0.0009328098,0.0075609935],"category_scores_gemma":[0.009745561,0.0005878735,0.0005954456,0.0020968725,0.0037309546,0.007145576,0.0028071976,0.003348555,0.0009860124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006472958,0.000023263903,0.0008458387,0.00009668338,0.000013630635,0.00012214093,0.00016161475,0.0009730086,0.0012900151,0.9792155,0.005432998,0.011760668],"study_design_scores_gemma":[0.0000062517884,0.000012729442,0.0006627563,0.00002344328,0.000013239202,0.00020763188,0.00003739158,0.0028543968,0.0008019425,0.9876507,0.0077152736,0.000014208224],"about_ca_topic_score_codex":0.00063184265,"about_ca_topic_score_gemma":0.0009241632,"teacher_disagreement_score":0.0075609935,"about_ca_system_score_codex":0.0008114367,"about_ca_system_score_gemma":0.00048605338,"threshold_uncertainty_score":0.025294065},"labels":[],"label_agreement":null},{"id":"W2397655904","doi":"","title":"Tree with minimal Laplacian spectral radius and diameter n-4.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Tree (set theory); Spectral radius; RADIUS; Laplace operator; Combinatorics; Mathematical analysis; Physics; Computer science; Eigenvalues and eigenvectors","score_opus":0.014148617903686848,"score_gpt":0.2384438058623373,"score_spread":0.22429518795865044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397655904","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72803116,0.0021217484,0.103237756,0.00557338,0.00037584093,0.000116061754,0.0046175118,0.0011563001,0.15477023],"genre_scores_gemma":[0.9294391,0.0008960172,0.039532322,0.0005000774,0.00015902305,0.00008426398,0.0023251467,0.00020425936,0.026859868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973625,0.00006082459,0.000012454493,0.000071096365,0.000063389605,0.000055945493],"domain_scores_gemma":[0.9982191,0.00081804657,0.00023998263,0.0001726693,0.00021471138,0.00033554368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024953665,0.000322901,0.0006899294,0.0009829435,0.0012757939,0.0017383115,0.0010388908,0.0011518202,0.009347824],"category_scores_gemma":[0.002820371,0.00032804778,0.00034668745,0.0009990899,0.0008356328,0.001492877,0.001218816,0.00085311924,0.002398486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010140454,0.00021345721,0.004949888,0.0007611578,0.00013885502,0.0019327824,0.0010832614,0.011247708,0.049793232,0.8167493,0.06183453,0.050281834],"study_design_scores_gemma":[0.00017896731,0.00017737994,0.007136396,0.00014409065,0.00016369566,0.004346211,0.0013462058,0.058276653,0.014851613,0.8574452,0.05586306,0.000070644055],"about_ca_topic_score_codex":0.0009897627,"about_ca_topic_score_gemma":0.0017053863,"teacher_disagreement_score":0.009347824,"about_ca_system_score_codex":0.00076841447,"about_ca_system_score_gemma":0.00041418854,"threshold_uncertainty_score":0.031271577},"labels":[],"label_agreement":null},{"id":"W2397663275","doi":"","title":"Signed edge majority total domination numbers in graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Domination analysis; Graph; Artificial intelligence; Computer science; Vertex (graph theory)","score_opus":0.01369794393443952,"score_gpt":0.27787346148019226,"score_spread":0.26417551754575275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397663275","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5040797,0.002000907,0.2915207,0.0033289474,0.00087135733,0.00013252882,0.001419918,0.0009163069,0.1957295],"genre_scores_gemma":[0.95240974,0.000595739,0.023946868,0.00033820476,0.00028694829,0.00010995735,0.00034146657,0.00009669107,0.021874404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910456,0.00025579,0.0000682006,0.00014744487,0.00028612197,0.00013781224],"domain_scores_gemma":[0.9957568,0.002249806,0.0004913953,0.00044458456,0.0006598874,0.0003974686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011389648,0.00037999553,0.0004098801,0.0016313826,0.0010497055,0.0027626085,0.00071895483,0.00064316066,0.007225659],"category_scores_gemma":[0.006909696,0.00021825248,0.0002939807,0.0013681308,0.0015923104,0.0042909007,0.0013391766,0.0010781618,0.000980643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014016732,0.000028156232,0.0009999454,0.00010914462,0.000018468354,0.000094183255,0.00020456969,0.0029813892,0.0031512743,0.9450448,0.0054647354,0.04176312],"study_design_scores_gemma":[0.000027745546,0.000038268336,0.0007451123,0.00003610755,0.000020836376,0.0002360347,0.0001340442,0.010532744,0.0025484662,0.9758874,0.009770676,0.000022478287],"about_ca_topic_score_codex":0.00030569787,"about_ca_topic_score_gemma":0.0006785389,"teacher_disagreement_score":0.007225659,"about_ca_system_score_codex":0.0007763995,"about_ca_system_score_gemma":0.00054123235,"threshold_uncertainty_score":0.024172246},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Graph","score_opus":0.007121993914556585,"score_gpt":0.2018209375120461,"score_spread":0.19469894359748952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397663352","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26221788,0.0039430647,0.41491768,0.0073123663,0.00075720093,0.00017415138,0.0040641148,0.0014741747,0.30513945],"genre_scores_gemma":[0.7925254,0.0034398045,0.124119185,0.001735576,0.0008412723,0.0003185109,0.005251287,0.00088814803,0.07088072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987429,0.00037948744,0.000071526425,0.00027736396,0.00028983815,0.00023897093],"domain_scores_gemma":[0.99433845,0.0032333678,0.00047694563,0.0010866217,0.00043319224,0.00043139968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001305294,0.0007264657,0.0009066439,0.0023029395,0.0022666298,0.004053212,0.0015612965,0.0013574802,0.013989399],"category_scores_gemma":[0.007391845,0.0005860486,0.00089187303,0.0036569976,0.0027517749,0.008103655,0.0031668262,0.0028334025,0.0022600547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049865725,0.00002856113,0.000498839,0.00009604577,0.000012269413,0.000040004626,0.00016110983,0.0035554804,0.00034940825,0.9649437,0.010740856,0.01952381],"study_design_scores_gemma":[0.000011173951,0.000008134162,0.0002224172,0.00002763597,0.000008771882,0.000089406996,0.00011841928,0.0083547365,0.00024748605,0.981709,0.009195094,0.0000076081587],"about_ca_topic_score_codex":0.0018924004,"about_ca_topic_score_gemma":0.0029764262,"teacher_disagreement_score":0.013989399,"about_ca_system_score_codex":0.002388568,"about_ca_system_score_gemma":0.0008221411,"threshold_uncertainty_score":0.046799183},"labels":[],"label_agreement":null},{"id":"W2397664079","doi":"","title":"Bijections between bicoloured ordered trees and non-crossing partitions.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bijection, injection and surjection; Mathematics; Combinatorics; Bijection","score_opus":0.01333053937269513,"score_gpt":0.24812950793528507,"score_spread":0.23479896856258994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397664079","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34823316,0.0025353883,0.3098978,0.0011643943,0.0010873353,0.00022839424,0.001401054,0.0014105735,0.3340419],"genre_scores_gemma":[0.84903055,0.0010591894,0.07790232,0.0006646861,0.00036253736,0.0001797915,0.0013686657,0.0005496546,0.068882585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990553,0.00019700639,0.00007526807,0.0002142332,0.00027967934,0.00017849533],"domain_scores_gemma":[0.99823344,0.00065814663,0.00024960985,0.00027705755,0.0002966181,0.00028498837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006606007,0.00039907364,0.00047792785,0.0024780333,0.0026638666,0.0040222127,0.0009357977,0.0009276629,0.013981134],"category_scores_gemma":[0.0030192537,0.00059242814,0.00064182887,0.0022950352,0.0019498959,0.00516188,0.0020860974,0.0020885346,0.0028340884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003641316,0.000028076014,0.00019967202,0.000040668365,0.0000054752754,0.00014901841,0.00041079943,0.00028366808,0.00095330545,0.98778695,0.0017109568,0.008394983],"study_design_scores_gemma":[0.000016442875,0.000018183273,0.0004349833,0.00004546015,0.000013863426,0.00054665323,0.0004319678,0.0020169984,0.0012194075,0.9729767,0.022257008,0.000022309821],"about_ca_topic_score_codex":0.0010659401,"about_ca_topic_score_gemma":0.0018648532,"teacher_disagreement_score":0.013981134,"about_ca_system_score_codex":0.0010262438,"about_ca_system_score_gemma":0.00044339508,"threshold_uncertainty_score":0.046771526},"labels":[],"label_agreement":null},{"id":"W2397667744","doi":"","title":"On cyclic edge connectivity of regular graphs with two orbits.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Computer science; Telecommunications","score_opus":0.017754493069397324,"score_gpt":0.24000767743303986,"score_spread":0.22225318436364253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397667744","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7628231,0.002619305,0.11039945,0.002291251,0.0002901213,0.00010972474,0.0012627367,0.00033424335,0.11986999],"genre_scores_gemma":[0.9765896,0.0016077141,0.011356285,0.000251495,0.00028772352,0.00010461649,0.0008366682,0.00008453337,0.008881308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965346,0.0001085927,0.000018135655,0.00006702962,0.00007211048,0.00008071602],"domain_scores_gemma":[0.9963491,0.002349375,0.0005218011,0.00024044972,0.00024798873,0.00029130094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032714236,0.00038191522,0.0004139052,0.0017510569,0.0009838509,0.0011951597,0.0008351229,0.0009951992,0.009211881],"category_scores_gemma":[0.004327866,0.00031414969,0.00032278406,0.001634847,0.0015652224,0.0028108268,0.00124115,0.0009160915,0.0006137339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002118137,0.00006121389,0.0026624775,0.00025300376,0.000035026656,0.0005905131,0.0005967624,0.019828346,0.003215441,0.9293183,0.010660291,0.032566797],"study_design_scores_gemma":[0.00003681951,0.00006924693,0.0019844065,0.00008781995,0.000030772684,0.00049381604,0.0003844635,0.056015395,0.0010893313,0.93202573,0.0077564316,0.000025675694],"about_ca_topic_score_codex":0.001715712,"about_ca_topic_score_gemma":0.002039733,"teacher_disagreement_score":0.009211881,"about_ca_system_score_codex":0.00070893497,"about_ca_system_score_gemma":0.00035213333,"threshold_uncertainty_score":0.030816793},"labels":[],"label_agreement":null},{"id":"W2397686790","doi":"","title":"A Note On Global Domination In Graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.011847620038992803,"score_gpt":0.30042552309750364,"score_spread":0.28857790305851083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397686790","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033053722,0.05555487,0.24964759,0.054337196,0.015757695,0.00008326628,0.0007994219,0.0006765729,0.5900896],"genre_scores_gemma":[0.6497006,0.06047486,0.10058049,0.024586087,0.02470061,0.00024247683,0.000877245,0.0010597784,0.1377779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914813,0.00023104549,0.000035915957,0.00019772002,0.00025192538,0.00013525743],"domain_scores_gemma":[0.994689,0.0039837235,0.00013776461,0.0005681585,0.0003512949,0.0002700582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013783606,0.00068696967,0.0009784983,0.0015807503,0.0020305212,0.0022773934,0.0015560455,0.0011614182,0.010245861],"category_scores_gemma":[0.005008036,0.00033374617,0.0010945658,0.0021177349,0.0044707693,0.0074508507,0.0034748325,0.005342004,0.001727731],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003971122,0.000016374333,0.00055191934,0.0002396042,0.000036770823,0.0003503141,0.0003945733,0.0014095341,0.0009633872,0.9200439,0.04866846,0.027285492],"study_design_scores_gemma":[0.0000066206494,0.000013323475,0.0005012363,0.00005655766,0.000026352194,0.00026470944,0.00010705678,0.0011824497,0.00032188173,0.9300405,0.06746589,0.000013325191],"about_ca_topic_score_codex":0.0020018332,"about_ca_topic_score_gemma":0.0037251208,"teacher_disagreement_score":0.010245861,"about_ca_system_score_codex":0.0013378061,"about_ca_system_score_gemma":0.0006491981,"threshold_uncertainty_score":0.03427583},"labels":[],"label_agreement":null},{"id":"W2397693298","doi":"","title":"G-designs without blocking sets, Note.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Partition (number theory); Blocking (statistics); Discrete mathematics; Graph; Undirected graph","score_opus":0.010217725601475497,"score_gpt":0.21598961882524287,"score_spread":0.20577189322376738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397693298","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111709386,0.0048466404,0.7068081,0.0028936001,0.0012771735,0.00037181194,0.0010726578,0.0008715258,0.17014912],"genre_scores_gemma":[0.64326465,0.0022974506,0.30462244,0.002206596,0.0003038816,0.0007244515,0.0009224749,0.00019060606,0.045467418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990109,0.00022529742,0.000069198526,0.00028903256,0.00025102723,0.0001544902],"domain_scores_gemma":[0.9986908,0.00044249962,0.00017303467,0.00039359997,0.00021302047,0.00008714938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007089816,0.0006273459,0.00040005063,0.0004029019,0.0007694422,0.0011134131,0.0005494318,0.0008992853,0.007676132],"category_scores_gemma":[0.002261385,0.0003721155,0.0005915395,0.00049725425,0.001464377,0.0017815586,0.00097438495,0.0014071186,0.002060193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018922957,0.00006900662,0.0007917566,0.00036686714,0.000032449527,0.0002138224,0.0002326523,0.0039564297,0.013291763,0.9170955,0.0076595712,0.05610096],"study_design_scores_gemma":[0.000078732555,0.000404299,0.00072550966,0.00007740835,0.00005396959,0.0011341387,0.00011993884,0.010987476,0.020156583,0.83353496,0.13269708,0.000029922578],"about_ca_topic_score_codex":0.000529637,"about_ca_topic_score_gemma":0.0011306222,"teacher_disagreement_score":0.007676132,"about_ca_system_score_codex":0.00069305865,"about_ca_system_score_gemma":0.0008518878,"threshold_uncertainty_score":0.025679171},"labels":[],"label_agreement":null},{"id":"W2397696069","doi":"","title":"On 2-Factors with Chorded Quadrilaterals in Graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Quadrilateral; Combinatorics; Structural engineering; Engineering; Finite element method","score_opus":0.011865795706753474,"score_gpt":0.18369159528163095,"score_spread":0.17182579957487748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397696069","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27519608,0.003948124,0.42366406,0.0018993416,0.0009902471,0.00019626845,0.00076452305,0.0008316376,0.2925097],"genre_scores_gemma":[0.8644579,0.0021893296,0.06658998,0.0006583334,0.00041793677,0.00012185798,0.00052399066,0.0002773997,0.06476319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993781,0.00018284425,0.000031714506,0.000117659285,0.00012831997,0.00016138918],"domain_scores_gemma":[0.99867934,0.00063187303,0.00019890392,0.00017335097,0.00014292164,0.00017356667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041498392,0.00063835434,0.0005103715,0.0014936286,0.0013074408,0.0018916901,0.0005788258,0.0008784316,0.020642122],"category_scores_gemma":[0.0025767388,0.000398549,0.00053637096,0.0012141614,0.0018425357,0.0032294637,0.0016218047,0.0011445105,0.0034741922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000871071,0.000033113847,0.00049849274,0.00008458046,0.000011714015,0.00021113208,0.0003316329,0.0044258917,0.0016476922,0.9658261,0.004912354,0.021930179],"study_design_scores_gemma":[0.000019490111,0.000028751658,0.00025676563,0.00005102595,0.000008867902,0.00030918198,0.00026433458,0.01072081,0.0009968099,0.967817,0.019510765,0.000016261163],"about_ca_topic_score_codex":0.0022067418,"about_ca_topic_score_gemma":0.003526611,"teacher_disagreement_score":0.020642122,"about_ca_system_score_codex":0.00081435696,"about_ca_system_score_gemma":0.00039200686,"threshold_uncertainty_score":0.06905478},"labels":[],"label_agreement":null},{"id":"W2397710282","doi":"","title":"On Fuzzy Euclidean ideals.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Fuzzy and Soft Set Theory","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Fuzzy logic; Euclidean geometry; Pure mathematics; Algebra over a field; Geometry; Artificial intelligence; Computer science","score_opus":0.03979514604709397,"score_gpt":0.3197561936506548,"score_spread":0.2799610476035608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397710282","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056695443,0.022271002,0.3526015,0.0077969274,0.0018381771,0.000091140486,0.0009501142,0.00026840638,0.55748737],"genre_scores_gemma":[0.81138605,0.008781921,0.09559524,0.0017186494,0.002369951,0.00014502418,0.0008206509,0.00013190391,0.079050586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981623,0.0006504857,0.0001257624,0.00025482546,0.00064438727,0.00016232609],"domain_scores_gemma":[0.99773884,0.0009499389,0.00025404146,0.0002992869,0.00050602853,0.00025196598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00217361,0.00070382986,0.00092420285,0.0036179982,0.0015783912,0.0031681485,0.0007393115,0.0007897892,0.010913506],"category_scores_gemma":[0.0045594843,0.00036499972,0.0009416708,0.0020210557,0.0045854826,0.006151971,0.00279559,0.00236849,0.002717327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007576319,0.00000451096,0.000054460976,0.000026157464,0.0000062218487,0.00001768816,0.000056398752,0.0003150882,0.00008718116,0.9940625,0.0015896497,0.0037725996],"study_design_scores_gemma":[0.000005564959,0.000008303476,0.00013096438,0.000020697737,0.0000047150797,0.000072490235,0.000056639616,0.0015884232,0.00012643512,0.9882357,0.009744762,0.0000054290836],"about_ca_topic_score_codex":0.00086782844,"about_ca_topic_score_gemma":0.0010795168,"teacher_disagreement_score":0.010913506,"about_ca_system_score_codex":0.0017312239,"about_ca_system_score_gemma":0.0005919913,"threshold_uncertainty_score":0.036509395},"labels":[],"label_agreement":null},{"id":"W2397737241","doi":"","title":"On a Class of Blockwise-Bursts in Array Codes.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Class (philosophy); Mathematics; Arithmetic; Computer science; Artificial intelligence","score_opus":0.00785008549301406,"score_gpt":0.22673678743912568,"score_spread":0.21888670194611162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397737241","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35843372,0.0029544341,0.5464766,0.0019851823,0.00063726644,0.00019982494,0.0014934024,0.0013124859,0.08650705],"genre_scores_gemma":[0.9184001,0.0015003609,0.04568527,0.00065684924,0.00037322618,0.00030522404,0.0008402484,0.00029042055,0.031948328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992781,0.00016426406,0.000043938406,0.00013217932,0.00018585406,0.0001956952],"domain_scores_gemma":[0.9964149,0.0016781082,0.00052344496,0.000527401,0.0004696021,0.00038652495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049777166,0.0006088699,0.0007456825,0.001487914,0.0014294528,0.002510404,0.0010164798,0.0016145603,0.008695299],"category_scores_gemma":[0.0051915795,0.00041590055,0.0005687759,0.0015679192,0.0015474005,0.0025239415,0.001677515,0.0016154313,0.0016037036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000697663,0.00003368013,0.00061741646,0.00006031652,0.000011576287,0.00013720391,0.00015961853,0.011275329,0.002376161,0.9699737,0.0035197167,0.0117655145],"study_design_scores_gemma":[0.00003859603,0.000060049882,0.00045053137,0.000055761553,0.000012897609,0.00036451718,0.00012937136,0.11395403,0.0016645984,0.8734559,0.009782963,0.00003085534],"about_ca_topic_score_codex":0.0016325992,"about_ca_topic_score_gemma":0.0016521103,"teacher_disagreement_score":0.008695299,"about_ca_system_score_codex":0.0013293929,"about_ca_system_score_gemma":0.00089820503,"threshold_uncertainty_score":0.029088676},"labels":[],"label_agreement":null},{"id":"W2397737544","doi":"","title":"On Super-simple Cyclic 2-designs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Simple (philosophy); Pure mathematics; Arithmetic; Epistemology","score_opus":0.013576868473093614,"score_gpt":0.2168128638351721,"score_spread":0.20323599536207848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397737544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18351844,0.0033913841,0.50232863,0.0018649668,0.0008850076,0.0001582699,0.0005480551,0.0003479895,0.30695727],"genre_scores_gemma":[0.8716059,0.0025948472,0.07757433,0.0014101717,0.000702275,0.00023328092,0.00038034428,0.000114807095,0.04538404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871266,0.0005244835,0.000053632888,0.00017664682,0.00034409165,0.00018858802],"domain_scores_gemma":[0.9975073,0.0013518356,0.00031041788,0.0003755072,0.00030375848,0.0001513781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008726868,0.00066796254,0.00047204786,0.0016799514,0.0010408151,0.0013880274,0.0004997701,0.0011005485,0.012796891],"category_scores_gemma":[0.0033900186,0.0004039605,0.000558125,0.0012500404,0.0017989016,0.0025102738,0.0015770947,0.0012916685,0.0020171106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003996217,0.0000150191945,0.000152191,0.000059834343,0.0000080445325,0.000094699986,0.00011960496,0.0023954187,0.0014144419,0.98225754,0.0020006218,0.0114426585],"study_design_scores_gemma":[0.000012338102,0.000029673794,0.00013794971,0.00003761167,0.000006328155,0.00018627645,0.000043947388,0.0074677574,0.0006618171,0.9838161,0.007586276,0.000014076748],"about_ca_topic_score_codex":0.00056543306,"about_ca_topic_score_gemma":0.0011854256,"teacher_disagreement_score":0.012796891,"about_ca_system_score_codex":0.0008252009,"about_ca_system_score_gemma":0.0005528126,"threshold_uncertainty_score":0.042809844},"labels":[],"label_agreement":null},{"id":"W2397759350","doi":"","title":"Max-min total restrained domination number.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.011447784852974364,"score_gpt":0.2720094634121934,"score_spread":0.260561678559219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397759350","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28329754,0.0036134387,0.34258175,0.005732064,0.0009186223,0.00038022693,0.017997833,0.005158021,0.3403205],"genre_scores_gemma":[0.8414642,0.0013483058,0.093160436,0.0010734382,0.00030737146,0.00029488222,0.0050561544,0.000736256,0.056559008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989016,0.00020545677,0.000054910586,0.0003169568,0.00030748706,0.00021358073],"domain_scores_gemma":[0.9954893,0.0022071742,0.00029627164,0.0010662733,0.00051860086,0.00042237312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012384127,0.00075116387,0.0008318433,0.0011787962,0.0012192345,0.0022455265,0.0024250294,0.0007322912,0.019420711],"category_scores_gemma":[0.006108721,0.00034556983,0.00059373165,0.0018541047,0.0012347742,0.0040561617,0.0015959031,0.0020119243,0.003130754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012676608,0.0002980741,0.0040590414,0.0012764243,0.00018521956,0.00027674215,0.0005254761,0.04272599,0.016047152,0.5607582,0.0993691,0.27321094],"study_design_scores_gemma":[0.00009263996,0.0001485737,0.0026847809,0.000121415535,0.00013092128,0.00085748127,0.00019688411,0.063072816,0.012646173,0.85933936,0.060649265,0.0000597445],"about_ca_topic_score_codex":0.00096806587,"about_ca_topic_score_gemma":0.002222508,"teacher_disagreement_score":0.019420711,"about_ca_system_score_codex":0.0017221385,"about_ca_system_score_gemma":0.0014663788,"threshold_uncertainty_score":0.064968765},"labels":[],"label_agreement":null},{"id":"W2397759904","doi":"","title":"The Mod Sum Number of Even Fans and Symmetric Complete Bipartite Graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Mod; Discrete mathematics; Graph","score_opus":0.006805093739342697,"score_gpt":0.20553669702846988,"score_spread":0.19873160328912717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397759904","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5619835,0.0025048556,0.07644019,0.005874808,0.0012001133,0.00008868144,0.0019491005,0.00063125475,0.34932745],"genre_scores_gemma":[0.96149474,0.000823425,0.009943766,0.0004811353,0.0005569171,0.00009727393,0.0005080925,0.0001536845,0.025940983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921334,0.00027625886,0.000030394172,0.00014747906,0.0001793435,0.00015317944],"domain_scores_gemma":[0.9959735,0.0024388307,0.00047820332,0.00032180996,0.00025911204,0.0005284769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012843008,0.00059963646,0.00069932814,0.00271161,0.0016799257,0.0029900072,0.0010465194,0.00077288167,0.014271446],"category_scores_gemma":[0.0065116165,0.00041395015,0.00037687132,0.0012861302,0.002594922,0.004529904,0.0015545816,0.0012363166,0.0013329053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013965112,0.000027660484,0.00095934747,0.00008689753,0.000014129022,0.000094874544,0.00012210548,0.0024214499,0.0009395716,0.9679222,0.010436181,0.016835842],"study_design_scores_gemma":[0.00001824951,0.000018585648,0.0006568098,0.00003772335,0.000015173519,0.00030018837,0.00008331781,0.010116341,0.0010414936,0.97990936,0.007787605,0.0000152476],"about_ca_topic_score_codex":0.0005171186,"about_ca_topic_score_gemma":0.00087458355,"teacher_disagreement_score":0.014271446,"about_ca_system_score_codex":0.0012021111,"about_ca_system_score_gemma":0.00077122817,"threshold_uncertainty_score":0.047742724},"labels":[],"label_agreement":null},{"id":"W2397767158","doi":"","title":"The Properties of Transformation Digraphs D xyz .","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Transformation (genetics); Pure mathematics; Biology; Genetics","score_opus":0.022753583724552415,"score_gpt":0.25966922473554327,"score_spread":0.23691564101099086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397767158","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3490574,0.00083909376,0.19964607,0.0023720772,0.00033578108,0.00022614033,0.0035914215,0.0010539821,0.4428781],"genre_scores_gemma":[0.927296,0.0006719798,0.02000778,0.00042555772,0.0000942231,0.00011928774,0.0025406864,0.00019726263,0.04864731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995875,0.00008378014,0.000031637886,0.00012366808,0.00008369533,0.000089696725],"domain_scores_gemma":[0.99847645,0.0007142351,0.00018855168,0.0002298635,0.00020963568,0.00018128913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034883048,0.00029741979,0.0002711647,0.0012500725,0.0014837902,0.0026690925,0.00044126995,0.0006847868,0.017323546],"category_scores_gemma":[0.0022217974,0.00040688828,0.0005235204,0.0010621131,0.001197603,0.0032012505,0.0010988886,0.0012460592,0.0026670317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007171974,0.00004672415,0.0009364551,0.00007358962,0.000014410833,0.00027215944,0.00040847514,0.0007728474,0.0026805976,0.9686282,0.0042529255,0.021841865],"study_design_scores_gemma":[0.00004299777,0.00003709041,0.002148694,0.000045134995,0.000034923185,0.0007620229,0.00048614506,0.004815167,0.0047448454,0.9446535,0.042203005,0.000026523552],"about_ca_topic_score_codex":0.0020863276,"about_ca_topic_score_gemma":0.0024122223,"teacher_disagreement_score":0.017323546,"about_ca_system_score_codex":0.00080926064,"about_ca_system_score_gemma":0.00052062765,"threshold_uncertainty_score":0.05795306},"labels":[],"label_agreement":null},{"id":"W2397768957","doi":"","title":"Excluded-Minors For The Class Of Graphic Splitting Matroids.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Matroid; Mathematics; Class (philosophy); Combinatorics; Computer science; Artificial intelligence","score_opus":0.012697529181452866,"score_gpt":0.26088607893195176,"score_spread":0.2481885497504989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397768957","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6157422,0.0013441498,0.23473802,0.0022630834,0.00041417437,0.00017813264,0.0020860832,0.0008950207,0.14233905],"genre_scores_gemma":[0.93621707,0.00050207344,0.024956996,0.00028618987,0.0004776256,0.00013785691,0.0023097405,0.0002266424,0.034885738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949753,0.000106372194,0.000031920394,0.00011169547,0.00016767507,0.0000848031],"domain_scores_gemma":[0.9983606,0.0006908196,0.00026691353,0.00022264251,0.00015518721,0.000303854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046135884,0.0006321239,0.0005315347,0.0013232039,0.0015152178,0.0032504683,0.0008124735,0.00080666493,0.015683584],"category_scores_gemma":[0.0022457691,0.00041062068,0.00079845975,0.0008316142,0.0014684923,0.0024158785,0.0013873316,0.0018077416,0.002095867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001790441,0.00009206702,0.001299035,0.000105940606,0.000028870609,0.00038968632,0.000428218,0.0020947657,0.0036482718,0.961918,0.009408877,0.020407198],"study_design_scores_gemma":[0.000043880576,0.000051029798,0.0011607242,0.000024807285,0.000015498632,0.0008814616,0.00016388413,0.011891439,0.0013052364,0.96970826,0.014735346,0.000018495628],"about_ca_topic_score_codex":0.00064234046,"about_ca_topic_score_gemma":0.00087853614,"teacher_disagreement_score":0.015683584,"about_ca_system_score_codex":0.0008495564,"about_ca_system_score_gemma":0.0004679771,"threshold_uncertainty_score":0.05246687},"labels":[],"label_agreement":null},{"id":"W2397772671","doi":"","title":"Genus Distributions For Double Pearl-Ladder Graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Pearl; Mathematics; Genus; Combinatorics; Zoology; Biology; Geography; Archaeology","score_opus":0.02311697636307435,"score_gpt":0.24479139443601777,"score_spread":0.2216744180729434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397772671","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5600566,0.0008073232,0.37572974,0.0019664061,0.0001474174,0.000076849385,0.0010540135,0.0015953879,0.05856619],"genre_scores_gemma":[0.9521691,0.00045512055,0.034080807,0.00025882336,0.00008579754,0.00011189757,0.0008956105,0.00043616115,0.011506702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947995,0.0001230641,0.000022101156,0.00011815695,0.00014349267,0.00011331833],"domain_scores_gemma":[0.9954602,0.0025860756,0.0005583377,0.00048935076,0.00038505657,0.0005209767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011446908,0.00040844904,0.00048050078,0.0033250249,0.0010748964,0.0024361531,0.0013077671,0.00093788235,0.01110637],"category_scores_gemma":[0.0109113045,0.00030238647,0.0004080614,0.0013850617,0.0015458696,0.004018289,0.0016072264,0.0012462706,0.001370349],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015415435,0.00006566303,0.003525544,0.00009480289,0.000016463371,0.000112617076,0.00028002856,0.020561099,0.0028108004,0.93197745,0.008157853,0.032243434],"study_design_scores_gemma":[0.00002820976,0.000023465534,0.0017141519,0.000041089297,0.000011420972,0.00019615098,0.00020828695,0.12872437,0.0021043087,0.8620022,0.0049212854,0.000025059051],"about_ca_topic_score_codex":0.00074675307,"about_ca_topic_score_gemma":0.0011147048,"teacher_disagreement_score":0.01110637,"about_ca_system_score_codex":0.0014152445,"about_ca_system_score_gemma":0.00046326462,"threshold_uncertainty_score":0.037154496},"labels":[],"label_agreement":null},{"id":"W2397779203","doi":"","title":"Minus Edge Domination in Graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Computer science; Artificial intelligence","score_opus":0.013547289838376175,"score_gpt":0.279399525172693,"score_spread":0.26585223533431684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397779203","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4239516,0.004154785,0.1500415,0.0041100103,0.0012080924,0.00008020434,0.0011981657,0.0008076008,0.41444802],"genre_scores_gemma":[0.9288236,0.0013732541,0.0150545845,0.0008115756,0.0004533271,0.00006995371,0.0006123036,0.00019856496,0.052602943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991258,0.00022009847,0.000048029447,0.00020110476,0.00022310232,0.00018195662],"domain_scores_gemma":[0.99740773,0.0012037745,0.00027382458,0.00036477248,0.00039287395,0.00035710057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008191457,0.00038678214,0.00054741406,0.001530117,0.0015513853,0.0025990622,0.0009633556,0.00073440385,0.010753449],"category_scores_gemma":[0.0042270934,0.0002798959,0.00041158652,0.001187553,0.0019608804,0.0044125486,0.0016934098,0.0013816686,0.0014571651],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007962955,0.000024738052,0.0010208385,0.00011704216,0.000018639295,0.00017568818,0.00026101855,0.00083860557,0.0023167145,0.96414465,0.0055920715,0.025410336],"study_design_scores_gemma":[0.00001829248,0.00002219393,0.00093286217,0.000043123964,0.000026689722,0.00075396284,0.00016032936,0.0038853008,0.0019914017,0.9688867,0.023264088,0.000015065592],"about_ca_topic_score_codex":0.00091198744,"about_ca_topic_score_gemma":0.0013316307,"teacher_disagreement_score":0.010753449,"about_ca_system_score_codex":0.0008193846,"about_ca_system_score_gemma":0.0005083387,"threshold_uncertainty_score":0.035973907},"labels":[],"label_agreement":null},{"id":"W2397803124","doi":"","title":"Flexibility of Circular Graphs C(2n, 2) on the Projective Plane.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Projective plane; Projective test; Flexibility (engineering); Plane (geometry); Real projective plane; Combinatorics; Pure mathematics; Geometry; Projective space; Collineation; Statistics","score_opus":0.08205620202908284,"score_gpt":0.29191591265374855,"score_spread":0.2098597106246657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397803124","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80120176,0.00054601027,0.044638842,0.0012268652,0.0001382906,0.000050811672,0.00086146576,0.0002825385,0.1510534],"genre_scores_gemma":[0.98564494,0.00019553324,0.004308015,0.00013127267,0.00005047853,0.00003004963,0.00032810643,0.00007952938,0.009232092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993525,0.0001580134,0.00002458791,0.00013353492,0.0001468695,0.00018445539],"domain_scores_gemma":[0.9986229,0.0005182523,0.00026182624,0.0002340674,0.00008494005,0.00027803693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041539277,0.0005328031,0.0003746047,0.0016487169,0.0017682542,0.0024224701,0.00092982646,0.0008522284,0.012254289],"category_scores_gemma":[0.0018195006,0.0003939395,0.00046596932,0.0014545607,0.0026465734,0.0025484143,0.002613049,0.0011441463,0.001078071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020804802,0.000021845755,0.000670086,0.00005075988,0.000011312491,0.0004274425,0.00044782987,0.008379284,0.003179759,0.9725811,0.0027397922,0.011282744],"study_design_scores_gemma":[0.00005736939,0.000043815904,0.0018968298,0.000040712348,0.000018310147,0.0006106745,0.00053212495,0.015673686,0.00212202,0.96503776,0.013920192,0.00004650436],"about_ca_topic_score_codex":0.0022207387,"about_ca_topic_score_gemma":0.0023812887,"teacher_disagreement_score":0.012254289,"about_ca_system_score_codex":0.0008618597,"about_ca_system_score_gemma":0.00034847384,"threshold_uncertainty_score":0.040994704},"labels":[],"label_agreement":null},{"id":"W2397809402","doi":"","title":"Neighbor Rupture Degree And The Relations Between Other Parameters.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Degree (music); Mathematics; Statistics; Acoustics; Physics","score_opus":0.034396968666349594,"score_gpt":0.2273431693680174,"score_spread":0.19294620070166782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397809402","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3726697,0.0026234742,0.41746265,0.001493667,0.0005273247,0.000168514,0.0021116245,0.00067452673,0.2022684],"genre_scores_gemma":[0.9488712,0.0008238523,0.027864147,0.00009738744,0.000085485204,0.0000946969,0.0005870227,0.00014034643,0.021435786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989712,0.00017159354,0.000075731456,0.0002767831,0.0003664861,0.00013829228],"domain_scores_gemma":[0.995465,0.0024192194,0.0006547912,0.00069600437,0.00038968722,0.0003752895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010570181,0.0005128295,0.00074244983,0.0015149097,0.0012189663,0.0029519254,0.0016610767,0.0012447188,0.016825726],"category_scores_gemma":[0.0108472565,0.00043617617,0.00047777372,0.0016434524,0.0016248124,0.005255046,0.0016171447,0.0017179578,0.0022585886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003603516,0.00020619831,0.011429813,0.0003924856,0.000118856275,0.0005957888,0.0002848291,0.097187735,0.011901951,0.79996055,0.005736568,0.07182489],"study_design_scores_gemma":[0.000053759595,0.00018170703,0.010446656,0.000085169086,0.00019328855,0.0015543384,0.0008124872,0.20399565,0.021575216,0.72139114,0.0395147,0.00019593046],"about_ca_topic_score_codex":0.00094105053,"about_ca_topic_score_gemma":0.0014809445,"teacher_disagreement_score":0.016825726,"about_ca_system_score_codex":0.00072935317,"about_ca_system_score_gemma":0.00054729613,"threshold_uncertainty_score":0.056287706},"labels":[],"label_agreement":null},{"id":"W2397813300","doi":"","title":"On the E k -cordiality of some graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.028574388991780508,"score_gpt":0.23970382367072093,"score_spread":0.21112943467894044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397813300","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5653567,0.0030775217,0.1212425,0.019308044,0.00058230996,0.00010647853,0.0021642272,0.0005095799,0.28765267],"genre_scores_gemma":[0.94497275,0.0013876057,0.026855748,0.0015175567,0.0004296743,0.00009040739,0.0009462183,0.0001447235,0.023655316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891937,0.00033159365,0.00006472706,0.00028125406,0.00015227907,0.0002507793],"domain_scores_gemma":[0.99198407,0.00521062,0.0007111199,0.0008602501,0.00046242113,0.0007715679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011994169,0.000490497,0.0006381676,0.00186739,0.0029861704,0.0038083526,0.0012690864,0.0016408468,0.013698816],"category_scores_gemma":[0.00939618,0.0005296905,0.00066649547,0.0021144785,0.0044699735,0.00787427,0.003218974,0.0036621664,0.0012635918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007659679,0.000030168094,0.00090766273,0.000071247785,0.00001022379,0.00007374219,0.00025605832,0.0012040604,0.0006828473,0.98340994,0.0048978347,0.008379644],"study_design_scores_gemma":[0.00001847006,0.0000125209945,0.00060481526,0.000027034079,0.000010741729,0.00015869003,0.00021217078,0.0038863714,0.0005709508,0.9886564,0.0058310144,0.000010865478],"about_ca_topic_score_codex":0.0018676834,"about_ca_topic_score_gemma":0.0020404477,"teacher_disagreement_score":0.013698816,"about_ca_system_score_codex":0.0020109247,"about_ca_system_score_gemma":0.00068957865,"threshold_uncertainty_score":0.04582709},"labels":[],"label_agreement":null},{"id":"W2397814104","doi":"","title":"Algorithmic Aspects of Trades.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Global trade and economics","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.06490282585289867,"score_gpt":0.21812569441363788,"score_spread":0.15322286856073922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397814104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078011386,0.0104462085,0.5481841,0.013525701,0.0009397849,0.00012376854,0.0022338405,0.0006062901,0.34592897],"genre_scores_gemma":[0.8202811,0.0056446083,0.102872804,0.0017134064,0.0015837399,0.00024874616,0.0019544272,0.00034375652,0.06535739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983235,0.0005740868,0.00014292986,0.0003341782,0.0004411876,0.00018407895],"domain_scores_gemma":[0.993002,0.0044191363,0.000549261,0.0011835705,0.0005482379,0.00029782028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018050255,0.0006751261,0.0010357966,0.0021913878,0.0017144172,0.006146848,0.0015417975,0.0019674196,0.020487139],"category_scores_gemma":[0.0110113425,0.00051002693,0.0013432987,0.0031698172,0.0033932407,0.009685087,0.0029902204,0.0030933437,0.0028810056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008611911,0.000009543659,0.0002403674,0.00003477604,0.0000119996785,0.000023054803,0.000044115925,0.0020256115,0.000054288827,0.9883456,0.0025969215,0.0066050063],"study_design_scores_gemma":[0.000003840157,0.0000023937382,0.000100543555,0.000009703057,0.000004371688,0.000033682943,0.00001998067,0.004845795,0.000033973745,0.99046737,0.0044757337,0.0000025935728],"about_ca_topic_score_codex":0.0012169263,"about_ca_topic_score_gemma":0.0016554672,"teacher_disagreement_score":0.020487139,"about_ca_system_score_codex":0.0017040238,"about_ca_system_score_gemma":0.0008321143,"threshold_uncertainty_score":0.06853628},"labels":[],"label_agreement":null},{"id":"W2397830249","doi":"","title":"Prime labeling on Knödel graphs W 3, n .","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Prime (order theory)","score_opus":0.01167080183978739,"score_gpt":0.21767451822590558,"score_spread":0.2060037163861182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397830249","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4073136,0.0014252538,0.3200058,0.0071650916,0.00046729375,0.00015313148,0.0032652058,0.001402142,0.2588025],"genre_scores_gemma":[0.83723253,0.00089005067,0.07983199,0.0011583479,0.00026993785,0.00015610548,0.002576737,0.00045404924,0.07743016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944276,0.00014503313,0.000025374575,0.00014581157,0.00009269789,0.00014833156],"domain_scores_gemma":[0.99820924,0.0009247279,0.00022428988,0.0002949087,0.00013040772,0.00021638666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065280095,0.00049135217,0.00053276605,0.0011531903,0.001988111,0.0026065512,0.0009573632,0.0010770578,0.014332564],"category_scores_gemma":[0.0028764026,0.0003952371,0.0005362059,0.0013443219,0.0017127459,0.0049669235,0.0018363624,0.0017952407,0.0019001485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001095574,0.000041321477,0.0005350169,0.00008322868,0.0000075349444,0.00007250824,0.00018692411,0.0021942344,0.0013305817,0.96701604,0.01141341,0.017009703],"study_design_scores_gemma":[0.000015962018,0.000011940505,0.00035235734,0.00001813288,0.000007941131,0.000098930104,0.00013306232,0.006663406,0.0010261114,0.98191893,0.009742938,0.00001026127],"about_ca_topic_score_codex":0.0018370601,"about_ca_topic_score_gemma":0.0029342277,"teacher_disagreement_score":0.014332564,"about_ca_system_score_codex":0.0014599325,"about_ca_system_score_gemma":0.0007358561,"threshold_uncertainty_score":0.047947228},"labels":[],"label_agreement":null},{"id":"W2397864841","doi":"","title":"On Cyclic (C 2m +e)-designs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arithmetic","score_opus":0.009104513636449119,"score_gpt":0.20638381933591704,"score_spread":0.19727930569946792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397864841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17155014,0.00302356,0.5397839,0.002388178,0.0005450089,0.00018808566,0.00078726717,0.00040487607,0.28132898],"genre_scores_gemma":[0.8460558,0.0025335648,0.08922236,0.0011381515,0.0005758832,0.00030786527,0.0004986716,0.00013025272,0.05953742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827373,0.0007125055,0.00006520829,0.00023257197,0.00041666473,0.00029939885],"domain_scores_gemma":[0.99635494,0.002073963,0.00046319843,0.0005398812,0.00038060552,0.0001874372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011053513,0.0007169716,0.0004854859,0.0018190484,0.001194841,0.0019092007,0.00061841717,0.0011679545,0.013445106],"category_scores_gemma":[0.004962523,0.00041619362,0.0004920489,0.0017474239,0.002193096,0.0025260074,0.0019678308,0.0011860371,0.0020482847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005268945,0.000018157225,0.00022513155,0.00006351277,0.000009951161,0.00007885123,0.0001297248,0.0030328755,0.0013305455,0.976185,0.0029011432,0.015972242],"study_design_scores_gemma":[0.00002279315,0.00003805478,0.00020067491,0.000060334674,0.000010168027,0.00022367612,0.00007903375,0.011662455,0.0012151689,0.9766816,0.00978792,0.000018069442],"about_ca_topic_score_codex":0.00081190694,"about_ca_topic_score_gemma":0.0015852759,"teacher_disagreement_score":0.013445106,"about_ca_system_score_codex":0.0014785153,"about_ca_system_score_gemma":0.0009008397,"threshold_uncertainty_score":0.04497838},"labels":[],"label_agreement":null},{"id":"W2397878738","doi":"","title":"A Note On The Q-Lucas Theorem.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.01973762701759689,"score_gpt":0.2835621204030103,"score_spread":0.2638244933854134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397878738","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010704387,0.031591937,0.10186991,0.11182095,0.029327113,0.000049076396,0.0006570139,0.000489134,0.7134905],"genre_scores_gemma":[0.48120096,0.03885078,0.11382778,0.048404258,0.030281555,0.0002296997,0.0008244425,0.000981476,0.28539905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924785,0.00023998108,0.000035083547,0.00014305906,0.00026072015,0.000073128555],"domain_scores_gemma":[0.9976549,0.0014784186,0.00011636633,0.00022672705,0.0003781522,0.00014535767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013851145,0.00058190915,0.0004871308,0.0013546073,0.0021588246,0.0024660912,0.0013057684,0.0015874449,0.022826873],"category_scores_gemma":[0.0052594477,0.0003001381,0.00070421974,0.0012660736,0.0048187263,0.008022134,0.003023527,0.004256395,0.005543565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000094385005,0.000004676935,0.00005312619,0.00004867491,0.000003918159,0.000072570096,0.00007973536,0.000080339116,0.00013582391,0.9628145,0.03060024,0.006096864],"study_design_scores_gemma":[0.0000040871737,0.0000066991006,0.00012955442,0.000026963542,0.0000030581054,0.00009318613,0.000043036736,0.0001987074,0.000115338684,0.9110983,0.08827353,0.000007535106],"about_ca_topic_score_codex":0.0026280857,"about_ca_topic_score_gemma":0.0027378025,"teacher_disagreement_score":0.022826873,"about_ca_system_score_codex":0.0012351578,"about_ca_system_score_gemma":0.0008048721,"threshold_uncertainty_score":0.076363504},"labels":[],"label_agreement":null},{"id":"W2397891452","doi":"","title":"On Generalized Triple Derivations On Lattices.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics; Algebra over a field; Arithmetic","score_opus":0.01589216652166819,"score_gpt":0.24939015376566492,"score_spread":0.23349798724399673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397891452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09762136,0.010566461,0.5189301,0.006331657,0.0019088183,0.000121795536,0.0011169742,0.0009351315,0.3624677],"genre_scores_gemma":[0.7799868,0.007749227,0.11789409,0.0025394238,0.0015716071,0.00015983313,0.0011995251,0.00062543555,0.08827406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852043,0.00059734983,0.00010133165,0.00020297791,0.00039881162,0.00017917127],"domain_scores_gemma":[0.9983917,0.00062592694,0.00011379914,0.0003067088,0.00036221178,0.0001996407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015480571,0.0007022172,0.0008081775,0.0021495884,0.0021011773,0.0029207505,0.000918006,0.0011850388,0.009620336],"category_scores_gemma":[0.0038451839,0.0005446598,0.0009263085,0.0024938092,0.0039894558,0.010822593,0.0040320433,0.0033449188,0.003174431],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010236861,0.0000084999565,0.00010215149,0.000029310046,0.0000054211723,0.00008094709,0.00020359547,0.0003429096,0.00022459155,0.9910433,0.0019627793,0.005986222],"study_design_scores_gemma":[0.0000035590253,0.0000037818377,0.000042764976,0.000013386046,0.0000027117035,0.00006602121,0.000060684215,0.0006884671,0.00010531441,0.9941906,0.004817991,0.00000478459],"about_ca_topic_score_codex":0.0014254175,"about_ca_topic_score_gemma":0.0024966495,"teacher_disagreement_score":0.009620336,"about_ca_system_score_codex":0.0013854193,"about_ca_system_score_gemma":0.0007451703,"threshold_uncertainty_score":0.03218323},"labels":[],"label_agreement":null},{"id":"W2397953028","doi":"","title":"A diameter formula for an undirected double-loop network.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Loop (graph theory); Double loop; Undirected graph; Combinatorics; Topology (electrical circuits); Graph; Business","score_opus":0.02651258352859079,"score_gpt":0.2680501012925312,"score_spread":0.24153751776394042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397953028","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12734933,0.0042418363,0.6597902,0.004114686,0.0009484623,0.00011302936,0.0018166398,0.0008530667,0.2007727],"genre_scores_gemma":[0.857525,0.0026147268,0.10362219,0.0011514567,0.00069448026,0.0002527822,0.0009989906,0.0003387413,0.03280149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961334,0.00006408644,0.000031924035,0.00009409573,0.00014132207,0.000055182456],"domain_scores_gemma":[0.9981476,0.0011451475,0.00016145187,0.00016014795,0.0002687545,0.00011684994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057916384,0.00037929253,0.00048543775,0.00080977986,0.00077843753,0.0019841744,0.0012132591,0.0010814932,0.007624699],"category_scores_gemma":[0.004375019,0.0003146671,0.00046768077,0.0009388282,0.00092651276,0.0053752875,0.0011696211,0.0014501846,0.0012286841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052623975,0.000020025038,0.00044298262,0.00014332728,0.000010659608,0.00014341534,0.00016340196,0.00543926,0.002417554,0.96341836,0.009256173,0.018492118],"study_design_scores_gemma":[0.00001741865,0.000026222157,0.0003365834,0.000048915397,0.000024460744,0.00031114338,0.00008829957,0.036986746,0.00093505834,0.94635725,0.014852945,0.000015063289],"about_ca_topic_score_codex":0.0008040334,"about_ca_topic_score_gemma":0.0011379019,"teacher_disagreement_score":0.007624699,"about_ca_system_score_codex":0.0013864824,"about_ca_system_score_gemma":0.00042950417,"threshold_uncertainty_score":0.025507092},"labels":[],"label_agreement":null},{"id":"W2397966988","doi":"","title":"Remarks On The Finite Heine Transformations.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Differential Equations and Dynamical Systems","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics; Calculus (dental); Algebra over a field; Medicine; Orthodontics","score_opus":0.019301499540359784,"score_gpt":0.27463340986881807,"score_spread":0.25533191032845826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397966988","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02585823,0.008175377,0.06079866,0.075528845,0.0064126877,0.000038461723,0.00085111987,0.0004076047,0.821929],"genre_scores_gemma":[0.76697403,0.0080855265,0.02979236,0.032930445,0.008363219,0.00019119174,0.0006900415,0.00033083843,0.15264238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939847,0.00015915574,0.000026761343,0.000121183024,0.00020358113,0.00009073403],"domain_scores_gemma":[0.99843603,0.00092192966,0.00009786285,0.00019663415,0.00020855779,0.00013903521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001237018,0.0005476523,0.00043077776,0.001112928,0.0016353412,0.0018766784,0.0010190139,0.001282843,0.031203244],"category_scores_gemma":[0.0034093766,0.00018053528,0.000556638,0.0006128673,0.005150343,0.0052302433,0.0023438525,0.0027899435,0.0030485971],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009752816,0.0000063050284,0.000057716752,0.000022782258,0.0000033715569,0.000055385786,0.00011796223,0.00008736122,0.0001044144,0.9874537,0.009652707,0.002428355],"study_design_scores_gemma":[0.0000074599784,0.000007424647,0.00026509856,0.000020584486,0.000002737378,0.00008538739,0.000112600384,0.00020397425,0.00013498406,0.96019125,0.038962618,0.0000058846936],"about_ca_topic_score_codex":0.0014452573,"about_ca_topic_score_gemma":0.0011934465,"teacher_disagreement_score":0.031203244,"about_ca_system_score_codex":0.0009000285,"about_ca_system_score_gemma":0.00037590077,"threshold_uncertainty_score":0.10438526},"labels":[],"label_agreement":null},{"id":"W2397975603","doi":"","title":"Signed edge k-subdomination numbers in graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.011479427207071836,"score_gpt":0.2620392272579767,"score_spread":0.25055980005090484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397975603","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40189776,0.0026399142,0.32821092,0.0037600826,0.0028118375,0.00017124532,0.0013861114,0.0012202441,0.25790182],"genre_scores_gemma":[0.86062384,0.0013151703,0.092858896,0.0006747229,0.0005676786,0.00020152966,0.0006604228,0.00022807402,0.0428697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933857,0.00018797247,0.00007335719,0.00012876441,0.00017919806,0.00009213618],"domain_scores_gemma":[0.9977786,0.0008699114,0.00038238068,0.00027523492,0.00041267253,0.00028118212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007053236,0.0004545743,0.00039762305,0.0022050648,0.0011276202,0.0028242962,0.0007355322,0.0010146516,0.011238106],"category_scores_gemma":[0.004932658,0.00026439838,0.00034688352,0.0017654729,0.0019179874,0.004446583,0.0012077643,0.001541013,0.0026268624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009709257,0.000030338706,0.0005832405,0.000088675,0.000008182296,0.00011352917,0.000197711,0.001119927,0.0025777218,0.94872385,0.005411651,0.041048095],"study_design_scores_gemma":[0.000018234876,0.000039599458,0.000528734,0.000045529778,0.0000110202445,0.00029664097,0.00016219479,0.004503038,0.0017483159,0.9754934,0.017128278,0.000024971587],"about_ca_topic_score_codex":0.00026887606,"about_ca_topic_score_gemma":0.00061488175,"teacher_disagreement_score":0.011238106,"about_ca_system_score_codex":0.00064631726,"about_ca_system_score_gemma":0.0005149527,"threshold_uncertainty_score":0.037595212},"labels":[],"label_agreement":null},{"id":"W2397981965","doi":"","title":"On a well-spread halving of directed multigraphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.00985249971436289,"score_gpt":0.18585298001840053,"score_spread":0.17600048030403764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397981965","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1835447,0.0015625472,0.7386944,0.0020101147,0.00033087042,0.000111696616,0.00031950526,0.0005358361,0.07289031],"genre_scores_gemma":[0.80924034,0.0016871088,0.13697296,0.0010226395,0.0003820151,0.0001977288,0.00040114485,0.00033934577,0.049756635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984281,0.0006809665,0.000059690195,0.00025978035,0.0003861889,0.00018518257],"domain_scores_gemma":[0.9906713,0.005978983,0.0004769905,0.0012492737,0.0009110624,0.0007123185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014976022,0.00074020046,0.0008560226,0.0019357271,0.0018080221,0.002346233,0.0014847112,0.0014484609,0.007400281],"category_scores_gemma":[0.01123997,0.0006244855,0.0008488941,0.0011551331,0.0030955651,0.0047552767,0.003442773,0.0033419,0.0017334248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007541514,0.000029453422,0.00026647333,0.000065783206,0.000021748929,0.0001584025,0.00035473015,0.0105929375,0.0018247367,0.9700754,0.0035998852,0.012934849],"study_design_scores_gemma":[0.000011640227,0.000025907611,0.00010707278,0.000031779167,0.000008905301,0.00016376676,0.00010327083,0.035338767,0.0008725764,0.9601936,0.0031289821,0.000013843693],"about_ca_topic_score_codex":0.000881253,"about_ca_topic_score_gemma":0.0011243547,"teacher_disagreement_score":0.007400281,"about_ca_system_score_codex":0.00092044036,"about_ca_system_score_gemma":0.00061348005,"threshold_uncertainty_score":0.024756372},"labels":[],"label_agreement":null},{"id":"W2397983538","doi":"","title":"Linked reduction systems for permutations.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Reduction (mathematics); Mathematics; Geometry","score_opus":0.012522776211883049,"score_gpt":0.25960557873859136,"score_spread":0.2470828025267083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397983538","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029044636,0.0029835454,0.62739474,0.0028561307,0.0013362416,0.00029516782,0.002137318,0.00222639,0.33172584],"genre_scores_gemma":[0.54811525,0.0029454427,0.2329474,0.0021539691,0.0013146687,0.0008776552,0.00584005,0.0015342166,0.20427136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983485,0.00044129565,0.00014248145,0.00031112233,0.00051269727,0.00024390922],"domain_scores_gemma":[0.99861705,0.0005734971,0.00009182702,0.0003784159,0.00022196143,0.00011719971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011320814,0.00095429516,0.00081294123,0.0023912236,0.0025265494,0.004596365,0.0014926149,0.0012567288,0.028378775],"category_scores_gemma":[0.0035136899,0.0005220999,0.0018283041,0.002130934,0.0027174305,0.0059638326,0.0039663934,0.0029552265,0.009114321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011532374,0.000014702214,0.00004250058,0.00003326318,0.000007550605,0.000034972192,0.00007708803,0.0005477541,0.0002019303,0.9866296,0.0035608062,0.008838322],"study_design_scores_gemma":[0.000007837105,0.0000074949826,0.00003623516,0.00001612197,0.000007500609,0.000060476792,0.000035233807,0.0019983463,0.00037356658,0.9761332,0.021313738,0.000010280343],"about_ca_topic_score_codex":0.0017095048,"about_ca_topic_score_gemma":0.0028620264,"teacher_disagreement_score":0.028378775,"about_ca_system_score_codex":0.0019920527,"about_ca_system_score_gemma":0.0012616388,"threshold_uncertainty_score":0.09493649},"labels":[],"label_agreement":null},{"id":"W2397985948","doi":"","title":"Connected M 2 -equicoverable graphs with circumference at most 5.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Circumference; Combinatorics; Geometry","score_opus":0.011446697726952152,"score_gpt":0.17002167467421375,"score_spread":0.1585749769472616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397985948","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5860797,0.0009673944,0.1639727,0.0016711251,0.00023828637,0.00028111358,0.0028119523,0.00096738973,0.24301022],"genre_scores_gemma":[0.892521,0.0004989232,0.05836315,0.00050017604,0.000067512636,0.00023325435,0.0027200019,0.00012786782,0.044968095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994374,0.0001339465,0.00003089682,0.00015212037,0.000097722135,0.00014800293],"domain_scores_gemma":[0.99867874,0.0004647492,0.000286247,0.00022699934,0.00013689257,0.00020637306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026730896,0.0007623676,0.0005619791,0.0010603504,0.0014852096,0.0015828407,0.0013965672,0.0012516249,0.017174857],"category_scores_gemma":[0.0021931066,0.0004027896,0.0003491865,0.0011431,0.0010111665,0.0016569345,0.0019914943,0.00089570775,0.0026648853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017931053,0.00036730026,0.006060914,0.0007808935,0.0001517986,0.0035019354,0.0011812818,0.02080876,0.037299823,0.77703846,0.034800548,0.11621517],"study_design_scores_gemma":[0.00027675813,0.00045030026,0.010810722,0.00026610142,0.00016025371,0.0038233404,0.0017873937,0.04576653,0.041706033,0.7769152,0.11792165,0.000115716735],"about_ca_topic_score_codex":0.0012178731,"about_ca_topic_score_gemma":0.002209343,"teacher_disagreement_score":0.017174857,"about_ca_system_score_codex":0.0006969599,"about_ca_system_score_gemma":0.0004910998,"threshold_uncertainty_score":0.05745566},"labels":[],"label_agreement":null},{"id":"W2397997284","doi":"","title":"More Identities On The Tribonacci Numbers.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Fibonacci number; Sequence (biology); Combinatorics; Polynomial; Mathematical analysis","score_opus":0.02204289880389763,"score_gpt":0.26053692018889363,"score_spread":0.238494021384996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397997284","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028466556,0.023339024,0.65552527,0.004433657,0.010249294,0.0001532027,0.00076286774,0.0004623798,0.27660775],"genre_scores_gemma":[0.3448579,0.02440324,0.4057224,0.005443544,0.013605999,0.00036993794,0.0021502178,0.001039766,0.202407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986216,0.00029835114,0.00012901447,0.0003031333,0.0005339651,0.00011393525],"domain_scores_gemma":[0.9986369,0.0005104053,0.00016768767,0.00021850664,0.00037944716,0.000086987995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016467724,0.0015030453,0.0008518573,0.0031501541,0.0015317219,0.0019461144,0.0013379538,0.0015894823,0.015121919],"category_scores_gemma":[0.004787118,0.00056403974,0.0017168524,0.002637869,0.0015880308,0.0058143535,0.0019496183,0.0037199303,0.006093116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013958377,0.000029118906,0.0002922929,0.0002139144,0.000014751931,0.00024751612,0.0005259432,0.0015043827,0.0021110107,0.9349919,0.011866873,0.04818835],"study_design_scores_gemma":[0.000012398321,0.0000616523,0.0007082831,0.00010497966,0.00004146378,0.0010019202,0.00012800349,0.012175243,0.0029113395,0.8497689,0.13298431,0.00010155416],"about_ca_topic_score_codex":0.0015915622,"about_ca_topic_score_gemma":0.002642212,"teacher_disagreement_score":0.015121919,"about_ca_system_score_codex":0.0016482382,"about_ca_system_score_gemma":0.00066408614,"threshold_uncertainty_score":0.050587833},"labels":[],"label_agreement":null},{"id":"W2398008903","doi":"","title":"Subtrees, BC-Subtrees of Generalized Bethe Trees and Related Questions","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.03613497431998955,"score_gpt":0.29382354678114747,"score_spread":0.25768857246115795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398008903","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6932841,0.008568269,0.13192837,0.012127076,0.00079468533,0.00009163802,0.0010762315,0.000311725,0.15181784],"genre_scores_gemma":[0.9443369,0.003148259,0.024087636,0.0016053502,0.0013400455,0.00011281371,0.0010117963,0.00015671656,0.024200473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991429,0.00025606167,0.0000464434,0.00019116396,0.00019844758,0.00016493026],"domain_scores_gemma":[0.9966883,0.001821864,0.00042478036,0.000316719,0.00030286663,0.00044552062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010661549,0.00073891145,0.001212429,0.0023291493,0.0026370485,0.00393497,0.0017922958,0.0029384536,0.007817338],"category_scores_gemma":[0.0069618737,0.00084531796,0.00096619996,0.0037122103,0.0043188506,0.009502825,0.0023576084,0.0037295935,0.0007828634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023945264,0.000016667156,0.000269365,0.00004622438,0.000004578968,0.000042528496,0.0002240873,0.00058905256,0.0002717776,0.9943778,0.0011102619,0.0030237222],"study_design_scores_gemma":[0.0000057671573,0.0000029775954,0.00016344097,0.000010723305,0.000003119883,0.00004172849,0.00007395666,0.0013834699,0.00004204847,0.9972319,0.0010368526,0.000004088392],"about_ca_topic_score_codex":0.003033598,"about_ca_topic_score_gemma":0.0028861938,"teacher_disagreement_score":0.007817338,"about_ca_system_score_codex":0.002002666,"about_ca_system_score_gemma":0.0007512942,"threshold_uncertainty_score":0.026151538},"labels":[],"label_agreement":null},{"id":"W2398019633","doi":"","title":"Enumeration of rooted loopless unicursal planar maps.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Enumeration; Mathematics; Combinatorics; Planar; Discrete mathematics; Computer science","score_opus":0.0077845172074696295,"score_gpt":0.21715206829992703,"score_spread":0.20936755109245742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398019633","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36481553,0.0012059141,0.42033163,0.0007403764,0.00019597377,0.00014149344,0.0018752774,0.001163677,0.20953009],"genre_scores_gemma":[0.8623289,0.0006462354,0.09288479,0.00014645614,0.000040852527,0.00011867348,0.0017206309,0.00016251493,0.041950855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996991,0.00006891719,0.000025130019,0.000050855324,0.00009414779,0.00006180731],"domain_scores_gemma":[0.99930143,0.00033065354,0.000066002045,0.00010505357,0.00013935876,0.0000574753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013163403,0.00032005014,0.0003615678,0.0009989614,0.0007440027,0.0015173199,0.00084302376,0.0006353341,0.010668417],"category_scores_gemma":[0.0020887794,0.0002170029,0.0003413479,0.0011870379,0.000592355,0.001299576,0.0015107882,0.0006805255,0.0020818035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015536197,0.00006205006,0.0010004273,0.0003502801,0.000023746996,0.0002586973,0.00040233045,0.017188998,0.009911454,0.85403275,0.0067887735,0.10982514],"study_design_scores_gemma":[0.00003218431,0.00005664965,0.00066814414,0.00011554237,0.000035131692,0.0005213791,0.0004054851,0.08979525,0.012696966,0.8568982,0.038746137,0.000028877053],"about_ca_topic_score_codex":0.0011414879,"about_ca_topic_score_gemma":0.0021420727,"teacher_disagreement_score":0.010668417,"about_ca_system_score_codex":0.00064460095,"about_ca_system_score_gemma":0.00036497068,"threshold_uncertainty_score":0.035689414},"labels":[],"label_agreement":null},{"id":"W2398024725","doi":"","title":"Quadratic Nonresidues and the Combinatorics of Sign Multiplication.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Sign (mathematics); Multiplication (music); Quadratic equation; Combinatorics; Arithmetic; Discrete mathematics; Mathematical analysis; Geometry","score_opus":0.01067095402399978,"score_gpt":0.2236383027356838,"score_spread":0.21296734871168402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398024725","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22866207,0.009221499,0.31955606,0.009854303,0.0016309902,0.00008607054,0.000512742,0.000703951,0.42977226],"genre_scores_gemma":[0.907724,0.0019128923,0.033178803,0.00079913647,0.000816962,0.00006816098,0.00022113557,0.0001676756,0.05511119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890435,0.0003858885,0.00006673545,0.00015446327,0.0003421457,0.00014652906],"domain_scores_gemma":[0.99747,0.0014486213,0.00022993816,0.00038267826,0.0002861239,0.00018265343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011665446,0.0004510459,0.00065658527,0.0015574894,0.0017912731,0.0032942083,0.00096644805,0.0007339722,0.015372131],"category_scores_gemma":[0.0073939064,0.0003681356,0.00059187954,0.0015183548,0.0047184923,0.008085699,0.0023650695,0.002557582,0.0023264815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001401823,0.00000964873,0.00010612111,0.000022697439,0.000002572152,0.000037604277,0.00006812113,0.0003187934,0.0001504369,0.9926817,0.0012173878,0.005370853],"study_design_scores_gemma":[0.0000048244297,0.000005292085,0.00008258768,0.000008013101,0.0000022910456,0.000064941574,0.000030313082,0.0015458986,0.00014104093,0.9942047,0.0039045885,0.000005418751],"about_ca_topic_score_codex":0.0008620433,"about_ca_topic_score_gemma":0.0014498408,"teacher_disagreement_score":0.015372131,"about_ca_system_score_codex":0.001057159,"about_ca_system_score_gemma":0.0007475138,"threshold_uncertainty_score":0.05142486},"labels":[],"label_agreement":null},{"id":"W2398030542","doi":"","title":"On the maximum packing problem of MP λ (3, K(3)4 - e, v).","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Packing problems; Combinatorics; Mathematical optimization","score_opus":0.006050689934521276,"score_gpt":0.1792347300021674,"score_spread":0.17318404006764612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398030542","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4944068,0.005351019,0.23978959,0.012522828,0.0008558168,0.00044155825,0.0046741283,0.0009795949,0.24097861],"genre_scores_gemma":[0.8207619,0.0037070068,0.11621241,0.002044551,0.0007163281,0.00033416526,0.003872821,0.0006277549,0.05172304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901307,0.00032412467,0.000037707978,0.00017702581,0.0001648824,0.00028312506],"domain_scores_gemma":[0.9961457,0.0027981976,0.00035846277,0.00027265915,0.0001603096,0.0002645595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009538847,0.000953356,0.0011451603,0.0010824538,0.0021823894,0.0034030816,0.0018653042,0.00247174,0.018531386],"category_scores_gemma":[0.0080014495,0.00070299266,0.000781324,0.0021627478,0.0014573607,0.004617416,0.002462925,0.0026426732,0.0023507075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010391283,0.0004884467,0.0019892035,0.0009193155,0.00016725781,0.00082545663,0.00085984654,0.11688267,0.0049897023,0.646446,0.13514392,0.09024902],"study_design_scores_gemma":[0.00011434283,0.000100485624,0.0010945349,0.00014923773,0.000045400273,0.00051169016,0.0006004145,0.14265828,0.002051571,0.83727014,0.015365117,0.000038657912],"about_ca_topic_score_codex":0.0036252595,"about_ca_topic_score_gemma":0.0042360323,"teacher_disagreement_score":0.018531386,"about_ca_system_score_codex":0.0016369442,"about_ca_system_score_gemma":0.001139376,"threshold_uncertainty_score":0.06199366},"labels":[],"label_agreement":null},{"id":"W2398039696","doi":"","title":"Nim On The Complete Graph.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.0595456025904787,"score_gpt":0.29611495193245335,"score_spread":0.23656934934197466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398039696","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14489487,0.0024788305,0.13706574,0.006297942,0.0011123881,0.00015286924,0.0025802122,0.0006546896,0.7047625],"genre_scores_gemma":[0.6522031,0.00318978,0.057705205,0.002330679,0.0012904208,0.00031926116,0.0035370395,0.0007530088,0.27867162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994436,0.00014481503,0.000015572514,0.00013891031,0.00014729712,0.000109769055],"domain_scores_gemma":[0.9989323,0.0003740794,0.000120767094,0.00019635138,0.00017049137,0.00020595903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039770643,0.0006128019,0.0007637252,0.0016296229,0.002105003,0.001883687,0.0011320582,0.0010698604,0.029573714],"category_scores_gemma":[0.002089002,0.00032004493,0.0007618379,0.0011889039,0.0013866216,0.004525232,0.0023963535,0.0018733026,0.0047289664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038797974,0.000025548377,0.00016617552,0.00009727363,0.000012807863,0.00009391757,0.00013083246,0.00093386206,0.00062610186,0.9675231,0.016534742,0.013816824],"study_design_scores_gemma":[0.000012316808,0.000009089305,0.00030702763,0.0000304558,0.000010554573,0.00011976443,0.000086517655,0.0031450186,0.00038820592,0.97430235,0.021581959,0.000006797882],"about_ca_topic_score_codex":0.0016250839,"about_ca_topic_score_gemma":0.0035771145,"teacher_disagreement_score":0.029573714,"about_ca_system_score_codex":0.0011510059,"about_ca_system_score_gemma":0.00062673335,"threshold_uncertainty_score":0.098933935},"labels":[],"label_agreement":null},{"id":"W2398042520","doi":"","title":"Bilateral And Bilinear Generating Functions For The Generalized Zernike Or Disc Polynomials.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Geophysics and Gravity Measurements","field":"Earth and Planetary Sciences","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Zernike polynomials; Bilinear interpolation; Pure mathematics; Algebra over a field; Statistics; Physics; Optics","score_opus":0.02635529286303342,"score_gpt":0.2258156368736477,"score_spread":0.19946034401061427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398042520","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20953622,0.0023315705,0.6352341,0.0031091715,0.00083753106,0.00014229781,0.0023092425,0.0006519396,0.1458479],"genre_scores_gemma":[0.85820216,0.0015916724,0.06612473,0.00070477225,0.0009574831,0.00017751943,0.0012661661,0.00034412186,0.070631355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934715,0.0001699444,0.000034645433,0.000101930906,0.00020884248,0.00013740535],"domain_scores_gemma":[0.9978265,0.0008395275,0.00032792214,0.00038494385,0.0003301756,0.00029082538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012627256,0.00065750047,0.000589878,0.001959164,0.0008642137,0.002009269,0.0007797836,0.0006843869,0.015944181],"category_scores_gemma":[0.0064173094,0.0002598743,0.00078112935,0.0012310329,0.0015047787,0.0034753822,0.0017278122,0.0015578284,0.0032547151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034613244,0.00001945356,0.0002042241,0.000023711915,0.000004480027,0.000058209072,0.00007222748,0.0010560863,0.0006059344,0.98220956,0.0023866778,0.013324922],"study_design_scores_gemma":[0.000013310433,0.000018344184,0.00029830507,0.000014319189,0.0000060665675,0.00020281176,0.00005490169,0.010881177,0.00063703995,0.98061407,0.007241131,0.00001842403],"about_ca_topic_score_codex":0.00081081985,"about_ca_topic_score_gemma":0.0010832703,"teacher_disagreement_score":0.015944181,"about_ca_system_score_codex":0.0008464238,"about_ca_system_score_gemma":0.00074215274,"threshold_uncertainty_score":0.053338587},"labels":[],"label_agreement":null},{"id":"W2398054659","doi":"","title":"Several q-series identities related to Jackson's.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Statistical Methods and Models","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Series (stratigraphy); Mathematics; Geology; Paleontology","score_opus":0.08067231772031098,"score_gpt":0.3624619313032811,"score_spread":0.2817896135829701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398054659","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064678974,0.0069803474,0.5235963,0.010620675,0.0025913245,0.00007841624,0.00058166316,0.00042219626,0.39045012],"genre_scores_gemma":[0.66515046,0.0070671784,0.12358252,0.006173298,0.0049957857,0.00019557762,0.00055814383,0.0005587104,0.19171834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916136,0.00031964981,0.0000472499,0.00015044755,0.00023501091,0.000086297274],"domain_scores_gemma":[0.9966846,0.0017342158,0.00033210777,0.00039517987,0.0005246563,0.00032919095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028923454,0.00063390733,0.0005573483,0.0019881204,0.0017318743,0.0018554925,0.0010335768,0.0012870934,0.014786094],"category_scores_gemma":[0.010628847,0.00027698642,0.0009715326,0.0017949569,0.0022032913,0.00508889,0.0017791222,0.002314712,0.0024949126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042225292,0.0000073244732,0.00010792508,0.00002146839,0.000003416356,0.000046920213,0.000085006424,0.00012862693,0.0001185731,0.99162394,0.0031127958,0.00473987],"study_design_scores_gemma":[0.000003463055,0.0000052101263,0.00017821114,0.000015592066,0.000005356707,0.00015549485,0.00003255081,0.0015799039,0.00012344077,0.98974484,0.008148063,0.000007999812],"about_ca_topic_score_codex":0.0009115887,"about_ca_topic_score_gemma":0.0012320229,"teacher_disagreement_score":0.014786094,"about_ca_system_score_codex":0.0010361667,"about_ca_system_score_gemma":0.0008161535,"threshold_uncertainty_score":0.049464405},"labels":[],"label_agreement":null},{"id":"W2398078061","doi":"","title":"Enumeration of Unicursal Planar Near-Triangulation.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Enumeration; Triangulation; Mathematics; Planar; Point set triangulation; Combinatorics; Geometry; Delaunay triangulation; Computer graphics (images); Computer science","score_opus":0.008333458813947,"score_gpt":0.23410433777493694,"score_spread":0.22577087896098993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398078061","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12948155,0.0008697196,0.72269857,0.00059285486,0.00024655755,0.0001833866,0.0014317901,0.001140677,0.14335497],"genre_scores_gemma":[0.54462826,0.0007674612,0.39079913,0.0002588811,0.0000869172,0.0001992661,0.0044160555,0.0005894077,0.058254562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993105,0.0001859888,0.000049357197,0.00009969239,0.00027292475,0.00008156366],"domain_scores_gemma":[0.99901617,0.00035932194,0.000074554664,0.0002518126,0.00021939745,0.00007877629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033804402,0.00036337247,0.00056603615,0.0012848795,0.0009693963,0.0014625626,0.0011212571,0.0006269478,0.016704869],"category_scores_gemma":[0.003393408,0.00032026714,0.00051117677,0.0013770944,0.0006937707,0.0019326222,0.0027353626,0.0008784102,0.003633129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018231527,0.00007999035,0.0014648404,0.00043243484,0.000029290508,0.00024216877,0.00039642397,0.019407496,0.0065605748,0.7133758,0.018632146,0.23919643],"study_design_scores_gemma":[0.0000328461,0.0000758434,0.0008749948,0.00015877452,0.000030272406,0.000846223,0.00053638377,0.12376835,0.007067243,0.798412,0.06816585,0.00003112583],"about_ca_topic_score_codex":0.00069451425,"about_ca_topic_score_gemma":0.0019346008,"teacher_disagreement_score":0.016704869,"about_ca_system_score_codex":0.00052283966,"about_ca_system_score_gemma":0.00037944497,"threshold_uncertainty_score":0.05588329},"labels":[],"label_agreement":null},{"id":"W2398092797","doi":"","title":"Genralized Padovan numbers, Perrin numbers and maximal k-indpendent sets in graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.048391099097639764,"score_gpt":0.296807774160971,"score_spread":0.2484166750633312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398092797","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44471115,0.0066658966,0.12553446,0.0044119162,0.0011767764,0.000066584944,0.000786676,0.00043629075,0.41621017],"genre_scores_gemma":[0.94333994,0.0015620776,0.019277042,0.0004993469,0.00031269717,0.000097820615,0.00033844792,0.00009243752,0.034480177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950755,0.00014802023,0.00002615674,0.00009640977,0.00010704623,0.0001147868],"domain_scores_gemma":[0.99897754,0.00048990035,0.00015170581,0.000112121656,0.00010615657,0.00016267867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005826995,0.00054615753,0.0005441969,0.0023753468,0.0020301822,0.0029087728,0.0009940151,0.0011794835,0.009065265],"category_scores_gemma":[0.003383613,0.00046910706,0.00057778246,0.0014199263,0.0035703767,0.004611629,0.0028233055,0.0021919413,0.0015556967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050304687,0.000009642063,0.00022686979,0.000048731683,0.0000059907647,0.000055107073,0.00011559638,0.001008693,0.00043097654,0.9894493,0.0020610802,0.006537568],"study_design_scores_gemma":[0.000010346628,0.00001210704,0.0002565847,0.0000262625,0.000008455599,0.0001535534,0.00010049976,0.0022212686,0.00064724736,0.9905951,0.0059556384,0.000012943071],"about_ca_topic_score_codex":0.000541409,"about_ca_topic_score_gemma":0.0008909523,"teacher_disagreement_score":0.009065265,"about_ca_system_score_codex":0.0010965724,"about_ca_system_score_gemma":0.00047433446,"threshold_uncertainty_score":0.030326366},"labels":[],"label_agreement":null},{"id":"W2398093189","doi":"","title":"Cubic symmetric graphs of order 4p 3 .","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Order (exchange); Combinatorics; Business","score_opus":0.004886694302722183,"score_gpt":0.18423432331513023,"score_spread":0.17934762901240806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398093189","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39176577,0.0010242916,0.08498331,0.0030642492,0.00061333424,0.00022935889,0.0039601475,0.0009527109,0.5134068],"genre_scores_gemma":[0.91398996,0.00040255729,0.018505875,0.0005288004,0.000118455835,0.00007333448,0.0013704037,0.00013172528,0.064878866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975055,0.000040617535,0.000007367806,0.00003705418,0.00008360424,0.00008082794],"domain_scores_gemma":[0.9993235,0.00018837037,0.00011312418,0.00012890056,0.00014899235,0.00009704672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014614017,0.00031287642,0.00031049442,0.0008883753,0.0010620184,0.0012094652,0.00056860165,0.0006215261,0.021297608],"category_scores_gemma":[0.0010349586,0.00020183112,0.0002773331,0.00088413706,0.00080193224,0.000903177,0.0008673275,0.0011457152,0.0019604426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019334443,0.000059372665,0.0005300529,0.00011675857,0.00001669171,0.00047515216,0.00018864403,0.0044424566,0.0068440707,0.9434799,0.01792461,0.025728885],"study_design_scores_gemma":[0.000060927232,0.00004362586,0.0014720655,0.000033262313,0.000015097859,0.0004554781,0.0002485325,0.0200603,0.005118717,0.93130934,0.041148983,0.00003356248],"about_ca_topic_score_codex":0.0067658885,"about_ca_topic_score_gemma":0.010981322,"teacher_disagreement_score":0.021297608,"about_ca_system_score_codex":0.0013620555,"about_ca_system_score_gemma":0.0014735423,"threshold_uncertainty_score":0.07124758},"labels":[],"label_agreement":null},{"id":"W2398093384","doi":"","title":"Decomposition of a 2K 10t into H 3 Graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Decomposition; Mathematics; Chemistry; Organic chemistry","score_opus":0.0036731793784347453,"score_gpt":0.19592764052687295,"score_spread":0.1922544611484382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398093384","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34709883,0.00050910946,0.22833139,0.0017533744,0.00068613014,0.00046296895,0.00412807,0.0012439701,0.41578615],"genre_scores_gemma":[0.7320511,0.0004456278,0.08403564,0.0007793961,0.000116005096,0.00022961255,0.0043195295,0.00050830445,0.17751487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999788,0.000033320874,0.0000069114153,0.00003928754,0.000051582443,0.0000809165],"domain_scores_gemma":[0.9996805,0.000057710913,0.000040349307,0.000056657544,0.000077776596,0.00008686483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012556431,0.00042775192,0.00026078522,0.00082927506,0.0009160309,0.0013595388,0.0005085904,0.0006770597,0.033626936],"category_scores_gemma":[0.00040113536,0.00019873523,0.0004932306,0.00059640605,0.0006982606,0.0008811728,0.0008427021,0.0007943461,0.00581523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005365469,0.00029504992,0.0013111515,0.0003174856,0.00005445342,0.0019081855,0.00093455147,0.013073452,0.04183308,0.83351696,0.037053823,0.0691654],"study_design_scores_gemma":[0.00009790735,0.0001438227,0.0039328053,0.000110572604,0.00004864877,0.0011194766,0.0012179784,0.03462512,0.011490663,0.84847564,0.0986966,0.00004082577],"about_ca_topic_score_codex":0.0027248156,"about_ca_topic_score_gemma":0.004363728,"teacher_disagreement_score":0.033626936,"about_ca_system_score_codex":0.00067554985,"about_ca_system_score_gemma":0.0006139811,"threshold_uncertainty_score":0.112493336},"labels":[],"label_agreement":null},{"id":"W2398122456","doi":"","title":"Two Results on the Hamiltonicity of L 1 -Graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.008586145487718907,"score_gpt":0.2003482098858403,"score_spread":0.19176206439812138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398122456","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12141726,0.0062730242,0.36573324,0.011051632,0.0016026789,0.00019577831,0.0014604224,0.00053344655,0.49173254],"genre_scores_gemma":[0.8775808,0.0039603747,0.04542082,0.0041690646,0.0016437661,0.0001923909,0.0010167602,0.00026223238,0.06575381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931276,0.00015227601,0.000029411889,0.00015459569,0.00019707765,0.00015385397],"domain_scores_gemma":[0.9952076,0.0028657683,0.0004618953,0.00052398676,0.00041878643,0.0005220121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006829238,0.00064465654,0.0005108146,0.002550432,0.0012431323,0.0020648353,0.001160392,0.0013793048,0.014840765],"category_scores_gemma":[0.0047028163,0.00045510393,0.0008574226,0.001673044,0.0025261154,0.0031334844,0.002218642,0.002334745,0.0016625323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004497007,0.000057580983,0.00051628065,0.00015323362,0.000015394908,0.00026636227,0.0003392037,0.0015267552,0.0020281037,0.9706768,0.009579006,0.01479626],"study_design_scores_gemma":[0.000027075233,0.000042421285,0.00086122786,0.00005973461,0.000024814704,0.0004613088,0.00021257342,0.0059130336,0.0021405073,0.97320807,0.01702171,0.000027503993],"about_ca_topic_score_codex":0.0014512609,"about_ca_topic_score_gemma":0.0021162683,"teacher_disagreement_score":0.014840765,"about_ca_system_score_codex":0.0013541585,"about_ca_system_score_gemma":0.00080645434,"threshold_uncertainty_score":0.04964727},"labels":[],"label_agreement":null},{"id":"W2398130560","doi":"","title":"Circular choosability of planar graphs with large girth.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Girth (graph theory); Combinatorics; Planar graph; Planar; Discrete mathematics; Graph; Computer science","score_opus":0.01550334629249169,"score_gpt":0.2148081304328552,"score_spread":0.1993047841403635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398130560","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7052078,0.00075999537,0.22930868,0.0009955884,0.0001266775,0.0001021605,0.0007029629,0.00059975934,0.0621963],"genre_scores_gemma":[0.9709892,0.0003180667,0.01961639,0.00011474221,0.000054676035,0.000053338,0.00063613977,0.00016113857,0.008056387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996511,0.00008373858,0.00001827649,0.00007604667,0.000091910704,0.00007901723],"domain_scores_gemma":[0.99659497,0.0021980344,0.00034399427,0.00050090626,0.00013056574,0.00023153938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036418208,0.00023867161,0.0003586243,0.00051908044,0.00054345594,0.0012275449,0.0009298367,0.00070851925,0.010802611],"category_scores_gemma":[0.004256054,0.00036343047,0.00036450024,0.00075085723,0.0010304742,0.0016476765,0.0013559568,0.0008361162,0.000878604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000766268,0.00014589124,0.0055371323,0.0004332115,0.00005409979,0.0010361545,0.0005636629,0.07773516,0.024835035,0.7674129,0.016081301,0.10539916],"study_design_scores_gemma":[0.00017337337,0.00014084579,0.0037812667,0.000062571926,0.000057042515,0.0010182724,0.0004836955,0.22174232,0.017722834,0.7434188,0.011354061,0.00004490746],"about_ca_topic_score_codex":0.000756316,"about_ca_topic_score_gemma":0.0010238703,"teacher_disagreement_score":0.010802611,"about_ca_system_score_codex":0.00050208205,"about_ca_system_score_gemma":0.0003682841,"threshold_uncertainty_score":0.036138296},"labels":[],"label_agreement":null},{"id":"W2398135063","doi":"","title":"Groups PSL(n, q) and 3-(v, k, 1) designs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"PSL; Mathematics; Pure mathematics; Combinatorics; Arithmetic","score_opus":0.00822638451153345,"score_gpt":0.18114899741027551,"score_spread":0.17292261289874206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398135063","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32403484,0.0016429003,0.3518389,0.0050891493,0.00067424454,0.00025677073,0.0011224343,0.0009736493,0.31436718],"genre_scores_gemma":[0.8972187,0.0004601767,0.050777197,0.0008692641,0.00020265965,0.00023271145,0.00038010412,0.00012584025,0.049733263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987717,0.00049729226,0.000050637966,0.00017302096,0.00022611665,0.0002812857],"domain_scores_gemma":[0.99774146,0.00088691496,0.00050776725,0.00039623945,0.0002709598,0.0001966522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010121169,0.0005491122,0.00037177032,0.00130605,0.0014874607,0.0024712698,0.00072517013,0.0011866812,0.013572647],"category_scores_gemma":[0.0033142115,0.00031303277,0.0005423028,0.00085619965,0.0017871114,0.0025372945,0.0016272097,0.001235376,0.0023587728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088890476,0.000024110073,0.00023358113,0.000033089946,0.000007845413,0.00011082946,0.00011516794,0.002065799,0.0009990332,0.98507255,0.0031303596,0.008118749],"study_design_scores_gemma":[0.000034978035,0.000031291733,0.00017276299,0.00003441769,0.000009559954,0.0001738918,0.00009587505,0.009154092,0.0009982558,0.97885084,0.010427486,0.000016504498],"about_ca_topic_score_codex":0.001167713,"about_ca_topic_score_gemma":0.0020089822,"teacher_disagreement_score":0.013572647,"about_ca_system_score_codex":0.0015980098,"about_ca_system_score_gemma":0.0012308682,"threshold_uncertainty_score":0.04540497},"labels":[],"label_agreement":null},{"id":"W2398153856","doi":"","title":"Enumeration of boundary cubic inner-forest maps.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Enumeration; Mathematics; Boundary (topology); Geometry; Combinatorics; Mathematical analysis","score_opus":0.009317883875871435,"score_gpt":0.21842341902447118,"score_spread":0.20910553514859975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398153856","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.387077,0.0011781841,0.42677903,0.0008152384,0.0001701088,0.00016113858,0.0050611775,0.0028434652,0.17591459],"genre_scores_gemma":[0.8247431,0.0004881235,0.13965407,0.00016006138,0.00006488334,0.000091114845,0.006637252,0.00053704705,0.02762431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945825,0.00008248915,0.00003129759,0.000093690214,0.00020851204,0.00012568141],"domain_scores_gemma":[0.9986053,0.00049643684,0.000098512784,0.00038062027,0.00028468375,0.0001344375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030277157,0.00035088672,0.000521382,0.0014578772,0.0011591678,0.0021159258,0.0008448645,0.0005240721,0.0114649],"category_scores_gemma":[0.0029225105,0.00027277754,0.00042020032,0.0019994332,0.0007468979,0.0024068865,0.0019635425,0.0009977838,0.0028020313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034824747,0.00015054007,0.0061262106,0.0004985461,0.000037899386,0.0004407663,0.0009073119,0.011782613,0.010997873,0.68203753,0.028445613,0.25822684],"study_design_scores_gemma":[0.00002769653,0.000042029904,0.0031241796,0.00010346482,0.00004186908,0.0009098086,0.00064194784,0.07577152,0.01285345,0.8450129,0.06143537,0.000035841087],"about_ca_topic_score_codex":0.0038300706,"about_ca_topic_score_gemma":0.0070399893,"teacher_disagreement_score":0.0114649,"about_ca_system_score_codex":0.00076886057,"about_ca_system_score_gemma":0.0007924307,"threshold_uncertainty_score":0.03835392},"labels":[],"label_agreement":null},{"id":"W2398165600","doi":"","title":"The Properties of Middle Digraphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.054802689121501914,"score_gpt":0.24679471781752144,"score_spread":0.19199202869601953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398165600","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20581134,0.00302742,0.3448037,0.00449942,0.00073703245,0.00019084952,0.0030656138,0.0011008501,0.43676376],"genre_scores_gemma":[0.89621246,0.0018305489,0.048934635,0.0012059849,0.0005033481,0.00017915948,0.002098983,0.000376956,0.048657984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915135,0.0001873721,0.000073368974,0.00026885854,0.0001555102,0.0001634365],"domain_scores_gemma":[0.99495935,0.0024402868,0.00047937824,0.0008287761,0.0005817013,0.0007104508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010718722,0.0004819163,0.0005384355,0.0027049903,0.0032991185,0.005062157,0.001006496,0.001118427,0.018122645],"category_scores_gemma":[0.0060598045,0.00064146164,0.00090041023,0.0020165683,0.002277764,0.01052,0.0024927515,0.0020891489,0.0033846581],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003873616,0.000024219653,0.00048986694,0.0000526737,0.0000117663685,0.00013339332,0.00031891183,0.0002509109,0.00077354576,0.9842002,0.0030768353,0.010628924],"study_design_scores_gemma":[0.000015655602,0.000015200147,0.000445092,0.000044095133,0.000024743505,0.00029538717,0.00023739101,0.0015025767,0.0010183274,0.9743197,0.022067904,0.000013883462],"about_ca_topic_score_codex":0.0019660064,"about_ca_topic_score_gemma":0.0024593007,"teacher_disagreement_score":0.018122645,"about_ca_system_score_codex":0.0014475646,"about_ca_system_score_gemma":0.0008393907,"threshold_uncertainty_score":0.06062627},"labels":[],"label_agreement":null},{"id":"W2398174111","doi":"","title":"Two kinds of equicoverable paths and cycles.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematics and Applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.057180420465827796,"score_gpt":0.3270239250205401,"score_spread":0.26984350455471234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398174111","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15510444,0.0029943401,0.2651227,0.0033073109,0.0010195404,0.00016312038,0.0016085592,0.000631053,0.5700489],"genre_scores_gemma":[0.8191562,0.0018511843,0.06235937,0.001539888,0.0002663574,0.00019907382,0.0014409779,0.000352538,0.11283444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989153,0.00017214613,0.000062934014,0.00032965347,0.00026694496,0.00025287826],"domain_scores_gemma":[0.99795604,0.0007737108,0.00018255133,0.00043247687,0.0003741212,0.00028113718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005092121,0.00055937044,0.00039206736,0.0016267427,0.0019857357,0.0029932472,0.001120133,0.0018446557,0.025266465],"category_scores_gemma":[0.0051228562,0.00055634306,0.0007507785,0.0019315373,0.0032352635,0.006900079,0.0036114273,0.0029359371,0.0017860349],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021635056,0.000008035551,0.00014466455,0.000024014214,0.000002834018,0.00009306467,0.00014749516,0.00016213284,0.0002321797,0.9915834,0.0015170731,0.006063511],"study_design_scores_gemma":[0.000012018151,0.000010180567,0.00018459791,0.000028990895,0.0000074453005,0.00027124694,0.00016654242,0.00070034544,0.00048611726,0.9768962,0.02122563,0.000010728035],"about_ca_topic_score_codex":0.0018064153,"about_ca_topic_score_gemma":0.0028170873,"teacher_disagreement_score":0.025266465,"about_ca_system_score_codex":0.0012962982,"about_ca_system_score_gemma":0.0007962374,"threshold_uncertainty_score":0.08452475},"labels":[],"label_agreement":null},{"id":"W2398177854","doi":"","title":"Composition Operators On The Fock Space Of Vector-Valued Analytic Functions.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Holomorphic and Operator Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fock space; Mathematics; Composition (language); Space (punctuation); Pure mathematics; Vector space; Algebra over a field; Computer science; Quantum mechanics; Physics","score_opus":0.04788452119305434,"score_gpt":0.26444853567713095,"score_spread":0.2165640144840766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398177854","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27952075,0.0025570842,0.39759684,0.0032981082,0.0011773794,0.00014375926,0.00075357733,0.00065677747,0.31429583],"genre_scores_gemma":[0.86894923,0.0015662243,0.053659886,0.00074909057,0.00076893345,0.00015368326,0.00056721794,0.00045766842,0.073128164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987947,0.00030345254,0.000055128694,0.00016083478,0.00042859835,0.00025730068],"domain_scores_gemma":[0.99883777,0.00034877722,0.00014555609,0.00019563826,0.00021399074,0.00025835112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015042408,0.0008119986,0.0008693198,0.0023092257,0.0022653437,0.0031556168,0.00097957,0.001314068,0.013329462],"category_scores_gemma":[0.0028315857,0.0004076178,0.00091225636,0.0013086562,0.0030613656,0.006773012,0.0024919002,0.0020132535,0.0026381414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075930716,0.000007727562,0.000031876632,0.000010835925,0.0000020032023,0.000025465994,0.000050790426,0.000111154746,0.00028847577,0.9970884,0.0005363589,0.0018393609],"study_design_scores_gemma":[0.000008401057,0.0000064621972,0.00007833503,0.00000878196,0.0000027271328,0.00009650355,0.000051149225,0.0022547457,0.00031993736,0.995093,0.002072851,0.000007033384],"about_ca_topic_score_codex":0.00070579693,"about_ca_topic_score_gemma":0.00060506276,"teacher_disagreement_score":0.013329462,"about_ca_system_score_codex":0.0011120135,"about_ca_system_score_gemma":0.00097507256,"threshold_uncertainty_score":0.044591546},"labels":[],"label_agreement":null},{"id":"W2398184112","doi":"","title":"Estimates of the choice numbers and the Ohba numbers of some complete multipartite graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Multipartite; Mathematics; Combinatorics; Graph; Integer (computer science); Discrete mathematics; Computer science; Physics","score_opus":0.042139634510755676,"score_gpt":0.2935929708367545,"score_spread":0.2514533363259988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398184112","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.563642,0.004607253,0.27623984,0.0026365041,0.0004887304,0.00013003257,0.0011581875,0.000551966,0.15054546],"genre_scores_gemma":[0.95811814,0.00099695,0.030362152,0.00016558077,0.00015562665,0.00015616827,0.00032143106,0.0001319117,0.009591882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992361,0.00019089667,0.000028414848,0.00012730692,0.0002743679,0.00014284607],"domain_scores_gemma":[0.9917848,0.0053990344,0.0007122995,0.0007002419,0.00058025797,0.000823329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015117682,0.0009045057,0.00044499798,0.0036954046,0.0012167385,0.0015118618,0.0010425071,0.0007641055,0.007039826],"category_scores_gemma":[0.00932131,0.00049777445,0.0006421167,0.001146357,0.0028063676,0.0046779974,0.001719148,0.0025643716,0.00068542507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023309565,0.00005523328,0.002033522,0.00022710547,0.000037195987,0.0001272903,0.00042068443,0.015742406,0.009662119,0.9533769,0.0036698119,0.014414593],"study_design_scores_gemma":[0.000020200983,0.000045595134,0.0026849373,0.00005754242,0.000027510227,0.00023728522,0.0002173895,0.037071772,0.0053619505,0.9479094,0.006313907,0.00005257135],"about_ca_topic_score_codex":0.00058581907,"about_ca_topic_score_gemma":0.0010118922,"teacher_disagreement_score":0.007039826,"about_ca_system_score_codex":0.001328748,"about_ca_system_score_gemma":0.00048987835,"threshold_uncertainty_score":0.02355051},"labels":[],"label_agreement":null},{"id":"W2398201724","doi":"","title":"Bijective proofs of the hook formula for rooted trees.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Molecular spectroscopy and chirality","field":"Chemistry","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematical proof; Hook; Mathematics; Bijection; Combinatorics; Geometry","score_opus":0.010125259197986784,"score_gpt":0.2537491054455692,"score_spread":0.24362384624758243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398201724","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0745137,0.004564839,0.54648566,0.005777688,0.0016770754,0.00009456537,0.0016939266,0.0014817403,0.3637108],"genre_scores_gemma":[0.8380921,0.0024979224,0.09789128,0.0021706328,0.0010570713,0.00018350601,0.0014232441,0.0010660982,0.055618137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856406,0.0003998059,0.0000924922,0.00016540081,0.0005788514,0.00019939315],"domain_scores_gemma":[0.9954091,0.002852241,0.00025425226,0.0006167131,0.0006410624,0.00022666584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013823786,0.00066517945,0.00072250614,0.0016788002,0.0024063417,0.003074633,0.0015130722,0.001360803,0.017714273],"category_scores_gemma":[0.007343838,0.0006414442,0.00111889,0.0014511518,0.002198263,0.008140417,0.003241405,0.0036645895,0.0031754877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009806246,0.000014215065,0.00006120663,0.00004744848,0.00000578876,0.00006090687,0.000112252994,0.00017109227,0.00038104897,0.9928227,0.0029142145,0.003399271],"study_design_scores_gemma":[0.0000092338905,0.0000045209904,0.00007968029,0.000021646536,0.00000729117,0.00010425216,0.000044563374,0.0011602297,0.00057335134,0.9915997,0.006385644,0.000009930923],"about_ca_topic_score_codex":0.0009927999,"about_ca_topic_score_gemma":0.0020756114,"teacher_disagreement_score":0.017714273,"about_ca_system_score_codex":0.0016035594,"about_ca_system_score_gemma":0.00082133693,"threshold_uncertainty_score":0.05926013},"labels":[],"label_agreement":null},{"id":"W2398209164","doi":"","title":"Erratum: Some 3x3 transformations formulas related to Bailey's 2x2 [ARS Comb. 78, 257-265 (2006)]","year":2006,"lang":"en","type":"erratum","venue":"Ars Combinatoria","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Applied mathematics; Mathematical economics","score_opus":0.01779697616352248,"score_gpt":0.28504210979185396,"score_spread":0.26724513362833147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398209164","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050943503,0.00825543,0.011250674,0.13442887,0.52800477,0.00011658125,0.0033527212,0.0013843501,0.3081122],"genre_scores_gemma":[0.07628769,0.009568036,0.017329548,0.056239698,0.051652934,0.00020422148,0.0041284505,0.0022512693,0.7823382],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984951,0.000264526,0.00018072236,0.00020514843,0.000719883,0.00013464976],"domain_scores_gemma":[0.9978853,0.00059180334,0.00017727561,0.00020128787,0.0010279715,0.000116388765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014068084,0.001677082,0.0011099735,0.0020087517,0.0048449314,0.0029774592,0.0022166881,0.0029582432,0.053571057],"category_scores_gemma":[0.009615399,0.00068255945,0.0012220955,0.0021064628,0.0024577782,0.0043816892,0.0013244414,0.006018425,0.021205181],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008154484,0.000020134028,0.000098592034,0.000121210265,0.000010767362,0.00035779167,0.00015065035,0.00013268627,0.00016675841,0.0580077,0.92750365,0.013348423],"study_design_scores_gemma":[0.00004937614,0.00004916188,0.0010978872,0.00021981889,0.000034959543,0.0009769667,0.00021869811,0.00062630186,0.0005936299,0.0647521,0.93132156,0.000059471982],"about_ca_topic_score_codex":0.00710559,"about_ca_topic_score_gemma":0.00975785,"teacher_disagreement_score":0.053571057,"about_ca_system_score_codex":0.003334561,"about_ca_system_score_gemma":0.0018419026,"threshold_uncertainty_score":0.17921305},"labels":[],"label_agreement":null},{"id":"W2398212301","doi":"","title":"Upper minus total domination of a 5-regular graph.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Graph; Domination analysis; Vertex (graph theory)","score_opus":0.00903967679747183,"score_gpt":0.2609612980069916,"score_spread":0.2519216212095198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398212301","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70564663,0.00053660234,0.03982624,0.0012979723,0.00012934774,0.000050283707,0.0013475426,0.00046284022,0.2507025],"genre_scores_gemma":[0.94099855,0.00029828958,0.0129432455,0.00026719054,0.000054987282,0.000050758503,0.00094551104,0.00015401532,0.04428756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945515,0.000090268695,0.000023076267,0.00011154023,0.00014073674,0.00017920634],"domain_scores_gemma":[0.9984666,0.00071612897,0.00016788131,0.00018249692,0.00019802545,0.000268846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040011777,0.00037170955,0.00045089607,0.0010618409,0.0014949598,0.0018883881,0.0008276398,0.0004943777,0.0145727005],"category_scores_gemma":[0.0015670947,0.00028159664,0.00045637507,0.00076003803,0.0010264516,0.0015932968,0.0011291471,0.00082991534,0.0015940139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005030356,0.000112798036,0.0033347812,0.00026669918,0.00007418855,0.0012409982,0.00086756056,0.0070972145,0.030856287,0.89957744,0.013112229,0.0429568],"study_design_scores_gemma":[0.00007749155,0.00010013072,0.006319555,0.0001291455,0.00014139438,0.002357014,0.00068907335,0.032896228,0.021482859,0.8946196,0.041137673,0.00004989627],"about_ca_topic_score_codex":0.002355177,"about_ca_topic_score_gemma":0.0044793836,"teacher_disagreement_score":0.0145727005,"about_ca_system_score_codex":0.00093410065,"about_ca_system_score_gemma":0.00043863914,"threshold_uncertainty_score":0.04875058},"labels":[],"label_agreement":null},{"id":"W2398218064","doi":"","title":"Degree Conditions for Graphs to Be Fractional k-Covered Graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Combinatorics; Discrete mathematics; Physics","score_opus":0.07189282429858324,"score_gpt":0.3360628955225094,"score_spread":0.26417007122392616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398218064","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7513747,0.0009433426,0.06627739,0.0044850027,0.0006778765,0.00016607612,0.00352047,0.0007496264,0.17180559],"genre_scores_gemma":[0.9810901,0.00044159216,0.0084901005,0.0005663689,0.0003131659,0.000094311814,0.0019879618,0.00011236372,0.0069041434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922836,0.0001422479,0.000055806584,0.00016461169,0.00015024444,0.00025868666],"domain_scores_gemma":[0.9949982,0.0028242914,0.00040885044,0.0003503729,0.00057109987,0.0008471282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007494232,0.0004243422,0.0005685981,0.0018534985,0.0017320093,0.0024376567,0.0007445006,0.0017320573,0.012773491],"category_scores_gemma":[0.008464808,0.0004720337,0.00075504935,0.0009240874,0.0016986867,0.0039783246,0.0020388328,0.0017780766,0.0018057035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047813714,0.00009469143,0.0034438877,0.00020050477,0.00003030702,0.0005822492,0.000732113,0.004659295,0.008606887,0.9587555,0.011577354,0.010839123],"study_design_scores_gemma":[0.00014843504,0.0000924702,0.0044568283,0.00011039532,0.000047294874,0.0010589267,0.0011615641,0.020829732,0.0064390968,0.95089257,0.014694768,0.000067838715],"about_ca_topic_score_codex":0.0014775954,"about_ca_topic_score_gemma":0.0017616416,"teacher_disagreement_score":0.012773491,"about_ca_system_score_codex":0.0010153136,"about_ca_system_score_gemma":0.000683476,"threshold_uncertainty_score":0.042731583},"labels":[],"label_agreement":null},{"id":"W2398219171","doi":"","title":"On γ-labeling the almost-bipartite graph P m +e.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Graph; Complete bipartite graph","score_opus":0.016405046276971185,"score_gpt":0.23665677844491684,"score_spread":0.22025173216794566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398219171","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28709152,0.0021098286,0.51741815,0.010512235,0.000509174,0.00022044849,0.003357528,0.0010749465,0.17770615],"genre_scores_gemma":[0.741929,0.0020065042,0.19266017,0.0025081316,0.000498447,0.00038227206,0.00378453,0.0005255805,0.05570542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989919,0.00038466713,0.000044627934,0.0002144919,0.00016027103,0.00020393272],"domain_scores_gemma":[0.99651825,0.0020778442,0.00032796385,0.00057990977,0.00020310246,0.00029290802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010351869,0.0006547718,0.00071794156,0.0011727739,0.0016684947,0.002431534,0.0014295774,0.0018817883,0.012188396],"category_scores_gemma":[0.0049996176,0.00046911105,0.000671544,0.0017994941,0.0020225903,0.0059391293,0.0032059907,0.0024672423,0.0019267519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014503472,0.0000759415,0.0007876029,0.00018288143,0.00002129252,0.00008306749,0.00024084057,0.0077998503,0.001371637,0.94423264,0.016236411,0.028822768],"study_design_scores_gemma":[0.000021569898,0.000017412718,0.00039633503,0.000038678914,0.000011541957,0.00011238674,0.00017149797,0.01753966,0.0006654672,0.97491735,0.0060958164,0.00001229989],"about_ca_topic_score_codex":0.0019173349,"about_ca_topic_score_gemma":0.0029056242,"teacher_disagreement_score":0.012188396,"about_ca_system_score_codex":0.0017435066,"about_ca_system_score_gemma":0.00084257685,"threshold_uncertainty_score":0.040774286},"labels":[],"label_agreement":null},{"id":"W2398226296","doi":"","title":"Semi-regular harmonic graph and equi-bipartite harmonic graph.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Complete bipartite graph; Edge-transitive graph; Graph; Combinatorics; Voltage graph; Discrete mathematics; Line graph","score_opus":0.02500176969467907,"score_gpt":0.27860292816519927,"score_spread":0.2536011584705202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398226296","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4329575,0.0014892844,0.27822348,0.0033237718,0.00055579003,0.00013151113,0.0016823265,0.0004372123,0.28119913],"genre_scores_gemma":[0.91527194,0.0008797345,0.033157676,0.00059391366,0.00035803832,0.000118436146,0.0011909938,0.000128956,0.04830032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962795,0.00009343992,0.000015778112,0.00010992068,0.0000911437,0.000061784114],"domain_scores_gemma":[0.99867296,0.0005021218,0.00024078149,0.00016205019,0.00020413376,0.00021785035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034485583,0.00031309246,0.0004607552,0.0013074428,0.0011353921,0.0013406159,0.00092190213,0.0008261852,0.013140328],"category_scores_gemma":[0.0025687292,0.0002542587,0.00037574276,0.0009795121,0.0015036574,0.0027914643,0.0014168695,0.0011240302,0.0016877789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027910231,0.000017429835,0.00026498173,0.000049161255,0.000007414634,0.000094439805,0.00014537605,0.000921898,0.0007327556,0.9838524,0.0035521886,0.01033394],"study_design_scores_gemma":[0.000008421726,0.000011772914,0.00046784605,0.0000141907185,0.000009720479,0.00031828717,0.00019119652,0.00952868,0.00046089088,0.98127717,0.0077017453,0.000009950901],"about_ca_topic_score_codex":0.000823352,"about_ca_topic_score_gemma":0.0009294545,"teacher_disagreement_score":0.013140328,"about_ca_system_score_codex":0.0006250633,"about_ca_system_score_gemma":0.00030980844,"threshold_uncertainty_score":0.043958724},"labels":[],"label_agreement":null},{"id":"W2398228207","doi":"","title":"Isoperimetric Edge Connectivity of Line Graphs and Path Graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Isoperimetric inequality; Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Path (computing); Line (geometry); 1-planar graph; Isoperimetric dimension; Line graph; Graph; Computer science; Geometry; Computer network; Artificial intelligence","score_opus":0.02394016829283598,"score_gpt":0.22457008816374205,"score_spread":0.20062991987090606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398228207","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4924249,0.004761713,0.36050174,0.006903825,0.0003243478,0.00015363208,0.0036865443,0.0006316655,0.13061163],"genre_scores_gemma":[0.92029494,0.0023346103,0.060194597,0.00054470904,0.0005097955,0.00017427656,0.0026727873,0.00017502859,0.013099326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867874,0.000492828,0.00007345376,0.00031193724,0.00029691376,0.0001461124],"domain_scores_gemma":[0.9895181,0.007080498,0.0013303545,0.00081119535,0.00061470893,0.00064512645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011317311,0.000595198,0.0007274502,0.0030141326,0.001538495,0.0033560744,0.001787331,0.002015513,0.009253742],"category_scores_gemma":[0.011614833,0.00072153425,0.00058840576,0.0033711498,0.0020991117,0.009800197,0.002184829,0.0027390916,0.0010456084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010808954,0.00006875689,0.0024659145,0.00019679435,0.000031061107,0.00014893302,0.0002838055,0.008150542,0.0012022486,0.9501338,0.007878113,0.029331937],"study_design_scores_gemma":[0.000021414065,0.000025645857,0.0016449767,0.00004739252,0.000024605868,0.00041775103,0.00025612483,0.02826661,0.0011132634,0.9609429,0.00722081,0.000018471912],"about_ca_topic_score_codex":0.0011326089,"about_ca_topic_score_gemma":0.0011246937,"teacher_disagreement_score":0.009253742,"about_ca_system_score_codex":0.001172809,"about_ca_system_score_gemma":0.0004297843,"threshold_uncertainty_score":0.030956864},"labels":[],"label_agreement":null},{"id":"W2398255516","doi":"","title":"HIGH ORDER DERIVATIVES AND TWO q-IDENTITIES RELATED TO PRODINGER'S FORMULA","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Order (exchange); Pure mathematics; Business","score_opus":0.01849092649665718,"score_gpt":0.294740387397923,"score_spread":0.27624946090126584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398255516","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41613173,0.005033902,0.28068486,0.005934583,0.0039211134,0.000108480686,0.00039918246,0.0007302544,0.28705597],"genre_scores_gemma":[0.9037252,0.001969114,0.04849797,0.001409258,0.0012499571,0.000076515134,0.00020065242,0.00015542761,0.042715944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996846,0.00006622032,0.000026433632,0.000058496327,0.00009996529,0.000064297135],"domain_scores_gemma":[0.9995535,0.00010757618,0.000056392957,0.00009103501,0.000086356165,0.00010510071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007180171,0.00061301485,0.00073430163,0.0016471541,0.001896495,0.0018950062,0.0010496855,0.0014251466,0.0033766816],"category_scores_gemma":[0.001763631,0.0002810018,0.0010139341,0.0011032721,0.0029583795,0.0033222828,0.0019214756,0.0024905838,0.0007893716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000100015595,0.000009756093,0.00011256971,0.000018076336,0.000002079662,0.00025146233,0.00010037952,0.00017637292,0.0007725722,0.9943211,0.0008106562,0.0034150444],"study_design_scores_gemma":[0.0000097158745,0.000014156211,0.000211174,0.000013360844,0.0000063312664,0.0005428926,0.000048764858,0.0033063695,0.00085586787,0.98979527,0.0051779645,0.000018171093],"about_ca_topic_score_codex":0.0011672627,"about_ca_topic_score_gemma":0.0009133609,"teacher_disagreement_score":0.0033766816,"about_ca_system_score_codex":0.0010710235,"about_ca_system_score_gemma":0.0006710533,"threshold_uncertainty_score":0.011296153},"labels":[],"label_agreement":null},{"id":"W2398257445","doi":"","title":"A few remarks on avoiding partial Latin squares.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Latin square; Applied mathematics; Food science; Chemistry","score_opus":0.011283151182518117,"score_gpt":0.2115824820747736,"score_spread":0.2002993308922555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398257445","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013431662,0.017831564,0.13597788,0.13392515,0.036404364,0.00015862403,0.000990051,0.0007910451,0.6604897],"genre_scores_gemma":[0.32822767,0.031694222,0.13740377,0.15486528,0.03418561,0.0006539346,0.0012148517,0.0011214791,0.31063312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987852,0.00038879228,0.000051975545,0.00021911299,0.0004053287,0.00014963812],"domain_scores_gemma":[0.99812907,0.0010038072,0.00012317456,0.0002780805,0.00033094003,0.0001350105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012834405,0.00087827205,0.00068385486,0.0011103172,0.0023770086,0.002315114,0.002063968,0.0024405108,0.03537612],"category_scores_gemma":[0.0053806975,0.00031250916,0.0007912212,0.0010721786,0.0038773958,0.005660238,0.0022547578,0.0047296686,0.0075600813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006697417,0.00004344166,0.00032536383,0.00031580124,0.000029011033,0.0005450622,0.00029171878,0.0011108887,0.0013140267,0.8708547,0.105319135,0.019783987],"study_design_scores_gemma":[0.00001517768,0.00004247574,0.00052132,0.00010622536,0.000010301799,0.00040365977,0.00032285732,0.00082021055,0.00067083596,0.7918822,0.2051801,0.000024667945],"about_ca_topic_score_codex":0.0019249878,"about_ca_topic_score_gemma":0.00236825,"teacher_disagreement_score":0.03537612,"about_ca_system_score_codex":0.000916711,"about_ca_system_score_gemma":0.00041587476,"threshold_uncertainty_score":0.11834496},"labels":[],"label_agreement":null},{"id":"W2398261455","doi":"","title":"External Difference Families from Lines.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.009811967081191527,"score_gpt":0.22997194961560655,"score_spread":0.22015998253441502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398261455","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070917204,0.0018082107,0.4825141,0.002095858,0.0012225471,0.000099382334,0.0013688882,0.0016092707,0.4383646],"genre_scores_gemma":[0.7214406,0.0013906228,0.0980342,0.0013949344,0.00085655245,0.00015598488,0.0022170714,0.0012650999,0.17324483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989272,0.00028450348,0.00007289901,0.00024936727,0.0003328623,0.00013316466],"domain_scores_gemma":[0.99867564,0.00040936962,0.00012633027,0.0003007054,0.0003375757,0.00015028297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009782107,0.0005243191,0.00046950945,0.0018252964,0.0014806293,0.0028374349,0.0008828196,0.0007375899,0.02338054],"category_scores_gemma":[0.0028607068,0.00037941727,0.00072244555,0.0012731896,0.002288746,0.0075759003,0.0033752054,0.0024022597,0.0053636907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027652943,0.000012179595,0.00015035499,0.000035747227,0.000004885603,0.000065345215,0.00018821206,0.00012604476,0.00051352865,0.98233634,0.0036314062,0.012908354],"study_design_scores_gemma":[0.00001522865,0.000014871666,0.00014375572,0.00002852718,0.000009669714,0.00033598542,0.00013628272,0.00086203596,0.0017308949,0.93515015,0.061561108,0.000011512467],"about_ca_topic_score_codex":0.00036946405,"about_ca_topic_score_gemma":0.0005014753,"teacher_disagreement_score":0.02338054,"about_ca_system_score_codex":0.0010304084,"about_ca_system_score_gemma":0.00037413236,"threshold_uncertainty_score":0.07821572},"labels":[],"label_agreement":null},{"id":"W2398284551","doi":"","title":"On The Energy Of 3-Circulant Graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Circulant matrix; Mathematics; Energy (signal processing); Combinatorics; Statistics","score_opus":0.020081729769971135,"score_gpt":0.2460463901696723,"score_spread":0.22596466039970117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398284551","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38636708,0.014446283,0.20053692,0.009915121,0.0025864027,0.000051036106,0.0008724898,0.00037949334,0.38484517],"genre_scores_gemma":[0.9410121,0.003598648,0.015073424,0.0012517055,0.0010176449,0.00007668612,0.00037920248,0.00027113614,0.037319448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996511,0.00009969993,0.000011433449,0.000048269845,0.00011500107,0.00007456378],"domain_scores_gemma":[0.99890304,0.00058273267,0.00012280131,0.00011813472,0.00012736587,0.0001459448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005253672,0.000640977,0.00067295413,0.0024755723,0.0011276819,0.0015535569,0.0011079282,0.0018196651,0.010262396],"category_scores_gemma":[0.0031748775,0.0003365122,0.00039393312,0.0011677626,0.002320484,0.0028916674,0.0015087388,0.0018601958,0.0017253762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013793986,0.00001102038,0.00012061525,0.000036824746,0.000005745699,0.000042205207,0.000055689994,0.002314659,0.0005891015,0.98895746,0.0030895676,0.0047633904],"study_design_scores_gemma":[0.0000034443024,0.000003865434,0.00016283423,0.00001704248,0.0000020552457,0.000054132328,0.00003576864,0.007993452,0.00012500053,0.989817,0.0017794144,0.0000059371787],"about_ca_topic_score_codex":0.0009977225,"about_ca_topic_score_gemma":0.0014980236,"teacher_disagreement_score":0.010262396,"about_ca_system_score_codex":0.00086611963,"about_ca_system_score_gemma":0.0003242086,"threshold_uncertainty_score":0.034331143},"labels":[],"label_agreement":null},{"id":"W2398356067","doi":"","title":"Two classes of cyclic frames from finite geometries.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.04198457142319623,"score_gpt":0.31928335144258424,"score_spread":0.277298780019388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398356067","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.353918,0.003593516,0.15403634,0.0057140505,0.0015368207,0.00016663308,0.0019157211,0.00062838645,0.47849053],"genre_scores_gemma":[0.93544275,0.00091095915,0.01985212,0.0008516493,0.0006800202,0.00014958055,0.0015019027,0.00016947014,0.04044154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897635,0.00021052461,0.000052279425,0.00023930232,0.00024992976,0.00027162782],"domain_scores_gemma":[0.99852484,0.0005145764,0.00020106758,0.00022310512,0.00017390813,0.00036255072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006480567,0.00065473595,0.00050623383,0.0023744395,0.0018196495,0.0035929522,0.0008644134,0.0015722864,0.016936557],"category_scores_gemma":[0.0027373142,0.0003914452,0.00079179293,0.0012946633,0.0040529747,0.0052655204,0.0029809636,0.0021405434,0.0013741736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001214341,0.000006267295,0.000080169055,0.000010616062,0.000001341491,0.000054830845,0.00015506918,0.000042537366,0.00014452632,0.9962684,0.0009050313,0.0023189757],"study_design_scores_gemma":[0.000019279485,0.000020813119,0.000402343,0.000029489272,0.0000064447445,0.0002902144,0.00024640746,0.00063297193,0.00037034813,0.97987044,0.018093884,0.000017359986],"about_ca_topic_score_codex":0.0014581243,"about_ca_topic_score_gemma":0.0012739252,"teacher_disagreement_score":0.016936557,"about_ca_system_score_codex":0.0015892772,"about_ca_system_score_gemma":0.0006828503,"threshold_uncertainty_score":0.056658447},"labels":[],"label_agreement":null},{"id":"W2398362256","doi":"","title":"On the second largest scrambling index of primitive matrices.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Scrambling; Mathematics; Index (typography); Statistics; Algorithm; Computer science","score_opus":0.008639637835356645,"score_gpt":0.24899337709101377,"score_spread":0.24035373925565712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398362256","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22398792,0.0070235473,0.39850524,0.0033638794,0.002543537,0.000118267686,0.000803889,0.0011290581,0.36252463],"genre_scores_gemma":[0.89504015,0.0026390955,0.063969865,0.001086451,0.00153201,0.00016570151,0.00047477044,0.00057654356,0.034515414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905974,0.0002314999,0.000053958374,0.00013455616,0.0003223909,0.00019784304],"domain_scores_gemma":[0.9957587,0.001886561,0.00048866495,0.00075734133,0.0006754862,0.0004331842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010049084,0.0008345457,0.00064309017,0.0026811042,0.0014141524,0.0025640188,0.00094970374,0.0012999895,0.009632579],"category_scores_gemma":[0.008149836,0.00038117796,0.00041478363,0.0011374896,0.0026052005,0.0037921453,0.001968567,0.0024820738,0.0034052394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010490641,0.000024691995,0.00028004483,0.00007079785,0.000006324898,0.00014481446,0.00014928021,0.0017508729,0.0038065286,0.97359324,0.0051626605,0.014905843],"study_design_scores_gemma":[0.000016336144,0.00004414403,0.0004350111,0.000104158265,0.000010331326,0.00043256598,0.00008861794,0.020510998,0.004323081,0.9643417,0.009644934,0.00004810411],"about_ca_topic_score_codex":0.00070574216,"about_ca_topic_score_gemma":0.0010851072,"teacher_disagreement_score":0.009632579,"about_ca_system_score_codex":0.000852665,"about_ca_system_score_gemma":0.0008446283,"threshold_uncertainty_score":0.032224238},"labels":[],"label_agreement":null},{"id":"W2398376000","doi":"","title":"A note on the LEL-equienergetic graphs","year":2014,"lang":"es","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics; Eigenvalues and eigenvectors","score_opus":0.016671470542905343,"score_gpt":0.2666490869492172,"score_spread":0.24997761640631183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398376000","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47003862,0.01936614,0.18952638,0.010946276,0.0025147453,0.00009323073,0.00062878255,0.0004467794,0.3064391],"genre_scores_gemma":[0.90818155,0.008000458,0.057170406,0.0017440425,0.0021659902,0.000077683086,0.00053469505,0.00013871348,0.021986397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959666,0.000097251344,0.000026137926,0.00011654413,0.0001073793,0.00005615774],"domain_scores_gemma":[0.99866843,0.0007419307,0.00014750523,0.00015160623,0.00016257142,0.0001279557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055114616,0.0004230941,0.00044248748,0.0015518182,0.0012538466,0.0010085573,0.0007139144,0.00076834013,0.0036350607],"category_scores_gemma":[0.0021730382,0.00024805905,0.00026278695,0.0012501492,0.0018423926,0.002468118,0.001104674,0.0021560686,0.0005438482],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009527764,0.00005244017,0.0014352945,0.00023938795,0.000012833955,0.0006216527,0.00047099442,0.0023767946,0.0033182488,0.9277297,0.008064971,0.055582467],"study_design_scores_gemma":[0.000014005813,0.00009768765,0.0019579683,0.00005925016,0.00002481665,0.0015798127,0.0002956082,0.009272921,0.0028833982,0.9196085,0.06417381,0.000032165186],"about_ca_topic_score_codex":0.00049781386,"about_ca_topic_score_gemma":0.0006066883,"teacher_disagreement_score":0.0036350607,"about_ca_system_score_codex":0.0005802098,"about_ca_system_score_gemma":0.00019516284,"threshold_uncertainty_score":0.01216042},"labels":[],"label_agreement":null},{"id":"W2398394717","doi":"","title":"On Maximum Merrifield-Simmons Index of Unicyclic Graphs with Prescribed Pendent Vertices.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Combinatorics; Discrete mathematics; Computer science; World Wide Web","score_opus":0.03815823998358468,"score_gpt":0.26338456369090923,"score_spread":0.22522632370732454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398394717","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7498806,0.0039853095,0.06536681,0.0022579606,0.00040001786,0.00008742244,0.0013383474,0.0003806762,0.17630282],"genre_scores_gemma":[0.98118824,0.0011151145,0.009833051,0.00016876752,0.00019305681,0.00006107274,0.00038521382,0.00007555139,0.0069798897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948835,0.00014740798,0.00002697999,0.000088937355,0.00013602647,0.000112323396],"domain_scores_gemma":[0.9955531,0.0025624593,0.00061890675,0.00032500003,0.0003569468,0.00058356073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095741526,0.0004977785,0.0008600967,0.0028827225,0.0012825455,0.0018594672,0.0013187238,0.0010429785,0.00753187],"category_scores_gemma":[0.007782606,0.0003089404,0.00033680283,0.0018737476,0.0014234057,0.0033437635,0.0012519391,0.0011586689,0.00094280636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000531349,0.00007618339,0.0027044902,0.00026548302,0.00003319698,0.00020033213,0.0005733914,0.010234433,0.0065223356,0.9352765,0.010164856,0.033417452],"study_design_scores_gemma":[0.000073995325,0.000099863355,0.0021862194,0.00009426242,0.00003857043,0.0004900415,0.00030915122,0.03640234,0.004958969,0.9461765,0.009126666,0.000043390184],"about_ca_topic_score_codex":0.0006972794,"about_ca_topic_score_gemma":0.001315978,"teacher_disagreement_score":0.00753187,"about_ca_system_score_codex":0.0016468014,"about_ca_system_score_gemma":0.00058078516,"threshold_uncertainty_score":0.025196671},"labels":[],"label_agreement":null},{"id":"W2398398884","doi":"","title":"The Basis Number of the Cartesian Product of Different Ladders.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematics and Applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Mathematics; Basis (linear algebra); Product (mathematics); Arithmetic; Combinatorics; Geometry","score_opus":0.03886293664219641,"score_gpt":0.27857643818332817,"score_spread":0.23971350154113175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398398884","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40038735,0.0021772934,0.23033004,0.002638985,0.0034123247,0.00012151638,0.0021852138,0.0014870653,0.3572603],"genre_scores_gemma":[0.87324566,0.0010589882,0.054656904,0.0005268967,0.00043128748,0.000117854586,0.0010018873,0.0005542934,0.06840629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990024,0.0002263579,0.00006710285,0.00020780881,0.00023008526,0.0002663363],"domain_scores_gemma":[0.9986382,0.0002652354,0.00013713592,0.00024441225,0.00038738758,0.0003276329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007777728,0.00061940996,0.00078929187,0.002493961,0.0023536673,0.0035939491,0.0009924273,0.0011896486,0.018942656],"category_scores_gemma":[0.002636671,0.00041499364,0.0006235618,0.0012094502,0.0025680242,0.0037846535,0.0024399164,0.0023209443,0.007161788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016795902,0.000033088076,0.00062534935,0.00007119141,0.000015243939,0.000092773735,0.00020773408,0.00034139724,0.0041538123,0.9698547,0.0048639346,0.019572807],"study_design_scores_gemma":[0.000030114968,0.0000808889,0.0013652554,0.00010905634,0.000031002783,0.0006390212,0.00025383505,0.0031214536,0.0073142955,0.95233387,0.03466569,0.00005540279],"about_ca_topic_score_codex":0.0010189251,"about_ca_topic_score_gemma":0.001269951,"teacher_disagreement_score":0.018942656,"about_ca_system_score_codex":0.0009047803,"about_ca_system_score_gemma":0.0008984203,"threshold_uncertainty_score":0.06336951},"labels":[],"label_agreement":null},{"id":"W2398402683","doi":"","title":"The γ-spectrum of a graph","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectrum (functional analysis); Graph; Combinatorics; Physics","score_opus":0.03627350356025675,"score_gpt":0.2660037752074153,"score_spread":0.22973027164715856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398402683","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6025614,0.0023043256,0.15111995,0.0061322227,0.0007972134,0.00007632933,0.00086768455,0.0004426153,0.23569827],"genre_scores_gemma":[0.95908594,0.0011727303,0.015361949,0.00077960367,0.00048801053,0.00012008883,0.00035155914,0.00013844672,0.022501636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993185,0.00017836773,0.000033478525,0.00020135408,0.00014281004,0.00012545823],"domain_scores_gemma":[0.99898726,0.0004273118,0.00013852325,0.00009178207,0.00013890967,0.00021630536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006652216,0.000983843,0.000725015,0.005121056,0.0021325955,0.0037381682,0.0009966267,0.0014617069,0.007982714],"category_scores_gemma":[0.0015577541,0.00055102294,0.0006716349,0.002206002,0.004401571,0.0043598874,0.0019036878,0.0019685323,0.0010831924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011636318,0.00000521766,0.00007505822,0.00001271469,0.0000033918595,0.00004747738,0.00019142365,0.00022104642,0.00061976415,0.99650455,0.00057244685,0.0017351795],"study_design_scores_gemma":[0.000006889352,0.0000060623875,0.00012050168,0.000016377548,0.000004344289,0.0000949095,0.00011773541,0.0013036411,0.00017384425,0.9959502,0.0021987276,0.000006701644],"about_ca_topic_score_codex":0.0012045709,"about_ca_topic_score_gemma":0.00065154233,"teacher_disagreement_score":0.007982714,"about_ca_system_score_codex":0.0010853455,"about_ca_system_score_gemma":0.00045411263,"threshold_uncertainty_score":0.026704788},"labels":[],"label_agreement":null},{"id":"W2398403419","doi":"","title":"On Cordial Labelings of Fans with Other Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.0105353042278856,"score_gpt":0.21895100019155925,"score_spread":0.20841569596367365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398403419","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22587845,0.003370051,0.44827425,0.007285217,0.0007955164,0.00021787891,0.0018486128,0.0018439431,0.31048605],"genre_scores_gemma":[0.7323049,0.0021490396,0.18533306,0.0018757756,0.00073300314,0.00031015792,0.0024023007,0.0007964709,0.07409527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855465,0.0005786042,0.00008486818,0.00031893855,0.00023410073,0.00022880214],"domain_scores_gemma":[0.993905,0.0036750464,0.00049576635,0.0009927425,0.00037296285,0.00055849465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016088424,0.00077206315,0.0008211722,0.002110254,0.0029376126,0.0031806629,0.0016710343,0.0016461406,0.017972974],"category_scores_gemma":[0.008591035,0.0006409575,0.0010947551,0.0026783783,0.0031220794,0.009464018,0.0033841613,0.002962488,0.0021626553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004723499,0.000038391012,0.0004409431,0.00006601754,0.0000067607434,0.000049107723,0.00018927162,0.0020463094,0.000354519,0.9725214,0.0069358284,0.017304162],"study_design_scores_gemma":[0.000014644853,0.000011066635,0.00024473682,0.0000401045,0.000008285737,0.00011696207,0.00013502174,0.009153978,0.00044471657,0.97839534,0.0114251785,0.000009965659],"about_ca_topic_score_codex":0.0028903603,"about_ca_topic_score_gemma":0.004337583,"teacher_disagreement_score":0.017972974,"about_ca_system_score_codex":0.0025636982,"about_ca_system_score_gemma":0.000733684,"threshold_uncertainty_score":0.06012559},"labels":[],"label_agreement":null},{"id":"W2398405652","doi":"","title":"The yin-yang structure of the affine plane of order four.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Affine transformation; Affine plane (incidence geometry); Order (exchange); Plane (geometry); Pure mathematics; Mathematics Subject Classification; Set (abstract data type); Combinatorics; Algebra over a field; Geometry; Computer science","score_opus":0.02650587862910399,"score_gpt":0.2766599402856064,"score_spread":0.25015406165650245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398405652","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56926614,0.0019265692,0.09728246,0.0014723853,0.00045531598,0.00007110527,0.00029864747,0.00027229104,0.32895514],"genre_scores_gemma":[0.96588635,0.00056119164,0.013363353,0.00013709065,0.00009529968,0.000035126697,0.00014086784,0.000047948626,0.019732699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998665,0.000025978905,0.0000048114834,0.00002296361,0.000038816026,0.00004094292],"domain_scores_gemma":[0.99985766,0.000023084325,0.000041187872,0.000021587088,0.000023130782,0.000033299304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014993816,0.00042358565,0.00022116194,0.00077180716,0.0010815252,0.0013326699,0.00039233192,0.00036455062,0.0083595365],"category_scores_gemma":[0.00044731988,0.00014264593,0.00025206438,0.00047708445,0.0017583853,0.001661503,0.0010141719,0.001008173,0.0011369013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025031057,0.000004492223,0.00023146046,0.000021156542,0.000002930377,0.00009103096,0.00013877296,0.00037403594,0.0023428814,0.9922444,0.00053797645,0.003985755],"study_design_scores_gemma":[0.000017460716,0.00005094267,0.00074738835,0.000018030809,0.000007804799,0.0004124069,0.0003049878,0.0033721859,0.0033295834,0.9775274,0.014196491,0.000015394324],"about_ca_topic_score_codex":0.0008353824,"about_ca_topic_score_gemma":0.0007610455,"teacher_disagreement_score":0.0083595365,"about_ca_system_score_codex":0.0004719322,"about_ca_system_score_gemma":0.0003573336,"threshold_uncertainty_score":0.027965367},"labels":[],"label_agreement":null},{"id":"W2398413913","doi":"","title":"Graphs with unique minimum paired-dominating set.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dominating set; Combinatorics; Graph; Vertex (graph theory)","score_opus":0.03007709096057041,"score_gpt":0.28281345778187844,"score_spread":0.252736366821308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398413913","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3805305,0.0032734382,0.3773108,0.005011198,0.0012620752,0.00046521475,0.012403574,0.0018334922,0.21790965],"genre_scores_gemma":[0.803466,0.0013588389,0.16172528,0.00093805365,0.00030222192,0.00027086915,0.005387485,0.0003409442,0.02621038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989569,0.00026156436,0.00005730347,0.0003535882,0.00019977943,0.00017081751],"domain_scores_gemma":[0.99724376,0.0010944558,0.00038018834,0.00044423665,0.00038678694,0.00045055704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006552075,0.0009819822,0.0014636152,0.0014164074,0.0020855663,0.0029609038,0.0017805396,0.0015596627,0.012127137],"category_scores_gemma":[0.004519848,0.0007618803,0.0009218064,0.0014865014,0.0010533093,0.004005896,0.0026422648,0.0018144015,0.002521387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000910844,0.00033466608,0.00308538,0.002051913,0.00035687044,0.0015413046,0.00068094424,0.017507473,0.019738372,0.79139775,0.054867204,0.10752732],"study_design_scores_gemma":[0.00013895564,0.00018804391,0.0020470242,0.00023096973,0.00024549934,0.0035246552,0.0005699523,0.029810525,0.013024255,0.91319096,0.03696502,0.00006405704],"about_ca_topic_score_codex":0.0003781242,"about_ca_topic_score_gemma":0.0007980258,"teacher_disagreement_score":0.012127137,"about_ca_system_score_codex":0.0008982136,"about_ca_system_score_gemma":0.00089697645,"threshold_uncertainty_score":0.040569305},"labels":[],"label_agreement":null},{"id":"W2398470855","doi":"","title":"An algorithm for hamiltonian cycles under implicit degree conditions.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Algorithm; Hamiltonian (control theory); Applied mathematics; Mathematical optimization; Physics; Acoustics","score_opus":0.052558205751225356,"score_gpt":0.3425944378369629,"score_spread":0.2900362320857376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398470855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044074662,0.00066176493,0.8968294,0.0011673813,0.00037250752,0.0009739367,0.0018016768,0.008382883,0.045735806],"genre_scores_gemma":[0.24484877,0.00043185582,0.72610986,0.00040201974,0.0001475835,0.000705499,0.0043842145,0.0014468682,0.021523342],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991159,0.00015417217,0.00008299232,0.00019660297,0.00027787322,0.00017248953],"domain_scores_gemma":[0.9975931,0.0010087598,0.000107361295,0.00073041196,0.0004226639,0.00013763277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007615453,0.0010436693,0.0010023157,0.0013523,0.001286298,0.0020051454,0.0024714025,0.0016203884,0.024209091],"category_scores_gemma":[0.005591844,0.0007363489,0.0010273008,0.001786546,0.0008587644,0.004210139,0.004704526,0.002063365,0.0062408717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000790848,0.00061523705,0.0012229995,0.00088907505,0.00013291236,0.0003866921,0.0006544809,0.02024395,0.014946284,0.22234464,0.06140619,0.6763666],"study_design_scores_gemma":[0.00063414924,0.00026213497,0.0008478655,0.00020267758,0.00017609,0.00072831876,0.0005046331,0.18740247,0.016779395,0.7344586,0.05790668,0.000097108416],"about_ca_topic_score_codex":0.0024902106,"about_ca_topic_score_gemma":0.0047378778,"teacher_disagreement_score":0.024209091,"about_ca_system_score_codex":0.0011806733,"about_ca_system_score_gemma":0.002163706,"threshold_uncertainty_score":0.08098745},"labels":[],"label_agreement":null},{"id":"W2398472485","doi":"","title":"An improved Fan-Type degree condition for k-linked graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Type (biology); Combinatorics; Discrete mathematics; Physics; Geology; Acoustics","score_opus":0.05574007086007631,"score_gpt":0.3344517595222207,"score_spread":0.2787116886621444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398472485","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22268175,0.0012296371,0.5056545,0.0069027157,0.0030174763,0.0006008166,0.00561243,0.0036199288,0.25068069],"genre_scores_gemma":[0.84647167,0.00091717567,0.11733108,0.0022492087,0.0013480049,0.0003417252,0.0034686057,0.0009539885,0.026918527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99759763,0.0005215236,0.00015178605,0.00061074767,0.0006546358,0.00046364922],"domain_scores_gemma":[0.985546,0.0082761515,0.00065929646,0.0019851686,0.002214078,0.0013192745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027545425,0.0008250968,0.0012713034,0.002248304,0.002238048,0.0028545044,0.002893301,0.0024767052,0.023219945],"category_scores_gemma":[0.022850914,0.00073485886,0.0012331923,0.0022670482,0.0021191724,0.009059903,0.0031622958,0.004425333,0.004310894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00093317515,0.0003695377,0.0032731579,0.00060961454,0.000051057785,0.0008606862,0.0005270645,0.012869622,0.016167924,0.8642968,0.041660413,0.05838091],"study_design_scores_gemma":[0.00018732857,0.00020445567,0.0016894288,0.00020147584,0.00009007231,0.0012319536,0.000415494,0.07722593,0.011728346,0.87417656,0.032704372,0.00014451268],"about_ca_topic_score_codex":0.0015272204,"about_ca_topic_score_gemma":0.0028477693,"teacher_disagreement_score":0.023219945,"about_ca_system_score_codex":0.0015949833,"about_ca_system_score_gemma":0.0017153487,"threshold_uncertainty_score":0.07767844},"labels":[],"label_agreement":null},{"id":"W2398491961","doi":"","title":"Excluded-Minor Characterization For The Class Of Cographic Splitting Matroids.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Matroid; Mathematics; Minor (academic); Characterization (materials science); Class (philosophy); Combinatorics; Humanities; Computer science; Artificial intelligence; Materials science; Art; Nanotechnology","score_opus":0.011211617749145478,"score_gpt":0.23165340505296272,"score_spread":0.22044178730381725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398491961","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66073614,0.0010593241,0.17699595,0.0033346997,0.00034257866,0.00016266627,0.0029038927,0.0007517682,0.15371294],"genre_scores_gemma":[0.97170657,0.00023433192,0.012341032,0.00032781082,0.00038613472,0.00007657373,0.0021521405,0.00011753556,0.012657804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944717,0.00008928313,0.00003672236,0.00015364343,0.00018086484,0.000092303715],"domain_scores_gemma":[0.9975805,0.0010112607,0.00035002572,0.00027371614,0.00033899667,0.0004454678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005981509,0.00052578875,0.0006424179,0.0015511992,0.0014910145,0.003036644,0.0010767443,0.0008970299,0.011414114],"category_scores_gemma":[0.0029343728,0.0003234146,0.0007612348,0.0011421563,0.0019450458,0.00363388,0.0015797616,0.002285087,0.0012664855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015475762,0.000085663574,0.0017138704,0.000102797465,0.00002591044,0.0002163106,0.00041575762,0.00124993,0.0036909105,0.97814286,0.00523064,0.008970573],"study_design_scores_gemma":[0.000038063885,0.000050537663,0.0018084215,0.00002782132,0.000021995824,0.0005729325,0.00020885003,0.009851914,0.0015360512,0.9764421,0.009421405,0.000019908217],"about_ca_topic_score_codex":0.0009887782,"about_ca_topic_score_gemma":0.0009453303,"teacher_disagreement_score":0.011414114,"about_ca_system_score_codex":0.001162335,"about_ca_system_score_gemma":0.00065541425,"threshold_uncertainty_score":0.038183987},"labels":[],"label_agreement":null},{"id":"W2398498486","doi":"","title":"Three types of edge-switchable kite systems.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Aerospace Engineering and Energy Systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Kite; Mathematics; Enhanced Data Rates for GSM Evolution; Geometry; Computer vision; Computer science","score_opus":0.012907946792140877,"score_gpt":0.1747357085512742,"score_spread":0.16182776175913333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398498486","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.362131,0.0015150919,0.24163337,0.000926997,0.00087057153,0.00027900573,0.002200479,0.0016273478,0.38881627],"genre_scores_gemma":[0.89125806,0.00049110013,0.0381117,0.00023635708,0.00004826577,0.00014250724,0.0008631117,0.0001061484,0.06874276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995277,0.000055047432,0.000033827688,0.00008623732,0.00013431053,0.00016285489],"domain_scores_gemma":[0.99929273,0.00012870264,0.00007350424,0.00027972288,0.0000972049,0.00012808808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020271308,0.00054677005,0.00037318212,0.0007555086,0.00097401603,0.0021300784,0.0011565913,0.0013993405,0.028305126],"category_scores_gemma":[0.0012073145,0.00030355164,0.0007469787,0.00090697483,0.0010231341,0.0019419888,0.0020211374,0.00097541505,0.0025957266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036284135,0.00008934148,0.0011682855,0.00028945372,0.000051328963,0.0004306498,0.00025531414,0.009923566,0.012309041,0.92174166,0.007477432,0.045901172],"study_design_scores_gemma":[0.00020864944,0.00047496523,0.00375216,0.00017919726,0.0001268437,0.002296257,0.0007440842,0.08694772,0.032944348,0.7416688,0.13040893,0.0002480568],"about_ca_topic_score_codex":0.0005994756,"about_ca_topic_score_gemma":0.0010133093,"teacher_disagreement_score":0.028305126,"about_ca_system_score_codex":0.0004516547,"about_ca_system_score_gemma":0.00035105454,"threshold_uncertainty_score":0.094690025},"labels":[],"label_agreement":null},{"id":"W2398513543","doi":"","title":"On The Power Subgroups Of The Modular Group.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Modular design; Group (periodic table); Modular group; Power (physics); Arithmetic; Pure mathematics; Computer science; Programming language; Chemistry","score_opus":0.004531171793854733,"score_gpt":0.17307748140279858,"score_spread":0.16854630960894385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398513543","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29278103,0.010900818,0.18884805,0.010431052,0.0020212233,0.000095380674,0.0004973798,0.00029120455,0.49413392],"genre_scores_gemma":[0.9209778,0.0035815379,0.016372733,0.0012636359,0.0021279827,0.000089533794,0.0002553243,0.000114213355,0.055217296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994648,0.00019666845,0.000022521486,0.000076841345,0.00012859303,0.00011056863],"domain_scores_gemma":[0.99888974,0.00058224355,0.00012848865,0.00015081129,0.00011629855,0.00013244576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006672124,0.00066559156,0.0005578926,0.0018677312,0.0012894438,0.0018302039,0.00060659525,0.0009645108,0.01016983],"category_scores_gemma":[0.0029496371,0.00029554148,0.00053206575,0.0010406426,0.0037118613,0.005289863,0.0019384773,0.0017833234,0.0016818006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000138000805,0.000007831467,0.00008346597,0.000015319472,0.0000030992712,0.000042027965,0.00011102035,0.00038715173,0.00029420396,0.99401546,0.0014988135,0.0035278227],"study_design_scores_gemma":[0.000005900574,0.000008110094,0.000089498346,0.000009784778,0.0000024573944,0.000058069476,0.000043844764,0.0013616189,0.00014135659,0.99453676,0.0037390764,0.000003670688],"about_ca_topic_score_codex":0.0007040798,"about_ca_topic_score_gemma":0.00074115023,"teacher_disagreement_score":0.01016983,"about_ca_system_score_codex":0.000856222,"about_ca_system_score_gemma":0.0004118212,"threshold_uncertainty_score":0.034021497},"labels":[],"label_agreement":null},{"id":"W2398513767","doi":"","title":"A necessary and sufficient condition for a graph to be E 2 -cordial.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.01591441386425326,"score_gpt":0.23080538035631717,"score_spread":0.2148909664920639,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398513767","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5150805,0.0011852556,0.21144411,0.010854324,0.0026054136,0.0008915988,0.010370704,0.0035919268,0.24397625],"genre_scores_gemma":[0.9331399,0.00046109478,0.04315648,0.0015821427,0.0007204205,0.00042088956,0.0047066803,0.00027568135,0.015536785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99797314,0.0002768377,0.00021736785,0.00068539096,0.00036491596,0.00048237538],"domain_scores_gemma":[0.98368293,0.007183248,0.0018167709,0.0017049657,0.002858164,0.002753896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00123099,0.00086149276,0.0011057578,0.0021508683,0.0030219231,0.0032969632,0.0015624356,0.0029183074,0.03005646],"category_scores_gemma":[0.01933116,0.00096170756,0.0012277307,0.0014919903,0.0032785966,0.005666296,0.002947593,0.0035993867,0.0058618556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011133472,0.0006509409,0.007887295,0.0008782055,0.00013007966,0.004018365,0.0010903663,0.0057353205,0.036027208,0.88011193,0.036717415,0.02563959],"study_design_scores_gemma":[0.00049916323,0.00050609827,0.0074002743,0.00035888172,0.00014970785,0.004935476,0.002080342,0.024476975,0.025436006,0.8855175,0.048409384,0.00023025482],"about_ca_topic_score_codex":0.0021280714,"about_ca_topic_score_gemma":0.0033749938,"teacher_disagreement_score":0.03005646,"about_ca_system_score_codex":0.0011206142,"about_ca_system_score_gemma":0.0019835087,"threshold_uncertainty_score":0.100548804},"labels":[],"label_agreement":null},{"id":"W2398521990","doi":"","title":"A Note on a Cube-Packing Problem.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cube (algebra); Mathematics; Packing problems; Combinatorics","score_opus":0.007705945318027454,"score_gpt":0.21319257041234013,"score_spread":0.20548662509431267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398521990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012394755,0.031532347,0.5714011,0.02826425,0.025586763,0.0003629115,0.002407034,0.0006812824,0.32736948],"genre_scores_gemma":[0.16812322,0.07371202,0.59483016,0.01058781,0.031531367,0.00073351146,0.0035636895,0.0011445073,0.115773745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850863,0.00040702464,0.00008273048,0.00028349477,0.00059937825,0.0001187271],"domain_scores_gemma":[0.99631435,0.0023670993,0.00013430431,0.0005127756,0.00041494804,0.00025646892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014942547,0.0017206284,0.0013592921,0.0017831994,0.002043137,0.0036824238,0.003164905,0.0027645456,0.018597009],"category_scores_gemma":[0.010072851,0.00070671365,0.002394724,0.0053109936,0.0023927153,0.008346132,0.0043131663,0.008290916,0.006396598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018196845,0.00015294767,0.0004716829,0.001093709,0.00008213248,0.0010454468,0.00019240112,0.034030795,0.002123699,0.5773471,0.23076576,0.15251239],"study_design_scores_gemma":[0.000027782766,0.00008637136,0.00052615494,0.00025517,0.00004567879,0.0009607619,0.00011409742,0.03690375,0.0008030012,0.79729617,0.16292445,0.00005661531],"about_ca_topic_score_codex":0.0050847773,"about_ca_topic_score_gemma":0.005665619,"teacher_disagreement_score":0.018597009,"about_ca_system_score_codex":0.0015379259,"about_ca_system_score_gemma":0.0015822048,"threshold_uncertainty_score":0.062213182},"labels":[],"label_agreement":null},{"id":"W2398555939","doi":"","title":"Extreme Cliques in Interval Graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Interval (graph theory); Combinatorics","score_opus":0.024925440149273496,"score_gpt":0.2970897280047989,"score_spread":0.2721642878555254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398555939","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39073545,0.002101656,0.44889286,0.0026138986,0.00033543093,0.00014796837,0.0014111722,0.00058830617,0.15317327],"genre_scores_gemma":[0.9295297,0.0008096795,0.05420329,0.0003113779,0.0003125182,0.00011529062,0.00096452783,0.00010820289,0.013645367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989858,0.0003617305,0.00003977254,0.00022360186,0.00023676688,0.00015232217],"domain_scores_gemma":[0.9944839,0.0035750885,0.0006182798,0.000443929,0.00035164694,0.0005271846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085403793,0.0003061768,0.0005538941,0.001573596,0.001462108,0.0022373537,0.0010096538,0.0010085121,0.010005968],"category_scores_gemma":[0.006928542,0.0004881793,0.00063300837,0.00164681,0.0015103143,0.00323238,0.0017114646,0.0021510813,0.0010878387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011911463,0.00005404971,0.0012465186,0.000111475616,0.000036653288,0.00030363194,0.00038381648,0.0049070613,0.0021429595,0.96482044,0.0056319567,0.020242296],"study_design_scores_gemma":[0.000024857283,0.000019516458,0.0008468024,0.000031170883,0.00002075991,0.000415696,0.00017939384,0.01775747,0.00067092496,0.974128,0.0058930973,0.000012331363],"about_ca_topic_score_codex":0.0006033286,"about_ca_topic_score_gemma":0.00086604827,"teacher_disagreement_score":0.010005968,"about_ca_system_score_codex":0.00058255007,"about_ca_system_score_gemma":0.0002532597,"threshold_uncertainty_score":0.033473313},"labels":[],"label_agreement":null},{"id":"W2398560034","doi":"","title":"The result on (3, 1)*-choosability of graphs of nonnegative characteristic without 4-cycles and intersecting triangles.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01634810962439791,"score_gpt":0.22987941106714072,"score_spread":0.2135313014427428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398560034","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5702141,0.0010996734,0.18758722,0.004463896,0.00046164368,0.00009846928,0.0015890879,0.0005232081,0.2339628],"genre_scores_gemma":[0.9673808,0.00047091884,0.014507099,0.00065061176,0.000125545,0.000052779273,0.00055774976,0.00011603664,0.01613845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996208,0.00006467578,0.000018471486,0.000114280294,0.0000754059,0.00010637192],"domain_scores_gemma":[0.99783725,0.0013171285,0.0002666274,0.00027326387,0.000109063185,0.00019670109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041553282,0.00034830594,0.0003961637,0.0005765524,0.00086047995,0.0014915038,0.00082507235,0.00080292096,0.014632986],"category_scores_gemma":[0.0027082749,0.00033955305,0.000707895,0.00085526594,0.0013730709,0.0030925248,0.0014188895,0.0017736861,0.0010071103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034863278,0.000083627034,0.00327397,0.00033571344,0.000041399486,0.0004277561,0.00041726397,0.009976896,0.010929429,0.92969775,0.014037767,0.030429643],"study_design_scores_gemma":[0.00006107982,0.000068027264,0.0020942658,0.00004311344,0.000037670296,0.00069490785,0.00015119737,0.014289206,0.0041955514,0.96827996,0.010056896,0.0000282226],"about_ca_topic_score_codex":0.0009416631,"about_ca_topic_score_gemma":0.0010976164,"teacher_disagreement_score":0.014632986,"about_ca_system_score_codex":0.0006456698,"about_ca_system_score_gemma":0.00046466288,"threshold_uncertainty_score":0.04895228},"labels":[],"label_agreement":null},{"id":"W2398588025","doi":"","title":"q-HARMONIC SUM IDENTITIES WITH MULTI-BINOMIAL COEFFICIENT","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Nonlinear Waves and Solitons","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Binomial coefficient; Central binomial coefficient; Statistics; Binomial (polynomial); Gaussian binomial coefficient; Binomial approximation; Applied mathematics; Negative binomial distribution; Discrete mathematics; Poisson distribution","score_opus":0.021011998612651076,"score_gpt":0.2613102864688561,"score_spread":0.24029828785620505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398588025","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10553965,0.0019257806,0.35749856,0.0054394403,0.0037091444,0.0001387922,0.0006084214,0.00067923364,0.5244609],"genre_scores_gemma":[0.71047693,0.002168773,0.06587092,0.0029461496,0.0032876485,0.00026889038,0.00053589826,0.00087033963,0.21357444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981882,0.00047782288,0.000110872286,0.00022454133,0.00071364804,0.0002848942],"domain_scores_gemma":[0.99761754,0.0008768611,0.00022254788,0.00035668534,0.0005062802,0.00042013553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025372137,0.0016520544,0.0014088067,0.004801144,0.003970265,0.0056312154,0.0025662037,0.0021839037,0.022135613],"category_scores_gemma":[0.004745184,0.000926994,0.0016304564,0.003247076,0.005052414,0.010553247,0.0061635594,0.0050013256,0.007530366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007354009,0.0000098370165,0.000031514017,0.000016463662,0.0000035521869,0.00006242216,0.000075469114,0.00007359744,0.0002507675,0.99636924,0.0011689147,0.0019307623],"study_design_scores_gemma":[0.0000052501405,0.0000030596184,0.000039971736,0.000008593982,0.000005724018,0.0001579243,0.000030007703,0.0012325137,0.00021395134,0.9956773,0.0026139235,0.000011666155],"about_ca_topic_score_codex":0.000858251,"about_ca_topic_score_gemma":0.0010259134,"teacher_disagreement_score":0.022135613,"about_ca_system_score_codex":0.001861838,"about_ca_system_score_gemma":0.0010822713,"threshold_uncertainty_score":0.07405102},"labels":[],"label_agreement":null},{"id":"W2398599938","doi":"","title":"PI Indices For Some Classes Of Bicyclic Graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Bicyclic molecule; Stereochemistry; Chemistry","score_opus":0.02429378601142765,"score_gpt":0.30401232204167267,"score_spread":0.279718536030245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398599938","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28933513,0.001750837,0.05689872,0.0026924787,0.0007645444,0.00018018401,0.0023710327,0.00090357976,0.64510363],"genre_scores_gemma":[0.92451835,0.0011580345,0.0177075,0.0009543982,0.000374731,0.00023370163,0.001853489,0.00021877345,0.052981038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950945,0.000065817825,0.00002380697,0.00010626274,0.00015710246,0.00013742427],"domain_scores_gemma":[0.99895155,0.00028039268,0.00021744944,0.00016617043,0.0001804076,0.00020398654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032013404,0.0005027784,0.00042309714,0.0030145727,0.0016946162,0.0026360569,0.0009614565,0.00086366385,0.016610818],"category_scores_gemma":[0.0020464153,0.00030582614,0.00031130304,0.00216903,0.0011732633,0.0021379306,0.0012789244,0.0020197558,0.002305418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005452905,0.000029324343,0.0006712999,0.00006260634,0.000006425334,0.00013639576,0.0002101265,0.00039709924,0.0010468104,0.9714443,0.010280094,0.015660971],"study_design_scores_gemma":[0.000022597522,0.00001987325,0.0011641985,0.000039189166,0.000012809115,0.0006110319,0.00022320125,0.004649466,0.00092564744,0.96246475,0.029849214,0.000017970344],"about_ca_topic_score_codex":0.00095570687,"about_ca_topic_score_gemma":0.0012758656,"teacher_disagreement_score":0.016610818,"about_ca_system_score_codex":0.0011119128,"about_ca_system_score_gemma":0.0004953343,"threshold_uncertainty_score":0.055568755},"labels":[],"label_agreement":null},{"id":"W2398610165","doi":"","title":"A Note on Chromatic Uniqueness of Certain Complete Tripartite Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Uniqueness; Chromatic scale; Combinatorics; Mathematical economics; Mathematical analysis","score_opus":0.02318779927119251,"score_gpt":0.2537149411521882,"score_spread":0.23052714188099566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398610165","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3636579,0.0044488776,0.29144996,0.009691942,0.0019481982,0.00020351291,0.0021418808,0.0006829436,0.3257748],"genre_scores_gemma":[0.8993609,0.0025291785,0.07342656,0.0017316762,0.0008068994,0.00016869495,0.0011191856,0.00029277505,0.0205642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902153,0.0002688854,0.000045178334,0.00033344727,0.00018973794,0.00014133958],"domain_scores_gemma":[0.99522215,0.0031970819,0.00028620614,0.00058774627,0.0003040385,0.00040284393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012023664,0.00051496667,0.0007860658,0.0017594872,0.0031592355,0.0032888988,0.0019400968,0.0017800576,0.014253124],"category_scores_gemma":[0.0073978333,0.00077339076,0.0009212821,0.0025011885,0.0032612712,0.0053761085,0.0030176411,0.0035626565,0.0010420955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008632563,0.000026225012,0.0011507219,0.00014436254,0.000024057943,0.00024216232,0.00028540392,0.0021510355,0.002261418,0.9720833,0.011119572,0.010425509],"study_design_scores_gemma":[0.000023658182,0.000031498505,0.0012163308,0.00005443154,0.00003767272,0.0006315774,0.00037178874,0.008045758,0.0019701018,0.96692574,0.02064754,0.000044002558],"about_ca_topic_score_codex":0.0015640343,"about_ca_topic_score_gemma":0.002188245,"teacher_disagreement_score":0.014253124,"about_ca_system_score_codex":0.0015750831,"about_ca_system_score_gemma":0.00078271265,"threshold_uncertainty_score":0.04768139},"labels":[],"label_agreement":null},{"id":"W2398634893","doi":"","title":"On the construction of radially Moore digraphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.011137843190235235,"score_gpt":0.24002664486784128,"score_spread":0.22888880167760606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398634893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064065926,0.0016263356,0.6359558,0.002036757,0.00046104955,0.00017181254,0.0008923771,0.0013776178,0.29341236],"genre_scores_gemma":[0.5664299,0.0021360952,0.34031022,0.0013144597,0.00027200003,0.0002629456,0.0013974123,0.00068390643,0.087193176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994531,0.00019138551,0.000031778043,0.000107594,0.0001318116,0.00008424958],"domain_scores_gemma":[0.99895763,0.00046431497,0.00006995989,0.00020663397,0.00015323066,0.00014826718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005348695,0.0005284711,0.00047406805,0.0013397391,0.0017248647,0.0019941004,0.0012058446,0.0008635079,0.014783338],"category_scores_gemma":[0.0024648893,0.0006058545,0.0006325922,0.0012008768,0.0019457029,0.0040254635,0.003406719,0.0022598065,0.003915701],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015700121,0.000019036068,0.00010225832,0.000046130397,0.000004846488,0.00006145346,0.00013391611,0.0007363217,0.00067822944,0.9803048,0.0034768044,0.014420529],"study_design_scores_gemma":[0.000010514563,0.000014750592,0.00013328636,0.000030271067,0.000007301195,0.00013885016,0.00008020374,0.0035920609,0.000803014,0.97713155,0.018045226,0.00001283097],"about_ca_topic_score_codex":0.0011954381,"about_ca_topic_score_gemma":0.0030721873,"teacher_disagreement_score":0.014783338,"about_ca_system_score_codex":0.0009841449,"about_ca_system_score_gemma":0.0005814792,"threshold_uncertainty_score":0.049455225},"labels":[],"label_agreement":null},{"id":"W2398635090","doi":"","title":"Orientable Embedding Distributions by Genus of Crossing-Digraph.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Digraph; Mathematics; Genus; Embedding; Combinatorics; Zoology; Biology; Computer science; Artificial intelligence","score_opus":0.015236024370001728,"score_gpt":0.3022408367006681,"score_spread":0.2870048123306664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398635090","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7618691,0.0012594075,0.114815794,0.0011423855,0.00027815925,0.000057357596,0.00046344756,0.00069800636,0.11941642],"genre_scores_gemma":[0.9795288,0.0008551047,0.0069972486,0.00019629106,0.0001467968,0.000038228736,0.00022686798,0.00021093267,0.011799713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963117,0.00006452743,0.000014310375,0.000097162556,0.00010292325,0.00008981313],"domain_scores_gemma":[0.9983546,0.00057704415,0.00031084783,0.00017861287,0.00017276655,0.0004060179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035537902,0.00054621947,0.00044258664,0.0023293279,0.0009793638,0.0023203958,0.0009624326,0.0007990367,0.00886062],"category_scores_gemma":[0.002734426,0.000445173,0.00041034518,0.001073311,0.0017622933,0.0037069006,0.0019871688,0.001578132,0.0010294876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050995317,0.00004530728,0.0013388804,0.000041362575,0.000009118453,0.00021056112,0.00029967242,0.0019466655,0.0034980348,0.9774025,0.0025076969,0.012649214],"study_design_scores_gemma":[0.000030396926,0.000045503173,0.0025862758,0.000051225237,0.00003218373,0.00080146943,0.00041550392,0.018504763,0.0022753922,0.9655042,0.009723503,0.00002963143],"about_ca_topic_score_codex":0.0007936312,"about_ca_topic_score_gemma":0.0009748747,"teacher_disagreement_score":0.00886062,"about_ca_system_score_codex":0.001060061,"about_ca_system_score_gemma":0.00026409226,"threshold_uncertainty_score":0.029641747},"labels":[],"label_agreement":null},{"id":"W2398640167","doi":"","title":"Primality of Some graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Primality test; Mathematics; Combinatorics; Prime (order theory)","score_opus":0.010768192859442914,"score_gpt":0.21698439172416728,"score_spread":0.20621619886472436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398640167","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32817203,0.0028449334,0.30594134,0.012087727,0.00075849553,0.0001613326,0.003924353,0.0006480706,0.34546173],"genre_scores_gemma":[0.87775207,0.0013839239,0.07756472,0.001146856,0.00063659134,0.00016032904,0.0017590534,0.00029012244,0.03930638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989598,0.00039401138,0.000043052078,0.00024581375,0.0001749344,0.00018239493],"domain_scores_gemma":[0.9956031,0.0026689926,0.0004080893,0.00054062274,0.0003527925,0.00042644318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001226139,0.0005135079,0.00075096526,0.001476421,0.0019091871,0.004205981,0.00096808886,0.0012210854,0.016877307],"category_scores_gemma":[0.005765924,0.00055643724,0.0008562763,0.0015090118,0.0023477774,0.005167795,0.002381692,0.0035869363,0.0016704402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065640175,0.000025263837,0.00035079295,0.000084330844,0.000013090267,0.000040905892,0.00011674362,0.001582531,0.00075429096,0.9838219,0.0054973373,0.00764712],"study_design_scores_gemma":[0.000022293163,0.00001370102,0.00036772218,0.00003237174,0.000017688537,0.00014811814,0.000116162504,0.0074370173,0.0010421036,0.98024106,0.0105521595,0.000009622265],"about_ca_topic_score_codex":0.00069790706,"about_ca_topic_score_gemma":0.0007898314,"teacher_disagreement_score":0.016877307,"about_ca_system_score_codex":0.0016509757,"about_ca_system_score_gemma":0.0006271647,"threshold_uncertainty_score":0.056460142},"labels":[],"label_agreement":null},{"id":"W2398651737","doi":"","title":"Spiders are antimagic.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Beetle Biology and Toxicology Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.022832082895103856,"score_gpt":0.26573339121941497,"score_spread":0.24290130832431112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398651737","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90751565,0.016106566,0.0067373584,0.000929958,0.00032944197,0.0000902717,0.0014157797,0.00062177505,0.06625324],"genre_scores_gemma":[0.9626825,0.0039225775,0.0022945355,0.00047134067,0.0000593226,0.0000331373,0.0010216455,0.00005883479,0.029456183],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99978274,0.000026128982,0.000012882907,0.000054507254,0.00008169533,0.000042066793],"domain_scores_gemma":[0.9997563,0.000014844183,0.00005735151,0.000022275048,0.000051083098,0.00009814041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000117868265,0.0005265285,0.0003607589,0.00062214636,0.00042989987,0.00070021313,0.00022806243,0.00050009415,0.005150634],"category_scores_gemma":[0.00021388408,0.0001979523,0.00032911001,0.00020732984,0.0004260998,0.00041701397,0.00052130973,0.00045209928,0.002848953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017985694,0.00001829973,0.001749141,0.00013984661,0.000029556091,0.00015415158,0.000035112786,0.000020031559,0.9869985,0.0007896645,0.0003744603,0.0095112985],"study_design_scores_gemma":[0.00004173975,0.0009733624,0.09828622,0.0000739551,0.00016808996,0.0046451646,0.00030631036,0.00036073878,0.838114,0.0019226825,0.055063408,0.000044391538],"about_ca_topic_score_codex":0.0006373719,"about_ca_topic_score_gemma":0.0013291473,"teacher_disagreement_score":0.005150634,"about_ca_system_score_codex":0.0003383874,"about_ca_system_score_gemma":0.00020860683,"threshold_uncertainty_score":0.01723063},"labels":[],"label_agreement":null},{"id":"W2398676038","doi":"","title":"Spectral Invariants and Some Stable Properties of a Graph.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral properties; Pure mathematics; Graph; Discrete mathematics; Computational chemistry; Chemistry","score_opus":0.05804052671812582,"score_gpt":0.26579291548942047,"score_spread":0.20775238877129465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398676038","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5052664,0.0034358043,0.22922546,0.0044083106,0.00094200624,0.00009453735,0.001024043,0.0006136086,0.2549898],"genre_scores_gemma":[0.97530395,0.0008036222,0.009738389,0.00026962173,0.0005148371,0.00005324607,0.0003637803,0.00009630048,0.012856269],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996101,0.00009599834,0.000020500562,0.00008880376,0.00011016566,0.000074497184],"domain_scores_gemma":[0.998458,0.00066557125,0.00028215206,0.00015731843,0.00022797023,0.00020895337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000540062,0.00051819306,0.00042381202,0.0033469289,0.0013082542,0.002150159,0.00069914357,0.00071696413,0.008456871],"category_scores_gemma":[0.0026450295,0.00026481942,0.0006063975,0.001635208,0.00302756,0.0034354778,0.0011885314,0.0014922261,0.0011031454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014299068,0.000013260938,0.00023526073,0.000021385164,0.000005168231,0.00005351936,0.00015231466,0.00036496425,0.00073493045,0.99214447,0.0014051483,0.004855225],"study_design_scores_gemma":[0.0000054379866,0.000011680324,0.00034348085,0.000010272149,0.000008242049,0.000121698184,0.00015127454,0.002681091,0.00044769942,0.9932719,0.002941254,0.0000059195427],"about_ca_topic_score_codex":0.00068125356,"about_ca_topic_score_gemma":0.000700083,"teacher_disagreement_score":0.008456871,"about_ca_system_score_codex":0.0007640561,"about_ca_system_score_gemma":0.00029123842,"threshold_uncertainty_score":0.028290987},"labels":[],"label_agreement":null},{"id":"W2398687409","doi":"","title":"k-Connected Graphs Without K 4 .","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.012771128039274833,"score_gpt":0.20748709116971883,"score_spread":0.194715963130444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398687409","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2610222,0.0017726201,0.31576473,0.004205071,0.00093098124,0.00031917295,0.0037114613,0.0015422954,0.41073146],"genre_scores_gemma":[0.82705647,0.001437296,0.0633448,0.0012623003,0.00027432662,0.00027237955,0.002495945,0.00030044216,0.10355609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999159,0.00016579824,0.0000619684,0.00024723262,0.00017763262,0.00018842955],"domain_scores_gemma":[0.9966258,0.0013118117,0.00053642766,0.0006790717,0.00052252074,0.00032437214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044734485,0.000727394,0.0005367246,0.0021212758,0.0021279743,0.002827528,0.0013338514,0.0014372051,0.020726651],"category_scores_gemma":[0.0039113294,0.0005533271,0.00065526937,0.0019028762,0.001870815,0.0042129885,0.001988818,0.0017015622,0.004596413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014112596,0.0000605844,0.0005522165,0.0001741133,0.00003579842,0.0004053494,0.0002341137,0.0024110763,0.0026542742,0.9670537,0.009046483,0.017231023],"study_design_scores_gemma":[0.000028064964,0.00002304195,0.0006013487,0.00008077881,0.000033895416,0.0005344949,0.00020406417,0.0081238765,0.0020990702,0.9604652,0.027780542,0.00002567656],"about_ca_topic_score_codex":0.0014141486,"about_ca_topic_score_gemma":0.002247784,"teacher_disagreement_score":0.020726651,"about_ca_system_score_codex":0.00094339135,"about_ca_system_score_gemma":0.00081611925,"threshold_uncertainty_score":0.06933755},"labels":[],"label_agreement":null},{"id":"W2398698927","doi":"","title":"L-Presheaves and Their Stalks.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.009951069302425022,"score_gpt":0.21683104187285565,"score_spread":0.20687997257043061,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398698927","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2185002,0.011813853,0.35268405,0.004068028,0.0009268211,0.00012824415,0.0017925248,0.0013724517,0.4087138],"genre_scores_gemma":[0.89080185,0.001691968,0.039098058,0.00062397926,0.0003418141,0.00014286814,0.00057624147,0.00016151562,0.06656167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993919,0.00015741662,0.000054175274,0.00012676485,0.0001658894,0.00010388086],"domain_scores_gemma":[0.9988961,0.0004885453,0.00013172983,0.00013191841,0.00019259805,0.00015909545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056907715,0.000457715,0.00040577954,0.0017678012,0.001580049,0.0032218364,0.0005640002,0.0007739972,0.009740344],"category_scores_gemma":[0.0021358572,0.0004950586,0.0006282503,0.0009796792,0.0027202878,0.0044858754,0.0019183069,0.0016737125,0.0031567044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019971452,0.000009979837,0.00016625943,0.000030392916,0.000006966638,0.000117343036,0.0004076339,0.00024733515,0.00058715127,0.991891,0.0012398583,0.005276143],"study_design_scores_gemma":[0.0000074805403,0.000012599316,0.00020939109,0.000025065576,0.0000070154383,0.00018782122,0.00020436448,0.0013962241,0.00061579567,0.98025995,0.017062237,0.000012075255],"about_ca_topic_score_codex":0.00089967396,"about_ca_topic_score_gemma":0.001159765,"teacher_disagreement_score":0.009740344,"about_ca_system_score_codex":0.0010250098,"about_ca_system_score_gemma":0.00053511735,"threshold_uncertainty_score":0.032584727},"labels":[],"label_agreement":null},{"id":"W2398708703","doi":"","title":"A Class of Optimal Quaternary Codes.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Class (philosophy); Quaternary; Computer science; Artificial intelligence; Geology; Paleontology","score_opus":0.008590512753979802,"score_gpt":0.22932575634966754,"score_spread":0.22073524359568775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398708703","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3164453,0.008476161,0.330694,0.0039982405,0.0014081217,0.00033631158,0.0032973532,0.00085250125,0.3344921],"genre_scores_gemma":[0.9253769,0.0028456824,0.035208806,0.0010451977,0.000530184,0.00021163627,0.0012795244,0.0001631146,0.0333391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999213,0.00013226844,0.000045737608,0.00013018948,0.00030134793,0.00017740097],"domain_scores_gemma":[0.99874204,0.00035759277,0.00021701233,0.00027359772,0.0002606757,0.00014917328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062829244,0.00056558155,0.0007187949,0.0014819573,0.0010961499,0.0026014983,0.00054054975,0.0011706627,0.00783844],"category_scores_gemma":[0.0037076229,0.00026690733,0.00047726574,0.001279703,0.0012166105,0.0018395756,0.0013567655,0.0013427358,0.0017226993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008139409,0.000035501114,0.00037865978,0.00007152312,0.000010156196,0.00010433403,0.000059505703,0.0032170292,0.0021752722,0.96554714,0.006286995,0.022032524],"study_design_scores_gemma":[0.00005257427,0.00005805732,0.00045237565,0.000061924,0.000015354697,0.00061608833,0.00006444047,0.026277473,0.0021420086,0.9359624,0.034269836,0.00002741788],"about_ca_topic_score_codex":0.00047940412,"about_ca_topic_score_gemma":0.0004782596,"teacher_disagreement_score":0.00783844,"about_ca_system_score_codex":0.0010607435,"about_ca_system_score_gemma":0.0011556359,"threshold_uncertainty_score":0.02622217},"labels":[],"label_agreement":null},{"id":"W2398727723","doi":"","title":"A degree sum condition for the existence of a path-factor","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Path (computing); Factor (programming language); Combinatorics; Computer science","score_opus":0.04822089883231394,"score_gpt":0.2995773083264982,"score_spread":0.25135640949418425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398727723","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43179715,0.0007189473,0.26685917,0.0035760761,0.00075092743,0.000120123805,0.0008909201,0.0008678353,0.2944188],"genre_scores_gemma":[0.9576044,0.00037499156,0.021139827,0.0004697383,0.00040560568,0.00010307943,0.00042404956,0.00023383871,0.019244555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864846,0.00019101707,0.000104345105,0.00042788955,0.0003183762,0.00031005367],"domain_scores_gemma":[0.99422765,0.0031792119,0.00033846908,0.0006378354,0.00067561766,0.0009412106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013452286,0.00068693305,0.00093410205,0.0019321155,0.0028500764,0.003589802,0.0015083008,0.0020943526,0.016624501],"category_scores_gemma":[0.008460282,0.0007023103,0.0011971662,0.0012662846,0.0038718453,0.010281603,0.0037190628,0.003687415,0.0023126912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000503815,0.000023725815,0.0003263571,0.000043967753,0.0000075099324,0.00017993388,0.00023764891,0.00046700417,0.0020919128,0.99189246,0.0010780358,0.0036010672],"study_design_scores_gemma":[0.000018857369,0.00001786809,0.00020794415,0.000019694979,0.000013113817,0.0003545436,0.00015461426,0.0025612207,0.0015789737,0.99246407,0.0025893215,0.000019767705],"about_ca_topic_score_codex":0.00078548887,"about_ca_topic_score_gemma":0.00071055116,"teacher_disagreement_score":0.016624501,"about_ca_system_score_codex":0.0008631274,"about_ca_system_score_gemma":0.00089221215,"threshold_uncertainty_score":0.05561453},"labels":[],"label_agreement":null},{"id":"W2398735637","doi":"","title":"A Note On Bi-Normal Cayley Graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cayley graph; Combinatorics; Graph","score_opus":0.032214702155863376,"score_gpt":0.30979032735150347,"score_spread":0.2775756251956401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398735637","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07349195,0.019972408,0.19433677,0.056303877,0.015734319,0.00009123066,0.0008862861,0.0012222194,0.63796085],"genre_scores_gemma":[0.7650308,0.018340405,0.10437562,0.021427678,0.006842131,0.00007544085,0.0010621778,0.0002939413,0.08255176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949896,0.00014226037,0.00002659864,0.00009099967,0.00017734838,0.00006394108],"domain_scores_gemma":[0.9981331,0.000978698,0.000099635065,0.00023498005,0.00031711796,0.00023647591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066296145,0.00047975522,0.00036276746,0.0009354598,0.0014872773,0.0010404984,0.001115445,0.0008360652,0.0096436925],"category_scores_gemma":[0.0015260108,0.00020222216,0.0003318533,0.0010621075,0.0021099136,0.0035887617,0.001692977,0.0031929065,0.002227085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001136075,0.000059760903,0.0010240915,0.00029586547,0.000028411792,0.00090328965,0.00058150984,0.0010412914,0.0062323716,0.9077627,0.053074602,0.028882476],"study_design_scores_gemma":[0.000014284849,0.0000766924,0.0008541108,0.000044526234,0.000023047247,0.0007306314,0.00027741055,0.0022690704,0.0019295936,0.8308528,0.16290198,0.000025834965],"about_ca_topic_score_codex":0.0019878054,"about_ca_topic_score_gemma":0.0026556486,"teacher_disagreement_score":0.0096436925,"about_ca_system_score_codex":0.00062150566,"about_ca_system_score_gemma":0.00037034333,"threshold_uncertainty_score":0.03226143},"labels":[],"label_agreement":null},{"id":"W2398748959","doi":"","title":"Hypercube-Anti-Ramsey Numbers of Q 5 .","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hypercube; Combinatorics; Arithmetic","score_opus":0.017972778090773557,"score_gpt":0.26186913092722447,"score_spread":0.24389635283645092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398748959","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48754117,0.0013013233,0.057470877,0.00322399,0.00051306706,0.000088571025,0.0009790125,0.00038176976,0.4485003],"genre_scores_gemma":[0.95904374,0.00032703663,0.011218233,0.00035446786,0.00012170628,0.00007988814,0.0002926903,0.00006733803,0.028494846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955815,0.00015459546,0.000020600171,0.000074094896,0.00009704035,0.0000954958],"domain_scores_gemma":[0.998847,0.00047892414,0.00019890866,0.00008648817,0.00020655907,0.0001821713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006655221,0.0003445929,0.00035496525,0.0014957502,0.0014729861,0.0024531165,0.0005592254,0.00062284607,0.015701821],"category_scores_gemma":[0.0021543833,0.00026128397,0.0003039797,0.0007092654,0.0018207177,0.0028285729,0.0012745855,0.0010167892,0.0016805594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005981833,0.000016700487,0.0002966645,0.00003617089,0.00000516062,0.00007387275,0.00011738126,0.00048567698,0.00076989434,0.9906833,0.0028890634,0.00456627],"study_design_scores_gemma":[0.000016621461,0.000017126267,0.00043799132,0.000025987512,0.0000055008554,0.00015696062,0.00016079475,0.0030021297,0.0009447242,0.98753023,0.0076922965,0.000009774245],"about_ca_topic_score_codex":0.0011825643,"about_ca_topic_score_gemma":0.0015164944,"teacher_disagreement_score":0.015701821,"about_ca_system_score_codex":0.00096008397,"about_ca_system_score_gemma":0.00061430887,"threshold_uncertainty_score":0.052527845},"labels":[],"label_agreement":null},{"id":"W2398755068","doi":"","title":"Minimum embedding of a K 3 -design into a balanced incomplete block design of index λ ≥ 2.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Block (permutation group theory); Combinatorics; Lambda; Embedding; Order (exchange); Block design; Index (typography); Value (mathematics); Discrete mathematics; Statistics; Physics; Computer science","score_opus":0.011524283810214756,"score_gpt":0.21236349903291923,"score_spread":0.20083921522270448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398755068","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.752605,0.00050888717,0.20400596,0.00018969699,0.00003592849,0.0001282355,0.001284483,0.0005691806,0.040672615],"genre_scores_gemma":[0.8481698,0.00015133443,0.1433822,0.00006038112,0.00001007318,0.00008154092,0.0007532282,0.00009241154,0.0072990553],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997354,0.000064564934,0.000016584858,0.000057700763,0.000058063986,0.00006765721],"domain_scores_gemma":[0.9994499,0.00014992389,0.00014947903,0.00010184606,0.00008415038,0.00006469822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020076416,0.00038686418,0.00027456591,0.00034560525,0.0003016174,0.0005378164,0.00028823715,0.00042052066,0.005175444],"category_scores_gemma":[0.00096915616,0.00034540743,0.00027350255,0.0003303744,0.00034531808,0.0007414137,0.00044541009,0.00030486606,0.000916615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024158154,0.0003678337,0.011350191,0.0011906628,0.0001835363,0.0011513192,0.0006868638,0.15308815,0.5087449,0.13452102,0.007635431,0.17866434],"study_design_scores_gemma":[0.0004935803,0.0038927482,0.01947097,0.0003223575,0.00031800164,0.003060765,0.0009970792,0.3849186,0.31644922,0.18537451,0.08456844,0.00013370218],"about_ca_topic_score_codex":0.00076310243,"about_ca_topic_score_gemma":0.0016587409,"teacher_disagreement_score":0.005175444,"about_ca_system_score_codex":0.000510839,"about_ca_system_score_gemma":0.0004704166,"threshold_uncertainty_score":0.0173136},"labels":[],"label_agreement":null},{"id":"W2398764523","doi":"","title":"On Schwenk-like formulas for Q-characteristic polynomials of graphs","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics; Pure mathematics","score_opus":0.05451344267431975,"score_gpt":0.3164697697947031,"score_spread":0.26195632712038336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398764523","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56034577,0.0031605836,0.26283136,0.0061314744,0.0010442038,0.00014568481,0.0009041606,0.0007451245,0.16469164],"genre_scores_gemma":[0.9557883,0.0016131427,0.024293981,0.0010180353,0.000699903,0.00010388665,0.0004430031,0.00018274036,0.015856925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990951,0.00028811264,0.000055673587,0.00014523165,0.00022675832,0.0001891618],"domain_scores_gemma":[0.9968624,0.0018783578,0.0003220001,0.00019611165,0.000380064,0.00036102254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021404314,0.001365331,0.0012977683,0.0045837816,0.002609929,0.0048349225,0.0020336215,0.0017981585,0.008327946],"category_scores_gemma":[0.007623251,0.0008811975,0.0013271727,0.004793968,0.0055720224,0.008626339,0.0031279204,0.005145356,0.0011345332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035730685,0.000026719277,0.0003468435,0.000043128377,0.0000063827965,0.00008143081,0.00041407486,0.00066835724,0.0003405715,0.9915344,0.0010155435,0.0054868045],"study_design_scores_gemma":[0.000011632451,0.000009428245,0.00015858463,0.000014438076,0.000008194089,0.000054270655,0.00010658328,0.0021987804,0.00013830085,0.99636143,0.0009260818,0.000012261713],"about_ca_topic_score_codex":0.003147134,"about_ca_topic_score_gemma":0.0035623212,"teacher_disagreement_score":0.008327946,"about_ca_system_score_codex":0.0036043858,"about_ca_system_score_gemma":0.0009245079,"threshold_uncertainty_score":0.027859688},"labels":[],"label_agreement":null},{"id":"W2398768919","doi":"","title":"On super restricted edge-connectivity of vertex-transitive graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Transitive relation; Combinatorics; Enhanced Data Rates for GSM Evolution; Graph; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.00860464733695122,"score_gpt":0.2133818032879816,"score_spread":0.20477715595103038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398768919","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4846198,0.0035904038,0.29277483,0.0030664932,0.0004255924,0.00014268985,0.001382654,0.00054317777,0.21345438],"genre_scores_gemma":[0.9630077,0.0019346952,0.022142911,0.0005735147,0.0004120987,0.00012774102,0.0008405579,0.00013847431,0.010822264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920124,0.00029472105,0.000048810707,0.00015464805,0.00017811426,0.00012249088],"domain_scores_gemma":[0.99434245,0.0037675365,0.0005004931,0.0006093455,0.00035126542,0.0004289424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008516914,0.00049664883,0.00066268665,0.0018261212,0.00105404,0.0015234352,0.0011383323,0.0009061283,0.011135756],"category_scores_gemma":[0.005548701,0.0003844806,0.0004988011,0.0016023986,0.0017859455,0.0057898564,0.0015810347,0.0018243375,0.00086204574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089136905,0.000035790643,0.0007814581,0.00017379377,0.00002466893,0.00027571133,0.0002524935,0.005684505,0.002090709,0.97308,0.004577169,0.012934499],"study_design_scores_gemma":[0.00001605483,0.000026331085,0.0006818782,0.000038680868,0.00001978597,0.00032997836,0.00012266722,0.02048524,0.0005430375,0.9734485,0.004277399,0.000010371414],"about_ca_topic_score_codex":0.00073489704,"about_ca_topic_score_gemma":0.0013291903,"teacher_disagreement_score":0.011135756,"about_ca_system_score_codex":0.00066281494,"about_ca_system_score_gemma":0.00031138113,"threshold_uncertainty_score":0.037252843},"labels":[],"label_agreement":null},{"id":"W2398795605","doi":"","title":"Δ-Optimum Forbidden Subgraphs and Exclusive Sum Labellings of Graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.009043422562513672,"score_gpt":0.21091776096709217,"score_spread":0.2018743384045785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398795605","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5185881,0.0021261305,0.32790807,0.004973133,0.0002673136,0.00017954042,0.0038803536,0.0010162954,0.14106102],"genre_scores_gemma":[0.85401547,0.000995649,0.11963441,0.00066013925,0.00014118977,0.0001867776,0.0024126384,0.00032271753,0.021630947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989729,0.00036240966,0.00006111246,0.00020502222,0.00019059646,0.0002080067],"domain_scores_gemma":[0.9943614,0.0035921673,0.00055610953,0.00084050465,0.00027117145,0.00037865966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008288247,0.00051689835,0.0006410433,0.0011617303,0.0014294636,0.0028836837,0.0015428131,0.0012955009,0.0084468005],"category_scores_gemma":[0.005782963,0.00075325515,0.0007230462,0.0015891432,0.0017372759,0.0047825994,0.0020437506,0.0021935396,0.0010420663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004401693,0.00014412684,0.0020398595,0.00030213583,0.000037242156,0.00015740813,0.00037906933,0.018935679,0.00555454,0.90740836,0.013190642,0.051410787],"study_design_scores_gemma":[0.000036677866,0.00002219666,0.000624038,0.000038523503,0.00002369863,0.00021809885,0.00022021163,0.021430777,0.002580455,0.9686547,0.0061348495,0.00001581502],"about_ca_topic_score_codex":0.0013450608,"about_ca_topic_score_gemma":0.0025477102,"teacher_disagreement_score":0.0084468005,"about_ca_system_score_codex":0.0015737774,"about_ca_system_score_gemma":0.0008004039,"threshold_uncertainty_score":0.02825743},"labels":[],"label_agreement":null},{"id":"W2398799857","doi":"","title":"On chromatic number of graphs without certain induced subgraphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics","score_opus":0.02482158526942479,"score_gpt":0.24701553675228122,"score_spread":0.22219395148285642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398799857","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6615275,0.0039776014,0.11093036,0.00853076,0.0005564534,0.00012772207,0.003138806,0.0006080277,0.21060279],"genre_scores_gemma":[0.9537076,0.0014343234,0.023987552,0.00058556924,0.00048614191,0.00015458792,0.0016454097,0.00023720431,0.017761614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913293,0.00027026227,0.000032205175,0.0002269324,0.00015034547,0.00018746928],"domain_scores_gemma":[0.9915656,0.0059620873,0.0008252913,0.00057755806,0.00038856282,0.00068098324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012198474,0.0006812078,0.0007484618,0.0030492598,0.0019881772,0.003074512,0.0018893894,0.0016264382,0.012984129],"category_scores_gemma":[0.008276414,0.0005736013,0.00053920667,0.002643323,0.003049784,0.006964696,0.0016670474,0.0024123748,0.0011293951],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029985444,0.00010098227,0.003126597,0.00024002473,0.000036238212,0.0000904395,0.00033169723,0.014052114,0.0022929888,0.9422231,0.018397126,0.018809004],"study_design_scores_gemma":[0.00006924114,0.00003647687,0.0024232399,0.00006808969,0.00003555297,0.00019704735,0.0002945131,0.049670033,0.0015384794,0.93766856,0.007965542,0.000033236618],"about_ca_topic_score_codex":0.0030656224,"about_ca_topic_score_gemma":0.003920644,"teacher_disagreement_score":0.012984129,"about_ca_system_score_codex":0.0030843946,"about_ca_system_score_gemma":0.00094139,"threshold_uncertainty_score":0.04343623},"labels":[],"label_agreement":null},{"id":"W2398805757","doi":"","title":"Two kinds of equipackable paths and cycles.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.01355741222375918,"score_gpt":0.26237390274752986,"score_spread":0.2488164905237707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398805757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11286381,0.0023106665,0.5411738,0.003905817,0.0012421571,0.00020859599,0.0025014586,0.001467498,0.33432612],"genre_scores_gemma":[0.7970134,0.0017358611,0.106530786,0.0019465387,0.00041144647,0.0004947909,0.0021349774,0.00066711754,0.089065105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811053,0.000377415,0.00013064302,0.0005008517,0.0004535606,0.00042702307],"domain_scores_gemma":[0.99562585,0.0018356167,0.00035693785,0.001177509,0.0004229761,0.0005811303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007107598,0.0007907961,0.0004719869,0.0018303345,0.001696513,0.0032268187,0.0014069697,0.001974458,0.027356133],"category_scores_gemma":[0.008516327,0.000588406,0.00091328344,0.0020610786,0.0034695824,0.0073719085,0.003876107,0.0028345857,0.0025949467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036811634,0.000010622406,0.00012281901,0.000037468042,0.000004338151,0.00009498768,0.000096379044,0.00042583313,0.0003207498,0.98973644,0.0022164823,0.0068970826],"study_design_scores_gemma":[0.000011376574,0.000013422981,0.00015268619,0.000031559157,0.000008013455,0.00020880916,0.00009097948,0.0016589141,0.00072300044,0.9782146,0.018869221,0.000017479308],"about_ca_topic_score_codex":0.0011189599,"about_ca_topic_score_gemma":0.0015283761,"teacher_disagreement_score":0.027356133,"about_ca_system_score_codex":0.0008839745,"about_ca_system_score_gemma":0.0008788929,"threshold_uncertainty_score":0.0915153},"labels":[],"label_agreement":null},{"id":"W2398823088","doi":"","title":"Super (a, 1)-cycle-antimagic labeling of the grid.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Grid; Geometry","score_opus":0.007665879921163126,"score_gpt":0.20145772559808095,"score_spread":0.19379184567691782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398823088","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3372792,0.0011935616,0.38061982,0.00409325,0.00055303425,0.0002538352,0.004927223,0.0018100233,0.2692701],"genre_scores_gemma":[0.78932476,0.0005737677,0.16235267,0.0009735399,0.00013978542,0.0002118265,0.0028188908,0.00039063167,0.04321409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994599,0.00015386181,0.00003482346,0.0001375331,0.00009531783,0.000118638985],"domain_scores_gemma":[0.99839896,0.0005950913,0.00014906091,0.0004587495,0.00017515961,0.00022300554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043767286,0.00039531713,0.0005727223,0.0007441371,0.0017202605,0.0024395091,0.0012176991,0.0012401042,0.014925547],"category_scores_gemma":[0.0025607832,0.00038445037,0.0006630035,0.0012874282,0.0012437038,0.003459476,0.0020825318,0.001592637,0.0023354804],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017328035,0.000046132245,0.00057348184,0.00013667191,0.000015770936,0.00011644147,0.00018805008,0.003916935,0.0027761974,0.96230984,0.011823322,0.01792382],"study_design_scores_gemma":[0.000028264052,0.00001676587,0.00032471673,0.000022093604,0.000014773073,0.00013447349,0.00013554964,0.0112068085,0.0013591655,0.9761712,0.010576101,0.000010117436],"about_ca_topic_score_codex":0.002271439,"about_ca_topic_score_gemma":0.0038463164,"teacher_disagreement_score":0.014925547,"about_ca_system_score_codex":0.001173218,"about_ca_system_score_gemma":0.00089045113,"threshold_uncertainty_score":0.04993093},"labels":[],"label_agreement":null},{"id":"W2398825262","doi":"","title":"Key Pre-distribution Schemes based on Symplectic Geometry for Wireless Sensor Networks.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Symplectic geometry; Key (lock); Wireless sensor network; Mathematics; Distribution (mathematics); Wireless; Geometry; Computer science; Computer network; Telecommunications; Mathematical analysis; Computer security","score_opus":0.017762734598295638,"score_gpt":0.25182924702334936,"score_spread":0.23406651242505372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398825262","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040594473,0.0015552881,0.9331089,0.0012222461,0.0004048021,0.00023637782,0.00033751817,0.0004696787,0.022070765],"genre_scores_gemma":[0.89197594,0.0016229956,0.09367236,0.0003922415,0.00031476427,0.00037525798,0.00039294272,0.00012470348,0.011128871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979577,0.0008070881,0.00014985645,0.00020878336,0.0005753884,0.00030108503],"domain_scores_gemma":[0.9943698,0.0026899367,0.0004967592,0.0017683322,0.00039185103,0.00028324957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002132346,0.0007007796,0.0011130123,0.0010607808,0.0012855883,0.0019350261,0.0015377238,0.0008440273,0.0052975086],"category_scores_gemma":[0.00757742,0.00042252662,0.00067701,0.0013824037,0.002359947,0.005159479,0.0044040834,0.0025074352,0.0010348388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013504937,0.000034693374,0.00015836812,0.00009262045,0.000024509696,0.0000788423,0.000111655325,0.014111435,0.0019554687,0.95921946,0.0035710544,0.020506924],"study_design_scores_gemma":[0.0000755992,0.00012755572,0.00017749888,0.000044742206,0.0000236858,0.00020139688,0.0000771728,0.13014127,0.0018950473,0.8595926,0.007603607,0.00003977072],"about_ca_topic_score_codex":0.00028569682,"about_ca_topic_score_gemma":0.00050638244,"teacher_disagreement_score":0.0052975086,"about_ca_system_score_codex":0.0011963357,"about_ca_system_score_gemma":0.0013889327,"threshold_uncertainty_score":0.017721951},"labels":[],"label_agreement":null},{"id":"W2398841770","doi":"","title":"A note on circumferences in k-connected graphs with given independence number.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Independence (probability theory); Independence number; Combinatorics; Statistics; Graph","score_opus":0.018288032115619066,"score_gpt":0.27367901067847084,"score_spread":0.25539097856285176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398841770","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10928421,0.016442277,0.38252205,0.011687028,0.008773961,0.00012011961,0.0014892862,0.0016592646,0.46802184],"genre_scores_gemma":[0.7651828,0.011954799,0.1610489,0.0024001542,0.0065617226,0.0002379191,0.00091433804,0.00091159024,0.050787766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904007,0.00028140607,0.000063123414,0.0002937061,0.00022552111,0.00009605263],"domain_scores_gemma":[0.9955199,0.0027570315,0.00034873153,0.00060347095,0.00036375425,0.00040712932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008836346,0.00086250756,0.0010176755,0.002328642,0.0020267495,0.0023558247,0.0018841174,0.0012804345,0.010667658],"category_scores_gemma":[0.007882067,0.00065938174,0.0010971836,0.0030435913,0.0039969,0.0057056667,0.0028970963,0.0045530805,0.002004534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001183281,0.000027252367,0.0008910319,0.0002586138,0.00002865455,0.00039252747,0.0003926162,0.004616256,0.002373967,0.94332474,0.020357126,0.02721885],"study_design_scores_gemma":[0.000014216325,0.000054227112,0.0018941864,0.0000670214,0.000042720767,0.00073811377,0.0002553925,0.008972288,0.0010055384,0.94166446,0.045239333,0.000052565883],"about_ca_topic_score_codex":0.00186469,"about_ca_topic_score_gemma":0.0025916696,"teacher_disagreement_score":0.010667658,"about_ca_system_score_codex":0.00133751,"about_ca_system_score_gemma":0.00048652777,"threshold_uncertainty_score":0.03568685},"labels":[],"label_agreement":null},{"id":"W2398846996","doi":"","title":"On three types of (2, k)-distance Fibonacci numbers and number decompositions.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Mathematics; Combinatorics; Arithmetic","score_opus":0.011357114443891802,"score_gpt":0.27561798343774757,"score_spread":0.26426086899385576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398846996","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22600226,0.006232363,0.19429332,0.0038368437,0.002316612,0.00014315438,0.0007723101,0.00041160086,0.5659915],"genre_scores_gemma":[0.8600696,0.0022126022,0.07282797,0.0015023435,0.0006073693,0.00021757693,0.0007925326,0.00018198937,0.06158788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895203,0.00022178002,0.000075613454,0.00014122912,0.00032676494,0.00028255128],"domain_scores_gemma":[0.99784434,0.0009075092,0.0002476183,0.0003544618,0.0003583228,0.0002877772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010644966,0.0007002495,0.0005987301,0.0027357463,0.0030198423,0.005382696,0.001313692,0.0021880122,0.015081423],"category_scores_gemma":[0.005276349,0.000494517,0.0010265274,0.0024823132,0.004520271,0.0061885305,0.002702402,0.0025165933,0.0034173422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020340989,0.000005555971,0.00012326209,0.00002336848,0.0000022442864,0.000056423323,0.00015667152,0.00014189666,0.0002904885,0.9930502,0.0015551102,0.004574319],"study_design_scores_gemma":[0.000013052683,0.0000158185,0.00031750463,0.00006207426,0.000006928474,0.00043357405,0.00025017833,0.0013346205,0.00049193297,0.98533094,0.011720553,0.000022819906],"about_ca_topic_score_codex":0.0007546829,"about_ca_topic_score_gemma":0.0009706735,"teacher_disagreement_score":0.015081423,"about_ca_system_score_codex":0.0015920488,"about_ca_system_score_gemma":0.0006285602,"threshold_uncertainty_score":0.05045241},"labels":[],"label_agreement":null},{"id":"W2398851493","doi":"","title":"On the spectral radius of cactuses with n vertices and edge independence number q","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Food Chemistry and Fat Analysis","field":"Agricultural and Biological Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; Independence number; Enhanced Data Rates for GSM Evolution; Independence (probability theory); Combinatorics; RADIUS; Statistics; Eigenvalues and eigenvectors; Graph; Physics; Quantum mechanics; Telecommunications; Computer science","score_opus":0.008457570680912263,"score_gpt":0.18850442371711532,"score_spread":0.18004685303620305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398851493","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8449886,0.00272077,0.06407894,0.0021929229,0.00020744166,0.00006989651,0.00058178947,0.00037899488,0.08478076],"genre_scores_gemma":[0.98460627,0.0007835047,0.0074907383,0.00023621273,0.00027781693,0.000091367896,0.00032146228,0.00014181761,0.006050836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878746,0.00050142786,0.00004722997,0.00020229214,0.00024455652,0.00021701702],"domain_scores_gemma":[0.9843151,0.011426249,0.0017035495,0.00051845127,0.0005698663,0.0014667354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001845584,0.0011770205,0.0015079337,0.0037542153,0.0019012693,0.00253518,0.002406786,0.0015896577,0.009361655],"category_scores_gemma":[0.01369186,0.00085321884,0.00061743095,0.0015778563,0.00428486,0.0033051246,0.002470553,0.0017181394,0.0010449796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007346986,0.000119925964,0.003440012,0.0003016034,0.00007491532,0.00026508214,0.00072565867,0.040128615,0.0050968607,0.92887336,0.0071103303,0.013128927],"study_design_scores_gemma":[0.00011563428,0.000108679946,0.003702849,0.000117945536,0.00005712031,0.00036867737,0.00039685742,0.16255485,0.0020006723,0.82625127,0.0042425464,0.00008286848],"about_ca_topic_score_codex":0.00223633,"about_ca_topic_score_gemma":0.0014759164,"teacher_disagreement_score":0.009361655,"about_ca_system_score_codex":0.0015507784,"about_ca_system_score_gemma":0.00060452905,"threshold_uncertainty_score":0.03131783},"labels":[],"label_agreement":null},{"id":"W2398858628","doi":"","title":"The Randic index and girth of triangle-free graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Girth (graph theory); Combinatorics; Index (typography); Discrete mathematics; Computer science; World Wide Web","score_opus":0.014485845876847715,"score_gpt":0.2531955796723751,"score_spread":0.2387097337955274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398858628","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63687736,0.007322496,0.06954638,0.002553211,0.0007860211,0.00004746611,0.001121996,0.00032904616,0.28141597],"genre_scores_gemma":[0.9781858,0.0018870987,0.0074432553,0.0001759616,0.00040676384,0.000036008434,0.00032491738,0.00008739697,0.011452928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952066,0.00012184544,0.000022820403,0.00010558611,0.00013893042,0.00009008979],"domain_scores_gemma":[0.9977443,0.0011068109,0.0004243922,0.0002582547,0.00018632777,0.00027982745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005274025,0.0004442567,0.00059676316,0.0032320023,0.00092075864,0.0021009983,0.0009632444,0.00066834205,0.0076828473],"category_scores_gemma":[0.0057345955,0.00032064444,0.00031056756,0.0017351363,0.0021122252,0.0031954434,0.0015993272,0.0015625309,0.0012362435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001326293,0.00002727931,0.0019084036,0.00007805304,0.000020042466,0.00009479656,0.00035028215,0.0032113486,0.0020617854,0.96383023,0.005315529,0.022969628],"study_design_scores_gemma":[0.000015714224,0.000021420496,0.0016452189,0.000040396455,0.000018890907,0.00030026722,0.0001842324,0.007109884,0.0010269105,0.9825561,0.0070615993,0.00001939996],"about_ca_topic_score_codex":0.00086983806,"about_ca_topic_score_gemma":0.0011102019,"teacher_disagreement_score":0.0076828473,"about_ca_system_score_codex":0.0007133459,"about_ca_system_score_gemma":0.00032126773,"threshold_uncertainty_score":0.025701702},"labels":[],"label_agreement":null},{"id":"W2398865451","doi":"","title":"A note on the eigenvalues of graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Combinatorics; Physics","score_opus":0.024036333562208394,"score_gpt":0.29163706322232924,"score_spread":0.26760072966012083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398865451","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022586862,0.09279006,0.22507504,0.072191104,0.057428125,0.00005363193,0.00072345615,0.0012619647,0.5278898],"genre_scores_gemma":[0.4736598,0.09073806,0.14503576,0.02948738,0.05796887,0.00019235173,0.0006230146,0.001854109,0.20044059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941766,0.00017858406,0.00002403392,0.00011034157,0.00021773002,0.000051538314],"domain_scores_gemma":[0.99694073,0.002178611,0.00011544855,0.00034840676,0.00023840554,0.0001784991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008950598,0.0010269289,0.0008451319,0.001944061,0.0017670407,0.0021074554,0.0014638647,0.0015568496,0.013680596],"category_scores_gemma":[0.0045530396,0.00037658942,0.0007630992,0.0015047365,0.0041992837,0.0049539264,0.0017280468,0.0050232774,0.004440225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028889302,0.000022323306,0.00019135342,0.0001743295,0.000020474079,0.00033957354,0.0002463178,0.0009250323,0.001390901,0.8907644,0.087338164,0.01855829],"study_design_scores_gemma":[0.0000043617697,0.00001175167,0.0002653294,0.0000520585,0.0000075411203,0.00020681853,0.00009570679,0.001147362,0.0002985834,0.9108696,0.08702366,0.000017230072],"about_ca_topic_score_codex":0.00090637576,"about_ca_topic_score_gemma":0.0018270488,"teacher_disagreement_score":0.013680596,"about_ca_system_score_codex":0.00070285494,"about_ca_system_score_gemma":0.0003580381,"threshold_uncertainty_score":0.045766175},"labels":[],"label_agreement":null},{"id":"W2398868374","doi":"","title":"On Weak Magic Graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; MAGIC (telescope); Combinatorics; Astrophysics; Physics","score_opus":0.0095626772631334,"score_gpt":0.22364026434789303,"score_spread":0.21407758708475963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398868374","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1803014,0.006484605,0.29265177,0.012788142,0.0012446209,0.00016162415,0.0023408595,0.00090074865,0.50312614],"genre_scores_gemma":[0.8043054,0.004167165,0.08733118,0.0026155235,0.0010988147,0.000319837,0.002525181,0.00043613932,0.09720087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897325,0.00030457907,0.000051970757,0.00020324296,0.00026510537,0.00020199237],"domain_scores_gemma":[0.9964592,0.0019660008,0.00030528335,0.0005664626,0.00032072875,0.0003823714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010158385,0.00074975117,0.0008050607,0.0026533222,0.0025906812,0.0033551604,0.0014585215,0.0015138411,0.019037506],"category_scores_gemma":[0.0050663226,0.0006376356,0.0008209,0.0026698832,0.0030230957,0.009606317,0.0042090416,0.0034885015,0.0025651336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030093592,0.000016693746,0.00024308525,0.00006209254,0.0000071859936,0.00002205826,0.00009106582,0.00060625415,0.00030883565,0.9804913,0.006487836,0.011633431],"study_design_scores_gemma":[0.000007977297,0.000004797705,0.00014846405,0.000021664906,0.000006870311,0.000053666176,0.00006148657,0.002113972,0.000261771,0.99010706,0.0072070155,0.0000051819193],"about_ca_topic_score_codex":0.0012759373,"about_ca_topic_score_gemma":0.0023276217,"teacher_disagreement_score":0.019037506,"about_ca_system_score_codex":0.0018019576,"about_ca_system_score_gemma":0.0007410079,"threshold_uncertainty_score":0.06368685},"labels":[],"label_agreement":null},{"id":"W2398872670","doi":"","title":"Critical problems of totally isotropic subspaces in finite orthogonal spaces.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"advanced mathematical theories","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Linear subspace; Mathematics; Isotropy; Pure mathematics; Mathematical analysis; Physics","score_opus":0.021833414156411338,"score_gpt":0.3067298546039094,"score_spread":0.28489644044749807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398872670","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41048396,0.013355172,0.13966468,0.014899362,0.0013340861,0.00008434047,0.00056733977,0.00017896952,0.41943213],"genre_scores_gemma":[0.9589302,0.0023390322,0.010320826,0.00052665005,0.000857855,0.000053278003,0.00026945278,0.00006716523,0.02663555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952126,0.0001797644,0.000023931378,0.000052026648,0.00012002124,0.00010299725],"domain_scores_gemma":[0.9987404,0.0005882368,0.00015157247,0.000105504485,0.00016939733,0.00024492448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010044728,0.00060117006,0.00049488904,0.0016205126,0.0019736616,0.002435693,0.0006575393,0.0011309852,0.007124437],"category_scores_gemma":[0.003345248,0.00031885077,0.0005009252,0.0009124111,0.0041716704,0.0059158737,0.0021262933,0.0022790052,0.00049409526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004566174,0.0000030739568,0.000035491892,0.0000095044525,0.0000015932671,0.000012580406,0.00004632862,0.00015604746,0.00005486507,0.99823356,0.00075838674,0.0006840012],"study_design_scores_gemma":[0.0000050927256,0.0000031324305,0.00005759057,0.000008797603,0.0000019345223,0.000030189161,0.000072783325,0.0008217812,0.0000637613,0.99732864,0.0016039369,0.0000023803475],"about_ca_topic_score_codex":0.0013625727,"about_ca_topic_score_gemma":0.0014805257,"teacher_disagreement_score":0.007124437,"about_ca_system_score_codex":0.001424825,"about_ca_system_score_gemma":0.0009589873,"threshold_uncertainty_score":0.023833573},"labels":[],"label_agreement":null},{"id":"W2398883813","doi":"","title":"Hyperbolic Ellipses And Mobius Transformations.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematics and Applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Ellipse; Pure mathematics; Geometry","score_opus":0.03512856044500072,"score_gpt":0.2942653196898453,"score_spread":0.2591367592448446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398883813","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22654188,0.019162165,0.120154515,0.0049040136,0.0019334196,0.00005485372,0.0004896319,0.00041355978,0.62634593],"genre_scores_gemma":[0.85678935,0.004571323,0.01473115,0.00065946206,0.000811442,0.00003242071,0.00031196792,0.0001588965,0.12193397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997074,0.00008115672,0.000014954286,0.00006132426,0.00008849333,0.000046694295],"domain_scores_gemma":[0.9995982,0.00009771605,0.000084995605,0.00007365908,0.00007375995,0.00007167963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036674563,0.00046866437,0.00029539387,0.0011615576,0.0007752986,0.0016413531,0.0003400495,0.0005494132,0.010229042],"category_scores_gemma":[0.0016525782,0.00023273496,0.00032933443,0.00067808386,0.0019559704,0.002421728,0.0017314325,0.0015311401,0.0025923413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015814245,0.0000068482436,0.00018032045,0.000023782637,0.0000041770986,0.00005163578,0.00017861612,0.0002633273,0.00062536437,0.98578763,0.0028680612,0.009994553],"study_design_scores_gemma":[0.000012836204,0.00002332299,0.0007224705,0.000026055077,0.000007443805,0.00036894905,0.00031374054,0.0018558595,0.0007998148,0.94889075,0.04696644,0.000012316669],"about_ca_topic_score_codex":0.0007252866,"about_ca_topic_score_gemma":0.000630393,"teacher_disagreement_score":0.010229042,"about_ca_system_score_codex":0.0006223192,"about_ca_system_score_gemma":0.0002521913,"threshold_uncertainty_score":0.034219563},"labels":[],"label_agreement":null},{"id":"W2398930155","doi":"","title":"On Large Harmonious Graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.009509474416260674,"score_gpt":0.2276179691844375,"score_spread":0.2181084947681768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398930155","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34564438,0.003979209,0.40865058,0.008636602,0.00047537728,0.0002268045,0.002167282,0.0015112897,0.22870862],"genre_scores_gemma":[0.8520726,0.0015133348,0.095642544,0.0012874336,0.00034336324,0.00028604604,0.0019546307,0.00046251662,0.046437535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988469,0.00042566014,0.000049392627,0.0002600738,0.00020133471,0.0002165922],"domain_scores_gemma":[0.9952945,0.0025763721,0.00040181764,0.0010426055,0.00027623295,0.0004084101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011193356,0.0004523758,0.00096409227,0.0015166764,0.002207667,0.002768774,0.0015847152,0.0013718964,0.014784582],"category_scores_gemma":[0.006397644,0.0005303958,0.00062331045,0.0019416756,0.0020754396,0.007902386,0.0033207056,0.0020240028,0.0020946425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005607885,0.000040934483,0.00058385625,0.00012019248,0.000020674966,0.000060938943,0.00018504566,0.0056209313,0.00078260025,0.95793664,0.012441466,0.022150615],"study_design_scores_gemma":[0.000017554663,0.000012129738,0.00033661007,0.000025781052,0.000012050239,0.00011221603,0.00018922078,0.01522421,0.00066044857,0.97319895,0.010202596,0.0000082689785],"about_ca_topic_score_codex":0.0010209219,"about_ca_topic_score_gemma":0.0022998727,"teacher_disagreement_score":0.014784582,"about_ca_system_score_codex":0.0014536572,"about_ca_system_score_gemma":0.0006389928,"threshold_uncertainty_score":0.04945934},"labels":[],"label_agreement":null},{"id":"W2398932532","doi":"","title":"On kernels by monochromatic paths in D-join.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Join (topology); Monochromatic color; Mathematics; Combinatorics; Arithmetic; Optics; Physics","score_opus":0.023140048582915178,"score_gpt":0.2664887954333755,"score_spread":0.24334874685046032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398932532","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22716844,0.0016350419,0.65527606,0.001519116,0.00044850845,0.00017479042,0.0011178359,0.002105844,0.11055439],"genre_scores_gemma":[0.7843744,0.0010233526,0.16144814,0.0007837663,0.00031599554,0.00018180671,0.0014338086,0.0011434754,0.049295355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988959,0.00020714344,0.00006872214,0.00030809673,0.00027295048,0.00024720948],"domain_scores_gemma":[0.99756,0.00095336133,0.00026602254,0.00060337444,0.00027524182,0.00034186913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008974971,0.00049049885,0.00081796903,0.0015654743,0.0018205106,0.0027547076,0.0013866845,0.0010949981,0.013809852],"category_scores_gemma":[0.003584219,0.00048291,0.00087338686,0.001977056,0.0018932483,0.007642694,0.0046422407,0.0024571351,0.003266207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015018102,0.00007735775,0.00045876703,0.00011355984,0.000018034058,0.00018902263,0.0005095326,0.0019015556,0.0025272141,0.96132374,0.0056028794,0.02712822],"study_design_scores_gemma":[0.000023104527,0.00003302017,0.0003135455,0.000028844683,0.000022249558,0.0002320333,0.00019674652,0.008512015,0.0017728418,0.9757381,0.013109169,0.000018198847],"about_ca_topic_score_codex":0.0018368862,"about_ca_topic_score_gemma":0.0025607003,"teacher_disagreement_score":0.013809852,"about_ca_system_score_codex":0.0012531602,"about_ca_system_score_gemma":0.0005408688,"threshold_uncertainty_score":0.046198606},"labels":[],"label_agreement":null},{"id":"W2398950016","doi":"","title":"High Stopping-distance LDPC Product Codes based on Hamming and Finite Geometry Codes.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hamming distance; Hamming code; Low-density parity-check code; Hamming(7,4); Product (mathematics); Discrete mathematics; Combinatorics; Block code; Geometry; Algorithm; Decoding methods","score_opus":0.02093137100839676,"score_gpt":0.23514890308547776,"score_spread":0.214217532077081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398950016","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22868612,0.0020914343,0.71937895,0.00084576325,0.00028483177,0.00010167018,0.0005293989,0.001206622,0.046875235],"genre_scores_gemma":[0.89409083,0.0008277615,0.091642216,0.00016308515,0.0001136332,0.00008739139,0.00034876505,0.00016067331,0.012565648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990503,0.00026787166,0.0000518333,0.00011857928,0.00041520357,0.00009626591],"domain_scores_gemma":[0.9963678,0.0018617793,0.0003340157,0.0006956447,0.00054227,0.0001986001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075089553,0.0005482913,0.0005292267,0.001309264,0.00074303057,0.0013874295,0.0008687869,0.000740968,0.002970787],"category_scores_gemma":[0.006718298,0.00028778132,0.00029797637,0.00115675,0.0016087367,0.0014924991,0.0014903169,0.0012717897,0.00106499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022164083,0.00004378299,0.0010554374,0.00013298888,0.000024996783,0.00029188147,0.00025025872,0.03335166,0.0108206,0.9095083,0.003251069,0.041047383],"study_design_scores_gemma":[0.00006653547,0.00018376393,0.0007712106,0.000105360225,0.000033359855,0.00078760274,0.000065249485,0.2634274,0.020616053,0.6994651,0.014393561,0.000084773645],"about_ca_topic_score_codex":0.0008654869,"about_ca_topic_score_gemma":0.0011044466,"teacher_disagreement_score":0.002970787,"about_ca_system_score_codex":0.00097155996,"about_ca_system_score_gemma":0.0010268296,"threshold_uncertainty_score":0.00993824},"labels":[],"label_agreement":null},{"id":"W2398963575","doi":"","title":"Characterizing K r+1 -C k -graphic Sequences.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.031034303303532795,"score_gpt":0.26708092812215734,"score_spread":0.23604662481862454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398963575","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39888015,0.0011479191,0.4232174,0.0012870597,0.00045566325,0.00023804829,0.002140325,0.0018803488,0.17075312],"genre_scores_gemma":[0.8832821,0.00071299233,0.06444345,0.0005069991,0.00021369381,0.0001527077,0.00256092,0.00045955117,0.04766763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992687,0.00012985402,0.000066071174,0.00017664036,0.0002033376,0.00015535028],"domain_scores_gemma":[0.9983285,0.00057115906,0.00030188015,0.00027850847,0.0003505791,0.00016928113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037543522,0.00088548724,0.00047694778,0.002377169,0.0009891009,0.0033317553,0.0007598639,0.0010176135,0.014992578],"category_scores_gemma":[0.0043674903,0.00034692962,0.00045592478,0.0019567646,0.0012849235,0.0020940667,0.0015129246,0.0012676234,0.0051564034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035411151,0.00011397882,0.0026823673,0.0003653219,0.000036292637,0.000631127,0.0006838422,0.010038289,0.02758552,0.8371683,0.014341058,0.10599989],"study_design_scores_gemma":[0.000051325314,0.00015604426,0.0026200486,0.00014868166,0.000041335905,0.0017479653,0.0005554498,0.049475886,0.017367685,0.88383996,0.04389306,0.00010257219],"about_ca_topic_score_codex":0.0011443632,"about_ca_topic_score_gemma":0.001584596,"teacher_disagreement_score":0.014992578,"about_ca_system_score_codex":0.00093904603,"about_ca_system_score_gemma":0.0006430485,"threshold_uncertainty_score":0.050155103},"labels":[],"label_agreement":null},{"id":"W2398980986","doi":"","title":"Involution fixed sets of the M 24 maximal 2-local geometry chamber graph.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Involution (esoterism); Graph; Combinatorics; Geometry; Discrete mathematics; Pure mathematics","score_opus":0.011398755610013052,"score_gpt":0.2173701253467736,"score_spread":0.20597136973676056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398980986","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5915175,0.0005567908,0.10064489,0.0007622405,0.00027336075,0.00008738909,0.0012433715,0.000631372,0.30428302],"genre_scores_gemma":[0.9423328,0.00015696508,0.011373891,0.00012436298,0.000076393975,0.000050639934,0.00086374354,0.00022696932,0.044794213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997358,0.00004556062,0.00000905615,0.0000623623,0.00006488203,0.00008245715],"domain_scores_gemma":[0.9996847,0.00009130834,0.000049681137,0.000050943174,0.000037038488,0.00008634774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017012707,0.0004270259,0.00043031253,0.0011863258,0.0015754385,0.0017581567,0.00086788967,0.0006092611,0.016344246],"category_scores_gemma":[0.00061211747,0.00035395013,0.00044729176,0.00048786617,0.0014534703,0.0011809783,0.0015532951,0.0010606535,0.002465561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007098686,0.000019772497,0.00039402203,0.00003134683,0.000008362937,0.00023063047,0.00020034828,0.0014880317,0.0036925115,0.983469,0.0028049746,0.0075899092],"study_design_scores_gemma":[0.000039207578,0.000050996743,0.0022750502,0.000035385914,0.000023446235,0.00044393467,0.00046079655,0.009593453,0.008259698,0.94905037,0.029727997,0.00003964327],"about_ca_topic_score_codex":0.0018113427,"about_ca_topic_score_gemma":0.0026950368,"teacher_disagreement_score":0.016344246,"about_ca_system_score_codex":0.0008753155,"about_ca_system_score_gemma":0.00033596053,"threshold_uncertainty_score":0.05467695},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.032532937333796266,"score_gpt":0.2614451418722669,"score_spread":0.22891220453847066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399012647","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46242073,0.01326336,0.14781128,0.008230912,0.0010245371,0.00009408341,0.0014554515,0.0004812054,0.36521843],"genre_scores_gemma":[0.9624325,0.0024179367,0.006856107,0.00038433168,0.000403372,0.000053091186,0.00036887574,0.00016029092,0.026923396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992162,0.00024260776,0.00004746052,0.00021502817,0.00016485775,0.00011391463],"domain_scores_gemma":[0.99640095,0.0015736615,0.00066046603,0.0006696326,0.00030856827,0.00038674223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070121477,0.00059160485,0.00053267385,0.0020785627,0.0011136874,0.0037512095,0.0011294247,0.0012647014,0.012831623],"category_scores_gemma":[0.008060741,0.00058647856,0.00039516413,0.0016755004,0.004295244,0.009216356,0.0027007035,0.0029012135,0.0022224954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027377082,0.000008679216,0.0007085959,0.000037018162,0.000008354507,0.00003659806,0.0002826287,0.0009894603,0.0004576985,0.9895265,0.0017787021,0.00613829],"study_design_scores_gemma":[0.000008243617,0.0000057786706,0.0003565725,0.000017406875,0.000005400983,0.00008104114,0.00015913973,0.0012355372,0.00027386908,0.99225545,0.005592556,0.000009056528],"about_ca_topic_score_codex":0.0010751667,"about_ca_topic_score_gemma":0.0010539406,"teacher_disagreement_score":0.012831623,"about_ca_system_score_codex":0.0014741633,"about_ca_system_score_gemma":0.00038479103,"threshold_uncertainty_score":0.042926073},"labels":[],"label_agreement":null},{"id":"W2399040079","doi":"","title":"An implicit σ3 type condition for heavy cycles in weighted graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Type (biology); Combinatorics; Discrete mathematics","score_opus":0.02015552652005673,"score_gpt":0.31311620029136245,"score_spread":0.2929606737713057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399040079","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2610964,0.0010744298,0.40821135,0.0055214106,0.0031345526,0.00030731643,0.0023299027,0.001969991,0.31635466],"genre_scores_gemma":[0.8734734,0.0005884752,0.071297966,0.0024580345,0.0008983827,0.0004393752,0.0016528089,0.0009827361,0.048208803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842924,0.00035157707,0.0001411393,0.00033947962,0.0003743047,0.0003641338],"domain_scores_gemma":[0.9937324,0.0027714646,0.00045880282,0.0010648381,0.0012243432,0.000748157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016064148,0.0005364696,0.0007680656,0.0014493832,0.0027096444,0.0033143503,0.0020150975,0.002992008,0.02792932],"category_scores_gemma":[0.013289412,0.00072240114,0.0012643075,0.0016337398,0.00263538,0.008427581,0.003265515,0.004132304,0.0043776287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011167963,0.00003336741,0.0005682068,0.000090932845,0.000008274489,0.00020115929,0.00022491955,0.00041461358,0.0018996628,0.9817963,0.0057558515,0.008895012],"study_design_scores_gemma":[0.000032413864,0.000019325158,0.00027785305,0.000047892663,0.000014017111,0.00021370253,0.00018312201,0.0036636684,0.0017661997,0.9846827,0.009075717,0.000023296321],"about_ca_topic_score_codex":0.0015615625,"about_ca_topic_score_gemma":0.0021073723,"teacher_disagreement_score":0.02792932,"about_ca_system_score_codex":0.0012764254,"about_ca_system_score_gemma":0.0013888294,"threshold_uncertainty_score":0.09343284},"labels":[],"label_agreement":null},{"id":"W2399041719","doi":"","title":"Dominating cycles in graphs with high connectivity.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.010654861714400502,"score_gpt":0.2649386056327673,"score_spread":0.2542837439183668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399041719","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7024543,0.0070991754,0.20228769,0.004608477,0.0004143379,0.00017313864,0.0013114457,0.0005965618,0.08105481],"genre_scores_gemma":[0.9624734,0.0018290268,0.024139863,0.00038431468,0.0002389115,0.00009515912,0.00063522445,0.00008081605,0.010123215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993888,0.00020683359,0.000027006983,0.00014074834,0.0001298212,0.0001066911],"domain_scores_gemma":[0.9942151,0.0038494735,0.00052629533,0.000358287,0.00050203485,0.0005487448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005279485,0.0004105052,0.000498462,0.0020649384,0.0013258455,0.0023306566,0.00080855074,0.0011162806,0.005704079],"category_scores_gemma":[0.0064862776,0.00050228066,0.00037152867,0.0017997426,0.0014781731,0.003021491,0.0015367959,0.0009999012,0.0007621907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025711863,0.0000748031,0.0053701885,0.00060218124,0.00007687716,0.0010234796,0.00095320534,0.018468153,0.007692814,0.8930828,0.016234003,0.056164414],"study_design_scores_gemma":[0.000055133096,0.000066520144,0.0021772045,0.00009766057,0.000064729145,0.0012959059,0.00056074606,0.031349413,0.0033013565,0.94406354,0.01693985,0.000027856522],"about_ca_topic_score_codex":0.0009897796,"about_ca_topic_score_gemma":0.0017111811,"teacher_disagreement_score":0.005704079,"about_ca_system_score_codex":0.00083249545,"about_ca_system_score_gemma":0.0004182302,"threshold_uncertainty_score":0.01908201},"labels":[],"label_agreement":null},{"id":"W2399042833","doi":"","title":"Perfect T(G)-triple system for each graph G with five vertices and seven edges.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics","score_opus":0.005249714212594095,"score_gpt":0.1757565902402147,"score_spread":0.1705068760276206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399042833","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50669485,0.0007558371,0.2301463,0.0016068477,0.0011465503,0.00036020597,0.006861159,0.002018732,0.25040948],"genre_scores_gemma":[0.9358707,0.00023550993,0.035547744,0.00035330266,0.000062855645,0.00013436098,0.0023176572,0.0001338369,0.025344016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996327,0.00006298665,0.00002621126,0.00008399122,0.000060948936,0.00013323534],"domain_scores_gemma":[0.9993388,0.000103362276,0.00011405928,0.00016210876,0.00013444466,0.00014718059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027741032,0.00037793812,0.0004130274,0.0012426019,0.001899577,0.0015400545,0.00057714316,0.0009970061,0.027832512],"category_scores_gemma":[0.0010182618,0.00019456568,0.00045015677,0.0008963237,0.0008620363,0.0015414181,0.0012065495,0.0005898432,0.0035834424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003324219,0.00007694096,0.0021811668,0.00033401014,0.00006686724,0.0008097018,0.00034607228,0.004396517,0.020092107,0.9222788,0.02496123,0.02412414],"study_design_scores_gemma":[0.000087240674,0.00024189422,0.0036937932,0.00013353102,0.0001077258,0.0019639013,0.0012299834,0.028285528,0.02272873,0.8759852,0.06543152,0.00011097191],"about_ca_topic_score_codex":0.0014330101,"about_ca_topic_score_gemma":0.0022909446,"teacher_disagreement_score":0.027832512,"about_ca_system_score_codex":0.00066262257,"about_ca_system_score_gemma":0.0008517652,"threshold_uncertainty_score":0.09310901},"labels":[],"label_agreement":null},{"id":"W2399045001","doi":"","title":"On the existence of well-ordered Steiner triple systems.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Steiner system; Steiner tree problem; Combinatorics","score_opus":0.007221895857537034,"score_gpt":0.19084084095041395,"score_spread":0.1836189450928769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399045001","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2918932,0.0059199436,0.41848263,0.0046602413,0.0007100846,0.00010837844,0.0011296201,0.00032087686,0.27677497],"genre_scores_gemma":[0.9275613,0.0030876936,0.047383346,0.000640091,0.00035342845,0.000103566956,0.0007155381,0.00009727684,0.02005789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992225,0.0002503509,0.0000407888,0.0001134629,0.00020653212,0.00016637347],"domain_scores_gemma":[0.99525225,0.003194228,0.0003669399,0.00037278197,0.0004693508,0.00034437314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090001523,0.0004111236,0.0005900785,0.0019666653,0.0017037651,0.0026980618,0.0007351034,0.0014413998,0.011149171],"category_scores_gemma":[0.0060487804,0.0006276425,0.00046897156,0.0015178757,0.0024284082,0.0059839115,0.0022294596,0.0022005204,0.0015018872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028309485,0.000015375696,0.00023850336,0.000054251643,0.000007796387,0.00008839272,0.00014790265,0.0019956145,0.00067579874,0.9882576,0.0029425588,0.0055478844],"study_design_scores_gemma":[0.000008518283,0.000013133293,0.0001468582,0.000027864604,0.0000057682455,0.00016513729,0.00017131583,0.006289059,0.0003735022,0.98938155,0.0034081792,0.000009232815],"about_ca_topic_score_codex":0.00067873683,"about_ca_topic_score_gemma":0.001130297,"teacher_disagreement_score":0.011149171,"about_ca_system_score_codex":0.0009231472,"about_ca_system_score_gemma":0.00058247324,"threshold_uncertainty_score":0.037297666},"labels":[],"label_agreement":null},{"id":"W2399054797","doi":"","title":"Isolated toughness and fractional (g, f)-factors of graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Toughness; Combinatorics; Composite material; Materials science","score_opus":0.019546276796687002,"score_gpt":0.2792752380993891,"score_spread":0.25972896130270207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399054797","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76748013,0.0020131809,0.10305549,0.0022686776,0.00040278825,0.00006167069,0.00042503985,0.00044574856,0.1238472],"genre_scores_gemma":[0.97849256,0.00035745063,0.008415567,0.00021035114,0.00016288536,0.00003403369,0.00016998661,0.000071555136,0.012085632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992514,0.00013647664,0.000031072304,0.00020973258,0.00016612539,0.00020504321],"domain_scores_gemma":[0.9969983,0.0012422543,0.000502358,0.00027062837,0.00024145182,0.00074491545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006057956,0.0006356491,0.0007130502,0.002451648,0.0031458044,0.00289311,0.0008215002,0.0011057995,0.011076751],"category_scores_gemma":[0.00504885,0.0005085623,0.0007335498,0.0012669904,0.0041980715,0.00417952,0.0021717947,0.0017223926,0.0008496135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086438544,0.000024194975,0.0008213917,0.00005165105,0.000015113719,0.000186309,0.0005999432,0.0011947076,0.0015263982,0.9868581,0.0021211372,0.0065145176],"study_design_scores_gemma":[0.000015617992,0.0000151366985,0.0006258251,0.00002649297,0.000015135023,0.00022174235,0.0003240492,0.0033841575,0.0005933482,0.99017274,0.00459029,0.000015339565],"about_ca_topic_score_codex":0.0031864734,"about_ca_topic_score_gemma":0.003210564,"teacher_disagreement_score":0.011076751,"about_ca_system_score_codex":0.0012940654,"about_ca_system_score_gemma":0.00048796574,"threshold_uncertainty_score":0.037055433},"labels":[],"label_agreement":null},{"id":"W2399055054","doi":"","title":"An upper bound on the restrained domination number of graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Domination analysis; Combinatorics; Upper and lower bounds; Graph; Mathematical analysis","score_opus":0.015612913422797987,"score_gpt":0.30682830933692234,"score_spread":0.2912153959141244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399055054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3402816,0.008746412,0.34117147,0.006060714,0.0011540694,0.00030321893,0.004978662,0.003266642,0.29403725],"genre_scores_gemma":[0.9027503,0.0027905342,0.06620387,0.0010987914,0.00061258115,0.00032599314,0.002034046,0.0005331674,0.023650663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975963,0.00040775485,0.000106361804,0.000579637,0.0007746828,0.0005352925],"domain_scores_gemma":[0.9805766,0.01267611,0.00083600753,0.0038072146,0.0009883157,0.0011157999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016933221,0.0010896896,0.0013606742,0.002417067,0.001981884,0.0027736789,0.0040869033,0.0016166723,0.014550709],"category_scores_gemma":[0.01704531,0.0007110701,0.0010472334,0.0025502392,0.002426113,0.0062225955,0.0028267791,0.0038664402,0.0026900365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011704386,0.00044324077,0.005537438,0.0012479577,0.00023744989,0.0007552229,0.00093663885,0.07472691,0.031723034,0.6882745,0.04575727,0.14918981],"study_design_scores_gemma":[0.00007338489,0.00014402276,0.0039497335,0.00018715269,0.000170953,0.0012220286,0.00016086925,0.11786568,0.012610696,0.8306389,0.032884818,0.00009182021],"about_ca_topic_score_codex":0.0010632869,"about_ca_topic_score_gemma":0.0021927592,"teacher_disagreement_score":0.014550709,"about_ca_system_score_codex":0.0018844545,"about_ca_system_score_gemma":0.0009042378,"threshold_uncertainty_score":0.048676968},"labels":[],"label_agreement":null},{"id":"W2399073212","doi":"","title":"Small Randic Index Ordering of Trees with k Pendant Vertices","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Index (typography); Topological index; Computer science","score_opus":0.03309090112862159,"score_gpt":0.26681670660905,"score_spread":0.2337258054804284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399073212","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84138066,0.00066767295,0.064778134,0.00054394134,0.00018486423,0.00016982871,0.0013248057,0.0005415051,0.090408556],"genre_scores_gemma":[0.9431953,0.0002598517,0.036136743,0.00019916776,0.000070564216,0.00007983066,0.0014685163,0.00022908267,0.018360963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994597,0.000098448145,0.000038923426,0.00011832111,0.00012618673,0.00015841571],"domain_scores_gemma":[0.9980001,0.0005482131,0.00030889906,0.0003246169,0.00027843993,0.00053981727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031370408,0.00034002098,0.0006888591,0.0015804215,0.0021028286,0.0022844982,0.0008595269,0.00075927033,0.0073086596],"category_scores_gemma":[0.0019856724,0.00045879066,0.00043983478,0.0013652296,0.0009987287,0.0015498601,0.00080907595,0.0011284213,0.0010087813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014847241,0.00026098258,0.0065587326,0.00041388828,0.000043298187,0.0016400476,0.0012184544,0.014616791,0.05032347,0.8615704,0.011569342,0.05029981],"study_design_scores_gemma":[0.00025383016,0.0002788683,0.007475265,0.00009807971,0.00012324555,0.0014481867,0.0011457858,0.07720884,0.014503789,0.865492,0.031877145,0.00009498798],"about_ca_topic_score_codex":0.0017188091,"about_ca_topic_score_gemma":0.0045279157,"teacher_disagreement_score":0.0073086596,"about_ca_system_score_codex":0.00087795214,"about_ca_system_score_gemma":0.00086250546,"threshold_uncertainty_score":0.024449885},"labels":[],"label_agreement":null},{"id":"W2399076206","doi":"","title":"The harmonic index on bicyclic graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Bicyclic molecule; Harmonic; Combinatorics; Discrete mathematics; Computer science; Chemistry; Physics; Stereochemistry; Acoustics; World Wide Web","score_opus":0.022356351551239044,"score_gpt":0.272689249318243,"score_spread":0.25033289776700396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399076206","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4658087,0.0075397333,0.066526085,0.0036506096,0.0014602416,0.0000720026,0.0013973092,0.00032561462,0.45321974],"genre_scores_gemma":[0.95907575,0.0025160993,0.0058404785,0.00038326744,0.0006374622,0.00005466123,0.00047092914,0.00011712721,0.030904174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961877,0.00006923535,0.000016181115,0.00006737954,0.00013751956,0.000090888105],"domain_scores_gemma":[0.9988526,0.00045189826,0.00020440135,0.000121563746,0.00014890735,0.00022052588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003317157,0.0004128105,0.0005784533,0.003244253,0.0010466439,0.0022197436,0.00089847465,0.0008896175,0.0106093995],"category_scores_gemma":[0.0028999352,0.00025665088,0.00020437571,0.0020874667,0.0017206135,0.0031643242,0.0019366192,0.0013203708,0.0017172669],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045406698,0.000011840098,0.00038852874,0.00006408491,0.0000061800033,0.000049151487,0.00016715641,0.001004395,0.0010113755,0.9766044,0.005297081,0.01535041],"study_design_scores_gemma":[0.000008379846,0.000011101111,0.00062722724,0.000031016007,0.000006548301,0.00013741454,0.00012826509,0.0049404833,0.00049186184,0.9865578,0.0070475806,0.00001250171],"about_ca_topic_score_codex":0.0013467554,"about_ca_topic_score_gemma":0.0015552167,"teacher_disagreement_score":0.0106093995,"about_ca_system_score_codex":0.0011987186,"about_ca_system_score_gemma":0.00034180577,"threshold_uncertainty_score":0.035491943},"labels":[],"label_agreement":null},{"id":"W2399095305","doi":"","title":"A combinatorial proof of a general two-term recurrence.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Term (time); Mathematics; Combinatorial proof; Combinatorics; Physics; Astronomy","score_opus":0.020140550437565602,"score_gpt":0.26238613102318215,"score_spread":0.24224558058561654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399095305","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036720257,0.002173238,0.675425,0.008233437,0.0028694333,0.00020257327,0.0013148604,0.001733344,0.27132794],"genre_scores_gemma":[0.7493874,0.0014915543,0.17115587,0.00491696,0.00209819,0.00046578885,0.001415877,0.00090179086,0.06816658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989373,0.00026381412,0.0000859668,0.00026886348,0.00030804044,0.00013602566],"domain_scores_gemma":[0.9972907,0.0015836988,0.00016485812,0.0004221024,0.00037932378,0.00015920462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001198472,0.0008311424,0.00079832436,0.001046451,0.002070866,0.0026047742,0.0021495423,0.0015744299,0.02416209],"category_scores_gemma":[0.005738272,0.00064705097,0.0023066357,0.0014280465,0.0030803736,0.0056174733,0.0032853012,0.0036406487,0.004298994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020666423,0.000023274939,0.00009864694,0.00009984774,0.000013047793,0.00032582082,0.00018005105,0.00057937566,0.0010192078,0.9852483,0.0063482895,0.0060435524],"study_design_scores_gemma":[0.000022288767,0.000014268321,0.00014802186,0.00003299021,0.000024194414,0.00040075215,0.000054281805,0.0034086728,0.0008256359,0.98010856,0.014939354,0.000020981497],"about_ca_topic_score_codex":0.0013988802,"about_ca_topic_score_gemma":0.0019849355,"teacher_disagreement_score":0.02416209,"about_ca_system_score_codex":0.001559901,"about_ca_system_score_gemma":0.0009234753,"threshold_uncertainty_score":0.08083022},"labels":[],"label_agreement":null},{"id":"W2399115445","doi":"","title":"Correction of 2-dimensional occasional and cluster errors in LRTJ-spaces.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Medical Imaging and Analysis","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cluster (spacecraft); Computer science; Programming language","score_opus":0.01128989037533122,"score_gpt":0.22988306439908357,"score_spread":0.21859317402375236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399115445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018016007,0.00052777014,0.9738062,0.00036936507,0.00072882033,0.000041897412,0.00042413533,0.0026718748,0.0034139156],"genre_scores_gemma":[0.26585793,0.00046175966,0.71551055,0.0002657032,0.0003082543,0.00010449128,0.0017174969,0.0024161746,0.013357552],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953661,0.0015524281,0.0002799117,0.00082137506,0.0016199112,0.0003602823],"domain_scores_gemma":[0.98800606,0.0033345344,0.00075980334,0.0043582493,0.0029684901,0.00057286466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045548705,0.001240262,0.0012412387,0.0021030887,0.0013162919,0.0027156053,0.0028857547,0.0017302692,0.011837164],"category_scores_gemma":[0.032578833,0.00051708583,0.0009540111,0.0022835156,0.001668261,0.0028957454,0.0047164815,0.0026055784,0.005147651],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001548141,0.00017660734,0.007451451,0.0011778513,0.00030110992,0.00080066494,0.001037045,0.14220032,0.025391527,0.185321,0.046395414,0.58819884],"study_design_scores_gemma":[0.000049097074,0.00018609656,0.0031839933,0.00015898656,0.000061483646,0.0008018124,0.00046205576,0.8160641,0.03489928,0.11017135,0.03383489,0.0001268422],"about_ca_topic_score_codex":0.0030265886,"about_ca_topic_score_gemma":0.0040133935,"teacher_disagreement_score":0.011837164,"about_ca_system_score_codex":0.0007445517,"about_ca_system_score_gemma":0.002065081,"threshold_uncertainty_score":0.03959924},"labels":[],"label_agreement":null},{"id":"W2399115616","doi":"","title":"On perfect matchings of complements of line graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Strong perfect graph theorem; Combinatorics; Line (geometry); Line graph; Graph; Pathwidth; Geometry","score_opus":0.01831039347412789,"score_gpt":0.30327599173074093,"score_spread":0.28496559825661305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399115616","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50682503,0.0026643104,0.22480623,0.0025474955,0.0007151901,0.00024215726,0.0018262166,0.0008243415,0.25954908],"genre_scores_gemma":[0.9215063,0.0015511921,0.03995878,0.0006416884,0.00041761,0.00014567772,0.001714831,0.0002848999,0.033778958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985598,0.00046264607,0.00007681762,0.0002923228,0.000296954,0.00031146582],"domain_scores_gemma":[0.99547136,0.002553649,0.00075387623,0.00035993027,0.00040513536,0.00045608645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092399766,0.00066634436,0.0010391823,0.0029172238,0.0029139817,0.0038336925,0.0012758906,0.0018484761,0.016483406],"category_scores_gemma":[0.007819328,0.00084836653,0.00106984,0.0027222938,0.0028093301,0.008460551,0.0030039903,0.0018867782,0.0020540133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009424171,0.00004108447,0.0006709693,0.00009586173,0.000022211103,0.00022056221,0.00031101084,0.001778341,0.00075015036,0.9803945,0.004557744,0.01106328],"study_design_scores_gemma":[0.000023135688,0.00002549838,0.0005017631,0.00006969662,0.000029865743,0.0003545808,0.0003200317,0.008158407,0.0008191452,0.98021704,0.009462267,0.00001867048],"about_ca_topic_score_codex":0.0024097646,"about_ca_topic_score_gemma":0.0030096422,"teacher_disagreement_score":0.016483406,"about_ca_system_score_codex":0.0016265189,"about_ca_system_score_gemma":0.0007817474,"threshold_uncertainty_score":0.055142462},"labels":[],"label_agreement":null},{"id":"W2399124203","doi":"","title":"Chromatic Equivalence Classes of Certain Generalized Polygon Trees, II.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Polygon (computer graphics); Equivalence (formal languages); Combinatorics; Discrete mathematics; Computer science","score_opus":0.024112489386356562,"score_gpt":0.2922007125848054,"score_spread":0.2680882231984488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399124203","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77330226,0.0003604876,0.030188262,0.0009805581,0.00010290032,0.000073783725,0.00065939594,0.00022848402,0.194104],"genre_scores_gemma":[0.9796814,0.00030529802,0.0053524137,0.00010538819,0.000068606256,0.000036608013,0.0006930331,0.000073010226,0.013684341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996687,0.000041587107,0.000010801383,0.00008016063,0.00009387551,0.000104753766],"domain_scores_gemma":[0.9994324,0.00021869488,0.00009232805,0.00007675082,0.00007612959,0.0001036272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021414242,0.0002540566,0.00033480037,0.0013234736,0.0014791271,0.002594743,0.000788332,0.000645921,0.0142282555],"category_scores_gemma":[0.0012005423,0.00027576115,0.000436874,0.0011259549,0.0014734062,0.0021032149,0.0009275087,0.0016803417,0.00068021525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010031353,0.000048010075,0.001499832,0.00005288194,0.000010663407,0.00019570791,0.00052773545,0.0018244714,0.003408662,0.97324365,0.0035129192,0.0155750895],"study_design_scores_gemma":[0.00005866423,0.000051717656,0.008725977,0.00005534722,0.000050315746,0.00059069245,0.00091054244,0.018468866,0.0045231734,0.9411883,0.025350936,0.000025415264],"about_ca_topic_score_codex":0.0031931703,"about_ca_topic_score_gemma":0.003453993,"teacher_disagreement_score":0.0142282555,"about_ca_system_score_codex":0.0017711534,"about_ca_system_score_gemma":0.00036141358,"threshold_uncertainty_score":0.047598243},"labels":[],"label_agreement":null},{"id":"W2399130979","doi":"","title":"Erratum to: A note on the eigenvalues of graphs.","year":2011,"lang":"en","type":"erratum","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Pure mathematics; Physics; Quantum mechanics","score_opus":0.04054091030955258,"score_gpt":0.2947746094875079,"score_spread":0.2542336991779553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399130979","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023176195,0.0037064608,0.0015445192,0.057226367,0.9209559,0.000026870439,0.00060450623,0.00023673073,0.015466823],"genre_scores_gemma":[0.015719056,0.02836071,0.012738769,0.12030638,0.40615568,0.00025102973,0.003252595,0.0021648116,0.41105092],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964563,0.0006718556,0.00054606365,0.00047892632,0.0016005072,0.0002462457],"domain_scores_gemma":[0.98641425,0.005493065,0.00068914145,0.00095548877,0.0058572777,0.00059067784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025980386,0.0027645272,0.0016323669,0.0048212446,0.004308555,0.0039597023,0.0043082745,0.0052292706,0.04160201],"category_scores_gemma":[0.034687024,0.0009843347,0.0015368111,0.003984164,0.0035103108,0.00613505,0.0020341538,0.00936039,0.033317577],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026225925,0.000006836524,0.000033293512,0.000103334176,0.0000059994745,0.0001211179,0.000024961553,0.00005544626,0.00005275458,0.003938837,0.9900962,0.005535043],"study_design_scores_gemma":[0.000014320081,0.000020612502,0.00047423903,0.00025768933,0.000023085588,0.00048182343,0.000088497116,0.0002927671,0.00026673733,0.010112179,0.98792565,0.00004241925],"about_ca_topic_score_codex":0.008531502,"about_ca_topic_score_gemma":0.012438384,"teacher_disagreement_score":0.04160201,"about_ca_system_score_codex":0.0042862375,"about_ca_system_score_gemma":0.0028162946,"threshold_uncertainty_score":0.13917261},"labels":[],"label_agreement":null},{"id":"W2399137304","doi":"","title":"A sharp lower bound of index of the cacti with perfect matchings.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Upper and lower bounds; Combinatorics; Computer science; Mathematical analysis","score_opus":0.004872046313962504,"score_gpt":0.1824899825303213,"score_spread":0.1776179362163588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399137304","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21223298,0.01969216,0.22095834,0.010582068,0.0029501305,0.00026414686,0.0028309529,0.0017745597,0.5287147],"genre_scores_gemma":[0.9140094,0.005067581,0.043049064,0.0014256513,0.00251521,0.000359151,0.0011546961,0.00055086496,0.03186832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99710506,0.00041659348,0.00011249671,0.0005963535,0.0010137946,0.00075572],"domain_scores_gemma":[0.98102725,0.012088309,0.0011712402,0.0021271599,0.0011209105,0.0024651096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023848654,0.0015874548,0.002231412,0.005027357,0.003324399,0.00687786,0.0044889897,0.0029959634,0.018268827],"category_scores_gemma":[0.029272227,0.00091299333,0.001118176,0.0036162776,0.004178891,0.010133329,0.0050939284,0.006576191,0.0039078626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034871013,0.00011161752,0.0012819187,0.00033496623,0.000052441952,0.00023794231,0.00037163778,0.0071592135,0.0041202456,0.9460904,0.020512978,0.019377928],"study_design_scores_gemma":[0.000051621,0.00008873731,0.0010584625,0.00016280776,0.00008262397,0.0006304457,0.000121658595,0.042445324,0.0033015832,0.93490154,0.017088016,0.000067130284],"about_ca_topic_score_codex":0.0014758869,"about_ca_topic_score_gemma":0.001537557,"teacher_disagreement_score":0.018268827,"about_ca_system_score_codex":0.0040364037,"about_ca_system_score_gemma":0.0020310848,"threshold_uncertainty_score":0.061115324},"labels":[],"label_agreement":null},{"id":"W2399152850","doi":"","title":"On the diameter of integral circulant graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Circulant matrix; Combinatorics; Pure mathematics","score_opus":0.03791610771237618,"score_gpt":0.28301306312267793,"score_spread":0.24509695541030174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399152850","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4909139,0.035505123,0.1988377,0.013204364,0.0025116298,0.00009152054,0.0017444679,0.00072690216,0.25646433],"genre_scores_gemma":[0.9468895,0.011211738,0.022885459,0.001024759,0.0033565918,0.00014558519,0.0006634867,0.00043813084,0.013384792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900454,0.00028162697,0.000037787104,0.00023933168,0.00022432991,0.00021236172],"domain_scores_gemma":[0.9857759,0.010318794,0.001119062,0.00058292394,0.00073935505,0.0014638895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001475688,0.00090535945,0.0014246921,0.0044311727,0.0017173103,0.0030855527,0.0019727938,0.0016988615,0.005935513],"category_scores_gemma":[0.015324778,0.00070461043,0.00056992256,0.0024139672,0.0040522185,0.0069304686,0.002499432,0.0033676194,0.0013487726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011423957,0.00003945861,0.0012723214,0.00017513502,0.000023302326,0.00011354356,0.0003535863,0.005510322,0.0021648325,0.96583265,0.011371939,0.013028726],"study_design_scores_gemma":[0.000022128033,0.000029870327,0.0013287372,0.00008725414,0.000031829168,0.00032804837,0.00020766252,0.022861795,0.0008748132,0.965124,0.009078423,0.000025396881],"about_ca_topic_score_codex":0.0015168822,"about_ca_topic_score_gemma":0.0013233898,"teacher_disagreement_score":0.005935513,"about_ca_system_score_codex":0.002548739,"about_ca_system_score_gemma":0.0005480933,"threshold_uncertainty_score":0.019856274},"labels":[],"label_agreement":null},{"id":"W2399152852","doi":"","title":"Completing the Spectrum of Resolvable (K 4 -e)-Designs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectrum (functional analysis); Combinatorics; Physics; Quantum mechanics","score_opus":0.016407215714548735,"score_gpt":0.20716864664477389,"score_spread":0.19076143093022516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399152852","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36927158,0.0012979987,0.41437212,0.00196203,0.00036778557,0.00017028832,0.0019737023,0.00089792913,0.2096866],"genre_scores_gemma":[0.90070987,0.0009385199,0.063600816,0.00071156566,0.00027868152,0.00026937452,0.0012391198,0.00029760678,0.031954486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997195,0.00078197115,0.00016639555,0.0005424659,0.0007349022,0.0005792133],"domain_scores_gemma":[0.9938806,0.0033915846,0.000619484,0.0011219726,0.00061657117,0.000369681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013716755,0.0008654403,0.00095226936,0.0017021511,0.0018221247,0.0033511845,0.0011559355,0.001480427,0.019656418],"category_scores_gemma":[0.0060284766,0.00062112755,0.00089573127,0.0014066263,0.0020689287,0.0032863894,0.002830307,0.0022526477,0.00445864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033939822,0.00008456722,0.0005728348,0.00016652486,0.000035394954,0.0002746738,0.00036587392,0.003996183,0.0069504343,0.94841594,0.0044852397,0.03431296],"study_design_scores_gemma":[0.00006759961,0.00005606546,0.00041865275,0.000051035087,0.000013708008,0.00037017238,0.00015255484,0.0061510806,0.0025470427,0.98111236,0.0090340255,0.000025732928],"about_ca_topic_score_codex":0.0004928363,"about_ca_topic_score_gemma":0.0005605296,"teacher_disagreement_score":0.019656418,"about_ca_system_score_codex":0.00075477385,"about_ca_system_score_gemma":0.00085213216,"threshold_uncertainty_score":0.065757275},"labels":[],"label_agreement":null},{"id":"W2399164534","doi":"","title":"A note on the minus edge domination number in graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Computer science; Artificial intelligence","score_opus":0.014579100765571505,"score_gpt":0.2773220108462605,"score_spread":0.262742910080689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399164534","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056383595,0.043651134,0.24953917,0.04365995,0.048819434,0.00009675724,0.001497541,0.0016059583,0.5547465],"genre_scores_gemma":[0.7139313,0.023859775,0.1376362,0.014092056,0.026866904,0.00024093661,0.0009216669,0.0013943112,0.081056915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842644,0.00045513254,0.000116597905,0.00037018268,0.000496691,0.00013495314],"domain_scores_gemma":[0.9902682,0.0068444153,0.00038080252,0.0011371505,0.00092020154,0.00044932237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021769984,0.0010038773,0.0012193426,0.0028186268,0.0018144983,0.0031246378,0.0026251539,0.001715324,0.011005104],"category_scores_gemma":[0.013788205,0.00042430783,0.0008427724,0.0028166226,0.0046479283,0.00864211,0.0024795,0.005600192,0.0023359947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012251627,0.000030236935,0.0005223573,0.00029143336,0.00002753509,0.00019158672,0.0001178542,0.0013683281,0.0017678604,0.91953534,0.037425,0.038599994],"study_design_scores_gemma":[0.000011223836,0.00003167781,0.0004288659,0.0000692237,0.000025550338,0.00036072222,0.00004237686,0.002509998,0.00079929497,0.951591,0.04409922,0.00003085747],"about_ca_topic_score_codex":0.0008550146,"about_ca_topic_score_gemma":0.0011045771,"teacher_disagreement_score":0.011005104,"about_ca_system_score_codex":0.0013308725,"about_ca_system_score_gemma":0.0006844603,"threshold_uncertainty_score":0.036815763},"labels":[],"label_agreement":null},{"id":"W2399172791","doi":"","title":"Bounds for the b-chromatic number of the Mycielskian of some families of graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics; Discrete mathematics","score_opus":0.019614785908221532,"score_gpt":0.2500169102352779,"score_spread":0.23040212432705637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399172791","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38376662,0.008364576,0.16349201,0.012951658,0.00066746015,0.00016603373,0.0045590596,0.0010114658,0.42502108],"genre_scores_gemma":[0.94446236,0.0019357626,0.034342006,0.00074854994,0.00034632988,0.00026260968,0.0012495331,0.00024226146,0.016410634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999231,0.00019704197,0.000033242843,0.00019218678,0.00017809188,0.00016848189],"domain_scores_gemma":[0.9929092,0.0046513774,0.0005168733,0.00047864715,0.00053101906,0.00091295765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015534697,0.0008431576,0.0006626043,0.00443313,0.0025247843,0.003338698,0.0022721642,0.0014189923,0.016434774],"category_scores_gemma":[0.007650749,0.0005570674,0.0007147306,0.002398242,0.0026846395,0.0050516417,0.0021343303,0.0034627703,0.0016835019],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002650922,0.00007624404,0.002786614,0.00022700676,0.00005580943,0.00007955687,0.00033158725,0.0061302646,0.0037282726,0.95347345,0.017682299,0.015163721],"study_design_scores_gemma":[0.000055666314,0.000034921635,0.0035505742,0.00011050042,0.000066239925,0.00024388455,0.00025785688,0.03416696,0.0025438482,0.9425626,0.016356247,0.0000506734],"about_ca_topic_score_codex":0.0030822763,"about_ca_topic_score_gemma":0.0047221733,"teacher_disagreement_score":0.016434774,"about_ca_system_score_codex":0.003451653,"about_ca_system_score_gemma":0.0009281589,"threshold_uncertainty_score":0.05497974},"labels":[],"label_agreement":null},{"id":"W2399186566","doi":"","title":"The Stopping Distance of Binary BCH-code Parity-check Matrices.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"BCH code; Mathematics; Binary number; Parity-check matrix; Parity (physics); Arithmetic; Low-density parity-check code; Statistics; Decoding methods; Physics; Particle physics","score_opus":0.019755213949642483,"score_gpt":0.24235684418828476,"score_spread":0.22260163023864227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399186566","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59759235,0.0031348974,0.24115887,0.003259033,0.0006483589,0.00011951087,0.0013512915,0.00050981797,0.15222584],"genre_scores_gemma":[0.96567833,0.00075056445,0.017949626,0.00034683596,0.00018394196,0.00012635264,0.0006584135,0.000097198965,0.014208731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987319,0.0003720302,0.000071030096,0.00015549357,0.0004110215,0.00025848392],"domain_scores_gemma":[0.99351865,0.003811576,0.00063181185,0.00050503435,0.0007812087,0.0007516881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013037844,0.00052245037,0.00055886916,0.0014782738,0.0010537414,0.0016344921,0.0010164914,0.0012104535,0.0052421996],"category_scores_gemma":[0.01225392,0.00023842869,0.00025077187,0.00082417234,0.0018179968,0.0018977426,0.0021458187,0.001665453,0.0016819447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000270856,0.00004950043,0.0010072862,0.00010224976,0.000020160205,0.00013952023,0.00023367468,0.012296411,0.004769608,0.95522755,0.0045792926,0.021303799],"study_design_scores_gemma":[0.00003843491,0.0000932543,0.00063958816,0.000058455196,0.000008831274,0.00020697857,0.000078971396,0.04642437,0.0032038,0.94450265,0.0047121765,0.000032488457],"about_ca_topic_score_codex":0.00045935757,"about_ca_topic_score_gemma":0.0004644102,"teacher_disagreement_score":0.0052421996,"about_ca_system_score_codex":0.001120166,"about_ca_system_score_gemma":0.0013539024,"threshold_uncertainty_score":0.017536879},"labels":[],"label_agreement":null},{"id":"W2399194235","doi":"","title":"On the Graceful Conjecture of Permutation Graphs of Paths.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Conjecture; Permutation (music); Combinatorics; Permutation graph; Discrete mathematics; Graph","score_opus":0.012217092392140286,"score_gpt":0.2677866521883211,"score_spread":0.2555695597961808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399194235","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33369097,0.0053787325,0.15145493,0.035679787,0.0026339544,0.00014351249,0.0017863545,0.0018247663,0.46740693],"genre_scores_gemma":[0.9390926,0.0027339444,0.013419966,0.0036861205,0.002113102,0.000105491396,0.0012626967,0.0004925177,0.037093576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825424,0.00043308866,0.000076109776,0.00042199882,0.00042200406,0.0003925094],"domain_scores_gemma":[0.98844916,0.0067412667,0.00095383625,0.002421063,0.00057937397,0.0008552702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022592377,0.0010837303,0.0013740406,0.001657351,0.004454637,0.005128887,0.0020591961,0.003310048,0.019990107],"category_scores_gemma":[0.0152269695,0.000902986,0.0017230641,0.002266341,0.008640954,0.015280805,0.004707427,0.005189176,0.0031727236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010106613,0.00003245884,0.00052500743,0.000070317335,0.000013147416,0.000118016724,0.00033372187,0.0020392775,0.00026852146,0.9809887,0.008765221,0.0067444737],"study_design_scores_gemma":[0.00001072128,0.0000067065184,0.00012409293,0.000012720317,0.0000067522506,0.000043882144,0.000051442563,0.0012281598,0.00010652044,0.99582905,0.0025736976,0.000006250567],"about_ca_topic_score_codex":0.0038798999,"about_ca_topic_score_gemma":0.0034498856,"teacher_disagreement_score":0.019990107,"about_ca_system_score_codex":0.0020640376,"about_ca_system_score_gemma":0.0012543573,"threshold_uncertainty_score":0.06687361},"labels":[],"label_agreement":null},{"id":"W2399198710","doi":"","title":"A note on B-T unitals in PG(2, q 2 ).","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.00832955309734428,"score_gpt":0.23864861226549516,"score_spread":0.23031905916815087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399198710","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050466865,0.014488404,0.15991366,0.021223133,0.018701274,0.00013518616,0.00065091165,0.001826987,0.73259354],"genre_scores_gemma":[0.67811716,0.013619734,0.101352915,0.009719968,0.0063579176,0.0002979103,0.0005820065,0.00085351884,0.18909894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995578,0.00012244197,0.000029715626,0.00006122107,0.0001222716,0.00010654817],"domain_scores_gemma":[0.99930584,0.0003073124,0.00006021537,0.000119698445,0.00008532219,0.00012163399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054323016,0.0005944366,0.0006429974,0.001397498,0.0026793173,0.0026339542,0.0012409277,0.0015807925,0.019026097],"category_scores_gemma":[0.0020824652,0.00033801794,0.0006148911,0.0021029345,0.0022941772,0.00453226,0.0028319384,0.003719637,0.0057987724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010672962,0.000026266978,0.00012383911,0.00010972793,0.000007481406,0.00045758035,0.00022378839,0.0004583186,0.0012503813,0.92168295,0.036389194,0.039163742],"study_design_scores_gemma":[0.000019932415,0.000059963564,0.00027183376,0.00007013902,0.000010425264,0.0005459295,0.00015684144,0.0012804641,0.001699209,0.8459213,0.14993156,0.0000322961],"about_ca_topic_score_codex":0.0015839715,"about_ca_topic_score_gemma":0.0023150248,"teacher_disagreement_score":0.019026097,"about_ca_system_score_codex":0.0008489317,"about_ca_system_score_gemma":0.0006131431,"threshold_uncertainty_score":0.06364864},"labels":[],"label_agreement":null},{"id":"W2399209726","doi":"","title":"Infinite Symmetric Groups.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics; Symmetric group; Combinatorics","score_opus":0.06065675029818076,"score_gpt":0.32637699097028305,"score_spread":0.2657202406721023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399209726","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027306704,0.009529719,0.040120985,0.004953463,0.0014598655,0.000036777183,0.0010119863,0.0004185202,0.9151621],"genre_scores_gemma":[0.679392,0.0054982905,0.019820385,0.0018122965,0.0017780395,0.00011257898,0.0016031913,0.00024936502,0.2897339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953854,0.00011251098,0.000025134706,0.000094527044,0.00016486015,0.00006438013],"domain_scores_gemma":[0.99952745,0.00013576247,0.000054608725,0.00010491392,0.00010684082,0.00007048922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004695701,0.0006442558,0.00047717022,0.0015770904,0.0012674809,0.0022048738,0.0005874951,0.00070948445,0.022992438],"category_scores_gemma":[0.0013050237,0.00023508738,0.00041353112,0.0009350298,0.0018983652,0.003776149,0.0016553868,0.0017203686,0.005936464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010769852,0.000007683021,0.000091359034,0.000023189412,0.0000031108655,0.000024959263,0.0001010989,0.00006768487,0.00024442442,0.9826497,0.007357694,0.009418239],"study_design_scores_gemma":[0.0000066362354,0.000007602069,0.0001833546,0.000021204705,0.0000052314617,0.00013295248,0.000081906284,0.00046728455,0.00040027787,0.94471586,0.053973045,0.000004580577],"about_ca_topic_score_codex":0.00084235537,"about_ca_topic_score_gemma":0.00120044,"teacher_disagreement_score":0.022992438,"about_ca_system_score_codex":0.0011790359,"about_ca_system_score_gemma":0.0005379238,"threshold_uncertainty_score":0.07691735},"labels":[],"label_agreement":null},{"id":"W2399212034","doi":"","title":"The distance spectral radius of graphs with given independence number.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Independence number; Spectral radius; Independence (probability theory); RADIUS; Combinatorics; Statistics; Graph; Computer science; Computer security; Physics; Eigenvalues and eigenvectors; Quantum mechanics","score_opus":0.021968393292283225,"score_gpt":0.27668511697224774,"score_spread":0.2547167236799645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399212034","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70491034,0.0024231984,0.17206234,0.0027626764,0.00028671237,0.000052021445,0.0017506387,0.0006358138,0.115116246],"genre_scores_gemma":[0.97957796,0.0006936327,0.012956282,0.000177702,0.0002197619,0.000061072955,0.0005614177,0.00011999897,0.005632191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894255,0.00038995722,0.00004085799,0.00023032614,0.00025239412,0.0001439362],"domain_scores_gemma":[0.9915093,0.005239481,0.0010472358,0.0006279237,0.0006079577,0.00096807774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009773872,0.00057623704,0.00075470837,0.0025851696,0.0011094587,0.0022436269,0.0014705699,0.0010184204,0.0058263973],"category_scores_gemma":[0.0108826775,0.000385324,0.00037197044,0.0015605994,0.00219537,0.0033836304,0.0017377548,0.0014117655,0.0013533102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027940696,0.00005543621,0.0019138757,0.00016463723,0.000044540164,0.000108778,0.00033979738,0.013274216,0.0040296046,0.9568696,0.00751005,0.015410069],"study_design_scores_gemma":[0.00003217388,0.000046763635,0.003031716,0.000045373916,0.000038269347,0.000529646,0.00029199498,0.07142737,0.003231817,0.91453004,0.006760387,0.000034484267],"about_ca_topic_score_codex":0.00075753906,"about_ca_topic_score_gemma":0.00059869786,"teacher_disagreement_score":0.0058263973,"about_ca_system_score_codex":0.001231472,"about_ca_system_score_gemma":0.00037292822,"threshold_uncertainty_score":0.019491196},"labels":[],"label_agreement":null},{"id":"W2399215448","doi":"","title":"On (P, 1)-total labelling of special 1-planar graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Labelling; Combinatorics; Planar; Planar graph; Graph; Computer science; Chemistry; Computer graphics (images)","score_opus":0.019423689320487755,"score_gpt":0.22871429671827873,"score_spread":0.20929060739779098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399215448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37195534,0.002048445,0.3947036,0.004549383,0.00054560613,0.00021425333,0.0030209508,0.0016939996,0.22126843],"genre_scores_gemma":[0.81933737,0.0017378335,0.13414013,0.0014496959,0.00042419814,0.0003186938,0.003853277,0.0007338481,0.038004998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987715,0.00040801568,0.000061695275,0.00028541757,0.0002087194,0.00026469992],"domain_scores_gemma":[0.995243,0.0029202367,0.00046318304,0.00077396765,0.00025646252,0.00034312616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00110955,0.0006971628,0.00090992084,0.0014898458,0.0021350638,0.0034077263,0.0018661976,0.0017668752,0.010349581],"category_scores_gemma":[0.0056111375,0.0007133638,0.0010797513,0.0022640033,0.0027701922,0.0063039013,0.0031829616,0.0025810318,0.0018546035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017127016,0.00007363281,0.000852582,0.00025024853,0.000023104169,0.00011487836,0.0003557984,0.0076135285,0.0020152978,0.9434871,0.013830671,0.031211795],"study_design_scores_gemma":[0.000031724783,0.000020595393,0.0004610049,0.00003928461,0.000020162941,0.00017087515,0.00017651398,0.013316092,0.00095827226,0.9775325,0.007255531,0.000017487688],"about_ca_topic_score_codex":0.0019798325,"about_ca_topic_score_gemma":0.0029509023,"teacher_disagreement_score":0.010349581,"about_ca_system_score_codex":0.0021275308,"about_ca_system_score_gemma":0.0008668148,"threshold_uncertainty_score":0.03462279},"labels":[],"label_agreement":null},{"id":"W2399224012","doi":"","title":"Matroids With Every Two Elements In A 4-Circuit.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Matroid; Mathematics; Combinatorics","score_opus":0.005286969072210409,"score_gpt":0.18507687910867732,"score_spread":0.1797899100364669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399224012","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29425007,0.0014431428,0.2640369,0.005034859,0.0009592958,0.00025843017,0.0044480194,0.0009389783,0.42863026],"genre_scores_gemma":[0.79356194,0.00064377004,0.08757823,0.0013681155,0.00034837823,0.00025645673,0.0025136753,0.00015388938,0.113575585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993303,0.00015150674,0.00004556734,0.00015815793,0.00015145661,0.00016309174],"domain_scores_gemma":[0.9988464,0.00038539246,0.00022040067,0.0002330454,0.00018007768,0.0001347222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026716728,0.00054352457,0.00044665392,0.000870158,0.0014843958,0.0025469856,0.0012487491,0.0012317278,0.026449049],"category_scores_gemma":[0.0014893465,0.00040429644,0.00058912684,0.0010806107,0.00085168204,0.0029985027,0.0014229965,0.0016151014,0.004209851],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025805185,0.0001337173,0.0006783398,0.0001860199,0.000067311,0.000447554,0.00023354564,0.0048965337,0.00802248,0.93241906,0.017186765,0.0354706],"study_design_scores_gemma":[0.000074929885,0.00009329035,0.00090525724,0.000085371765,0.00006042932,0.0008912951,0.0003538035,0.024313662,0.008000907,0.89308935,0.072092004,0.000039734587],"about_ca_topic_score_codex":0.0010684707,"about_ca_topic_score_gemma":0.0021168243,"teacher_disagreement_score":0.026449049,"about_ca_system_score_codex":0.0010859304,"about_ca_system_score_gemma":0.0006911623,"threshold_uncertainty_score":0.08848089},"labels":[],"label_agreement":null},{"id":"W2399230524","doi":"","title":"Subspaces in d-bounded distance-regular graphs and authemtication code with perfect secrecy.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Linear subspace; Bounded function; Secrecy; Code (set theory); Discrete mathematics; Combinatorics; Pure mathematics; Computer science; Computer security; Mathematical analysis; Programming language","score_opus":0.027371213552851627,"score_gpt":0.25827809322165385,"score_spread":0.23090687966880222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399230524","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5537432,0.0016648057,0.34942007,0.004044436,0.00023593147,0.00014473693,0.0024708118,0.0005865159,0.08768959],"genre_scores_gemma":[0.9651878,0.0006467729,0.020150313,0.0003636041,0.00012972174,0.00011117487,0.00072351977,0.00006414812,0.012623019],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880874,0.00046916032,0.000057881294,0.0001533432,0.0002480411,0.00026288562],"domain_scores_gemma":[0.9950223,0.002695798,0.0008298667,0.0005760468,0.0004123007,0.0004637127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007737424,0.00047542562,0.0006296281,0.0010612003,0.0011360889,0.0016959922,0.0008581566,0.00091086497,0.0042436924],"category_scores_gemma":[0.0042329542,0.00034209396,0.0004892946,0.0014469415,0.0017071278,0.0024028223,0.0026763577,0.0013423995,0.00091580744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016229536,0.000032531065,0.00044611143,0.00007572554,0.000017582695,0.00022320212,0.0002212361,0.020297281,0.0013983272,0.9653089,0.0043143495,0.0075023724],"study_design_scores_gemma":[0.000038971004,0.00003158172,0.00026414316,0.000026794263,0.000011143189,0.00023871973,0.00014678048,0.07687617,0.0007574207,0.91869724,0.0028906446,0.00002040997],"about_ca_topic_score_codex":0.0017209223,"about_ca_topic_score_gemma":0.0015378272,"teacher_disagreement_score":0.0042436924,"about_ca_system_score_codex":0.0009864339,"about_ca_system_score_gemma":0.0008810838,"threshold_uncertainty_score":0.014196575},"labels":[],"label_agreement":null},{"id":"W2399231126","doi":"","title":"The extremal generalized θ-graphs with respect to Hosoya index.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Combinatorics; Discrete mathematics; Computer science","score_opus":0.041818750121829305,"score_gpt":0.29623188556539204,"score_spread":0.25441313544356275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399231126","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6915611,0.0010690803,0.05631521,0.0018527333,0.0003550234,0.000059392638,0.000637811,0.00045463452,0.24769495],"genre_scores_gemma":[0.9803508,0.00038708223,0.0059420066,0.000244534,0.00017306964,0.000042239775,0.00025815354,0.00007736714,0.012524738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961615,0.00009122297,0.000013121264,0.00007557185,0.00009346654,0.00011054224],"domain_scores_gemma":[0.9990538,0.00026234423,0.00020351655,0.00014422239,0.00013783139,0.00019836082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041512342,0.00042296265,0.0005280242,0.0019508796,0.0015817779,0.0023198063,0.000755981,0.0010278764,0.010477699],"category_scores_gemma":[0.0024328332,0.00027583397,0.000358598,0.0010379921,0.0019050463,0.0026486143,0.0013407883,0.0014078008,0.0010398498],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055738226,0.000010680837,0.0003488538,0.000026887417,0.000006940343,0.00008580734,0.00008383393,0.00096836983,0.0009304196,0.9909388,0.0015875337,0.004956198],"study_design_scores_gemma":[0.00001968351,0.00001587567,0.00094066514,0.000021383941,0.0000114432705,0.00019858986,0.00020121688,0.0053229704,0.0005864779,0.98891187,0.0037563576,0.000013338408],"about_ca_topic_score_codex":0.0012720205,"about_ca_topic_score_gemma":0.0015468068,"teacher_disagreement_score":0.010477699,"about_ca_system_score_codex":0.00087637367,"about_ca_system_score_gemma":0.00047605598,"threshold_uncertainty_score":0.035051346},"labels":[],"label_agreement":null},{"id":"W2399259489","doi":"","title":"Stratified Graphs and Distance Graphs.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chordal graph; Pathwidth; Combinatorics; Graph; Line graph","score_opus":0.012345431544107287,"score_gpt":0.2620143591608478,"score_spread":0.24966892761674053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399259489","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13458931,0.043379664,0.2967989,0.014510364,0.0028825281,0.000089264024,0.0017647212,0.0009252133,0.50506],"genre_scores_gemma":[0.8166348,0.016809793,0.056576096,0.0028576958,0.0021656554,0.00012304666,0.0018668314,0.00026997007,0.10269616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940765,0.00018554891,0.00003069121,0.0001288389,0.00015625768,0.00009096889],"domain_scores_gemma":[0.998425,0.0008347798,0.00017721679,0.00020068121,0.00017963421,0.00018267076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056479714,0.00051767816,0.00066865614,0.0021110666,0.001420077,0.0025455204,0.00071753113,0.0009369208,0.011198357],"category_scores_gemma":[0.002954774,0.0003694491,0.0005384853,0.0025558928,0.0021982316,0.0052245446,0.0017230758,0.0022659427,0.0027858154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000106518855,0.000010080136,0.00021247467,0.000040276544,0.00000730139,0.00004684966,0.00013596147,0.00034520487,0.00027378177,0.9817364,0.006400101,0.010780886],"study_design_scores_gemma":[0.0000036166537,0.000005823075,0.0002541401,0.00001942788,0.0000069113144,0.00012269212,0.00011140508,0.0008206857,0.00015389478,0.9785864,0.019909821,0.000005228898],"about_ca_topic_score_codex":0.0015270655,"about_ca_topic_score_gemma":0.002390283,"teacher_disagreement_score":0.011198357,"about_ca_system_score_codex":0.0013737613,"about_ca_system_score_gemma":0.00046484955,"threshold_uncertainty_score":0.037462294},"labels":[],"label_agreement":null},{"id":"W2399264752","doi":"","title":"Scores des tournois localement transitifs.","year":2014,"lang":"fr","type":"article","venue":"Ars Combinatoria","topic":"China's Global Influence and Migration","field":"Social Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.016074236825173737,"score_gpt":0.27863659980354927,"score_spread":0.26256236297837554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399264752","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8091985,0.0012746118,0.12385536,0.00120134,0.0004878313,0.00022334779,0.00537448,0.0014394168,0.056945093],"genre_scores_gemma":[0.9544625,0.0003996972,0.016228538,0.0000893356,0.000302136,0.00017772877,0.004367191,0.00019603955,0.02377694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99715495,0.0008313876,0.00013408896,0.0006621267,0.0007376652,0.00047975985],"domain_scores_gemma":[0.9940304,0.0031622164,0.00043872287,0.00046669593,0.0009340632,0.000967808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029580223,0.0015341545,0.0022247974,0.0048763263,0.001861395,0.0054925294,0.0012163086,0.001158441,0.035010636],"category_scores_gemma":[0.012324869,0.0002753361,0.0015871244,0.0025190506,0.002044125,0.0019334197,0.0020121557,0.0021281384,0.0027092693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0046391455,0.00094454206,0.13422239,0.001014377,0.001497336,0.0008020415,0.0011270866,0.09640526,0.007705604,0.42999178,0.03905095,0.28259954],"study_design_scores_gemma":[0.0010387736,0.0030084867,0.21489158,0.00034172792,0.00065980555,0.0020101625,0.0028437392,0.54315484,0.011098276,0.16613527,0.054535404,0.0002819222],"about_ca_topic_score_codex":0.021241719,"about_ca_topic_score_gemma":0.02458689,"teacher_disagreement_score":0.035010636,"about_ca_system_score_codex":0.0038199828,"about_ca_system_score_gemma":0.002037562,"threshold_uncertainty_score":0.11712223},"labels":[],"label_agreement":null},{"id":"W2399271050","doi":"","title":"Bivariate Gaussian Fibonacci and Lucas polynomials","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bivariate analysis; Fibonacci polynomials; Fibonacci number; Lucas number; Orthogonal polynomials; Classical orthogonal polynomials; Combinatorics; Statistics","score_opus":0.0073650630182698585,"score_gpt":0.2470437135957124,"score_spread":0.23967865057744253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399271050","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39616254,0.0073884404,0.33870146,0.005938154,0.0011851134,0.00009287937,0.00075020327,0.0004893274,0.24929196],"genre_scores_gemma":[0.9241419,0.0026503908,0.026477093,0.00061243115,0.0011259478,0.0000817315,0.00024470707,0.00009941009,0.044566322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994875,0.00013406135,0.000019890973,0.00007662078,0.0001643828,0.000117496005],"domain_scores_gemma":[0.9985965,0.00063975895,0.0002518975,0.00013197295,0.00023895846,0.0001409418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093660044,0.00093685836,0.0009006625,0.0033950566,0.0021715683,0.003263656,0.00085355097,0.0016257478,0.008639431],"category_scores_gemma":[0.0058827475,0.00052198494,0.00074335746,0.0032624851,0.0040907925,0.0034827804,0.0015028471,0.002206199,0.0015662219],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072777852,0.0000024425885,0.00006534901,0.000007362106,0.000001092438,0.000030997075,0.000056949848,0.0003889983,0.00010884842,0.9973417,0.0004722403,0.001516593],"study_design_scores_gemma":[0.000005870202,0.0000034563814,0.00014721723,0.000007645956,0.0000038296325,0.00009343268,0.000047552337,0.0027332806,0.000099183606,0.9936521,0.0031941286,0.00001225209],"about_ca_topic_score_codex":0.002871198,"about_ca_topic_score_gemma":0.0028302774,"teacher_disagreement_score":0.008639431,"about_ca_system_score_codex":0.0021193658,"about_ca_system_score_gemma":0.0010823214,"threshold_uncertainty_score":0.028901756},"labels":[],"label_agreement":null},{"id":"W2399302252","doi":"","title":"The Minimal Limit Point of the Third Largest Laplacian Eigenvalues of Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Limit (mathematics); Laplace operator; Point (geometry); Pure mathematics; Combinatorics; Mathematical analysis; Geometry; Physics; Quantum mechanics","score_opus":0.024939416277588812,"score_gpt":0.2732886954738027,"score_spread":0.24834927919621388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399302252","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6446857,0.0026722748,0.19580688,0.0057910616,0.00086155045,0.000082367405,0.0006697416,0.0012473771,0.14818312],"genre_scores_gemma":[0.9688975,0.00059920544,0.015308267,0.000366382,0.00030798014,0.00012413131,0.00021330801,0.00022676654,0.0139565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971014,0.00007450534,0.000010856474,0.0000543022,0.000084944426,0.00006519895],"domain_scores_gemma":[0.99816173,0.0006657257,0.0002712772,0.00014328075,0.0002933248,0.00046469737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057607563,0.00060074904,0.00060094206,0.002627112,0.0011964315,0.00259383,0.0012481065,0.001578262,0.009012189],"category_scores_gemma":[0.0057211095,0.00035573356,0.0005214675,0.0007320386,0.0023368173,0.0021829035,0.0014976114,0.0016812074,0.001989954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014861254,0.00006316894,0.0009163786,0.00012186936,0.000025381993,0.00032988953,0.00031054497,0.0029398443,0.0070956307,0.9709383,0.0068425434,0.010267764],"study_design_scores_gemma":[0.000044045402,0.000039789502,0.0013002586,0.00006125079,0.000014468971,0.0005130256,0.00027936912,0.031361103,0.0029000975,0.95990855,0.0035468123,0.00003125164],"about_ca_topic_score_codex":0.00071391335,"about_ca_topic_score_gemma":0.00079344056,"teacher_disagreement_score":0.009012189,"about_ca_system_score_codex":0.0011040664,"about_ca_system_score_gemma":0.0005764977,"threshold_uncertainty_score":0.030148804},"labels":[],"label_agreement":null},{"id":"W2399307741","doi":"","title":"On super connectedness and super restricted edge-connectedness of total graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Social connectedness; Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Discrete mathematics; Computer science; Telecommunications; Social psychology; Psychology","score_opus":0.01126689764005305,"score_gpt":0.24872080505315078,"score_spread":0.23745390741309774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399307741","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52087235,0.0045831036,0.22852115,0.0046872916,0.00033683018,0.0001038745,0.0011622398,0.000491245,0.23924188],"genre_scores_gemma":[0.9543399,0.0025938095,0.026137123,0.0010285336,0.00048135055,0.00012280369,0.0009331972,0.00022683051,0.014136337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910283,0.00028179868,0.000050961182,0.00023380922,0.00021495538,0.000115587434],"domain_scores_gemma":[0.99089944,0.006179366,0.00065674295,0.0009248541,0.0006171871,0.000722389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013489781,0.00061342487,0.00069742,0.002992836,0.0015671797,0.0020884622,0.0014748478,0.0010912337,0.011641051],"category_scores_gemma":[0.0078489715,0.00067566545,0.0008277593,0.002972424,0.0038363447,0.008565216,0.0023106576,0.002557757,0.00074951927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043645032,0.000022641208,0.0008645694,0.00012111139,0.000020542266,0.00012624268,0.00035885078,0.0015267216,0.0010202868,0.9856031,0.0022828714,0.008009335],"study_design_scores_gemma":[0.000008521379,0.000012307682,0.0008394219,0.000032971006,0.000023768016,0.00021117355,0.000176809,0.0042973314,0.00031167522,0.99118656,0.0028907587,0.000008670891],"about_ca_topic_score_codex":0.0012732715,"about_ca_topic_score_gemma":0.0017781394,"teacher_disagreement_score":0.011641051,"about_ca_system_score_codex":0.00087619666,"about_ca_system_score_gemma":0.00040696704,"threshold_uncertainty_score":0.03894323},"labels":[],"label_agreement":null},{"id":"W2399318769","doi":"","title":"Partial permutation decoding of some binary codes from graphs on triples.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Permutation (music); Combinatorics; Binary number; Decoding methods; Discrete mathematics; Arithmetic; Algorithm","score_opus":0.014593370501067508,"score_gpt":0.2449338908685824,"score_spread":0.23034052036751487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399318769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43943602,0.0010114524,0.46402964,0.002960607,0.00046858622,0.00029141747,0.0028815165,0.00100103,0.087919876],"genre_scores_gemma":[0.9296385,0.0004745161,0.050759826,0.00038717056,0.00015205867,0.00012846137,0.001320025,0.00023710229,0.016902402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991617,0.00024377454,0.00004534781,0.000111785586,0.00024131507,0.00019602783],"domain_scores_gemma":[0.9978568,0.0010572723,0.00020373733,0.0004156697,0.00033425746,0.00013222049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006262342,0.0004906207,0.00053199066,0.0008364963,0.0012583775,0.0016084082,0.00055672345,0.0010348448,0.0037660222],"category_scores_gemma":[0.00541142,0.00032258994,0.00064886996,0.0011595925,0.0011563743,0.001818382,0.0012798955,0.0014228908,0.000964821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002700652,0.000058681002,0.00071561313,0.00013124975,0.000030975043,0.0006170454,0.00043033023,0.015156275,0.008710631,0.9334016,0.008124139,0.032353412],"study_design_scores_gemma":[0.00003120464,0.00004955469,0.0004152445,0.000042986943,0.000021917718,0.00042540685,0.00011226863,0.071890496,0.009590582,0.91224784,0.0051414203,0.000030976746],"about_ca_topic_score_codex":0.0017502168,"about_ca_topic_score_gemma":0.001639265,"teacher_disagreement_score":0.0037660222,"about_ca_system_score_codex":0.0009217352,"about_ca_system_score_gemma":0.0013180388,"threshold_uncertainty_score":0.012598634},"labels":[],"label_agreement":null},{"id":"W2399320116","doi":"","title":"Equality in Vizing’s conjecture fixing one factor of the Cartesian product.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Mathematics; Bipartite graph; Conjecture; Combinatorics; Vertex (graph theory); Product (mathematics); Enhanced Data Rates for GSM Evolution; Discrete mathematics; Graph; Geometry","score_opus":0.0228087891237739,"score_gpt":0.2871580980097687,"score_spread":0.26434930888599484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399320116","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54209805,0.0011179236,0.13783114,0.01325579,0.0016780676,0.00013885916,0.00074369484,0.00045416993,0.30268243],"genre_scores_gemma":[0.9637294,0.00023528976,0.015726253,0.0008693711,0.00029636297,0.00004900215,0.0003968281,0.000089086694,0.018608443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901044,0.0002598714,0.00005457746,0.00027591764,0.00016807146,0.00023117432],"domain_scores_gemma":[0.9980685,0.0009005654,0.0001579058,0.00039423653,0.0003062375,0.00017253037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011671826,0.00041145744,0.000639051,0.0006454721,0.0020618516,0.0015512066,0.0009731353,0.0025067194,0.015586961],"category_scores_gemma":[0.007685102,0.00028581236,0.0008973928,0.0006657966,0.0041202004,0.004503884,0.0018537139,0.0021857105,0.001437982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006582517,0.000019707551,0.0007274629,0.00003839413,0.000009781827,0.00014437184,0.00027753235,0.0015293525,0.00040388692,0.98881954,0.0037800435,0.004184102],"study_design_scores_gemma":[0.000027262691,0.000020013375,0.00024004476,0.00001653039,0.000007154817,0.000106293024,0.00014943744,0.004238954,0.00031891177,0.9906855,0.004179404,0.000010440053],"about_ca_topic_score_codex":0.0018381265,"about_ca_topic_score_gemma":0.0019008993,"teacher_disagreement_score":0.015586961,"about_ca_system_score_codex":0.0009300032,"about_ca_system_score_gemma":0.0008100592,"threshold_uncertainty_score":0.052143633},"labels":[],"label_agreement":null},{"id":"W2399322965","doi":"","title":"Distance Two Labeling of Halin Graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.009311464805685954,"score_gpt":0.2283805198083958,"score_spread":0.21906905500270984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399322965","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3550601,0.0018686095,0.41027206,0.008198471,0.0006389077,0.00019020902,0.003038565,0.0011407622,0.21959235],"genre_scores_gemma":[0.8478317,0.00070595316,0.10159887,0.0010939883,0.00022453102,0.00017379476,0.0022068445,0.0003335916,0.04583073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987072,0.00048206266,0.00007020833,0.0002817986,0.000252097,0.00020669133],"domain_scores_gemma":[0.9942514,0.003502731,0.00045377167,0.0007588082,0.00044138756,0.00059187383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009262401,0.00047376644,0.0005982036,0.0014451466,0.0023809208,0.0032597184,0.0014047694,0.0013865525,0.013324271],"category_scores_gemma":[0.0057296846,0.0004195637,0.0005600279,0.0016065631,0.0022694159,0.005836587,0.0028644335,0.0028080547,0.0017078049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018085461,0.000059146292,0.00073253666,0.00009575301,0.000012274666,0.00005752502,0.0002989593,0.0023039368,0.0013599976,0.9680489,0.007850121,0.019000039],"study_design_scores_gemma":[0.000027742773,0.000019512594,0.00050807605,0.000029781027,0.000012792071,0.00011811167,0.0003375085,0.011845799,0.0021281554,0.97235286,0.012603651,0.000016003209],"about_ca_topic_score_codex":0.0015438513,"about_ca_topic_score_gemma":0.0022921828,"teacher_disagreement_score":0.013324271,"about_ca_system_score_codex":0.002357909,"about_ca_system_score_gemma":0.00089805527,"threshold_uncertainty_score":0.044574082},"labels":[],"label_agreement":null},{"id":"W2399337215","doi":"","title":"Upper signed k-domination number in graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Domination analysis; Combinatorics; Discrete mathematics; Graph","score_opus":0.021875333837572754,"score_gpt":0.29686836802903455,"score_spread":0.2749930341914618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399337215","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44268897,0.003133175,0.17488308,0.0047907485,0.0014159905,0.000113358175,0.0028197514,0.0013248757,0.3688301],"genre_scores_gemma":[0.93520206,0.0011102594,0.0247006,0.00063726195,0.00034889745,0.00011579368,0.0009369025,0.00021239664,0.036735818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999038,0.00016445573,0.00006741634,0.000187221,0.0003090906,0.00023392786],"domain_scores_gemma":[0.9960238,0.0020265903,0.00041978573,0.00050102436,0.0005488277,0.00048001696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007779963,0.0005244271,0.00057555665,0.0021664225,0.0014507641,0.0037682247,0.0010203477,0.0009461034,0.015685573],"category_scores_gemma":[0.006249617,0.00027893955,0.00042630537,0.0018256988,0.0017800252,0.0049806293,0.0018633495,0.0019125773,0.0031599952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000279907,0.00007660438,0.0016627389,0.00025811803,0.000025894336,0.00023612267,0.00038901748,0.0043679224,0.006893895,0.9119095,0.0125148315,0.06138538],"study_design_scores_gemma":[0.000021249738,0.000033640332,0.0011357095,0.000058775455,0.000019545098,0.00031832006,0.00012636493,0.0074819243,0.003701231,0.97095484,0.016119512,0.000028954679],"about_ca_topic_score_codex":0.0005449909,"about_ca_topic_score_gemma":0.0010738161,"teacher_disagreement_score":0.015685573,"about_ca_system_score_codex":0.0014246866,"about_ca_system_score_gemma":0.00082628283,"threshold_uncertainty_score":0.052473545},"labels":[],"label_agreement":null},{"id":"W2399364444","doi":"","title":"Universal Graphs for Two Graph Properties.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.019782428225242375,"score_gpt":0.26455577135395875,"score_spread":0.24477334312871638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399364444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14998552,0.003543934,0.428456,0.009390467,0.001314077,0.00017394302,0.0018528954,0.0012592882,0.40402398],"genre_scores_gemma":[0.9186611,0.0011576776,0.049943056,0.0015822189,0.0006069092,0.00019503289,0.0010643064,0.00028849157,0.026501102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985025,0.0004522679,0.000091141075,0.00042116805,0.00025343706,0.00027948304],"domain_scores_gemma":[0.99535733,0.0024724307,0.00040490818,0.00087318494,0.00045635548,0.0004358027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012019463,0.00061551324,0.0006482815,0.0029639446,0.0024610525,0.0033469144,0.0009594794,0.0018620277,0.015997251],"category_scores_gemma":[0.0058566644,0.00046192898,0.001362871,0.0018342267,0.0049499325,0.009601328,0.0032735378,0.003053771,0.0015874244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010654412,0.00000785688,0.00010446171,0.00001900717,0.0000027769531,0.000043746077,0.0001140923,0.00008373602,0.00013435399,0.9955989,0.0012303386,0.002649986],"study_design_scores_gemma":[0.000004660579,0.000005086062,0.0001665695,0.000021990143,0.000007773475,0.00013197106,0.00013009539,0.0006197556,0.00021781123,0.9926744,0.006013896,0.000005984873],"about_ca_topic_score_codex":0.0009743761,"about_ca_topic_score_gemma":0.0011092536,"teacher_disagreement_score":0.015997251,"about_ca_system_score_codex":0.0016537838,"about_ca_system_score_gemma":0.00061661063,"threshold_uncertainty_score":0.05351615},"labels":[],"label_agreement":null},{"id":"W2399372291","doi":"","title":"Path Decompositions Which Contain No Proper Subsystems.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Path (computing); Computer science; Computer network","score_opus":0.01984630761633057,"score_gpt":0.2750636740636844,"score_spread":0.2552173664473539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399372291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060122915,0.0003758512,0.86230314,0.0003342144,0.00024054314,0.0004068931,0.002139218,0.0035894,0.0704878],"genre_scores_gemma":[0.53833413,0.00087896036,0.39494735,0.0004480095,0.00009206187,0.0006530696,0.0068765283,0.0020463238,0.05572355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858665,0.0002514807,0.00012376774,0.00034444546,0.0003882778,0.0003053839],"domain_scores_gemma":[0.996458,0.0012060365,0.00026654312,0.0013123128,0.000510651,0.00024637365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013301095,0.0009373552,0.00064352615,0.0013080449,0.0015073001,0.0025190231,0.00095435965,0.0010776786,0.021012839],"category_scores_gemma":[0.005545671,0.0010464012,0.0017598689,0.00097386516,0.00213005,0.0060137226,0.0028396025,0.0018587124,0.004559785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037862477,0.00012332457,0.0024709564,0.00073702395,0.00014854786,0.0011907142,0.0012475686,0.008816737,0.016953811,0.89664865,0.010164774,0.061119184],"study_design_scores_gemma":[0.00006439187,0.00009123555,0.0011549981,0.00024897794,0.00019176364,0.00056476775,0.0006341358,0.018778577,0.017184263,0.8997096,0.06132831,0.000048893733],"about_ca_topic_score_codex":0.002900877,"about_ca_topic_score_gemma":0.0049961247,"teacher_disagreement_score":0.021012839,"about_ca_system_score_codex":0.0011166098,"about_ca_system_score_gemma":0.002186861,"threshold_uncertainty_score":0.070294976},"labels":[],"label_agreement":null},{"id":"W2399383611","doi":"","title":"Super 3-restricted edge connectivity of triangle-free graphs","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Computer science; Artificial intelligence","score_opus":0.028135633385569223,"score_gpt":0.24077049392312522,"score_spread":0.21263486053755598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399383611","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8096503,0.0004933522,0.09541137,0.0007932563,0.00011059336,0.000052035597,0.0005800007,0.00034941395,0.092559665],"genre_scores_gemma":[0.9812251,0.00031040073,0.010474463,0.00022791373,0.00007462637,0.000051572766,0.00047850417,0.00007862446,0.0070788814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963045,0.00008266395,0.000021497017,0.00007914388,0.000099925855,0.0000862698],"domain_scores_gemma":[0.9981337,0.00088689226,0.0002740992,0.00024040307,0.0001936664,0.00027115268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033127074,0.00033846858,0.0005206629,0.0010921665,0.0009289113,0.0013973442,0.0010586113,0.000735172,0.013258632],"category_scores_gemma":[0.0022734078,0.00041827757,0.00046110625,0.001029163,0.0009071408,0.00216505,0.0013900952,0.0012042101,0.00066716725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035123999,0.000079680096,0.002225288,0.00025408907,0.00003831919,0.0007819422,0.0007241058,0.014001814,0.017288491,0.93761027,0.0052593052,0.02138541],"study_design_scores_gemma":[0.00004962003,0.00005111698,0.002353516,0.00003640513,0.000032845415,0.000708949,0.00030123995,0.045945514,0.0030271488,0.94173783,0.0057326355,0.000023199],"about_ca_topic_score_codex":0.0010933189,"about_ca_topic_score_gemma":0.0018212688,"teacher_disagreement_score":0.013258632,"about_ca_system_score_codex":0.0004196371,"about_ca_system_score_gemma":0.00028789358,"threshold_uncertainty_score":0.044354558},"labels":[],"label_agreement":null},{"id":"W2399410257","doi":"","title":"A solution to a conjecture on two rainbow connection numbers of a graph.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Rainbow; Conjecture; Connection (principal bundle); Combinatorics; Graph; Discrete mathematics; Geometry","score_opus":0.013944516253528884,"score_gpt":0.24946359823004555,"score_spread":0.23551908197651666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399410257","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36252186,0.0027952802,0.2648188,0.04582848,0.0043125087,0.00020789096,0.0032449903,0.001805979,0.3144642],"genre_scores_gemma":[0.84038055,0.0010862099,0.10883035,0.0047501945,0.0013138641,0.00026178482,0.0025416662,0.0005805907,0.040254753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983217,0.00044974603,0.00009050161,0.0005745048,0.0002602317,0.0003032539],"domain_scores_gemma":[0.9905067,0.0058206357,0.0006517802,0.0016365295,0.00063881255,0.0007456253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017837586,0.0007871677,0.0011336602,0.0014363902,0.0038268715,0.004111647,0.0027093648,0.004702847,0.027513223],"category_scores_gemma":[0.015757307,0.0009773821,0.0012755279,0.0019912366,0.004325025,0.011695055,0.0038971861,0.0062142564,0.0033467617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020036109,0.00007349884,0.0006375674,0.00017535087,0.000019820505,0.000115166484,0.0002953902,0.0022277795,0.0008898765,0.9593366,0.02466147,0.011367007],"study_design_scores_gemma":[0.00005048367,0.000017780108,0.00024294869,0.00003723249,0.000013030829,0.00013131321,0.00020340341,0.004567205,0.0004358637,0.9866915,0.00758931,0.000019971107],"about_ca_topic_score_codex":0.0013247309,"about_ca_topic_score_gemma":0.001546912,"teacher_disagreement_score":0.027513223,"about_ca_system_score_codex":0.0019911807,"about_ca_system_score_gemma":0.0012431554,"threshold_uncertainty_score":0.092040956},"labels":[],"label_agreement":null},{"id":"W2399441894","doi":"","title":"MacWilliams Duality in LRTJ-Spaces.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Duality (order theory); Pure mathematics","score_opus":0.05808340873600546,"score_gpt":0.34064729621811424,"score_spread":0.28256388748210876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399441894","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17676052,0.005385425,0.19140567,0.006995748,0.0015217505,0.00005865525,0.0006926655,0.0004794942,0.61670005],"genre_scores_gemma":[0.8779103,0.001530439,0.02967914,0.0013653324,0.0011705079,0.00007587419,0.00039173127,0.00019523446,0.08768145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895453,0.00032112558,0.000051962154,0.00016713774,0.00036544414,0.00013981311],"domain_scores_gemma":[0.9988439,0.00038219002,0.0001390806,0.00015962528,0.00027664335,0.00019853243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010561369,0.00047519253,0.0005293236,0.0020587347,0.0015470667,0.0034999228,0.00069321657,0.0009197819,0.010857156],"category_scores_gemma":[0.0027717196,0.00025803494,0.0006802133,0.0012313419,0.0025199892,0.0053366963,0.0029997176,0.0029054817,0.0018966537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007050086,0.000005523653,0.000054113094,0.000011585788,0.0000028200923,0.000032808483,0.000084154155,0.000097834694,0.00018519786,0.996816,0.00084555143,0.001857454],"study_design_scores_gemma":[0.0000072728644,0.00001464836,0.00019239534,0.000013937231,0.0000071177824,0.00016921507,0.00011684311,0.001448963,0.0003597724,0.985302,0.0123598445,0.000007893204],"about_ca_topic_score_codex":0.0007537672,"about_ca_topic_score_gemma":0.0007013792,"teacher_disagreement_score":0.010857156,"about_ca_system_score_codex":0.0012004559,"about_ca_system_score_gemma":0.00051169546,"threshold_uncertainty_score":0.036320806},"labels":[],"label_agreement":null},{"id":"W2399443443","doi":"","title":"A Note On Partial Spread Generalized Bent Function.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematics and Applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bent molecular geometry; Function (biology); Partial function; Discrete mathematics; Biology; Evolutionary biology; Materials science; Composite material","score_opus":0.06568629678119503,"score_gpt":0.3210967218821909,"score_spread":0.2554104251009959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399443443","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06465258,0.03342575,0.23110308,0.019541565,0.016488936,0.000083481325,0.00086124934,0.0010053491,0.632838],"genre_scores_gemma":[0.6406296,0.035901777,0.11463893,0.00865186,0.008962147,0.00014066999,0.00084159384,0.00071156,0.18952191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966884,0.00007115608,0.000015597232,0.00006864263,0.00013330992,0.000042416566],"domain_scores_gemma":[0.99954826,0.00017087087,0.00002505786,0.00008755224,0.00009447155,0.0000737932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005544062,0.0006841449,0.00062035077,0.0014358562,0.0011225396,0.0014939522,0.0006572257,0.0008262935,0.011714145],"category_scores_gemma":[0.0018452107,0.00021815115,0.0006028699,0.0016177762,0.0020348886,0.003007045,0.0021458033,0.003317322,0.0033832076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003696435,0.000015867812,0.00021955307,0.00013593803,0.000014162325,0.00033429,0.00021338972,0.0007112692,0.0019848647,0.93490356,0.022098493,0.039331738],"study_design_scores_gemma":[0.000008346641,0.000056337176,0.0007086122,0.00006023324,0.000022966633,0.0010902135,0.000134425,0.0023340613,0.0010500908,0.8383448,0.15616012,0.000029752171],"about_ca_topic_score_codex":0.0013648402,"about_ca_topic_score_gemma":0.0017582772,"teacher_disagreement_score":0.011714145,"about_ca_system_score_codex":0.00083420076,"about_ca_system_score_gemma":0.00049307995,"threshold_uncertainty_score":0.03918767},"labels":[],"label_agreement":null},{"id":"W2399458915","doi":"","title":"Combinatorial Sums of Generalized Fibonacci and Lucas Numbers.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Mathematics; Lucas number; Fibonacci polynomials; Pisano period; Lucas sequence; Combinatorics; Discrete mathematics; Classical orthogonal polynomials; Orthogonal polynomials","score_opus":0.01651732858689968,"score_gpt":0.25540354096338885,"score_spread":0.23888621237648916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399458915","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35540092,0.012594285,0.16298491,0.00273939,0.0021623247,0.00011347386,0.000943487,0.000599218,0.46246198],"genre_scores_gemma":[0.89288193,0.0023568752,0.044273917,0.00063444115,0.00119853,0.00014873849,0.0005493598,0.0001794548,0.057776745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939,0.00014651449,0.000036707475,0.00008560692,0.00024929657,0.00009177811],"domain_scores_gemma":[0.99906653,0.00038770327,0.00012839696,0.00010282293,0.00020419512,0.000110369205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052365015,0.0006898794,0.00078712724,0.003189245,0.0019160558,0.0032976998,0.00086522877,0.0009517777,0.01006536],"category_scores_gemma":[0.0033401216,0.00042084875,0.000670857,0.0017440536,0.0019535562,0.0034740847,0.001472667,0.0012779454,0.001602954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015333182,0.000005219007,0.00011473355,0.000034339017,0.000005271933,0.00007027674,0.000061821076,0.00042601943,0.00040957678,0.9909044,0.0019542295,0.005998869],"study_design_scores_gemma":[0.000006079845,0.0000073731185,0.000253762,0.000018988585,0.000009459069,0.00029626844,0.00005789532,0.002966804,0.0002911208,0.98799264,0.008086643,0.000012965203],"about_ca_topic_score_codex":0.0009115374,"about_ca_topic_score_gemma":0.0021900733,"teacher_disagreement_score":0.01006536,"about_ca_system_score_codex":0.0011185473,"about_ca_system_score_gemma":0.0005705514,"threshold_uncertainty_score":0.033671916},"labels":[],"label_agreement":null},{"id":"W2399492755","doi":"","title":"Two Families of Lattices.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.024665106425442125,"score_gpt":0.24643902442717572,"score_spread":0.2217739180017336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399492755","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10271485,0.0039367448,0.26388362,0.010638419,0.0010752694,0.00016362699,0.0023738134,0.0009273284,0.6142864],"genre_scores_gemma":[0.80522966,0.0012061723,0.06478129,0.0014315512,0.0003625866,0.00027194398,0.002181261,0.00024299853,0.12429256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974809,0.0008116812,0.000110421366,0.00057208573,0.0006497026,0.0003751633],"domain_scores_gemma":[0.9959197,0.0017509605,0.00029386824,0.000638591,0.00072402053,0.0006728572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014099684,0.0006045172,0.0006135792,0.002262231,0.0035289829,0.005032619,0.0011534985,0.0017103308,0.030066594],"category_scores_gemma":[0.007105984,0.00083322194,0.0011303755,0.0016528575,0.0038996595,0.0075925863,0.003880873,0.0025515119,0.0038025302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005414184,0.000013997256,0.00024225221,0.000029604002,0.000007471342,0.00016680012,0.00040956296,0.00014007959,0.00025238024,0.98810077,0.0040203505,0.006562557],"study_design_scores_gemma":[0.000040670606,0.000015080363,0.00034181206,0.00004524939,0.000013083877,0.00066811766,0.0005588751,0.0014248529,0.0006137834,0.9473495,0.048908573,0.000020409547],"about_ca_topic_score_codex":0.0011554682,"about_ca_topic_score_gemma":0.0011078971,"teacher_disagreement_score":0.030066594,"about_ca_system_score_codex":0.0022124967,"about_ca_system_score_gemma":0.00080047635,"threshold_uncertainty_score":0.10058272},"labels":[],"label_agreement":null},{"id":"W2399497525","doi":"","title":"On Strong Biclique Covering.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Complete bipartite graph; Combinatorics; Bipartite graph; Graph","score_opus":0.019870713523877256,"score_gpt":0.2927214093300953,"score_spread":0.272850695806218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399497525","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.317861,0.0025813826,0.2067604,0.0040793847,0.00084499095,0.00012354682,0.0012181906,0.000875216,0.46565592],"genre_scores_gemma":[0.886827,0.0017043143,0.03779474,0.0012829186,0.00044736874,0.0001346989,0.0014789175,0.00035026713,0.06997978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990902,0.00020790719,0.000035475292,0.0001604284,0.0002588345,0.0002471218],"domain_scores_gemma":[0.99799395,0.0009075764,0.00017299509,0.00032147404,0.00030628644,0.00029775302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005955674,0.0006800007,0.0006805401,0.0017563368,0.002604545,0.0020273284,0.0010226318,0.0010728973,0.013316375],"category_scores_gemma":[0.0032344793,0.0004928349,0.00060125656,0.0019928347,0.0017021813,0.0047206897,0.0040405155,0.002205856,0.0025789961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006855205,0.000026416194,0.0005336012,0.000094598036,0.00001202764,0.00014788799,0.00026645235,0.0013964216,0.0009715426,0.9739822,0.008195938,0.014304278],"study_design_scores_gemma":[0.000014848196,0.000020914007,0.0006232457,0.00004193188,0.000015708567,0.00041115884,0.00021727713,0.0062653534,0.0007457724,0.9728224,0.018807577,0.000013846061],"about_ca_topic_score_codex":0.0018516178,"about_ca_topic_score_gemma":0.0026936375,"teacher_disagreement_score":0.013316375,"about_ca_system_score_codex":0.0012980315,"about_ca_system_score_gemma":0.00049886364,"threshold_uncertainty_score":0.044547677},"labels":[],"label_agreement":null},{"id":"W2399511925","doi":"","title":"A Note on Spanning Eulerian Graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eulerian path; Combinatorics; Pure mathematics","score_opus":0.033092864583891206,"score_gpt":0.28432877365137516,"score_spread":0.25123590906748394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399511925","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03129908,0.05693895,0.18863319,0.056878876,0.036426026,0.00009573048,0.0012796455,0.000906744,0.6275418],"genre_scores_gemma":[0.47218928,0.11096892,0.16529767,0.027329309,0.030290648,0.00018990827,0.0015164658,0.0011543647,0.19106337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996841,0.00008261062,0.000017291506,0.000075298,0.00009707637,0.000043567125],"domain_scores_gemma":[0.997982,0.0013784494,0.000078039906,0.00022796434,0.00019394745,0.00013952164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000704163,0.00061386294,0.0005258732,0.0012523237,0.0015960399,0.0011237598,0.0011755275,0.0010607752,0.013368985],"category_scores_gemma":[0.003539253,0.0003178077,0.00060111616,0.0019111462,0.0017679174,0.005272378,0.0019040365,0.003496977,0.002899971],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000447665,0.000027844573,0.00039500592,0.00031500953,0.00002379502,0.00066881074,0.00024970746,0.0018951489,0.0015316553,0.8112099,0.1258597,0.057778645],"study_design_scores_gemma":[0.000004918972,0.00001766255,0.00048658857,0.00010222929,0.00001793204,0.00060296274,0.00011102178,0.0011661804,0.00052087836,0.7972933,0.19966377,0.0000126221685],"about_ca_topic_score_codex":0.0017360515,"about_ca_topic_score_gemma":0.0037401684,"teacher_disagreement_score":0.013368985,"about_ca_system_score_codex":0.0007632283,"about_ca_system_score_gemma":0.00046779422,"threshold_uncertainty_score":0.04472375},"labels":[],"label_agreement":null},{"id":"W2399517370","doi":"","title":"Completely Regular Endomorphisms of Split Graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Endomorphism; Mathematics; Combinatorics; Discrete mathematics","score_opus":0.010185618288861076,"score_gpt":0.20782741922918171,"score_spread":0.19764180094032063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399517370","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5214669,0.0019091452,0.30415323,0.0014040784,0.0005932632,0.00007739364,0.00079787313,0.0009497554,0.16864824],"genre_scores_gemma":[0.9578851,0.0002797267,0.018507719,0.00024874613,0.00015371395,0.000046212186,0.00029286603,0.00011140031,0.022474498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992848,0.00018490381,0.000048737205,0.00018014194,0.00019332807,0.00010814801],"domain_scores_gemma":[0.9985152,0.0006067437,0.00018685928,0.0002881492,0.00020907,0.0001939739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006345602,0.00031015126,0.00034911727,0.0008143123,0.00087823864,0.00186417,0.0004344998,0.00047767806,0.005035497],"category_scores_gemma":[0.0017186963,0.00031002058,0.00056618126,0.00047393018,0.0020483881,0.0032835042,0.0013903421,0.0010050213,0.0010109787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037020705,0.000015324817,0.00024371946,0.00002081795,0.000006339871,0.00012136491,0.0002806264,0.0003244986,0.0020952977,0.9901343,0.0009796642,0.005741077],"study_design_scores_gemma":[0.000014140443,0.000021200978,0.00029852343,0.000012984196,0.000008348329,0.00026816566,0.0001782434,0.0022939646,0.0016909182,0.9875168,0.0076868352,0.000009817093],"about_ca_topic_score_codex":0.0002606751,"about_ca_topic_score_gemma":0.00041665632,"teacher_disagreement_score":0.005035497,"about_ca_system_score_codex":0.0005777932,"about_ca_system_score_gemma":0.00035310586,"threshold_uncertainty_score":0.016845405},"labels":[],"label_agreement":null},{"id":"W2399524571","doi":"","title":"Cross recurrence relations for r-Lah numbers.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Recurrence relation; Combinatorics","score_opus":0.01372081933889435,"score_gpt":0.2596190871288584,"score_spread":0.24589826778996404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399524571","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16367234,0.0070311646,0.3352685,0.0043992097,0.0019920205,0.0001635132,0.0011643957,0.0012794943,0.48502943],"genre_scores_gemma":[0.8870441,0.0019947393,0.041043047,0.0015186,0.0010952762,0.00020706175,0.00073464325,0.0003575984,0.06600493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990134,0.00018957669,0.000083093255,0.00019196325,0.00031547202,0.00020639163],"domain_scores_gemma":[0.99795306,0.00084925717,0.00031884795,0.00028259977,0.0004322426,0.00016408284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011779296,0.0005764837,0.0004882784,0.003073277,0.0014491576,0.0028060072,0.0007008043,0.0009801824,0.017510928],"category_scores_gemma":[0.006348188,0.00032249952,0.0005653196,0.0017876024,0.0015224657,0.0045411293,0.0018866982,0.0021137292,0.0055488725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018685421,0.000009925125,0.00018264545,0.000033572294,0.000003964025,0.00007685727,0.00013682591,0.00036861596,0.00068536843,0.9842091,0.0037049253,0.010569499],"study_design_scores_gemma":[0.000009328285,0.000020848538,0.00027351896,0.000028367613,0.000008131388,0.00026011895,0.00006385696,0.004388758,0.0012765183,0.98127216,0.012376317,0.000022139417],"about_ca_topic_score_codex":0.0006918355,"about_ca_topic_score_gemma":0.0010495621,"teacher_disagreement_score":0.017510928,"about_ca_system_score_codex":0.0012461565,"about_ca_system_score_gemma":0.0005002555,"threshold_uncertainty_score":0.058579862},"labels":[],"label_agreement":null},{"id":"W2399542500","doi":"","title":"Upper Chromatic Number of Steiner Triple Systems.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics; Steiner system; Discrete mathematics","score_opus":0.004436352990145917,"score_gpt":0.20161704418746057,"score_spread":0.19718069119731466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399542500","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4328569,0.0025274958,0.13250327,0.0033207152,0.00056138006,0.00009420369,0.0025682827,0.0005819955,0.42498583],"genre_scores_gemma":[0.9468956,0.0010080903,0.017454123,0.0003078953,0.00012887655,0.00006679704,0.0009763784,0.00011856483,0.03304361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946433,0.000094174975,0.000015532905,0.00011132679,0.00015446056,0.00016025173],"domain_scores_gemma":[0.9983255,0.0008668718,0.00015754616,0.00021331267,0.00019584905,0.00024080678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040293648,0.0004894284,0.0004988929,0.001952544,0.0017194869,0.0025799335,0.00086456997,0.00082473597,0.021168327],"category_scores_gemma":[0.002477721,0.00033065135,0.00035292076,0.0016458131,0.0012519534,0.0027004005,0.0014136106,0.0017505592,0.0022653814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020523637,0.000053578176,0.0009918276,0.00019602683,0.000026572492,0.00016580288,0.00029182574,0.01474685,0.0095937615,0.92877597,0.01941424,0.02553825],"study_design_scores_gemma":[0.000031577176,0.0000511078,0.0014728651,0.000065176646,0.000034500234,0.0003831035,0.00025030837,0.044448067,0.0054685655,0.9263047,0.02146184,0.000028256025],"about_ca_topic_score_codex":0.002528665,"about_ca_topic_score_gemma":0.005330956,"teacher_disagreement_score":0.021168327,"about_ca_system_score_codex":0.0022853678,"about_ca_system_score_gemma":0.00080703315,"threshold_uncertainty_score":0.07081509},"labels":[],"label_agreement":null},{"id":"W2399542805","doi":"","title":"The minimal positive index of inertia of signed unicyclic graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Inertia; Index (typography); Combinatorics; Discrete mathematics; Computer science; Physics; World Wide Web","score_opus":0.0122693109654104,"score_gpt":0.26219302744891565,"score_spread":0.24992371648350525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399542805","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6733587,0.0019034022,0.061562154,0.0019037841,0.0010987121,0.00007688932,0.00096502464,0.0004111764,0.25872013],"genre_scores_gemma":[0.9829726,0.00053416454,0.0045624245,0.00018837421,0.0004801811,0.000055710294,0.00032808926,0.000086337815,0.010792073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993925,0.0001026555,0.00003878527,0.000117100826,0.00020130526,0.00014753758],"domain_scores_gemma":[0.9973609,0.0009444375,0.000586713,0.00019883276,0.000293448,0.0006156477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052466587,0.0005537682,0.0007185401,0.0032885706,0.0011133432,0.00341136,0.0009786759,0.0009735623,0.008757914],"category_scores_gemma":[0.0041705593,0.00034987828,0.00040016393,0.0012492654,0.0029791726,0.0031708041,0.0018232188,0.0013301698,0.0012506464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013020066,0.00003586304,0.0006779015,0.000094590476,0.000010504742,0.00013328523,0.0002938323,0.0006691748,0.0039487365,0.97678876,0.0042820307,0.012935072],"study_design_scores_gemma":[0.0000344939,0.00005096409,0.0014186447,0.00005283813,0.000021516098,0.00043171912,0.0002147943,0.0053711156,0.0022119896,0.9838157,0.0063467044,0.000029488187],"about_ca_topic_score_codex":0.00049888244,"about_ca_topic_score_gemma":0.0005887339,"teacher_disagreement_score":0.008757914,"about_ca_system_score_codex":0.0010744552,"about_ca_system_score_gemma":0.00049613265,"threshold_uncertainty_score":0.029298186},"labels":[],"label_agreement":null},{"id":"W2399589791","doi":"","title":"Two results on BCI-subset of finite groups.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Brain–computer interface; Psychology; Electroencephalography; Neuroscience","score_opus":0.00852041773830257,"score_gpt":0.21223580436653178,"score_spread":0.20371538662822922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399589791","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.112979874,0.0071719345,0.20781396,0.011236068,0.001987801,0.00018486274,0.0014699288,0.00053298357,0.6566226],"genre_scores_gemma":[0.80683,0.004382345,0.06372332,0.0044826316,0.002557049,0.00034768035,0.0023309332,0.00038075575,0.11496519],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831957,0.00031747046,0.000100750694,0.0003565468,0.000579153,0.00032647647],"domain_scores_gemma":[0.9945134,0.0028775355,0.00036394037,0.000789933,0.0006271419,0.00082799944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013079429,0.00090611674,0.0011005271,0.0037324436,0.0027801925,0.0032117637,0.001617583,0.001612094,0.014848902],"category_scores_gemma":[0.0052957595,0.00051124673,0.0012586106,0.0028877023,0.0032031713,0.008036114,0.0039862134,0.0046317116,0.0024847372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053485768,0.000058036658,0.00033121178,0.000106478554,0.0000137111265,0.00013859055,0.00025730624,0.0004402333,0.0008299315,0.98360956,0.0055601713,0.008601375],"study_design_scores_gemma":[0.000022271728,0.000042756354,0.0007715383,0.000052939435,0.000028799255,0.00051130605,0.00021573111,0.0030933958,0.0018614522,0.9697058,0.023671387,0.000022504752],"about_ca_topic_score_codex":0.0010393546,"about_ca_topic_score_gemma":0.0011946122,"teacher_disagreement_score":0.014848902,"about_ca_system_score_codex":0.0023295328,"about_ca_system_score_gemma":0.00089040323,"threshold_uncertainty_score":0.04967445},"labels":[],"label_agreement":null},{"id":"W2399604044","doi":"","title":"The Upper and Lower Geodetic Numbers of Graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Geodetic datum; Vertex (graph theory); Digraph; Graph; Connectivity; Conjecture; Upper and lower bounds; Discrete mathematics; Geodesy","score_opus":0.00831600444327827,"score_gpt":0.2604379802694791,"score_spread":0.25212197582620083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399604044","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26008853,0.03438172,0.40725353,0.0050675897,0.0018477046,0.0002121149,0.0061790165,0.0010015616,0.28396833],"genre_scores_gemma":[0.8539632,0.0122543955,0.10940577,0.0012155211,0.001403367,0.00036032376,0.0022567855,0.00025743368,0.018883262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761415,0.0004896693,0.0001620925,0.00068561966,0.0005974819,0.00045100448],"domain_scores_gemma":[0.9935569,0.0038116828,0.000941443,0.00062301266,0.0005208467,0.0005460182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014707429,0.0012617361,0.00072389835,0.0046843826,0.0010580653,0.0036564192,0.0011073253,0.0012540503,0.0050739287],"category_scores_gemma":[0.009863095,0.0005475096,0.00072623626,0.0043467386,0.004304868,0.0063100937,0.0018369673,0.0024583978,0.0014239384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013931519,0.00004291179,0.0022240297,0.00032566697,0.000029389936,0.00015734773,0.00039709048,0.009884543,0.0026681942,0.9255584,0.007907159,0.050665904],"study_design_scores_gemma":[0.000024441875,0.00011635883,0.0040540453,0.00024723634,0.000045384364,0.0010569822,0.000320057,0.02236184,0.0032320668,0.89243853,0.07602336,0.00007961756],"about_ca_topic_score_codex":0.0014227397,"about_ca_topic_score_gemma":0.0012846268,"teacher_disagreement_score":0.0050739287,"about_ca_system_score_codex":0.0021121004,"about_ca_system_score_gemma":0.00085012696,"threshold_uncertainty_score":0.016974032},"labels":[],"label_agreement":null},{"id":"W2399610417","doi":"","title":"Fourth order Randic index of phenylenes.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Synthesis and Properties of Aromatic Compounds","field":"Chemistry","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Topological index; Order (exchange); Combinatorics; Computer science; Business","score_opus":0.014355498108611612,"score_gpt":0.2237374529679528,"score_spread":0.2093819548593412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399610417","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27461886,0.004251395,0.054214332,0.001731987,0.0007731453,0.00006381935,0.0008443132,0.00047220735,0.66302997],"genre_scores_gemma":[0.9286608,0.0014583705,0.013619233,0.0002577665,0.0002157488,0.00007485411,0.00031957694,0.00014503958,0.055248655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977404,0.00003864033,0.000012869901,0.00003567252,0.000086865,0.00005185581],"domain_scores_gemma":[0.9996344,0.000077037395,0.00006974114,0.00009605305,0.000063212174,0.000059607828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030523833,0.00037051938,0.00035425747,0.0021423122,0.00082270894,0.0015845002,0.0004129961,0.0004087059,0.013875492],"category_scores_gemma":[0.0011041063,0.00013493665,0.0001678746,0.00066865934,0.001099519,0.0012348737,0.0008050837,0.0007233308,0.0017410517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066989436,0.000014055521,0.0003325917,0.00008696992,0.0000054959337,0.00006524607,0.00006767871,0.0015303362,0.0066200113,0.96851224,0.004368837,0.01832947],"study_design_scores_gemma":[0.00002653731,0.000105124986,0.0021209733,0.00007755394,0.000018016472,0.0004784448,0.00012417964,0.02603888,0.021496695,0.8772306,0.072213545,0.00006956519],"about_ca_topic_score_codex":0.00063913723,"about_ca_topic_score_gemma":0.0011807965,"teacher_disagreement_score":0.013875492,"about_ca_system_score_codex":0.0010014967,"about_ca_system_score_gemma":0.00053329085,"threshold_uncertainty_score":0.04641813},"labels":[],"label_agreement":null},{"id":"W2399614137","doi":"","title":"Bound on the exponents of a class of two-colored digraphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Colored; Mathematics; Class (philosophy); Combinatorics; Computer science; Artificial intelligence","score_opus":0.015398239815627057,"score_gpt":0.23806632548910234,"score_spread":0.2226680856734753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399614137","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6516621,0.003669362,0.1327399,0.0078763785,0.00071796146,0.0001264467,0.002767962,0.0008366237,0.19960332],"genre_scores_gemma":[0.96545506,0.0009912668,0.016694821,0.00046925378,0.00038927892,0.000081537044,0.00078564207,0.00016476451,0.014968375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920624,0.0001603233,0.000041189902,0.00019260641,0.00016204738,0.00023764967],"domain_scores_gemma":[0.9907719,0.006573793,0.0006024101,0.00061887543,0.00044886442,0.0009842308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010221355,0.0009024187,0.001054022,0.0018258803,0.002019329,0.003954222,0.0012974932,0.0011110387,0.013285035],"category_scores_gemma":[0.007925904,0.0005048869,0.00067825936,0.0012404054,0.0023461026,0.0047668223,0.0026924184,0.0036468494,0.0015269608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021313687,0.000064450054,0.002043187,0.00015434143,0.00002776481,0.00022530704,0.00029425346,0.0041728406,0.0024121222,0.96640533,0.010625193,0.013362095],"study_design_scores_gemma":[0.00008364674,0.000044150755,0.0012665393,0.00008755792,0.000040877934,0.00044727037,0.00019994404,0.021315994,0.0015784787,0.96239185,0.012511869,0.000031755866],"about_ca_topic_score_codex":0.00083493034,"about_ca_topic_score_gemma":0.001147671,"teacher_disagreement_score":0.013285035,"about_ca_system_score_codex":0.0018439358,"about_ca_system_score_gemma":0.0007269585,"threshold_uncertainty_score":0.044442892},"labels":[],"label_agreement":null},{"id":"W2399633863","doi":"","title":"On (l, m)-Walk-regular Digraphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.02446002684681085,"score_gpt":0.2597508041205264,"score_spread":0.23529077727371558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399633863","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46649313,0.002074679,0.3155622,0.002857104,0.00041990742,0.00026635558,0.003041135,0.0014857778,0.20779976],"genre_scores_gemma":[0.8997791,0.0011124257,0.04329654,0.0008158434,0.00018668245,0.0001480158,0.0019410485,0.0002601045,0.052460384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922884,0.00022039696,0.000052277028,0.00019583285,0.00011737478,0.00018533516],"domain_scores_gemma":[0.9976496,0.0010944899,0.0003651861,0.0002798356,0.00019865241,0.00041225457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044025504,0.00065834227,0.00075777265,0.001740219,0.0019557897,0.0026950226,0.001069971,0.0013387327,0.011373885],"category_scores_gemma":[0.003178068,0.0006726444,0.0007807457,0.0017020677,0.001418345,0.003638653,0.0024327673,0.0014801895,0.0025447856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014254048,0.00009261655,0.0010675631,0.00023132941,0.000045333993,0.00072021584,0.00057560514,0.005336194,0.0031546769,0.954103,0.010076076,0.024455005],"study_design_scores_gemma":[0.000050910152,0.000038541275,0.0005553456,0.00006661349,0.000027698092,0.00055242924,0.00025316016,0.014464526,0.001085683,0.97255206,0.010329363,0.000023677361],"about_ca_topic_score_codex":0.002093409,"about_ca_topic_score_gemma":0.004660763,"teacher_disagreement_score":0.011373885,"about_ca_system_score_codex":0.0015160925,"about_ca_system_score_gemma":0.000501277,"threshold_uncertainty_score":0.0380494},"labels":[],"label_agreement":null},{"id":"W2399636163","doi":"","title":"k-Domination stable graphs upon edge removal.","year":2015,"lang":"ceb","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Computer science; Artificial intelligence","score_opus":0.034739600357956174,"score_gpt":0.2989108015642031,"score_spread":0.26417120120624693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399636163","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4561375,0.00083340256,0.25113976,0.0022556388,0.00086605625,0.00029775116,0.0023900769,0.0023896415,0.28369015],"genre_scores_gemma":[0.89618367,0.00048167165,0.032948118,0.00061657175,0.00015342035,0.00015023716,0.0017754447,0.00042538845,0.06726547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948347,0.00008667528,0.000024573312,0.00009841444,0.00014268412,0.00016418096],"domain_scores_gemma":[0.99758565,0.0008633222,0.00027567399,0.0005942015,0.00041267497,0.00026846357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004021431,0.00038172418,0.000327873,0.0009517391,0.001340032,0.0014021244,0.0011268948,0.000804358,0.010781902],"category_scores_gemma":[0.0032471719,0.00030072583,0.0005603034,0.00088838756,0.0010168367,0.0020327459,0.0016026237,0.0012887267,0.0025138047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063122826,0.00019652634,0.002478326,0.00046076905,0.00010211476,0.0020074584,0.0014157145,0.0107348105,0.055771913,0.8066796,0.034856897,0.08466463],"study_design_scores_gemma":[0.0001078003,0.00009564924,0.003307798,0.000098897646,0.00010056117,0.0018677077,0.00081275805,0.029904906,0.025773175,0.89072734,0.04714338,0.00005999183],"about_ca_topic_score_codex":0.0010877501,"about_ca_topic_score_gemma":0.0021681087,"teacher_disagreement_score":0.010781902,"about_ca_system_score_codex":0.0005699035,"about_ca_system_score_gemma":0.00065392494,"threshold_uncertainty_score":0.036069095},"labels":[],"label_agreement":null},{"id":"W2399649604","doi":"","title":"Pseudo-Complements In Finite Projective Planes.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Projective test; Pure mathematics; Projective plane; Geometry","score_opus":0.007556754858960246,"score_gpt":0.21333717967388943,"score_spread":0.2057804248149292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399649604","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3450368,0.0025544825,0.23193312,0.0027846997,0.00067777775,0.00009462666,0.0007516782,0.00037191878,0.4157949],"genre_scores_gemma":[0.9395861,0.000894283,0.02369777,0.00037459037,0.00021876216,0.000073437746,0.00038756756,0.000094974894,0.034672514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910814,0.0003428872,0.000037014797,0.0001174672,0.00022548788,0.00016894897],"domain_scores_gemma":[0.9987795,0.0006161807,0.00016058741,0.00011555982,0.0001790669,0.0001490593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047568307,0.00047104305,0.00037387578,0.0018063302,0.0015871397,0.0033177808,0.000503213,0.00075889385,0.0122963665],"category_scores_gemma":[0.0022600817,0.00034569588,0.0004344474,0.001145197,0.002595807,0.00391511,0.0018441281,0.0016560017,0.0013535338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011604108,0.0000050721865,0.00006726798,0.000011167408,0.0000024140068,0.000049847647,0.00005181259,0.00036156792,0.00021292751,0.9966275,0.00062587176,0.0019729112],"study_design_scores_gemma":[0.0000113490805,0.000011694297,0.00017395172,0.000022362901,0.0000057384555,0.00020124539,0.0001799706,0.004276232,0.0008161635,0.9864079,0.0078838,0.000009733191],"about_ca_topic_score_codex":0.0012378466,"about_ca_topic_score_gemma":0.0016867587,"teacher_disagreement_score":0.0122963665,"about_ca_system_score_codex":0.0010372116,"about_ca_system_score_gemma":0.0005883931,"threshold_uncertainty_score":0.04113549},"labels":[],"label_agreement":null},{"id":"W2399676696","doi":"","title":"Lower Bounds on some certain van der Waerden Functions.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Van der Waerden's theorem; Mathematics; Combinatorics","score_opus":0.024645304940529533,"score_gpt":0.27842834052133336,"score_spread":0.25378303558080384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399676696","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14127561,0.014519276,0.33633798,0.013327099,0.0018400783,0.0001158566,0.0013866279,0.00069232256,0.49050513],"genre_scores_gemma":[0.8311461,0.008302535,0.065796986,0.0017444361,0.0016372838,0.00035384967,0.0016926521,0.0006420486,0.08868405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981647,0.0004081335,0.00008457323,0.0002879742,0.00058172224,0.00047282272],"domain_scores_gemma":[0.991228,0.0062188962,0.0004686066,0.0006930294,0.0008406158,0.0005507722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027716693,0.0017921149,0.0012116446,0.004824332,0.002230596,0.004461799,0.003089889,0.0017522258,0.019816654],"category_scores_gemma":[0.02125381,0.0005732376,0.0013982907,0.0037808837,0.0035049338,0.008814133,0.0037414797,0.0072555547,0.0038937887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006717749,0.000037493097,0.00032951965,0.00009266189,0.000022074693,0.00004147714,0.00014499742,0.002062158,0.00059617276,0.9776218,0.0060525197,0.012932005],"study_design_scores_gemma":[0.000016931383,0.000025175003,0.000536554,0.000085725755,0.000050502862,0.00016168623,0.00009739705,0.018481664,0.0011516009,0.96564406,0.0137230875,0.000025537869],"about_ca_topic_score_codex":0.0020358718,"about_ca_topic_score_gemma":0.0025681746,"teacher_disagreement_score":0.019816654,"about_ca_system_score_codex":0.0032786217,"about_ca_system_score_gemma":0.0011965232,"threshold_uncertainty_score":0.06629336},"labels":[],"label_agreement":null},{"id":"W2399684368","doi":"","title":"Some ternary codes invariant under the group M c L: 2.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Ternary operation; Invariant (physics); Group (periodic table); Combinatorics; Pure mathematics; Discrete mathematics; Mathematical physics; Physics; Computer science; Programming language; Quantum mechanics","score_opus":0.015866921290328014,"score_gpt":0.23044727431546969,"score_spread":0.21458035302514167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399684368","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59608805,0.0014792252,0.11210292,0.0034103016,0.00087876787,0.00022388693,0.0031002434,0.000914314,0.2818023],"genre_scores_gemma":[0.9514967,0.00031386648,0.01455973,0.00052173197,0.00027337178,0.0001506235,0.00085836934,0.00013207652,0.03169362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992805,0.00011710099,0.00004428515,0.00009183188,0.00022432682,0.0002419247],"domain_scores_gemma":[0.9987645,0.00042472244,0.00027662475,0.00016105002,0.00021863444,0.000154612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004470639,0.00045014283,0.00032624754,0.0015217048,0.0014569944,0.0022149708,0.00047247417,0.0011222161,0.009738256],"category_scores_gemma":[0.002091377,0.00022091114,0.0005074844,0.00097511587,0.001355993,0.0010807769,0.0012909214,0.0011388302,0.0018163534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020096092,0.00003953458,0.000471061,0.000060286715,0.000008973391,0.00039013263,0.00030103457,0.0014137168,0.003641718,0.971982,0.006676159,0.014814467],"study_design_scores_gemma":[0.000095568685,0.00006923345,0.0011473328,0.00006536901,0.000023439954,0.0006508836,0.00018977268,0.012850328,0.009268211,0.9466036,0.028978027,0.000058228066],"about_ca_topic_score_codex":0.0012394447,"about_ca_topic_score_gemma":0.0011032767,"teacher_disagreement_score":0.009738256,"about_ca_system_score_codex":0.0014829272,"about_ca_system_score_gemma":0.0011982853,"threshold_uncertainty_score":0.032577753},"labels":[],"label_agreement":null},{"id":"W2399699290","doi":"","title":"Classification of eleven-point five-distance sets in the plane.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Optics and Image Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Plane (geometry); Point (geometry); Geometry","score_opus":0.023295854010906357,"score_gpt":0.22458964279859545,"score_spread":0.20129378878768908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399699290","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5936257,0.0017664047,0.3077851,0.0012894326,0.0003225068,0.00023949717,0.0053289165,0.0006186641,0.08902375],"genre_scores_gemma":[0.8859985,0.0006416443,0.08747297,0.00015188444,0.00013346788,0.0001237489,0.009145297,0.00011109252,0.016221352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893063,0.00016798897,0.00011393693,0.00015962042,0.00045176034,0.00017597103],"domain_scores_gemma":[0.9979906,0.0006037163,0.0003226832,0.00027110707,0.00054280885,0.0002691274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006398478,0.0006294007,0.00090643484,0.004029013,0.0015739384,0.0037150509,0.001617452,0.0010953555,0.010812816],"category_scores_gemma":[0.0037387896,0.00024359212,0.00074982864,0.0027614264,0.0017401642,0.0023988753,0.0020855167,0.0017426652,0.0023468216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038304643,0.00016699766,0.0070271175,0.00029942262,0.00006601482,0.0002303691,0.0005556109,0.012843586,0.0034679153,0.8406098,0.011032827,0.123317204],"study_design_scores_gemma":[0.00007150168,0.00017394479,0.00995382,0.00021982328,0.00004851842,0.00072824466,0.0012355278,0.0920798,0.0043185106,0.84841394,0.042677447,0.000078959376],"about_ca_topic_score_codex":0.0018944219,"about_ca_topic_score_gemma":0.0012940771,"teacher_disagreement_score":0.010812816,"about_ca_system_score_codex":0.0013200156,"about_ca_system_score_gemma":0.0005965417,"threshold_uncertainty_score":0.03617251},"labels":[],"label_agreement":null},{"id":"W2399715766","doi":"","title":"A Note on the Density of M-sets in Geometric Sequence.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Sequence (biology); Combinatorics","score_opus":0.0439986820017958,"score_gpt":0.28020174880527793,"score_spread":0.23620306680348213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399715766","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039668817,0.007178372,0.8526001,0.007033581,0.0016436559,0.000105959225,0.0007703895,0.000862435,0.09013671],"genre_scores_gemma":[0.66139305,0.008153225,0.28891405,0.0031891288,0.004047153,0.0005278075,0.0007775671,0.0010600457,0.03193796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963569,0.001280369,0.00021312485,0.00074898486,0.0011520815,0.00024849258],"domain_scores_gemma":[0.96078444,0.029250154,0.0011846198,0.005538766,0.0017924496,0.0014495052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042056097,0.0008513275,0.002077816,0.0044080475,0.0028678228,0.0043784147,0.0038306324,0.0026111521,0.01472182],"category_scores_gemma":[0.05368225,0.0014332946,0.0016143895,0.004441861,0.009321459,0.011730192,0.008641257,0.006889501,0.0018876233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037706417,0.000013636668,0.0007276976,0.000079611535,0.000011345601,0.0000953699,0.00016097132,0.0027373803,0.00036502717,0.979989,0.004505453,0.011276725],"study_design_scores_gemma":[0.0000113434235,0.00003600782,0.0007036384,0.00007246445,0.000020562591,0.00041392748,0.00009365584,0.029994184,0.000750679,0.95594364,0.011923545,0.00003639796],"about_ca_topic_score_codex":0.0031734926,"about_ca_topic_score_gemma":0.002837365,"teacher_disagreement_score":0.01472182,"about_ca_system_score_codex":0.0023269895,"about_ca_system_score_gemma":0.0009446083,"threshold_uncertainty_score":0.04924935},"labels":[],"label_agreement":null},{"id":"W2399735653","doi":"","title":"Error-tolerance pooling design in a finite vector space.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pooling; Vector space; Space (punctuation); Vector (molecular biology); Pure mathematics; Computer science; Artificial intelligence; Biology","score_opus":0.0322250886916355,"score_gpt":0.24751412410480803,"score_spread":0.2152890354131725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399735653","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008981325,0.00028089547,0.9883464,0.00014666174,0.000040655672,0.000033736058,0.00007622271,0.00028200995,0.0018120882],"genre_scores_gemma":[0.64636654,0.000572445,0.33923095,0.00037322083,0.00020386565,0.00038359637,0.00052758533,0.00020115743,0.012140667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982387,0.0005905279,0.00012827809,0.00047180508,0.0003311677,0.00023950104],"domain_scores_gemma":[0.9977787,0.001062799,0.00024266249,0.00038473203,0.00035890937,0.00017228693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022651379,0.0010270259,0.0017271405,0.0005628301,0.0005335812,0.0015390377,0.0023682793,0.001221275,0.0053043426],"category_scores_gemma":[0.0060463273,0.0005538147,0.00082423195,0.0009972996,0.001437958,0.0032234017,0.0020449522,0.0012839797,0.0012220617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010915957,0.0002803324,0.00093379366,0.0004959166,0.00029404342,0.00025779908,0.00017320542,0.37941045,0.0151956715,0.22262931,0.008662072,0.3705758],"study_design_scores_gemma":[0.000033952136,0.0002152381,0.00021291013,0.000027065389,0.00004537677,0.00008424675,0.000024388242,0.938925,0.0053129103,0.05307235,0.00202246,0.00002409756],"about_ca_topic_score_codex":0.0018042078,"about_ca_topic_score_gemma":0.0021009704,"teacher_disagreement_score":0.0053043426,"about_ca_system_score_codex":0.0008854969,"about_ca_system_score_gemma":0.001554236,"threshold_uncertainty_score":0.01774478},"labels":[],"label_agreement":null},{"id":"W2399741704","doi":"","title":"On the Ramsey Numbers R(C m , B n ).","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Ramsey's theorem; Combinatorics","score_opus":0.010287189247916662,"score_gpt":0.22976315387952034,"score_spread":0.21947596463160368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399741704","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26487544,0.008184519,0.24896626,0.013689377,0.00148087,0.000086810775,0.0014080122,0.0008057702,0.4605029],"genre_scores_gemma":[0.90879405,0.0030743647,0.040030375,0.001310654,0.0009124191,0.00016290894,0.0006405898,0.00022516065,0.04484946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912184,0.00031956742,0.000047569945,0.00018672993,0.00017291316,0.00015144452],"domain_scores_gemma":[0.9961242,0.0024550883,0.00037104893,0.00035280804,0.0003258533,0.00037092896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017248254,0.00059546524,0.00060903066,0.0023305113,0.0019114247,0.002820284,0.0009220536,0.0012891275,0.013136148],"category_scores_gemma":[0.008289936,0.00042355253,0.00048650225,0.0013383784,0.0033732266,0.00989755,0.003191283,0.0025996098,0.0023443755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057419235,0.000013455022,0.00024719632,0.00004245214,0.000006605054,0.00004425241,0.0001270594,0.0010077903,0.00025131597,0.98491514,0.0052448576,0.008042368],"study_design_scores_gemma":[0.000010056778,0.000009791443,0.00031013077,0.000029856046,0.0000064125293,0.00008621323,0.000074101896,0.0034494437,0.00018965075,0.9905365,0.0052864635,0.000011408437],"about_ca_topic_score_codex":0.0015034991,"about_ca_topic_score_gemma":0.0020903572,"teacher_disagreement_score":0.013136148,"about_ca_system_score_codex":0.001621485,"about_ca_system_score_gemma":0.0006707678,"threshold_uncertainty_score":0.043944776},"labels":[],"label_agreement":null},{"id":"W2399752582","doi":"","title":"A surprising regularity in the number of Hamilton paths in polygonal bigraphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.013920836536014064,"score_gpt":0.2833612627848556,"score_spread":0.26944042624884157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399752582","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8295483,0.0021599028,0.10254121,0.005953817,0.00057106296,0.000078183126,0.0025478955,0.0010285056,0.05557114],"genre_scores_gemma":[0.97644764,0.00050050183,0.016045228,0.0004144078,0.0002634885,0.00006808094,0.00087538833,0.00017375844,0.0052114683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911517,0.00017944083,0.00004598101,0.0002746821,0.00022883582,0.00015596916],"domain_scores_gemma":[0.9877292,0.007917975,0.0016083887,0.0013017592,0.00058857753,0.000854074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006683812,0.00036438002,0.0008056985,0.0015411561,0.001367299,0.0024743772,0.0019054979,0.0016611804,0.0056808325],"category_scores_gemma":[0.015277087,0.0008671548,0.00064590684,0.0014298919,0.0029274975,0.0035241467,0.0013818659,0.00211118,0.00055241387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079462136,0.00018058078,0.018526819,0.000681059,0.0001717534,0.0016078796,0.00091063784,0.026471596,0.013314982,0.86877865,0.027934091,0.04062728],"study_design_scores_gemma":[0.00010068942,0.00007303505,0.007975565,0.000067966204,0.00007441598,0.0012623739,0.0002714586,0.040881738,0.0023796847,0.9398831,0.006986902,0.000043058193],"about_ca_topic_score_codex":0.0012273946,"about_ca_topic_score_gemma":0.0020164032,"teacher_disagreement_score":0.0056808325,"about_ca_system_score_codex":0.00086964166,"about_ca_system_score_gemma":0.00036635197,"threshold_uncertainty_score":0.019004285},"labels":[],"label_agreement":null},{"id":"W2399766084","doi":"","title":"On (64, 28, 12) Difference Sets.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.00696582238213507,"score_gpt":0.18579112621530564,"score_spread":0.17882530383317058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399766084","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32872328,0.0012890832,0.20686105,0.0044807754,0.0014260429,0.00026186838,0.0033147228,0.0007707921,0.4528724],"genre_scores_gemma":[0.8571833,0.00061686814,0.05260676,0.0014627186,0.00034301289,0.00026628762,0.0024708235,0.00037070643,0.0846795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975345,0.0006400292,0.000107972795,0.0004498204,0.00058763643,0.00067994895],"domain_scores_gemma":[0.9967393,0.0017960316,0.00027597937,0.00050974014,0.00039783953,0.00028102993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009912136,0.00080813176,0.001025018,0.002444291,0.0031158244,0.0029194024,0.0014376965,0.0012732944,0.035291627],"category_scores_gemma":[0.0045867455,0.0004797173,0.00080546364,0.0019600694,0.0025033667,0.004341908,0.003884327,0.0024869116,0.0063872007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017996755,0.00006848859,0.00023454605,0.00006119094,0.00001460238,0.00017235099,0.00023918503,0.0012747481,0.0012827226,0.97648025,0.007440232,0.012551705],"study_design_scores_gemma":[0.000051686115,0.000024662477,0.0002760314,0.00004171304,0.000011293609,0.00016057972,0.00017559399,0.004083152,0.001180431,0.9826627,0.011312745,0.00001939339],"about_ca_topic_score_codex":0.00137645,"about_ca_topic_score_gemma":0.0023201052,"teacher_disagreement_score":0.035291627,"about_ca_system_score_codex":0.0018205296,"about_ca_system_score_gemma":0.00088120304,"threshold_uncertainty_score":0.11806232},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Applied mathematics","score_opus":0.022771295870573267,"score_gpt":0.292089862847564,"score_spread":0.26931856697699075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399769410","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15614122,0.0051107975,0.1827191,0.0116569735,0.0020981114,0.00008610701,0.0009833125,0.0003348086,0.6408696],"genre_scores_gemma":[0.83049524,0.0027992227,0.046792936,0.002204071,0.0012890634,0.00012011261,0.00079454767,0.00028365018,0.115221255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994137,0.00015674504,0.000027716264,0.00009553147,0.00019567883,0.00011056878],"domain_scores_gemma":[0.9989637,0.00059873227,0.00006963661,0.00009051845,0.00018708769,0.0000902533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087653485,0.00063117483,0.0007083741,0.0013746251,0.001251582,0.0018690146,0.0008573205,0.0009509909,0.018234774],"category_scores_gemma":[0.0034445913,0.00035723008,0.00073090167,0.0013113586,0.0024835463,0.00478472,0.002146037,0.0039697257,0.0024322555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013012887,0.000009640522,0.00009563871,0.00001812255,0.0000030827628,0.000033698343,0.00009913888,0.00021344329,0.00016005567,0.9932514,0.0019555795,0.0041471184],"study_design_scores_gemma":[0.000015083514,0.0000059385834,0.000111321315,0.000011970029,0.0000035832193,0.00006134031,0.000040828814,0.0014608629,0.00015832577,0.9927088,0.0054170084,0.0000050042713],"about_ca_topic_score_codex":0.0013772348,"about_ca_topic_score_gemma":0.0018081029,"teacher_disagreement_score":0.018234774,"about_ca_system_score_codex":0.0018634533,"about_ca_system_score_gemma":0.000573521,"threshold_uncertainty_score":0.06100136},"labels":[],"label_agreement":null},{"id":"W2399777153","doi":"","title":"Edge choosability and total choosability of toroidal graphs without intersecting triangles.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Toroid; Combinatorics; Physics; Plasma","score_opus":0.019398212443042493,"score_gpt":0.28856796817331604,"score_spread":0.2691697557302735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399777153","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7580584,0.0005259491,0.11744468,0.0005396107,0.00010259726,0.00009302763,0.0013743428,0.0003013634,0.12156],"genre_scores_gemma":[0.9828393,0.00031079724,0.0076176054,0.00008078617,0.000043747274,0.000046739846,0.0008044264,0.00009412077,0.008162531],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951255,0.000090707355,0.000031593365,0.00012713003,0.00011419013,0.00012388556],"domain_scores_gemma":[0.9974137,0.001362684,0.00033708595,0.0004011611,0.0001745559,0.00031090784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037765285,0.00036320707,0.00043662312,0.00058397214,0.00086796534,0.0018472009,0.00083807565,0.00047040582,0.016098998],"category_scores_gemma":[0.0031644625,0.00037069127,0.0005919295,0.000929768,0.0014476177,0.0023816682,0.0011984167,0.0010706389,0.0008625679],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006448459,0.00006841047,0.0029725535,0.00028238533,0.000053557247,0.00038772105,0.00059833954,0.019418426,0.010792393,0.9170377,0.005452185,0.042291347],"study_design_scores_gemma":[0.0000917851,0.00010790316,0.003146366,0.0000534746,0.00007938734,0.000688253,0.00055697403,0.04105762,0.0072254054,0.93883455,0.0081183165,0.000039904684],"about_ca_topic_score_codex":0.0020823465,"about_ca_topic_score_gemma":0.0022663795,"teacher_disagreement_score":0.016098998,"about_ca_system_score_codex":0.0006166982,"about_ca_system_score_gemma":0.00044899623,"threshold_uncertainty_score":0.05385655},"labels":[],"label_agreement":null},{"id":"W2399778347","doi":"","title":"Fibonacci Graceful Graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Fibonacci number; Combinatorics; Discrete mathematics","score_opus":0.007963110732290644,"score_gpt":0.22061843209142779,"score_spread":0.21265532135913714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399778347","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2102229,0.0030462553,0.26461348,0.005170072,0.0007632339,0.00017003469,0.0025271762,0.0019758842,0.511511],"genre_scores_gemma":[0.8619683,0.001470482,0.06497297,0.0012836327,0.00045666003,0.00021452471,0.0018892739,0.00041921425,0.06732505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993206,0.00014020797,0.000034153687,0.00016995413,0.000176568,0.00015847964],"domain_scores_gemma":[0.9981305,0.00088652654,0.00018695678,0.00042346024,0.00016666732,0.00020585202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006370892,0.0006348668,0.000540643,0.0018761159,0.0029155393,0.0030698704,0.0009541379,0.001146071,0.015600817],"category_scores_gemma":[0.0027581982,0.00046177,0.000726815,0.0017438385,0.0022818563,0.003480886,0.0017181549,0.0016592093,0.002679919],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019230063,0.00000659084,0.00011336821,0.00002418991,0.0000034298873,0.000031754156,0.000067962406,0.0006841547,0.00058423553,0.988457,0.004085415,0.005922743],"study_design_scores_gemma":[0.0000056936747,0.0000044265994,0.00013231332,0.000010598251,0.0000055925343,0.00007986568,0.000049933922,0.0024704807,0.00063399744,0.9854848,0.011114009,0.000008267799],"about_ca_topic_score_codex":0.0020328774,"about_ca_topic_score_gemma":0.003598323,"teacher_disagreement_score":0.015600817,"about_ca_system_score_codex":0.0018505176,"about_ca_system_score_gemma":0.0008196739,"threshold_uncertainty_score":0.052190006},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dimension (graph theory); Metric (unit); Combinatorics","score_opus":0.021492643376789723,"score_gpt":0.22283161625877596,"score_spread":0.20133897288198624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399806649","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69508,0.0033981001,0.15010062,0.0028303787,0.00037360462,0.000069407164,0.0026540102,0.00035733695,0.14513661],"genre_scores_gemma":[0.96259356,0.0011877994,0.023269538,0.00021279645,0.00018042517,0.000089322304,0.00091772014,0.000090166264,0.011458755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99949205,0.00015047396,0.00002697829,0.000076747936,0.0001616274,0.00009213012],"domain_scores_gemma":[0.99859303,0.0006027399,0.00022921586,0.00013036259,0.00018676766,0.00025775167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004083817,0.00042053475,0.0005615157,0.0014058113,0.00091789966,0.002112783,0.0006597325,0.0008432255,0.0056453687],"category_scores_gemma":[0.0032681932,0.00031496,0.0002990992,0.0008502161,0.0010379866,0.0024263335,0.0015285509,0.000868484,0.0008260463],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017490337,0.000024834433,0.0010286991,0.00018110173,0.000040237363,0.00007973132,0.00014294418,0.010629784,0.0047618654,0.9548618,0.008866174,0.019207984],"study_design_scores_gemma":[0.000025330884,0.00003929742,0.001056443,0.00003997265,0.00001703164,0.00030874877,0.00011078943,0.030841116,0.0025116222,0.9542508,0.010780149,0.000018778665],"about_ca_topic_score_codex":0.00040353212,"about_ca_topic_score_gemma":0.0008000497,"teacher_disagreement_score":0.0056453687,"about_ca_system_score_codex":0.00083681446,"about_ca_system_score_gemma":0.00042868857,"threshold_uncertainty_score":0.018885612},"labels":[],"label_agreement":null},{"id":"W2399807751","doi":"","title":"A Unified A pproach to External Graphs for Different Indices.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.046065597460661016,"score_gpt":0.30777249807071533,"score_spread":0.2617069006100543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399807751","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004640141,0.0007836364,0.9064355,0.0015443066,0.0011078992,0.00016562927,0.000361117,0.0012880181,0.08367374],"genre_scores_gemma":[0.112070024,0.0023439012,0.8056068,0.0028736764,0.0013683053,0.00071293337,0.0012336524,0.003166001,0.070624694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976306,0.0007800948,0.00019436734,0.0005549137,0.0006031234,0.00023697008],"domain_scores_gemma":[0.995583,0.00076760346,0.00015404867,0.0024986214,0.0007011193,0.00029556826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026365006,0.0015072598,0.0018965409,0.004330782,0.004908495,0.0063341926,0.0055295895,0.0032115774,0.018301165],"category_scores_gemma":[0.007778174,0.0013242144,0.0033561941,0.0040415693,0.0064966446,0.018545214,0.008701861,0.008792442,0.010659625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009277178,0.000019609746,0.00005401536,0.00003184588,0.000005611625,0.00004295561,0.00011430876,0.0004480365,0.0003335156,0.98696923,0.004511096,0.007460421],"study_design_scores_gemma":[0.000006365523,0.000008495272,0.000035014553,0.00003443815,0.00001025885,0.00010715903,0.00006303322,0.0048792507,0.0003202432,0.96976197,0.024759533,0.000014280679],"about_ca_topic_score_codex":0.0017875369,"about_ca_topic_score_gemma":0.0038067105,"teacher_disagreement_score":0.018301165,"about_ca_system_score_codex":0.0017514402,"about_ca_system_score_gemma":0.0015210927,"threshold_uncertainty_score":0.061223447},"labels":[],"label_agreement":null},{"id":"W2399809272","doi":"","title":"The number of rooted simple bipartite maps on the sphere.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Simple (philosophy); Bipartite graph; Combinatorics; Epistemology; Philosophy","score_opus":0.032443585535611975,"score_gpt":0.3056595376327553,"score_spread":0.2732159520971433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399809272","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8320049,0.0012557921,0.047138672,0.0025074102,0.00041207278,0.00006637078,0.0014878606,0.0004341157,0.11469283],"genre_scores_gemma":[0.98041415,0.0005838159,0.0055345073,0.00015173366,0.00024720674,0.00006487721,0.000518678,0.00007506821,0.012410011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992073,0.0001988351,0.000039342573,0.0001394411,0.00025719593,0.00015790263],"domain_scores_gemma":[0.9954269,0.0021316842,0.0005975335,0.00030984764,0.00048569444,0.0010482349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007399494,0.00046340507,0.00081816356,0.0030000699,0.00146132,0.0036127728,0.0011398835,0.0013980842,0.010479623],"category_scores_gemma":[0.0071105743,0.00038249625,0.00044331542,0.0010984605,0.002553788,0.0032769924,0.0021006733,0.0010251494,0.0014556589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016152776,0.000026224408,0.0010727717,0.000110969624,0.000026616966,0.00008032103,0.00019702796,0.0035482503,0.002928538,0.97856617,0.0043237624,0.00895775],"study_design_scores_gemma":[0.000046756497,0.000038434773,0.002222244,0.00004475002,0.00003076419,0.0004509384,0.00016386542,0.027826468,0.002642574,0.9594325,0.0070680613,0.000032677985],"about_ca_topic_score_codex":0.0008628133,"about_ca_topic_score_gemma":0.0008575885,"teacher_disagreement_score":0.010479623,"about_ca_system_score_codex":0.0010994514,"about_ca_system_score_gemma":0.00056604645,"threshold_uncertainty_score":0.035057843},"labels":[],"label_agreement":null},{"id":"W2399837191","doi":"","title":"The Transformation Digraph D","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Digraph; Transformation (genetics); Mathematics; Combinatorics; Biology; Genetics","score_opus":0.026160050995372604,"score_gpt":0.20080171190480137,"score_spread":0.17464166090942876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399837191","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097932644,0.0009620869,0.3159574,0.0055112364,0.0016043308,0.0004485334,0.009839821,0.0014834877,0.56626046],"genre_scores_gemma":[0.6360293,0.0018152589,0.052984357,0.0020743397,0.00035499228,0.00041914242,0.008474443,0.0005634216,0.29728478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999345,0.00009870598,0.00003586142,0.00024860562,0.00012030878,0.00015151389],"domain_scores_gemma":[0.99931157,0.00019894235,0.000056757643,0.00014059003,0.00016654308,0.00012568958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026306044,0.0006095881,0.0006205216,0.0019868154,0.0017456358,0.0039542634,0.0007762453,0.001097538,0.043279033],"category_scores_gemma":[0.0010142429,0.00035315685,0.0006480199,0.001777173,0.0014195747,0.0025546057,0.001536842,0.0017448931,0.0086276075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051823696,0.000055578137,0.00034884797,0.00009340817,0.000016889444,0.00031293172,0.00019233255,0.0010338913,0.001642506,0.9566425,0.01268771,0.02692152],"study_design_scores_gemma":[0.00002691284,0.000018490167,0.0003510158,0.000030446607,0.000017095703,0.00040022744,0.00021814842,0.0037652198,0.001770105,0.89670223,0.096679546,0.00002063477],"about_ca_topic_score_codex":0.002466278,"about_ca_topic_score_gemma":0.0018156819,"teacher_disagreement_score":0.043279033,"about_ca_system_score_codex":0.0013492537,"about_ca_system_score_gemma":0.001078227,"threshold_uncertainty_score":0.14478278},"labels":[],"label_agreement":null},{"id":"W2399847103","doi":"","title":"On The Possible Automorphisms Of A 3-(16, 7, 5) Design.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Automorphism; Mathematics; Pure mathematics","score_opus":0.009452743701632764,"score_gpt":0.19324766696118817,"score_spread":0.1837949232595554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399847103","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31314754,0.001522601,0.28018087,0.002761341,0.0005936344,0.00026492594,0.0006622009,0.00054078765,0.4003261],"genre_scores_gemma":[0.88830805,0.0008168953,0.074150085,0.00050527835,0.00013131095,0.00022478553,0.00036744692,0.00015282957,0.035343405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989059,0.00048747746,0.00005469054,0.00013126186,0.00020288552,0.00021780186],"domain_scores_gemma":[0.9984465,0.0007803472,0.0001917912,0.00031337148,0.00015321434,0.00011485702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008787112,0.0005803052,0.00036511474,0.0010180183,0.0018028814,0.0021225954,0.00063191645,0.0013389967,0.016901217],"category_scores_gemma":[0.0031737462,0.00045913827,0.0008205203,0.0006365933,0.0021149174,0.0025281154,0.001260071,0.001234424,0.0024626872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013404507,0.000035850997,0.00044646466,0.00006985055,0.000017830387,0.000277134,0.00023825598,0.004480785,0.0022684128,0.9719344,0.0032517505,0.016845295],"study_design_scores_gemma":[0.000038037175,0.000060610855,0.00030233403,0.000079962156,0.000028039796,0.00034143912,0.00018015577,0.010225601,0.001893227,0.971686,0.015138639,0.00002592137],"about_ca_topic_score_codex":0.0007042022,"about_ca_topic_score_gemma":0.0013940332,"teacher_disagreement_score":0.016901217,"about_ca_system_score_codex":0.00084072794,"about_ca_system_score_gemma":0.0007952471,"threshold_uncertainty_score":0.05654025},"labels":[],"label_agreement":null},{"id":"W2399866138","doi":"","title":"On the Nonexistence of q-ary Linear Codes Attaining the Griesmer Bound.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.017822214905014656,"score_gpt":0.2465012744620836,"score_spread":0.22867905955706896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399866138","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4832756,0.0066193882,0.26922926,0.015927749,0.0008730245,0.00014172606,0.0010416252,0.0011218359,0.22176972],"genre_scores_gemma":[0.9599671,0.0017219123,0.025842084,0.0015660085,0.00046644246,0.00020019319,0.00037935143,0.00020249448,0.009654526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965822,0.00105982,0.00015881367,0.0005279818,0.0009357675,0.00073534425],"domain_scores_gemma":[0.9547454,0.03882629,0.0015589014,0.002603458,0.0011772346,0.0010887334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004164798,0.00068692653,0.0015292561,0.001771737,0.002851189,0.004594278,0.0019483226,0.003420717,0.0061058006],"category_scores_gemma":[0.04073566,0.0012099376,0.0008450236,0.0012961784,0.006183509,0.00934724,0.006191608,0.0062605864,0.0022581737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015555636,0.0000320247,0.00048068335,0.00008155303,0.000019768533,0.00016287109,0.0001975437,0.0029157978,0.0017916915,0.9856068,0.0038447443,0.004710931],"study_design_scores_gemma":[0.000037588467,0.000033390388,0.00017710138,0.000038992857,0.000011353479,0.0003027925,0.0000640949,0.0076078554,0.0012714566,0.98854953,0.0018817686,0.000024146442],"about_ca_topic_score_codex":0.0005162671,"about_ca_topic_score_gemma":0.00049685815,"teacher_disagreement_score":0.0061058006,"about_ca_system_score_codex":0.0010493386,"about_ca_system_score_gemma":0.001140294,"threshold_uncertainty_score":0.022025824},"labels":[],"label_agreement":null},{"id":"W2399867629","doi":"","title":"Number of Embeddings of Wheel Graphs on Surfaces of Small Genus.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Genus; Mathematics; Combinatorics; Zoology; Biology","score_opus":0.031631023267120896,"score_gpt":0.28210353163178187,"score_spread":0.25047250836466095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399867629","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95004493,0.0007197614,0.015153654,0.0015800305,0.00021304715,0.00004164422,0.0012407728,0.0005094993,0.030496616],"genre_scores_gemma":[0.98621666,0.00034563817,0.0045328396,0.000104183695,0.00010063758,0.000060588914,0.0013982856,0.00013445532,0.0071068117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988875,0.0002455912,0.00006614291,0.00028437987,0.00027136155,0.00024511572],"domain_scores_gemma":[0.99226576,0.004400281,0.00094075507,0.00071179116,0.00041814047,0.0012632596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090221537,0.0007448508,0.0009942813,0.002026848,0.0019888121,0.0041983626,0.0018472124,0.0019758889,0.01795193],"category_scores_gemma":[0.009607269,0.00069233385,0.0008311242,0.001250419,0.0025264674,0.0045858943,0.002340246,0.0014892848,0.0012349401],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018830749,0.0003375071,0.027448032,0.00093024614,0.00029028358,0.0008932317,0.0017821031,0.025258044,0.018708082,0.839612,0.026780928,0.05607647],"study_design_scores_gemma":[0.00025283083,0.00024350171,0.017288063,0.00021494113,0.00031054887,0.0017817275,0.0016533057,0.07785345,0.011002604,0.87367517,0.01561941,0.00010442798],"about_ca_topic_score_codex":0.0007867047,"about_ca_topic_score_gemma":0.0012947946,"teacher_disagreement_score":0.01795193,"about_ca_system_score_codex":0.0010714644,"about_ca_system_score_gemma":0.0006554855,"threshold_uncertainty_score":0.060055196},"labels":[],"label_agreement":null},{"id":"W2399871227","doi":"","title":"Upper Bounds on the D(β)-Vertex-Distinguishing Total-Chromatic Number of Graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Vertex (graph theory); Combinatorics; Brooks' theorem; Graph; Discrete mathematics; 1-planar graph; Chordal graph","score_opus":0.022532212331334366,"score_gpt":0.2498873187722664,"score_spread":0.22735510644093201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399871227","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39273664,0.008338536,0.26510113,0.0128528355,0.0010266864,0.00029793716,0.009049716,0.0027597444,0.30783674],"genre_scores_gemma":[0.92407554,0.002361698,0.056419466,0.0011079037,0.00048461882,0.0002692545,0.0027379617,0.00051130715,0.012032353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979234,0.00038343683,0.00008912814,0.00057877606,0.0005309757,0.0004943554],"domain_scores_gemma":[0.9747624,0.018643292,0.001097447,0.0025864,0.0010978989,0.0018126615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030359062,0.00174218,0.0011177693,0.0032678314,0.0023653002,0.004142229,0.004796125,0.0018655448,0.015516237],"category_scores_gemma":[0.019618358,0.0009324179,0.001097698,0.0033699612,0.0037123794,0.0072512045,0.0043086302,0.0051728967,0.0021628137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012964255,0.00041850362,0.012036736,0.0010052425,0.00016930464,0.00022034471,0.00061582343,0.049776375,0.01707001,0.8041047,0.04881651,0.06447005],"study_design_scores_gemma":[0.00013743251,0.00010796051,0.006192534,0.00018864704,0.0001794726,0.0006797621,0.00025255492,0.119779274,0.008170544,0.84268403,0.021531122,0.000096555785],"about_ca_topic_score_codex":0.0022537562,"about_ca_topic_score_gemma":0.004973573,"teacher_disagreement_score":0.015516237,"about_ca_system_score_codex":0.004922826,"about_ca_system_score_gemma":0.0017778762,"threshold_uncertainty_score":0.051907003},"labels":[],"label_agreement":null},{"id":"W2399940019","doi":"","title":"Chromaticity of Complete Tripartite Graphs With Certain Star or Matching Deleted.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chromaticity; Mathematics; Star (game theory); Matching (statistics); Combinatorics; Artificial intelligence; Computer science; Statistics; Mathematical analysis","score_opus":0.0156297330219401,"score_gpt":0.23147047304268395,"score_spread":0.21584074002074385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399940019","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8747194,0.00036794212,0.04246814,0.0013429883,0.00009113822,0.000064584405,0.0024200098,0.0002977351,0.078228034],"genre_scores_gemma":[0.97544867,0.0002110949,0.0121485945,0.00018717047,0.000056897512,0.000051135365,0.0016344424,0.000111848414,0.010150113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995111,0.00012725407,0.00002253151,0.00013269394,0.000085493186,0.00012090369],"domain_scores_gemma":[0.9973642,0.0011285002,0.00047791726,0.0004012954,0.00024597155,0.00038208172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004927384,0.0003412843,0.00039137038,0.001309875,0.0015655527,0.0028455008,0.0013583396,0.0009136796,0.012256135],"category_scores_gemma":[0.0027023212,0.00047952804,0.00042393507,0.0013466149,0.0014557525,0.0024687285,0.0010419218,0.0011798661,0.0009166792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005973035,0.00010633793,0.0047310884,0.00020280022,0.0000563862,0.00024621226,0.00065124227,0.017532326,0.011706084,0.93149036,0.01713599,0.015543905],"study_design_scores_gemma":[0.00013384275,0.0000790226,0.006297303,0.000064981265,0.000077017554,0.00060035236,0.00089024776,0.08274476,0.009213867,0.8823937,0.017438715,0.000066297674],"about_ca_topic_score_codex":0.0031947736,"about_ca_topic_score_gemma":0.0044058776,"teacher_disagreement_score":0.012256135,"about_ca_system_score_codex":0.0015920762,"about_ca_system_score_gemma":0.00066613546,"threshold_uncertainty_score":0.041000903},"labels":[],"label_agreement":null},{"id":"W2399957385","doi":"","title":"Equitable Coloring and Equitable Choosability of Planar Graphs without 6- and 7-Cycles.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Planar graph; List coloring; Combinatorics; Graph","score_opus":0.026221059166199247,"score_gpt":0.2945141008722831,"score_spread":0.2682930417060838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399957385","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6446328,0.00063503,0.21271007,0.0013521034,0.0001279638,0.00014954036,0.0009471223,0.0005836968,0.1388617],"genre_scores_gemma":[0.95830697,0.00036626754,0.022479594,0.00028808857,0.000072365496,0.00010456828,0.0008960651,0.00024056106,0.017245501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991068,0.00019965589,0.00005991436,0.00020440052,0.00020267995,0.0002264796],"domain_scores_gemma":[0.9963797,0.0017409603,0.00052012637,0.00074013893,0.00029298128,0.00032610507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000565609,0.0004223112,0.00048244715,0.00072749594,0.0013435277,0.0016283558,0.0012831514,0.0008778693,0.014832534],"category_scores_gemma":[0.0046770717,0.00055018853,0.0005291079,0.0010915591,0.0012946707,0.0037413675,0.0018676736,0.0016180066,0.0010436086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057273987,0.00024547218,0.0027342467,0.00029692904,0.00005152187,0.0007119789,0.0007275355,0.021446917,0.015037489,0.8824814,0.0059323288,0.06976136],"study_design_scores_gemma":[0.00009549512,0.000071061026,0.0016205173,0.000041891755,0.000055289525,0.0006538899,0.00035768893,0.028566675,0.009942909,0.94930893,0.009254733,0.000030960713],"about_ca_topic_score_codex":0.001289244,"about_ca_topic_score_gemma":0.0023395403,"teacher_disagreement_score":0.014832534,"about_ca_system_score_codex":0.00074856996,"about_ca_system_score_gemma":0.0005049163,"threshold_uncertainty_score":0.049619734},"labels":[],"label_agreement":null},{"id":"W2399973576","doi":"","title":"Extremal Tricyclic Graphs With Respect To Schultz Index.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tricyclic; Mathematics; Index (typography); Combinatorics; Computer science; Chemistry; Stereochemistry; World Wide Web","score_opus":0.0485138608039807,"score_gpt":0.30325052075040443,"score_spread":0.25473665994642375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399973576","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6548159,0.0010940493,0.037461746,0.0016213849,0.00029295497,0.00007015828,0.0012259433,0.0004695059,0.30294833],"genre_scores_gemma":[0.9784534,0.00046708647,0.0045545804,0.00018006533,0.00017134991,0.000038509246,0.00039432605,0.00008150403,0.015659098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951696,0.00009851532,0.000023959,0.000087082095,0.0001613576,0.00011216369],"domain_scores_gemma":[0.9983316,0.00054729567,0.0004302072,0.00023646114,0.00021651681,0.00023789337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003902153,0.0003462138,0.0005746432,0.0023640932,0.0013115016,0.0031993736,0.00074983935,0.0008312002,0.012492364],"category_scores_gemma":[0.0032698493,0.0002658858,0.00029289632,0.0014296168,0.0014303494,0.002379391,0.0018052574,0.0012898552,0.0015827442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007849535,0.000015933936,0.00049381517,0.000031266052,0.0000086261225,0.00010122389,0.00011299699,0.0013662406,0.001060611,0.9870072,0.0026756017,0.0070480383],"study_design_scores_gemma":[0.0000281982,0.000027024125,0.0011944716,0.000029969658,0.000020392421,0.00042899945,0.00021363137,0.008339984,0.0011736797,0.98221684,0.0063043265,0.000022398637],"about_ca_topic_score_codex":0.000806427,"about_ca_topic_score_gemma":0.0011011763,"teacher_disagreement_score":0.012492364,"about_ca_system_score_codex":0.00091349194,"about_ca_system_score_gemma":0.00041619744,"threshold_uncertainty_score":0.04179108},"labels":[],"label_agreement":null},{"id":"W2399979379","doi":"","title":"On the Ramsey Numbers R(S 2, m , K 2, q ) and R(sK 2 , K s +C n ).","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Ramsey's theorem; Combinatorics","score_opus":0.023987012879056382,"score_gpt":0.24051320584872485,"score_spread":0.21652619296966846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399979379","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5216036,0.0053999685,0.14067487,0.01582357,0.001151494,0.00010437557,0.0013481189,0.0005897645,0.31330425],"genre_scores_gemma":[0.9519572,0.0016150721,0.022611793,0.00093738956,0.00051446824,0.00011628812,0.0004235799,0.00012547511,0.02169868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990947,0.00032317362,0.000041690022,0.00018289233,0.00018755886,0.00016996889],"domain_scores_gemma":[0.992255,0.005203128,0.0008633073,0.000513034,0.0004660561,0.0006995394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019203915,0.0005832926,0.00055245624,0.0023750735,0.0016825172,0.0026487315,0.0010698604,0.0013451307,0.0117142275],"category_scores_gemma":[0.010391344,0.00039042573,0.00049923226,0.0010996556,0.0033327213,0.008843493,0.0031070183,0.0026690757,0.0014638116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016628986,0.000029127037,0.00055791426,0.00004954142,0.000009788945,0.00007766299,0.00023663352,0.0022522372,0.00049749535,0.98230493,0.005586176,0.008232168],"study_design_scores_gemma":[0.00003060325,0.000022077364,0.00093747803,0.0000573702,0.000010671701,0.00013977788,0.00016677023,0.0110429255,0.00043150276,0.9823741,0.00476265,0.00002408219],"about_ca_topic_score_codex":0.0018294479,"about_ca_topic_score_gemma":0.002668747,"teacher_disagreement_score":0.0117142275,"about_ca_system_score_codex":0.0019486989,"about_ca_system_score_gemma":0.0008578962,"threshold_uncertainty_score":0.039187968},"labels":[],"label_agreement":null},{"id":"W2399998015","doi":"","title":"First Order Rotatable Designs Incorporating Neighbour Effects.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Optimal Experimental Design Methods","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Order (exchange); Business","score_opus":0.06978905910689037,"score_gpt":0.36284157691097285,"score_spread":0.2930525178040825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399998015","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012561959,0.00041593582,0.98016673,0.000055613178,0.00017311226,0.0012761157,0.0003095861,0.00038117962,0.004659735],"genre_scores_gemma":[0.14818117,0.00044147726,0.8355594,0.0001717677,0.000098624354,0.0075174486,0.00029595828,0.00018133325,0.007552808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.95330757,0.03782835,0.0014951131,0.0040836562,0.0025764264,0.00070894277],"domain_scores_gemma":[0.92785263,0.057342302,0.0044462928,0.008167197,0.0016201977,0.00057143846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03246785,0.0023860263,0.0039016528,0.001373229,0.000673365,0.0023172826,0.0029260542,0.0021452825,0.023663169],"category_scores_gemma":[0.07110509,0.0018398849,0.0025348642,0.0016027571,0.002604613,0.002736523,0.0021995301,0.0023461785,0.0034552587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.014832309,0.0013089807,0.002281869,0.0054351813,0.0013853745,0.00026963494,0.00064359116,0.19756529,0.012754246,0.41232166,0.0033323807,0.34786946],"study_design_scores_gemma":[0.0056206123,0.02205433,0.0028688502,0.0011924873,0.0017455813,0.00030228405,0.00020304401,0.4641738,0.023403578,0.43779033,0.040253274,0.00039182534],"about_ca_topic_score_codex":0.0003659539,"about_ca_topic_score_gemma":0.00084190397,"teacher_disagreement_score":0.03246785,"about_ca_system_score_codex":0.0010851212,"about_ca_system_score_gemma":0.0020523407,"threshold_uncertainty_score":0.17170846},"labels":[],"label_agreement":null},{"id":"W2400004606","doi":"","title":"G-decomposition of λK v , where G has six vertices and nine edges.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Decomposition; Combinatorics; Chemistry","score_opus":0.006533967915192315,"score_gpt":0.2028833834597192,"score_spread":0.1963494155445269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400004606","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36929014,0.0010648402,0.23495881,0.0024062246,0.0012862033,0.0006229174,0.01367114,0.0013045109,0.37539512],"genre_scores_gemma":[0.7562272,0.00068593357,0.10211014,0.0009809189,0.00009606379,0.00027083093,0.0121491505,0.0004482546,0.12703148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997912,0.000027177226,0.000008707181,0.000052866726,0.00003124391,0.0000887936],"domain_scores_gemma":[0.99978346,0.000036123798,0.000033932964,0.000033833632,0.000052777104,0.000059885908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011142717,0.00063851435,0.00038464795,0.000985642,0.00093522633,0.0011702842,0.0007008664,0.00066883647,0.038948916],"category_scores_gemma":[0.00038049088,0.00020733083,0.00038626828,0.0007118304,0.00065860833,0.00075640687,0.0008851384,0.0009534154,0.009116996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013469688,0.00051885576,0.0034690136,0.0010346832,0.00016626413,0.0034003467,0.0009173003,0.011801143,0.08459285,0.7017532,0.076112695,0.114886776],"study_design_scores_gemma":[0.0002260357,0.0001719499,0.00884169,0.00031734406,0.00011483228,0.0031317258,0.0025641737,0.024899894,0.020312306,0.77017826,0.16916944,0.00007235843],"about_ca_topic_score_codex":0.0018289142,"about_ca_topic_score_gemma":0.0020475597,"teacher_disagreement_score":0.038948916,"about_ca_system_score_codex":0.0005308224,"about_ca_system_score_gemma":0.00056288106,"threshold_uncertainty_score":0.13029712},"labels":[],"label_agreement":null},{"id":"W2400015350","doi":"","title":"On strict-double-bound numbers of spiders and ladders.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.022371630106685934,"score_gpt":0.26389148852914546,"score_spread":0.24151985842245952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400015350","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23700957,0.0037111884,0.28318766,0.0030623614,0.0011661218,0.0001382693,0.00058173266,0.0004773438,0.4706657],"genre_scores_gemma":[0.9055965,0.0012988644,0.04599929,0.000652476,0.00042166485,0.0001685393,0.00040179596,0.00017861719,0.04528226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985084,0.0004069042,0.00013248915,0.00022230628,0.00043206842,0.00029785282],"domain_scores_gemma":[0.9952029,0.0025841957,0.0004438523,0.00042818897,0.00048654148,0.0008543956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012311009,0.00083431357,0.0009766322,0.0029442175,0.002913491,0.0052010766,0.0014580279,0.001558631,0.014482195],"category_scores_gemma":[0.010038238,0.00064634404,0.00087659544,0.0020501085,0.004472614,0.009917929,0.0039205677,0.003099856,0.002025877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000244314,0.000011306251,0.00015981932,0.000034720513,0.000004354585,0.00003311071,0.00010661462,0.00058304897,0.00014870752,0.9938175,0.0010191904,0.0040573236],"study_design_scores_gemma":[0.000008447159,0.000007855738,0.00013551838,0.000023389688,0.0000051135858,0.00005878109,0.000052228166,0.0023174207,0.00010817892,0.9948183,0.0024570976,0.000007653908],"about_ca_topic_score_codex":0.0015619032,"about_ca_topic_score_gemma":0.0025926125,"teacher_disagreement_score":0.014482195,"about_ca_system_score_codex":0.0016583817,"about_ca_system_score_gemma":0.0007295072,"threshold_uncertainty_score":0.048447788},"labels":[],"label_agreement":null},{"id":"W2400029043","doi":"","title":"The strong chromatic index of graphs with restricted Ore-degrees.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Chromatic scale; Edge coloring; Combinatorics; Graph; Computer science; Line graph; World Wide Web","score_opus":0.017795606998654418,"score_gpt":0.2259521465028881,"score_spread":0.20815653950423368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400029043","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78619075,0.0013706916,0.091248475,0.0033019527,0.00021263535,0.00006363864,0.0019989144,0.000374979,0.11523793],"genre_scores_gemma":[0.97869134,0.0004633707,0.01200991,0.00017500347,0.00014251257,0.00005146344,0.00056511647,0.00010682476,0.0077944244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924916,0.00019818461,0.000039273218,0.00017617526,0.00015044674,0.00018669781],"domain_scores_gemma":[0.99436355,0.0031797239,0.0007116313,0.00068177975,0.00037656477,0.00068674533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011377009,0.0005059123,0.00057980896,0.0021972144,0.0017709966,0.0039042265,0.0013884201,0.0010746768,0.00891852],"category_scores_gemma":[0.0064463248,0.00052163657,0.0004784033,0.0019178211,0.002530306,0.0065269223,0.0019703319,0.0018828847,0.0008631171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028629886,0.000061855215,0.0031982213,0.00011337101,0.000027599379,0.00006857374,0.00027426457,0.0072450545,0.0040848437,0.9651358,0.0062886933,0.013215394],"study_design_scores_gemma":[0.000044958146,0.000032992364,0.0026659367,0.00005249998,0.000037837188,0.00020254421,0.00029653878,0.033883806,0.0030792735,0.95336306,0.0063099647,0.000030607087],"about_ca_topic_score_codex":0.0016533211,"about_ca_topic_score_gemma":0.0026672941,"teacher_disagreement_score":0.00891852,"about_ca_system_score_codex":0.0019338403,"about_ca_system_score_gemma":0.0009154973,"threshold_uncertainty_score":0.029835463},"labels":[],"label_agreement":null},{"id":"W2400036930","doi":"","title":"Extremal Values for Identification, Domination and Maximum Cliques in Twin-Free Graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Identification (biology); Combinatorics; Discrete mathematics; Biology; Botany","score_opus":0.031186157292333417,"score_gpt":0.29171948966739675,"score_spread":0.2605333323750633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400036930","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.688704,0.0021843726,0.2400064,0.0026384937,0.00021710715,0.00009889624,0.001186153,0.0005170084,0.06444756],"genre_scores_gemma":[0.97709477,0.0002959512,0.018688783,0.000085884916,0.00009590424,0.0000690002,0.00030587762,0.00006831121,0.0032954952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989656,0.00031357477,0.000054152373,0.00020301786,0.00026210147,0.00020150251],"domain_scores_gemma":[0.99216664,0.0052354774,0.0007832095,0.0005471846,0.0004913494,0.0007761805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020414598,0.0005909022,0.00076824974,0.003675218,0.0016326366,0.003313306,0.0018599923,0.0015403361,0.006385095],"category_scores_gemma":[0.017137084,0.00058590336,0.0005412971,0.0019164445,0.0029363167,0.0054857223,0.0020401506,0.002060194,0.0004919509],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002615113,0.00006877206,0.0024230874,0.00013672965,0.00003778146,0.00013021713,0.00040272175,0.009590088,0.0016883932,0.963206,0.004190852,0.017863864],"study_design_scores_gemma":[0.00002644999,0.000021914682,0.0013664962,0.00004326055,0.00002146517,0.00023626837,0.00023087271,0.039024506,0.0012896162,0.9561013,0.001610453,0.000027388838],"about_ca_topic_score_codex":0.0004779315,"about_ca_topic_score_gemma":0.00084216596,"teacher_disagreement_score":0.006385095,"about_ca_system_score_codex":0.0015355751,"about_ca_system_score_gemma":0.00046351636,"threshold_uncertainty_score":0.021360219},"labels":[],"label_agreement":null},{"id":"W2400049355","doi":"","title":"On the spectral radius of unicyclic graphs with fixed maximum degree.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; Degree (music); Combinatorics; RADIUS; Eigenvalues and eigenvectors; Physics; Computer science; Quantum mechanics; Computer network","score_opus":0.057575284925403335,"score_gpt":0.25557179738454866,"score_spread":0.19799651245914532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400049355","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6587057,0.02005911,0.17146848,0.005742068,0.00069729507,0.00010585135,0.0013480213,0.0007536024,0.14111982],"genre_scores_gemma":[0.9797672,0.003942875,0.010465873,0.00030037249,0.0005243052,0.00010544579,0.00034005806,0.00021404527,0.004339842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986959,0.00060729345,0.000047062345,0.00021157517,0.00023141559,0.00020673632],"domain_scores_gemma":[0.9834003,0.012138571,0.0016364489,0.0008063399,0.00081318046,0.0012052106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001820047,0.0008232787,0.0014256564,0.004586482,0.0012798547,0.0022317932,0.0025018086,0.0015323076,0.00574154],"category_scores_gemma":[0.021159327,0.0006329034,0.00043342856,0.0023090579,0.0033790008,0.0048825415,0.0026417798,0.0017631776,0.0014522439],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044252013,0.000076318385,0.001962661,0.0003675316,0.00006391739,0.00021613901,0.0005619243,0.0374318,0.0045033693,0.91719824,0.013375453,0.023800146],"study_design_scores_gemma":[0.000051948366,0.00006392025,0.0016767619,0.00015635311,0.000047606896,0.0004392599,0.00044960048,0.08591065,0.001863528,0.9035513,0.005733314,0.000055802506],"about_ca_topic_score_codex":0.0011025734,"about_ca_topic_score_gemma":0.00092719716,"teacher_disagreement_score":0.00574154,"about_ca_system_score_codex":0.0015904965,"about_ca_system_score_gemma":0.00042874168,"threshold_uncertainty_score":0.019207358},"labels":[],"label_agreement":null},{"id":"W2400058436","doi":"","title":"On the (l, ω)-domination number of the cube network.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cube (algebra); Mathematics; Combinatorics","score_opus":0.019975972562532057,"score_gpt":0.2434718960139144,"score_spread":0.22349592345138233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400058436","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48041463,0.0063321805,0.18645574,0.008101288,0.00074501574,0.000108213644,0.0020630495,0.00042554396,0.31535435],"genre_scores_gemma":[0.9568421,0.0027277356,0.019250182,0.00067473965,0.0005056162,0.00017944963,0.00047000198,0.00011619123,0.019233981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931026,0.00023734529,0.000028747047,0.00011319121,0.0001465292,0.00016399291],"domain_scores_gemma":[0.9941975,0.004371628,0.0004092584,0.00026682022,0.00029880766,0.00045602067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011287831,0.00049495057,0.0006071088,0.0018468334,0.0012807607,0.0025047306,0.0010756191,0.00089196686,0.010990617],"category_scores_gemma":[0.009208273,0.0003120655,0.00035304998,0.0016984742,0.002380427,0.0044627707,0.001612074,0.001783887,0.001020388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018747548,0.000032398337,0.0011399878,0.00017439241,0.00002605679,0.000092654096,0.00020826347,0.018663812,0.0017903055,0.9403587,0.012868165,0.024457805],"study_design_scores_gemma":[0.000030405847,0.000027408163,0.0008488864,0.000055120607,0.00001629073,0.00018170582,0.00011407409,0.047734633,0.0008179184,0.94418555,0.005964704,0.000023326249],"about_ca_topic_score_codex":0.0017015581,"about_ca_topic_score_gemma":0.002224011,"teacher_disagreement_score":0.010990617,"about_ca_system_score_codex":0.0019030493,"about_ca_system_score_gemma":0.0009244393,"threshold_uncertainty_score":0.036767304},"labels":[],"label_agreement":null},{"id":"W2400060492","doi":"","title":"Degree and connectivity conditions for IM-extendibility and vertex-deletable IM-extendibility.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Matching (statistics); Graph","score_opus":0.032708916663560655,"score_gpt":0.2940946643015328,"score_spread":0.2613857476379722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400060492","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6418702,0.0016111217,0.1859911,0.002953019,0.00031698513,0.00035529997,0.0038438307,0.0007928415,0.16226564],"genre_scores_gemma":[0.967827,0.0006314765,0.022744985,0.0003416042,0.0002802084,0.00018764944,0.0015493066,0.00008974937,0.006347972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984584,0.0002049606,0.0001330896,0.00046860994,0.00036010696,0.00037493513],"domain_scores_gemma":[0.9907101,0.0048804944,0.0013943709,0.0010450234,0.0008053512,0.0011645822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011377849,0.00079626543,0.0006616546,0.0016094897,0.0014618246,0.0015985591,0.00133036,0.0012368555,0.012573506],"category_scores_gemma":[0.0109873265,0.00055026036,0.0009409094,0.001321792,0.002530542,0.006197229,0.0026024438,0.0024348034,0.0012020487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007446986,0.00024052683,0.008544044,0.0006479572,0.00007246037,0.0021922775,0.0012529333,0.020086946,0.022555538,0.89828455,0.006683853,0.03869419],"study_design_scores_gemma":[0.000182908,0.0004321526,0.011313587,0.0001947521,0.00013678301,0.0053503127,0.0013006828,0.04588259,0.023505913,0.87678003,0.034784134,0.00013608522],"about_ca_topic_score_codex":0.0009645577,"about_ca_topic_score_gemma":0.0012566989,"teacher_disagreement_score":0.012573506,"about_ca_system_score_codex":0.00068973016,"about_ca_system_score_gemma":0.00051577797,"threshold_uncertainty_score":0.04206258},"labels":[],"label_agreement":null},{"id":"W2400067391","doi":"","title":"The Combinatorial Nullstellensatz and DFT on Perfect Matchings in Bipartite Graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Combinatorics; Strong perfect graph theorem; Graph; 1-planar graph; Line graph","score_opus":0.009662535985603777,"score_gpt":0.25304128848461727,"score_spread":0.2433787524990135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400067391","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6016976,0.0033409363,0.17477031,0.014728665,0.00085182255,0.0002062252,0.0017722769,0.00046582462,0.20216638],"genre_scores_gemma":[0.97981447,0.0007130357,0.0074224714,0.00049973384,0.00055541575,0.000106739084,0.0005925695,0.00005989062,0.010235642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99744177,0.0010518474,0.00012534749,0.0003778505,0.0005820298,0.00042116625],"domain_scores_gemma":[0.9842329,0.011207633,0.0012484638,0.0016871397,0.0007416697,0.00088215916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023044301,0.00071136624,0.0011376684,0.0024365738,0.0018204465,0.0034944373,0.002441716,0.0021001317,0.014268017],"category_scores_gemma":[0.017716845,0.00069686456,0.0012549883,0.0015972332,0.007438942,0.0086253155,0.003993069,0.0038360443,0.0014737227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072157854,0.000043146305,0.0006228306,0.000060832983,0.000013231312,0.00010226809,0.00014008042,0.0024350767,0.00037376123,0.98725605,0.002573675,0.00630681],"study_design_scores_gemma":[0.00002520584,0.0000107910855,0.00021291751,0.000016774464,0.0000059882937,0.00011717753,0.000058699417,0.00758165,0.0002789557,0.99066204,0.0010192471,0.000010588122],"about_ca_topic_score_codex":0.001831871,"about_ca_topic_score_gemma":0.0014846341,"teacher_disagreement_score":0.014268017,"about_ca_system_score_codex":0.0018785275,"about_ca_system_score_gemma":0.0014223448,"threshold_uncertainty_score":0.04773128},"labels":[],"label_agreement":null},{"id":"W2400073997","doi":"","title":"The partition theorem of connected digraphs and its enumerative applications.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Partition (number theory); Combinatorics; Discrete mathematics","score_opus":0.016419957538955553,"score_gpt":0.23619141259896087,"score_spread":0.2197714550600053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400073997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09319339,0.0134260245,0.7184152,0.007857832,0.00076997804,0.00012265802,0.002227471,0.0010692533,0.16291828],"genre_scores_gemma":[0.753702,0.0092307,0.19013837,0.002195973,0.0015173178,0.00044190008,0.002444395,0.0005150249,0.039814327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989905,0.0003587036,0.000048542337,0.00020646189,0.00025870305,0.0001370951],"domain_scores_gemma":[0.9944193,0.004188895,0.00030165337,0.00059012504,0.00027005473,0.00022989277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014296958,0.0008665105,0.0012007459,0.0037073107,0.0021037273,0.0040637236,0.0023555502,0.0017735081,0.009848745],"category_scores_gemma":[0.010175833,0.0008087465,0.0012001016,0.0062067923,0.0038454637,0.009059578,0.0030760425,0.004465782,0.0015095688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016151032,0.00001689746,0.00026279007,0.000079352205,0.000012736786,0.000024324989,0.00010477188,0.0017510653,0.0001754937,0.9817633,0.0047966833,0.010996442],"study_design_scores_gemma":[0.0000072859843,0.0000036234035,0.00013464215,0.000023285264,0.000009784048,0.00004892038,0.00003938086,0.0061139,0.00016408897,0.9894271,0.0040208283,0.0000071164923],"about_ca_topic_score_codex":0.0028390666,"about_ca_topic_score_gemma":0.004076436,"teacher_disagreement_score":0.009848745,"about_ca_system_score_codex":0.0032624914,"about_ca_system_score_gemma":0.0010234212,"threshold_uncertainty_score":0.032947302},"labels":[],"label_agreement":null},{"id":"W2400082119","doi":"","title":"On 3-Degeneracy of Some C7-free Plane Graphs with Application to Choosability.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Degeneracy (biology); Mathematics; Plane (geometry); Combinatorics; Geometry; Biology","score_opus":0.005770905194615844,"score_gpt":0.2152584925234447,"score_spread":0.20948758732882886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400082119","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7106153,0.0017779124,0.115107924,0.003488333,0.00023707421,0.00011271784,0.001067157,0.00032362633,0.16727003],"genre_scores_gemma":[0.95433265,0.000849851,0.029676642,0.0005072135,0.00012708467,0.00008434783,0.0008331655,0.00012584725,0.013463201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996357,0.00008423854,0.000021934378,0.00008907203,0.00008581239,0.00008329644],"domain_scores_gemma":[0.9986694,0.00082450383,0.00016844357,0.000109174434,0.00007174386,0.00015675233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041691063,0.00043487627,0.0006269126,0.0016473485,0.0017788063,0.0018631109,0.00079020363,0.001441982,0.009199646],"category_scores_gemma":[0.0022903886,0.00048428972,0.0007367974,0.0014718721,0.0017576847,0.0027322685,0.0018658132,0.0025056384,0.00062832783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008693023,0.000045704757,0.0010855548,0.00011967279,0.000014340485,0.00026631844,0.00040554703,0.004357545,0.002648882,0.97247386,0.003793789,0.014701872],"study_design_scores_gemma":[0.00003257635,0.000015839758,0.00075704197,0.00003336205,0.00001412479,0.0003109102,0.00021685562,0.01448842,0.0012865877,0.97820413,0.00462181,0.00001838464],"about_ca_topic_score_codex":0.0016984368,"about_ca_topic_score_gemma":0.0016478765,"teacher_disagreement_score":0.009199646,"about_ca_system_score_codex":0.001161655,"about_ca_system_score_gemma":0.00041590212,"threshold_uncertainty_score":0.030775905},"labels":[],"label_agreement":null},{"id":"W2400107404","doi":"","title":"Chromaticity of Turán Graphs with Certain Matching or Star Deleted.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chromaticity; Mathematics; Star (game theory); Matching (statistics); Combinatorics; Computer science; Artificial intelligence; Statistics; Mathematical analysis","score_opus":0.01853201430150369,"score_gpt":0.27499117706498644,"score_spread":0.25645916276348274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400107404","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8761088,0.00022627389,0.024699189,0.0007699319,0.000067398105,0.00003736178,0.00085743394,0.00028474283,0.09694884],"genre_scores_gemma":[0.9845836,0.00012411001,0.0054856404,0.00012360353,0.000029895371,0.000023856614,0.00051450863,0.00006358173,0.0090512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999734,0.00006843531,0.000010589279,0.00006656869,0.000041038144,0.00007936425],"domain_scores_gemma":[0.9988073,0.00041076625,0.00026902676,0.0001632902,0.00014905534,0.00020062791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030118637,0.00024635918,0.00022795136,0.0011269393,0.0015273788,0.0016357164,0.000813284,0.00066537946,0.010192569],"category_scores_gemma":[0.001674189,0.00029435538,0.00032356294,0.00092796964,0.0012582415,0.0014750487,0.00075303053,0.00075718254,0.0008200239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026105568,0.00004275706,0.0030660576,0.00009397807,0.000025700947,0.00023625948,0.00057638146,0.0068731173,0.0076427865,0.966155,0.0064171636,0.00860986],"study_design_scores_gemma":[0.000064667904,0.00006855559,0.008309322,0.00005022671,0.00008069854,0.00076248404,0.0009775658,0.057290144,0.008102946,0.90508944,0.01914911,0.00005487592],"about_ca_topic_score_codex":0.003286533,"about_ca_topic_score_gemma":0.004802607,"teacher_disagreement_score":0.010192569,"about_ca_system_score_codex":0.0010273884,"about_ca_system_score_gemma":0.00044460665,"threshold_uncertainty_score":0.034097552},"labels":[],"label_agreement":null},{"id":"W2400133686","doi":"","title":"On connection between α-labelings and edge-antimagic labelings of diconnected graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Connection (principal bundle); Combinatorics; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Geometry; Computer science; Artificial intelligence","score_opus":0.014238371730405985,"score_gpt":0.23355733859490915,"score_spread":0.21931896686450317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400133686","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45464265,0.0065179253,0.25707328,0.01074492,0.0006963757,0.00018508923,0.0019705305,0.0006274914,0.26754165],"genre_scores_gemma":[0.90088403,0.0038712793,0.06601113,0.0024685666,0.00071203243,0.00020033278,0.0014364205,0.00026297887,0.024153208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982673,0.0005655207,0.00013440147,0.00043146985,0.00030912206,0.00029220682],"domain_scores_gemma":[0.984615,0.010261498,0.0015039479,0.0014684967,0.0008312399,0.0013197296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021232965,0.0006345644,0.00095985975,0.0035532822,0.0037317968,0.004972252,0.0019400269,0.0029453686,0.010386706],"category_scores_gemma":[0.012079273,0.0009616864,0.0009534286,0.0044325846,0.005358003,0.012948977,0.004365863,0.0042007477,0.001225052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054570664,0.00002784062,0.00067105464,0.0000701958,0.000008730906,0.000052345735,0.00021307328,0.00085199566,0.00037962745,0.9875481,0.0029195927,0.007202868],"study_design_scores_gemma":[0.00001307611,0.000012299153,0.00034434636,0.00003340229,0.000010871265,0.00013411534,0.00014709291,0.0028279857,0.00024276953,0.99249685,0.0037246908,0.000012503349],"about_ca_topic_score_codex":0.0016884514,"about_ca_topic_score_gemma":0.001901035,"teacher_disagreement_score":0.010386706,"about_ca_system_score_codex":0.002801789,"about_ca_system_score_gemma":0.00071681314,"threshold_uncertainty_score":0.034747005},"labels":[],"label_agreement":null},{"id":"W2400133969","doi":"","title":"Independence Of Countable Sets Of Formulas Of The Propositional Logic.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Countable set; Independence (probability theory); Propositional calculus; Propositional variable; Zeroth-order logic; Discrete mathematics; Autoepistemic logic; Calculus (dental); Intermediate logic; Theoretical computer science; Computer science; Statistics; Description logic; Multimodal logic","score_opus":0.01090722998033623,"score_gpt":0.22822507375646303,"score_spread":0.2173178437761268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400133969","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1834769,0.002982129,0.5500418,0.005189592,0.00049546146,0.00021068298,0.0037138814,0.0010038104,0.2528858],"genre_scores_gemma":[0.91274923,0.00097428955,0.053720757,0.000932142,0.00088606623,0.00027809292,0.0036426894,0.0003599569,0.026456818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99263036,0.0022756176,0.00062924187,0.001332889,0.002257694,0.000874135],"domain_scores_gemma":[0.97094077,0.02032413,0.0015378671,0.0032333757,0.002422644,0.0015411574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003967569,0.0007015457,0.0014846574,0.0036799805,0.0035479276,0.006832398,0.0022079065,0.0014795328,0.009140693],"category_scores_gemma":[0.019205213,0.0015660415,0.003779749,0.0018196442,0.0051125893,0.014091133,0.0050042355,0.006678411,0.0015466514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014819493,0.000080922946,0.0010805095,0.00008606344,0.000086299086,0.00015133154,0.00030797409,0.000614905,0.00080854335,0.9878015,0.0017484234,0.007085327],"study_design_scores_gemma":[0.000040264265,0.000017060347,0.0009873018,0.0000385658,0.00007312406,0.00020849587,0.00008956869,0.0052295453,0.001319641,0.98753417,0.004442702,0.000019598994],"about_ca_topic_score_codex":0.0028369196,"about_ca_topic_score_gemma":0.0040965155,"teacher_disagreement_score":0.009140693,"about_ca_system_score_codex":0.0025447372,"about_ca_system_score_gemma":0.001771146,"threshold_uncertainty_score":0.030578673},"labels":[],"label_agreement":null},{"id":"W2400134062","doi":"","title":"Double hexagonal chains with the extremal third order Randic index.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hexagonal crystal system; Index (typography); Order (exchange); Combinatorics; Pure mathematics; Crystallography; Chemistry; Computer science; Business","score_opus":0.019736589355187253,"score_gpt":0.26059800711887743,"score_spread":0.2408614177636902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400134062","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58543116,0.0013840953,0.08152802,0.0011201516,0.00059525593,0.00009082201,0.0006288376,0.00043454414,0.32878712],"genre_scores_gemma":[0.9629783,0.00035553516,0.01420882,0.00023768158,0.00011889218,0.00005490579,0.00022676814,0.000083854226,0.02173529],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997423,0.000055403314,0.000010369309,0.000040803363,0.00008266911,0.00006835174],"domain_scores_gemma":[0.99936265,0.00014496136,0.00010647841,0.00014898894,0.000086690336,0.00015021003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019659124,0.0002515554,0.0003887724,0.0010651919,0.0011395682,0.0020191772,0.00048077313,0.0009052904,0.012086838],"category_scores_gemma":[0.0012600626,0.00025910093,0.00021558776,0.00045721175,0.0010986531,0.0012240462,0.0010613453,0.0008673994,0.0012992425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010178863,0.000022976768,0.00054616114,0.00004666507,0.00000797725,0.00024596337,0.00009913529,0.0014241644,0.0046666055,0.98060554,0.0026390848,0.009593862],"study_design_scores_gemma":[0.0000543244,0.00005719182,0.0012723815,0.000057015157,0.000015229067,0.0008547912,0.0002936436,0.021033648,0.0066131996,0.9519731,0.017740123,0.000035405195],"about_ca_topic_score_codex":0.00073531386,"about_ca_topic_score_gemma":0.0016028923,"teacher_disagreement_score":0.012086838,"about_ca_system_score_codex":0.00046958664,"about_ca_system_score_gemma":0.00035452694,"threshold_uncertainty_score":0.04043448},"labels":[],"label_agreement":null},{"id":"W2400149291","doi":"","title":"Vertex PI indices of some sums of graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Pi; Combinatorics; Discrete mathematics; Graph; Geometry","score_opus":0.04150821381278157,"score_gpt":0.27329420567182866,"score_spread":0.23178599185904708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400149291","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53847617,0.0012855585,0.14129628,0.0018146023,0.0010256874,0.000105687104,0.0018336003,0.0007135748,0.31344882],"genre_scores_gemma":[0.89279824,0.00063170213,0.05450381,0.00040373934,0.00037947446,0.00014439506,0.0011680725,0.00037369528,0.049597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99943644,0.00011969274,0.00003978752,0.00010362792,0.00018804075,0.0001124214],"domain_scores_gemma":[0.99911696,0.00030626458,0.00016036279,0.00010547685,0.00016057811,0.00015046426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042767098,0.0005908903,0.0005325777,0.003101728,0.0020660746,0.002569245,0.00097414776,0.0008550293,0.009933482],"category_scores_gemma":[0.0024166855,0.00042133042,0.0005860343,0.001960745,0.0014741549,0.0026859152,0.0013266836,0.0017656385,0.0018380833],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009348568,0.000038945294,0.0009875017,0.00008423076,0.00002815942,0.00040797662,0.00037217437,0.0011836924,0.004141633,0.971686,0.0057098176,0.01526644],"study_design_scores_gemma":[0.0000112915795,0.000015996036,0.0011773948,0.000030652103,0.000027751772,0.0006110144,0.00021680846,0.00821547,0.002376979,0.9749435,0.012355337,0.000017758814],"about_ca_topic_score_codex":0.0006628478,"about_ca_topic_score_gemma":0.0011999073,"teacher_disagreement_score":0.009933482,"about_ca_system_score_codex":0.0007042808,"about_ca_system_score_gemma":0.00037437584,"threshold_uncertainty_score":0.03323078},"labels":[],"label_agreement":null},{"id":"W2400152152","doi":"","title":"Generalized Pell numbers and some relations with Fibonacci numbers.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Mathematics; Recurrence relation; Fibonacci polynomials; Pisano period; Combinatorics; Lucas number; Lucas sequence; Arithmetic; Discrete mathematics; Orthogonal polynomials","score_opus":0.0055060633184570475,"score_gpt":0.22755505273490184,"score_spread":0.2220489894164448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400152152","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082926914,0.038870722,0.1696676,0.0069356733,0.002912828,0.00011413887,0.00089630554,0.00048212762,0.6971936],"genre_scores_gemma":[0.77856946,0.018150838,0.08431507,0.002785619,0.0036184918,0.00032439304,0.00076269056,0.00027177928,0.1112016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995165,0.00013622128,0.000031321088,0.000078603014,0.0001623598,0.00007495203],"domain_scores_gemma":[0.99928206,0.00037493053,0.00009593453,0.0000719285,0.00011762151,0.000057638965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000746762,0.0008272695,0.0006795194,0.0027916967,0.0020515928,0.0038201353,0.00083401595,0.0010449089,0.014873266],"category_scores_gemma":[0.0031981433,0.00043379978,0.0008146496,0.003417224,0.003837949,0.006083251,0.0015261248,0.002121194,0.0025712703],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002962409,0.0000018404194,0.00002711077,0.000014361626,0.0000016474755,0.000028017786,0.00004751418,0.00009594339,0.00006522722,0.9956424,0.0011662671,0.0029067157],"study_design_scores_gemma":[0.000002392178,0.0000030613035,0.00006468192,0.000008988742,0.0000027106155,0.0000770635,0.000034321463,0.0003542834,0.00005629694,0.9902175,0.009174246,0.000004466889],"about_ca_topic_score_codex":0.001329686,"about_ca_topic_score_gemma":0.0017234932,"teacher_disagreement_score":0.014873266,"about_ca_system_score_codex":0.00130595,"about_ca_system_score_gemma":0.00058127,"threshold_uncertainty_score":0.04975605},"labels":[],"label_agreement":null},{"id":"W2400152870","doi":"","title":"An algorithm to find k-tight optimal double-loop networks.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Loop (graph theory); Double loop; Algorithm; Mathematical optimization; Combinatorics","score_opus":0.023157057146677283,"score_gpt":0.2425350326295899,"score_spread":0.2193779754829126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400152870","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020369157,0.0005162698,0.96170175,0.00038346802,0.00009841096,0.00027095905,0.00043649718,0.0031292439,0.013094255],"genre_scores_gemma":[0.16116984,0.00029505664,0.8289417,0.00017579245,0.000035943027,0.000424647,0.001183539,0.00040015957,0.007373328],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99958855,0.000087492655,0.000025595475,0.00011326873,0.00010028673,0.000084787534],"domain_scores_gemma":[0.9991517,0.00038615876,0.00006981031,0.00016655962,0.00015310456,0.00007269994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005943292,0.00134893,0.0009905768,0.0014407344,0.00095276843,0.0012286116,0.0016617846,0.0013337472,0.014598869],"category_scores_gemma":[0.00416718,0.0007209449,0.0006620848,0.0015863826,0.0006611985,0.0021399283,0.0023798812,0.001326662,0.0031629934],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005172261,0.00035062444,0.0011433505,0.00063932943,0.00011282362,0.00020155245,0.0003772805,0.30161718,0.007391878,0.054677736,0.036943145,0.59602785],"study_design_scores_gemma":[0.00023725319,0.00016761775,0.00041497507,0.00008390617,0.000053696927,0.00022455354,0.00022826625,0.8692307,0.0039546667,0.11252132,0.012848502,0.000034675653],"about_ca_topic_score_codex":0.002722896,"about_ca_topic_score_gemma":0.0051261797,"teacher_disagreement_score":0.014598869,"about_ca_system_score_codex":0.0009936421,"about_ca_system_score_gemma":0.001821979,"threshold_uncertainty_score":0.04883808},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.014727400286500035,"score_gpt":0.23503789332315927,"score_spread":0.22031049303665923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400192545","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023054829,0.024697028,0.20351014,0.03475952,0.014817986,0.00010017125,0.0015086058,0.0006668795,0.6968849],"genre_scores_gemma":[0.7088627,0.043491174,0.08745991,0.022873944,0.022163205,0.0004762002,0.0015725199,0.00073575444,0.11236455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923575,0.00020959893,0.000033405653,0.00021401925,0.00022611837,0.00008115581],"domain_scores_gemma":[0.9975957,0.001421181,0.00010623988,0.00043666948,0.0002956074,0.00014457623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008219285,0.00086031144,0.0007513149,0.0018608839,0.0013396166,0.0018787483,0.0013460206,0.0011432742,0.024700837],"category_scores_gemma":[0.005004642,0.0002984756,0.00090138277,0.0019368136,0.004252781,0.005206979,0.0028122852,0.0037648093,0.002826353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012949318,0.000004605238,0.00008330245,0.00008231374,0.000011167918,0.00016388507,0.00006430066,0.0005697727,0.00035840878,0.9761204,0.015171063,0.0073578767],"study_design_scores_gemma":[0.00000777802,0.000019262205,0.0002919944,0.000039930375,0.000016612026,0.00033816232,0.00004744604,0.0012067442,0.00021563587,0.9356748,0.06212942,0.0000122181755],"about_ca_topic_score_codex":0.0015643514,"about_ca_topic_score_gemma":0.0018478463,"teacher_disagreement_score":0.024700837,"about_ca_system_score_codex":0.0008536966,"about_ca_system_score_gemma":0.0005691761,"threshold_uncertainty_score":0.0826326},"labels":[],"label_agreement":null},{"id":"W2400212675","doi":"","title":"Some Results On Q-Integral Graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Cograph; Spectrum (functional analysis); Integral graph; Discrete mathematics; 1-planar graph; Laplace operator; Graph; Chordal graph; Line graph; Mathematical analysis; Voltage graph; Physics","score_opus":0.026300480505964258,"score_gpt":0.29257539447563224,"score_spread":0.26627491396966796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400212675","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17473227,0.015914857,0.3454576,0.0076618656,0.0015749804,0.00013838279,0.0013328003,0.0007952994,0.45239195],"genre_scores_gemma":[0.8408577,0.018797101,0.09124407,0.004626051,0.003534758,0.0001775047,0.0025423174,0.00048016556,0.037740305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951303,0.00011194375,0.000027983724,0.00010386016,0.0001472485,0.0000959009],"domain_scores_gemma":[0.99860376,0.0006561242,0.00018601687,0.00013663096,0.00020183892,0.0002155906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010995032,0.0010701765,0.00058962876,0.003995941,0.0016087735,0.0015885185,0.0011884691,0.0012572064,0.014829746],"category_scores_gemma":[0.0029916253,0.00041293722,0.0010293787,0.0032344423,0.0021077923,0.0034115906,0.001642532,0.0021908206,0.0021771374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041827996,0.00008348261,0.00067028403,0.00051261537,0.00002515391,0.0003119736,0.00038086696,0.0037257625,0.0026985821,0.95693773,0.008653831,0.025957853],"study_design_scores_gemma":[0.000008992937,0.000026660875,0.0005102122,0.00006209839,0.000022392887,0.0003588785,0.00016059885,0.004729439,0.00095799146,0.9783855,0.014762572,0.000014499621],"about_ca_topic_score_codex":0.0007922367,"about_ca_topic_score_gemma":0.0008597837,"teacher_disagreement_score":0.014829746,"about_ca_system_score_codex":0.001077047,"about_ca_system_score_gemma":0.0004000928,"threshold_uncertainty_score":0.049610496},"labels":[],"label_agreement":null},{"id":"W2400282024","doi":"","title":"Enumeration Of Non-Isomorphic Semigraphs In Γ 4 .","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Enumeration; Mathematics; Combinatorics","score_opus":0.013960530520867834,"score_gpt":0.23514324594318844,"score_spread":0.2211827154223206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400282024","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4923556,0.0005782663,0.33989003,0.0013122815,0.0002950332,0.00018491024,0.0022535424,0.001417658,0.16171269],"genre_scores_gemma":[0.8565359,0.0003006065,0.084270395,0.00027133536,0.00006462401,0.00017852521,0.002492194,0.00031602354,0.055570345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931765,0.00021640846,0.00006649618,0.00013237367,0.0001516352,0.00011541641],"domain_scores_gemma":[0.9973231,0.0013950785,0.00021474545,0.00043800133,0.00042139576,0.00020783833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005447525,0.00044305413,0.00043169118,0.0013868298,0.0014685958,0.0022870437,0.0008856715,0.0008427575,0.016282722],"category_scores_gemma":[0.0026104404,0.00046679712,0.00073920516,0.0012165642,0.0010881843,0.00355084,0.001943677,0.0011743809,0.0025535915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019975896,0.000093753166,0.0020380875,0.00018124869,0.000030746447,0.00046258452,0.0011373422,0.0018940297,0.007276695,0.9529264,0.004599182,0.02916021],"study_design_scores_gemma":[0.000016839029,0.000024396468,0.00087871734,0.000055627206,0.000027202086,0.00039598718,0.00057818735,0.0063293115,0.005538022,0.9723613,0.013777862,0.000016543881],"about_ca_topic_score_codex":0.0010173154,"about_ca_topic_score_gemma":0.0022516833,"teacher_disagreement_score":0.016282722,"about_ca_system_score_codex":0.0008594467,"about_ca_system_score_gemma":0.00066647393,"threshold_uncertainty_score":0.054471076},"labels":[],"label_agreement":null},{"id":"W2400282143","doi":"","title":"Alternating Domination In Arc-Colored Digraphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arc (geometry); Colored; Combinatorics; Geometry; Political science; Law","score_opus":0.013368183136049077,"score_gpt":0.28732149776533844,"score_spread":0.27395331462928935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400282143","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5085906,0.0012029809,0.3173414,0.0021333057,0.0002774479,0.0001856359,0.0013592667,0.0009018572,0.16800755],"genre_scores_gemma":[0.92626315,0.0005443695,0.040406685,0.00046019309,0.00010212435,0.000112266425,0.00065447,0.00014422472,0.031312425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892455,0.00037116522,0.000067839486,0.00022569964,0.00020275393,0.00020793814],"domain_scores_gemma":[0.9949764,0.003244273,0.00038892307,0.00046453672,0.00045311928,0.00047284877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075427664,0.0004086944,0.00046766474,0.0010772845,0.0013047875,0.0022478162,0.001064122,0.00088089245,0.0076711723],"category_scores_gemma":[0.0052512838,0.0004830396,0.0005098262,0.0013004025,0.0012854408,0.0033620957,0.0015487588,0.0013540585,0.00093834085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014616003,0.0000743171,0.0019236812,0.00017989826,0.000054205924,0.00058150286,0.00074461784,0.007842712,0.004847537,0.94561356,0.006395199,0.031596575],"study_design_scores_gemma":[0.000047527363,0.00002615136,0.000665955,0.000039431867,0.00004614935,0.0005770923,0.0002386113,0.032157417,0.0021893352,0.9524608,0.011528474,0.00002296665],"about_ca_topic_score_codex":0.0021477665,"about_ca_topic_score_gemma":0.0039069904,"teacher_disagreement_score":0.0076711723,"about_ca_system_score_codex":0.0013171473,"about_ca_system_score_gemma":0.00065834756,"threshold_uncertainty_score":0.02566266},"labels":[],"label_agreement":null},{"id":"W2400294061","doi":"","title":"The E 2 -Hamiltonian Property of Circuit Graphs of Matroids.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Matroid; Mathematics; Property (philosophy); Hamiltonian (control theory); Combinatorics; Graphic matroid; Discrete mathematics; Mathematical optimization","score_opus":0.014765639995292693,"score_gpt":0.24988504009855467,"score_spread":0.235119400103262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400294061","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6030801,0.0018933802,0.10763546,0.0035236352,0.00047574248,0.0000930269,0.0018925733,0.00033162188,0.28107458],"genre_scores_gemma":[0.9736126,0.0005482993,0.007700241,0.00058342196,0.00018958052,0.000041648487,0.0005367761,0.00005551445,0.016731987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997141,0.000067196386,0.000013089003,0.00007186406,0.000065439905,0.000068344205],"domain_scores_gemma":[0.9987846,0.0005223331,0.00020872094,0.0001761587,0.00011889034,0.00018926323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002152702,0.000272034,0.00026950022,0.0007490034,0.0009362935,0.0018116393,0.00058364024,0.0010070144,0.012417755],"category_scores_gemma":[0.0019456743,0.0002965695,0.00033370638,0.0008671292,0.0012850154,0.0021552693,0.0008570927,0.0009823462,0.00090301555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012170047,0.0000674817,0.0019612692,0.00015008237,0.000028258168,0.00035141644,0.0002442929,0.002084934,0.0077263336,0.9510749,0.008128998,0.028060313],"study_design_scores_gemma":[0.000043980206,0.00005886521,0.003063874,0.00004449528,0.000024859768,0.0008235063,0.00032598784,0.0065061236,0.004114813,0.9707771,0.0141980145,0.000018298655],"about_ca_topic_score_codex":0.0008162269,"about_ca_topic_score_gemma":0.0013310353,"teacher_disagreement_score":0.012417755,"about_ca_system_score_codex":0.0004624422,"about_ca_system_score_gemma":0.0002860239,"threshold_uncertainty_score":0.041541576},"labels":[],"label_agreement":null},{"id":"W2400313175","doi":"","title":"Chromatic Uniqueness of K 4 -Homeomorphic Graphs.","year":2012,"lang":"es","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Uniqueness; Combinatorics; Mathematical analysis","score_opus":0.016928779485902056,"score_gpt":0.24171071039381234,"score_spread":0.2247819309079103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400313175","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7744303,0.0012220268,0.09111982,0.0026201096,0.00022303428,0.00007681924,0.0011271514,0.00035158542,0.12882921],"genre_scores_gemma":[0.9623063,0.0004367712,0.01797032,0.00029079115,0.00007728499,0.00005088291,0.000601388,0.0001110477,0.018155115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961084,0.00010179564,0.000018862005,0.000118829594,0.00006082816,0.000089011475],"domain_scores_gemma":[0.99847215,0.00077085296,0.00021129167,0.00021192897,0.00014513002,0.00018865088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048354425,0.0003695778,0.0004926717,0.0012223509,0.0020700956,0.0025209207,0.0010467013,0.0012017397,0.010790714],"category_scores_gemma":[0.0026654266,0.0005020569,0.00055022835,0.0010471141,0.0018286991,0.003155684,0.0018414792,0.0015035312,0.001044904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013115857,0.000033635544,0.0021363085,0.00011212992,0.000019781728,0.00015711777,0.00037967463,0.0034224514,0.002990114,0.97067034,0.0058677183,0.014079476],"study_design_scores_gemma":[0.00003968684,0.00003000841,0.0023344113,0.000045422017,0.000030545925,0.0004693152,0.00076507364,0.012636785,0.0031559921,0.9679051,0.012553138,0.000034488912],"about_ca_topic_score_codex":0.0020364968,"about_ca_topic_score_gemma":0.002474881,"teacher_disagreement_score":0.010790714,"about_ca_system_score_codex":0.001343705,"about_ca_system_score_gemma":0.0005844961,"threshold_uncertainty_score":0.03609848},"labels":[],"label_agreement":null},{"id":"W2400363530","doi":"","title":"Cubic, edge critical, Hamilton laceable bigraphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Computer science; Artificial intelligence","score_opus":0.038777966897189264,"score_gpt":0.31665537306395475,"score_spread":0.2778774061667655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400363530","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36936626,0.0018110168,0.08343109,0.0027260394,0.0005107988,0.00022281507,0.0027761946,0.0013062292,0.53784955],"genre_scores_gemma":[0.86900204,0.0007127075,0.020427518,0.00060238194,0.0001407667,0.0000673136,0.0014933557,0.0001778377,0.107376106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998437,0.000023999768,0.0000050096646,0.000034984456,0.000042787393,0.000049521903],"domain_scores_gemma":[0.999373,0.00022083065,0.000068922825,0.0000707017,0.0001043366,0.00016217322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012399352,0.00033152287,0.00032808376,0.0007695309,0.0016227206,0.0012459412,0.00056988373,0.00060812576,0.017268961],"category_scores_gemma":[0.0014426187,0.00028075918,0.00027531272,0.0007050551,0.00096680125,0.0013469169,0.00092923216,0.0011270043,0.001528232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001451069,0.000052998414,0.0006407291,0.00023720005,0.000016359063,0.00047050425,0.00034868592,0.0026581886,0.0038798025,0.9464439,0.022449052,0.022657413],"study_design_scores_gemma":[0.0000573583,0.00003012613,0.0010036274,0.00003878622,0.00001997938,0.00039901637,0.00029624422,0.006885987,0.0016840748,0.9528958,0.036668994,0.000019955689],"about_ca_topic_score_codex":0.008525265,"about_ca_topic_score_gemma":0.02285699,"teacher_disagreement_score":0.017268961,"about_ca_system_score_codex":0.0011607015,"about_ca_system_score_gemma":0.0010494291,"threshold_uncertainty_score":0.05777043},"labels":[],"label_agreement":null},{"id":"W2400370104","doi":"","title":"Upper bounds for the vertex Folkman number F v (3, 3, 3;4) and F v (3, 3, 3;5).","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Graph","score_opus":0.016558539029801412,"score_gpt":0.2756444797928111,"score_spread":0.25908594076300967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400370104","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22224624,0.0100297015,0.13632266,0.008509858,0.001237054,0.00014393791,0.0032747935,0.0020073843,0.61622846],"genre_scores_gemma":[0.9136707,0.0027925833,0.047151472,0.0008749953,0.00075001153,0.00029661847,0.0018918915,0.00041625285,0.03215549],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979195,0.00037007537,0.000076605415,0.00032897422,0.0006858445,0.0006190419],"domain_scores_gemma":[0.98997724,0.007005379,0.0005176183,0.00081079075,0.00070640136,0.0009825068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022220183,0.0013049684,0.0010683052,0.006548357,0.0034714888,0.004715918,0.0030827702,0.002388294,0.019822823],"category_scores_gemma":[0.013538094,0.0006224885,0.0009622437,0.0029194758,0.0024029948,0.0074824537,0.0029059364,0.0038491075,0.0038696113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003025141,0.00014437984,0.0020437762,0.00024430885,0.00004613618,0.00015971533,0.00043089798,0.007027599,0.002934551,0.92368746,0.019925348,0.04305346],"study_design_scores_gemma":[0.00002737518,0.000033363776,0.0014613888,0.00013230483,0.000046457542,0.000294877,0.00014644196,0.01488189,0.0034461075,0.95905375,0.020418195,0.000057916735],"about_ca_topic_score_codex":0.0017097986,"about_ca_topic_score_gemma":0.0038674306,"teacher_disagreement_score":0.019822823,"about_ca_system_score_codex":0.0032213356,"about_ca_system_score_gemma":0.0011682087,"threshold_uncertainty_score":0.06631398},"labels":[],"label_agreement":null},{"id":"W2400376192","doi":"","title":"Unimodal rays of the generalized Pascal's triangle.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematics and Applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pascal (unit); Computer science; Programming language","score_opus":0.03155539885918823,"score_gpt":0.27658180119866616,"score_spread":0.24502640233947792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400376192","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15784787,0.0020851567,0.08801496,0.0025263478,0.0014802666,0.000068275884,0.00070769805,0.00046699098,0.74680245],"genre_scores_gemma":[0.84426004,0.0012621223,0.028000906,0.0009008165,0.0008695237,0.00006486228,0.0004799169,0.00030006721,0.1238617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995345,0.00010618223,0.000010280827,0.00008120253,0.00017467301,0.00009328188],"domain_scores_gemma":[0.9996288,0.00010540294,0.000040256247,0.000052991283,0.000096871525,0.00007565631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002553278,0.00042961823,0.0004532317,0.0011963927,0.001153909,0.0018720834,0.00071288744,0.00059550296,0.030141542],"category_scores_gemma":[0.0014771256,0.0002429642,0.0003493943,0.0007161993,0.0018185473,0.0020249411,0.0015235012,0.0026488109,0.0036531044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027821767,0.000005556431,0.000054558055,0.000022995828,0.000003241294,0.00006484542,0.00007371827,0.00020891495,0.000688143,0.98418194,0.0036705288,0.010997691],"study_design_scores_gemma":[0.000017433762,0.00001628381,0.00027998706,0.000016668744,0.0000052447986,0.0003201852,0.00015523168,0.0021839235,0.0009113081,0.9730638,0.023018787,0.000011237838],"about_ca_topic_score_codex":0.0012560519,"about_ca_topic_score_gemma":0.0012439443,"teacher_disagreement_score":0.030141542,"about_ca_system_score_codex":0.00066153,"about_ca_system_score_gemma":0.0003983887,"threshold_uncertainty_score":0.100833476},"labels":[],"label_agreement":null},{"id":"W2400380025","doi":"","title":"Harmonic index of dense graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Harmonic; Acoustics; Physics; Computer science; World Wide Web","score_opus":0.04523533579060618,"score_gpt":0.2955165771363827,"score_spread":0.2502812413457765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400380025","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53315306,0.0027559255,0.111318015,0.0024692873,0.00069343584,0.00007771131,0.0015172401,0.00032814898,0.3476872],"genre_scores_gemma":[0.9568369,0.0011343359,0.010348063,0.0002642581,0.0004926801,0.000058937585,0.0006968408,0.0001337287,0.030034294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971646,0.000045699857,0.000011095666,0.000054640568,0.00010667195,0.000065432316],"domain_scores_gemma":[0.99896526,0.00043173053,0.00015539126,0.00010778544,0.00015259557,0.00018723629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035377705,0.00034542358,0.000540466,0.0029863408,0.0009093228,0.0020822939,0.0008635737,0.00063398766,0.010311001],"category_scores_gemma":[0.0025947934,0.0002606955,0.00025663816,0.0015787835,0.0014531403,0.0032865645,0.0017716257,0.001225687,0.0012973828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025686559,0.000014220235,0.00041534635,0.000038161845,0.0000057617526,0.000033902346,0.00014121465,0.0005628685,0.0009841103,0.9828925,0.003318996,0.011567278],"study_design_scores_gemma":[0.000009962105,0.000011461272,0.00097250845,0.000017626748,0.000009123852,0.00015301399,0.00015020977,0.006576394,0.00066403236,0.98492426,0.0065028304,0.000008480505],"about_ca_topic_score_codex":0.0011378201,"about_ca_topic_score_gemma":0.0013309537,"teacher_disagreement_score":0.010311001,"about_ca_system_score_codex":0.0011266759,"about_ca_system_score_gemma":0.00030780907,"threshold_uncertainty_score":0.034493744},"labels":[],"label_agreement":null},{"id":"W2400381546","doi":"","title":"New Proofs For Whipple's Transformation And Watson's q-Whipple Transformation.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematics and Applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Transformation (genetics); Watson; Mathematical proof; Artificial intelligence; Computer science; Geometry","score_opus":0.05706672738006066,"score_gpt":0.28720589339132185,"score_spread":0.2301391660112612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400381546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018821362,0.005191662,0.5975556,0.013840284,0.0055969167,0.00019130165,0.0009912571,0.0023704348,0.35544127],"genre_scores_gemma":[0.5965044,0.006346223,0.21314049,0.008909171,0.0043221717,0.000650695,0.0017394206,0.003169854,0.16521761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980444,0.000594409,0.00012642935,0.00028081104,0.0007504144,0.00020356373],"domain_scores_gemma":[0.99484825,0.0028355047,0.00023983786,0.00079934363,0.0009843587,0.0002928165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028153425,0.0012347791,0.00074243004,0.0020192417,0.0027677207,0.0029954908,0.002186219,0.0019486451,0.030453118],"category_scores_gemma":[0.0123109,0.0007790316,0.0019399502,0.0022791624,0.0039755353,0.014205909,0.0057469625,0.006869654,0.006284018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025860581,0.000033747412,0.00008146085,0.00008600339,0.000011538828,0.000151936,0.00021476838,0.00018743852,0.00067341415,0.97050065,0.01552917,0.012504032],"study_design_scores_gemma":[0.000023318982,0.0000093377075,0.00011204507,0.00003091739,0.000014142693,0.00021462642,0.000068261594,0.0010064966,0.0010278428,0.9697823,0.027694944,0.000015649295],"about_ca_topic_score_codex":0.0012913506,"about_ca_topic_score_gemma":0.0014322973,"teacher_disagreement_score":0.030453118,"about_ca_system_score_codex":0.0018377396,"about_ca_system_score_gemma":0.0011775055,"threshold_uncertainty_score":0.10187584},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.011176706066020963,"score_gpt":0.23833828088776837,"score_spread":0.2271615748217474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400382429","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030182622,0.014255399,0.38759136,0.040694386,0.008231443,0.00013446223,0.0015577162,0.002046888,0.5153057],"genre_scores_gemma":[0.5169793,0.02596892,0.2616983,0.01704849,0.010894044,0.00042433222,0.0018384769,0.0020068171,0.16314135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998722,0.000365625,0.00005741908,0.00029399875,0.00038069853,0.00018018857],"domain_scores_gemma":[0.99547064,0.0028397813,0.00016156693,0.0008604006,0.00026575514,0.00040194739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017849291,0.0009482666,0.00095178495,0.0014741718,0.0025559987,0.0031506978,0.00182321,0.0016008553,0.017258719],"category_scores_gemma":[0.0058251545,0.00063161534,0.0010927358,0.0027711394,0.0043353187,0.0094128875,0.00474729,0.0072696917,0.0038157953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027995655,0.000020007934,0.00014817386,0.000092806484,0.0000070545134,0.00007543415,0.00013905157,0.0010426685,0.0004962249,0.956397,0.025031349,0.016522234],"study_design_scores_gemma":[0.0000050176063,0.000010162403,0.00013011075,0.000030566876,0.000006647572,0.000082476115,0.000051338116,0.0016505752,0.00029902408,0.947388,0.050335467,0.000010653062],"about_ca_topic_score_codex":0.0027243064,"about_ca_topic_score_gemma":0.004350436,"teacher_disagreement_score":0.017258719,"about_ca_system_score_codex":0.0020555358,"about_ca_system_score_gemma":0.0011637388,"threshold_uncertainty_score":0.057736218},"labels":[],"label_agreement":null},{"id":"W2400401589","doi":"","title":"On 4-cutwidth critical trees.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.016871697053575937,"score_gpt":0.26240274648922396,"score_spread":0.24553104943564802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400401589","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35608023,0.012057408,0.27409565,0.003778385,0.0014469146,0.00020618385,0.0012619124,0.0006478647,0.35042545],"genre_scores_gemma":[0.85960305,0.0072604087,0.0590617,0.0014761483,0.0007264408,0.00017729108,0.0013259582,0.00031843505,0.07005066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977964,0.000044923316,0.000010928731,0.000035620298,0.000059284474,0.000069584705],"domain_scores_gemma":[0.9991658,0.00041680963,0.00010222458,0.00007040085,0.000126383,0.000118432945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030795584,0.00052014505,0.00036544245,0.0017980635,0.0009114475,0.0012909146,0.0006423071,0.00068144087,0.012242693],"category_scores_gemma":[0.0020205365,0.00031753362,0.00030945655,0.0011547721,0.0008857808,0.0024366062,0.0011946401,0.0012592035,0.0016190043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000130057,0.000038191574,0.0005866298,0.00022854422,0.000022631511,0.00039075527,0.0002610702,0.007797514,0.0042925184,0.9252474,0.018282237,0.042722516],"study_design_scores_gemma":[0.00002276357,0.000027236738,0.00043507395,0.00009751553,0.000016512386,0.00041691685,0.00016317716,0.016126018,0.0014847557,0.9542636,0.026934097,0.000012336344],"about_ca_topic_score_codex":0.0011665795,"about_ca_topic_score_gemma":0.0030263742,"teacher_disagreement_score":0.012242693,"about_ca_system_score_codex":0.001109788,"about_ca_system_score_gemma":0.0004723393,"threshold_uncertainty_score":0.0409559},"labels":[],"label_agreement":null},{"id":"W2400437385","doi":"","title":"On the Vertex Geodomination Number of a Graph.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Graph","score_opus":0.020170330089331952,"score_gpt":0.2256931012069957,"score_spread":0.20552277111766376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400437385","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58909565,0.003912082,0.21476401,0.012275731,0.0009272043,0.0001245082,0.0026160486,0.00059364224,0.17569111],"genre_scores_gemma":[0.92873186,0.0016220903,0.046712816,0.0007102778,0.0006721871,0.00016283558,0.001109978,0.00022549668,0.02005249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988949,0.0003837226,0.000049504924,0.0002514818,0.00019870774,0.00022163414],"domain_scores_gemma":[0.9917966,0.0054443255,0.0007772841,0.0007471441,0.00041585902,0.0008187902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012932103,0.00066513446,0.00088168844,0.0028214802,0.002219979,0.0038265605,0.0015919048,0.0017695382,0.010402663],"category_scores_gemma":[0.00905849,0.0004844767,0.0005187933,0.0024482743,0.0030887667,0.008196716,0.002176145,0.002635266,0.001646056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020148215,0.000051192797,0.0020540971,0.00014354172,0.000017935092,0.00008241964,0.0002730565,0.0072015496,0.0012352476,0.956362,0.010770466,0.021606917],"study_design_scores_gemma":[0.00003197522,0.000028681847,0.001185098,0.000052058003,0.000017707383,0.00022075765,0.00026019596,0.022608643,0.0010160344,0.9658907,0.008663812,0.000024376257],"about_ca_topic_score_codex":0.0011105674,"about_ca_topic_score_gemma":0.0013838164,"teacher_disagreement_score":0.010402663,"about_ca_system_score_codex":0.0017845214,"about_ca_system_score_gemma":0.00069685566,"threshold_uncertainty_score":0.03480035},"labels":[],"label_agreement":null},{"id":"W2400441241","doi":"","title":"Landmarks in Binary Tree Derived Architectures.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Cardinality (data modeling); Set (abstract data type); Binary tree; Graph; Binary number; Tree (set theory); Discrete mathematics; Computer science; Arithmetic; Data mining","score_opus":0.018056713986490447,"score_gpt":0.21468584306130564,"score_spread":0.1966291290748152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400441241","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46654335,0.0010076618,0.48374602,0.000803637,0.0000898383,0.0001079711,0.0008182082,0.0005139038,0.046369422],"genre_scores_gemma":[0.81551015,0.00051972625,0.16839425,0.00014468934,0.000032744716,0.0001285997,0.00087558234,0.000056594683,0.014337655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996772,0.000079980025,0.00002228867,0.00007615702,0.00007629761,0.00006811694],"domain_scores_gemma":[0.9989322,0.00042115006,0.00026949696,0.00016509138,0.00011603517,0.00009605499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027072115,0.0002172855,0.0003066799,0.00069924654,0.0008982539,0.0012646731,0.0006407849,0.0007215075,0.004979694],"category_scores_gemma":[0.0022628533,0.00026629984,0.00026980333,0.00093497284,0.0007407255,0.0023727878,0.0012401054,0.0006189788,0.0008692171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031184728,0.00006592191,0.003169638,0.00027132418,0.000026136935,0.000320803,0.00046595105,0.07489915,0.010156984,0.8312722,0.0049094516,0.07413068],"study_design_scores_gemma":[0.00006523852,0.00023207055,0.0032679508,0.00011751525,0.000043753935,0.0009375985,0.00073987735,0.26472268,0.009262524,0.68156254,0.039008807,0.00003942245],"about_ca_topic_score_codex":0.0011897893,"about_ca_topic_score_gemma":0.002460087,"teacher_disagreement_score":0.004979694,"about_ca_system_score_codex":0.0009374334,"about_ca_system_score_gemma":0.00040735365,"threshold_uncertainty_score":0.016658783},"labels":[],"label_agreement":null},{"id":"W2400448798","doi":"","title":"The Laplacian spectral radius of graphs with given connectivity.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; Laplace operator; RADIUS; Mathematical analysis; Computer science; Physics; Eigenvalues and eigenvectors; Computer network; Quantum mechanics","score_opus":0.017640763127289433,"score_gpt":0.2621161787030781,"score_spread":0.24447541557578864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400448798","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69345975,0.004492761,0.15595892,0.0046615303,0.00046620012,0.00005767285,0.0014601942,0.0008143417,0.13862856],"genre_scores_gemma":[0.9839019,0.0011316095,0.008868499,0.00018535381,0.00027310645,0.000053130538,0.00035266427,0.00010088301,0.005132926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956924,0.00017045763,0.00001592835,0.00008524153,0.00009924128,0.000059827868],"domain_scores_gemma":[0.99726045,0.0016204261,0.00036240707,0.00018679025,0.0002606467,0.00030938923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051882595,0.00046042172,0.00046056684,0.0025561082,0.00067471334,0.0016774478,0.0008514743,0.0009986507,0.004796708],"category_scores_gemma":[0.006911538,0.00022928166,0.00022026313,0.0011603682,0.0015477254,0.0024545232,0.0011576931,0.0008254282,0.0009518004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015798959,0.000041954077,0.0015955836,0.00017808247,0.000034881836,0.00016897709,0.00039901724,0.014597826,0.0051575084,0.94250435,0.012790319,0.022373546],"study_design_scores_gemma":[0.000025486821,0.000030178155,0.0022291844,0.000054653916,0.000027359618,0.0005132177,0.00041311435,0.08118265,0.002151418,0.90607166,0.007273036,0.000028131495],"about_ca_topic_score_codex":0.0006820896,"about_ca_topic_score_gemma":0.0005750062,"teacher_disagreement_score":0.004796708,"about_ca_system_score_codex":0.00079692283,"about_ca_system_score_gemma":0.00021926052,"threshold_uncertainty_score":0.016046584},"labels":[],"label_agreement":null},{"id":"W2400464969","doi":"","title":"On the Crossing Number of the Cartesian Product of a 6-Vertex Graph with S n .","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Mathematics; Crossing number (knot theory); Vertex (graph theory); Combinatorics; Graph; Product (mathematics); Discrete mathematics; Geometry; Geography","score_opus":0.008078821611680484,"score_gpt":0.21956705919452438,"score_spread":0.2114882375828439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400464969","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82758707,0.00086628157,0.07860488,0.0007983265,0.00037224437,0.00004008144,0.00066519505,0.00034934023,0.09071657],"genre_scores_gemma":[0.96551615,0.00041080613,0.024104407,0.00010731859,0.00009427693,0.000038465096,0.0005006068,0.00015328205,0.009074579],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996158,0.00009755139,0.00002315701,0.0000874229,0.00009836826,0.000077818666],"domain_scores_gemma":[0.99797493,0.001003193,0.00035540288,0.00017556056,0.00018086401,0.00031014346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067675975,0.0003827344,0.00034306917,0.0020186738,0.000803317,0.0014476349,0.0006705907,0.00061201246,0.008877441],"category_scores_gemma":[0.0036924265,0.00024921258,0.0002998984,0.0010208631,0.0012957026,0.0019242998,0.000952288,0.0009536334,0.0009959713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047512408,0.00009373181,0.006226373,0.0001937242,0.000037348243,0.0004372451,0.0007267662,0.024488568,0.0080774445,0.8901398,0.013502769,0.05560102],"study_design_scores_gemma":[0.00004946754,0.00019440957,0.007825503,0.00013457115,0.000056706816,0.0010065451,0.0006241361,0.10428923,0.008236665,0.8572549,0.020263143,0.00006481892],"about_ca_topic_score_codex":0.0010631229,"about_ca_topic_score_gemma":0.0015268001,"teacher_disagreement_score":0.008877441,"about_ca_system_score_codex":0.00066433905,"about_ca_system_score_gemma":0.00036270448,"threshold_uncertainty_score":0.029697955},"labels":[],"label_agreement":null},{"id":"W2400468285","doi":"","title":"The Product Summation over all Ordered Partitions.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Summation by parts; Product (mathematics); Pure mathematics; Geometry","score_opus":0.013340868101993504,"score_gpt":0.25343239747405943,"score_spread":0.24009152937206593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400468285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03598896,0.010052481,0.4916319,0.0027156235,0.0056511676,0.00015274604,0.002503807,0.0014815029,0.44982183],"genre_scores_gemma":[0.46071848,0.010875018,0.27479315,0.0027763855,0.005557018,0.00054716883,0.004261469,0.002895917,0.23757541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973361,0.00059416844,0.0002774825,0.00060063414,0.0008965064,0.000295043],"domain_scores_gemma":[0.9980002,0.00044683088,0.00019381914,0.00053345656,0.0006113532,0.00021432985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020068295,0.0013170564,0.0013434406,0.0036259552,0.0030330212,0.0052394876,0.0015382782,0.00070087746,0.017991643],"category_scores_gemma":[0.005196502,0.00062840024,0.0012073513,0.0034047572,0.0027910967,0.01265051,0.003489622,0.0025840017,0.00861284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003456625,0.000015447149,0.00018162114,0.00015250442,0.00003285513,0.0000984836,0.0001934496,0.00020178464,0.00096566323,0.96526474,0.011155106,0.021703804],"study_design_scores_gemma":[0.0000058724722,0.000017470144,0.0002199694,0.00006111383,0.000025214002,0.00036135066,0.00007004751,0.0015683749,0.0012798927,0.95377713,0.042593524,0.00002002637],"about_ca_topic_score_codex":0.00076132943,"about_ca_topic_score_gemma":0.0018036256,"teacher_disagreement_score":0.017991643,"about_ca_system_score_codex":0.0010611684,"about_ca_system_score_gemma":0.0013678453,"threshold_uncertainty_score":0.060187995},"labels":[],"label_agreement":null},{"id":"W2400486338","doi":"","title":"Applications Of Liu's q-Series Expansion Formula.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Series (stratigraphy); Applied mathematics; Calculus (dental); Medicine; Geology; Orthodontics","score_opus":0.040031061165935,"score_gpt":0.29479073225386865,"score_spread":0.2547596710879336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400486338","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024781615,0.015118747,0.24975073,0.009520862,0.005115757,0.000043242977,0.00028993902,0.0005835871,0.6947955],"genre_scores_gemma":[0.66874456,0.012199991,0.12240093,0.0033622445,0.0039104545,0.00015971712,0.0003172827,0.00050958694,0.18839522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967825,0.000094123825,0.000014959697,0.00004228477,0.00013299094,0.000037398084],"domain_scores_gemma":[0.9995196,0.0001910071,0.000037809004,0.000061233564,0.00014083335,0.000049607082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007856596,0.00063645863,0.0005667844,0.0021077832,0.00093111995,0.0012980674,0.00085110444,0.0007341953,0.01252112],"category_scores_gemma":[0.0030740616,0.0002053381,0.0006023065,0.0014093723,0.0015729645,0.003043079,0.0017457561,0.0020396672,0.0032200466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000094057705,0.000011166519,0.000075487915,0.000040366907,0.0000047159165,0.00006919436,0.00009607766,0.00028162415,0.00037878496,0.97801995,0.0061673317,0.014845845],"study_design_scores_gemma":[0.000009243316,0.000008924221,0.0001619253,0.000026790021,0.000005907034,0.00015627532,0.000037669426,0.0037855508,0.0003893127,0.96713734,0.028272469,0.000008644952],"about_ca_topic_score_codex":0.0009173034,"about_ca_topic_score_gemma":0.001133799,"teacher_disagreement_score":0.01252112,"about_ca_system_score_codex":0.0010844567,"about_ca_system_score_gemma":0.00044854643,"threshold_uncertainty_score":0.041887283},"labels":[],"label_agreement":null},{"id":"W2400495332","doi":"","title":"On the Packing Number of Generalized Petersen Graphs P(n, 2).","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.02485309128922991,"score_gpt":0.29933999395994476,"score_spread":0.27448690267071485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400495332","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8110368,0.0031632034,0.034541413,0.0038376339,0.0006886439,0.000051406572,0.0010846161,0.00033065263,0.14526562],"genre_scores_gemma":[0.9821792,0.0012227515,0.0073933653,0.0002433584,0.0003624415,0.00007274682,0.0005880745,0.00009427506,0.007843709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992962,0.0002011124,0.000028186867,0.0001451681,0.00017171536,0.00015762387],"domain_scores_gemma":[0.9960849,0.002552041,0.00058363425,0.00022296445,0.000159098,0.00039729956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083123543,0.0006633296,0.0007568629,0.003056702,0.0015375745,0.0023865814,0.0011966947,0.001427952,0.010928072],"category_scores_gemma":[0.006930229,0.0004592311,0.00033637782,0.0023581558,0.0021955892,0.0041120085,0.0015042165,0.0016084043,0.0011212992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068602804,0.00014896467,0.0052844784,0.00049890444,0.00008699861,0.00044777838,0.000585365,0.046250127,0.0051211496,0.84850174,0.029843405,0.06254502],"study_design_scores_gemma":[0.000057923975,0.00010022388,0.0050851936,0.00011819803,0.00004595704,0.00058503204,0.0004013111,0.080195874,0.0031800487,0.9000271,0.01015139,0.000051779414],"about_ca_topic_score_codex":0.0009771037,"about_ca_topic_score_gemma":0.0014546218,"teacher_disagreement_score":0.010928072,"about_ca_system_score_codex":0.0010003877,"about_ca_system_score_gemma":0.00043403372,"threshold_uncertainty_score":0.036558032},"labels":[],"label_agreement":null},{"id":"W2400561427","doi":"","title":"A Special Class of Anti-automorphisms of Directed Triple Systems.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Automorphism; Class (philosophy); Triple system; Pure mathematics; Arithmetic; Algebra over a field; Computer science; Artificial intelligence","score_opus":0.02053830807492117,"score_gpt":0.27954078088296563,"score_spread":0.25900247280804445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400561427","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5361109,0.0013197811,0.15596111,0.0010752664,0.0010399059,0.00012804822,0.0010380091,0.00082752714,0.30249947],"genre_scores_gemma":[0.9709255,0.00035886728,0.009098494,0.00022997554,0.00023226252,0.00005809338,0.0005413548,0.000103645245,0.018451802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939275,0.000097950935,0.000041369796,0.00018955192,0.00014319188,0.00013516312],"domain_scores_gemma":[0.9987178,0.00032353515,0.00021367487,0.00027979718,0.00021564134,0.00024956884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040370855,0.0003238666,0.00040497686,0.0012701723,0.0016828384,0.0023863304,0.00041639345,0.00090303237,0.0074319704],"category_scores_gemma":[0.0017569521,0.00032697618,0.0007135546,0.00068175787,0.0017528207,0.0026509936,0.0015039408,0.001297691,0.0011172082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028608922,0.000015657271,0.0006203408,0.000027362448,0.000008229521,0.00019887125,0.00019976219,0.00019228793,0.0013830282,0.99040294,0.0016901479,0.0052326866],"study_design_scores_gemma":[0.000020197069,0.0000290174,0.0006538081,0.00002524429,0.000015724063,0.0008732739,0.00022062741,0.0027803953,0.0016655904,0.9746128,0.019086502,0.000016958775],"about_ca_topic_score_codex":0.000711024,"about_ca_topic_score_gemma":0.0006708433,"teacher_disagreement_score":0.0074319704,"about_ca_system_score_codex":0.0006880042,"about_ca_system_score_gemma":0.00044097772,"threshold_uncertainty_score":0.024862468},"labels":[],"label_agreement":null},{"id":"W2400588332","doi":"","title":"Cycle-Partitions with Specified Vertices and Edges.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.006877211193968934,"score_gpt":0.18494699605143108,"score_spread":0.17806978485746214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400588332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14110792,0.0009760344,0.55886555,0.0008910818,0.0008252075,0.00095946697,0.005439741,0.0018520994,0.28908294],"genre_scores_gemma":[0.7076963,0.00069789746,0.19109835,0.00064883503,0.00013715398,0.00095393637,0.0052769464,0.0006753483,0.092815176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992086,0.00018621245,0.000053823424,0.0001802399,0.00016980678,0.00020123788],"domain_scores_gemma":[0.99844235,0.00045201648,0.00012509042,0.00050654716,0.00031556873,0.00015847755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047129046,0.0006517733,0.00055071164,0.0015533528,0.0019439268,0.002483396,0.001132186,0.00115511,0.021791833],"category_scores_gemma":[0.002605628,0.00041126646,0.0005773979,0.0013947809,0.0011645327,0.0026375053,0.0014522618,0.0010266276,0.0046682367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029296763,0.000088890185,0.0006197158,0.00018371933,0.00003555853,0.00033506515,0.0003029505,0.0051312074,0.008680522,0.93980646,0.013511778,0.031011201],"study_design_scores_gemma":[0.000092215174,0.00009262184,0.0007282751,0.00016331841,0.000062766776,0.00075927237,0.00056677294,0.028967533,0.016354883,0.8443038,0.10784984,0.00005869256],"about_ca_topic_score_codex":0.0014699901,"about_ca_topic_score_gemma":0.0033270593,"teacher_disagreement_score":0.021791833,"about_ca_system_score_codex":0.0009925966,"about_ca_system_score_gemma":0.0010198837,"threshold_uncertainty_score":0.07290101},"labels":[],"label_agreement":null},{"id":"W2400589288","doi":"","title":"On 2-domination and independence domination numbers of graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Independence (probability theory); Independence number; Domination analysis; Combinatorics; Statistics; Graph; Vertex (graph theory)","score_opus":0.018587035095333476,"score_gpt":0.2655439694014125,"score_spread":0.24695693430607904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400589288","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.486238,0.00669062,0.11905335,0.004877366,0.00064199045,0.00012342296,0.0017710801,0.0003654036,0.38023883],"genre_scores_gemma":[0.9639315,0.002067508,0.015577128,0.00048532788,0.00071498496,0.00015003723,0.0006361565,0.000099220975,0.016338184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846905,0.0004446561,0.00008501578,0.00025880433,0.00044240814,0.00030005857],"domain_scores_gemma":[0.987735,0.009269782,0.0009585911,0.00054769457,0.0006664194,0.0008224928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017199044,0.0007188654,0.0008509058,0.0047768313,0.0018427828,0.003253207,0.0013112437,0.001056701,0.012039523],"category_scores_gemma":[0.009667814,0.0005209998,0.00067118794,0.003534052,0.004097119,0.008677281,0.0021184655,0.0032625038,0.0011837651],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012876092,0.000047088208,0.001532096,0.00011333479,0.00002275615,0.00008552406,0.00043082333,0.0028045294,0.0008939245,0.9718997,0.004715108,0.017326454],"study_design_scores_gemma":[0.00001811329,0.000016497168,0.0013962024,0.000031946245,0.000013551099,0.0001739633,0.00010799948,0.0056364383,0.00045223394,0.9879885,0.00414813,0.000016454118],"about_ca_topic_score_codex":0.0012346068,"about_ca_topic_score_gemma":0.0015688752,"teacher_disagreement_score":0.012039523,"about_ca_system_score_codex":0.0017959448,"about_ca_system_score_gemma":0.0006069885,"threshold_uncertainty_score":0.04027617},"labels":[],"label_agreement":null},{"id":"W2400606064","doi":"","title":"Generalized Composition Operators From μ-Bloch Spaces Into Mixed Norm Spaces.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Holomorphic and Operator Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Norm (philosophy); Pure mathematics; Composition (language); Operator norm; Operator theory; Epistemology; Linguistics","score_opus":0.033414442046454974,"score_gpt":0.26443469986644874,"score_spread":0.23102025781999377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400606064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26124403,0.0027857453,0.4827197,0.0021503058,0.0010583778,0.00009921099,0.00037090914,0.00076106127,0.24881065],"genre_scores_gemma":[0.85238725,0.0013048438,0.07868025,0.0006844816,0.00050017436,0.00012462532,0.0002367541,0.0003133757,0.06576824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993467,0.00018976131,0.00003796008,0.00009624727,0.00023614195,0.000093144896],"domain_scores_gemma":[0.9992581,0.00017845086,0.00009962055,0.00010478347,0.00018120695,0.00017785672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009923143,0.000603769,0.00040570876,0.0015454332,0.0010572523,0.0022641928,0.000637419,0.00062298676,0.0073985276],"category_scores_gemma":[0.0019950657,0.00029709443,0.00055344,0.0007841894,0.0020320911,0.005717354,0.0028189833,0.0016728329,0.0011295016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011225953,0.0000062215927,0.00004891315,0.000014191733,0.0000035049502,0.000028787537,0.00007642593,0.00011492843,0.0007363393,0.99514186,0.00048748901,0.0033301585],"study_design_scores_gemma":[0.00000973405,0.000018067944,0.00014954695,0.000013534925,0.0000075164558,0.00015484524,0.00014449278,0.0037199738,0.0011514769,0.9879467,0.0066746264,0.000009500069],"about_ca_topic_score_codex":0.00043728235,"about_ca_topic_score_gemma":0.0005407133,"teacher_disagreement_score":0.0073985276,"about_ca_system_score_codex":0.00072217884,"about_ca_system_score_gemma":0.00041505552,"threshold_uncertainty_score":0.02475053},"labels":[],"label_agreement":null},{"id":"W2400630495","doi":"","title":"Ordering graphs with maximum degree 3 by their indices.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Combinatorics; Statistics; Discrete mathematics; Physics","score_opus":0.02415026922201394,"score_gpt":0.2552164991330755,"score_spread":0.23106622991106154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400630495","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27878153,0.002254801,0.38113984,0.0023600461,0.0013511947,0.00041000152,0.0044829864,0.0021726945,0.32704693],"genre_scores_gemma":[0.62424946,0.0020796012,0.29642266,0.0011738216,0.00037413798,0.0003126863,0.0034205357,0.0008751399,0.071091905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919206,0.00021502092,0.000059965205,0.0001388829,0.00018717168,0.00020697479],"domain_scores_gemma":[0.9976591,0.0007262076,0.0003859238,0.00057170686,0.00035526158,0.00030184895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064721756,0.00071107823,0.0006854221,0.0017902682,0.0017854697,0.0019920971,0.0010021175,0.0011115045,0.011285074],"category_scores_gemma":[0.0034266133,0.00048721652,0.000831382,0.0020368795,0.00151789,0.0031786738,0.0017888279,0.002359921,0.004372727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003599998,0.00013408162,0.0015683229,0.00018386691,0.000039239025,0.00038971278,0.0009645042,0.0027002997,0.02226797,0.8813405,0.017345123,0.07270642],"study_design_scores_gemma":[0.000044425637,0.00006423831,0.0010763383,0.000072661496,0.000036262365,0.00049303577,0.0003957619,0.00531065,0.0075305053,0.9360045,0.04893037,0.000041200354],"about_ca_topic_score_codex":0.0015615039,"about_ca_topic_score_gemma":0.0040218746,"teacher_disagreement_score":0.011285074,"about_ca_system_score_codex":0.00089930714,"about_ca_system_score_gemma":0.0010320486,"threshold_uncertainty_score":0.03775233},"labels":[],"label_agreement":null},{"id":"W2400632756","doi":"","title":"Acyclic edge coloring of triangle-free toroidal graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Toroid; Combinatorics; Enhanced Data Rates for GSM Evolution; Edge coloring; Graph; Computer science; Physics; Line graph; Artificial intelligence; Plasma","score_opus":0.03914921778049262,"score_gpt":0.27086943091467974,"score_spread":0.23172021313418711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400632756","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54251546,0.0012208495,0.21123189,0.0010816068,0.00068091624,0.00016253877,0.00227757,0.001219399,0.23960978],"genre_scores_gemma":[0.9301279,0.0006574025,0.03640647,0.00024257967,0.00007941704,0.00006443046,0.0015708117,0.00017024823,0.030680783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975437,0.000058934496,0.000010051743,0.00004403197,0.000041804928,0.000090862646],"domain_scores_gemma":[0.9990356,0.0003524498,0.00011958028,0.00015691064,0.00015856023,0.00017695942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018463064,0.0002802254,0.0002566443,0.00061016646,0.0011612611,0.0010431813,0.0005781372,0.0003908102,0.011177925],"category_scores_gemma":[0.0013772465,0.00021598567,0.00022786355,0.0009538701,0.00062740926,0.0011142073,0.000643674,0.00074412784,0.0013858698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037486412,0.00007787098,0.0016394088,0.0002363154,0.000021758284,0.00041524594,0.00064178254,0.013054536,0.013643147,0.8956915,0.020980204,0.053223457],"study_design_scores_gemma":[0.000051159317,0.00006494053,0.0021015925,0.00006743429,0.000042224496,0.0005280728,0.0007445771,0.045125097,0.0081149,0.88919264,0.05392811,0.00003911266],"about_ca_topic_score_codex":0.004570843,"about_ca_topic_score_gemma":0.008404644,"teacher_disagreement_score":0.011177925,"about_ca_system_score_codex":0.00068615476,"about_ca_system_score_gemma":0.00047547117,"threshold_uncertainty_score":0.037393868},"labels":[],"label_agreement":null},{"id":"W2400633270","doi":"","title":"Decomposition of complete graphs into paths of length three and triangles","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Decomposition; Combinatorics; Chemistry","score_opus":0.01051958680036838,"score_gpt":0.21637391656786814,"score_spread":0.20585432976749976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400633270","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21174176,0.00043727693,0.7128657,0.0005597892,0.00009147074,0.00016558316,0.0010751464,0.0004208202,0.07264242],"genre_scores_gemma":[0.6414639,0.00069383974,0.31283548,0.00029147128,0.00007674256,0.00019196869,0.002389965,0.00031933494,0.04173723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973816,0.00005449386,0.000014529734,0.000060938335,0.000073750154,0.000058137724],"domain_scores_gemma":[0.99902797,0.00028713574,0.00013810875,0.00020573572,0.00020698895,0.00013405569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026389846,0.00049233815,0.00035352353,0.0011317644,0.0007343139,0.0015352739,0.00071653246,0.00056726864,0.009403807],"category_scores_gemma":[0.0012163313,0.00037758498,0.00066390703,0.0009367013,0.00081328064,0.0018785094,0.00085979106,0.0010822017,0.0010424486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017283077,0.00007592123,0.0007868773,0.00015982983,0.000025771767,0.0001985095,0.00047649938,0.018385768,0.008908066,0.91427356,0.0051563648,0.051380012],"study_design_scores_gemma":[0.00003057509,0.000041666553,0.00089566415,0.000056758505,0.000027028676,0.00028020662,0.00032013265,0.052353993,0.003272032,0.92500395,0.01770188,0.000016119347],"about_ca_topic_score_codex":0.0015825221,"about_ca_topic_score_gemma":0.0024152454,"teacher_disagreement_score":0.009403807,"about_ca_system_score_codex":0.0006220283,"about_ca_system_score_gemma":0.0005324637,"threshold_uncertainty_score":0.031458855},"labels":[],"label_agreement":null},{"id":"W2400665916","doi":"","title":"Divisor orientations of powers of paths and powers of cycles.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematics and Applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Divisor (algebraic geometry); Arithmetic; Pure mathematics","score_opus":0.017599414052437916,"score_gpt":0.29680154568754447,"score_spread":0.27920213163510654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400665916","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32445335,0.0040281233,0.1062909,0.0018501185,0.0013588889,0.000118081625,0.0010341204,0.00037883036,0.56048757],"genre_scores_gemma":[0.92161196,0.0023243802,0.018193206,0.00032819723,0.0008625193,0.00007149763,0.000717689,0.00026367442,0.055626757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932885,0.00013316105,0.000042025604,0.00015462178,0.00017501554,0.00016639671],"domain_scores_gemma":[0.9989371,0.00029124986,0.00018260555,0.000133175,0.00016207142,0.00029393585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006204821,0.00067454175,0.0005589283,0.003060344,0.0016021491,0.003629071,0.0005865471,0.0006215812,0.0166859],"category_scores_gemma":[0.002702456,0.00054459233,0.0005818867,0.0014796997,0.003663296,0.005467576,0.0027081268,0.002129523,0.0028222103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032030086,0.000009545612,0.00034294222,0.000024962525,0.0000040194595,0.000088954046,0.0002597211,0.00015833385,0.0004977344,0.98840827,0.0017630801,0.0084104035],"study_design_scores_gemma":[0.000017285603,0.000015630634,0.0005606117,0.00003136473,0.000010619595,0.00029670884,0.00034404636,0.0008305513,0.00062964216,0.97838897,0.018862871,0.000011637478],"about_ca_topic_score_codex":0.0011557918,"about_ca_topic_score_gemma":0.0013508584,"teacher_disagreement_score":0.0166859,"about_ca_system_score_codex":0.0011941087,"about_ca_system_score_gemma":0.00048361573,"threshold_uncertainty_score":0.05581993},"labels":[],"label_agreement":null},{"id":"W2400670425","doi":"","title":"Antidirected Hamilton cycles in the Cartesian product of directed cycles.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Differential Equations and Dynamical Systems","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Mathematics; Cartesian coordinate system; Product (mathematics); Pure mathematics; Combinatorics; Geometry","score_opus":0.020251126468400157,"score_gpt":0.28154749385674405,"score_spread":0.2612963673883439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400670425","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5763816,0.0031552964,0.23040614,0.00088720885,0.00044544472,0.0001264603,0.00057416427,0.0002799808,0.18774366],"genre_scores_gemma":[0.93240714,0.0010833594,0.027896179,0.0003181649,0.00013702999,0.000094409814,0.00031809602,0.000079394806,0.03766612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966633,0.00008966557,0.000023718962,0.000072451665,0.000092017704,0.000055805387],"domain_scores_gemma":[0.99928325,0.0002083376,0.00012994968,0.000060436767,0.0001791403,0.00013888298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032702077,0.000325537,0.00032606564,0.0012707852,0.0007428062,0.0016343015,0.00051146385,0.00048047557,0.005233705],"category_scores_gemma":[0.0012542396,0.00031862225,0.00032922142,0.0007432895,0.0012051258,0.0018073012,0.0011604002,0.00068601646,0.0007009866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010425825,0.000005685585,0.00015345175,0.00001696027,0.00000475197,0.0000761963,0.000115694005,0.0004480063,0.00050631136,0.99445856,0.0005984896,0.0036054614],"study_design_scores_gemma":[0.00001526515,0.000015705411,0.00022498089,0.000015045149,0.000008123257,0.00017565499,0.0000986869,0.004845374,0.00053567026,0.98439425,0.00966126,0.00000990016],"about_ca_topic_score_codex":0.0013982141,"about_ca_topic_score_gemma":0.0022749992,"teacher_disagreement_score":0.005233705,"about_ca_system_score_codex":0.00069376046,"about_ca_system_score_gemma":0.00048551572,"threshold_uncertainty_score":0.017508507},"labels":[],"label_agreement":null},{"id":"W2400670486","doi":"","title":"Minimal Forbidden Subgraphs For The Klein Bottle With Low Connectivity.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Klein bottle; Bottle; Mathematics; Combinatorics; History; Geometry; Archaeology","score_opus":0.017679052541139856,"score_gpt":0.24172087463160702,"score_spread":0.22404182209046716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400670486","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70649564,0.0019141575,0.16502927,0.0033264926,0.00025001093,0.00016293241,0.0019930406,0.0006900463,0.12013835],"genre_scores_gemma":[0.9538947,0.0006123534,0.027321516,0.00035301253,0.00010937497,0.00024054614,0.001047275,0.00010857764,0.016312582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959356,0.00010773726,0.000029185387,0.00007932949,0.0001101174,0.000080101956],"domain_scores_gemma":[0.9985812,0.0008000469,0.0001880338,0.0001329763,0.00012958102,0.00016806702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029649228,0.00039082326,0.0004992699,0.0016221993,0.0012850576,0.0024975487,0.0012520392,0.0013186284,0.007134867],"category_scores_gemma":[0.0025794392,0.0004334019,0.0007501978,0.0009143666,0.0013124701,0.0022290354,0.0014578972,0.0011169013,0.00082228414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055840694,0.000022934113,0.0005066787,0.000095029805,0.000014853967,0.00014774941,0.00017266063,0.0031752414,0.0024817898,0.98328155,0.003481983,0.0065636886],"study_design_scores_gemma":[0.000022081886,0.000011026774,0.00038073875,0.000022813801,0.00001831269,0.00020227036,0.00009238382,0.014220088,0.0011219017,0.97977006,0.004123933,0.000014440998],"about_ca_topic_score_codex":0.0017644556,"about_ca_topic_score_gemma":0.0025002847,"teacher_disagreement_score":0.007134867,"about_ca_system_score_codex":0.001283369,"about_ca_system_score_gemma":0.00058731314,"threshold_uncertainty_score":0.023868442},"labels":[],"label_agreement":null},{"id":"W2400695370","doi":"","title":"Some α-graphs and odd graceful graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.018973409512979718,"score_gpt":0.21362635603377095,"score_spread":0.19465294652079124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400695370","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6203416,0.002053903,0.13201548,0.0058747963,0.00036636833,0.00009899462,0.0023259479,0.0008982058,0.2360248],"genre_scores_gemma":[0.9397412,0.00092368404,0.02818252,0.00076026196,0.00019027406,0.00006930206,0.0010269696,0.00015368078,0.02895217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995029,0.00011769407,0.000025472407,0.0001317092,0.000087083776,0.00013507842],"domain_scores_gemma":[0.9978161,0.0010102178,0.00036459242,0.00033408834,0.00013114179,0.00034382765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005253041,0.00052915,0.00041358356,0.0010255118,0.0017118974,0.0025123057,0.0008408481,0.0007220233,0.008678447],"category_scores_gemma":[0.002405661,0.00040428663,0.00059732224,0.001180856,0.0020284862,0.0035220543,0.0015763855,0.0016691929,0.0009953987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000658148,0.000021307458,0.00066270324,0.0000565346,0.000010291779,0.00011106835,0.00018062042,0.0014753568,0.0012158897,0.98374766,0.0048795985,0.0075730924],"study_design_scores_gemma":[0.000013337861,0.000007811711,0.0003791978,0.000014843276,0.000009339956,0.00012309142,0.00014089089,0.0029761193,0.00073357194,0.9861826,0.009410892,0.000008388307],"about_ca_topic_score_codex":0.0017047346,"about_ca_topic_score_gemma":0.0023845942,"teacher_disagreement_score":0.008678447,"about_ca_system_score_codex":0.001348282,"about_ca_system_score_gemma":0.0005135723,"threshold_uncertainty_score":0.02903229},"labels":[],"label_agreement":null},{"id":"W2400697196","doi":"","title":"Equivalence of SDVFA of order (s, t) with DFA, VDFA, NFA and e-NFA.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Equivalence (formal languages); Pure mathematics","score_opus":0.006513538967334668,"score_gpt":0.21038322569490495,"score_spread":0.20386968672757028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400697196","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23745404,0.0012583724,0.33745372,0.0023047237,0.0012984022,0.00031562385,0.0047053862,0.0030272235,0.4121825],"genre_scores_gemma":[0.92260987,0.00031786883,0.03468276,0.0005889211,0.00027226645,0.00013262893,0.0039918055,0.00037505894,0.0370288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99768674,0.0004189975,0.0002749525,0.0005852143,0.00051727763,0.00051684835],"domain_scores_gemma":[0.99541,0.0015348472,0.00030317824,0.0010701267,0.001167522,0.0005142835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013547253,0.00035400293,0.0005681994,0.0014125656,0.0024934262,0.0041955546,0.0010150762,0.0011525194,0.021416765],"category_scores_gemma":[0.0053301323,0.00043561336,0.001960006,0.0009377009,0.0029222216,0.006651936,0.0028679876,0.0027981303,0.002649746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000121675585,0.0000718129,0.0011881114,0.0000400393,0.000023821502,0.00018187275,0.00040840666,0.0005638189,0.0010413465,0.9796566,0.0034214505,0.013281083],"study_design_scores_gemma":[0.000044634573,0.00004265422,0.0010114801,0.000028623093,0.000027191572,0.00037192236,0.00026980287,0.0023157615,0.0017843565,0.97171956,0.022362232,0.00002178978],"about_ca_topic_score_codex":0.0062380475,"about_ca_topic_score_gemma":0.004662781,"teacher_disagreement_score":0.021416765,"about_ca_system_score_codex":0.0019730642,"about_ca_system_score_gemma":0.0016877933,"threshold_uncertainty_score":0.071646154},"labels":[],"label_agreement":null},{"id":"W2400697410","doi":"","title":"On graph labeling problems and regular decompositions of complete graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics","score_opus":0.0144864742018439,"score_gpt":0.22476370374626803,"score_spread":0.21027722954442413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400697410","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15847172,0.015910622,0.59010285,0.020503044,0.0011880618,0.00031883878,0.00298356,0.00092770613,0.2095935],"genre_scores_gemma":[0.6668088,0.014884056,0.24705146,0.003627112,0.0029864875,0.00069782947,0.006568813,0.00077449,0.056600943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99795014,0.00084729487,0.00009669437,0.00041470642,0.00035986362,0.00033129338],"domain_scores_gemma":[0.9884643,0.00861097,0.00069495913,0.0009721761,0.00047852367,0.0007791179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025996692,0.001261467,0.0015742322,0.0025054954,0.0024518066,0.0049083466,0.002333184,0.00251413,0.011560939],"category_scores_gemma":[0.01376065,0.0010730855,0.0013837643,0.004394614,0.0046905205,0.012907744,0.003537081,0.0052527087,0.0017310953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006781887,0.000092870134,0.0005519641,0.00020770711,0.000032204116,0.00007284428,0.00025545023,0.0060342457,0.00040326215,0.9511948,0.0201303,0.020956555],"study_design_scores_gemma":[0.000015532178,0.000008934353,0.00018601348,0.000042113305,0.000010197234,0.00007520005,0.00015607703,0.0076432046,0.00014883235,0.98587275,0.0058325185,0.000008589569],"about_ca_topic_score_codex":0.0023866154,"about_ca_topic_score_gemma":0.0029321958,"teacher_disagreement_score":0.011560939,"about_ca_system_score_codex":0.0026023982,"about_ca_system_score_gemma":0.0011370195,"threshold_uncertainty_score":0.03867525},"labels":[],"label_agreement":null},{"id":"W2400713611","doi":"","title":"On a Stevic integral-type operator from generally weighted Bloch spaces to Bloch-type spaces on the unit ball.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Holomorphic and Operator Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Unit sphere; Type (biology); Bloch space; Operator (biology); Bloch sphere; Mathematical analysis; Bloch wave; Pure mathematics; Compact space; Physics; Quantum mechanics","score_opus":0.029848584152867563,"score_gpt":0.2817868771594825,"score_spread":0.2519382930066149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400713611","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40201303,0.0041633053,0.34112895,0.0047233263,0.0014861238,0.00010319552,0.00043332146,0.00039544114,0.24555331],"genre_scores_gemma":[0.89595014,0.002518592,0.041066132,0.0010894526,0.0009310477,0.00008419127,0.00027146062,0.00022970026,0.05785939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950397,0.00014808339,0.000020275962,0.00007246077,0.00015876742,0.000096467265],"domain_scores_gemma":[0.99898297,0.00027953993,0.00013282533,0.000081947604,0.00022659387,0.00029607772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095759454,0.00079317944,0.0007253236,0.002663265,0.0016614256,0.0020682495,0.0009359688,0.0016165999,0.007220595],"category_scores_gemma":[0.0030187082,0.0003445489,0.00068545475,0.0014786898,0.0031234894,0.0052621774,0.0029710187,0.002703519,0.0009551425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010987361,0.000009462343,0.00006544147,0.000021185582,0.0000042922375,0.00004861124,0.00011464324,0.00027054618,0.0007852201,0.9953827,0.0007588459,0.0025279417],"study_design_scores_gemma":[0.0000069070124,0.000019817262,0.00021961717,0.00001718871,0.000004930992,0.00017265015,0.00008947699,0.003790637,0.00031360844,0.99306184,0.0022930142,0.000010329422],"about_ca_topic_score_codex":0.0012344957,"about_ca_topic_score_gemma":0.001291361,"teacher_disagreement_score":0.007220595,"about_ca_system_score_codex":0.0012982881,"about_ca_system_score_gemma":0.0006255371,"threshold_uncertainty_score":0.024155319},"labels":[],"label_agreement":null},{"id":"W2400719621","doi":"","title":"Lattices generated by orbits of flats under finite affine-sympletic groups.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Affine transformation; Pure mathematics","score_opus":0.062027322335144706,"score_gpt":0.32114666968586747,"score_spread":0.2591193473507228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400719621","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73369443,0.00094502146,0.06960335,0.0013574699,0.00042386074,0.00009476273,0.0012215686,0.00058472535,0.19207488],"genre_scores_gemma":[0.9751854,0.00020917786,0.0060940245,0.00012111124,0.00020478466,0.000030022911,0.0006047647,0.00006228164,0.017488435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991359,0.00016890875,0.00004573408,0.00012816659,0.0002881079,0.00023317563],"domain_scores_gemma":[0.9988833,0.00028451515,0.00021999511,0.00012941853,0.00016034991,0.00032229614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005955793,0.00048464138,0.00045180132,0.0017020847,0.0018070034,0.0027460482,0.00070518884,0.00045867564,0.009951201],"category_scores_gemma":[0.0012316926,0.0002932607,0.00077411823,0.00072380697,0.0023231118,0.0025456704,0.0019542454,0.0013087989,0.0013092702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015945952,0.000040335064,0.00076043024,0.000041594965,0.000016358095,0.0002452712,0.000400245,0.00067231397,0.0023457292,0.9881486,0.0014325827,0.0057370625],"study_design_scores_gemma":[0.00008312135,0.00008200423,0.001581086,0.00003119635,0.000025485915,0.00043944866,0.0006531738,0.004911452,0.00432913,0.9786724,0.009159329,0.000032114513],"about_ca_topic_score_codex":0.0019279463,"about_ca_topic_score_gemma":0.0018454328,"teacher_disagreement_score":0.009951201,"about_ca_system_score_codex":0.0014531327,"about_ca_system_score_gemma":0.0006633524,"threshold_uncertainty_score":0.03329009},"labels":[],"label_agreement":null},{"id":"W2400732125","doi":"","title":"Hosoya polynomials of the capped zig-zag nanotubes","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Supramolecular Self-Assembly in Materials","field":"Materials Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Zigzag; Mathematics; Combinatorics; Geometry","score_opus":0.011140307407482501,"score_gpt":0.23991892042619184,"score_spread":0.22877861301870933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400732125","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8454185,0.0004599036,0.054155454,0.0009392355,0.00064341835,0.000079986814,0.0005302504,0.00019456037,0.097578645],"genre_scores_gemma":[0.9614152,0.00032105963,0.0072645056,0.00018563207,0.00024385359,0.000049181792,0.00026828065,0.000073592724,0.030178621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99979013,0.00003674691,0.0000071761483,0.000034434575,0.000049019505,0.000082604885],"domain_scores_gemma":[0.99970454,0.0000559386,0.00006494929,0.000031096773,0.000066084234,0.00007731411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022003184,0.00051556516,0.00037775206,0.0012746061,0.0007961577,0.0006989271,0.00056444714,0.0007363404,0.008258372],"category_scores_gemma":[0.00069300947,0.00019859431,0.00043166976,0.0006393596,0.000951848,0.0009106789,0.00062804075,0.0010486641,0.00077099376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011892819,0.000034829176,0.00038558614,0.000067386754,0.000010914936,0.00021544706,0.00019869125,0.0035860825,0.011222562,0.9690461,0.0021497554,0.012963669],"study_design_scores_gemma":[0.000049339593,0.0001238858,0.0030844598,0.000037179034,0.000025414465,0.00034353143,0.00021651693,0.066691406,0.007631644,0.9085021,0.013203097,0.00009142513],"about_ca_topic_score_codex":0.0012515468,"about_ca_topic_score_gemma":0.0019396141,"teacher_disagreement_score":0.008258372,"about_ca_system_score_codex":0.0005636992,"about_ca_system_score_gemma":0.0005082471,"threshold_uncertainty_score":0.027626991},"labels":[],"label_agreement":null},{"id":"W2400734371","doi":"","title":"The Connected and Tree Domination Number of P(n, k) for k = 4, 6, 8.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Tree (set theory); Combinatorics","score_opus":0.004876077485805058,"score_gpt":0.2126831161420811,"score_spread":0.20780703865627603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400734371","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9138596,0.00062119623,0.007921087,0.0014136379,0.00007292311,0.000052361498,0.003966587,0.0002629059,0.07182975],"genre_scores_gemma":[0.9885309,0.00026856904,0.0032022758,0.000073334384,0.000040262603,0.00007476652,0.001280478,0.000051579915,0.0064778007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994404,0.00012726885,0.000024798157,0.00012019916,0.00013887529,0.00014849268],"domain_scores_gemma":[0.99306774,0.0046332274,0.00079932733,0.0003770194,0.0004570503,0.00066560006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006172433,0.0003115652,0.00026469954,0.0026451652,0.0013048036,0.0022038552,0.0008891519,0.0008980086,0.0118566295],"category_scores_gemma":[0.0071954397,0.00024566488,0.0002521817,0.001401645,0.0014095327,0.0017396822,0.00088963186,0.0007732206,0.0010399276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0035013661,0.00033394832,0.027357724,0.00074285583,0.00020867263,0.0012819091,0.0019772768,0.066589534,0.04594883,0.7354976,0.041967068,0.074593216],"study_design_scores_gemma":[0.0002740569,0.00018261348,0.043701153,0.00024903571,0.00017658334,0.0031773106,0.0013789313,0.16965716,0.019850628,0.7318043,0.029375423,0.00017282556],"about_ca_topic_score_codex":0.0015303966,"about_ca_topic_score_gemma":0.0033434902,"teacher_disagreement_score":0.0118566295,"about_ca_system_score_codex":0.0010789433,"about_ca_system_score_gemma":0.00093528914,"threshold_uncertainty_score":0.039664328},"labels":[],"label_agreement":null},{"id":"W2400781924","doi":"","title":"Brother Avoiding Round Robin Doubles Tournaments II.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Franchising Strategies and Performance","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Brother; Mathematics; Combinatorics; Genealogy; Law; History; Political science","score_opus":0.01443949175297558,"score_gpt":0.22577934405748706,"score_spread":0.2113398523045115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400781924","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.877644,0.0004219051,0.0699576,0.00029305895,0.00004776921,0.000057391644,0.00016006335,0.00011434882,0.051303875],"genre_scores_gemma":[0.98276454,0.00012895631,0.010600108,0.000056219247,0.000016159673,0.00002722913,0.00016685559,0.00001354761,0.0062263496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993685,0.0001930211,0.000025300806,0.00011232514,0.00011371229,0.00018729545],"domain_scores_gemma":[0.9985487,0.0005936341,0.00024567908,0.0001298122,0.00012441415,0.00035776317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006975616,0.00033707442,0.00036430135,0.00050696224,0.0013631275,0.0015284038,0.00068923016,0.00059638533,0.0041359453],"category_scores_gemma":[0.0017580539,0.00017279071,0.0005520449,0.0004459817,0.0007845239,0.0010415621,0.00077350874,0.0007116158,0.0003192791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004653897,0.00023091084,0.010145066,0.00014824381,0.00008096872,0.0011328097,0.0011654964,0.018409144,0.014382982,0.9116835,0.004352583,0.03780294],"study_design_scores_gemma":[0.0002435518,0.0009547081,0.014194632,0.00020950894,0.00018293067,0.004557249,0.0019189764,0.22086081,0.020022612,0.6835184,0.053196665,0.00013993047],"about_ca_topic_score_codex":0.0012926765,"about_ca_topic_score_gemma":0.0015241425,"teacher_disagreement_score":0.0041359453,"about_ca_system_score_codex":0.0008885797,"about_ca_system_score_gemma":0.00038770837,"threshold_uncertainty_score":0.013836086},"labels":[],"label_agreement":null},{"id":"W2400791485","doi":"","title":"Combinatorial identities for the r-Lah numbers.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.03140546624614378,"score_gpt":0.3116381601980812,"score_spread":0.28023269395193745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400791485","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056029353,0.0058387555,0.14055522,0.0047298344,0.0023312387,0.000062463296,0.00077993056,0.00040183045,0.78927135],"genre_scores_gemma":[0.7898818,0.0040411,0.0586397,0.002174294,0.0026851879,0.00019251331,0.00075617805,0.00024984975,0.14137931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928695,0.00018682955,0.000037550955,0.0001115407,0.000295515,0.00008162438],"domain_scores_gemma":[0.99915576,0.00028060706,0.00011610985,0.000122864,0.00021303652,0.00011160639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008273658,0.00055173086,0.00042254958,0.0024612292,0.0014389833,0.0030874545,0.000681325,0.00082265795,0.01581765],"category_scores_gemma":[0.0027429434,0.00024434694,0.0005693001,0.0010372486,0.0024145572,0.0041899164,0.0017850406,0.0023810284,0.00597207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000313704,0.0000040865502,0.000037541246,0.000012831577,0.0000010781765,0.00001699548,0.00005053134,0.000067941604,0.00016425969,0.9943995,0.002052427,0.00318983],"study_design_scores_gemma":[0.000005180439,0.0000063453544,0.0001547577,0.000014090827,0.00000275377,0.00009705865,0.00003994006,0.0008648557,0.00019582338,0.9834457,0.015165185,0.000008268022],"about_ca_topic_score_codex":0.0007472414,"about_ca_topic_score_gemma":0.00093127164,"teacher_disagreement_score":0.01581765,"about_ca_system_score_codex":0.0011878806,"about_ca_system_score_gemma":0.0006280386,"threshold_uncertainty_score":0.052915275},"labels":[],"label_agreement":null},{"id":"W2400803732","doi":"","title":"Real zeros and the signless r-associated Stirling numbers of the first kind.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Stirling numbers of the first kind; Stirling engine; Combinatorics; Stirling numbers of the second kind; Stirling number; Physics; Thermodynamics","score_opus":0.014925812365493445,"score_gpt":0.27254618538511455,"score_spread":0.2576203730196211,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400803732","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3726704,0.0068204477,0.13683248,0.003518558,0.0034927316,0.000072313116,0.0004799846,0.0007543847,0.47535866],"genre_scores_gemma":[0.92059106,0.0016446543,0.016994148,0.00057868904,0.00079613575,0.000054343618,0.00019627604,0.00018824972,0.058956344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995504,0.00011282456,0.00002546371,0.00007401784,0.00014044081,0.00009668959],"domain_scores_gemma":[0.9990759,0.00025585922,0.0002182367,0.00011857101,0.00016845058,0.00016308008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063350296,0.0008355042,0.00058433483,0.0024436123,0.0011229042,0.0032485703,0.00077675626,0.0010187291,0.010611586],"category_scores_gemma":[0.004458608,0.00038078698,0.0006173057,0.00092534826,0.00281339,0.003256821,0.0016032463,0.001908306,0.003746312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061014056,0.000012309127,0.00008949697,0.00004752206,0.0000051476363,0.00011653052,0.00009235271,0.00027296142,0.0014941306,0.9913464,0.0016488886,0.0048132953],"study_design_scores_gemma":[0.000020578798,0.00002882332,0.00021375301,0.000031420182,0.000008266885,0.00045986,0.00009253878,0.0022022931,0.0012460127,0.98945785,0.006205272,0.000033317992],"about_ca_topic_score_codex":0.00036970188,"about_ca_topic_score_gemma":0.0004301003,"teacher_disagreement_score":0.010611586,"about_ca_system_score_codex":0.000737281,"about_ca_system_score_gemma":0.0006030575,"threshold_uncertainty_score":0.035499334},"labels":[],"label_agreement":null},{"id":"W2400831820","doi":"","title":"New Classes of Integral Trees of Diameter 4.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.0210714781534549,"score_gpt":0.2901142003455186,"score_spread":0.2690427221920637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400831820","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6725677,0.0038798386,0.099689305,0.0028285505,0.0007228894,0.00013219357,0.0012423359,0.0009341502,0.21800311],"genre_scores_gemma":[0.93746567,0.0014964727,0.027999615,0.0005093191,0.00070588465,0.00011295209,0.0013647225,0.00025374748,0.030091764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993057,0.00006997012,0.000035863977,0.00017624842,0.00022741345,0.00018472684],"domain_scores_gemma":[0.9970656,0.0013211383,0.00041835028,0.00027953525,0.00027373253,0.00064155814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053808995,0.0005028213,0.0007468972,0.0032766294,0.0015955279,0.0042263707,0.0013969976,0.0015911554,0.011420519],"category_scores_gemma":[0.0038842533,0.0006921976,0.0008384866,0.0015485715,0.002206431,0.0049214973,0.002809289,0.002868705,0.0010819146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000112123256,0.0000565688,0.0020735073,0.00009370214,0.000013947996,0.0003264764,0.00059083314,0.0008569596,0.0021801337,0.9724583,0.005144811,0.016092632],"study_design_scores_gemma":[0.000065412554,0.0000516797,0.0038485467,0.00008355644,0.00005608982,0.0025434983,0.00048532733,0.008717665,0.0020953498,0.935979,0.0460421,0.00003182273],"about_ca_topic_score_codex":0.0003915301,"about_ca_topic_score_gemma":0.00062605634,"teacher_disagreement_score":0.011420519,"about_ca_system_score_codex":0.0015895588,"about_ca_system_score_gemma":0.0003770381,"threshold_uncertainty_score":0.038205445},"labels":[],"label_agreement":null},{"id":"W2400834481","doi":"","title":"Wiener index of a type of composite graph.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Wiener index; Composite number; Type (biology); Index (typography); Graph; Statistics; Combinatorics; Algorithm; Computer science; Geology; Programming language","score_opus":0.033276809688583646,"score_gpt":0.3019251897283568,"score_spread":0.26864838003977315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400834481","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5269454,0.000981188,0.17996566,0.0012201549,0.00083097897,0.00008111525,0.0009814904,0.0005924908,0.2884015],"genre_scores_gemma":[0.9276309,0.00059490243,0.029821744,0.00024826007,0.00035017217,0.00006592387,0.0005431997,0.0002506995,0.040494144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964714,0.000056734374,0.000019312472,0.00008146876,0.00011978615,0.000075532545],"domain_scores_gemma":[0.9987305,0.00034952487,0.00022978299,0.00016943346,0.00022139886,0.0002992694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041519408,0.00036810013,0.00052721275,0.0039051736,0.0014181486,0.0025370244,0.00072867685,0.0010141429,0.008535796],"category_scores_gemma":[0.0018586718,0.00030398433,0.0005688312,0.0015380848,0.0015168482,0.003294659,0.0013440141,0.0012236078,0.0011848898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004412541,0.00001273244,0.0005118095,0.000032573203,0.000010527105,0.0001296793,0.000112249705,0.0004535108,0.0025625033,0.9901508,0.0016008638,0.004378566],"study_design_scores_gemma":[0.000012991004,0.000028488219,0.0014930234,0.00002976184,0.000025142803,0.0006063786,0.00016773182,0.009348008,0.0022554777,0.9762872,0.009721415,0.000024453468],"about_ca_topic_score_codex":0.00072809553,"about_ca_topic_score_gemma":0.0013075897,"teacher_disagreement_score":0.008535796,"about_ca_system_score_codex":0.0009479175,"about_ca_system_score_gemma":0.00035684934,"threshold_uncertainty_score":0.028555095},"labels":[],"label_agreement":null},{"id":"W2400845803","doi":"","title":"Counting Spanning Trees in Cographs: An Algorithmic Approach.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spanning tree; Combinatorics; Discrete mathematics","score_opus":0.019523300530695085,"score_gpt":0.2850213839657436,"score_spread":0.26549808343504855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400845803","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05347765,0.0014418782,0.9179995,0.0024034043,0.00032018658,0.00042059406,0.0015210051,0.0010467637,0.021369029],"genre_scores_gemma":[0.21792468,0.001131937,0.76467395,0.0005436376,0.00047853886,0.0003989481,0.0025992463,0.00036227456,0.011886827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977857,0.00065185264,0.00020732268,0.00055650785,0.0005856626,0.00021287936],"domain_scores_gemma":[0.98878676,0.0076472205,0.00073628954,0.0013787646,0.0010115637,0.0004394016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023894645,0.00085917354,0.0012957366,0.0043283976,0.002506759,0.0055069835,0.00395308,0.0027765275,0.009350328],"category_scores_gemma":[0.024042258,0.0010092349,0.001539336,0.0068752416,0.0021620782,0.011240172,0.0029341565,0.0028614549,0.001703903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085656786,0.00018693841,0.0030865893,0.00061939604,0.0001151435,0.0002264519,0.0005140417,0.018757109,0.0021560728,0.8367855,0.015711294,0.12175591],"study_design_scores_gemma":[0.000021070944,0.000023297798,0.00049248093,0.00007448402,0.0000669365,0.00031755748,0.0002076847,0.059418973,0.000917321,0.9298801,0.008561012,0.000019051195],"about_ca_topic_score_codex":0.0022926661,"about_ca_topic_score_gemma":0.004973892,"teacher_disagreement_score":0.009350328,"about_ca_system_score_codex":0.001731191,"about_ca_system_score_gemma":0.0019138296,"threshold_uncertainty_score":0.03127998},"labels":[],"label_agreement":null},{"id":"W2400852168","doi":"","title":"Supereulerian index is stable under contractions and closures.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Line graph; Graph; Iterated function; Discrete mathematics; Factor-critical graph; Contractible space; Graph power; Mathematical analysis","score_opus":0.010081464947897798,"score_gpt":0.22972261539235234,"score_spread":0.21964115044445454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400852168","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91664207,0.00013948091,0.05694502,0.00015144495,0.000028800838,0.000037160535,0.00015852947,0.00017651655,0.02572085],"genre_scores_gemma":[0.9870275,0.000102919235,0.008906272,0.000044013294,0.000038643848,0.000038985807,0.00019197502,0.000055166296,0.003594539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994413,0.00005425851,0.00002868268,0.0001982976,0.00015711963,0.00012019079],"domain_scores_gemma":[0.997477,0.0008978683,0.0005331473,0.00047582237,0.00027949407,0.00033672422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004660293,0.00023723413,0.0004186927,0.0009998983,0.00095987314,0.0012467015,0.0006447054,0.00044730352,0.0027787967],"category_scores_gemma":[0.0026585157,0.00024530423,0.0005004897,0.0006823676,0.0020116437,0.0030862833,0.0012640523,0.00087679294,0.00031965278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005360997,0.00013437882,0.008133343,0.00014042264,0.00004910521,0.0010781307,0.0015967631,0.010857295,0.14200765,0.7876247,0.0014737985,0.046368223],"study_design_scores_gemma":[0.00007897832,0.00041823703,0.012990768,0.00003114098,0.00006922547,0.0021000316,0.0009059552,0.07530735,0.10114583,0.7897156,0.017171897,0.0000649508],"about_ca_topic_score_codex":0.000541091,"about_ca_topic_score_gemma":0.0006375937,"teacher_disagreement_score":0.0027787967,"about_ca_system_score_codex":0.00054990937,"about_ca_system_score_gemma":0.0003371284,"threshold_uncertainty_score":0.009296},"labels":[],"label_agreement":null},{"id":"W2400870176","doi":"","title":"Lattices generated by orbits of flats under finite affine-singular symplectic groups.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Symplectic geometry; Affine transformation; Pure mathematics; Algebra over a field","score_opus":0.054729682597319626,"score_gpt":0.32040347557296694,"score_spread":0.2656737929756473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400870176","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77108157,0.00082875113,0.069809906,0.0014721667,0.0003819196,0.00011599339,0.0011190242,0.00053828844,0.15465236],"genre_scores_gemma":[0.9753269,0.00020932996,0.006209249,0.000108328044,0.00017154384,0.000030687792,0.0005350076,0.00006705113,0.017341984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915934,0.00015052663,0.000044382938,0.00012828014,0.0003024938,0.00021489621],"domain_scores_gemma":[0.9987882,0.00029498799,0.00024553091,0.00012730715,0.0001593613,0.00038466757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060326565,0.00048651992,0.000500427,0.0019040095,0.0020115047,0.0029440178,0.0007412434,0.00047944734,0.010855589],"category_scores_gemma":[0.0014954759,0.00033165497,0.00076546986,0.0007470168,0.0025936142,0.0027937389,0.0022629285,0.001297497,0.0012525617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013937932,0.00003927784,0.0007655744,0.000046938996,0.000016820974,0.00026789797,0.00047149457,0.00082669774,0.0020640765,0.98848325,0.0013221526,0.0055565494],"study_design_scores_gemma":[0.00008049574,0.00006280516,0.0012355428,0.000031076757,0.00002047543,0.00037536112,0.00063795206,0.0052445605,0.0029183517,0.98203677,0.007329857,0.000026851738],"about_ca_topic_score_codex":0.002114552,"about_ca_topic_score_gemma":0.0021649017,"teacher_disagreement_score":0.010855589,"about_ca_system_score_codex":0.0015095004,"about_ca_system_score_gemma":0.0007585941,"threshold_uncertainty_score":0.03631556},"labels":[],"label_agreement":null},{"id":"W2400888710","doi":"","title":"Some Classes of Extended Directed Triple Systems and Numbers of Common Blocks.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arithmetic; Combinatorics","score_opus":0.005291433470263331,"score_gpt":0.20412562834629888,"score_spread":0.19883419487603554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400888710","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40478903,0.0020677221,0.27189395,0.0016222548,0.00043418407,0.00021078104,0.0022819727,0.0005528046,0.3161473],"genre_scores_gemma":[0.9100092,0.0007660133,0.04576089,0.00040764874,0.00029668902,0.0002648521,0.0012933078,0.00013662469,0.04106475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904007,0.00021408695,0.0000646138,0.0002457503,0.00022328584,0.00021206608],"domain_scores_gemma":[0.9969496,0.0013712429,0.00047192659,0.00041861704,0.00039192202,0.0003966266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007100678,0.00040341675,0.0004871935,0.00223525,0.0016933437,0.0037516584,0.0008793854,0.0009933141,0.014872519],"category_scores_gemma":[0.0035351235,0.0003796013,0.00067052717,0.00187367,0.0019945141,0.005154104,0.001664181,0.001602967,0.0014607434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029224117,0.000013129311,0.00023565278,0.000026759488,0.0000058654614,0.00007635088,0.00011574389,0.00047489264,0.0004746744,0.9920025,0.0013880151,0.005157176],"study_design_scores_gemma":[0.00001605495,0.000017259075,0.00035858474,0.000029121291,0.000011044397,0.00023930901,0.00014582185,0.0047294223,0.0005669618,0.98152965,0.012343573,0.000013179568],"about_ca_topic_score_codex":0.0010187799,"about_ca_topic_score_gemma":0.0012053979,"teacher_disagreement_score":0.014872519,"about_ca_system_score_codex":0.0014439162,"about_ca_system_score_gemma":0.00066360336,"threshold_uncertainty_score":0.049753547},"labels":[],"label_agreement":null},{"id":"W2400911733","doi":"","title":"On The Symmetric Properties For The Generalized Twisted Genocchi Polynomials.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics; Ring of symmetric functions; Algebra over a field; Orthogonal polynomials; Difference polynomials","score_opus":0.02962232194697636,"score_gpt":0.2667326106714776,"score_spread":0.2371102887245012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400911733","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46755475,0.00579598,0.1189201,0.0064575514,0.0020294916,0.000108323075,0.0008066037,0.00041085092,0.39791638],"genre_scores_gemma":[0.9648061,0.0014284474,0.010466808,0.0009778563,0.00092316023,0.000058457357,0.00023897491,0.000121525634,0.020978509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993474,0.00021880938,0.000026785841,0.00008845792,0.00016764142,0.00015087835],"domain_scores_gemma":[0.998543,0.00053342385,0.00021250767,0.0002453827,0.00024700366,0.00021872084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012266412,0.00069934985,0.00067518005,0.0022361735,0.0017524443,0.0021704352,0.0008081025,0.0010079915,0.011194968],"category_scores_gemma":[0.0044426266,0.00033966135,0.0006995141,0.0014099724,0.004641661,0.0039644046,0.00204248,0.0025117656,0.0020352867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016406724,0.0000062139543,0.0001102853,0.00001929453,0.0000025682282,0.00006083764,0.00008586046,0.00024212942,0.00033115596,0.9948314,0.0013326394,0.0029613655],"study_design_scores_gemma":[0.00001047546,0.000012051869,0.00030380324,0.0000148291,0.000004563472,0.00018478194,0.000048370825,0.0018900532,0.00027789973,0.9944758,0.0027651985,0.000012030831],"about_ca_topic_score_codex":0.0016527151,"about_ca_topic_score_gemma":0.0017273461,"teacher_disagreement_score":0.011194968,"about_ca_system_score_codex":0.0011536919,"about_ca_system_score_gemma":0.00080115325,"threshold_uncertainty_score":0.03745091},"labels":[],"label_agreement":null},{"id":"W2400912671","doi":"","title":"Counting fuzzy subgroups of a special class of non-abelian groups of order p 3 .","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Fuzzy and Soft Set Theory","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Abelian group; Order (exchange); Class (philosophy); Fuzzy logic; Pure mathematics; Combinatorics; Artificial intelligence; Computer science; Business","score_opus":0.030733089205415436,"score_gpt":0.30607724191894203,"score_spread":0.2753441527135266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400912671","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8879317,0.0006161298,0.06367995,0.0008086679,0.0001381573,0.000072322895,0.0002642388,0.0001403501,0.046348386],"genre_scores_gemma":[0.98573166,0.00011873217,0.009519762,0.00005697516,0.0001315863,0.0000384461,0.00019104147,0.000011598091,0.004200272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930596,0.00014951538,0.00005119725,0.00012501416,0.00022516675,0.00014307925],"domain_scores_gemma":[0.9978644,0.0008858099,0.00047481115,0.00021921955,0.0001866088,0.00036903608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009199129,0.00041800353,0.00076426653,0.0026839592,0.0018003003,0.003343506,0.001015051,0.0009638848,0.0044832802],"category_scores_gemma":[0.0031532822,0.0002454254,0.0008902713,0.0011582004,0.0029424867,0.0029352559,0.001280599,0.0009818835,0.00027455413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014618019,0.000048117246,0.0022547843,0.000045969136,0.000026389698,0.00023546691,0.00031276277,0.0012853533,0.0019043823,0.98369586,0.0008087625,0.0092360545],"study_design_scores_gemma":[0.000029960771,0.000050952454,0.0018807813,0.000022703012,0.000026269907,0.0004412912,0.00024334404,0.0131273465,0.0017654478,0.9790111,0.0033777892,0.00002291374],"about_ca_topic_score_codex":0.0010577725,"about_ca_topic_score_gemma":0.0010770146,"teacher_disagreement_score":0.0044832802,"about_ca_system_score_codex":0.0011321364,"about_ca_system_score_gemma":0.0007604336,"threshold_uncertainty_score":0.014998078},"labels":[],"label_agreement":null},{"id":"W2400913317","doi":"","title":"Polyadic codes of prime power length II.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Prime (order theory); Prime power; Power (physics); Discrete mathematics; Combinatorics; Physics","score_opus":0.006262531670610861,"score_gpt":0.2108940216835395,"score_spread":0.20463149001292863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400913317","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1790922,0.011584459,0.31049606,0.0073581557,0.002861002,0.00027276255,0.0037700366,0.0016737502,0.4828916],"genre_scores_gemma":[0.89669293,0.002942096,0.024292678,0.0011763374,0.00090095686,0.00020125469,0.0010129344,0.00020471722,0.07257624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856573,0.00026349927,0.00006882323,0.00025075127,0.00047264562,0.0003784881],"domain_scores_gemma":[0.9963554,0.0014883294,0.00046141614,0.00083529245,0.0004810637,0.0003784792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061064557,0.0005826459,0.000750358,0.0010803188,0.0017477277,0.0034098236,0.0006009097,0.001012219,0.012218131],"category_scores_gemma":[0.0056840447,0.0003140449,0.00039219763,0.0017609793,0.0019249218,0.0032321266,0.0021262395,0.0028983115,0.0039051531],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014856279,0.00002870487,0.00029610848,0.000093850664,0.000008376473,0.00012158262,0.00017964188,0.0018293945,0.0018679596,0.9644413,0.013032397,0.017951977],"study_design_scores_gemma":[0.000037647056,0.000085270716,0.00054565165,0.00010755611,0.000019508509,0.00048351972,0.00015890987,0.009826832,0.0035589968,0.9272166,0.05791596,0.000043646825],"about_ca_topic_score_codex":0.0009404464,"about_ca_topic_score_gemma":0.0008110606,"teacher_disagreement_score":0.012218131,"about_ca_system_score_codex":0.0012309854,"about_ca_system_score_gemma":0.0013044091,"threshold_uncertainty_score":0.040873647},"labels":[],"label_agreement":null},{"id":"W2400938704","doi":"","title":"A note on the two-color Rado number for a(x-y)=bz.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Arithmetic","score_opus":0.03457763800002562,"score_gpt":0.32098118656811864,"score_spread":0.286403548568093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400938704","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017233763,0.009618282,0.105501175,0.018849304,0.022993825,0.00007504461,0.00045192268,0.0011497627,0.82412696],"genre_scores_gemma":[0.6038058,0.009153768,0.13209096,0.011507657,0.00590204,0.0002730576,0.000455969,0.001344724,0.23546608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993954,0.00014278534,0.000025561454,0.0001166957,0.00022592922,0.000093648945],"domain_scores_gemma":[0.99933714,0.00030713304,0.000048736503,0.00010862213,0.00010571624,0.0000927193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093258487,0.0008164393,0.000879758,0.0016674005,0.0025246462,0.0025744787,0.0017354467,0.0016447072,0.025292888],"category_scores_gemma":[0.0029547026,0.00038647637,0.0007039111,0.0013983013,0.0043407865,0.004980327,0.0024546634,0.0045376867,0.0071547735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000437324,0.000009690681,0.000056233308,0.000078362165,0.0000042414167,0.00007523879,0.00008156002,0.00021816898,0.0005939614,0.96194196,0.025836958,0.0110598095],"study_design_scores_gemma":[0.000012668611,0.000018492497,0.00019274201,0.0000493296,0.000008824066,0.00021140485,0.000045958895,0.00090206927,0.0007506015,0.9006902,0.09708847,0.000029241122],"about_ca_topic_score_codex":0.0014664151,"about_ca_topic_score_gemma":0.0019497576,"teacher_disagreement_score":0.025292888,"about_ca_system_score_codex":0.0013978746,"about_ca_system_score_gemma":0.0006918049,"threshold_uncertainty_score":0.084613204},"labels":[],"label_agreement":null},{"id":"W2400955467","doi":"","title":"Note On A q-Operator Identity.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Operator (biology); Identity (music); Pure mathematics; Algebra over a field; Physics","score_opus":0.014094636068635678,"score_gpt":0.2673753278533206,"score_spread":0.2532806917846849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400955467","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0083441455,0.004018027,0.23481202,0.028819406,0.013535957,0.00007634356,0.0005491544,0.0005570081,0.70928794],"genre_scores_gemma":[0.559431,0.007621873,0.13882124,0.030701054,0.010603671,0.00041703682,0.0006608283,0.0008010372,0.25094226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988451,0.00029975307,0.00006602754,0.00025544202,0.0003885002,0.000145063],"domain_scores_gemma":[0.99727494,0.0012068205,0.0001002462,0.00048574165,0.00068711716,0.00024516362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002472883,0.00065570755,0.0005758349,0.0011156827,0.0030841304,0.0022774716,0.0013667867,0.0019746865,0.03173131],"category_scores_gemma":[0.0056558736,0.0003258276,0.0013314981,0.0009449868,0.0059543056,0.008496483,0.0043602036,0.0055802907,0.0069755875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013121442,0.000008251853,0.00005384431,0.000026686585,0.000004000318,0.00006204195,0.00014484933,0.000035246758,0.00021510404,0.98644155,0.00933326,0.0036620207],"study_design_scores_gemma":[0.000008575362,0.000016211605,0.0001663331,0.000026287795,0.0000085561305,0.00018110404,0.000066876666,0.00024226173,0.0003604883,0.94414186,0.05477203,0.000009481845],"about_ca_topic_score_codex":0.0024482347,"about_ca_topic_score_gemma":0.0016940638,"teacher_disagreement_score":0.03173131,"about_ca_system_score_codex":0.00084385363,"about_ca_system_score_gemma":0.0011761452,"threshold_uncertainty_score":0.10615182},"labels":[],"label_agreement":null},{"id":"W2400963025","doi":"","title":"A note on the vertex-distinguishing proper edge coloring of graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Edge coloring; Enhanced Data Rates for GSM Evolution; Combinatorics; Brooks' theorem; Graph coloring; Complete coloring; Graph; 1-planar graph; Chordal graph; Computer science; Artificial intelligence; Line graph","score_opus":0.016567694538734013,"score_gpt":0.22472086055119253,"score_spread":0.2081531660124585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400963025","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036210228,0.018518714,0.5523226,0.034739304,0.016963784,0.00016752358,0.0013300548,0.0015386345,0.33820912],"genre_scores_gemma":[0.5039489,0.019002242,0.39194056,0.014022427,0.009991895,0.000278829,0.0014156441,0.0010078438,0.05839159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980824,0.0006415494,0.00009709217,0.0004810265,0.00046662855,0.00023133674],"domain_scores_gemma":[0.9919161,0.0057440554,0.00022525997,0.001228023,0.00041617494,0.00047028394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023950338,0.0010299319,0.0012168632,0.0017393394,0.0029312186,0.0035956483,0.0029963497,0.002083173,0.009525913],"category_scores_gemma":[0.009115739,0.0007846446,0.0013248564,0.003095699,0.006106203,0.008738983,0.0041102455,0.008845724,0.0018342974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009129021,0.00006254068,0.00057780783,0.00023511646,0.000022951965,0.00020422986,0.00017950046,0.0029394461,0.0014548685,0.92693543,0.041040003,0.026256854],"study_design_scores_gemma":[0.000013830182,0.000025551091,0.00040395017,0.000050878905,0.000020326936,0.00023641503,0.000103817714,0.00553369,0.0008047518,0.94860715,0.044173986,0.000025537887],"about_ca_topic_score_codex":0.003999995,"about_ca_topic_score_gemma":0.006196272,"teacher_disagreement_score":0.009525913,"about_ca_system_score_codex":0.0021709877,"about_ca_system_score_gemma":0.0014989803,"threshold_uncertainty_score":0.031867385},"labels":[],"label_agreement":null},{"id":"W2400967666","doi":"","title":"On equality of restricted edge connectivity and minimum edge degree of graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Degree (music); Combinatorics; Computer science; Telecommunications","score_opus":0.02842017840557692,"score_gpt":0.24851214335308755,"score_spread":0.22009196494751063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400967666","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41355535,0.0073204143,0.3596477,0.0069052535,0.0010021414,0.00012021592,0.0018357689,0.00042530915,0.20918794],"genre_scores_gemma":[0.9646126,0.0023877246,0.02261383,0.0008179703,0.0011014654,0.00013990207,0.0008021035,0.00020422792,0.007320134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99757785,0.00096175977,0.00017239325,0.00057243253,0.00039209495,0.00032342452],"domain_scores_gemma":[0.97470814,0.019821804,0.0015350931,0.0016051899,0.0012425043,0.0010873596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024286371,0.0007338837,0.0014022099,0.002190166,0.0011041851,0.002997867,0.002469034,0.0018290422,0.010782813],"category_scores_gemma":[0.030594405,0.0006284006,0.00068924134,0.0022652089,0.004201741,0.011764342,0.003350307,0.003573007,0.0011681936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018359476,0.000051362196,0.0017515927,0.00022393515,0.00003969519,0.0002463355,0.0003277295,0.00518933,0.0013284107,0.96691114,0.00516954,0.018577212],"study_design_scores_gemma":[0.000025504873,0.000033629272,0.0011350405,0.000046114346,0.000025355237,0.00037490806,0.00013299342,0.012494107,0.0005164947,0.982733,0.002467103,0.000015727921],"about_ca_topic_score_codex":0.0009113628,"about_ca_topic_score_gemma":0.0008554135,"teacher_disagreement_score":0.010782813,"about_ca_system_score_codex":0.00094293937,"about_ca_system_score_gemma":0.00036578331,"threshold_uncertainty_score":0.036072075},"labels":[],"label_agreement":null},{"id":"W2400973841","doi":"","title":"Multidecomposition of K n - F into Graph-Pairs of Order 5 where F is a Hamilton Cycle or an (almost) 1-Factor.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Factor (programming language); Order (exchange); Graph; Hamiltonian path; Discrete mathematics; Computer science","score_opus":0.00560351716376274,"score_gpt":0.22408171926445875,"score_spread":0.21847820210069602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400973841","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7196638,0.00047932827,0.18164074,0.00046078945,0.00022628653,0.0003206172,0.0015319763,0.0007691955,0.09490728],"genre_scores_gemma":[0.86770093,0.00019939283,0.08996081,0.00022395003,0.000048721206,0.000103203005,0.0020544608,0.00029388897,0.039414644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950457,0.000079535894,0.000035644607,0.00014652123,0.00009278385,0.00014089653],"domain_scores_gemma":[0.9992848,0.00016190534,0.00015932486,0.00016005663,0.00013280327,0.00010122564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002415557,0.00041514673,0.00030116743,0.00071622216,0.00094537984,0.001111835,0.00052563165,0.00046200052,0.017068902],"category_scores_gemma":[0.0007866218,0.00033223696,0.0006294373,0.0005503438,0.0005565091,0.0018465637,0.0012599588,0.00072950614,0.0027806354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015357413,0.0005430089,0.005640005,0.0007130828,0.00016321312,0.00268151,0.0018145553,0.009360478,0.09742933,0.7145837,0.01768594,0.14784944],"study_design_scores_gemma":[0.00018763402,0.000735539,0.009026549,0.00023344126,0.00015344634,0.0040598074,0.0019815029,0.033924844,0.1546663,0.6990241,0.09586514,0.00014161762],"about_ca_topic_score_codex":0.0009655866,"about_ca_topic_score_gemma":0.0025242884,"teacher_disagreement_score":0.017068902,"about_ca_system_score_codex":0.0005222186,"about_ca_system_score_gemma":0.0005199386,"threshold_uncertainty_score":0.05710113},"labels":[],"label_agreement":null},{"id":"W2400979426","doi":"","title":"Potentially K 1, 1, t -graphic sequences.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.015101425487720166,"score_gpt":0.2520880504996326,"score_spread":0.23698662501191245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400979426","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28678262,0.0047721365,0.30370712,0.0030096297,0.0015676441,0.00042744857,0.0061143353,0.0039784727,0.3896406],"genre_scores_gemma":[0.7126543,0.0019925484,0.08963736,0.0008406769,0.0003608827,0.00028633268,0.005344226,0.0009028364,0.18798088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954957,0.00006420243,0.000040823244,0.0001249836,0.00009858581,0.00012185548],"domain_scores_gemma":[0.99922323,0.0002634757,0.0001103361,0.00014281085,0.0001586708,0.000101532445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002526688,0.0010789555,0.00043803224,0.0017706108,0.0012159176,0.0032491137,0.0007656198,0.0009933463,0.041022256],"category_scores_gemma":[0.0030149664,0.00034674266,0.00053261826,0.0015210761,0.0008151982,0.0025576125,0.0013645277,0.0013152594,0.010966548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017285967,0.00028622654,0.003509425,0.0014455356,0.00010884001,0.003687979,0.0010764536,0.0079183625,0.057739154,0.6324628,0.05407485,0.2359618],"study_design_scores_gemma":[0.00013474247,0.00027813652,0.0037734706,0.0003666626,0.00013823819,0.0047503705,0.0007422139,0.022609293,0.030308712,0.77031827,0.16645622,0.00012361282],"about_ca_topic_score_codex":0.0007615587,"about_ca_topic_score_gemma":0.0017978171,"teacher_disagreement_score":0.041022256,"about_ca_system_score_codex":0.0007101907,"about_ca_system_score_gemma":0.00060075393,"threshold_uncertainty_score":0.13723314},"labels":[],"label_agreement":null},{"id":"W2400979871","doi":"","title":"A note on the thickness of K l, m, n .","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.03955122814255384,"score_gpt":0.32761071096332367,"score_spread":0.2880594828207698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400979871","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045533933,0.034175813,0.21322641,0.0498976,0.03447005,0.00008592499,0.0009594446,0.001232771,0.6204181],"genre_scores_gemma":[0.7249017,0.018144524,0.11242278,0.010830316,0.011185911,0.00022650659,0.00046545637,0.0020410377,0.119781785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983669,0.0005079998,0.00010878307,0.00033137324,0.0004622886,0.00022268172],"domain_scores_gemma":[0.99285746,0.0040793363,0.00046745024,0.001256179,0.0007746223,0.0005649385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025147123,0.0011162412,0.0010239547,0.0022562344,0.002901114,0.003920767,0.0037339441,0.0018953155,0.01758717],"category_scores_gemma":[0.016949862,0.0007453266,0.00089586363,0.0016313454,0.007325174,0.0110853575,0.004646744,0.0076516652,0.004192731],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014883593,0.000017766746,0.00064005016,0.00023205148,0.000022232614,0.00031090202,0.0005158598,0.00089298404,0.0024141264,0.9444678,0.029807167,0.020530315],"study_design_scores_gemma":[0.0000144179,0.000031205753,0.0011372209,0.00014784261,0.00003541353,0.0004870422,0.00029797066,0.0024069836,0.0020474673,0.92374474,0.06960001,0.0000497387],"about_ca_topic_score_codex":0.0019051098,"about_ca_topic_score_gemma":0.002368526,"teacher_disagreement_score":0.01758717,"about_ca_system_score_codex":0.0013245922,"about_ca_system_score_gemma":0.00079188455,"threshold_uncertainty_score":0.05883491},"labels":[],"label_agreement":null},{"id":"W2400986846","doi":"","title":"Multicolored Spanning Subgraphs in G-Colorings of Complete Graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.023360363500033152,"score_gpt":0.2688719543067487,"score_spread":0.24551159080671556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400986846","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7107189,0.0019568417,0.22247626,0.0020667687,0.00031265157,0.00014256223,0.0018858514,0.0008310999,0.059609003],"genre_scores_gemma":[0.92095286,0.0007174398,0.062572956,0.00042187798,0.00012826086,0.00009470648,0.0012740255,0.0001630891,0.013674746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994617,0.00017169239,0.00003045756,0.0001465211,0.00008944679,0.00010013582],"domain_scores_gemma":[0.9976084,0.0011697124,0.00041029684,0.0003333823,0.00021674408,0.00026138072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000446944,0.00038077956,0.00045448245,0.0010404156,0.000980743,0.001400183,0.0009039953,0.0010024551,0.0063440655],"category_scores_gemma":[0.00337085,0.00057446986,0.0005016003,0.0013893599,0.0009387388,0.002185256,0.0011915949,0.0010737164,0.000717621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032176895,0.00012595109,0.00482479,0.0005160725,0.000095205156,0.0010978463,0.0009925374,0.022660568,0.013435371,0.8666116,0.016664403,0.07265384],"study_design_scores_gemma":[0.000050998013,0.0000446528,0.0024305084,0.000079064135,0.000050626437,0.0009989875,0.0004384051,0.044436615,0.0036701607,0.9362402,0.011538441,0.000021427342],"about_ca_topic_score_codex":0.0012571411,"about_ca_topic_score_gemma":0.0025604921,"teacher_disagreement_score":0.0063440655,"about_ca_system_score_codex":0.0007386735,"about_ca_system_score_gemma":0.00036913046,"threshold_uncertainty_score":0.021223068},"labels":[],"label_agreement":null},{"id":"W2401001014","doi":"","title":"On (α, β)-generalized derivations on lattices.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics; Algebra over a field","score_opus":0.02266963460637845,"score_gpt":0.2653473540960075,"score_spread":0.24267771948962907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401001014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18721582,0.009567963,0.48222756,0.0057777907,0.001468927,0.00013093858,0.0011590304,0.00097612425,0.31147575],"genre_scores_gemma":[0.8640332,0.003951447,0.08023271,0.00199542,0.0008517312,0.00009748171,0.00054711214,0.00033142642,0.047959518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980413,0.0008569182,0.00014382142,0.0002830123,0.00042965327,0.0002453403],"domain_scores_gemma":[0.99802893,0.0007998889,0.00019521288,0.00032037558,0.00038950957,0.00026600703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018526404,0.000690476,0.00072493183,0.00201514,0.002151161,0.0030736788,0.00083925517,0.0011788971,0.006521499],"category_scores_gemma":[0.0041115517,0.0006021977,0.0009046269,0.002282548,0.0046405,0.009180962,0.0043000574,0.00306074,0.0021805533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015061682,0.000007145915,0.00013867317,0.0000292761,0.000007849345,0.000102646976,0.00025453095,0.00034381775,0.00036445397,0.9932734,0.0010618573,0.0044013793],"study_design_scores_gemma":[0.0000055251658,0.0000045399042,0.000054201937,0.000012492045,0.0000034070217,0.000088182045,0.00006739817,0.00054315984,0.00012484439,0.99578047,0.0033097814,0.000006077126],"about_ca_topic_score_codex":0.0012214384,"about_ca_topic_score_gemma":0.0021184585,"teacher_disagreement_score":0.006521499,"about_ca_system_score_codex":0.0014484167,"about_ca_system_score_gemma":0.00068446156,"threshold_uncertainty_score":0.021816552},"labels":[],"label_agreement":null},{"id":"W2401014462","doi":"","title":"Commutative weakly distance-regular digraphs of circle with fixed length.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Commutative property; Combinatorics; Discrete mathematics; Pure mathematics","score_opus":0.05204301987495773,"score_gpt":0.2865529836745429,"score_spread":0.23450996379958516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401014462","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66751933,0.00095267687,0.1597912,0.0009684179,0.00024419354,0.000085081134,0.0012697392,0.00068935746,0.16847998],"genre_scores_gemma":[0.962924,0.00019218177,0.013920466,0.00014180288,0.000058686124,0.000035796085,0.0004358561,0.000058627164,0.022232497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994943,0.00011785312,0.00003434323,0.00017137783,0.000097454074,0.00008464034],"domain_scores_gemma":[0.9976659,0.0010189349,0.00028757646,0.00028339113,0.00032121304,0.0004229756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040024368,0.0002456855,0.0004975719,0.0010300281,0.0017609717,0.0016988388,0.00064883626,0.0005029234,0.00796152],"category_scores_gemma":[0.002292897,0.0002824665,0.00037794063,0.0007342975,0.0012126855,0.0029438566,0.0011348369,0.0006997115,0.0011639933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000112169655,0.000020437783,0.0005331329,0.00005586295,0.000014594223,0.00022895925,0.00032399132,0.00093073095,0.0021963743,0.98949754,0.0012464419,0.0048397603],"study_design_scores_gemma":[0.000040014605,0.00005295551,0.0011256122,0.000027223414,0.000046051435,0.00046830717,0.0003344213,0.009096519,0.004774759,0.96734536,0.016655456,0.00003327768],"about_ca_topic_score_codex":0.0014141796,"about_ca_topic_score_gemma":0.001825207,"teacher_disagreement_score":0.00796152,"about_ca_system_score_codex":0.0011398037,"about_ca_system_score_gemma":0.0004449494,"threshold_uncertainty_score":0.026633918},"labels":[],"label_agreement":null},{"id":"W2401023328","doi":"","title":"Transposition H v -Groups.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Transposition (logic); Pure mathematics; Combinatorics; Geometry","score_opus":0.010445061080482574,"score_gpt":0.23586242015150044,"score_spread":0.22541735907101787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401023328","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20809205,0.0013082346,0.3640743,0.0019129831,0.0035687068,0.00029164224,0.003041313,0.004914142,0.4127966],"genre_scores_gemma":[0.7781606,0.00085167354,0.043086205,0.0007953239,0.0004746773,0.00019160396,0.0034375577,0.0010698054,0.17193262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991648,0.00013364639,0.00005292357,0.00022103473,0.00022784589,0.00019973813],"domain_scores_gemma":[0.99903935,0.00022632137,0.00012818817,0.0003265125,0.00013929751,0.0001403294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000492229,0.0006659803,0.00048931834,0.0009812822,0.00096690713,0.0019804405,0.0009554797,0.0005265687,0.030653259],"category_scores_gemma":[0.00177775,0.00020006705,0.0006512406,0.00072470936,0.0010774543,0.002058009,0.002260173,0.0012700502,0.008631107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002568972,0.000101296224,0.001094663,0.00017544164,0.00006561448,0.00045950103,0.00036912,0.0011270992,0.023022959,0.8614891,0.01775214,0.09408621],"study_design_scores_gemma":[0.00008292042,0.00020684241,0.0012822988,0.000087169865,0.00006518829,0.0011272602,0.00048084138,0.005260341,0.045274917,0.7533162,0.19274636,0.00006964417],"about_ca_topic_score_codex":0.0007905169,"about_ca_topic_score_gemma":0.00094144786,"teacher_disagreement_score":0.030653259,"about_ca_system_score_codex":0.0006482957,"about_ca_system_score_gemma":0.0006916381,"threshold_uncertainty_score":0.10254538},"labels":[],"label_agreement":null},{"id":"W2401037690","doi":"","title":"Lower Bounds on Ramsey Numbers R(6, 8), R(7, 9) and R(8, 17).","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Ramsey's theorem; Mathematics; Combinatorics; Graph; Integer (computer science); Clique; Constructive; Order (exchange); Independent set; Discrete mathematics; Upper and lower bounds","score_opus":0.012180932634087574,"score_gpt":0.2683329110728982,"score_spread":0.2561519784388106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401037690","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.107452676,0.035381883,0.6228002,0.008029975,0.002015371,0.00025578035,0.0020992549,0.0017424343,0.22022249],"genre_scores_gemma":[0.7609889,0.013690537,0.20567505,0.0020964127,0.0022570954,0.0009442709,0.0016696773,0.0005223368,0.012155741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99676466,0.00083483936,0.00022360292,0.0006165887,0.0010343436,0.0005258752],"domain_scores_gemma":[0.97834194,0.016905833,0.0010399269,0.0013676113,0.0014893267,0.0008553589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055868803,0.0020983336,0.0013843713,0.004368977,0.0016189195,0.002955814,0.0024822024,0.0018269714,0.00924938],"category_scores_gemma":[0.023973295,0.00077891385,0.0012853299,0.0019053719,0.0025936747,0.008921091,0.0035238436,0.0062070102,0.0026714928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042446147,0.00026344042,0.0019006667,0.00087793625,0.00011256127,0.00029054377,0.00064907677,0.01668716,0.011302204,0.86702114,0.022324016,0.07814677],"study_design_scores_gemma":[0.00006469956,0.00014975735,0.0017295647,0.00027993947,0.00012871831,0.0007914281,0.00017809452,0.046850536,0.012582701,0.90662485,0.030502316,0.000117409],"about_ca_topic_score_codex":0.0004295447,"about_ca_topic_score_gemma":0.0008482335,"teacher_disagreement_score":0.00924938,"about_ca_system_score_codex":0.002223723,"about_ca_system_score_gemma":0.0009785579,"threshold_uncertainty_score":0.030942261},"labels":[],"label_agreement":null},{"id":"W2401059461","doi":"","title":"Locating and Liar Domination of Circulant Networks.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Circulant matrix; Mathematics; Pure mathematics; Discrete mathematics","score_opus":0.018301420743426604,"score_gpt":0.20934174256396182,"score_spread":0.1910403218205352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401059461","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42151585,0.0025732082,0.41536272,0.0017014397,0.00018496178,0.00013972317,0.00045360456,0.0006062356,0.15746224],"genre_scores_gemma":[0.9538305,0.0005481826,0.020417929,0.0002241045,0.00014994039,0.000095614545,0.00020586845,0.00007222749,0.02445561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898666,0.00036352634,0.000032215325,0.00019700057,0.00021462397,0.00020588619],"domain_scores_gemma":[0.9952649,0.0026650277,0.00064039277,0.00045155032,0.00048381076,0.000494204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094391865,0.00040987134,0.0006708052,0.0014759895,0.0015314915,0.0020434444,0.00096633023,0.0010811322,0.0073288362],"category_scores_gemma":[0.008902165,0.0003419081,0.00044021013,0.000854662,0.0019743897,0.0018227717,0.0016719598,0.001018092,0.001207042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011014417,0.00004093802,0.0008126519,0.00009719335,0.000028194334,0.00031609373,0.00033624875,0.01647118,0.0052381055,0.9463689,0.004764028,0.025416264],"study_design_scores_gemma":[0.000070926704,0.0000723323,0.00093796005,0.00004935905,0.000034567507,0.00069288845,0.00021684848,0.09193327,0.003410811,0.8912389,0.011300285,0.000041736836],"about_ca_topic_score_codex":0.0011200401,"about_ca_topic_score_gemma":0.0018158513,"teacher_disagreement_score":0.0073288362,"about_ca_system_score_codex":0.0012210417,"about_ca_system_score_gemma":0.00063517434,"threshold_uncertainty_score":0.024517417},"labels":[],"label_agreement":null},{"id":"W2401068328","doi":"","title":"Matching Preclusion Number in Cartesian Product of Graphs and its Application to Interconnection Networks.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Hypercube; Mathematics; Combinatorics; Matching (statistics); Discrete mathematics; Cube (algebra); Interconnection; Computer science","score_opus":0.0063749726444367345,"score_gpt":0.22459000691385994,"score_spread":0.2182150342694232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401068328","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22364363,0.0019233128,0.73628485,0.0008341539,0.00013510072,0.00010632978,0.00023236303,0.00034357785,0.036496766],"genre_scores_gemma":[0.8656067,0.0011750147,0.1296544,0.00013157426,0.00012071837,0.00009010787,0.00015995269,0.000070653055,0.002990833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999126,0.0002720831,0.000065861954,0.00023349421,0.00023691937,0.000065652246],"domain_scores_gemma":[0.9952814,0.0030796684,0.00059346535,0.0005211042,0.00027433567,0.00025000592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016117631,0.00045083076,0.00044651792,0.0016209625,0.0006385676,0.0012864597,0.0006653481,0.00072394905,0.003337243],"category_scores_gemma":[0.008522872,0.0003402963,0.0006165372,0.0016139285,0.0029449582,0.00386327,0.0015670223,0.0012463798,0.0003072002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008098009,0.000022711763,0.001131209,0.00009921387,0.000012792191,0.00015336635,0.00020953658,0.024905976,0.0038467837,0.9428681,0.00095242675,0.025716959],"study_design_scores_gemma":[0.000011884802,0.000113236616,0.00082037796,0.00003048562,0.000025635232,0.0006310196,0.00009018974,0.106576994,0.00437289,0.8805062,0.0067935362,0.000027555176],"about_ca_topic_score_codex":0.00063901604,"about_ca_topic_score_gemma":0.0004923912,"teacher_disagreement_score":0.003337243,"about_ca_system_score_codex":0.0009738277,"about_ca_system_score_gemma":0.00041761325,"threshold_uncertainty_score":0.011164188},"labels":[],"label_agreement":null},{"id":"W2401099273","doi":"","title":"The sum numbers and the integral sum numbers of the graph K n \\E(C n-1 ).","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics","score_opus":0.02287627913084229,"score_gpt":0.25440049601957365,"score_spread":0.23152421688873137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401099273","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3486868,0.004311166,0.15356606,0.0056678015,0.0022037094,0.000090290574,0.0013568894,0.00054855505,0.48356873],"genre_scores_gemma":[0.89147615,0.002499317,0.04169136,0.00071450043,0.0010746062,0.00018059165,0.0009077731,0.00041290282,0.061042726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920744,0.00017043023,0.00004290538,0.00018624864,0.00024265793,0.00015039295],"domain_scores_gemma":[0.9980204,0.00083431735,0.00024819115,0.000203213,0.000338559,0.00035527063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008378126,0.0008455125,0.0007488143,0.003995922,0.0024285447,0.004167554,0.0014986186,0.0011518388,0.01270779],"category_scores_gemma":[0.006094465,0.00040688133,0.00061934796,0.002079633,0.004468541,0.007975177,0.0021805512,0.002898994,0.002260885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051555347,0.000013350096,0.0002148707,0.000055731864,0.00000680736,0.000044907076,0.000110579385,0.00053582044,0.00074350415,0.98563194,0.0028687841,0.009722115],"study_design_scores_gemma":[0.0000056443523,0.000009227681,0.00037707007,0.000024355888,0.000011238171,0.00017658144,0.00007004485,0.00277316,0.0009428033,0.98931444,0.006281319,0.000014230312],"about_ca_topic_score_codex":0.00077098527,"about_ca_topic_score_gemma":0.0009545083,"teacher_disagreement_score":0.01270779,"about_ca_system_score_codex":0.0012451872,"about_ca_system_score_gemma":0.00066643674,"threshold_uncertainty_score":0.04251182},"labels":[],"label_agreement":null},{"id":"W2401108363","doi":"","title":"Block Diagonalization Method for the Covering Graph.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Block (permutation group theory); Graph; Combinatorics","score_opus":0.020171086465542665,"score_gpt":0.3196195414713774,"score_spread":0.2994484550058347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401108363","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020188572,0.0003957896,0.9436066,0.00034443743,0.00030298645,0.00008415804,0.00053039205,0.0010157271,0.033531465],"genre_scores_gemma":[0.2691083,0.0008160479,0.6716749,0.00038011002,0.00019988543,0.00038827612,0.0013772405,0.0010525977,0.0550027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998074,0.00004944022,0.000006265551,0.000034991925,0.00007349589,0.000028352193],"domain_scores_gemma":[0.9996362,0.00010638695,0.000024388692,0.000116832394,0.000089295674,0.000026889651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002255019,0.0003548996,0.0003169925,0.0008515583,0.00045666835,0.00048259387,0.0005226765,0.00042058967,0.015846752],"category_scores_gemma":[0.0011696272,0.00016995065,0.00034311428,0.0007455645,0.00046759917,0.00082260853,0.00069530006,0.00095383974,0.004430224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013234525,0.00012383977,0.0004965557,0.00025085628,0.000045331184,0.00012263792,0.00028122772,0.018872434,0.02341659,0.6320487,0.042441953,0.28176755],"study_design_scores_gemma":[0.00008334007,0.00009727037,0.000867209,0.00006792489,0.000039604904,0.00026427314,0.0001404089,0.3137677,0.014887456,0.5989335,0.07080779,0.000043642824],"about_ca_topic_score_codex":0.002525219,"about_ca_topic_score_gemma":0.0067491285,"teacher_disagreement_score":0.015846752,"about_ca_system_score_codex":0.00038905366,"about_ca_system_score_gemma":0.0006053125,"threshold_uncertainty_score":0.05301267},"labels":[],"label_agreement":null},{"id":"W2401118672","doi":"","title":"Second factorization of the Generalized Lah Matrix.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Factorization; Pure mathematics; Matrix (chemical analysis); Algorithm; Chemistry","score_opus":0.004399444064054874,"score_gpt":0.19392166254814738,"score_spread":0.1895222184840925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401118672","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09730024,0.0019622466,0.67829514,0.002539084,0.0014245028,0.00013810613,0.0011505196,0.0008563759,0.21633376],"genre_scores_gemma":[0.7822435,0.0011135316,0.10141092,0.0011449644,0.0007877694,0.00014645538,0.00072196807,0.00026407524,0.112166755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999501,0.000116325115,0.0000119415245,0.00008767434,0.0001755159,0.00010755206],"domain_scores_gemma":[0.9991302,0.0002004961,0.000093798015,0.00018722613,0.00025850907,0.00012979552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004129396,0.00061696453,0.0004104142,0.001214266,0.00067674,0.0013624124,0.00044055356,0.0007861812,0.021421183],"category_scores_gemma":[0.0015894679,0.0002113821,0.00042284094,0.00061072066,0.0010051817,0.0013298849,0.0007539231,0.0012239342,0.005079642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007348403,0.00003005411,0.00026757625,0.00008048229,0.00001384812,0.00026177397,0.00020398959,0.0036692766,0.009057069,0.9565918,0.01095524,0.018795324],"study_design_scores_gemma":[0.000032873682,0.00010485884,0.0008764691,0.00006211543,0.0000140107295,0.00086069194,0.00024853114,0.060346656,0.0064718854,0.8909905,0.039926752,0.00006465139],"about_ca_topic_score_codex":0.0015250252,"about_ca_topic_score_gemma":0.002496052,"teacher_disagreement_score":0.021421183,"about_ca_system_score_codex":0.00063291396,"about_ca_system_score_gemma":0.00074387866,"threshold_uncertainty_score":0.071661055},"labels":[],"label_agreement":null},{"id":"W2401120393","doi":"","title":"Enumeration of Highly Irregular Trees by Automorphism Group.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Enumeration; Mathematics; Combinatorics; Automorphism; Automorphism group; Group (periodic table); Physics","score_opus":0.010890429732252231,"score_gpt":0.252166731711059,"score_spread":0.24127630197880678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401120393","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57158214,0.0009486106,0.32309476,0.001237586,0.0003017028,0.00013368721,0.0012412886,0.0010362878,0.10042388],"genre_scores_gemma":[0.89459455,0.0005362995,0.075266875,0.00021356833,0.00012462607,0.00008262969,0.0017032918,0.0002802552,0.0271978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963415,0.00009980298,0.00002277529,0.000068736925,0.00010977323,0.00006480402],"domain_scores_gemma":[0.99886835,0.0004341058,0.00015108501,0.00031379942,0.00012595006,0.00010670868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024374963,0.00028056547,0.00044160595,0.0011077273,0.0007429467,0.0013240675,0.00058902823,0.0005873308,0.006018137],"category_scores_gemma":[0.0018796669,0.0002469989,0.00037770616,0.0011978237,0.00089500955,0.0017672832,0.001399839,0.00084545807,0.0013408189],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015266125,0.000077028366,0.003084217,0.00015288708,0.0000249737,0.00030985422,0.00066853105,0.0063780067,0.012289838,0.9006406,0.010242518,0.065978944],"study_design_scores_gemma":[0.000013944853,0.00002866988,0.0008974418,0.000027991055,0.0000155667,0.00041133576,0.00020562796,0.019964118,0.0034058974,0.960401,0.014618815,0.000009689737],"about_ca_topic_score_codex":0.00043455986,"about_ca_topic_score_gemma":0.0009263195,"teacher_disagreement_score":0.006018137,"about_ca_system_score_codex":0.00045314681,"about_ca_system_score_gemma":0.00029829415,"threshold_uncertainty_score":0.02013266},"labels":[],"label_agreement":null},{"id":"W2401120511","doi":"","title":"On the least signless Laplacian eigenvalue of non-bipartite unicyclic graphs with both given order and diameter","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Order (exchange); Eigenvalues and eigenvectors; Laplacian matrix; Discrete mathematics; Graph; Physics; Quantum mechanics","score_opus":0.015044048639272542,"score_gpt":0.2484579200891741,"score_spread":0.23341387144990156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401120511","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.852148,0.0010926794,0.08207241,0.0037784923,0.00044265488,0.00006458036,0.00038737833,0.0003736078,0.059640113],"genre_scores_gemma":[0.97904575,0.00069801783,0.009105153,0.0003624568,0.0005766019,0.00007179058,0.0002616673,0.0001411744,0.009737409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994319,0.00021170545,0.000019443298,0.00012354263,0.00011628979,0.00009710002],"domain_scores_gemma":[0.9928899,0.0048146234,0.0007678009,0.00023362758,0.00045591305,0.0008381635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009246719,0.001120294,0.0011937375,0.002366027,0.0014545545,0.0025609233,0.0016786796,0.0017269432,0.0065572322],"category_scores_gemma":[0.007762989,0.0005748398,0.00047255817,0.0014077117,0.00315697,0.003266072,0.0014681163,0.0016441521,0.0007857438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005934084,0.00019824538,0.0023184207,0.0003904638,0.000047087044,0.00057831703,0.0009627221,0.039335273,0.01328167,0.91426915,0.0107371975,0.017287968],"study_design_scores_gemma":[0.00008010163,0.00008505252,0.0012463882,0.000063333224,0.000022866963,0.000266346,0.00049465144,0.099762514,0.0015733368,0.8950757,0.0012754211,0.000054436518],"about_ca_topic_score_codex":0.0012768486,"about_ca_topic_score_gemma":0.0017240347,"teacher_disagreement_score":0.0065572322,"about_ca_system_score_codex":0.0013118052,"about_ca_system_score_gemma":0.00066449447,"threshold_uncertainty_score":0.021936119},"labels":[],"label_agreement":null},{"id":"W2401130130","doi":"","title":"Sharp lower bounds on signed domination numbers of digraphs","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Domination analysis; Discrete mathematics; Graph; Vertex (graph theory)","score_opus":0.022703947547692106,"score_gpt":0.28914195132592274,"score_spread":0.2664380037782306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401130130","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43700054,0.0055074655,0.36351183,0.0065392256,0.00077531795,0.00023102976,0.0018991842,0.001389956,0.18314551],"genre_scores_gemma":[0.9145001,0.0029445193,0.05352588,0.0009863746,0.00079906173,0.0003897342,0.0012895366,0.00048148472,0.025083246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99689496,0.0007129757,0.00017192039,0.00055805943,0.0010962534,0.0005657529],"domain_scores_gemma":[0.9579922,0.032973766,0.001959702,0.0023918075,0.0016180754,0.0030644475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031909447,0.0021900765,0.0018678175,0.00549496,0.0022637416,0.008267101,0.0045737647,0.0025615958,0.013381809],"category_scores_gemma":[0.03156014,0.0015206678,0.00138102,0.00444531,0.004419975,0.012271166,0.004729734,0.0076093934,0.0018843254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042964725,0.00019227184,0.00257446,0.00044130278,0.00007774295,0.00020862972,0.0006230074,0.03008523,0.005952576,0.91452074,0.007991986,0.036902223],"study_design_scores_gemma":[0.000047460686,0.00006556386,0.00088132604,0.00011546313,0.000058328722,0.0002084456,0.00012699334,0.06605842,0.0023884962,0.9257397,0.004259673,0.000050117098],"about_ca_topic_score_codex":0.0007275489,"about_ca_topic_score_gemma":0.0018988864,"teacher_disagreement_score":0.013381809,"about_ca_system_score_codex":0.004052434,"about_ca_system_score_gemma":0.0013468317,"threshold_uncertainty_score":0.044766605},"labels":[],"label_agreement":null},{"id":"W2401132194","doi":"","title":"The Extremal Matching Energy of Graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Matching (statistics); Combinatorics; Statistics","score_opus":0.01598578697707676,"score_gpt":0.25710696701035235,"score_spread":0.2411211800332756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401132194","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4158281,0.009638693,0.19674285,0.007942206,0.0015169557,0.000059326674,0.0011090086,0.00053828623,0.3666246],"genre_scores_gemma":[0.96597767,0.0016650562,0.0094384905,0.0005741697,0.00057476637,0.0000662919,0.00032099694,0.00017362308,0.021208957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994937,0.00014222407,0.000018328732,0.00008763592,0.0001623451,0.00009568573],"domain_scores_gemma":[0.99878246,0.00057434855,0.0001590473,0.00018631524,0.00012027202,0.00017751692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070668163,0.00053931255,0.0006741963,0.0029194148,0.0010752077,0.0021983478,0.0012968656,0.0021173258,0.011142217],"category_scores_gemma":[0.0051152534,0.00038215582,0.00039334566,0.0012932848,0.0020274913,0.004026385,0.0020851663,0.0017419369,0.0016150883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029193883,0.000013309255,0.0002739102,0.0000623717,0.000012263142,0.000044548993,0.000056388613,0.002597167,0.00061445346,0.98462784,0.0032793016,0.008389245],"study_design_scores_gemma":[0.0000046857367,0.00000565739,0.00033749102,0.000019433568,0.0000049761343,0.0000950058,0.000051090694,0.010332668,0.00022019177,0.98679405,0.0021284176,0.000006252122],"about_ca_topic_score_codex":0.0003895255,"about_ca_topic_score_gemma":0.00048796102,"teacher_disagreement_score":0.011142217,"about_ca_system_score_codex":0.0009236078,"about_ca_system_score_gemma":0.00025760577,"threshold_uncertainty_score":0.03727448},"labels":[],"label_agreement":null},{"id":"W2401136340","doi":"","title":"Total and adjacent vertex-distinguishing total chromatic numbers of augmented cubes.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Vertex (graph theory); Combinatorics; Graph","score_opus":0.0067147182642866175,"score_gpt":0.20706496852393347,"score_spread":0.20035025025964684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401136340","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71431905,0.00097500946,0.13184102,0.0020143988,0.00027032077,0.00010654106,0.0025240907,0.0004723017,0.1474772],"genre_scores_gemma":[0.94690394,0.00034410672,0.03758645,0.00024344336,0.00010421943,0.00009981344,0.0011894124,0.0001518207,0.01337679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987859,0.0003107094,0.00006102241,0.00028951193,0.00027530978,0.0002774823],"domain_scores_gemma":[0.9934018,0.004161404,0.00062170974,0.0008020914,0.00046382943,0.00054902537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013805927,0.0006661812,0.0006309253,0.0018129937,0.0019786628,0.004203924,0.0024195334,0.0011588461,0.013062103],"category_scores_gemma":[0.007620294,0.0005952791,0.0007123187,0.0022415954,0.0028400011,0.0057499004,0.0024656386,0.002405036,0.00093194755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034095233,0.000060229144,0.0018794956,0.00013362088,0.000024554678,0.00006638241,0.0002449631,0.014268685,0.0022289662,0.95775014,0.0060272245,0.01697476],"study_design_scores_gemma":[0.00005687133,0.000046413665,0.0016904993,0.00004934267,0.000041799976,0.00021561759,0.0002990934,0.040839285,0.0028745956,0.9469852,0.006866728,0.000034610228],"about_ca_topic_score_codex":0.002542199,"about_ca_topic_score_gemma":0.003727036,"teacher_disagreement_score":0.013062103,"about_ca_system_score_codex":0.0025791323,"about_ca_system_score_gemma":0.0011360764,"threshold_uncertainty_score":0.04369706},"labels":[],"label_agreement":null},{"id":"W2401155135","doi":"","title":"Weak Edge Detour Number of a Graph.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Graph; Computer science; Artificial intelligence","score_opus":0.020548330312800837,"score_gpt":0.233535687055139,"score_spread":0.21298735674233815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401155135","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6683722,0.0010851859,0.19084369,0.005260657,0.00058242213,0.00011080461,0.002902282,0.0005687722,0.13027391],"genre_scores_gemma":[0.92773575,0.00050054403,0.041415356,0.00040945987,0.0002625471,0.00012407514,0.0013699201,0.00017973084,0.02800271],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999116,0.00025636924,0.00005224765,0.00021553895,0.00017843826,0.00018137084],"domain_scores_gemma":[0.9943433,0.003153951,0.00055342895,0.00072774687,0.0004768029,0.0007447829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010446233,0.0006281419,0.00066831784,0.002254982,0.0024718365,0.0030955886,0.0017012754,0.0013615652,0.011993878],"category_scores_gemma":[0.0065128906,0.00038982043,0.00052879885,0.0018285329,0.0022932803,0.006654533,0.0019600117,0.0023965186,0.0016513129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002748473,0.00006724467,0.0019972697,0.00016822948,0.000024629717,0.00010765002,0.00026132315,0.004221264,0.0041392185,0.9593449,0.0076826783,0.021710698],"study_design_scores_gemma":[0.000028501292,0.000043167238,0.0012579222,0.00003986344,0.000031027743,0.0002341848,0.00024088444,0.018779457,0.0038454535,0.963328,0.012146596,0.000025009194],"about_ca_topic_score_codex":0.0007546257,"about_ca_topic_score_gemma":0.0010046446,"teacher_disagreement_score":0.011993878,"about_ca_system_score_codex":0.0011333185,"about_ca_system_score_gemma":0.00058267085,"threshold_uncertainty_score":0.040123522},"labels":[],"label_agreement":null},{"id":"W2401163254","doi":"","title":"On Schematic Orthogonal Arrays of Strength Two.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Schematic; Mathematics; Electrical engineering; Engineering","score_opus":0.0061459938701997185,"score_gpt":0.20747073878517822,"score_spread":0.2013247449149785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401163254","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10275453,0.0017058,0.40171304,0.0016696359,0.0008513669,0.00008071591,0.0005203924,0.0004527409,0.49025178],"genre_scores_gemma":[0.812862,0.0020163096,0.072524436,0.0011558916,0.0005127147,0.00014741375,0.00059394666,0.00026853965,0.10991886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995171,0.00015836666,0.000016476255,0.00006601799,0.00012892454,0.00011316098],"domain_scores_gemma":[0.9991978,0.000335306,0.00010939858,0.00012453337,0.00015642434,0.000076685326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027938563,0.000465825,0.00036080615,0.0012656557,0.00088083826,0.0016166184,0.00048630728,0.0007972843,0.018852286],"category_scores_gemma":[0.002123718,0.0003822012,0.00033014044,0.0010231258,0.0012864511,0.0024857079,0.001304803,0.001165198,0.003376861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002113835,0.0000077741915,0.00007622092,0.00002361876,0.0000032249154,0.00006791595,0.000060017464,0.0013405745,0.0013532485,0.9873246,0.0029405295,0.006781085],"study_design_scores_gemma":[0.000010777457,0.000017899985,0.00017153425,0.000029546838,0.0000052415394,0.00024449202,0.00010135164,0.0120034795,0.0010866845,0.97326636,0.013047958,0.000014733749],"about_ca_topic_score_codex":0.0005327048,"about_ca_topic_score_gemma":0.0009110565,"teacher_disagreement_score":0.018852286,"about_ca_system_score_codex":0.00057097845,"about_ca_system_score_gemma":0.00029120842,"threshold_uncertainty_score":0.0630672},"labels":[],"label_agreement":null},{"id":"W2401164932","doi":"","title":"The Commuting Graph of the Quaternion Algebra over Residue Classes of Integers.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Quaternion; Residue (chemistry); Quaternion algebra; Graph; Algebra over a field; Discrete mathematics; Combinatorics; Pure mathematics; Division algebra; Filtered algebra; Geometry; Chemistry; Organic chemistry","score_opus":0.00715967029032019,"score_gpt":0.2261953475328709,"score_spread":0.2190356772425507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401164932","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50677544,0.0021468147,0.14928204,0.003756898,0.0013896163,0.00012056851,0.001243906,0.00074581325,0.3345389],"genre_scores_gemma":[0.95050544,0.0008158362,0.012151891,0.0005545795,0.00045363477,0.000055697972,0.00048668258,0.0001975921,0.034778535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995622,0.000116947034,0.000020396186,0.00009213791,0.00011005074,0.00009821816],"domain_scores_gemma":[0.99919504,0.00023656929,0.00016475903,0.00010553137,0.00014676404,0.0001514276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048631008,0.00042164925,0.0005285411,0.0016471306,0.0013510294,0.0020882376,0.0006326516,0.00068718183,0.014014533],"category_scores_gemma":[0.0017574489,0.00024596794,0.00033856282,0.001055097,0.0017458309,0.003890452,0.00094538747,0.0012225668,0.0023303519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028752487,0.0000140739,0.0001490487,0.000018029072,0.00000351714,0.00006411128,0.00010960823,0.00029621783,0.00064175273,0.9905822,0.0019984199,0.0060941745],"study_design_scores_gemma":[0.000011156039,0.000012423689,0.00021486825,0.000009345636,0.0000036537529,0.00009458339,0.000070503294,0.001964843,0.0004768802,0.99154985,0.005583071,0.000008832917],"about_ca_topic_score_codex":0.0014404085,"about_ca_topic_score_gemma":0.0014973576,"teacher_disagreement_score":0.014014533,"about_ca_system_score_codex":0.0007514152,"about_ca_system_score_gemma":0.0006152513,"threshold_uncertainty_score":0.046883285},"labels":[],"label_agreement":null},{"id":"W2401169605","doi":"","title":"An Improved Algorithm for Cyclic Edge Connectivity of Regular Graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Algorithm; Computer science; Artificial intelligence","score_opus":0.009102863404994091,"score_gpt":0.23547330422581528,"score_spread":0.2263704408208212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401169605","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042187076,0.00054540194,0.92667645,0.0006005145,0.00030051437,0.0005688519,0.0011848556,0.007915266,0.02002102],"genre_scores_gemma":[0.15585078,0.00022798381,0.8303405,0.0002476108,0.00012521312,0.00051828317,0.0028686589,0.00074432755,0.009076608],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907076,0.00019328704,0.00006629664,0.00023226428,0.00027810936,0.00015917061],"domain_scores_gemma":[0.99756384,0.0008756887,0.00011479675,0.0008389484,0.00047558342,0.00013126439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006498552,0.0009885719,0.00087886857,0.0019170046,0.0010497966,0.001475681,0.00251532,0.0014282295,0.016080655],"category_scores_gemma":[0.00571875,0.00050269766,0.0008006548,0.002819604,0.0007298117,0.0026439226,0.002586632,0.0012980371,0.003432325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008128567,0.00045513714,0.0016992423,0.0005285542,0.00011896231,0.00039050117,0.00034790972,0.072123885,0.01493645,0.062192257,0.056629173,0.789765],"study_design_scores_gemma":[0.0005192013,0.00032366833,0.0011915498,0.000084821164,0.00014055293,0.0005787054,0.00021052783,0.8186257,0.013609413,0.1257541,0.038881943,0.000079940284],"about_ca_topic_score_codex":0.0055087935,"about_ca_topic_score_gemma":0.008950352,"teacher_disagreement_score":0.016080655,"about_ca_system_score_codex":0.001155358,"about_ca_system_score_gemma":0.0022681293,"threshold_uncertainty_score":0.0537951},"labels":[],"label_agreement":null},{"id":"W2401170156","doi":"","title":"Two Classes of Optimal Stopping Redundancy Codes.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Redundancy (engineering); Optimal stopping; Reliability engineering; Mathematical optimization","score_opus":0.01522668041773147,"score_gpt":0.2519546869470045,"score_spread":0.23672800652927303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401170156","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34413412,0.0045335894,0.48000342,0.004801254,0.0006767983,0.00049472874,0.00351357,0.0014160463,0.1604264],"genre_scores_gemma":[0.90490824,0.0019333677,0.059953716,0.0010765631,0.00037449316,0.0005019035,0.0017146552,0.00029986922,0.029237216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99752134,0.0006484241,0.00012609104,0.00035686273,0.00071508705,0.0006322862],"domain_scores_gemma":[0.9890085,0.0062279054,0.0011402658,0.0017341248,0.0011227273,0.00076641625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019434986,0.0008137321,0.0011349892,0.0017821642,0.0010184796,0.0034362716,0.0016194144,0.0021729583,0.0078044636],"category_scores_gemma":[0.019106241,0.0005810438,0.00065563037,0.0017311868,0.0019494216,0.0026515257,0.0018422033,0.0021376864,0.001013743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026384604,0.000086310334,0.0006417322,0.000115023555,0.000018744373,0.0000906407,0.00013100647,0.014592134,0.0011897265,0.9428308,0.011272411,0.0287677],"study_design_scores_gemma":[0.00020071983,0.00014796568,0.00087441143,0.000100991434,0.00003630861,0.0005394185,0.000114364746,0.15783946,0.002014185,0.82060224,0.017466798,0.000063161046],"about_ca_topic_score_codex":0.0014349909,"about_ca_topic_score_gemma":0.0014845161,"teacher_disagreement_score":0.0078044636,"about_ca_system_score_codex":0.0028384402,"about_ca_system_score_gemma":0.0028298425,"threshold_uncertainty_score":0.026108503},"labels":[],"label_agreement":null},{"id":"W2401182739","doi":"","title":"Sharp upper bounds for the largest Laplacian eigenvalue of mixed graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Laplace operator; Combinatorics; Mathematical analysis; Physics","score_opus":0.026181749821378244,"score_gpt":0.2799468822940065,"score_spread":0.2537651324726283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401182739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.123893164,0.020242693,0.5888955,0.013534054,0.0025987856,0.00019650412,0.0019380626,0.0022261664,0.24647507],"genre_scores_gemma":[0.8695444,0.007441767,0.08671487,0.0030452914,0.0030721102,0.0006421938,0.0011996672,0.00096212287,0.02737753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977943,0.000593374,0.00007793063,0.00039257348,0.000719259,0.000422654],"domain_scores_gemma":[0.976719,0.017388517,0.0011280805,0.0014485407,0.0014874297,0.0018283847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030276638,0.0032126247,0.0015768544,0.0060106334,0.002015134,0.004729222,0.004019171,0.0027599498,0.016527463],"category_scores_gemma":[0.03133944,0.0012799456,0.0013226815,0.002821495,0.004276314,0.00840571,0.0054346495,0.007931534,0.003733045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025709538,0.00015453131,0.0010082821,0.000617774,0.00010246384,0.0003367561,0.0004193276,0.012412116,0.00954819,0.9297129,0.023240702,0.022189893],"study_design_scores_gemma":[0.00003184623,0.000047173526,0.00078978314,0.0001492514,0.00007258908,0.0003892928,0.00016311437,0.06268454,0.002827765,0.9260429,0.006744986,0.000056861663],"about_ca_topic_score_codex":0.0007601405,"about_ca_topic_score_gemma":0.0016481291,"teacher_disagreement_score":0.016527463,"about_ca_system_score_codex":0.0020077676,"about_ca_system_score_gemma":0.0006912075,"threshold_uncertainty_score":0.055289924},"labels":[],"label_agreement":null},{"id":"W2401194801","doi":"","title":"On the strongly c-harmoniousness of cycle with some chords.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Composite Structure Analysis and Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.0029222295011968966,"score_gpt":0.1704043831490435,"score_spread":0.1674821536478466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401194801","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33320484,0.0011930295,0.33550024,0.0012125059,0.00029282513,0.00010403272,0.00066409813,0.00032010704,0.32750824],"genre_scores_gemma":[0.94136566,0.00043534336,0.03346466,0.00031216536,0.00016979956,0.00007533279,0.0003840487,0.0001772812,0.023615798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966896,0.0000803559,0.000013942219,0.00006900283,0.00009611914,0.0000715391],"domain_scores_gemma":[0.9991467,0.00040777287,0.00008677714,0.00012111322,0.00011279244,0.00012476392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005331381,0.00037456272,0.00041216545,0.0010920923,0.0010763633,0.0011840177,0.00069329684,0.00047726207,0.012212515],"category_scores_gemma":[0.0031991864,0.00020045372,0.00043096277,0.0007190826,0.0017985677,0.0020695245,0.0016098752,0.0010375704,0.0009364331],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037377198,0.000010887774,0.00030483684,0.000038318205,0.000008838092,0.000037134356,0.00007519108,0.0031642818,0.0006946691,0.9850861,0.002211971,0.008330335],"study_design_scores_gemma":[0.000014445305,0.000027994276,0.00041702838,0.000017664443,0.000009653604,0.00007068789,0.000093083254,0.01426154,0.00047858732,0.97881067,0.005789217,0.000009347506],"about_ca_topic_score_codex":0.0015981712,"about_ca_topic_score_gemma":0.0019188366,"teacher_disagreement_score":0.012212515,"about_ca_system_score_codex":0.00070882414,"about_ca_system_score_gemma":0.00044061826,"threshold_uncertainty_score":0.04085493},"labels":[],"label_agreement":null},{"id":"W2401195966","doi":"","title":"On Equitable Coloring of Sun let Graph Families.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph coloring; Combinatorics; Graph","score_opus":0.024938220869828817,"score_gpt":0.287927573149643,"score_spread":0.2629893522798142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401195966","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.400743,0.0012567844,0.34072402,0.0027031994,0.00042467573,0.0001440683,0.0009771349,0.00080449274,0.25222272],"genre_scores_gemma":[0.8774758,0.0011791626,0.06444605,0.00083660823,0.00030583335,0.00014886771,0.0012458854,0.0005403927,0.053821456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907494,0.0002908914,0.00003993321,0.00020064358,0.00018354376,0.00021012372],"domain_scores_gemma":[0.9964245,0.0017314185,0.00030247157,0.00065800676,0.00043612643,0.00044743263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010022608,0.00045780183,0.0006055918,0.0016205814,0.0033391612,0.0021190403,0.0010334728,0.000862563,0.016419958],"category_scores_gemma":[0.0052060923,0.00052735803,0.0006325976,0.0017863791,0.001870725,0.005868979,0.0021976775,0.0018022242,0.0013470075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067508896,0.000051281026,0.0008703324,0.000066453395,0.000011267051,0.00013100563,0.0004893225,0.0030400073,0.0010026592,0.9690718,0.006576415,0.018621868],"study_design_scores_gemma":[0.000010020128,0.000013110966,0.00041194865,0.00002619605,0.000010131369,0.00016552277,0.000312932,0.006848912,0.000578529,0.9829655,0.008647704,0.000009392817],"about_ca_topic_score_codex":0.0023918366,"about_ca_topic_score_gemma":0.004947629,"teacher_disagreement_score":0.016419958,"about_ca_system_score_codex":0.0017736533,"about_ca_system_score_gemma":0.0006298729,"threshold_uncertainty_score":0.05493021},"labels":[],"label_agreement":null},{"id":"W2401210413","doi":"","title":"An Extension Of F 1 , F 2 , F 3 Appell's Hypergeometric Functions.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Extension (predicate logic); Appell series; Lauricella hypergeometric series; Hypergeometric function; Pure mathematics; Algebra over a field; Generalized hypergeometric function; Hypergeometric function of a matrix argument; Programming language; Computer science","score_opus":0.06107784224793854,"score_gpt":0.30149906858487086,"score_spread":0.2404212263369323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401210413","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10347256,0.0034002373,0.2911013,0.003860254,0.0032082999,0.00014453226,0.00066508306,0.0006297011,0.5935181],"genre_scores_gemma":[0.7976455,0.0032489304,0.073595695,0.0012338943,0.0017135189,0.00017011906,0.00028599479,0.00026847486,0.12183793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996673,0.00008815857,0.000015143292,0.000055062683,0.000098930956,0.00007542955],"domain_scores_gemma":[0.9993705,0.00015970714,0.0000775452,0.00011397841,0.00016057047,0.000117725074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007390009,0.00068322656,0.00045169305,0.0026359602,0.001618079,0.002159881,0.00087994826,0.001071522,0.01019243],"category_scores_gemma":[0.0023762623,0.00018639328,0.0008059788,0.0020224152,0.0019360993,0.0028213193,0.0013916634,0.001959591,0.003037695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002204096,0.000012332687,0.00009851337,0.000022876806,0.000003944644,0.00009224542,0.00011148101,0.00025254439,0.0005670202,0.98112947,0.003221446,0.014466063],"study_design_scores_gemma":[0.000012133841,0.000021683185,0.0002928537,0.00002386311,0.000009552332,0.00043841088,0.00006177743,0.0032387103,0.0006730379,0.95980704,0.03540134,0.000019541174],"about_ca_topic_score_codex":0.0014343768,"about_ca_topic_score_gemma":0.0009925881,"teacher_disagreement_score":0.01019243,"about_ca_system_score_codex":0.00079299964,"about_ca_system_score_gemma":0.00085969444,"threshold_uncertainty_score":0.034097075},"labels":[],"label_agreement":null},{"id":"W2401215171","doi":"","title":"A note on bounds for the maximum traceable number of a graph.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics; Discrete mathematics","score_opus":0.012216656119128701,"score_gpt":0.24965914596581054,"score_spread":0.23744248984668184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401215171","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016153103,0.03531978,0.59332216,0.040341225,0.0139169125,0.00024879427,0.0029303778,0.0036360826,0.29413158],"genre_scores_gemma":[0.38494673,0.039273545,0.4444014,0.018237961,0.023894964,0.0017824237,0.003606437,0.0051606256,0.07869592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9922236,0.0022059064,0.0004335383,0.0019324672,0.0022161626,0.0009882995],"domain_scores_gemma":[0.9179047,0.06823103,0.0013214857,0.0073557887,0.0027044816,0.0024825113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009268551,0.0049526673,0.0037332224,0.008585055,0.0044604708,0.009579846,0.011132722,0.005572181,0.028892513],"category_scores_gemma":[0.05792065,0.0020491895,0.0047793686,0.00873463,0.0097238105,0.031987555,0.010871467,0.028149398,0.008218756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000493729,0.00020226439,0.0009500898,0.00083192013,0.00013702908,0.00040762805,0.00037968997,0.0105206035,0.0031938115,0.85721123,0.076273404,0.04939865],"study_design_scores_gemma":[0.000024642946,0.000056263907,0.00047405262,0.00021131597,0.00007315348,0.00019613888,0.00009472606,0.015138583,0.0013426265,0.9503464,0.031981736,0.000060391605],"about_ca_topic_score_codex":0.0046544736,"about_ca_topic_score_gemma":0.0068690884,"teacher_disagreement_score":0.028892513,"about_ca_system_score_codex":0.006964495,"about_ca_system_score_gemma":0.00230056,"threshold_uncertainty_score":0.09665507},"labels":[],"label_agreement":null},{"id":"W2401232886","doi":"","title":"Some Results About Modified Zagreb Indices.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Opinion Dynamics and Social Influence","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Statistics","score_opus":0.008874324330557088,"score_gpt":0.2575619935441162,"score_spread":0.2486876692135591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401232886","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2175065,0.01065556,0.13898037,0.006056606,0.0019397029,0.000108872504,0.0014871041,0.00040602894,0.6228593],"genre_scores_gemma":[0.8927065,0.004995716,0.027088042,0.0011391703,0.0021987522,0.00019359901,0.0008801425,0.0003426492,0.070455536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989384,0.00031761755,0.000071269395,0.00018914152,0.000323477,0.00016017442],"domain_scores_gemma":[0.9963799,0.001472751,0.0007215472,0.0004926077,0.00045138548,0.0004818042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014066275,0.0008528064,0.0013203683,0.0031328353,0.002240202,0.0040856786,0.0016337765,0.001099577,0.021486992],"category_scores_gemma":[0.007497108,0.00037805559,0.0010062985,0.0029212532,0.0023966795,0.006479499,0.0022842437,0.0025708803,0.0029147216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015590414,0.000011186344,0.00022373628,0.000043227777,0.000009204953,0.000036557503,0.00007019171,0.0005473257,0.00018558317,0.99181986,0.0019542542,0.005083211],"study_design_scores_gemma":[0.000013134509,0.000011189781,0.00054576935,0.00002326404,0.000013987654,0.00008600897,0.000041510146,0.0046291603,0.00013090685,0.9867856,0.0077071777,0.000012406907],"about_ca_topic_score_codex":0.0019946035,"about_ca_topic_score_gemma":0.002264864,"teacher_disagreement_score":0.021486992,"about_ca_system_score_codex":0.0020734852,"about_ca_system_score_gemma":0.00066915114,"threshold_uncertainty_score":0.071881175},"labels":[],"label_agreement":null},{"id":"W2401243555","doi":"","title":"A sufficient condition for a graph to be fractional (a, b, n)-critical deleted graph.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics; Discrete mathematics","score_opus":0.050684068179913,"score_gpt":0.3378844152356486,"score_spread":0.2872003470557356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401243555","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6342454,0.0012387497,0.12007795,0.006499389,0.0014125727,0.0004096753,0.0046614744,0.0017284794,0.22972633],"genre_scores_gemma":[0.9528322,0.00035515457,0.033977877,0.0010910118,0.0002920018,0.0002497657,0.0025088808,0.00019067648,0.008502452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911433,0.00015859146,0.000093644485,0.00029399837,0.00013817853,0.00020131929],"domain_scores_gemma":[0.9921077,0.0037332107,0.0006700555,0.000650919,0.0013173412,0.0015206671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096719095,0.00046024055,0.0008373465,0.0017200197,0.0033408136,0.0022869916,0.0010680167,0.0028737655,0.013873751],"category_scores_gemma":[0.012067312,0.0006139723,0.0008153734,0.00085476495,0.0024590995,0.004032539,0.0020817213,0.002195061,0.0026444497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007441732,0.00023776699,0.0049938583,0.00044392224,0.000056612113,0.0026338305,0.0010660714,0.003289048,0.028692309,0.926998,0.019683922,0.011160416],"study_design_scores_gemma":[0.00026062594,0.00018889846,0.0035515402,0.00024405932,0.00007943307,0.0032396684,0.0018274555,0.01421552,0.015901938,0.92451715,0.035856612,0.00011710552],"about_ca_topic_score_codex":0.0018334473,"about_ca_topic_score_gemma":0.0022840775,"teacher_disagreement_score":0.013873751,"about_ca_system_score_codex":0.00085905776,"about_ca_system_score_gemma":0.0016913837,"threshold_uncertainty_score":0.04641235},"labels":[],"label_agreement":null},{"id":"W2401251957","doi":"","title":"Enumeration for no-trivial spanning forests of complete bipartite graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Enumeration; Combinatorics; Spanning tree; Discrete mathematics; Graph","score_opus":0.02250903153387597,"score_gpt":0.2956067320429401,"score_spread":0.2730977005090641,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401251957","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22390302,0.002184919,0.6550946,0.0035191064,0.00040136557,0.0002479488,0.002964093,0.0014872547,0.11019766],"genre_scores_gemma":[0.74655294,0.0014130058,0.20845948,0.00093381107,0.0003444836,0.0003068398,0.005737521,0.00044698478,0.0358049],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990453,0.00031617758,0.000065703185,0.00018115558,0.00021683802,0.00017473525],"domain_scores_gemma":[0.99586356,0.00267993,0.0002742983,0.0005665042,0.00032927474,0.0002862901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007649004,0.0004679122,0.0005941939,0.0012088756,0.0013944854,0.0020985233,0.0013965134,0.0011954068,0.011343973],"category_scores_gemma":[0.0072664986,0.0005566879,0.00084686506,0.0015409008,0.0009599087,0.004618731,0.0018768231,0.0019751687,0.001985425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022854017,0.00025354067,0.0024932048,0.00062560826,0.0000642329,0.00035904118,0.0005288135,0.011370503,0.004683867,0.82117546,0.029023727,0.12919348],"study_design_scores_gemma":[0.000021850587,0.000018083118,0.00049436965,0.000058671943,0.000024309602,0.00036384963,0.00014405417,0.029667346,0.0010635207,0.96159756,0.0065347473,0.000011598508],"about_ca_topic_score_codex":0.0008405029,"about_ca_topic_score_gemma":0.0024903433,"teacher_disagreement_score":0.011343973,"about_ca_system_score_codex":0.00065226085,"about_ca_system_score_gemma":0.0007271646,"threshold_uncertainty_score":0.037949443},"labels":[],"label_agreement":null},{"id":"W2401272786","doi":"","title":"A family of tetravalent Frobenius graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.006307893223515486,"score_gpt":0.1901866286951752,"score_spread":0.1838787354716597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401272786","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5777359,0.0016406345,0.1290754,0.0019067072,0.00043375228,0.00014355445,0.0012667121,0.0007495562,0.2870478],"genre_scores_gemma":[0.9355067,0.0006649294,0.017167544,0.0003293355,0.00008058558,0.0000769041,0.0006911765,0.00010017624,0.04538262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99981946,0.000025701394,0.000005984236,0.000048699705,0.000051399773,0.000048791422],"domain_scores_gemma":[0.9995504,0.00012834393,0.00007698033,0.000074744,0.000078158366,0.000091370464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017738045,0.00027565152,0.00023729294,0.0014403838,0.0012996602,0.0009933331,0.00049199566,0.00064252625,0.012194386],"category_scores_gemma":[0.0010151525,0.00024296282,0.00030782993,0.00069831853,0.0007934545,0.0011626104,0.00086473714,0.00084727997,0.0012258593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006382922,0.00002760614,0.0009408201,0.000056596928,0.000016128923,0.00043911563,0.00036734738,0.0018510349,0.0034613577,0.96473897,0.0069524255,0.021084795],"study_design_scores_gemma":[0.000042962252,0.00006405027,0.002730502,0.00007923301,0.000023903065,0.0025671164,0.00061662047,0.016533235,0.0035673426,0.90854275,0.065191045,0.00004130304],"about_ca_topic_score_codex":0.0009587965,"about_ca_topic_score_gemma":0.001225254,"teacher_disagreement_score":0.012194386,"about_ca_system_score_codex":0.0006710421,"about_ca_system_score_gemma":0.00033839227,"threshold_uncertainty_score":0.040794313},"labels":[],"label_agreement":null},{"id":"W2401274613","doi":"","title":"Note on the nullity of bicyclic graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.027926279225377024,"score_gpt":0.2971773291335698,"score_spread":0.26925104990819276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401274613","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11428187,0.022223711,0.08900622,0.054372843,0.010034506,0.00008038636,0.0018024142,0.0006299073,0.7075681],"genre_scores_gemma":[0.9076725,0.0126869045,0.026864799,0.009599836,0.0042538606,0.00008023682,0.0010051306,0.0002706875,0.037565935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885905,0.00030177456,0.00004941259,0.00024608662,0.0003934137,0.0001502068],"domain_scores_gemma":[0.9889677,0.007596788,0.0005045134,0.0012104074,0.0009711038,0.00074949546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015100813,0.0006564307,0.0010429785,0.0021046104,0.0023511292,0.002805064,0.0017064363,0.0014359505,0.015329599],"category_scores_gemma":[0.009702426,0.00038028363,0.0005765191,0.002115342,0.0067923926,0.0052674618,0.0034792079,0.0040555317,0.0016182415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056881316,0.000018426605,0.00041689325,0.00013773887,0.000014894989,0.0002376542,0.00021164188,0.00032610397,0.00076749,0.9732367,0.017635513,0.0069400957],"study_design_scores_gemma":[0.000010842869,0.000021069343,0.0004230918,0.000046981382,0.000015696323,0.00041120447,0.0001409082,0.0006146866,0.0004588144,0.96938133,0.028456775,0.000018749204],"about_ca_topic_score_codex":0.0015267587,"about_ca_topic_score_gemma":0.0017357087,"teacher_disagreement_score":0.015329599,"about_ca_system_score_codex":0.0008915077,"about_ca_system_score_gemma":0.0006165575,"threshold_uncertainty_score":0.051282644},"labels":[],"label_agreement":null},{"id":"W2401287820","doi":"","title":"Height Probabilities in the Abelian Sandpile Model on the Generalized Trees.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Abelian sandpile model; Mathematics; Abelian group; Pure mathematics; Statistics; Statistical physics; Physics","score_opus":0.022162309184406755,"score_gpt":0.2299046754076468,"score_spread":0.20774236622324005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401287820","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7919188,0.0008873988,0.17270201,0.0028348868,0.000110320085,0.00008159052,0.001121081,0.0007298889,0.029614002],"genre_scores_gemma":[0.98140717,0.0003580336,0.011602978,0.0001782848,0.00015104045,0.000055621094,0.00042597315,0.0001220717,0.005698822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877065,0.00041539545,0.00004979587,0.0001855474,0.00026915007,0.00030944523],"domain_scores_gemma":[0.99064976,0.0053672884,0.001284662,0.0011991325,0.000543383,0.0009558404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019218122,0.00050381076,0.0013863457,0.0026188528,0.0019965607,0.0040793777,0.002126207,0.0020478112,0.008825951],"category_scores_gemma":[0.013804171,0.00067643984,0.0007616099,0.0019430713,0.0033400962,0.0073001646,0.0026359465,0.0022938552,0.0008020931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007212363,0.000032808035,0.0014249755,0.00003980812,0.000015217672,0.00016857065,0.00019252383,0.012445285,0.00058286026,0.9785186,0.0020106693,0.0044965744],"study_design_scores_gemma":[0.000022350596,0.000013762083,0.0008032667,0.000018314819,0.0000148823465,0.00014545149,0.00012159871,0.103919335,0.00035518312,0.8935731,0.0009887349,0.000024049545],"about_ca_topic_score_codex":0.0040411586,"about_ca_topic_score_gemma":0.004842805,"teacher_disagreement_score":0.008825951,"about_ca_system_score_codex":0.0017446473,"about_ca_system_score_gemma":0.0010732362,"threshold_uncertainty_score":0.029525757},"labels":[],"label_agreement":null},{"id":"W2401300893","doi":"","title":"On two types of (2, k)-distance Lucas numbers.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Lucas number; Lucas sequence; Combinatorics; Fibonacci number; Fibonacci polynomials; Difference polynomials","score_opus":0.0059556248698900685,"score_gpt":0.263778302223478,"score_spread":0.25782267735358794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401300893","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40531173,0.0038859656,0.1015355,0.004922749,0.0026822907,0.0001430671,0.0010529456,0.00058882026,0.47987705],"genre_scores_gemma":[0.8942175,0.001022974,0.027963389,0.00071064226,0.0003971255,0.000114301256,0.00060176785,0.00019239497,0.07477995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890506,0.00020362195,0.00007687438,0.00017816339,0.0003692156,0.0002669995],"domain_scores_gemma":[0.99831855,0.00058430014,0.00032664026,0.0002287921,0.00028491512,0.0002567837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045770974,0.0007159157,0.0006030219,0.0027664339,0.0026726895,0.0041013,0.0011650615,0.0023952457,0.017698374],"category_scores_gemma":[0.0046262257,0.00051939196,0.00064682314,0.0021378552,0.0035337834,0.005885051,0.0034998115,0.0020587642,0.0033521433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006274555,0.000009513785,0.00023463156,0.000044335946,0.000003640455,0.00018890467,0.00026412713,0.00034034587,0.00058160187,0.9904315,0.0026169377,0.0052216756],"study_design_scores_gemma":[0.000046421355,0.000037382866,0.0007525852,0.00008050286,0.000012341571,0.00074730744,0.000559519,0.0023296743,0.00088867074,0.96415704,0.030334724,0.000053811207],"about_ca_topic_score_codex":0.0008836662,"about_ca_topic_score_gemma":0.0013934976,"teacher_disagreement_score":0.017698374,"about_ca_system_score_codex":0.0018830139,"about_ca_system_score_gemma":0.0006079383,"threshold_uncertainty_score":0.059206963},"labels":[],"label_agreement":null},{"id":"W2401307802","doi":"","title":"On a conjecture about (k, t)-choosability.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Pure mathematics","score_opus":0.014434061544688868,"score_gpt":0.28404950869866713,"score_spread":0.2696154471539783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401307802","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31209332,0.0033808674,0.21447694,0.062805936,0.0026536416,0.00017198312,0.0034637174,0.0013315789,0.39962196],"genre_scores_gemma":[0.9412993,0.0017311663,0.021044727,0.0057075103,0.0011506424,0.00014993279,0.002145236,0.00026018624,0.026511377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983152,0.0003481406,0.00011809943,0.0005035495,0.00030619605,0.00040888737],"domain_scores_gemma":[0.982381,0.012500451,0.00079734955,0.002504652,0.0009029189,0.00091364497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002284599,0.00042357112,0.0010202281,0.00094666024,0.002808203,0.005061158,0.0018691755,0.0040676314,0.02315331],"category_scores_gemma":[0.017140266,0.00051713025,0.0015777594,0.0024755946,0.0064996122,0.013148721,0.00418753,0.004746006,0.0026201585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020142722,0.000045612396,0.0011308577,0.00010742497,0.000020415162,0.00021540253,0.00037244282,0.0019702038,0.00078428286,0.9710576,0.014732114,0.009362248],"study_design_scores_gemma":[0.0000388604,0.000022068647,0.0005287197,0.00002298232,0.000012479396,0.00019547755,0.00015561157,0.002202653,0.00031310625,0.9922472,0.004247282,0.000013433368],"about_ca_topic_score_codex":0.0024582292,"about_ca_topic_score_gemma":0.0021458238,"teacher_disagreement_score":0.02315331,"about_ca_system_score_codex":0.001829166,"about_ca_system_score_gemma":0.0010983256,"threshold_uncertainty_score":0.07745552},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Sierpinski triangle; Metric (unit); Combinatorics; Discrete mathematics; Mathematical analysis; Fractal; Business; Marketing","score_opus":0.01289290419295852,"score_gpt":0.20763990689310174,"score_spread":0.19474700270014322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401313454","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65600914,0.005472433,0.14854015,0.0055732583,0.0004191606,0.00013143341,0.0023997964,0.00044761936,0.18100709],"genre_scores_gemma":[0.96048665,0.0018523311,0.02568839,0.00055251154,0.00036195735,0.00014342455,0.0010823873,0.00012767408,0.00970471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911886,0.00032144226,0.00005508383,0.00014763596,0.00020148711,0.00015544554],"domain_scores_gemma":[0.9949882,0.002740377,0.0008541013,0.00035928175,0.00037564282,0.00068237487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010148305,0.00065198116,0.00074217044,0.0028179649,0.001763154,0.0031119299,0.0012270194,0.001267333,0.00650556],"category_scores_gemma":[0.0069726217,0.00044596044,0.0006067002,0.0027729361,0.0025580868,0.005416499,0.0019112988,0.0019450301,0.0008396739],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006023248,0.00003338328,0.001050851,0.00009095128,0.00001508438,0.00007918618,0.00018872702,0.0032277645,0.0010074944,0.97942996,0.004615394,0.01020092],"study_design_scores_gemma":[0.000017594823,0.000038973554,0.0019033334,0.00003829829,0.000017378,0.00027570562,0.00024041234,0.013826967,0.00062855304,0.97668296,0.006297347,0.000032484095],"about_ca_topic_score_codex":0.0014322761,"about_ca_topic_score_gemma":0.0019364762,"teacher_disagreement_score":0.00650556,"about_ca_system_score_codex":0.0015646011,"about_ca_system_score_gemma":0.0005923637,"threshold_uncertainty_score":0.021763206},"labels":[],"label_agreement":null},{"id":"W2401317033","doi":"","title":"The adjacent vertex-distinguishing total chromatic number of 1-tree.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Chromatic scale; Combinatorics; Tree (set theory); Graph","score_opus":0.00869605042671837,"score_gpt":0.23651285122105303,"score_spread":0.22781680079433467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401317033","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7905044,0.0011926502,0.06706503,0.0035873153,0.00033764998,0.00008303943,0.0028531593,0.00042465248,0.13395216],"genre_scores_gemma":[0.9690598,0.00048350188,0.018074043,0.00030284113,0.00015663914,0.00007243393,0.0012349256,0.00012927531,0.010486551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992036,0.00018118636,0.00003086933,0.00023091095,0.00014894662,0.0002045904],"domain_scores_gemma":[0.99585307,0.0025147214,0.00043440604,0.00044028013,0.00029195502,0.00046570174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096285634,0.00048173167,0.0006032282,0.0018749438,0.0022149172,0.003225072,0.0019314694,0.0012532156,0.012062203],"category_scores_gemma":[0.005380085,0.00040921566,0.0005032091,0.0019100723,0.002433471,0.0051427623,0.0017191219,0.0020332413,0.0010214015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046420068,0.000081116195,0.0039648414,0.00022853148,0.00003270537,0.00009454492,0.00040096114,0.011140732,0.0056872754,0.9390192,0.01454126,0.024344575],"study_design_scores_gemma":[0.00006432596,0.000053207656,0.0030882284,0.000052219595,0.000061685416,0.00036209682,0.00034233843,0.0401846,0.003828008,0.9420843,0.009839542,0.00003938465],"about_ca_topic_score_codex":0.002325447,"about_ca_topic_score_gemma":0.0030072525,"teacher_disagreement_score":0.012062203,"about_ca_system_score_codex":0.0025059376,"about_ca_system_score_gemma":0.0010217077,"threshold_uncertainty_score":0.040352046},"labels":[],"label_agreement":null},{"id":"W2401333936","doi":"","title":"A Note On Edge-Cover Coloring Of Nearly Bipartite Graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Edge coloring; Enhanced Data Rates for GSM Evolution; Cover (algebra); Combinatorics; Complete bipartite graph; Graph; Computer science; Artificial intelligence; Line graph; Graph power","score_opus":0.01273633057090452,"score_gpt":0.23664707564287363,"score_spread":0.22391074507196912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401333936","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03645045,0.026184319,0.5071947,0.040815134,0.021502849,0.0002610854,0.002384887,0.0019332642,0.36327326],"genre_scores_gemma":[0.42823163,0.03844063,0.40147355,0.018308522,0.017684562,0.0004520974,0.0025719157,0.0015166822,0.09132044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988532,0.00034591855,0.000047283465,0.00025529237,0.00035837977,0.00013987346],"domain_scores_gemma":[0.99560934,0.0031104034,0.00012394431,0.0006134633,0.0002538583,0.00028900456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014812441,0.0010563924,0.0012732642,0.0017133858,0.0022423686,0.0026049998,0.0025914626,0.001694125,0.0122291725],"category_scores_gemma":[0.0063219443,0.000717472,0.0011439697,0.0033992636,0.0026845313,0.005654538,0.0029160536,0.0060753045,0.0024921978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019075414,0.00013764123,0.0010186462,0.0006312607,0.00006751651,0.0005034503,0.00028490482,0.009506266,0.0036578458,0.7529161,0.16290337,0.068182275],"study_design_scores_gemma":[0.000022055574,0.0000431395,0.0008546188,0.000104136714,0.000034583914,0.00039050137,0.00014647335,0.016094884,0.0012204639,0.8781093,0.10293765,0.000042202508],"about_ca_topic_score_codex":0.0045074085,"about_ca_topic_score_gemma":0.007529443,"teacher_disagreement_score":0.0122291725,"about_ca_system_score_codex":0.0020788398,"about_ca_system_score_gemma":0.0009883064,"threshold_uncertainty_score":0.04091066},"labels":[],"label_agreement":null},{"id":"W2401335725","doi":"","title":"On Steiner Quasigroups of Cardinality 21.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cardinality (data modeling); Steiner tree problem; Discrete mathematics; Combinatorics; Computer science; Database","score_opus":0.01652467190206451,"score_gpt":0.2523126097934455,"score_spread":0.23578793789138097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401335725","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5403075,0.0027875977,0.13041036,0.0037377456,0.00093515945,0.0001362405,0.001162253,0.00040823536,0.32011494],"genre_scores_gemma":[0.9058977,0.0014894396,0.029431252,0.000718101,0.0007485731,0.00011747481,0.0014024146,0.0002206993,0.059974384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915683,0.0002729101,0.000049410824,0.000093995004,0.00019266596,0.00023414633],"domain_scores_gemma":[0.9985122,0.0007004807,0.0002504852,0.00018370086,0.00014587268,0.00020738087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010524617,0.00063607027,0.0006806805,0.001961302,0.0024688141,0.0017802456,0.0005827056,0.0008676258,0.016136762],"category_scores_gemma":[0.0022563557,0.00041171524,0.00090723933,0.0012819854,0.002746918,0.005156413,0.0034714427,0.0015600118,0.0021306167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008411624,0.000020001376,0.000304983,0.0000391655,0.000009374332,0.00013998325,0.00031920394,0.0008273841,0.0008966419,0.98927236,0.0026493743,0.0054373974],"study_design_scores_gemma":[0.000020530531,0.000027910208,0.00035287277,0.000026328811,0.0000099331055,0.00017182842,0.00024971267,0.0018052788,0.00043921755,0.9898031,0.0070800995,0.0000130501],"about_ca_topic_score_codex":0.0007531278,"about_ca_topic_score_gemma":0.0013756406,"teacher_disagreement_score":0.016136762,"about_ca_system_score_codex":0.0012654136,"about_ca_system_score_gemma":0.00054743805,"threshold_uncertainty_score":0.053982854},"labels":[],"label_agreement":null},{"id":"W2401340327","doi":"","title":"Optimal orientations of P 3 x K 5 and C 8 x K 3 .","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"X-ray Diffraction in Crystallography","field":"Materials Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.02351121086301789,"score_gpt":0.27922017288555556,"score_spread":0.2557089620225377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401340327","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6197865,0.0015943653,0.097893566,0.0027786463,0.0011271074,0.00016989557,0.0017222596,0.001252327,0.2736752],"genre_scores_gemma":[0.94156134,0.00057503505,0.0421723,0.00024701213,0.00003957191,0.000106646476,0.00071255025,0.00045764825,0.014127905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998142,0.00003874436,0.000009737492,0.000031117866,0.00004437985,0.00006181148],"domain_scores_gemma":[0.99981934,0.000028978233,0.000032737924,0.000030791474,0.000030020472,0.000058150767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019629285,0.00042059107,0.00029347325,0.0007841771,0.0010282408,0.001100741,0.00055289664,0.00059118436,0.016187213],"category_scores_gemma":[0.00076304754,0.00025190774,0.00021669154,0.00046083733,0.00073771254,0.0008338375,0.0006559645,0.0008689566,0.0022086378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001018684,0.00013254194,0.0012277717,0.000263609,0.0000174284,0.00039094305,0.00026717075,0.012315021,0.024350174,0.8958861,0.023268893,0.04086169],"study_design_scores_gemma":[0.00039267575,0.00017212499,0.001862229,0.00014357625,0.00003957961,0.0003950568,0.0010627594,0.05301396,0.03255793,0.83641315,0.07384708,0.00009991439],"about_ca_topic_score_codex":0.0015923126,"about_ca_topic_score_gemma":0.0040282514,"teacher_disagreement_score":0.016187213,"about_ca_system_score_codex":0.000742746,"about_ca_system_score_gemma":0.001056496,"threshold_uncertainty_score":0.054151654},"labels":[],"label_agreement":null},{"id":"W2401347502","doi":"","title":"The Fibonacci Length of Amalgamated Free Products of Dihedral Groups.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Mathematics; Dihedral group; Dihedral angle; Combinatorics; Group (periodic table); Chemistry","score_opus":0.006447789853652824,"score_gpt":0.22792743298263285,"score_spread":0.22147964312898002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401347502","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44910333,0.006545091,0.13112973,0.002488131,0.0018970075,0.00011438979,0.0017952442,0.00053588545,0.4063912],"genre_scores_gemma":[0.92778057,0.0012690151,0.0330233,0.0006536462,0.0006191042,0.0001801885,0.00085100695,0.00022398552,0.035399184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925965,0.00014485951,0.00006777751,0.00013616003,0.00024492614,0.00014667655],"domain_scores_gemma":[0.99772316,0.0010968334,0.0003141881,0.00023518906,0.0003701038,0.0002604957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010649124,0.000670748,0.0006195295,0.003277022,0.0021971515,0.0040727556,0.00092029566,0.0011497035,0.013204156],"category_scores_gemma":[0.005034508,0.00051253015,0.00050845015,0.0014986171,0.0023924978,0.0048124674,0.0017198471,0.0014860483,0.0032001066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006498034,0.000012904835,0.0004541915,0.000047822516,0.000009224509,0.000067226465,0.00020983294,0.00039456345,0.0010437651,0.9803996,0.0025308197,0.014765106],"study_design_scores_gemma":[0.000011167753,0.00002568077,0.00053873734,0.000034172634,0.0000118042635,0.00018311113,0.000092537884,0.0015026543,0.0010557424,0.9855326,0.010989487,0.00002213842],"about_ca_topic_score_codex":0.0008714558,"about_ca_topic_score_gemma":0.0013270892,"teacher_disagreement_score":0.013204156,"about_ca_system_score_codex":0.0011844052,"about_ca_system_score_gemma":0.00070456613,"threshold_uncertainty_score":0.044172287},"labels":[],"label_agreement":null},{"id":"W2401364797","doi":"","title":"Extremal Schultz Index Of Acyclic Molecular Graphs With Diameter 4.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"History and advancements in chemistry","field":"Chemistry","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Combinatorics; Statistics; Computer science","score_opus":0.008944844884106401,"score_gpt":0.23024979642900015,"score_spread":0.22130495154489374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401364797","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8202269,0.0020192629,0.035468493,0.0021535372,0.0002588655,0.000048127033,0.0015214552,0.0004138273,0.13788968],"genre_scores_gemma":[0.9791894,0.00063516153,0.0065212143,0.00020627814,0.00019640278,0.00006495927,0.00054593856,0.00010521429,0.012535331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997062,0.00007452033,0.000013834301,0.00005306331,0.00007648035,0.000075801196],"domain_scores_gemma":[0.99764,0.0012755707,0.00042081875,0.00020107647,0.00014829618,0.00031434445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005422118,0.00041204976,0.00061047246,0.0022438222,0.0010906724,0.0019315593,0.0010246758,0.0008638181,0.009848628],"category_scores_gemma":[0.0037377512,0.00023420548,0.00029761976,0.00091509614,0.0011860823,0.0027730574,0.0013311445,0.0011066514,0.0010991152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018140355,0.000036053854,0.0009473635,0.000112798436,0.000018032557,0.00009647978,0.00015235248,0.0069048745,0.0020206633,0.9726748,0.0062311045,0.010624017],"study_design_scores_gemma":[0.000028652848,0.00003054056,0.0013306995,0.000031629785,0.000019680705,0.00017919083,0.000107961816,0.029566353,0.0014843625,0.96089935,0.0062969876,0.000024663179],"about_ca_topic_score_codex":0.00059609464,"about_ca_topic_score_gemma":0.0010994127,"teacher_disagreement_score":0.009848628,"about_ca_system_score_codex":0.001312959,"about_ca_system_score_gemma":0.00048834126,"threshold_uncertainty_score":0.032946944},"labels":[],"label_agreement":null},{"id":"W2401368837","doi":"","title":"On the Product Summation of Ordered Partition.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Partition (number theory); Product (mathematics); Summation by parts; Combinatorics; Pure mathematics; Geometry","score_opus":0.03147847319684973,"score_gpt":0.2974865996607976,"score_spread":0.2660081264639479,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401368837","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11981749,0.00733214,0.30598673,0.004297498,0.003935609,0.0000803262,0.0006132095,0.0006445888,0.5572924],"genre_scores_gemma":[0.76381785,0.0044977316,0.08897307,0.0021988363,0.0035368844,0.00024738678,0.00092913536,0.0010435715,0.13475555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988869,0.00035675705,0.00005337775,0.00014165638,0.00038724244,0.00017417021],"domain_scores_gemma":[0.9987048,0.00042425378,0.00012295808,0.00021955174,0.00030667448,0.00022177228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017417256,0.0008273102,0.0012186145,0.0027571137,0.0025055099,0.0031686,0.00136142,0.0010720682,0.012034148],"category_scores_gemma":[0.0044152625,0.0004592696,0.0008994679,0.001638254,0.0029868775,0.008081111,0.0029751952,0.0023674176,0.0037401326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000679914,0.000005323876,0.00004327135,0.000017310827,0.0000027222886,0.000024563064,0.000050428738,0.0001320347,0.00014866792,0.99541926,0.0018986795,0.002250984],"study_design_scores_gemma":[0.0000034614186,0.0000047655503,0.00007113172,0.000010648598,0.0000030045605,0.000072641895,0.000022905533,0.0020199667,0.00010849654,0.99465996,0.0030179329,0.0000049973128],"about_ca_topic_score_codex":0.0010507731,"about_ca_topic_score_gemma":0.0019722052,"teacher_disagreement_score":0.012034148,"about_ca_system_score_codex":0.001233577,"about_ca_system_score_gemma":0.00081607566,"threshold_uncertainty_score":0.04025823},"labels":[],"label_agreement":null},{"id":"W2401374150","doi":"","title":"Generalized F-nomial matrix and factorizations","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Matrix (chemical analysis); Chemistry","score_opus":0.010298628891245422,"score_gpt":0.24008368884521344,"score_spread":0.22978505995396803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401374150","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14457314,0.002025815,0.5885665,0.003454883,0.002033653,0.00016990874,0.0015736793,0.0010230424,0.25657943],"genre_scores_gemma":[0.7582455,0.0010699527,0.12548518,0.0010235015,0.0016797392,0.00014339366,0.0009928636,0.00035865087,0.11100128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988096,0.00024272631,0.0000672049,0.00031378632,0.00033100936,0.00023580604],"domain_scores_gemma":[0.9988128,0.00026282348,0.00014663991,0.0002674894,0.00030935855,0.00020089783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001024464,0.00094013516,0.0010081433,0.0023393198,0.0027113135,0.0033199198,0.001334854,0.0009801507,0.024674281],"category_scores_gemma":[0.002693043,0.00043489385,0.0016149938,0.001866496,0.0029745756,0.005963923,0.0017897264,0.0024470345,0.0042703343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021867007,0.000010783718,0.00005891094,0.000022846838,0.0000055393057,0.00006189477,0.00013462863,0.00022360487,0.00041051797,0.99180377,0.0020160947,0.0052294293],"study_design_scores_gemma":[0.0000065294207,0.000009706732,0.000105194755,0.000008813083,0.0000055970236,0.00016773818,0.00005773175,0.0016080008,0.00034830836,0.98937714,0.008287251,0.000018129998],"about_ca_topic_score_codex":0.0013004929,"about_ca_topic_score_gemma":0.0016337282,"teacher_disagreement_score":0.024674281,"about_ca_system_score_codex":0.0011643847,"about_ca_system_score_gemma":0.0007523012,"threshold_uncertainty_score":0.08254367},"labels":[],"label_agreement":null},{"id":"W2401403958","doi":"","title":"Upper embeddable graphs via the degree-sum of adjacent vertices.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Degree (music); Physics","score_opus":0.021763697373662544,"score_gpt":0.27377275107005056,"score_spread":0.25200905369638804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401403958","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3661561,0.0011927331,0.42800558,0.0013322913,0.00037616686,0.000092845636,0.00094356097,0.000929418,0.20097132],"genre_scores_gemma":[0.857923,0.00086645805,0.08774688,0.0003911253,0.00024208876,0.0000915317,0.0009190783,0.00040299442,0.05141679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992525,0.00014461209,0.000038209208,0.00018172077,0.00024431455,0.00013856425],"domain_scores_gemma":[0.99770963,0.0012042888,0.00024216066,0.00047666146,0.00014378117,0.00022350434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041759314,0.0007554902,0.00061141106,0.0014784856,0.0012107793,0.0027632115,0.0014429773,0.00089566177,0.014354461],"category_scores_gemma":[0.0035936402,0.000624085,0.00058932055,0.0012790863,0.0015018437,0.004972913,0.0029482057,0.0024153292,0.0023697002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012559538,0.000094304625,0.00078175357,0.0001012996,0.000025930161,0.0003366599,0.00046149222,0.010283333,0.0072256476,0.9303758,0.0045580086,0.045630146],"study_design_scores_gemma":[0.000014526859,0.000025094823,0.00061281567,0.000037133505,0.000030382496,0.00028802254,0.00013400374,0.020127533,0.0035169101,0.9664991,0.008699063,0.000015321619],"about_ca_topic_score_codex":0.0006728496,"about_ca_topic_score_gemma":0.0017939943,"teacher_disagreement_score":0.014354461,"about_ca_system_score_codex":0.0007216608,"about_ca_system_score_gemma":0.00026627877,"threshold_uncertainty_score":0.048020482},"labels":[],"label_agreement":null},{"id":"W2401418612","doi":"","title":"The Spectral Radius of Maximum Weighted Unicyclic Graph.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; Graph; Combinatorics; Eigenvalues and eigenvectors; Physics; Quantum mechanics","score_opus":0.01432290461623151,"score_gpt":0.2584619999347652,"score_spread":0.2441390953185337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401418612","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63146305,0.0064981184,0.1813809,0.0030536077,0.00066281564,0.00009109418,0.0018616905,0.0006168524,0.17437184],"genre_scores_gemma":[0.97676814,0.0019830074,0.013193142,0.00022339386,0.00030042732,0.00010756166,0.00041931955,0.00012624449,0.006878719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935764,0.00024159152,0.000027485188,0.00013560886,0.0001371816,0.00010039541],"domain_scores_gemma":[0.9961494,0.00210349,0.00061808707,0.0002649463,0.00039932627,0.00046466893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058904145,0.0005645706,0.000751663,0.002829533,0.0008216998,0.0016452811,0.0011729398,0.00088126183,0.0054005138],"category_scores_gemma":[0.008639125,0.0003189061,0.0002866485,0.0016142128,0.0014871301,0.0027845826,0.0017045537,0.0008975048,0.001409755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021671336,0.00003288346,0.0012453486,0.00023959062,0.000040150266,0.00015368011,0.00030866457,0.010606607,0.0058330228,0.94439083,0.011245999,0.025686525],"study_design_scores_gemma":[0.000026469956,0.000043051605,0.0015095719,0.00008597755,0.00003601916,0.00054715347,0.00033238955,0.06140015,0.0031795606,0.921376,0.011432547,0.000031007254],"about_ca_topic_score_codex":0.0007094746,"about_ca_topic_score_gemma":0.00054743234,"teacher_disagreement_score":0.0054005138,"about_ca_system_score_codex":0.0007822817,"about_ca_system_score_gemma":0.00030528664,"threshold_uncertainty_score":0.018066525},"labels":[],"label_agreement":null},{"id":"W2401422031","doi":"","title":"Maximum packing of dt - p and dtu p with mendelsohn triples","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.006313744226266193,"score_gpt":0.18564042764562397,"score_spread":0.17932668341935779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401422031","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.513182,0.0015139696,0.3030764,0.0016819783,0.0004362358,0.00021086214,0.002594266,0.0008709038,0.17643334],"genre_scores_gemma":[0.8602544,0.00069244305,0.11076261,0.0003217733,0.00017495076,0.00020540413,0.0021630328,0.00032896502,0.02509643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990363,0.0002485869,0.00007304046,0.00017230447,0.00022456286,0.0002451464],"domain_scores_gemma":[0.99770504,0.0011394001,0.00025174607,0.00044626865,0.0001992315,0.0002582817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064426713,0.0007221599,0.0013213565,0.0019527039,0.002810717,0.0030373689,0.0012980569,0.0016168407,0.012085409],"category_scores_gemma":[0.005374067,0.00087335316,0.0008386328,0.0031796165,0.0012189739,0.003406026,0.0023268978,0.0014968123,0.0014289103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048339716,0.00012951581,0.0012364775,0.000277059,0.000050814113,0.00072541815,0.00052258384,0.027218856,0.0048140725,0.905547,0.013056157,0.04593865],"study_design_scores_gemma":[0.000056583063,0.00007083771,0.0007511467,0.000072807314,0.00003301191,0.0007126134,0.00032169482,0.072443075,0.0040004384,0.91135967,0.0101451045,0.00003314633],"about_ca_topic_score_codex":0.0017924844,"about_ca_topic_score_gemma":0.0019814398,"teacher_disagreement_score":0.012085409,"about_ca_system_score_codex":0.0012953386,"about_ca_system_score_gemma":0.00073825824,"threshold_uncertainty_score":0.04042971},"labels":[],"label_agreement":null},{"id":"W2401454933","doi":"","title":"Up-embeddability and independent number of simple graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Simple (philosophy); Combinatorics; Discrete mathematics","score_opus":0.02679606737701527,"score_gpt":0.2976182622539376,"score_spread":0.27082219487692233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401454933","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7488613,0.0014256954,0.097615786,0.0016065319,0.00029230487,0.000084762614,0.0008217908,0.00041281903,0.14887908],"genre_scores_gemma":[0.9789601,0.0004683764,0.0080875335,0.00012210595,0.0001861643,0.000042249507,0.00048053425,0.00006396817,0.011589058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993474,0.0001389832,0.000035078676,0.00017421214,0.00018297942,0.000121382946],"domain_scores_gemma":[0.9938114,0.003563956,0.0008923666,0.0007559172,0.00032882477,0.0006475645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048621112,0.0004363552,0.00053681544,0.0018578714,0.0014067468,0.0026684033,0.0010098352,0.0007265893,0.010189972],"category_scores_gemma":[0.0057279514,0.00048082884,0.00060599775,0.0013229764,0.0027139927,0.0049322904,0.0019007716,0.0020175944,0.00097264955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016289069,0.00010413894,0.0032644786,0.0001457199,0.00003896397,0.0003587334,0.00046471346,0.002907942,0.004272841,0.95682746,0.0037878025,0.027664395],"study_design_scores_gemma":[0.00002444748,0.000028776354,0.0025153852,0.000023606464,0.00003260922,0.0004631,0.00015554317,0.0054033888,0.003086812,0.9844861,0.003765014,0.000015225877],"about_ca_topic_score_codex":0.00043986726,"about_ca_topic_score_gemma":0.0007273919,"teacher_disagreement_score":0.010189972,"about_ca_system_score_codex":0.000639108,"about_ca_system_score_gemma":0.00030832278,"threshold_uncertainty_score":0.03408891},"labels":[],"label_agreement":null},{"id":"W2401456693","doi":"","title":"On the Crossing Numbers of the k-th Power of P n .","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Path (computing); Graph; Crossing number (knot theory); Join (topology); Discrete mathematics","score_opus":0.013496781498378328,"score_gpt":0.27951284807187704,"score_spread":0.2660160665734987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401456693","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65262216,0.003733759,0.16916654,0.0012845708,0.0005651607,0.00011453567,0.0007103443,0.00032430675,0.17147867],"genre_scores_gemma":[0.93405086,0.0019865287,0.053492792,0.00017214096,0.00019426599,0.00009680243,0.00038213516,0.0001486696,0.00947578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905187,0.00024208718,0.00004532168,0.00023870019,0.00023914725,0.00018277585],"domain_scores_gemma":[0.9960807,0.0024600748,0.0005650253,0.00029995007,0.00025887662,0.0003354948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010444352,0.00066187343,0.00036286513,0.0018594594,0.00093494926,0.002244338,0.0007580175,0.0007149881,0.010346954],"category_scores_gemma":[0.008621736,0.00040641363,0.0003115352,0.0017266169,0.0016090478,0.0036471288,0.0009265159,0.0014573421,0.0012421368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006298013,0.000115246134,0.0054009114,0.00025891338,0.000055643042,0.0004741925,0.0005312388,0.040848516,0.013537943,0.81326807,0.009667721,0.11521172],"study_design_scores_gemma":[0.00007722987,0.00022744888,0.0059210956,0.000168618,0.000074295975,0.0014086997,0.00047335593,0.076825246,0.01175106,0.8740334,0.028957814,0.0000817789],"about_ca_topic_score_codex":0.00046460395,"about_ca_topic_score_gemma":0.0007260754,"teacher_disagreement_score":0.010346954,"about_ca_system_score_codex":0.0011694863,"about_ca_system_score_gemma":0.0003890351,"threshold_uncertainty_score":0.034613967},"labels":[],"label_agreement":null},{"id":"W2401458535","doi":"","title":"Quasi-tree graphs with the second largest number of maximal independent sets.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Tree (set theory); Combinatorics; Discrete mathematics","score_opus":0.009570758433077683,"score_gpt":0.2655886262805301,"score_spread":0.2560178678474524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401458535","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5754211,0.002695558,0.29184133,0.0045462325,0.0006672152,0.00019067495,0.00714433,0.0012192784,0.11627423],"genre_scores_gemma":[0.9007427,0.00074352376,0.07418035,0.0007525362,0.00029695648,0.00015065305,0.0027360853,0.0002468125,0.020150349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994791,0.00014422175,0.000028262557,0.00011878233,0.000119084936,0.000110689216],"domain_scores_gemma":[0.99450547,0.0030911418,0.0006522856,0.0006498442,0.0005053931,0.0005958547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007173322,0.00033615934,0.0005948693,0.0010812588,0.0013318355,0.0024632062,0.0008896005,0.0011244869,0.009705295],"category_scores_gemma":[0.004773498,0.00057605334,0.0005542345,0.0010896081,0.0010528894,0.0036366517,0.0009040414,0.0012781493,0.0011562929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003010881,0.00007601462,0.0021802774,0.00021741127,0.00004962108,0.00037739292,0.00019204362,0.0029719844,0.01293885,0.9492455,0.0135974735,0.01785224],"study_design_scores_gemma":[0.000081148,0.00006510639,0.0041026683,0.00006298291,0.000071178125,0.0014661083,0.00021229686,0.019939909,0.0056756428,0.9524505,0.015841302,0.000031141357],"about_ca_topic_score_codex":0.0006872824,"about_ca_topic_score_gemma":0.001631441,"teacher_disagreement_score":0.009705295,"about_ca_system_score_codex":0.0008646618,"about_ca_system_score_gemma":0.00080149755,"threshold_uncertainty_score":0.032467484},"labels":[],"label_agreement":null},{"id":"W2401489826","doi":"","title":"Partial Fraction Decomposition And Determinant Identities.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Statistical Distribution Estimation and Applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Fraction (chemistry); Decomposition; Partial fraction decomposition; Pure mathematics; Chemistry; Chromatography; Organic chemistry","score_opus":0.028185322980657936,"score_gpt":0.3402831637302644,"score_spread":0.31209784074960645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401489826","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05269677,0.005188899,0.8495281,0.0030150998,0.0006293988,0.000042819156,0.00086143543,0.00041451378,0.08762299],"genre_scores_gemma":[0.84270895,0.0043749292,0.103858545,0.0011088576,0.0016983709,0.00014422198,0.0012476718,0.0005532678,0.04430514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842596,0.000719794,0.00006900753,0.00021217456,0.00038109743,0.00019199165],"domain_scores_gemma":[0.9947318,0.0031271006,0.00045826082,0.00073815207,0.00064749754,0.00029713378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024120328,0.00096628146,0.00097481953,0.0026513657,0.0011028565,0.003009519,0.0009764829,0.00089674623,0.009761155],"category_scores_gemma":[0.01478074,0.00046584278,0.0009742044,0.0019403037,0.0025788269,0.0042943405,0.0018045151,0.0021263487,0.002732241],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000095839705,0.000010779,0.0002917749,0.000029242743,0.000009193392,0.000033586748,0.0000523767,0.0011372203,0.00018038084,0.9882416,0.0024126128,0.007591761],"study_design_scores_gemma":[0.0000030876981,0.000005954271,0.0002524722,0.000017632454,0.0000055010264,0.00008659189,0.000023965731,0.01539846,0.00019116014,0.9807209,0.003285091,0.0000090924195],"about_ca_topic_score_codex":0.0015603602,"about_ca_topic_score_gemma":0.0017747334,"teacher_disagreement_score":0.009761155,"about_ca_system_score_codex":0.0012186007,"about_ca_system_score_gemma":0.0009609542,"threshold_uncertainty_score":0.032654345},"labels":[],"label_agreement":null},{"id":"W2401510322","doi":"","title":"Multidecomposition of the complete graph into graph pairs of order 4 with various leaves.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.005079587936764796,"score_gpt":0.18563951893260772,"score_spread":0.18055993099584292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401510322","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.411404,0.00059983897,0.45806956,0.0007947061,0.00030439947,0.00031890554,0.0017670387,0.0011509592,0.12559055],"genre_scores_gemma":[0.6719779,0.00029732098,0.27069288,0.00044009634,0.00010600447,0.00019188834,0.0032455605,0.0006084724,0.05243992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994655,0.00014700311,0.00003610577,0.00015321503,0.000105369654,0.00009283306],"domain_scores_gemma":[0.99877053,0.00033468992,0.0001621509,0.00038315234,0.00022252268,0.00012689593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036452734,0.00035134933,0.0003974665,0.000967143,0.0011166651,0.0013991612,0.00067882804,0.00048655702,0.01428656],"category_scores_gemma":[0.0013602588,0.0004021255,0.00074906263,0.00083687867,0.0007192907,0.002668727,0.0016174774,0.0012512107,0.0027398341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005203997,0.0003112681,0.0018086978,0.00038937613,0.00010515466,0.0010721751,0.0011146247,0.0056017917,0.0316593,0.8368437,0.013809976,0.10676349],"study_design_scores_gemma":[0.00008275831,0.00025435578,0.0027377263,0.00013351937,0.00011726163,0.0017921533,0.0012476705,0.029320749,0.055271454,0.8432503,0.06573179,0.000060410122],"about_ca_topic_score_codex":0.00051704765,"about_ca_topic_score_gemma":0.0013977182,"teacher_disagreement_score":0.01428656,"about_ca_system_score_codex":0.00040566697,"about_ca_system_score_gemma":0.00049035397,"threshold_uncertainty_score":0.04779327},"labels":[],"label_agreement":null},{"id":"W2401528282","doi":"","title":"The Triangle Intersection Problem For Hexagon Triple Systems","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Intersection (aeronautics); Mathematics; Combinatorics; Geography; Cartography","score_opus":0.016411030033308262,"score_gpt":0.19598029637701728,"score_spread":0.179569266343709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401528282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38067192,0.0017065175,0.4179544,0.0034211872,0.00047048437,0.00017677194,0.0010212341,0.0005415497,0.19403589],"genre_scores_gemma":[0.9313718,0.0008222905,0.043226272,0.00034417497,0.00015755743,0.00010831149,0.0010297647,0.0001963493,0.022743486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987847,0.00032678063,0.00006603779,0.00022252351,0.00030231202,0.00029758541],"domain_scores_gemma":[0.9970407,0.0017838511,0.00025559994,0.00034259167,0.00031365835,0.00026361548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007527174,0.00054485817,0.0012268692,0.0011114924,0.0024512152,0.0049382593,0.0015994674,0.0022724592,0.022297123],"category_scores_gemma":[0.0046336954,0.0006169389,0.0007235038,0.002229294,0.0016619588,0.006062097,0.0027176684,0.0027310604,0.0018086745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020438265,0.000095748655,0.0006846833,0.00017668204,0.00003615756,0.0002973858,0.000395782,0.03162223,0.00156809,0.9226432,0.009957248,0.032318365],"study_design_scores_gemma":[0.00002714636,0.000024399184,0.00014188085,0.00003695843,0.000011272523,0.00016114108,0.0004999381,0.07078926,0.001326579,0.92110384,0.005858569,0.000018943858],"about_ca_topic_score_codex":0.0023271912,"about_ca_topic_score_gemma":0.001631016,"teacher_disagreement_score":0.022297123,"about_ca_system_score_codex":0.0014538656,"about_ca_system_score_gemma":0.0010618217,"threshold_uncertainty_score":0.07459128},"labels":[],"label_agreement":null},{"id":"W2401530170","doi":"","title":"On The Generalized Lucas 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":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Lucas sequence; Lucas number; Combinatorics; Algebra over a field; Pure mathematics; Fibonacci number; Fibonacci polynomials; Orthogonal polynomials; Classical orthogonal polynomials","score_opus":0.007635215200539505,"score_gpt":0.2578314891619373,"score_spread":0.2501962739613978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401530170","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2347484,0.008214246,0.36109805,0.005780214,0.0025920924,0.00011645047,0.00095281575,0.0006506487,0.38584703],"genre_scores_gemma":[0.7986122,0.0043644053,0.062270455,0.0014500126,0.0014698344,0.00012924979,0.00064843596,0.00040629043,0.1306491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996549,0.000116450254,0.00001545029,0.000053911077,0.000088783345,0.00007047684],"domain_scores_gemma":[0.99926704,0.0002479387,0.00011911635,0.000080786915,0.00014721745,0.00013782874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004844049,0.0008163533,0.0004638501,0.0022248747,0.0010539632,0.0019108751,0.0006590422,0.0009155239,0.0139323175],"category_scores_gemma":[0.0027606152,0.00036895473,0.0004740463,0.0013343521,0.0021359946,0.0042367987,0.0017319897,0.0019119648,0.002975638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013797291,0.000004373217,0.000051061306,0.000019959809,0.0000028697166,0.000034761928,0.00008327524,0.0007828586,0.0003837852,0.99108875,0.0021001825,0.0054343753],"study_design_scores_gemma":[0.000005336397,0.000009999573,0.00008952603,0.000014145231,0.000002220946,0.000064241096,0.0000550809,0.0026900722,0.00018108088,0.9897654,0.0071149794,0.000008043424],"about_ca_topic_score_codex":0.0010001822,"about_ca_topic_score_gemma":0.0016189474,"teacher_disagreement_score":0.0139323175,"about_ca_system_score_codex":0.0009075851,"about_ca_system_score_gemma":0.00054379326,"threshold_uncertainty_score":0.04660827},"labels":[],"label_agreement":null},{"id":"W2401547246","doi":"","title":"On the spectra of tricyclic graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tricyclic; Mathematics; Spectral line; Combinatorics; Stereochemistry; Chemistry; Physics; Astronomy","score_opus":0.05034851632161588,"score_gpt":0.2708962132307848,"score_spread":0.2205476969091689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401547246","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30381364,0.014513197,0.18567155,0.0062555643,0.0021797207,0.00008354846,0.0013565285,0.00064773,0.4854785],"genre_scores_gemma":[0.9261466,0.007542684,0.019786857,0.0013044297,0.0015123079,0.00009054751,0.0006786468,0.0002623172,0.042675566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999458,0.00013783707,0.0000245921,0.000110085355,0.00015927135,0.000110249886],"domain_scores_gemma":[0.99831486,0.0007758447,0.00024993342,0.00016643791,0.00020222168,0.0002907799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044941824,0.0007418228,0.00066922064,0.0034741473,0.0012871161,0.002125323,0.00096288475,0.0009620874,0.012258734],"category_scores_gemma":[0.0031615037,0.00037776845,0.00048343925,0.0020181984,0.0024906264,0.004132288,0.0021365383,0.0020122766,0.0023919414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022574874,0.000015001409,0.00016076682,0.000056128898,0.000006333861,0.0000875874,0.00018645455,0.00075664977,0.00074545207,0.9845793,0.0046016607,0.008782026],"study_design_scores_gemma":[0.000006853696,0.000008443997,0.00023026118,0.00003469452,0.000004815463,0.00017485568,0.00013296572,0.0027291542,0.00022271839,0.9916237,0.0048233895,0.0000081548615],"about_ca_topic_score_codex":0.0009100031,"about_ca_topic_score_gemma":0.00093064364,"teacher_disagreement_score":0.012258734,"about_ca_system_score_codex":0.0009343949,"about_ca_system_score_gemma":0.00033576423,"threshold_uncertainty_score":0.041009545},"labels":[],"label_agreement":null},{"id":"W2401554060","doi":"","title":"On the Existence of Simple 3-(30, 7, 15) and 3-(26, 12, 55) Designs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Simple (philosophy); Epistemology; Philosophy","score_opus":0.0130907199409047,"score_gpt":0.2059037535218716,"score_spread":0.1928130335809669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401554060","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58168554,0.0025186453,0.13819037,0.0033589415,0.00048714236,0.00021307252,0.0010201953,0.00044406368,0.27208203],"genre_scores_gemma":[0.93813246,0.0011567789,0.041418556,0.0006828352,0.00016322713,0.00019196354,0.00049320864,0.000108795364,0.017652096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984358,0.0005825859,0.00008934586,0.00024751519,0.00035029187,0.00029440678],"domain_scores_gemma":[0.98844224,0.008133422,0.0013529335,0.00084212905,0.0006610999,0.0005681147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014826943,0.000575101,0.0006380742,0.0016481957,0.0022316235,0.002990427,0.000712664,0.0019345096,0.015821561],"category_scores_gemma":[0.011529802,0.0008329473,0.0007117019,0.0010133041,0.0026329998,0.003833046,0.002347065,0.0017272128,0.0024776326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021391714,0.000042759773,0.0008442613,0.00013221377,0.000025192681,0.0001759304,0.00032578583,0.0023504952,0.002320063,0.97680515,0.0036022451,0.013161997],"study_design_scores_gemma":[0.00008210361,0.00006724654,0.00055566936,0.000102627266,0.000028880702,0.00047418242,0.00019378116,0.0062293177,0.0019492931,0.982678,0.0076069916,0.00003192461],"about_ca_topic_score_codex":0.00057518925,"about_ca_topic_score_gemma":0.0010982681,"teacher_disagreement_score":0.015821561,"about_ca_system_score_codex":0.000874881,"about_ca_system_score_gemma":0.0011015749,"threshold_uncertainty_score":0.05292833},"labels":[],"label_agreement":null},{"id":"W2401555278","doi":"","title":"Decompositions of K v into the graphs with 7 points, 7 edges and a 5-circle.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.0048980743361482035,"score_gpt":0.19031999350587436,"score_spread":0.18542191916972617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401555278","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39125985,0.001082767,0.2965513,0.0014449317,0.0005173954,0.0005402308,0.0058717853,0.0016326046,0.3010992],"genre_scores_gemma":[0.7888568,0.0005542485,0.122580655,0.00048509846,0.00006277293,0.00030894385,0.0060066674,0.0004436475,0.08070109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996178,0.00008595147,0.000022751885,0.00008004937,0.00007364548,0.00011977989],"domain_scores_gemma":[0.99930465,0.00013941519,0.00011472563,0.00014724814,0.00015308333,0.0001408592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020400134,0.00056563923,0.00033804323,0.0013142463,0.0009934192,0.0014462803,0.00065028237,0.00062784116,0.022398341],"category_scores_gemma":[0.0011382955,0.0003522169,0.00060106977,0.0008255222,0.00074560044,0.0011620788,0.0011229048,0.00087366765,0.0050837905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006457012,0.00018422552,0.001807718,0.00035765246,0.00008179106,0.00091278,0.0009906167,0.014024558,0.019090587,0.8414504,0.038297597,0.08215635],"study_design_scores_gemma":[0.00015197307,0.00011916428,0.0053468407,0.00021273395,0.00008990823,0.0010720603,0.0017808871,0.034722682,0.01143375,0.85811675,0.0868858,0.000067477915],"about_ca_topic_score_codex":0.0025047935,"about_ca_topic_score_gemma":0.0040876972,"teacher_disagreement_score":0.022398341,"about_ca_system_score_codex":0.0007555222,"about_ca_system_score_gemma":0.0006002099,"threshold_uncertainty_score":0.07492995},"labels":[],"label_agreement":null},{"id":"W2401559809","doi":"","title":"Hyperstructures associated to arithmetic functions.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arithmetic; Mathematics; Algebra over a field; Pure mathematics","score_opus":0.008602605229601873,"score_gpt":0.22702490418019347,"score_spread":0.2184222989505916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401559809","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16544132,0.0058331448,0.43628868,0.003929598,0.0010308692,0.00012809521,0.0015511988,0.0010557884,0.38474137],"genre_scores_gemma":[0.871757,0.0023224037,0.074361086,0.00057761086,0.0007149738,0.00013213129,0.0010042739,0.00025648688,0.04887404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990337,0.0002775826,0.00008665081,0.00016428134,0.00029177289,0.00014597962],"domain_scores_gemma":[0.99841917,0.00065221556,0.00020163212,0.0003336822,0.00024386277,0.00014941691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006759929,0.00053384725,0.0005084642,0.0027866832,0.0018354807,0.0048452048,0.00076921046,0.0008734197,0.01335905],"category_scores_gemma":[0.00312068,0.00040213106,0.0007646752,0.002370846,0.0037029947,0.007371078,0.0030477857,0.002236633,0.00261648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007600157,0.000004838063,0.000121314086,0.0000217521,0.0000037712375,0.000037332164,0.000115050156,0.00020274325,0.00030390988,0.9941848,0.0007852405,0.0042117224],"study_design_scores_gemma":[0.000003887029,0.0000054616407,0.00017334436,0.000021365595,0.0000043866685,0.00012875201,0.000115781884,0.001752185,0.0003845336,0.9879711,0.009431305,0.000007919518],"about_ca_topic_score_codex":0.0009347844,"about_ca_topic_score_gemma":0.0009974189,"teacher_disagreement_score":0.01335905,"about_ca_system_score_codex":0.0012809174,"about_ca_system_score_gemma":0.0005418373,"threshold_uncertainty_score":0.04469043},"labels":[],"label_agreement":null},{"id":"W2401576146","doi":"","title":"A computer search for minimal blocking sets in PG(2, q).","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Blocking (statistics); Mathematics; Blocking effect; Arithmetic; Statistics; Psychology","score_opus":0.00934692375478404,"score_gpt":0.22786158629401482,"score_spread":0.21851466253923077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401576146","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5993946,0.0014296406,0.25281233,0.0036933576,0.00014399213,0.0004587277,0.0049357447,0.0045052916,0.13262631],"genre_scores_gemma":[0.7070506,0.00048174665,0.2655059,0.0004876925,0.000071342,0.00024320837,0.0050409236,0.0004961486,0.020622332],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967515,0.00007315299,0.000016261203,0.0000944821,0.00006717289,0.000073812],"domain_scores_gemma":[0.99833703,0.0012687795,0.000088606634,0.00013304081,0.000087679466,0.000084706015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056683546,0.00045363605,0.000645234,0.0015094358,0.0011799773,0.0020715767,0.0010683922,0.0009110747,0.021295808],"category_scores_gemma":[0.0038393838,0.0004341034,0.0005967111,0.0019078192,0.0006116244,0.0017339637,0.00097243226,0.00078207115,0.002902167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024770598,0.0011249423,0.007900279,0.0012524334,0.00020610455,0.0005600425,0.0014959055,0.12674688,0.03011795,0.30187303,0.08896028,0.4372851],"study_design_scores_gemma":[0.0008484191,0.0004908749,0.0026888957,0.00017092287,0.00018028983,0.0005508146,0.0012074141,0.46657196,0.013361477,0.47288093,0.040979955,0.000067967674],"about_ca_topic_score_codex":0.0041430043,"about_ca_topic_score_gemma":0.008225899,"teacher_disagreement_score":0.021295808,"about_ca_system_score_codex":0.0012929591,"about_ca_system_score_gemma":0.0019952243,"threshold_uncertainty_score":0.07124162},"labels":[],"label_agreement":null},{"id":"W2401601396","doi":"","title":"Weighted Composition Operators From Logarithmic Bloch Spaces To A Class Of Weighted-Type Spaces In The Unit Ball.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Holomorphic and Operator Theory","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Unit sphere; Logarithm; Class (philosophy); Composition (language); Type (biology); Ball (mathematics); Pure mathematics; Unit (ring theory); Combinatorics; Mathematical analysis; Artificial intelligence; Computer science; Mathematics education","score_opus":0.02207589685024,"score_gpt":0.278400135395267,"score_spread":0.25632423854502695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401601396","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44321677,0.0015517101,0.42633566,0.0013112248,0.00058916584,0.00009299408,0.000296793,0.00054087513,0.12606485],"genre_scores_gemma":[0.8956223,0.0008884884,0.04352558,0.00035607064,0.00036869672,0.000102501406,0.00025513853,0.00021086188,0.058670428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995943,0.000112850284,0.000019017858,0.000057218764,0.00013866095,0.00007793359],"domain_scores_gemma":[0.99922895,0.00015893095,0.00011910919,0.00009526918,0.00017187452,0.00022588127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065899885,0.0004964122,0.00044045885,0.0013969277,0.0011642677,0.001962263,0.0006841312,0.0006758557,0.0064041214],"category_scores_gemma":[0.002227337,0.00026708783,0.000487969,0.00091890816,0.0017223376,0.004428872,0.0022083845,0.0014376143,0.00082952005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019310874,0.000010542504,0.000105883446,0.00001616783,0.0000040818727,0.000048657752,0.000089638466,0.00025965789,0.0009481357,0.9944963,0.00055567676,0.0034459862],"study_design_scores_gemma":[0.000013444172,0.000020575084,0.00025034673,0.000010715929,0.000006960047,0.00024330939,0.00012624482,0.007110106,0.0009903148,0.986901,0.0043162866,0.000010778739],"about_ca_topic_score_codex":0.00041260122,"about_ca_topic_score_gemma":0.0004638479,"teacher_disagreement_score":0.0064041214,"about_ca_system_score_codex":0.0005596216,"about_ca_system_score_gemma":0.00038296456,"threshold_uncertainty_score":0.021423936},"labels":[],"label_agreement":null},{"id":"W2401613265","doi":"","title":"On Sums of Two or Three Pentagonal Numbers.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arithmetic","score_opus":0.01787626872189908,"score_gpt":0.3040226364532344,"score_spread":0.28614636773133534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401613265","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10705597,0.009564612,0.23186155,0.0039336956,0.006258184,0.000102037164,0.00076170877,0.00048256115,0.63997966],"genre_scores_gemma":[0.7586827,0.006965666,0.07797474,0.0026123861,0.0041233166,0.000210833,0.0010390626,0.0005205706,0.14787063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892247,0.00029337202,0.00008398559,0.0001647744,0.00034069663,0.0001947739],"domain_scores_gemma":[0.9987394,0.0005341633,0.00017644327,0.00016684027,0.0002161552,0.00016695456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082668645,0.0010253374,0.0008858146,0.0030667477,0.0021386193,0.0034995188,0.0008660371,0.00087219675,0.014442414],"category_scores_gemma":[0.003651841,0.0004985653,0.0009057364,0.0018942668,0.0038144195,0.007099537,0.004131976,0.0028795789,0.0039174967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002663121,0.000010250048,0.00012002695,0.00006307592,0.000010048573,0.00009548488,0.00014070737,0.00045423448,0.00041796113,0.9862177,0.0041171242,0.008326811],"study_design_scores_gemma":[0.0000046074915,0.000008428565,0.00014292468,0.00003486527,0.000008210327,0.00016614597,0.000072270625,0.0013581295,0.000293079,0.9873582,0.010541466,0.000011499888],"about_ca_topic_score_codex":0.0007353689,"about_ca_topic_score_gemma":0.0013967017,"teacher_disagreement_score":0.014442414,"about_ca_system_score_codex":0.00086933555,"about_ca_system_score_gemma":0.00050624873,"threshold_uncertainty_score":0.04831469},"labels":[],"label_agreement":null},{"id":"W2401646285","doi":"","title":"On the Oriented Line Graph.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Line graph; Line (geometry); Graph; Combinatorics; Geometry","score_opus":0.010490928917822172,"score_gpt":0.22721731498090034,"score_spread":0.21672638606307817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401646285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096186645,0.0012879919,0.7432456,0.0013233763,0.0006588675,0.00013316567,0.0012644508,0.0013013803,0.15459853],"genre_scores_gemma":[0.63108134,0.0020091375,0.25814047,0.0007864422,0.00042947417,0.00018086756,0.0028003019,0.0010991121,0.103472844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996667,0.00008603991,0.000014578716,0.0000720291,0.00011383065,0.000046898353],"domain_scores_gemma":[0.9994198,0.00019498909,0.0000896173,0.00011018807,0.00011974544,0.00006568872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024000269,0.00043467607,0.00034532315,0.0018663388,0.00087083987,0.0016432812,0.0007483032,0.00065222074,0.018547308],"category_scores_gemma":[0.0015712461,0.00029657144,0.0004804417,0.0012383414,0.0010984876,0.0021654365,0.0015199207,0.0010299506,0.0043626763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053152777,0.000030736104,0.00061231415,0.00008772902,0.00001639068,0.00015079074,0.00015108858,0.0075223576,0.0026502209,0.9037637,0.017001385,0.06796009],"study_design_scores_gemma":[0.000024657285,0.000028524497,0.00055986084,0.00005703445,0.000016757946,0.00032158106,0.00022576781,0.038248956,0.0027113385,0.9016287,0.05615862,0.00001833276],"about_ca_topic_score_codex":0.0011305683,"about_ca_topic_score_gemma":0.0020533653,"teacher_disagreement_score":0.018547308,"about_ca_system_score_codex":0.0005622124,"about_ca_system_score_gemma":0.0002785701,"threshold_uncertainty_score":0.062046885},"labels":[],"label_agreement":null},{"id":"W2401651790","doi":"","title":"Three Constructions of Authentication Codes from Power Function over Finite Fields with Perfect Secrecy.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Secrecy; Mathematics; Finite field; Function (biology); Authentication (law); Power (physics); Discrete mathematics; Computer security; Computer science; Physics; Quantum mechanics; Cell biology","score_opus":0.008987900367935085,"score_gpt":0.21028665324216422,"score_spread":0.20129875287422913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401651790","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058600597,0.0016873559,0.83431345,0.0050692344,0.0008383943,0.00061122584,0.00077209837,0.0020756375,0.096032016],"genre_scores_gemma":[0.6610909,0.001538066,0.30345523,0.0011110104,0.00038436305,0.0006640812,0.000783549,0.0004421921,0.030530619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969131,0.0008401564,0.00023395248,0.00026303207,0.0010231222,0.00072657136],"domain_scores_gemma":[0.99153113,0.003231524,0.0006014217,0.0030414837,0.00087219535,0.00072225864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031022087,0.0012225064,0.0011199734,0.002140856,0.0031257921,0.005062332,0.0023353603,0.0033851087,0.007924487],"category_scores_gemma":[0.011674437,0.0007222091,0.002367341,0.0025256851,0.005283286,0.006462005,0.0084857,0.0038259951,0.0030435638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009884552,0.000051277002,0.00028589243,0.00010702364,0.000017625998,0.00015392632,0.0003489975,0.0026397419,0.0011369158,0.97531134,0.002940882,0.016907515],"study_design_scores_gemma":[0.00006999009,0.00008477497,0.00021622027,0.00015321586,0.000054818418,0.0007245232,0.00017238747,0.024348754,0.007881843,0.9461474,0.020054407,0.000091583206],"about_ca_topic_score_codex":0.00080946815,"about_ca_topic_score_gemma":0.0009124476,"teacher_disagreement_score":0.007924487,"about_ca_system_score_codex":0.002516239,"about_ca_system_score_gemma":0.0032617983,"threshold_uncertainty_score":0.02651006},"labels":[],"label_agreement":null},{"id":"W2401654925","doi":"","title":"New results on sum graph theory.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics; Discrete mathematics","score_opus":0.015254293845447478,"score_gpt":0.23610100108679433,"score_spread":0.22084670724134686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401654925","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042919613,0.013494971,0.4099633,0.0142353345,0.004837758,0.00009261807,0.0025957788,0.001569155,0.5102915],"genre_scores_gemma":[0.5681326,0.015938468,0.23701948,0.010668296,0.008445079,0.00051638036,0.005121706,0.0020632357,0.15209472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981982,0.00046197072,0.00009144234,0.00041809794,0.00064821285,0.0001822093],"domain_scores_gemma":[0.9952382,0.0025402843,0.00026875784,0.00074943854,0.0006591563,0.0005442084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012702637,0.001174867,0.0012725677,0.0042458447,0.0029940829,0.0059096175,0.002523243,0.0016787596,0.023033068],"category_scores_gemma":[0.006762544,0.00076686655,0.0015155257,0.005086975,0.0034819231,0.014457062,0.0046609906,0.0063039665,0.0051803445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018537236,0.000026571475,0.00017135795,0.00010575216,0.00001173605,0.000031939915,0.0000936411,0.0005410742,0.00025470878,0.9733998,0.012789344,0.012555548],"study_design_scores_gemma":[0.0000050636686,0.000004541719,0.00010494362,0.000026020416,0.000010870938,0.00008192933,0.000057953603,0.0019439204,0.00017268566,0.9797657,0.017819593,0.000006818207],"about_ca_topic_score_codex":0.0010785871,"about_ca_topic_score_gemma":0.0019284419,"teacher_disagreement_score":0.023033068,"about_ca_system_score_codex":0.0021487335,"about_ca_system_score_gemma":0.00090609293,"threshold_uncertainty_score":0.07705325},"labels":[],"label_agreement":null},{"id":"W2401656958","doi":"","title":"Some Discussions on Super Edge-Magic Labelings of ST(a 1 , ..., a n ).","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"MAGIC (telescope); Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Astronomy; Artificial intelligence; Computer science; Physics","score_opus":0.011343213052408749,"score_gpt":0.22400711379050925,"score_spread":0.2126639007381005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401656958","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030524893,0.011951981,0.29896966,0.036783084,0.0031683908,0.00014139555,0.0009816097,0.00057744066,0.61690146],"genre_scores_gemma":[0.6201799,0.015072324,0.18593924,0.030782042,0.0053120526,0.00060138095,0.0015061095,0.00075793255,0.13984908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842083,0.0006238216,0.00007619802,0.00025771483,0.00035449618,0.00026696554],"domain_scores_gemma":[0.99807227,0.0011294312,0.00017226418,0.0002740507,0.00020114846,0.00015080575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025211088,0.0008897061,0.00060165155,0.002003499,0.0031874853,0.003261296,0.002598423,0.002882628,0.02605792],"category_scores_gemma":[0.00390901,0.000645977,0.0012210849,0.003389321,0.0033558607,0.008439308,0.002302405,0.004468376,0.002713243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000081960015,0.000008397793,0.000050019014,0.000035683865,0.0000021727433,0.000029146104,0.00008445432,0.00030081125,0.00017370596,0.99116665,0.005568499,0.0025722748],"study_design_scores_gemma":[0.0000055341525,0.000009545483,0.00011593158,0.000035998382,0.000004116007,0.000086119275,0.00008706705,0.0016990745,0.00027557666,0.9608822,0.036789156,0.00000971916],"about_ca_topic_score_codex":0.0019675377,"about_ca_topic_score_gemma":0.0030957682,"teacher_disagreement_score":0.02605792,"about_ca_system_score_codex":0.0026544377,"about_ca_system_score_gemma":0.00075385155,"threshold_uncertainty_score":0.08717245},"labels":[],"label_agreement":null},{"id":"W2401673825","doi":"","title":"The m-competition indices of symmetric primitive digraphs with loop.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Competition (biology); Loop (graph theory); Combinatorics; Biology; Ecology","score_opus":0.012258816917804234,"score_gpt":0.24319798529310113,"score_spread":0.2309391683752969,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401673825","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45885086,0.0008271394,0.12631756,0.0014528839,0.000518318,0.00016050159,0.0018349242,0.0007416219,0.40929615],"genre_scores_gemma":[0.9478762,0.00025746832,0.022815216,0.00040002444,0.0001360493,0.00015510106,0.00059942465,0.00016048345,0.02759995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995016,0.00012510734,0.000030680694,0.00008950198,0.00011166632,0.00014155186],"domain_scores_gemma":[0.99809486,0.00064811605,0.00027727574,0.00024011027,0.0003016884,0.000437978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000555697,0.00043663668,0.000539512,0.0019686953,0.0018411452,0.002553521,0.0010303785,0.001206888,0.016923018],"category_scores_gemma":[0.003717344,0.0003997205,0.0004420417,0.0011195847,0.0016620117,0.0037977016,0.0014696339,0.0014343304,0.0023720078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006352632,0.000028004533,0.00038849752,0.000045080385,0.0000059679132,0.0000896368,0.00013008427,0.00063942646,0.0016337915,0.9847525,0.0033238702,0.008899594],"study_design_scores_gemma":[0.00002721888,0.00003024131,0.00054651813,0.00003509181,0.0000103690045,0.00022341573,0.00013401767,0.007477212,0.0014269402,0.981797,0.008272262,0.000019725067],"about_ca_topic_score_codex":0.0011574731,"about_ca_topic_score_gemma":0.0018911841,"teacher_disagreement_score":0.016923018,"about_ca_system_score_codex":0.0013304277,"about_ca_system_score_gemma":0.00094848615,"threshold_uncertainty_score":0.056613088},"labels":[],"label_agreement":null},{"id":"W2401682398","doi":"","title":"Two-color Rado number for x + y + c = 4z.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arithmetic","score_opus":0.029522922977338283,"score_gpt":0.3306195502049718,"score_spread":0.30109662722763353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401682398","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19105563,0.0022145074,0.1033862,0.005872274,0.00363081,0.000097506556,0.0009515071,0.0012384503,0.69155306],"genre_scores_gemma":[0.83494407,0.000879865,0.033744268,0.0012957666,0.00043912037,0.00010353722,0.00057969475,0.00042569006,0.12758797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996006,0.00008232492,0.000014074494,0.00006681547,0.000120744895,0.00011551583],"domain_scores_gemma":[0.99966633,0.00010014314,0.000042254716,0.000055060158,0.00005656679,0.00007953359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046996505,0.0007433333,0.0006329016,0.0017429439,0.0020296064,0.0023149797,0.001039519,0.0011382045,0.027418764],"category_scores_gemma":[0.0016368623,0.0002442696,0.0005325762,0.00087813864,0.002220768,0.0025360568,0.00170988,0.0019582624,0.005476796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083634746,0.000020878897,0.00018629829,0.000058063848,0.0000071364366,0.00011043367,0.000090640795,0.00062587083,0.0010464268,0.9782633,0.009686085,0.009821299],"study_design_scores_gemma":[0.000044231834,0.000025216244,0.00043159744,0.000039381972,0.000014368659,0.00028439518,0.00012960425,0.0049177194,0.001986061,0.95396477,0.038124967,0.000037618665],"about_ca_topic_score_codex":0.0015812824,"about_ca_topic_score_gemma":0.0022868284,"teacher_disagreement_score":0.027418764,"about_ca_system_score_codex":0.0013427858,"about_ca_system_score_gemma":0.0009456227,"threshold_uncertainty_score":0.09172487},"labels":[],"label_agreement":null},{"id":"W2401689232","doi":"","title":"Isolated Toughness and Fractional (g, f)-Factors of Graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Toughness; Combinatorics; Discrete mathematics; Composite material; Materials science","score_opus":0.009752522734296394,"score_gpt":0.21349111225013026,"score_spread":0.20373858951583387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401689232","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7260108,0.0019316049,0.14903837,0.0038172738,0.0003386786,0.00008529072,0.001034572,0.000659186,0.11708424],"genre_scores_gemma":[0.9667057,0.00041203757,0.017490333,0.00035997812,0.00019051388,0.00006140793,0.0004333163,0.0001339695,0.0142127415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877125,0.00025952712,0.000053310883,0.00035559238,0.00022067328,0.0003395907],"domain_scores_gemma":[0.99423015,0.0031437862,0.0007020742,0.0005949024,0.00030696546,0.001022117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000980748,0.00072174025,0.0008998373,0.0021472913,0.0036657471,0.0040486488,0.0013174746,0.0014868864,0.013790714],"category_scores_gemma":[0.007217885,0.000663765,0.0009528719,0.0017743913,0.0043781195,0.006233125,0.0024173867,0.002357376,0.0010507001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001344921,0.00004299938,0.0011429888,0.00006951323,0.000014904754,0.0001151955,0.00046465333,0.002545613,0.0013200996,0.98195374,0.003939064,0.008256762],"study_design_scores_gemma":[0.000022234493,0.000014900424,0.0005566122,0.000027283038,0.000014137418,0.00015555469,0.00026569478,0.0065745106,0.00066126947,0.9870193,0.0046698535,0.000018558083],"about_ca_topic_score_codex":0.004221645,"about_ca_topic_score_gemma":0.0041275756,"teacher_disagreement_score":0.013790714,"about_ca_system_score_codex":0.0020970372,"about_ca_system_score_gemma":0.0007780063,"threshold_uncertainty_score":0.04613459},"labels":[],"label_agreement":null},{"id":"W2401692292","doi":"","title":"Bounds of q-factorial [n] q !","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Factorial; Factorial experiment; Combinatorics; Statistics; Mathematical analysis","score_opus":0.07825679817453857,"score_gpt":0.29847942641413816,"score_spread":0.2202226282395996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401692292","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18528403,0.006629477,0.35218656,0.015708793,0.002152147,0.00014022108,0.00180782,0.0022734518,0.43381754],"genre_scores_gemma":[0.86239886,0.0023664858,0.056119915,0.0029007017,0.0019273736,0.00038386646,0.0011491907,0.0018093503,0.070944265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99480456,0.0013321219,0.00024730366,0.0010318412,0.0012704772,0.0013137362],"domain_scores_gemma":[0.9858057,0.009264602,0.00091606966,0.0014038212,0.0012567546,0.0013531403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055805095,0.0027466372,0.0021696421,0.0056470097,0.005330003,0.006397686,0.004737392,0.003443465,0.026545905],"category_scores_gemma":[0.017518032,0.0012798298,0.0021408673,0.0037632894,0.0064215427,0.013391842,0.00789331,0.0060001877,0.007027274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001713956,0.00005740683,0.0004893818,0.0001306239,0.000026795879,0.00010421766,0.00031951303,0.0015376555,0.001270935,0.97970414,0.007127967,0.009059942],"study_design_scores_gemma":[0.000014166094,0.000017775481,0.00045861458,0.00006463614,0.000036195474,0.00014930441,0.000042116695,0.00918135,0.0010962322,0.9813172,0.0075732814,0.000049034858],"about_ca_topic_score_codex":0.0029557045,"about_ca_topic_score_gemma":0.0036899962,"teacher_disagreement_score":0.026545905,"about_ca_system_score_codex":0.0048328945,"about_ca_system_score_gemma":0.0017071107,"threshold_uncertainty_score":0.0888049},"labels":[],"label_agreement":null},{"id":"W2401701830","doi":"","title":"Some New Sufficient Conditions for Graphs to be (a, b, k)-Critical Graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Indifference graph; Discrete mathematics; Graph","score_opus":0.03849208709936138,"score_gpt":0.2742585572179592,"score_spread":0.23576647011859783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401701830","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25998044,0.0057742586,0.4445278,0.010228697,0.0034506219,0.0015733844,0.011838025,0.0040423754,0.25858432],"genre_scores_gemma":[0.86592835,0.0021308677,0.10441657,0.002954019,0.0013868057,0.001256064,0.0065797106,0.00056049705,0.014787164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990891,0.00021492108,0.00012830672,0.00021439619,0.00015066654,0.00020260118],"domain_scores_gemma":[0.98939204,0.005804571,0.0010175634,0.0005371272,0.0018251329,0.0014237171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014998598,0.00086714484,0.00093010685,0.00308686,0.002119599,0.0029200881,0.0011258916,0.0027596175,0.021576483],"category_scores_gemma":[0.013513702,0.0009403814,0.001103702,0.0012815899,0.0019927372,0.005273369,0.0019537199,0.0034531117,0.003667416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089941226,0.00037650668,0.0053091804,0.001323854,0.00014050644,0.0031049883,0.0012103526,0.009701044,0.030178381,0.8534364,0.0640732,0.030246176],"study_design_scores_gemma":[0.000367147,0.00019626922,0.004055845,0.00040497942,0.00013164406,0.0018124526,0.0013907873,0.027320491,0.011348396,0.9143102,0.038518194,0.00014344075],"about_ca_topic_score_codex":0.0014704634,"about_ca_topic_score_gemma":0.002859574,"teacher_disagreement_score":0.021576483,"about_ca_system_score_codex":0.0014507021,"about_ca_system_score_gemma":0.0015589753,"threshold_uncertainty_score":0.07218057},"labels":[],"label_agreement":null},{"id":"W2401704331","doi":"","title":"[a, b]-factors With Given Edges In Graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.019172001908479938,"score_gpt":0.26158656298563204,"score_spread":0.2424145610771521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401704331","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25509316,0.004557028,0.35845393,0.0035421057,0.0022261874,0.00029391295,0.0027820792,0.0035769138,0.36947468],"genre_scores_gemma":[0.74036527,0.002429143,0.14888367,0.0015568414,0.0005596529,0.00026201253,0.0027061307,0.0013255129,0.101911716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998814,0.00033258408,0.00007647895,0.00036111943,0.00017629514,0.00023958035],"domain_scores_gemma":[0.9978054,0.00079876767,0.0002644323,0.00035805537,0.00038178317,0.00039151247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007806092,0.00087669975,0.0006629574,0.0018355977,0.0031270327,0.003325739,0.0010603237,0.0017887172,0.020183707],"category_scores_gemma":[0.0040408475,0.00079958624,0.0010203826,0.0023612878,0.0021068538,0.0053407424,0.0019087173,0.0017456473,0.006091167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024781984,0.00009550736,0.0011265125,0.00018518575,0.000055198194,0.00041698877,0.0007262654,0.0007158122,0.0038913337,0.94759977,0.016225325,0.028714467],"study_design_scores_gemma":[0.00003311889,0.000030414854,0.00061020633,0.00009357781,0.000045685938,0.00047005422,0.00043898207,0.0018505178,0.0020929505,0.942128,0.052176084,0.00003039734],"about_ca_topic_score_codex":0.0030629393,"about_ca_topic_score_gemma":0.0041234535,"teacher_disagreement_score":0.020183707,"about_ca_system_score_codex":0.0008788837,"about_ca_system_score_gemma":0.00070136855,"threshold_uncertainty_score":0.067521214},"labels":[],"label_agreement":null},{"id":"W2401706236","doi":"","title":"Avoidable Partial Latin Squares Of Order 4m+1.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Latin square; Mathematics; Order (exchange); Applied mathematics; Biology; Business","score_opus":0.005544354896186742,"score_gpt":0.19524001208850691,"score_spread":0.18969565719232018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401706236","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43482682,0.0019550398,0.2246623,0.0024334763,0.0007867664,0.00013452633,0.0010980363,0.00093535264,0.33316764],"genre_scores_gemma":[0.8481554,0.0005859461,0.062384374,0.00068022136,0.00023859802,0.00013419386,0.0006472828,0.00025140482,0.086922586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914026,0.00028069157,0.00003864144,0.0001541724,0.00019797959,0.00018835846],"domain_scores_gemma":[0.9984102,0.0006564602,0.00027504328,0.00033626164,0.0001818884,0.00014013582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037581372,0.0005867343,0.0005810952,0.0008341836,0.0012342017,0.0014977533,0.0008121515,0.0008235478,0.02191518],"category_scores_gemma":[0.0028589498,0.000363953,0.00039360204,0.0008235117,0.0012589702,0.0012645123,0.0015996973,0.0009764512,0.0030953193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022375736,0.000046614558,0.00089899317,0.00015234092,0.000039212275,0.00072325085,0.00032133478,0.006801075,0.013737122,0.92964077,0.0101838475,0.037231665],"study_design_scores_gemma":[0.00006400712,0.00012811116,0.0008872452,0.000063656174,0.000029193525,0.0014649254,0.0002752412,0.021397451,0.011325487,0.91521317,0.049102217,0.000049281243],"about_ca_topic_score_codex":0.000773787,"about_ca_topic_score_gemma":0.00190097,"teacher_disagreement_score":0.02191518,"about_ca_system_score_codex":0.00075231044,"about_ca_system_score_gemma":0.00071722246,"threshold_uncertainty_score":0.073313534},"labels":[],"label_agreement":null},{"id":"W2401708390","doi":"","title":"Pseudo-Hyperbolic Curves In E5.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematics and Applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.029299961669049378,"score_gpt":0.2989088065054029,"score_spread":0.26960884483635356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401708390","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33930057,0.0024159697,0.05732053,0.003117953,0.0010514496,0.00009894768,0.0012635915,0.00048282545,0.5949482],"genre_scores_gemma":[0.87683386,0.00090974034,0.014633301,0.0006241118,0.00017909665,0.000037033053,0.0011283496,0.00021353022,0.10544099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995629,0.00009283158,0.000024254674,0.00007291,0.00014834442,0.00009872271],"domain_scores_gemma":[0.9994678,0.00011993085,0.000080219535,0.000058820642,0.00014648426,0.00012687701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003526927,0.0007265737,0.00030274846,0.0016631507,0.0012763537,0.0023222212,0.00070011674,0.000749097,0.025700733],"category_scores_gemma":[0.001505722,0.00022294842,0.00040890466,0.0011820558,0.001484265,0.0026615378,0.0022839492,0.0017738079,0.0043259137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009120404,0.00002510545,0.000537803,0.00005442512,0.000010232245,0.00028956486,0.00027321777,0.00047338515,0.001048541,0.9789659,0.0042105336,0.014020128],"study_design_scores_gemma":[0.00006995574,0.000059416885,0.0018279144,0.00008430406,0.000020840447,0.0008646578,0.000831703,0.0038619747,0.0036231072,0.9101511,0.07857248,0.000032508622],"about_ca_topic_score_codex":0.0017525895,"about_ca_topic_score_gemma":0.0013621787,"teacher_disagreement_score":0.025700733,"about_ca_system_score_codex":0.0011311038,"about_ca_system_score_gemma":0.00050355896,"threshold_uncertainty_score":0.085977495},"labels":[],"label_agreement":null},{"id":"W2401709832","doi":"","title":"The characterization of graphs with the largest Laplacian eigenvalue at most 5+sqrt(13)/2.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Characterization (materials science); Eigenvalues and eigenvectors; Combinatorics; Laplace operator; Mathematical analysis; Physics; Nanotechnology; Materials science","score_opus":0.009557073857486125,"score_gpt":0.23715632355056915,"score_spread":0.227599249693083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401709832","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68033636,0.0016029681,0.10518628,0.007277264,0.00033491987,0.00009099704,0.0026563446,0.0009120638,0.20160276],"genre_scores_gemma":[0.9669434,0.0004529258,0.012217014,0.00074917765,0.00029172405,0.00008841088,0.0016211183,0.0002219015,0.017414285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968493,0.000066323104,0.000012537988,0.000092651324,0.000074368596,0.0000692604],"domain_scores_gemma":[0.9984491,0.0006401503,0.00027601782,0.0001882059,0.00021256633,0.00023396149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029456284,0.0004790757,0.00033754102,0.0016668997,0.0010747305,0.0014736686,0.0007737097,0.00086737756,0.008426027],"category_scores_gemma":[0.0028705904,0.00024992903,0.00035858448,0.0010347038,0.0012417069,0.0021000106,0.0010199021,0.0014272382,0.0017345176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044051048,0.00010784035,0.0029573322,0.00031718495,0.000034450924,0.00053124636,0.00068028044,0.008346372,0.025868442,0.85924566,0.053283963,0.048186757],"study_design_scores_gemma":[0.000054892633,0.00006966942,0.0043450943,0.000069082955,0.000035186073,0.0013056241,0.00050449546,0.051976543,0.009642248,0.90992504,0.022014268,0.000057756653],"about_ca_topic_score_codex":0.00075555465,"about_ca_topic_score_gemma":0.0009891292,"teacher_disagreement_score":0.008426027,"about_ca_system_score_codex":0.000630521,"about_ca_system_score_gemma":0.00043198798,"threshold_uncertainty_score":0.02818793},"labels":[],"label_agreement":null},{"id":"W2401755711","doi":"","title":"Some new results on soft hypermodules.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Fuzzy and Soft Set Theory","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arithmetic","score_opus":0.06871531394003112,"score_gpt":0.3305879849123315,"score_spread":0.2618726709723004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401755711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04698988,0.017742349,0.5781909,0.008997732,0.0021912646,0.00016886603,0.000962128,0.000494047,0.3442629],"genre_scores_gemma":[0.6656013,0.019000888,0.20313784,0.007408501,0.009112686,0.0006780248,0.0012769041,0.000451661,0.09333214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99797434,0.0006601288,0.00015314498,0.0003188818,0.0007078043,0.00018566768],"domain_scores_gemma":[0.9945285,0.0032987094,0.00044307506,0.0005275892,0.00064084725,0.0005613518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032831233,0.0011602399,0.0010587333,0.0057117483,0.0018437672,0.0050269305,0.0013484547,0.0014627924,0.020495532],"category_scores_gemma":[0.007954812,0.0006537031,0.0018907036,0.004183696,0.0047304993,0.009610174,0.003948648,0.004175953,0.0029431148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012786255,0.000021234602,0.00015609489,0.00014471525,0.000017602844,0.00008823551,0.00013253906,0.00077463343,0.0002999202,0.98422766,0.0030956643,0.011028898],"study_design_scores_gemma":[0.0000054753805,0.000012466516,0.00013100747,0.000044654524,0.000011625101,0.00012497389,0.00004520473,0.0022801275,0.00017695567,0.98875976,0.008399044,0.000008687772],"about_ca_topic_score_codex":0.00047980895,"about_ca_topic_score_gemma":0.00071905146,"teacher_disagreement_score":0.020495532,"about_ca_system_score_codex":0.0018046277,"about_ca_system_score_gemma":0.0008639556,"threshold_uncertainty_score":0.068564415},"labels":[],"label_agreement":null},{"id":"W2401767591","doi":"","title":"A sufficient condition for a toroidal graph to be 3-choosable.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Toroid; Graph; Combinatorics; Physics; Plasma; Quantum mechanics","score_opus":0.026195673508615798,"score_gpt":0.309235088491795,"score_spread":0.2830394149831792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401767591","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60669655,0.0010837308,0.13772118,0.007564416,0.0023076383,0.00075327023,0.017512051,0.0041694753,0.22219162],"genre_scores_gemma":[0.9411531,0.0005236319,0.033987656,0.00120245,0.00037611235,0.00038677934,0.009790569,0.0003870609,0.01219272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988833,0.00011305042,0.00012866758,0.00032301986,0.00018063682,0.00037124727],"domain_scores_gemma":[0.99077356,0.0047842776,0.00086597673,0.0008078121,0.0011790274,0.0015892624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007512132,0.0006562862,0.0013267309,0.0009750048,0.0022639828,0.002221421,0.001231864,0.00279663,0.033600017],"category_scores_gemma":[0.008233099,0.0009252002,0.0014757034,0.00090599887,0.0020001621,0.0037229748,0.0019353651,0.0029914563,0.0068772873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032034384,0.0007606269,0.010844279,0.0020487562,0.000231951,0.007761698,0.001677228,0.015396402,0.12461269,0.7434459,0.0582565,0.031760655],"study_design_scores_gemma":[0.0010009967,0.000859626,0.012097781,0.00048988976,0.00029017785,0.006539449,0.0031441082,0.031645156,0.066327535,0.79893047,0.07826834,0.0004064351],"about_ca_topic_score_codex":0.0021912686,"about_ca_topic_score_gemma":0.004248537,"teacher_disagreement_score":0.033600017,"about_ca_system_score_codex":0.0007973843,"about_ca_system_score_gemma":0.0019220611,"threshold_uncertainty_score":0.112403214},"labels":[],"label_agreement":null},{"id":"W2401781654","doi":"","title":"On the Constructions of New Families of Graceful Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.01665923163136904,"score_gpt":0.22674295588319834,"score_spread":0.2100837242518293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401781654","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20242597,0.0033734406,0.5658466,0.005592742,0.0007448009,0.00022204011,0.0011208833,0.0022660848,0.21840748],"genre_scores_gemma":[0.79852235,0.0024640153,0.15111879,0.0016072585,0.0005090887,0.00047880015,0.0010169237,0.0009604526,0.04332237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984034,0.00057887635,0.000074546384,0.00032341754,0.0003401611,0.0002797398],"domain_scores_gemma":[0.9952122,0.002447955,0.00036067175,0.0011268845,0.00028417975,0.00056808174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021628323,0.00083010434,0.00072419574,0.0027930706,0.0039007305,0.0031630292,0.001898478,0.0015173828,0.012205279],"category_scores_gemma":[0.0066223787,0.00090273307,0.0014727035,0.0020451797,0.004922742,0.009050961,0.005651049,0.0033225478,0.0016724414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001685505,0.000011935709,0.00015716713,0.000030224039,0.000004114891,0.000046623492,0.00021406633,0.0008201788,0.00038542083,0.9911378,0.0022198376,0.0049558016],"study_design_scores_gemma":[0.000010492323,0.000010280202,0.00014091934,0.000027131207,0.000009066434,0.00014869476,0.0001295333,0.0037123386,0.0005626804,0.9816482,0.013583496,0.000017185834],"about_ca_topic_score_codex":0.0011243054,"about_ca_topic_score_gemma":0.0017613835,"teacher_disagreement_score":0.012205279,"about_ca_system_score_codex":0.0020224757,"about_ca_system_score_gemma":0.0007848615,"threshold_uncertainty_score":0.04083073},"labels":[],"label_agreement":null},{"id":"W2401787488","doi":"","title":"On The Average Crosscap Number Of A Graph.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.013550550745601516,"score_gpt":0.2768355687554542,"score_spread":0.26328501800985266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401787488","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69922394,0.0067126127,0.17307498,0.0044908742,0.0010852686,0.00008637918,0.0045727063,0.0014993198,0.109253936],"genre_scores_gemma":[0.95547783,0.0026178441,0.026007684,0.0005110645,0.00092980854,0.00013921794,0.001867502,0.00063432415,0.011814676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986205,0.0003660337,0.000052730244,0.0004404664,0.00027011932,0.00025013922],"domain_scores_gemma":[0.9778031,0.015060626,0.001871668,0.0021346705,0.0011896389,0.0019402503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018242082,0.0011731442,0.0013118258,0.0047039343,0.0017455826,0.0030562792,0.0028070856,0.002064026,0.016461357],"category_scores_gemma":[0.018877368,0.0007389903,0.00070204696,0.0033588635,0.0024220713,0.00961931,0.002059064,0.0025134317,0.0020158102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009021499,0.00025625897,0.012712669,0.000748631,0.00026241317,0.0004032154,0.00044245878,0.121167175,0.010095176,0.72958666,0.04242284,0.081000336],"study_design_scores_gemma":[0.00005981961,0.00017941458,0.007333171,0.0001635668,0.00014694818,0.0010921048,0.00031550133,0.26267332,0.0054077776,0.7100843,0.012451152,0.00009283066],"about_ca_topic_score_codex":0.0014643527,"about_ca_topic_score_gemma":0.002241319,"teacher_disagreement_score":0.016461357,"about_ca_system_score_codex":0.0018965707,"about_ca_system_score_gemma":0.00066606567,"threshold_uncertainty_score":0.05506867},"labels":[],"label_agreement":null},{"id":"W2401803831","doi":"","title":"Some Partitions Where Even Parts Appear Twice.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"South Asian Studies and Diaspora","field":"Arts and Humanities","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.021660121987956707,"score_gpt":0.22947771040564904,"score_spread":0.20781758841769232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401803831","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25359064,0.0023792367,0.18184891,0.0040853275,0.0036592134,0.000415828,0.008313682,0.002768966,0.54293823],"genre_scores_gemma":[0.74122256,0.001061618,0.073346235,0.0011907576,0.00057182455,0.00035903777,0.0058512297,0.0026886652,0.17370813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987752,0.000210296,0.000109125736,0.0002659765,0.00016543908,0.00047389267],"domain_scores_gemma":[0.996797,0.00090106047,0.00031229068,0.0010891182,0.0005802131,0.00032026923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008276082,0.00092671055,0.00088570744,0.0018410139,0.007917301,0.0045448584,0.0012207882,0.0012769907,0.05218414],"category_scores_gemma":[0.0044475896,0.00075243413,0.001401032,0.0034445713,0.003336652,0.0068577905,0.0030407435,0.0026467193,0.011969582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007908983,0.00011682895,0.002090751,0.00029337735,0.00005976003,0.0017995106,0.0029881513,0.0005552369,0.0074273823,0.90424144,0.035255965,0.04438061],"study_design_scores_gemma":[0.000056522444,0.00005326403,0.0029576626,0.00017563984,0.00007294103,0.0013189117,0.0028391175,0.0013485461,0.007175262,0.7804817,0.20345712,0.000063246865],"about_ca_topic_score_codex":0.0029137726,"about_ca_topic_score_gemma":0.0049521453,"teacher_disagreement_score":0.05218414,"about_ca_system_score_codex":0.0013515648,"about_ca_system_score_gemma":0.0009797366,"threshold_uncertainty_score":0.1745733},"labels":[],"label_agreement":null},{"id":"W2401811066","doi":"","title":"Large sets of oriented P 3 -decompositions of directed complete bipartite graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Discrete mathematics; Graph","score_opus":0.006911160097572999,"score_gpt":0.2030696047446677,"score_spread":0.1961584446470947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401811066","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6131719,0.0009779651,0.29418033,0.0011548102,0.00021960745,0.00015713132,0.0027945207,0.0006171149,0.08672665],"genre_scores_gemma":[0.93875587,0.00035564048,0.044238314,0.00033921312,0.00012442791,0.00023975258,0.0026977542,0.0001596696,0.0130893225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909556,0.00027877244,0.00005408736,0.00017061962,0.00024653957,0.00015442478],"domain_scores_gemma":[0.99565685,0.0022309278,0.0006366113,0.0005105539,0.0004422742,0.00052279496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080861436,0.00051722245,0.00072663673,0.0027979813,0.0015096745,0.0030094362,0.0009772778,0.0010356357,0.008514865],"category_scores_gemma":[0.005683163,0.00074210885,0.00086942955,0.0013528753,0.0015895533,0.0020805944,0.002012897,0.0014044357,0.0009869199],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023336199,0.000099879624,0.0027859358,0.00017242023,0.00007679831,0.0003814534,0.00049071154,0.012992443,0.0051608034,0.9508576,0.00815656,0.018592121],"study_design_scores_gemma":[0.000035584093,0.000029480478,0.0018118464,0.00007380041,0.000031420946,0.00034773536,0.0003335543,0.047021892,0.0015176553,0.9427738,0.0060045733,0.00001865696],"about_ca_topic_score_codex":0.00072168827,"about_ca_topic_score_gemma":0.0010780791,"teacher_disagreement_score":0.008514865,"about_ca_system_score_codex":0.0010023677,"about_ca_system_score_gemma":0.0005227004,"threshold_uncertainty_score":0.028485},"labels":[],"label_agreement":null},{"id":"W2401811276","doi":"","title":"Some Identities Involving Genocchi Polynomials And Numbers.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.01800175635017092,"score_gpt":0.26889205321135623,"score_spread":0.2508902968611853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401811276","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07638256,0.018105844,0.09085944,0.014844059,0.0036360295,0.000058672882,0.0007227946,0.00026522178,0.7951254],"genre_scores_gemma":[0.78622967,0.008298255,0.036550388,0.0046761134,0.0040936554,0.00011597511,0.0005849734,0.0002035017,0.15924759],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932873,0.00022869796,0.000032172615,0.00008588787,0.00021123026,0.00011327062],"domain_scores_gemma":[0.998862,0.0005087577,0.00011923499,0.00014297667,0.00025094792,0.00011607073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011339065,0.0005903204,0.0004744977,0.0019694956,0.002373509,0.0023419678,0.00063495245,0.0010643577,0.01177387],"category_scores_gemma":[0.003481015,0.00027033247,0.0006572927,0.0015880677,0.0033985432,0.004429675,0.0022156665,0.0027165108,0.0026044894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049803602,0.000003469667,0.000070231355,0.000019372044,0.0000014577039,0.000055124594,0.00009986563,0.00006756518,0.00008883004,0.99246526,0.004040323,0.0030835266],"study_design_scores_gemma":[0.000003512333,0.0000044759768,0.00021928408,0.000018676708,0.0000035103674,0.00014396342,0.000048979033,0.0005208382,0.00013643736,0.9831987,0.015696034,0.000005664098],"about_ca_topic_score_codex":0.0030298205,"about_ca_topic_score_gemma":0.003367075,"teacher_disagreement_score":0.01177387,"about_ca_system_score_codex":0.0017117343,"about_ca_system_score_gemma":0.00090321916,"threshold_uncertainty_score":0.039387584},"labels":[],"label_agreement":null},{"id":"W2401811908","doi":"","title":"A Look at the Reciprocal of the Generating Function for p-Regular Partitions.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Reciprocal; Function (biology); Combinatorics","score_opus":0.05397829481437821,"score_gpt":0.3207417148211826,"score_spread":0.26676342000680436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401811908","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16774128,0.01337923,0.10738917,0.010082146,0.0015732237,0.000042602685,0.0003107048,0.00056340144,0.69891834],"genre_scores_gemma":[0.932383,0.005445293,0.019545397,0.0012144438,0.0013812466,0.000060322483,0.00022061683,0.00029063548,0.039458986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994273,0.00017826435,0.000021366104,0.00008050821,0.0002128838,0.000079766505],"domain_scores_gemma":[0.99884194,0.00064346864,0.00012411099,0.00014565252,0.00014558641,0.000099290395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010362684,0.0005444579,0.00069068663,0.0035991524,0.0014795442,0.0038118314,0.0010642107,0.001330662,0.010557211],"category_scores_gemma":[0.0051616356,0.0003132247,0.00056701136,0.0017252999,0.0028382041,0.004921747,0.0011705741,0.0026015912,0.0019881064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006680817,0.000004814032,0.00005004472,0.000016587,0.0000017338301,0.000033923232,0.000056304205,0.00017906514,0.00020759128,0.9961642,0.0009636139,0.0023153059],"study_design_scores_gemma":[0.000004709834,0.000007988503,0.00018371471,0.000014747209,0.0000032730954,0.00023484814,0.000071004244,0.0024312902,0.00022288496,0.9919774,0.0048413025,0.0000067222227],"about_ca_topic_score_codex":0.0006302996,"about_ca_topic_score_gemma":0.00048544887,"teacher_disagreement_score":0.010557211,"about_ca_system_score_codex":0.0010658782,"about_ca_system_score_gemma":0.00038273007,"threshold_uncertainty_score":0.03531736},"labels":[],"label_agreement":null},{"id":"W2401828382","doi":"","title":"Some Identites Of Boole And Euler Polynomials.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Euler's formula; Arithmetic; Mathematical analysis","score_opus":0.046640968985822824,"score_gpt":0.31158465395268886,"score_spread":0.26494368496686604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401828382","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1268094,0.013692354,0.1643449,0.010128173,0.0023723852,0.0000717078,0.00087376655,0.00047726373,0.68123007],"genre_scores_gemma":[0.826318,0.0053744847,0.03816984,0.0015738056,0.0016859698,0.00009617228,0.000564373,0.00026320727,0.12595406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994254,0.0001913302,0.000029158138,0.00008802553,0.00016412337,0.0001019039],"domain_scores_gemma":[0.99929905,0.0002829318,0.00008469575,0.000090972964,0.00015165769,0.0000906373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085837493,0.0006039307,0.0005016771,0.0019522392,0.0021295059,0.0026094536,0.00066312705,0.0009909265,0.01308834],"category_scores_gemma":[0.0026008997,0.00041676295,0.0006784184,0.0015386194,0.0029427917,0.0059868526,0.002472836,0.00360621,0.0026375065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055235528,0.00000529346,0.00005336278,0.000012538616,0.0000013499333,0.000025869529,0.000094993906,0.00006405298,0.00009957536,0.9950323,0.0018148224,0.002790228],"study_design_scores_gemma":[0.000005196764,0.0000061790242,0.00015049006,0.000014643062,0.0000036717688,0.00007934406,0.00008935981,0.00054946274,0.00014851215,0.9871028,0.011844283,0.000006037246],"about_ca_topic_score_codex":0.0010247813,"about_ca_topic_score_gemma":0.0012856746,"teacher_disagreement_score":0.01308834,"about_ca_system_score_codex":0.0013853915,"about_ca_system_score_gemma":0.00058135344,"threshold_uncertainty_score":0.043784857},"labels":[],"label_agreement":null},{"id":"W2401867789","doi":"","title":"On k-connected restrained domination in graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.025865712801062674,"score_gpt":0.2704484851857391,"score_spread":0.24458277238467643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401867789","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51894593,0.0034985712,0.25280842,0.0044483608,0.00036126203,0.00019236619,0.0011889657,0.0008633744,0.21769267],"genre_scores_gemma":[0.9430001,0.001658626,0.024327334,0.0007740973,0.0003101419,0.00014294493,0.0007431557,0.00018952647,0.028854096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988489,0.0003309138,0.000063872445,0.00023694111,0.00026756592,0.00025178675],"domain_scores_gemma":[0.9944641,0.0035057415,0.0005524971,0.0005918944,0.00039127877,0.0004945104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087930745,0.0005844017,0.0008414905,0.002254952,0.002474235,0.0021464508,0.0016411594,0.00134637,0.010169269],"category_scores_gemma":[0.0056962064,0.0005337084,0.00081188796,0.0028684444,0.0033881583,0.005627529,0.0032306814,0.0024441413,0.0013653252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014275804,0.00006445645,0.0015486776,0.0002496092,0.000053996708,0.000605509,0.0013291402,0.009495594,0.0021357303,0.95052946,0.0067968657,0.027048057],"study_design_scores_gemma":[0.000020199128,0.000013923375,0.00058985595,0.000037842787,0.00001933993,0.00036133968,0.00021562407,0.012023672,0.00054774864,0.9818792,0.0042765597,0.000014818219],"about_ca_topic_score_codex":0.0025733367,"about_ca_topic_score_gemma":0.0034558927,"teacher_disagreement_score":0.010169269,"about_ca_system_score_codex":0.0015514909,"about_ca_system_score_gemma":0.00058680924,"threshold_uncertainty_score":0.03401959},"labels":[],"label_agreement":null},{"id":"W2401875620","doi":"","title":"Identities with squares of binomial coefficients.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Differential Equations and Dynamical Systems","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Binomial coefficient; Statistics; Negative binomial distribution; Gaussian binomial coefficient; Binomial (polynomial); Combinatorics; Poisson distribution","score_opus":0.01597016673916921,"score_gpt":0.26703487290000033,"score_spread":0.2510647061608311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401875620","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06791118,0.005512498,0.31804782,0.0039880774,0.0035375839,0.00007345565,0.00070413656,0.0004688823,0.59975636],"genre_scores_gemma":[0.74893886,0.0036425735,0.07864293,0.0022809408,0.0031720726,0.00016793431,0.00063325424,0.00050527987,0.16201624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987649,0.0003681077,0.00006624324,0.00019055823,0.0004696366,0.00014070098],"domain_scores_gemma":[0.9985671,0.00052516826,0.00014674373,0.00023083913,0.00037615973,0.00015391785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011341171,0.00065161247,0.00074470777,0.0018106082,0.0017567965,0.0030932012,0.00093876827,0.00087287475,0.015531451],"category_scores_gemma":[0.0052453787,0.000491296,0.00076225755,0.0012959038,0.0026900072,0.0058100936,0.0025563524,0.00280364,0.005614909],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005638476,0.000004950341,0.00006314243,0.000018324254,0.0000030416832,0.000051479445,0.00008550049,0.00009861772,0.00025632724,0.9933397,0.0026422383,0.0034309453],"study_design_scores_gemma":[0.000005049035,0.000005137886,0.00011876996,0.000015352576,0.0000041094854,0.00019268747,0.00004445497,0.0012983044,0.00026272054,0.9879374,0.010108023,0.000007951069],"about_ca_topic_score_codex":0.0008181371,"about_ca_topic_score_gemma":0.0013476695,"teacher_disagreement_score":0.015531451,"about_ca_system_score_codex":0.0008210455,"about_ca_system_score_gemma":0.0006683083,"threshold_uncertainty_score":0.051957905},"labels":[],"label_agreement":null},{"id":"W2401901234","doi":"","title":"Embedding Of Signed Graphs In Graceful Signed Graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Embedding; Chordal graph; Combinatorics; Discrete mathematics; Graph; Computer science; Artificial intelligence","score_opus":0.009570597695925626,"score_gpt":0.22835705935922185,"score_spread":0.2187864616632962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401901234","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3977148,0.0012908425,0.49241254,0.0026015115,0.0004088841,0.00014310607,0.0016678851,0.0013432645,0.10241727],"genre_scores_gemma":[0.89862436,0.0007955165,0.06715592,0.00039813243,0.0002249917,0.00011778646,0.0012571908,0.00034139707,0.03108474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992483,0.00020304743,0.000055909284,0.00017170812,0.00019667254,0.00012439283],"domain_scores_gemma":[0.99759406,0.00081229437,0.00048091452,0.0005905604,0.00020154007,0.00032061304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048906327,0.00057671726,0.000492888,0.0013681751,0.0012095171,0.0028701362,0.0011262113,0.0009830775,0.008709376],"category_scores_gemma":[0.0035745609,0.00042192245,0.0006287208,0.0014489065,0.0018034274,0.00537091,0.0026044634,0.0016821993,0.001551194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006229808,0.00003885064,0.00038221278,0.00007032004,0.000009256164,0.00007923459,0.00019014553,0.004438275,0.0018236501,0.9693318,0.0033243077,0.020249644],"study_design_scores_gemma":[0.000013110061,0.000017432641,0.00027334856,0.000024678702,0.000010422946,0.0001102376,0.0001424362,0.015689852,0.0017927372,0.97316563,0.008743996,0.000016146056],"about_ca_topic_score_codex":0.0010599555,"about_ca_topic_score_gemma":0.0014748353,"teacher_disagreement_score":0.008709376,"about_ca_system_score_codex":0.0011458927,"about_ca_system_score_gemma":0.00054584374,"threshold_uncertainty_score":0.029135764},"labels":[],"label_agreement":null},{"id":"W2401910275","doi":"","title":"Large sets of K 2, 2 -decomposition of complete bipartite graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Decomposition; Combinatorics; Robertson–Seymour theorem; Discrete mathematics; 1-planar graph; Chordal graph; Graph; Chemistry; Organic chemistry","score_opus":0.01044846602814215,"score_gpt":0.2289350486980887,"score_spread":0.21848658266994656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401910275","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5892606,0.0012766386,0.31359527,0.0021577936,0.0003567638,0.00020638328,0.004424487,0.00063786807,0.08808423],"genre_scores_gemma":[0.9194505,0.00036035888,0.05047482,0.00055332546,0.00019001681,0.00029528158,0.0036806508,0.00020792581,0.02478696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986279,0.00045785194,0.0000711549,0.0002674302,0.00032652967,0.00024905565],"domain_scores_gemma":[0.99513066,0.002393255,0.0005893816,0.0007307523,0.000557337,0.000598717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010277227,0.0006340061,0.0009775641,0.0022914284,0.0017098123,0.00342928,0.0014580584,0.0015262803,0.011102149],"category_scores_gemma":[0.007864988,0.0008076929,0.0009789435,0.0012334771,0.0015780862,0.0032682787,0.002330913,0.0019608785,0.0012901095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004402067,0.00014958893,0.0024590322,0.00022866041,0.00010270856,0.00034590682,0.00052317284,0.02852046,0.005848163,0.92982936,0.01605681,0.015495846],"study_design_scores_gemma":[0.00006008266,0.000035478093,0.0017350247,0.00007527355,0.000028482826,0.00030922372,0.00034354685,0.097156204,0.001524145,0.89273626,0.0059724604,0.0000238698],"about_ca_topic_score_codex":0.0010880196,"about_ca_topic_score_gemma":0.0017035624,"teacher_disagreement_score":0.011102149,"about_ca_system_score_codex":0.0014082151,"about_ca_system_score_gemma":0.0007788185,"threshold_uncertainty_score":0.03714037},"labels":[],"label_agreement":null},{"id":"W2401911466","doi":"","title":"On the matching polynomial of theta graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Matching (statistics); Polynomial; Discrete mathematics; Statistics; Mathematical analysis","score_opus":0.029502958017314864,"score_gpt":0.2819413303422619,"score_spread":0.25243837232494704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401911466","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32045606,0.009456234,0.262911,0.016853958,0.0021547796,0.000102413724,0.0013751314,0.00078293314,0.38590747],"genre_scores_gemma":[0.9209623,0.0041267243,0.021621611,0.0013888851,0.0014067008,0.000093475704,0.0007360287,0.000359531,0.049304828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993142,0.0001954997,0.000024475232,0.00013204249,0.00015743771,0.00017632707],"domain_scores_gemma":[0.99674267,0.002163989,0.00030560384,0.00027770989,0.00024886915,0.00026122935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011116449,0.00065618614,0.00086242735,0.0023757177,0.0011930452,0.002050445,0.001295346,0.0012154515,0.016825372],"category_scores_gemma":[0.009898699,0.00037279367,0.00068526535,0.0028243838,0.002946,0.007725754,0.0023585777,0.0039556758,0.0035725913],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060528633,0.000041217423,0.00057165656,0.00010282891,0.000011253805,0.000061196646,0.0002150019,0.002322789,0.0005010406,0.9699598,0.00804007,0.018112786],"study_design_scores_gemma":[0.0000127890125,0.000010220219,0.0002937285,0.000021114936,0.000008445125,0.000075903044,0.000076462326,0.0059863464,0.00019634538,0.98896044,0.0043502282,0.000007931108],"about_ca_topic_score_codex":0.0024523665,"about_ca_topic_score_gemma":0.00238593,"teacher_disagreement_score":0.016825372,"about_ca_system_score_codex":0.0017798532,"about_ca_system_score_gemma":0.0007051072,"threshold_uncertainty_score":0.056286514},"labels":[],"label_agreement":null},{"id":"W2401927767","doi":"","title":"Counting embeddings of a chain into a binary tree.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Binary tree; Random binary tree; Tree (set theory); Chain (unit); Binary number; Combinatorics; Arithmetic; Physics","score_opus":0.008191358697005907,"score_gpt":0.24616541993636018,"score_spread":0.23797406123935427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401927767","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21187553,0.0015174154,0.6874078,0.0022808549,0.00049089786,0.00023987851,0.0034975575,0.0016470045,0.09104301],"genre_scores_gemma":[0.6616236,0.0012458871,0.2864447,0.000550575,0.000486813,0.0003971653,0.0051940735,0.0010005438,0.0430567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997154,0.000675498,0.00030962125,0.00060900144,0.0008589526,0.0003929231],"domain_scores_gemma":[0.98630047,0.007377635,0.0010982559,0.0023977214,0.0016700078,0.0011558384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016741452,0.0008428443,0.0008545223,0.0034133354,0.0019952033,0.0048477943,0.0021371066,0.001819465,0.019048288],"category_scores_gemma":[0.01831245,0.000923507,0.00089871144,0.0049107876,0.0022179869,0.014873756,0.0041318447,0.0026879124,0.0031796577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001895632,0.00010880209,0.0029149135,0.00033454454,0.00004645278,0.00019432303,0.0005416811,0.002773174,0.0025991953,0.9238663,0.010724243,0.055706855],"study_design_scores_gemma":[0.00002022129,0.00004420832,0.0006792043,0.00009581719,0.000056093864,0.00039667918,0.0002577991,0.019630278,0.002248847,0.9608679,0.01567991,0.000023067158],"about_ca_topic_score_codex":0.0011364844,"about_ca_topic_score_gemma":0.0018821904,"teacher_disagreement_score":0.019048288,"about_ca_system_score_codex":0.0014017939,"about_ca_system_score_gemma":0.00076169084,"threshold_uncertainty_score":0.06372291},"labels":[],"label_agreement":null},{"id":"W2401936605","doi":"","title":"On constructing graphs with the same status sequence.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Sequence (biology); Combinatorics; Genetics; Biology","score_opus":0.009778228132760717,"score_gpt":0.21883322792015747,"score_spread":0.20905499978739675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401936605","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06808162,0.00068438944,0.81323004,0.0041276794,0.00077106676,0.00046843378,0.0015936162,0.004012112,0.10703104],"genre_scores_gemma":[0.29166266,0.0011134697,0.6453713,0.0015142877,0.00030032505,0.0005640592,0.0043697455,0.002517032,0.052587148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998116,0.0006912213,0.00010616359,0.0004253008,0.00037506185,0.00028636],"domain_scores_gemma":[0.9910699,0.0029824858,0.00039869137,0.0039925845,0.00094188214,0.0006144769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022397044,0.00092221494,0.0007488785,0.002455642,0.003439351,0.0026948457,0.0022395423,0.0019501899,0.017163094],"category_scores_gemma":[0.01240669,0.0007365254,0.0012887482,0.0029097854,0.0030886272,0.010903208,0.0051382873,0.0027745492,0.00849162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026411036,0.00027375767,0.0013696307,0.00030726878,0.000035469082,0.00026352162,0.0012000884,0.005728409,0.005490521,0.83335,0.025550548,0.12616663],"study_design_scores_gemma":[0.000032205127,0.000055862616,0.00039603215,0.000083924846,0.000046279503,0.00025821943,0.00046762158,0.012586945,0.0034541897,0.95588696,0.02669557,0.000036203393],"about_ca_topic_score_codex":0.0016876454,"about_ca_topic_score_gemma":0.0034133645,"teacher_disagreement_score":0.017163094,"about_ca_system_score_codex":0.0010798414,"about_ca_system_score_gemma":0.0015493901,"threshold_uncertainty_score":0.05741626},"labels":[],"label_agreement":null},{"id":"W2401943296","doi":"","title":"The existence for large sets of disjoint pure directed triple systems with even orders.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Disjoint sets; Mathematics; Combinatorics","score_opus":0.0066843686227352,"score_gpt":0.20485303100480218,"score_spread":0.19816866238206698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401943296","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5924497,0.00269439,0.28783444,0.003071944,0.0003506956,0.00011586366,0.0013113543,0.00080573757,0.11136575],"genre_scores_gemma":[0.9582509,0.000501058,0.03323936,0.00034420044,0.00012787567,0.00016107032,0.0004998778,0.00011376416,0.0067620045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979955,0.0006194552,0.00014268463,0.0004096538,0.0005438655,0.00028893046],"domain_scores_gemma":[0.98169553,0.012658145,0.0012949101,0.0021524506,0.0011785643,0.0010203482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018750125,0.00041790077,0.0009902796,0.0026018189,0.0038495355,0.006123849,0.0011899871,0.0014571914,0.008353985],"category_scores_gemma":[0.014942248,0.0012356684,0.0010000275,0.0014374268,0.003915266,0.0092215175,0.0042435797,0.0023986606,0.0010757225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007990566,0.000028371802,0.0011292679,0.00010528021,0.000029344477,0.0001286808,0.00036145598,0.0016487077,0.001543808,0.9869472,0.001802659,0.0061952462],"study_design_scores_gemma":[0.000020930484,0.000015986918,0.00040653453,0.000048846872,0.000028259914,0.0003512279,0.00026814305,0.009058727,0.0015374207,0.9848905,0.0033527876,0.000020553996],"about_ca_topic_score_codex":0.00070900016,"about_ca_topic_score_gemma":0.0011104885,"teacher_disagreement_score":0.008353985,"about_ca_system_score_codex":0.0016107421,"about_ca_system_score_gemma":0.00095688994,"threshold_uncertainty_score":0.02794683},"labels":[],"label_agreement":null},{"id":"W2401943572","doi":"","title":"On a graph partition result of Kuhn and Osthus.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"History and advancements in chemistry","field":"Chemistry","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Partition (number theory); Graph; Combinatorics","score_opus":0.012053095796801392,"score_gpt":0.24447586760011947,"score_spread":0.23242277180331808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401943572","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09622533,0.027871499,0.33819407,0.030915894,0.004205624,0.00021891647,0.0028432438,0.0011820707,0.49834338],"genre_scores_gemma":[0.6899659,0.022176001,0.12045698,0.015298509,0.005928164,0.00048153388,0.004818766,0.0019937747,0.13888039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990747,0.00024551872,0.000025168316,0.00020099613,0.00028147758,0.00017218625],"domain_scores_gemma":[0.9963397,0.0022492923,0.00018586684,0.0006064804,0.00033424553,0.00028443793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001339359,0.0009967752,0.0016719738,0.0028121648,0.0031148114,0.0032051879,0.002602465,0.0015881631,0.020146087],"category_scores_gemma":[0.007427926,0.0005656117,0.0014734414,0.0053577865,0.0032697704,0.013008914,0.0048421687,0.0049059642,0.0045602177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013890445,0.00007659898,0.0005074043,0.00020400053,0.000041551448,0.00011936572,0.00037719525,0.0020868578,0.00075685466,0.9373486,0.038593788,0.019748837],"study_design_scores_gemma":[0.000026448319,0.000022565258,0.000526025,0.0000607138,0.000040903604,0.00013604401,0.00013837869,0.0040803147,0.00032481534,0.9702187,0.024406219,0.000018929451],"about_ca_topic_score_codex":0.0036950046,"about_ca_topic_score_gemma":0.0040808097,"teacher_disagreement_score":0.020146087,"about_ca_system_score_codex":0.0021103173,"about_ca_system_score_gemma":0.0010104462,"threshold_uncertainty_score":0.06739545},"labels":[],"label_agreement":null},{"id":"W2401951335","doi":"","title":"Total vertex irregularity strength of certain equitable complete m-partite graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Graph","score_opus":0.030737289247498113,"score_gpt":0.24514740247710828,"score_spread":0.21441011322961018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401951335","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9306455,0.0002767356,0.02571412,0.0007589917,0.00004299189,0.000031365056,0.0007885546,0.00014022793,0.04160147],"genre_scores_gemma":[0.9920918,0.00012358795,0.0040559545,0.00009082766,0.0000394383,0.000029709887,0.0004520849,0.000045102963,0.0030714886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993351,0.00021371337,0.00003076312,0.00014365549,0.00014897845,0.00012774156],"domain_scores_gemma":[0.9934017,0.00377892,0.0010192697,0.000670159,0.00044634973,0.0006835501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009054491,0.0004122902,0.00061933376,0.0018882126,0.0016723626,0.0023532496,0.0010895401,0.00086147635,0.0072190603],"category_scores_gemma":[0.0066317264,0.0004931883,0.00047224184,0.001417923,0.0014339568,0.0022130231,0.0011510842,0.0011489349,0.0004563194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049321604,0.00010450613,0.008465247,0.0002466373,0.00008012732,0.0004496798,0.00060472294,0.030965103,0.008675935,0.9235521,0.0077579087,0.018604955],"study_design_scores_gemma":[0.000077223056,0.00009013527,0.006856136,0.000058775993,0.00008580237,0.0008498463,0.00066573295,0.11067009,0.0056623872,0.8682357,0.006704216,0.000043946275],"about_ca_topic_score_codex":0.00075218146,"about_ca_topic_score_gemma":0.0011110208,"teacher_disagreement_score":0.0072190603,"about_ca_system_score_codex":0.00097030745,"about_ca_system_score_gemma":0.00034507635,"threshold_uncertainty_score":0.024150133},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Nonlinear system; Applied mathematics; Mathematical analysis; Physics","score_opus":0.022238375570106217,"score_gpt":0.29987317534059765,"score_spread":0.27763479977049144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401964130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15708652,0.0032468399,0.7880156,0.0066783647,0.00060664135,0.00013652611,0.00030295423,0.00034126895,0.043585345],"genre_scores_gemma":[0.9546033,0.0015909552,0.029533405,0.0005772002,0.000426614,0.00021391467,0.00022470356,0.00012310274,0.012706836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987238,0.00068652106,0.000059832873,0.00013748372,0.00023616543,0.00015604105],"domain_scores_gemma":[0.9790166,0.016255721,0.0017007808,0.0006399618,0.0013479647,0.0010389369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004486717,0.0008344487,0.0012604911,0.0016762648,0.00086960936,0.0018997515,0.0014928387,0.0022335132,0.0053705634],"category_scores_gemma":[0.03509731,0.0005456679,0.0012725682,0.0006658378,0.0045230826,0.0036786713,0.0037325113,0.0025466767,0.0004891712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044826003,0.000042904903,0.0020645738,0.00014549076,0.00010256117,0.00027936773,0.0002618222,0.05785935,0.0011557636,0.93047357,0.0026190986,0.004950606],"study_design_scores_gemma":[0.00003190428,0.00004098228,0.0011037171,0.000047011377,0.0000352145,0.00016228914,0.00012027374,0.52888244,0.00021366161,0.46813238,0.0011974401,0.00003259226],"about_ca_topic_score_codex":0.0032664724,"about_ca_topic_score_gemma":0.001761437,"teacher_disagreement_score":0.0053705634,"about_ca_system_score_codex":0.0012788707,"about_ca_system_score_gemma":0.0010731514,"threshold_uncertainty_score":0.023728251},"labels":[],"label_agreement":null},{"id":"W2401967715","doi":"","title":"On Multiparameter q-Noncentral Stirling and Bell Numbers.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematical Inequalities and Applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Stirling engine; Physics; Thermodynamics","score_opus":0.09991216856422491,"score_gpt":0.3430533959780834,"score_spread":0.24314122741385846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401967715","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085233375,0.025978507,0.52531964,0.010395308,0.0029562614,0.000106886124,0.00058630155,0.00031886954,0.3491049],"genre_scores_gemma":[0.85793555,0.010273637,0.063974366,0.0028763833,0.003031991,0.00026857966,0.00034339644,0.00029651163,0.060999475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982887,0.00067056157,0.00007562228,0.00022974706,0.00041938867,0.00031603815],"domain_scores_gemma":[0.99179757,0.0053183115,0.0008150787,0.0006204021,0.00090763636,0.0005410142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043703048,0.0013721236,0.0013354027,0.0039014197,0.002072477,0.0039905855,0.002314298,0.00260309,0.0130113885],"category_scores_gemma":[0.016475737,0.0006301083,0.001148907,0.002520327,0.0065123597,0.010469057,0.003905777,0.0063297492,0.0028054442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008846958,0.0000046925475,0.000039505096,0.00001961997,0.0000027913848,0.000022627808,0.00003595426,0.00043031576,0.0001017882,0.9971927,0.0008230794,0.0013182627],"study_design_scores_gemma":[0.0000035596015,0.0000051653683,0.00007018295,0.000023629898,0.0000031357822,0.000041122235,0.000026141277,0.0042142295,0.00007236717,0.99354774,0.001982314,0.000010353743],"about_ca_topic_score_codex":0.0014790356,"about_ca_topic_score_gemma":0.0014834314,"teacher_disagreement_score":0.0130113885,"about_ca_system_score_codex":0.0029368165,"about_ca_system_score_gemma":0.0012058647,"threshold_uncertainty_score":0.043527484},"labels":[],"label_agreement":null},{"id":"W2401993019","doi":"","title":"Closed Formulae for Gauss Hypergeometric Series.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"3D Modeling in Geospatial Applications","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Gauss; Series (stratigraphy); Bilateral hypergeometric series; Basic hypergeometric series; Appell series; Hypergeometric function; Pure mathematics; Generalized hypergeometric function; Hypergeometric function of a matrix argument; Geology; Physics; Paleontology","score_opus":0.008768283366283096,"score_gpt":0.21957687386545038,"score_spread":0.21080859049916728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401993019","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07057675,0.0050750067,0.6144377,0.003687183,0.001952996,0.000110017136,0.0011463616,0.0008366601,0.30217734],"genre_scores_gemma":[0.7951813,0.0045699133,0.10893246,0.001578421,0.0025390987,0.00034311175,0.00091512693,0.00093149755,0.085009135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989956,0.00026947423,0.000061366976,0.00016883251,0.00038170454,0.00012305456],"domain_scores_gemma":[0.99668497,0.0017885396,0.00026820457,0.00026859413,0.0006915316,0.00029824092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019824575,0.001011024,0.0009666696,0.0044799787,0.0014300504,0.004905131,0.0014580521,0.0013617598,0.020663494],"category_scores_gemma":[0.012274842,0.0004657153,0.0009267848,0.0027992162,0.0031369706,0.0064713177,0.0022867022,0.0037822295,0.005264177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008011482,0.000012545047,0.000095435185,0.000030410147,0.0000056517893,0.000039860744,0.00008637636,0.00041970523,0.0001918922,0.9892302,0.0028519346,0.00702797],"study_design_scores_gemma":[0.0000063418934,0.000005798054,0.00011097232,0.000025631694,0.0000064300957,0.00012985218,0.00005059259,0.005787597,0.00020714039,0.9872636,0.006392344,0.000013790402],"about_ca_topic_score_codex":0.0009259044,"about_ca_topic_score_gemma":0.001267379,"teacher_disagreement_score":0.020663494,"about_ca_system_score_codex":0.0020254615,"about_ca_system_score_gemma":0.0007488653,"threshold_uncertainty_score":0.06912631},"labels":[],"label_agreement":null},{"id":"W2402021895","doi":"","title":"On the lower and upper bounds for the Euclidean norm of a complex matrix and its Applications.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Euclidean geometry; Norm (philosophy); Matrix (chemical analysis); Upper and lower bounds; Matrix norm; Euclidean distance matrix; Euclidean distance; Pure mathematics; Combinatorics; Mathematical analysis; Geometry; Eigenvalues and eigenvectors","score_opus":0.013040818740399158,"score_gpt":0.24815105249620723,"score_spread":0.23511023375580806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402021895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01744487,0.045254037,0.8334261,0.0074868943,0.003123673,0.00008252574,0.0009295637,0.0006269982,0.09162536],"genre_scores_gemma":[0.45357224,0.049920525,0.42125502,0.0056237527,0.010862891,0.0009065805,0.0021241985,0.0015373025,0.05419752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949286,0.0017974407,0.0003913962,0.00075777917,0.0016694817,0.0004553014],"domain_scores_gemma":[0.96220475,0.028528899,0.0015636222,0.00323709,0.0031381354,0.0013273795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008241151,0.003213437,0.0023263553,0.005479098,0.0017698371,0.0056518926,0.0043810573,0.003746798,0.011268247],"category_scores_gemma":[0.061190497,0.0010660564,0.0015580804,0.005224111,0.006686679,0.012949646,0.0065048486,0.012047983,0.0061619915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014235968,0.00008312728,0.00043567174,0.00030874458,0.000049623744,0.00014882034,0.00027645245,0.011224019,0.0016345008,0.9348625,0.01396186,0.036872387],"study_design_scores_gemma":[0.000012606257,0.000042846128,0.00038893268,0.00015962547,0.000029048844,0.00023749267,0.00010127466,0.049005076,0.0009505711,0.9355842,0.013435079,0.000053271684],"about_ca_topic_score_codex":0.0017919383,"about_ca_topic_score_gemma":0.002448066,"teacher_disagreement_score":0.011268247,"about_ca_system_score_codex":0.0022310014,"about_ca_system_score_gemma":0.0012181568,"threshold_uncertainty_score":0.04358387},"labels":[],"label_agreement":null},{"id":"W2402028350","doi":"","title":"A Neighborhood Condition for Graphs to Have (g, f)-Factors.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01911855302737888,"score_gpt":0.304653859299141,"score_spread":0.28553530627176216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402028350","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56853557,0.0019259471,0.1624044,0.0059789824,0.0012783975,0.00030282198,0.0033902181,0.001524173,0.25465962],"genre_scores_gemma":[0.9410423,0.00049180567,0.037155025,0.00076433184,0.00041764844,0.00030426207,0.0017532669,0.00026895505,0.017802482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917763,0.0001695284,0.00006576128,0.00029157207,0.00014245149,0.00015307598],"domain_scores_gemma":[0.9948384,0.0025227803,0.00039545505,0.0006343234,0.00069798465,0.0009109911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069725723,0.00031048083,0.00083658163,0.0008159979,0.0031272306,0.0017210796,0.0010265069,0.0023600098,0.0149427615],"category_scores_gemma":[0.0095231505,0.00048709507,0.00075435464,0.00058315316,0.0017394364,0.0046423837,0.0019763787,0.001764431,0.002387526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006178321,0.00015121831,0.0040207417,0.00021376328,0.000031619034,0.0009438283,0.001008335,0.001903506,0.011096104,0.93391985,0.02312465,0.022968562],"study_design_scores_gemma":[0.00023091343,0.00021324903,0.0036472364,0.00013494905,0.00006911848,0.0021409765,0.0016902875,0.011296139,0.0076250103,0.9377632,0.03510623,0.000082593295],"about_ca_topic_score_codex":0.0021270127,"about_ca_topic_score_gemma":0.00282219,"teacher_disagreement_score":0.0149427615,"about_ca_system_score_codex":0.0006524825,"about_ca_system_score_gemma":0.00081059587,"threshold_uncertainty_score":0.04998851},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Girth (graph theory); Wiener index; Index (typography); Combinatorics; Discrete mathematics; Graph; Computer science; World Wide Web","score_opus":0.014489646453789804,"score_gpt":0.2546082013446283,"score_spread":0.2401185548908385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402033281","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80543506,0.0035741946,0.087835506,0.0014046029,0.0004760503,0.00003580359,0.0005438861,0.0002782727,0.100416586],"genre_scores_gemma":[0.98052603,0.0015728367,0.00783116,0.0001479844,0.000322342,0.000044687735,0.00023847341,0.00012830296,0.009188198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995092,0.000121681594,0.000025672745,0.00007853777,0.00014464137,0.000120343466],"domain_scores_gemma":[0.99716324,0.0014846568,0.0004778645,0.00022642003,0.00022632288,0.00042148173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000807766,0.00052831694,0.00094787456,0.003967072,0.0010082782,0.0020983815,0.0010808418,0.00084937393,0.005039976],"category_scores_gemma":[0.006641257,0.0003617859,0.00036138913,0.0022113675,0.0021606465,0.0041164085,0.0022250917,0.0013815311,0.0010708204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012981411,0.000026885786,0.0012233238,0.00007892772,0.000018698875,0.00010920847,0.00033498838,0.005225981,0.0027677584,0.97406626,0.0026372774,0.013380821],"study_design_scores_gemma":[0.000013746213,0.000027995298,0.0010145155,0.000045992372,0.0000145927725,0.00018447549,0.00014629427,0.01728781,0.0012003968,0.97739124,0.0026497191,0.000023349538],"about_ca_topic_score_codex":0.0005162403,"about_ca_topic_score_gemma":0.00074920896,"teacher_disagreement_score":0.005039976,"about_ca_system_score_codex":0.0010586658,"about_ca_system_score_gemma":0.0003161188,"threshold_uncertainty_score":0.016860425},"labels":[],"label_agreement":null},{"id":"W2402036020","doi":"","title":"On competition polysemy and m-competition polysemy.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Polysemy; Competition (biology); Mathematics; Characterization (materials science); Combinatorics; Graph; Competition model; Linguistics; Philosophy; Biology; Political science; Physics","score_opus":0.009342753128615452,"score_gpt":0.2652600831487611,"score_spread":0.25591733002014566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402036020","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23614813,0.010868469,0.5362393,0.006690192,0.0011876454,0.00032879473,0.0019332506,0.0005550595,0.20604917],"genre_scores_gemma":[0.9000184,0.0037078941,0.06780438,0.0022677297,0.001106053,0.0003341125,0.0014277588,0.00027620597,0.023057528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775034,0.000617061,0.00017994392,0.0007023655,0.00044359994,0.00030666875],"domain_scores_gemma":[0.9928964,0.003865776,0.0007968488,0.0010372178,0.0008598694,0.00054397195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017910294,0.0011245827,0.0009570308,0.0030875162,0.0036324556,0.0023229038,0.0011574279,0.0018647629,0.010070716],"category_scores_gemma":[0.008378623,0.0008173278,0.0013946613,0.003368821,0.006285507,0.013720319,0.004608935,0.003281529,0.0012726311],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006189117,0.000027267757,0.0006381423,0.00013411169,0.000022864753,0.00026055143,0.0007571218,0.0011491914,0.0013113988,0.9845924,0.0020244487,0.009020645],"study_design_scores_gemma":[0.0000142773115,0.000048073427,0.00093678996,0.00006134435,0.00002743052,0.0005813276,0.00032872142,0.0046913503,0.0007995096,0.9778618,0.014614287,0.00003502196],"about_ca_topic_score_codex":0.0014655363,"about_ca_topic_score_gemma":0.0016679849,"teacher_disagreement_score":0.010070716,"about_ca_system_score_codex":0.0019292415,"about_ca_system_score_gemma":0.000661427,"threshold_uncertainty_score":0.033689857},"labels":[],"label_agreement":null},{"id":"W2402036779","doi":"","title":"On a new Stirling's series.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Functional Equations Stability Results","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Stirling engine; Mathematics; Series (stratigraphy); Stirling numbers of the first kind; Stirling number; Pure mathematics; Geology; Engineering; Mechanical engineering","score_opus":0.046667073046404724,"score_gpt":0.29636949260590034,"score_spread":0.24970241955949563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402036779","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06709224,0.011219526,0.2359594,0.006584334,0.0074581867,0.000053843163,0.0003962711,0.00051668513,0.6707195],"genre_scores_gemma":[0.6595636,0.0103813,0.06356728,0.0031171297,0.007746746,0.00011941648,0.00050457666,0.0009094392,0.25409058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995741,0.00008266947,0.000020705262,0.0000767795,0.00018966825,0.00005593642],"domain_scores_gemma":[0.9991823,0.00030744207,0.00007948947,0.00011295664,0.00017366385,0.00014419759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085482234,0.0008027576,0.0006060866,0.0028883654,0.0013091705,0.0025215405,0.0010290948,0.00089123246,0.017860219],"category_scores_gemma":[0.0033186087,0.00027667443,0.00087802403,0.0015160944,0.0020236059,0.004738271,0.0017999285,0.0023095983,0.004223847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009690621,0.0000064160217,0.000046689598,0.000038179252,0.0000036029494,0.00004906649,0.00007254372,0.0002672026,0.0005191796,0.9878997,0.0036510967,0.0074365893],"study_design_scores_gemma":[0.000006780596,0.0000129563,0.000102277045,0.000026754093,0.0000070484652,0.00022438215,0.00003896505,0.002873804,0.00047081933,0.9762901,0.019934323,0.000011862368],"about_ca_topic_score_codex":0.0005301701,"about_ca_topic_score_gemma":0.0007079428,"teacher_disagreement_score":0.017860219,"about_ca_system_score_codex":0.0010165777,"about_ca_system_score_gemma":0.00050191383,"threshold_uncertainty_score":0.05974835},"labels":[],"label_agreement":null},{"id":"W2402045463","doi":"","title":"On α - Incidence Energy and α - Distance Energy of a Graph.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Energy (signal processing); Incidence (geometry); Graph; Combinatorics; Statistics; Geometry","score_opus":0.022492839148709625,"score_gpt":0.2670354058054746,"score_spread":0.24454256665676496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402045463","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47277507,0.008098408,0.24678053,0.0070126555,0.0010852742,0.00006320488,0.0009561463,0.00022613416,0.26300266],"genre_scores_gemma":[0.94247425,0.0027688108,0.023281453,0.001000732,0.00081622263,0.000109726025,0.0004896362,0.00019466986,0.028864553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993709,0.00018030424,0.000029601408,0.0001208192,0.00018957851,0.00010893661],"domain_scores_gemma":[0.9969674,0.0017416634,0.0003063971,0.0002961097,0.00031394832,0.0003744286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009154075,0.00055755686,0.00065739895,0.0031286029,0.0012464201,0.0017597015,0.0013682239,0.001389229,0.010085897],"category_scores_gemma":[0.0049301796,0.00031129265,0.0005085912,0.0020091543,0.002944267,0.005123909,0.002048817,0.0024058656,0.0013924834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001703463,0.000016911885,0.00054803054,0.000045547145,0.000008926023,0.00004465012,0.000110280605,0.0019368071,0.00048632387,0.98851997,0.0019984632,0.006266945],"study_design_scores_gemma":[0.0000033558435,0.000009231929,0.00053741084,0.000023389892,0.000005253827,0.000120602475,0.00011151427,0.007860008,0.00019476294,0.9888659,0.002260293,0.000008359305],"about_ca_topic_score_codex":0.0006554258,"about_ca_topic_score_gemma":0.00063809793,"teacher_disagreement_score":0.010085897,"about_ca_system_score_codex":0.0011103172,"about_ca_system_score_gemma":0.0002795748,"threshold_uncertainty_score":0.03374076},"labels":[],"label_agreement":null},{"id":"W2402046163","doi":"","title":"Two paths joining given vertices in (2k+1)-edge-connected graphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Computer science; Telecommunications","score_opus":0.013010302553631356,"score_gpt":0.24010965132346485,"score_spread":0.22709934876983348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402046163","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.705226,0.0014299918,0.18454163,0.0026806558,0.00091260177,0.0007106588,0.005797554,0.0011488784,0.09755206],"genre_scores_gemma":[0.8040242,0.0009991209,0.13430996,0.00027459385,0.00007087507,0.00044093517,0.004239213,0.00018977249,0.055451456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991684,0.00018054851,0.00005546378,0.00021254345,0.00015925117,0.00022379783],"domain_scores_gemma":[0.9980909,0.00066178315,0.00040362542,0.00026061907,0.00027732863,0.00030573836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003167436,0.0005623858,0.00048458154,0.0010634956,0.001953523,0.0025488203,0.001296723,0.0021022332,0.024100494],"category_scores_gemma":[0.004239233,0.00048684553,0.00049743487,0.0014911742,0.0011374826,0.0035138703,0.0023224563,0.0011102479,0.004089386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004574865,0.0007571903,0.010583639,0.0029444864,0.00036347922,0.008428716,0.0036947632,0.025822094,0.054895528,0.6165323,0.022725414,0.24867755],"study_design_scores_gemma":[0.000553569,0.0005823332,0.012958997,0.0009599897,0.00038393564,0.0056292685,0.004336951,0.071401335,0.053765643,0.7105721,0.13860872,0.0002471027],"about_ca_topic_score_codex":0.0011577554,"about_ca_topic_score_gemma":0.0028038332,"teacher_disagreement_score":0.024100494,"about_ca_system_score_codex":0.0010245177,"about_ca_system_score_gemma":0.00087940926,"threshold_uncertainty_score":0.08062416},"labels":[],"label_agreement":null},{"id":"W2402081918","doi":"","title":"A note on k-tridiagonal matrices with the balancing and Lucas-balancing numbers.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tridiagonal matrix; Mathematics; Lucas sequence; Lucas number; Combinatorics; Fibonacci number; Fibonacci polynomials; Orthogonal polynomials","score_opus":0.008564142804703825,"score_gpt":0.257257675757852,"score_spread":0.2486935329531482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402081918","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01884839,0.03886581,0.35420826,0.02410906,0.04309141,0.00010762703,0.0008690874,0.0012084803,0.5186919],"genre_scores_gemma":[0.42432117,0.030623062,0.2949333,0.01856471,0.030664435,0.00033614805,0.0009320084,0.0011446284,0.19848062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943966,0.00014759802,0.000045598106,0.00010437301,0.00019511482,0.00006761307],"domain_scores_gemma":[0.99874806,0.00059468736,0.00010115814,0.00020637756,0.00020898398,0.00014067325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009927006,0.0010272186,0.00063503115,0.0015468907,0.0018802127,0.002210893,0.0014704773,0.0012269795,0.017067373],"category_scores_gemma":[0.004610349,0.00047863726,0.0006795673,0.002262457,0.0032236194,0.0051490213,0.0022469256,0.0040990436,0.0061593456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044839166,0.000023656045,0.00014268528,0.000152677,0.00001198631,0.00022772144,0.00021566729,0.0007551699,0.0011852486,0.906032,0.060335256,0.030873131],"study_design_scores_gemma":[0.0000063250195,0.000024186094,0.00025411422,0.000055447115,0.000007934305,0.00035110192,0.00008450096,0.0015802013,0.0005304166,0.8724746,0.124606915,0.00002418448],"about_ca_topic_score_codex":0.0017280163,"about_ca_topic_score_gemma":0.0033842027,"teacher_disagreement_score":0.017067373,"about_ca_system_score_codex":0.00081218086,"about_ca_system_score_gemma":0.00072412984,"threshold_uncertainty_score":0.057096064},"labels":[],"label_agreement":null},{"id":"W2402096899","doi":"","title":"Bounds of eigenvalues of a nontrivial bipartite graph.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Eigenvalues and eigenvectors; Combinatorics; Complete bipartite graph; Graph; Discrete mathematics","score_opus":0.020848365783589142,"score_gpt":0.2834701295530812,"score_spread":0.2626217637694921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402096899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32907984,0.0038610806,0.36837775,0.007376588,0.001314117,0.00011392111,0.0018071558,0.0014640454,0.2866056],"genre_scores_gemma":[0.9474205,0.0011671431,0.032484736,0.0004827539,0.0007165646,0.0002035691,0.00068077655,0.00041387737,0.016430076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998672,0.00034644472,0.000053135453,0.00026396345,0.000407325,0.00025723645],"domain_scores_gemma":[0.9834947,0.011893512,0.0010711175,0.0009903704,0.0011811685,0.0013690423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012606154,0.0015401953,0.000913659,0.0037640363,0.0013649857,0.0028098966,0.001873109,0.0015510226,0.019001106],"category_scores_gemma":[0.016149849,0.0004875498,0.000617879,0.0015768096,0.0029511955,0.004201147,0.0027885402,0.003084324,0.002893096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017717881,0.00008429187,0.0008892757,0.00024634856,0.000044673583,0.00018705567,0.00031806077,0.009272451,0.005042142,0.9588411,0.01161381,0.013283743],"study_design_scores_gemma":[0.00002034244,0.00002373066,0.0007318203,0.00006486472,0.000016447344,0.00016652119,0.00011515175,0.041826382,0.0013399047,0.9529081,0.0027599127,0.000026898719],"about_ca_topic_score_codex":0.0007146567,"about_ca_topic_score_gemma":0.0011832736,"teacher_disagreement_score":0.019001106,"about_ca_system_score_codex":0.0012858816,"about_ca_system_score_gemma":0.00053000357,"threshold_uncertainty_score":0.063565016},"labels":[],"label_agreement":null},{"id":"W2402103922","doi":"","title":"On the Magic Space of Locally Finite Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; MAGIC (telescope); Space (punctuation); Pure mathematics; Computer science; Astronomy; Physics","score_opus":0.013908463387737258,"score_gpt":0.2173933797736019,"score_spread":0.20348491638586463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402103922","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51722014,0.0047729816,0.24098039,0.007953836,0.00035724379,0.00008769777,0.0024580362,0.0007599855,0.2254097],"genre_scores_gemma":[0.9394813,0.0013777413,0.032641638,0.00063655735,0.00027832852,0.000114689276,0.0012783482,0.00017453535,0.024016835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912316,0.000290089,0.00004324472,0.00016776564,0.00018110803,0.0001946225],"domain_scores_gemma":[0.99684286,0.0019622277,0.00030003337,0.00037805457,0.00017929671,0.00033752868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000757246,0.0005061764,0.0007575528,0.0019138394,0.0020116935,0.0031334383,0.0014040706,0.0013091579,0.0122782765],"category_scores_gemma":[0.004105232,0.0004475295,0.0007059268,0.0020884473,0.0036310412,0.008102325,0.0033000186,0.0029612628,0.0012989028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037181893,0.000013778047,0.0002331994,0.000040599603,0.0000060016205,0.000023885039,0.000118317395,0.0013216119,0.00027462334,0.98925626,0.0022058967,0.0064686094],"study_design_scores_gemma":[0.000008617731,0.0000049010932,0.00014090845,0.000014426642,0.000004279133,0.000037459497,0.000077081306,0.0033270493,0.0001792148,0.99408674,0.002112825,0.000006494714],"about_ca_topic_score_codex":0.0020496685,"about_ca_topic_score_gemma":0.0025963464,"teacher_disagreement_score":0.0122782765,"about_ca_system_score_codex":0.0015901068,"about_ca_system_score_gemma":0.0007785395,"threshold_uncertainty_score":0.04107499},"labels":[],"label_agreement":null},{"id":"W2402115169","doi":"","title":"Path Extendability and Degree Sum in Graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Combinatorics; Path (computing); Discrete mathematics; Computer science; Computer network; Physics","score_opus":0.04391162493109703,"score_gpt":0.2983913215405891,"score_spread":0.2544796966094921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402115169","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53059036,0.0036443172,0.28914234,0.0040625883,0.00055228325,0.00007935638,0.0010223485,0.0004953547,0.17041108],"genre_scores_gemma":[0.94649744,0.0020859651,0.027759427,0.0003997116,0.0006363269,0.00007115623,0.00061310304,0.00014649979,0.021790348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990557,0.00022415555,0.000059260306,0.00029111753,0.0002258968,0.00014385411],"domain_scores_gemma":[0.9958118,0.0024105504,0.0004718519,0.000556332,0.0002902664,0.00045916764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086654554,0.0005482012,0.0006940329,0.001956773,0.0014925423,0.0023560813,0.0011321306,0.0007216336,0.0072685145],"category_scores_gemma":[0.0053585083,0.00043148588,0.00077713863,0.0022503424,0.002759198,0.00830101,0.0028766105,0.0027573158,0.0007981992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000460477,0.00003057555,0.0010490507,0.00008500127,0.000019438741,0.00013162052,0.0003520189,0.0022001874,0.0011622298,0.97417384,0.0016449053,0.01910519],"study_design_scores_gemma":[0.000005020752,0.0000094154,0.00048323208,0.000015027698,0.000014969596,0.00021183773,0.00008219675,0.002544523,0.00048428282,0.9930682,0.0030743608,0.000006869881],"about_ca_topic_score_codex":0.0007186658,"about_ca_topic_score_gemma":0.0010322788,"teacher_disagreement_score":0.0072685145,"about_ca_system_score_codex":0.00077912246,"about_ca_system_score_gemma":0.00035568402,"threshold_uncertainty_score":0.024315596},"labels":[],"label_agreement":null},{"id":"W2402116122","doi":"","title":"A Transformation For The Al-Salam-Carlitz Polynomials.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Transformation (genetics); Pure mathematics; Algebra over a field","score_opus":0.009720844665256738,"score_gpt":0.2590783306855681,"score_spread":0.24935748602031138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402116122","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08189706,0.0028837943,0.35471565,0.0063421396,0.0036070712,0.00016872634,0.00076788274,0.0007833872,0.5488343],"genre_scores_gemma":[0.7410549,0.0018005458,0.08985549,0.0021113516,0.0013984278,0.00019449281,0.0004896931,0.0007093656,0.16238584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996061,0.00009770582,0.000015544816,0.00006298185,0.0001485948,0.0000692],"domain_scores_gemma":[0.9997002,0.00006841695,0.00003183037,0.000060561706,0.000075006355,0.00006408253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005676632,0.0005185916,0.00038413532,0.0014052779,0.0015034226,0.0017138273,0.0006616338,0.00078618195,0.018883437],"category_scores_gemma":[0.0020060847,0.00022754226,0.00071348454,0.0009423502,0.0020806794,0.0028461856,0.0018168731,0.002726293,0.005189809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012529277,0.000011155042,0.000034293684,0.000011871796,0.0000017111787,0.000028434208,0.00007459249,0.00015180155,0.00049143657,0.99108106,0.0023942543,0.005706914],"study_design_scores_gemma":[0.00001445142,0.000014393666,0.00011616445,0.000013837777,0.0000034963866,0.000120081866,0.00006766745,0.002432174,0.0005551423,0.97873485,0.017917145,0.000010663525],"about_ca_topic_score_codex":0.0010602297,"about_ca_topic_score_gemma":0.0012075158,"teacher_disagreement_score":0.018883437,"about_ca_system_score_codex":0.0010268962,"about_ca_system_score_gemma":0.00077104557,"threshold_uncertainty_score":0.06317139},"labels":[],"label_agreement":null},{"id":"W2402117450","doi":"","title":"A Construction of Modular Generalized Sidon Sets.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Modulo; Mathematics; Integer (computer science); Set (abstract data type); Element (criminal law); Combinatorics; Discrete mathematics; Modulo operation; Algorithm; Computer science","score_opus":0.010345058741417987,"score_gpt":0.21942462733213433,"score_spread":0.20907956859071636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402117450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24417421,0.0011104529,0.62299955,0.00073630543,0.0007240248,0.00022443138,0.00048770057,0.00064327195,0.12889996],"genre_scores_gemma":[0.679339,0.00059200544,0.29161972,0.00032365523,0.00019789403,0.00024151034,0.00058995,0.000112318834,0.026983941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994649,0.00010323345,0.00005203141,0.00009459061,0.00021768923,0.000067490444],"domain_scores_gemma":[0.9994598,0.00011914307,0.00008743803,0.00013534958,0.00009170472,0.000106555606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006605677,0.00040180265,0.0005147794,0.001423786,0.0011700991,0.0012925719,0.0006352736,0.00041074303,0.0040466087],"category_scores_gemma":[0.00143625,0.00029997106,0.00087757537,0.0010878023,0.0014358241,0.001532323,0.0027662339,0.0009569437,0.00083195505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006741034,0.000021203032,0.0004687464,0.000078880235,0.000015736481,0.00018755102,0.00027110777,0.0016648356,0.006137165,0.9496544,0.0018249713,0.03960794],"study_design_scores_gemma":[0.00005028353,0.0001419712,0.0010188322,0.00007785199,0.0000427654,0.0007993108,0.00021762079,0.018536946,0.009083116,0.88909274,0.08088715,0.00005133914],"about_ca_topic_score_codex":0.0003224983,"about_ca_topic_score_gemma":0.0005102397,"teacher_disagreement_score":0.0040466087,"about_ca_system_score_codex":0.0008423253,"about_ca_system_score_gemma":0.00053551246,"threshold_uncertainty_score":0.013537288},"labels":[],"label_agreement":null},{"id":"W2402131418","doi":"","title":"(2, 1)-Total Labeling Of Planar Graphs With Large Girth And Low Maximum Degree.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Girth (graph theory); Degree (music); Planar graph; Combinatorics; Planar; Discrete mathematics; Graph; Computer science; Physics","score_opus":0.01701971071493668,"score_gpt":0.20008094468821083,"score_spread":0.18306123397327415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402131418","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66961646,0.0014804682,0.23370598,0.0035354665,0.0002306083,0.00014385521,0.004215222,0.0013995148,0.08567239],"genre_scores_gemma":[0.8731711,0.0007217001,0.10538576,0.0006134427,0.00011670041,0.00017326715,0.0030355065,0.00037828338,0.016404169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943334,0.0001969558,0.000028852766,0.00013617265,0.000090497815,0.0001141211],"domain_scores_gemma":[0.99694556,0.0016461707,0.0003999369,0.0005825769,0.00017810326,0.00024758338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005971239,0.00049754395,0.0005692328,0.0010291429,0.001248114,0.002336557,0.0010293713,0.0011766758,0.00622903],"category_scores_gemma":[0.0037240859,0.0005726707,0.0005878351,0.0014297855,0.0011018856,0.0031053498,0.0015304498,0.0011506632,0.0009962094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066198857,0.00020983099,0.0047471784,0.00064874545,0.00007201813,0.00029954946,0.00064262684,0.03910336,0.017441338,0.81385434,0.03328586,0.08903312],"study_design_scores_gemma":[0.00008317527,0.000063895364,0.0016190166,0.00005096024,0.00005142055,0.0004276214,0.00030332585,0.048237618,0.0055806395,0.9322985,0.011257499,0.000026279882],"about_ca_topic_score_codex":0.0011336737,"about_ca_topic_score_gemma":0.0025666824,"teacher_disagreement_score":0.00622903,"about_ca_system_score_codex":0.0012588575,"about_ca_system_score_gemma":0.0007088712,"threshold_uncertainty_score":0.020838201},"labels":[],"label_agreement":null},{"id":"W2402131518","doi":"","title":"On the index of quasi-tree graphs with perfect matchings.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Combinatorics; Tree (set theory); Computer science","score_opus":0.020114682710685113,"score_gpt":0.2650000639831325,"score_spread":0.24488538127244736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402131518","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62095535,0.0050091944,0.1653399,0.004068648,0.0011386634,0.00014512047,0.0024264671,0.00097643817,0.19994023],"genre_scores_gemma":[0.93799275,0.0022574072,0.030528607,0.00070729194,0.00082016084,0.00012043224,0.0012615692,0.00043213135,0.025879709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923456,0.00017830683,0.000052407864,0.00013201649,0.00021375403,0.00018896641],"domain_scores_gemma":[0.9943562,0.0028447714,0.0009642929,0.0005419613,0.0005279487,0.00076478336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010498116,0.00044908893,0.0010429373,0.0031837258,0.0018922674,0.0041621905,0.0016355912,0.0013968346,0.009959731],"category_scores_gemma":[0.007873376,0.0005026363,0.0005114002,0.002621885,0.0017930288,0.008560948,0.002141174,0.0016534807,0.0018930978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017613474,0.00004970454,0.0008229114,0.00009711744,0.000013893445,0.00011546683,0.00028122694,0.0021027944,0.0017947077,0.9751951,0.0063045486,0.013046371],"study_design_scores_gemma":[0.000028325117,0.000033099124,0.0006290027,0.000052585852,0.000021231695,0.00024813152,0.00016259491,0.01308382,0.0009266486,0.97781014,0.006987103,0.000017292617],"about_ca_topic_score_codex":0.0012260006,"about_ca_topic_score_gemma":0.0015842913,"teacher_disagreement_score":0.009959731,"about_ca_system_score_codex":0.0019666606,"about_ca_system_score_gemma":0.00083185436,"threshold_uncertainty_score":0.03331858},"labels":[],"label_agreement":null},{"id":"W2402145295","doi":"","title":"On super antimagic total labeling of Harary graph.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Graph; Vertex (graph theory); Discrete mathematics","score_opus":0.012280994312569297,"score_gpt":0.2268588607680209,"score_spread":0.2145778664554516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402145295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4076711,0.0011613999,0.45921996,0.0011652923,0.00026451962,0.00011559273,0.0008897758,0.00056249206,0.12894978],"genre_scores_gemma":[0.8427947,0.0009470522,0.13608928,0.0005294723,0.00013079164,0.00012644874,0.0011708562,0.00016972085,0.01804173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999385,0.00016968264,0.000026982707,0.00017658746,0.00013580074,0.00010592697],"domain_scores_gemma":[0.99882764,0.00042589556,0.00012680616,0.00029593913,0.0001748372,0.00014892068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004392507,0.00035582512,0.0003569276,0.0011361873,0.0019804358,0.0011380217,0.0006729413,0.0007207542,0.0053041535],"category_scores_gemma":[0.0012123476,0.00029452494,0.0006127254,0.0012846268,0.0012605218,0.0026550437,0.0016547202,0.0012382859,0.0006854041],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009769418,0.000029517905,0.0011039511,0.00016720145,0.000018671293,0.000117133226,0.0004591487,0.0039768876,0.009031867,0.95065325,0.0044709747,0.02987374],"study_design_scores_gemma":[0.000023268687,0.00008102361,0.0014633862,0.00005042557,0.00005540384,0.0006754737,0.000468578,0.026299525,0.008565258,0.9337768,0.028507458,0.00003344632],"about_ca_topic_score_codex":0.0012558462,"about_ca_topic_score_gemma":0.0018000236,"teacher_disagreement_score":0.0053041535,"about_ca_system_score_codex":0.0010080439,"about_ca_system_score_gemma":0.00050919293,"threshold_uncertainty_score":0.017744184},"labels":[],"label_agreement":null},{"id":"W2402147337","doi":"","title":"On path partition dimension of trees.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Partition (number theory); Dimension (graph theory); Path (computing); Combinatorics; Computer science","score_opus":0.02052068491195951,"score_gpt":0.2346047891414768,"score_spread":0.2140841042295173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402147337","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44653556,0.013860981,0.32720327,0.019789474,0.0011315274,0.00018608785,0.0045248535,0.0009002184,0.185868],"genre_scores_gemma":[0.8937951,0.004621046,0.06972892,0.0018387282,0.0018932621,0.00031213084,0.002685943,0.0004914002,0.024633477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983463,0.0005353272,0.00007299412,0.00038601662,0.00031131224,0.00034807844],"domain_scores_gemma":[0.9861245,0.010089899,0.00082636345,0.001310981,0.0006427153,0.0010054886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022069844,0.0008188955,0.0015118143,0.0033380666,0.0025415837,0.0047591394,0.0021580944,0.0022336077,0.012351086],"category_scores_gemma":[0.01414257,0.0007740655,0.0009342743,0.003943644,0.0042908066,0.014100814,0.0035673417,0.0049718986,0.001587562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001120219,0.00007005066,0.001744434,0.00015088303,0.00002834673,0.00004756601,0.0003026181,0.005421253,0.00058443786,0.95903456,0.014060218,0.018443557],"study_design_scores_gemma":[0.000019014336,0.000014991241,0.0008068618,0.000045957924,0.000018438168,0.00009524865,0.00018584494,0.015694223,0.00037764088,0.97669274,0.0060320515,0.0000170285],"about_ca_topic_score_codex":0.0024223642,"about_ca_topic_score_gemma":0.0025926288,"teacher_disagreement_score":0.012351086,"about_ca_system_score_codex":0.003201949,"about_ca_system_score_gemma":0.001013739,"threshold_uncertainty_score":0.041318536},"labels":[],"label_agreement":null},{"id":"W2402160301","doi":"","title":"The Large numbers of 2-independent sets in extra-free forests.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Forestry; Geography","score_opus":0.01919751744235347,"score_gpt":0.2554542964505641,"score_spread":0.23625677900821063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402160301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41109407,0.0043363986,0.49044254,0.0104052825,0.0010213985,0.00024718174,0.002814779,0.0012530714,0.078385256],"genre_scores_gemma":[0.8843045,0.001235523,0.086883195,0.0015801269,0.001033172,0.0003966633,0.001450984,0.00037990516,0.022735849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959046,0.0014067137,0.00024148294,0.00071443414,0.001122083,0.00061072933],"domain_scores_gemma":[0.9516215,0.036984965,0.0022806167,0.005308003,0.0017788947,0.0020260143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041314755,0.000634188,0.00160045,0.0025870833,0.0032186178,0.0051887357,0.0025222986,0.0021501367,0.011081467],"category_scores_gemma":[0.035984926,0.0014902004,0.0014728169,0.0023803364,0.0038831707,0.012777328,0.004544325,0.0046131616,0.0016944162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000578232,0.00015351044,0.0040149703,0.00032524357,0.0001047954,0.0006155066,0.0005069029,0.013170488,0.0028835617,0.91854393,0.019454578,0.039648265],"study_design_scores_gemma":[0.00005621579,0.000019424899,0.0008257794,0.00004102016,0.00004027547,0.00051099,0.00008343282,0.022473777,0.0011141577,0.97033596,0.004477176,0.000021624148],"about_ca_topic_score_codex":0.0009168006,"about_ca_topic_score_gemma":0.0020362574,"teacher_disagreement_score":0.011081467,"about_ca_system_score_codex":0.0014549757,"about_ca_system_score_gemma":0.0011668146,"threshold_uncertainty_score":0.03707117},"labels":[],"label_agreement":null},{"id":"W2402187764","doi":"","title":"Binomial Structures Associated with a q 2 -Analogue Operator.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Binomial (polynomial); Operator (biology); Statistics; Discrete mathematics","score_opus":0.04935547644493283,"score_gpt":0.30450360135292887,"score_spread":0.25514812490799604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402187764","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33527976,0.0010575971,0.10096334,0.0036661308,0.002483721,0.0001178191,0.0003799658,0.00045897975,0.5555926],"genre_scores_gemma":[0.90444434,0.00044822728,0.016109612,0.0009141395,0.00082281453,0.00006841676,0.00019949881,0.00013042541,0.076862544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992286,0.00017866082,0.000028944627,0.00010274726,0.00024712065,0.00021389347],"domain_scores_gemma":[0.9992306,0.00017814244,0.000104922474,0.00007238722,0.00017556452,0.00023828387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008527173,0.0004802373,0.0005342565,0.0021016381,0.0021536425,0.0025761311,0.0006705703,0.0012677623,0.018922152],"category_scores_gemma":[0.0019102377,0.00033177042,0.0005658441,0.0010039682,0.0026014303,0.002998775,0.00235175,0.0020398973,0.0023259714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025999787,0.000020252537,0.00011446891,0.000015055402,0.000002939918,0.00021297683,0.00011834664,0.000120409284,0.0010570864,0.99431944,0.0016666196,0.0023263514],"study_design_scores_gemma":[0.000027812483,0.00003156702,0.00035369117,0.000020979793,0.0000062163595,0.00053717825,0.00015642768,0.002551257,0.00066326425,0.98903507,0.006597491,0.000019040732],"about_ca_topic_score_codex":0.0008211002,"about_ca_topic_score_gemma":0.0009288799,"teacher_disagreement_score":0.018922152,"about_ca_system_score_codex":0.00084824604,"about_ca_system_score_gemma":0.0006564901,"threshold_uncertainty_score":0.06330091},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Mathematical economics","score_opus":0.019134916126448527,"score_gpt":0.25622921552363004,"score_spread":0.23709429939718152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402190177","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17599094,0.0060693035,0.35634276,0.024418471,0.005306458,0.00012121635,0.0032604334,0.0015977855,0.4268927],"genre_scores_gemma":[0.8815389,0.002011237,0.044474367,0.004698689,0.0016647738,0.00015151146,0.0012845171,0.00059088314,0.06358521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910885,0.00017469622,0.00006191909,0.00028270698,0.00019148295,0.00018028449],"domain_scores_gemma":[0.9953549,0.002238439,0.0002847278,0.00097021693,0.000572091,0.0005796666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010092191,0.000719713,0.00083627005,0.0010396121,0.0024375997,0.002080523,0.0011133065,0.0011956401,0.025344111],"category_scores_gemma":[0.0082148705,0.0005785084,0.001297746,0.0009034911,0.004807708,0.0054449015,0.005703519,0.004164019,0.0033036955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007413107,0.000019855055,0.00079004175,0.00009112375,0.000024619128,0.00018337768,0.00025395208,0.00049364736,0.00084290246,0.97222096,0.011651699,0.013353792],"study_design_scores_gemma":[0.000025430289,0.000024096393,0.0007746512,0.00003757869,0.000022207107,0.0003295704,0.0001287702,0.00077636074,0.0004024796,0.97406775,0.023389168,0.000021873515],"about_ca_topic_score_codex":0.0019465875,"about_ca_topic_score_gemma":0.0020327314,"teacher_disagreement_score":0.025344111,"about_ca_system_score_codex":0.0010292879,"about_ca_system_score_gemma":0.0008586363,"threshold_uncertainty_score":0.08478445},"labels":[],"label_agreement":null},{"id":"W2402205526","doi":"","title":"On Linear Positive Operators Involving Biorthogonal Polynomial.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Approximation Theory and Sequence Spaces","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Biorthogonal system; Mathematics; Polynomial; Pure mathematics; Linear operators; Discrete mathematics; Mathematical analysis; Computer science; Artificial intelligence","score_opus":0.0290188659574293,"score_gpt":0.29602210529867556,"score_spread":0.26700323934124626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402205526","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22522552,0.0077813813,0.49020037,0.0066983746,0.0017231412,0.0000763961,0.00044910028,0.00040832185,0.2674374],"genre_scores_gemma":[0.9042657,0.0034540114,0.036411166,0.0010827726,0.0012029171,0.0000900741,0.00028244194,0.00015965063,0.053051308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992386,0.0002467179,0.000031219173,0.00011423986,0.00023873159,0.00013052128],"domain_scores_gemma":[0.99861336,0.0007334633,0.00017774857,0.00013675613,0.00016944559,0.00016926405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001014672,0.00082447584,0.0006075464,0.0016222239,0.0011265825,0.002120632,0.0007764542,0.0010242844,0.00781577],"category_scores_gemma":[0.0038206994,0.00024635356,0.00068785803,0.0012495505,0.002934211,0.0049103545,0.0026069381,0.0027563297,0.0013130396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012464653,0.000008812057,0.000061844694,0.00002967522,0.0000035286957,0.000039001614,0.00008982925,0.00056591094,0.00042565598,0.9946532,0.0009452524,0.003164853],"study_design_scores_gemma":[0.0000061807004,0.000015955697,0.000116703915,0.000016100234,0.0000044272474,0.00010686327,0.00006627658,0.0060494295,0.0002830732,0.99010974,0.0032177982,0.0000074993022],"about_ca_topic_score_codex":0.00092642236,"about_ca_topic_score_gemma":0.00082929956,"teacher_disagreement_score":0.00781577,"about_ca_system_score_codex":0.0013655423,"about_ca_system_score_gemma":0.00047652697,"threshold_uncertainty_score":0.026146412},"labels":[],"label_agreement":null},{"id":"W2402211693","doi":"","title":"The s-degenerate r-Lah numbers.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degenerate energy levels; Combinatorics; Pure mathematics; Physics; Quantum mechanics","score_opus":0.06376686844128282,"score_gpt":0.32577663041196586,"score_spread":0.26200976197068304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402211693","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102684245,0.0030396807,0.07187894,0.0039266394,0.002273291,0.00004724985,0.0005487031,0.0005441704,0.81505704],"genre_scores_gemma":[0.8479018,0.0013777136,0.024852863,0.0016377677,0.00091223937,0.00008370736,0.00031277887,0.0002095573,0.12271159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992957,0.00017671892,0.000035727273,0.00014487343,0.00022427826,0.00012260707],"domain_scores_gemma":[0.99938524,0.00012328781,0.00010669814,0.00013018027,0.0001425292,0.000112004614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007524413,0.0005789409,0.00046520488,0.0019078483,0.001614135,0.0029375134,0.000683392,0.00091559894,0.017252848],"category_scores_gemma":[0.0025072908,0.0002880539,0.00046198972,0.00072430616,0.0031890129,0.003934656,0.0022666987,0.002044995,0.0062833396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016900647,0.0000040672803,0.00006605995,0.000017558314,0.0000020710313,0.000037117636,0.00008648458,0.000062196166,0.0003869938,0.9918969,0.002676084,0.004747656],"study_design_scores_gemma":[0.0000115619805,0.00001598543,0.0002279433,0.00002667738,0.0000045638967,0.00025189144,0.00010194722,0.00094513537,0.0007873015,0.97679967,0.020812828,0.000014529077],"about_ca_topic_score_codex":0.00057194603,"about_ca_topic_score_gemma":0.00058487593,"teacher_disagreement_score":0.017252848,"about_ca_system_score_codex":0.0010020336,"about_ca_system_score_gemma":0.00063270435,"threshold_uncertainty_score":0.05771649},"labels":[],"label_agreement":null},{"id":"W2402241619","doi":"","title":"3-Designs and Large Sets of PSL(2, 2 n ) with Block Sizes 6.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"PSL; Mathematics; Block (permutation group theory); Arithmetic; Combinatorics","score_opus":0.00525501267162622,"score_gpt":0.1935134460846881,"score_spread":0.18825843341306187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402241619","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5337721,0.0009492154,0.32105395,0.0031209057,0.00036539993,0.00031257473,0.0016588105,0.0011333653,0.1376337],"genre_scores_gemma":[0.86553353,0.00028123037,0.104455724,0.0009221074,0.00019756275,0.00063797575,0.00058944366,0.000169064,0.027213413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99781704,0.0008780541,0.00012347978,0.00028035164,0.00051849725,0.0003825663],"domain_scores_gemma":[0.991602,0.004770409,0.00096358056,0.0014924804,0.00065393315,0.0005175411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019217344,0.0005091058,0.000658218,0.0012490882,0.0020376968,0.0027731748,0.0009569579,0.0015617805,0.012072936],"category_scores_gemma":[0.0072448323,0.000730558,0.0007824946,0.0008772998,0.0020873353,0.002865777,0.002232043,0.0016926707,0.0021671639],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031788184,0.00008044589,0.0007713395,0.00010005525,0.000029854678,0.00023789388,0.00027681788,0.0061017396,0.006319735,0.96625173,0.0047851605,0.014727431],"study_design_scores_gemma":[0.00009379326,0.00008152592,0.00051895215,0.00005655958,0.00002049146,0.00029504142,0.000110157074,0.021846607,0.0044501266,0.9631742,0.009320409,0.000032043747],"about_ca_topic_score_codex":0.00074236,"about_ca_topic_score_gemma":0.001887298,"teacher_disagreement_score":0.012072936,"about_ca_system_score_codex":0.001475695,"about_ca_system_score_gemma":0.0013254641,"threshold_uncertainty_score":0.040388048},"labels":[],"label_agreement":null},{"id":"W2402242051","doi":"","title":"Exponential Operator Decomposition For Carlitz Type Generating Functions.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Operator (biology); Exponential function; Decomposition; Type (biology); Pure mathematics; Algebra over a field; Mathematical analysis","score_opus":0.010232109645765881,"score_gpt":0.24898442991691594,"score_spread":0.23875232027115006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402242051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18758255,0.0018875197,0.5673828,0.0028736326,0.00074844214,0.00011353201,0.0010550419,0.0007350223,0.23762141],"genre_scores_gemma":[0.86908805,0.0011303386,0.048970237,0.0006855897,0.0007831367,0.00014422115,0.0008366019,0.00037095105,0.077990994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941516,0.00014122507,0.000027259888,0.00008410735,0.000210247,0.000121958015],"domain_scores_gemma":[0.9987243,0.00053426553,0.000118559015,0.00015603605,0.00030450083,0.00016221222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011412917,0.0007861377,0.00056625955,0.0026060839,0.0009378873,0.0026456157,0.000960491,0.0009376205,0.017662259],"category_scores_gemma":[0.003442297,0.00030271037,0.00067608507,0.0013825175,0.0017829508,0.0049238983,0.0014185815,0.0023655468,0.0038236862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014479757,0.000019573537,0.00012217897,0.000018237897,0.0000023870818,0.000023076553,0.00006510695,0.0003576021,0.000321319,0.9926604,0.001932327,0.0044632773],"study_design_scores_gemma":[0.0000070658593,0.000007960285,0.00010648235,0.0000107037795,0.0000027668375,0.00007027752,0.00004093946,0.008027284,0.000380213,0.9891628,0.0021745644,0.000008989904],"about_ca_topic_score_codex":0.0007047538,"about_ca_topic_score_gemma":0.00087056565,"teacher_disagreement_score":0.017662259,"about_ca_system_score_codex":0.0010262497,"about_ca_system_score_gemma":0.0006187196,"threshold_uncertainty_score":0.059086144},"labels":[],"label_agreement":null},{"id":"W2402245199","doi":"","title":"Super connectivity of Kronecker products of some graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Kronecker product; Kronecker delta; Combinatorics","score_opus":0.04984769336719136,"score_gpt":0.2914925227622639,"score_spread":0.24164482939507254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402245199","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64998657,0.0017525826,0.15192874,0.001912064,0.0004546928,0.00005109802,0.00069564587,0.0003003398,0.19291838],"genre_scores_gemma":[0.9670547,0.000703428,0.015600489,0.00035391573,0.00023193078,0.00004940814,0.00033752585,0.000089783345,0.015578732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949944,0.0001560845,0.000028739547,0.00010301494,0.00013265254,0.00008011611],"domain_scores_gemma":[0.99788254,0.00087860774,0.0003476484,0.00022099371,0.00035943693,0.0003108028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058638497,0.00033364407,0.00037265295,0.0020197826,0.0011105674,0.0017465051,0.0005769295,0.00063673925,0.0074074017],"category_scores_gemma":[0.0025206795,0.00037781385,0.00046270763,0.0011196907,0.0017118157,0.0040852656,0.001189778,0.0014600835,0.00068432686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016471651,0.000009952771,0.00030586528,0.000024697889,0.000004801503,0.00010164623,0.00017029214,0.00037528653,0.0006610863,0.9945471,0.0009919553,0.0027909044],"study_design_scores_gemma":[0.0000069432454,0.00002013103,0.00060127705,0.000017654338,0.000011002958,0.00033605646,0.00015102407,0.004737827,0.00045317225,0.98949045,0.00416435,0.000010104172],"about_ca_topic_score_codex":0.00074626895,"about_ca_topic_score_gemma":0.0011756215,"teacher_disagreement_score":0.0074074017,"about_ca_system_score_codex":0.00055735046,"about_ca_system_score_gemma":0.00029198767,"threshold_uncertainty_score":0.024780214},"labels":[],"label_agreement":null},{"id":"W2402247018","doi":"","title":"On the sum of out-domination number and in-domination number of digraphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Domination analysis; Combinatorics; Graph","score_opus":0.024210418008993297,"score_gpt":0.30581729691435144,"score_spread":0.2816068789053581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402247018","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53103954,0.008533563,0.26426598,0.0055029583,0.0010279801,0.00017737394,0.004130753,0.00073005806,0.18459176],"genre_scores_gemma":[0.9457732,0.0025566001,0.034201372,0.0005054126,0.0009264856,0.00017702559,0.0011407323,0.0002397446,0.014479369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99769753,0.00078336196,0.00015426238,0.000468151,0.0005554452,0.0003412305],"domain_scores_gemma":[0.9724439,0.021530293,0.0015776592,0.0014466097,0.001271803,0.001729799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00277518,0.0010770382,0.0015493917,0.0047847265,0.0018318658,0.0040839114,0.0026440197,0.0013879581,0.010092597],"category_scores_gemma":[0.02048631,0.00071931706,0.0007383656,0.0037532272,0.0027574808,0.010937797,0.0024013768,0.0025857834,0.0010458141],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041055452,0.00016840338,0.008074687,0.00056583656,0.00020976915,0.00025938058,0.0005141254,0.030479332,0.0033842179,0.87378204,0.01917097,0.062980756],"study_design_scores_gemma":[0.00003823166,0.000078509154,0.00368555,0.00013679826,0.00015687902,0.00076982606,0.00021334793,0.07187816,0.001972648,0.91182595,0.009189747,0.000054371896],"about_ca_topic_score_codex":0.00091574644,"about_ca_topic_score_gemma":0.0015092044,"teacher_disagreement_score":0.010092597,"about_ca_system_score_codex":0.0023222808,"about_ca_system_score_gemma":0.00083013915,"threshold_uncertainty_score":0.03376305},"labels":[],"label_agreement":null},{"id":"W2402262755","doi":"","title":"A note on the vertex-distinguishing proper total coloring of graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Complete coloring; Vertex (graph theory); Fractional coloring; Total coloring; Combinatorics; Brooks' theorem; Graph; Chordal graph; 1-planar graph; Line graph","score_opus":0.012864357432790243,"score_gpt":0.2248980611754479,"score_spread":0.21203370374265765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402262755","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04683427,0.016093967,0.53558385,0.021575522,0.010333506,0.00013303112,0.0012904922,0.0013139774,0.36684135],"genre_scores_gemma":[0.5982067,0.016886005,0.3063573,0.009192594,0.0066805324,0.00022855884,0.0014516707,0.0009297384,0.06006695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987348,0.00038099688,0.000062712184,0.00033585264,0.00033181324,0.00015376601],"domain_scores_gemma":[0.99463034,0.003739289,0.00016208463,0.0008363314,0.00030461702,0.0003273213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018406275,0.0008712519,0.0009334801,0.0015108767,0.0022828595,0.0030238605,0.0021880006,0.0013743012,0.008490477],"category_scores_gemma":[0.006306163,0.00069189817,0.0011255383,0.002793553,0.004765836,0.007001803,0.0032262066,0.006126029,0.0012827506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006291794,0.00003739715,0.00048774402,0.00019696081,0.000018664465,0.00013233554,0.0001488378,0.002524681,0.00119332,0.94210666,0.029689195,0.023401357],"study_design_scores_gemma":[0.000011635865,0.000022829136,0.00040337708,0.000042190586,0.000021424054,0.00021287162,0.000087450695,0.005152771,0.00073768554,0.9549326,0.038356874,0.000018364048],"about_ca_topic_score_codex":0.0033488953,"about_ca_topic_score_gemma":0.006001544,"teacher_disagreement_score":0.008490477,"about_ca_system_score_codex":0.0019515705,"about_ca_system_score_gemma":0.0012811047,"threshold_uncertainty_score":0.028403461},"labels":[],"label_agreement":null},{"id":"W2402289345","doi":"","title":"Lower bounds for quaternary covering codes.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Quaternary; Combinatorics; Geology; Paleontology","score_opus":0.023112464159223516,"score_gpt":0.23306696475913471,"score_spread":0.2099545005999112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402289345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10799076,0.02477089,0.44599038,0.013085319,0.0028883573,0.00028171705,0.004602503,0.001968478,0.3984216],"genre_scores_gemma":[0.84317523,0.014385495,0.08797739,0.0033318389,0.0025953585,0.00080566626,0.004437508,0.0010698168,0.042221677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966305,0.0006315433,0.00014020628,0.00033284308,0.0013996802,0.00086525216],"domain_scores_gemma":[0.98404074,0.010759433,0.00081447244,0.0019250215,0.0016638372,0.00079647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031892555,0.0023369507,0.0017354252,0.0050038537,0.0026167973,0.0067846477,0.0026738758,0.0023090753,0.018355077],"category_scores_gemma":[0.024251271,0.00076734176,0.0012053383,0.005347771,0.002706731,0.008168941,0.0054970896,0.005279696,0.0061488408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019752234,0.000086457025,0.0006466986,0.00033285824,0.00004172583,0.000120359,0.00027045576,0.014245868,0.0022800355,0.91988117,0.026179798,0.035717074],"study_design_scores_gemma":[0.00002798957,0.000052092106,0.00035696235,0.00019111372,0.00004501846,0.00027515285,0.00008376656,0.04089577,0.002022364,0.9372853,0.018725356,0.000039033865],"about_ca_topic_score_codex":0.0015838223,"about_ca_topic_score_gemma":0.0024762119,"teacher_disagreement_score":0.018355077,"about_ca_system_score_codex":0.004729745,"about_ca_system_score_gemma":0.0022102862,"threshold_uncertainty_score":0.06140381},"labels":[],"label_agreement":null},{"id":"W2402300817","doi":"","title":"Prime Cordial labeling of Flower Snark and related graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Prime (order theory); Combinatorics","score_opus":0.009004460781711654,"score_gpt":0.21751653374232935,"score_spread":0.2085120729606177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402300817","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4724268,0.00218525,0.19523732,0.0063800635,0.00058131793,0.00017323931,0.0020361652,0.0010706021,0.3199092],"genre_scores_gemma":[0.8970034,0.0009070676,0.054508284,0.0009559315,0.00030577133,0.00009534363,0.0013377749,0.00019443239,0.04469194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996306,0.00011142689,0.000016270344,0.00010095037,0.000061528495,0.000079211924],"domain_scores_gemma":[0.9984174,0.000776015,0.00019533485,0.0002850314,0.000118432974,0.00020778857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005006603,0.00037870122,0.0005401516,0.00082074315,0.0019882983,0.0018787035,0.0010299634,0.0012728203,0.014654721],"category_scores_gemma":[0.0027437236,0.00029076956,0.00049756933,0.0011983333,0.0015303013,0.0039588693,0.0015220135,0.0015331367,0.0011763934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008713224,0.00004240161,0.00045740098,0.00008601493,0.000005838142,0.00008001723,0.00015068302,0.0027936136,0.0008262408,0.9726658,0.00778697,0.015017903],"study_design_scores_gemma":[0.000021460479,0.000015507841,0.00036674293,0.000018457547,0.000011255919,0.0001551674,0.0001111622,0.010727068,0.0009319981,0.9767295,0.010901873,0.000009842552],"about_ca_topic_score_codex":0.0018735798,"about_ca_topic_score_gemma":0.0029787505,"teacher_disagreement_score":0.014654721,"about_ca_system_score_codex":0.00180397,"about_ca_system_score_gemma":0.00065284764,"threshold_uncertainty_score":0.04902494},"labels":[],"label_agreement":null},{"id":"W2402311781","doi":"","title":"Edge-colorings of complete bipartite graphs without large rainbow trees.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Rainbow; Bipartite graph; Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Edge coloring; Discrete mathematics; Graph; Computer science; Line graph; Artificial intelligence","score_opus":0.021036747929879997,"score_gpt":0.2709517347338764,"score_spread":0.2499149868039964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402311781","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65757215,0.0010747008,0.22295366,0.001781672,0.00040044234,0.0002001241,0.0030227867,0.0015304231,0.11146402],"genre_scores_gemma":[0.9145354,0.0003914277,0.059229795,0.0004388057,0.00012810984,0.00011298098,0.0018388983,0.000412357,0.022912255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935013,0.00021882249,0.00003682368,0.00013870088,0.00011245856,0.00014305992],"domain_scores_gemma":[0.9953884,0.0023073552,0.00057799806,0.00073920656,0.00040569252,0.0005813506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007343234,0.0004831911,0.000526449,0.0009994835,0.0015653499,0.001937057,0.0013203324,0.0011011217,0.010147554],"category_scores_gemma":[0.0055016037,0.00078035414,0.00062875525,0.0010976414,0.001255726,0.0025873184,0.0013057092,0.0014486298,0.0012971282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040984983,0.00017956553,0.0028323282,0.0002703486,0.000062129315,0.0005651746,0.0003630412,0.016344523,0.008524467,0.92372245,0.021168273,0.025557805],"study_design_scores_gemma":[0.0000861678,0.0000459265,0.0016056232,0.000056716795,0.000033198354,0.00041972514,0.00022237714,0.0404453,0.0022099798,0.9483072,0.0065440675,0.000023721652],"about_ca_topic_score_codex":0.0015824655,"about_ca_topic_score_gemma":0.0036102626,"teacher_disagreement_score":0.010147554,"about_ca_system_score_codex":0.0009805298,"about_ca_system_score_gemma":0.0007264502,"threshold_uncertainty_score":0.03394693},"labels":[],"label_agreement":null},{"id":"W2402322223","doi":"","title":"Norm Estimates Of Weighted Composition Operators Between Bloch-Type Spaces.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Holomorphic and Operator Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Norm (philosophy); Type (biology); Pure mathematics; Bloch space; Composition (language); Operator norm; Mathematical analysis; Operator theory; Compact space","score_opus":0.02288193062454966,"score_gpt":0.2874492116952906,"score_spread":0.2645672810707409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402322223","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.216361,0.0035641962,0.66637135,0.0017609103,0.0008559641,0.000053318134,0.00037625493,0.00036682063,0.110290155],"genre_scores_gemma":[0.84509397,0.002635284,0.09202752,0.00038217753,0.0008115307,0.000107489526,0.00056827156,0.0003890825,0.05798478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891794,0.0003417017,0.000052384712,0.00014636765,0.00042190542,0.000119743185],"domain_scores_gemma":[0.99656445,0.0011909223,0.00037927934,0.00030876492,0.0010236872,0.00053282984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002450234,0.0009092704,0.00066043204,0.0036476294,0.0011083632,0.0021518809,0.0010806343,0.0008302412,0.0070380857],"category_scores_gemma":[0.008662134,0.00036784704,0.0006290234,0.0013831609,0.0022088669,0.008042179,0.0031446412,0.0026283592,0.0011193826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030255178,0.000020198588,0.00035704995,0.00004667896,0.000014932246,0.000033972174,0.000121692545,0.0007175929,0.0017166173,0.98886883,0.0012916387,0.006780553],"study_design_scores_gemma":[0.0000063172,0.00002972615,0.00070060504,0.000029591341,0.000018987957,0.00017107718,0.00015294553,0.018824741,0.001749608,0.97385705,0.004440516,0.000018727122],"about_ca_topic_score_codex":0.0007743716,"about_ca_topic_score_gemma":0.0010134634,"teacher_disagreement_score":0.0070380857,"about_ca_system_score_codex":0.0010609213,"about_ca_system_score_gemma":0.00045213156,"threshold_uncertainty_score":0.023544729},"labels":[],"label_agreement":null},{"id":"W2402339857","doi":"","title":"Identities of summations involving powers and inverse of binomial coefficients.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Differential Equations and Dynamical Systems","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Binomial coefficient; Inverse; Binomial (polynomial); Negative binomial distribution; Applied mathematics; Statistics; Combinatorics; Poisson distribution; Geometry","score_opus":0.045319140002926944,"score_gpt":0.27510397052995,"score_spread":0.22978483052702306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402339857","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05953088,0.009607368,0.39045084,0.003200075,0.0033719374,0.00007739802,0.00070498226,0.00040558964,0.532651],"genre_scores_gemma":[0.71374875,0.0073598595,0.12447834,0.002116439,0.004353818,0.00024608095,0.0007864214,0.00069413794,0.1462161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983327,0.00044713236,0.00014431399,0.00024850568,0.00064829143,0.00017910376],"domain_scores_gemma":[0.9978917,0.00080895534,0.00022692258,0.000309065,0.0005517694,0.00021162465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002078274,0.00083058147,0.0010071007,0.002938124,0.0023683626,0.004188391,0.0012207475,0.0010250873,0.009373603],"category_scores_gemma":[0.0073732096,0.0006450394,0.0011904513,0.0017141193,0.003388735,0.008476214,0.0025208232,0.0034007258,0.004349713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043400128,0.0000059153044,0.00004944923,0.000018443849,0.000003328625,0.00004414663,0.00009934289,0.00007740899,0.00025743732,0.9947744,0.00171482,0.002950995],"study_design_scores_gemma":[0.0000045470074,0.000004739372,0.00010945693,0.00001951784,0.000006189854,0.00022073173,0.000038161783,0.0014968318,0.000244769,0.99015117,0.007695131,0.000008794285],"about_ca_topic_score_codex":0.0008154837,"about_ca_topic_score_gemma":0.0015372296,"teacher_disagreement_score":0.009373603,"about_ca_system_score_codex":0.001102919,"about_ca_system_score_gemma":0.00092882506,"threshold_uncertainty_score":0.031357825},"labels":[],"label_agreement":null},{"id":"W2402344555","doi":"","title":"An upper bound for the radio number of generalized gear graph.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Upper and lower bounds; Graph; Combinatorics; Discrete mathematics; Mathematical analysis","score_opus":0.010190145980269096,"score_gpt":0.23731541052172633,"score_spread":0.22712526454145723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402344555","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11014714,0.009825736,0.57636553,0.004466921,0.0018585238,0.00028382716,0.0022713256,0.0017502309,0.2930309],"genre_scores_gemma":[0.8060227,0.005844387,0.13841838,0.0017424936,0.0012773224,0.00071531336,0.0013771915,0.00050815457,0.04409402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813265,0.00038685082,0.00006478652,0.00041642948,0.0005134323,0.00048597658],"domain_scores_gemma":[0.9922214,0.0050563095,0.00042604044,0.0011041331,0.00056121644,0.0006308807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014372235,0.0016661596,0.001391317,0.003184658,0.002267128,0.0034741622,0.0028338297,0.0015123183,0.022181777],"category_scores_gemma":[0.010353224,0.00066782476,0.0010561519,0.0021047115,0.0022090867,0.0053548804,0.0034301141,0.0031057396,0.004386277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030524927,0.00017426649,0.0011021347,0.0005656717,0.000082639286,0.00031420588,0.00035551566,0.02839652,0.012347455,0.86958146,0.03337424,0.05340061],"study_design_scores_gemma":[0.00006661005,0.00020498292,0.0021850846,0.00030376992,0.00018642898,0.0011964937,0.00031574213,0.13998844,0.009617197,0.7738776,0.0719188,0.00013874838],"about_ca_topic_score_codex":0.0014132626,"about_ca_topic_score_gemma":0.0027133203,"teacher_disagreement_score":0.022181777,"about_ca_system_score_codex":0.0022662492,"about_ca_system_score_gemma":0.0010658457,"threshold_uncertainty_score":0.07420546},"labels":[],"label_agreement":null},{"id":"W2402360197","doi":"","title":"Some Generalizations Of Multiple Laguerre Polynomials Via Rodrigues Formula.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Quantum Mechanics and Non-Hermitian Physics","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Laguerre polynomials; Mathematics; Pure mathematics","score_opus":0.02147556673639684,"score_gpt":0.2544691874160164,"score_spread":0.23299362067961954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402360197","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22248003,0.015318321,0.24483798,0.0053280415,0.0036798178,0.00015149501,0.00088552316,0.0007322688,0.50658655],"genre_scores_gemma":[0.8746219,0.0052598584,0.050148092,0.00096999545,0.0023725228,0.00010153165,0.0004389961,0.00032683706,0.06576028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994649,0.00015011684,0.000024763744,0.00009305389,0.00018176514,0.00008534668],"domain_scores_gemma":[0.9993825,0.00019357205,0.00009638263,0.000110379784,0.00011422865,0.00010287576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091944763,0.0007584018,0.0007592627,0.0022894777,0.0014104069,0.0018455497,0.0011985461,0.0008248656,0.012498042],"category_scores_gemma":[0.002437384,0.00035429292,0.0010087615,0.0015394196,0.0019195353,0.0037500479,0.0013413528,0.0021401392,0.002067724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000969056,0.000012130298,0.00006023077,0.0000321556,0.0000036845079,0.000069408285,0.00006691673,0.0004689082,0.00033925124,0.99241954,0.0014503916,0.0050676176],"study_design_scores_gemma":[0.0000090549665,0.000013958183,0.00015205234,0.00001559258,0.0000047978747,0.000179184,0.0000475533,0.004443752,0.00019001667,0.9874027,0.0075253216,0.00001603063],"about_ca_topic_score_codex":0.0012610123,"about_ca_topic_score_gemma":0.0015784048,"teacher_disagreement_score":0.012498042,"about_ca_system_score_codex":0.0010851811,"about_ca_system_score_gemma":0.0006856351,"threshold_uncertainty_score":0.041810155},"labels":[],"label_agreement":null},{"id":"W2402378065","doi":"","title":"Maximum Genus Embeddings and Genus Embeddings on Orientable Surfaces.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Genus; Mathematics; Combinatorics; Pure mathematics; Zoology; Biology","score_opus":0.007546579958146799,"score_gpt":0.21685188654742626,"score_spread":0.20930530658927946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402378065","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59562016,0.0045592794,0.16323404,0.0028287498,0.00085921725,0.000059917165,0.00051171216,0.0008119284,0.23151492],"genre_scores_gemma":[0.96823186,0.0009519548,0.013414917,0.00022757666,0.00030408605,0.00005036964,0.0002398175,0.00013894193,0.016440546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947196,0.000108344706,0.00003438523,0.0001274169,0.00013996159,0.000117885655],"domain_scores_gemma":[0.9984366,0.0007856079,0.00022287108,0.00021311617,0.00012542728,0.00021621768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041517307,0.00056502037,0.00049772894,0.001664391,0.0015076747,0.0028560627,0.0007447047,0.0011467929,0.008807212],"category_scores_gemma":[0.0031884962,0.00048046137,0.00059423863,0.0009009083,0.002717937,0.005742044,0.0032332067,0.0017035868,0.0012805016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047975904,0.000016626662,0.00043427543,0.000050610113,0.0000054554193,0.00016223184,0.0003486231,0.00093300437,0.0015786819,0.98487234,0.001856693,0.0096934335],"study_design_scores_gemma":[0.000009442924,0.000011754018,0.00034929614,0.000022125252,0.0000069790235,0.00019250388,0.00022971444,0.0023645842,0.0007437206,0.99182725,0.0042336867,0.000008980793],"about_ca_topic_score_codex":0.0003077372,"about_ca_topic_score_gemma":0.00048198635,"teacher_disagreement_score":0.008807212,"about_ca_system_score_codex":0.000723072,"about_ca_system_score_gemma":0.00019068367,"threshold_uncertainty_score":0.029463053},"labels":[],"label_agreement":null},{"id":"W2402386276","doi":"","title":"Resolvably Decomposing Complete Equipartite Graphs Minus a One-Factor into Cycles of Uniform Even Length.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Factor (programming language); Combinatorics; Discrete mathematics; Computer science","score_opus":0.03150782474623839,"score_gpt":0.28791442364979214,"score_spread":0.2564065989035538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402386276","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3871463,0.0010976054,0.45344338,0.0011070631,0.0004334561,0.00032238182,0.0014990595,0.0015123695,0.15343846],"genre_scores_gemma":[0.828134,0.0009057307,0.12098657,0.0007615878,0.00026294054,0.00018138735,0.00287011,0.00092123053,0.044976525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994486,0.000109249406,0.000028130795,0.00013222774,0.00012735963,0.00015442086],"domain_scores_gemma":[0.9981244,0.0006731594,0.00016686146,0.00056636473,0.00021067169,0.0002585394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044560118,0.0006978183,0.0004401151,0.0008340529,0.0011260804,0.0019527319,0.0010905868,0.00082580897,0.01443664],"category_scores_gemma":[0.0027179047,0.00048632536,0.0008788142,0.0008110594,0.001413406,0.0038706667,0.0022205135,0.0026003516,0.002546368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004959712,0.0002166305,0.00062338996,0.0002924672,0.00004946618,0.0005167283,0.0008954691,0.007933088,0.019791769,0.87387025,0.011120591,0.08419421],"study_design_scores_gemma":[0.00004718926,0.00007248522,0.00039704444,0.000056391822,0.0000376882,0.00033216807,0.00029465652,0.010676146,0.007389901,0.9640649,0.016602077,0.00002944575],"about_ca_topic_score_codex":0.0010889714,"about_ca_topic_score_gemma":0.0022446935,"teacher_disagreement_score":0.01443664,"about_ca_system_score_codex":0.0005598862,"about_ca_system_score_gemma":0.0006901957,"threshold_uncertainty_score":0.04829532},"labels":[],"label_agreement":null},{"id":"W2402410623","doi":"","title":"Domination number in iterated line digraph of a complete bipartite digraph.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Digraph; Mathematics; Iterated function; Bipartite graph; Combinatorics; Line (geometry); Discrete mathematics; Graph","score_opus":0.024745808959017738,"score_gpt":0.300256535776357,"score_spread":0.2755107268173393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402410623","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8621856,0.0005018184,0.06736625,0.00058990583,0.000058630416,0.00004813098,0.000935466,0.00019567195,0.06811865],"genre_scores_gemma":[0.98571324,0.00019404668,0.006797497,0.000048386315,0.000030863255,0.0000409791,0.0002742009,0.000021176795,0.0068794903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996885,0.00008619463,0.000015216257,0.00007440483,0.0000606669,0.00007504461],"domain_scores_gemma":[0.9977192,0.0013169961,0.0002584791,0.000117261174,0.00021159656,0.00037642644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031016042,0.00019850608,0.00030688258,0.0013369642,0.00091388804,0.0015298256,0.00058835105,0.00050279684,0.006555319],"category_scores_gemma":[0.0022390245,0.0001750435,0.00020914078,0.00069079787,0.0006830778,0.0016031287,0.00050803105,0.0005273623,0.0003793294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002805382,0.00009960356,0.00817723,0.00022535773,0.000055576158,0.00052972534,0.0008047471,0.01898949,0.011605695,0.9176638,0.0071005174,0.034467682],"study_design_scores_gemma":[0.000076475386,0.000105303385,0.0076623224,0.000086511645,0.00007200509,0.0010630713,0.00050921075,0.1599506,0.0057613547,0.8120046,0.012655559,0.00005301712],"about_ca_topic_score_codex":0.0012320611,"about_ca_topic_score_gemma":0.0020229656,"teacher_disagreement_score":0.006555319,"about_ca_system_score_codex":0.0010442596,"about_ca_system_score_gemma":0.00039737238,"threshold_uncertainty_score":0.02192974},"labels":[],"label_agreement":null},{"id":"W2402429222","doi":"","title":"Vague Lie Superalgebras.","year":2013,"lang":"es","type":"article","venue":"Ars Combinatoria","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Lie superalgebra; Pure mathematics; Algebra over a field; Affine Lie algebra","score_opus":0.01919190613423423,"score_gpt":0.27743418958928373,"score_spread":0.2582422834550495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402429222","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083772056,0.019253828,0.13370658,0.00864059,0.001414894,0.00007691511,0.0009832617,0.0005498265,0.75160193],"genre_scores_gemma":[0.87226087,0.0043400456,0.025270235,0.0024194035,0.0013619128,0.00010005746,0.00070440886,0.00013971093,0.09340334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992231,0.00022379002,0.00004403641,0.00011126957,0.0003350163,0.00006261337],"domain_scores_gemma":[0.99935085,0.00017078662,0.00008675043,0.00011698879,0.00017053112,0.000104167746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011461087,0.0005382834,0.0005682286,0.0017217319,0.001689228,0.0020572452,0.0005368466,0.0010048198,0.00822837],"category_scores_gemma":[0.0021688505,0.00032297338,0.00054513995,0.0009846654,0.002838774,0.004252006,0.0019687142,0.0019788211,0.0016575073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005063561,0.00000303715,0.00003806068,0.000016629288,0.0000029158725,0.00002108007,0.00008924378,0.00007941549,0.00019270516,0.99682826,0.001207199,0.0015164282],"study_design_scores_gemma":[0.000002897134,0.000004574733,0.00010677933,0.000012108056,0.000004498678,0.000096862095,0.00007037814,0.0005859255,0.00019027668,0.98839927,0.010521996,0.0000044041158],"about_ca_topic_score_codex":0.0008511908,"about_ca_topic_score_gemma":0.000974243,"teacher_disagreement_score":0.00822837,"about_ca_system_score_codex":0.0010959468,"about_ca_system_score_gemma":0.00052301487,"threshold_uncertainty_score":0.027526617},"labels":[],"label_agreement":null},{"id":"W2402441013","doi":"","title":"On the Recursive Sequence Order-k.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Sequence (biology); Order (exchange); Combinatorics; Applied mathematics; Pure mathematics; Biology","score_opus":0.02118355980526211,"score_gpt":0.24788299946190995,"score_spread":0.22669943965664785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402441013","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09872447,0.010317493,0.4955489,0.00658835,0.001648148,0.0000830451,0.0010572318,0.0013820742,0.38465035],"genre_scores_gemma":[0.8117593,0.0045885155,0.09239398,0.002336948,0.0012147616,0.00014527145,0.0008749775,0.0006825011,0.086003624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988871,0.0003389506,0.00008650856,0.00025983658,0.00025582872,0.00017184406],"domain_scores_gemma":[0.9969182,0.0018563968,0.00015775255,0.00050869904,0.00037651756,0.00018253531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012245091,0.00054233696,0.0007445006,0.0015472539,0.0021575473,0.0032411814,0.0007990089,0.0011807143,0.010730125],"category_scores_gemma":[0.004958945,0.0005350543,0.0009113259,0.0015748243,0.004965144,0.011561898,0.002314285,0.0028035466,0.003621625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019737436,0.000007400141,0.00013373005,0.000030190457,0.0000035036592,0.000064736676,0.00021646169,0.00041291423,0.00025030642,0.9907817,0.002043636,0.0060356217],"study_design_scores_gemma":[0.00000461059,0.0000064563606,0.00009736321,0.000015041782,0.0000036439599,0.00007604765,0.000045266097,0.0011834534,0.00018542327,0.99055815,0.007816613,0.000007836821],"about_ca_topic_score_codex":0.0022856712,"about_ca_topic_score_gemma":0.0033750276,"teacher_disagreement_score":0.010730125,"about_ca_system_score_codex":0.0017963868,"about_ca_system_score_gemma":0.0009506992,"threshold_uncertainty_score":0.035895824},"labels":[],"label_agreement":null},{"id":"W2402459166","doi":"","title":"Embeddings of resolvable group divisible designs with block size 3 and for all λ.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Block (permutation group theory); Group (periodic table); Block size; Combinatorics; Discrete mathematics; Computer science; Physics","score_opus":0.01089984610242698,"score_gpt":0.21817587972434235,"score_spread":0.20727603362191538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402459166","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6239765,0.00067180395,0.25458217,0.0009977516,0.00022901304,0.00013476591,0.0011494191,0.00083393545,0.117424674],"genre_scores_gemma":[0.9043279,0.0003334569,0.061906707,0.00030574956,0.000087167384,0.0001611725,0.00092690013,0.00023047076,0.031720463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992132,0.00020714701,0.000039764753,0.00015905431,0.00018419627,0.00019661913],"domain_scores_gemma":[0.9974986,0.0010339705,0.0004388344,0.00056831737,0.00020561225,0.00025474493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049348007,0.00054467074,0.00037848036,0.00078625797,0.0009359274,0.001988901,0.00074245234,0.0010526694,0.012999576],"category_scores_gemma":[0.0028759937,0.0005291526,0.0005705584,0.00053270283,0.0012069155,0.00213602,0.001964367,0.001732905,0.0021684016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003767521,0.00008329503,0.00051873847,0.000094548515,0.000018377164,0.00020146069,0.00043507564,0.0046490594,0.00560705,0.9636958,0.0030195236,0.021300247],"study_design_scores_gemma":[0.00010135974,0.000105169136,0.0005578408,0.00005732202,0.000020610536,0.00031420318,0.00029669507,0.015627593,0.0056630326,0.96302056,0.014198985,0.00003665899],"about_ca_topic_score_codex":0.00048296226,"about_ca_topic_score_gemma":0.0006182654,"teacher_disagreement_score":0.012999576,"about_ca_system_score_codex":0.000812758,"about_ca_system_score_gemma":0.00046255396,"threshold_uncertainty_score":0.043487847},"labels":[],"label_agreement":null},{"id":"W2402462786","doi":"","title":"A Sequence Representation of the Dyck Path Poset.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Sequence (biology); Path (computing); Partially ordered set; Representation (politics); Combinatorics; Computer science; Genetics; Computer network; Law","score_opus":0.016478758246875603,"score_gpt":0.2668124878955848,"score_spread":0.2503337296487092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402462786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03971028,0.0012929967,0.7760531,0.0010422661,0.00092480844,0.00022950115,0.0077254944,0.0029554244,0.1700663],"genre_scores_gemma":[0.4692532,0.0019499226,0.39460516,0.00057223183,0.0003946301,0.00047967816,0.01618467,0.0014263021,0.11513411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995733,0.00006889905,0.000028852237,0.000116251904,0.00015123058,0.00006152861],"domain_scores_gemma":[0.9996055,0.00010235464,0.00003327034,0.0001057554,0.000107545144,0.00004562007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030168472,0.00072605256,0.0005071536,0.001593403,0.00074798445,0.0023534847,0.0009433909,0.00076028076,0.04761989],"category_scores_gemma":[0.0015124212,0.00027113187,0.0004340184,0.0022057856,0.0008075702,0.0026661633,0.0012809309,0.0016365804,0.011092379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013012001,0.000056378598,0.00017650459,0.00012067577,0.000007949084,0.00012418187,0.0002053373,0.0046667433,0.0027273141,0.88047904,0.019614475,0.09169137],"study_design_scores_gemma":[0.0000328671,0.000087756845,0.00023978634,0.00008308857,0.00001530875,0.00038741744,0.00022859199,0.024598788,0.00320337,0.85188216,0.11920727,0.000033604323],"about_ca_topic_score_codex":0.0012724197,"about_ca_topic_score_gemma":0.0017714478,"teacher_disagreement_score":0.04761989,"about_ca_system_score_codex":0.00059737806,"about_ca_system_score_gemma":0.0006420702,"threshold_uncertainty_score":0.15930438},"labels":[],"label_agreement":null},{"id":"W2402469379","doi":"","title":"On the Surface Areas of the Alternating Group Graph and the Split-Star Graph.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Star (game theory); Graph; Combinatorics; Voltage graph; Coxeter graph; Line graph; Mathematical analysis","score_opus":0.011484713832612558,"score_gpt":0.244929003647124,"score_spread":0.23344428981451143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402469379","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57347363,0.0037250607,0.10680467,0.004086371,0.00060686545,0.000073818555,0.00064803095,0.00038479606,0.31019673],"genre_scores_gemma":[0.9519435,0.0016917272,0.0148498155,0.00040082782,0.0007574633,0.00006795548,0.00046285894,0.00022416767,0.029601594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997212,0.00009802481,0.000008905158,0.000051211446,0.00006906958,0.000051399966],"domain_scores_gemma":[0.9986615,0.00065951573,0.00019377565,0.000113379196,0.0001501154,0.00022163412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003769698,0.0005378571,0.0005091162,0.0018931465,0.00089706626,0.0015977055,0.0008769283,0.00087063946,0.013505816],"category_scores_gemma":[0.0029463698,0.00030420642,0.00042114974,0.00093605,0.0022053104,0.00418998,0.0016057955,0.001444643,0.0019720662],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000401815,0.000016725719,0.00041564638,0.000034699522,0.000006612775,0.00006264914,0.00015297536,0.0019459026,0.00082514493,0.9825632,0.0030953817,0.010840882],"study_design_scores_gemma":[0.0000094311945,0.000009883769,0.000472602,0.000011237888,0.0000045669476,0.000095615105,0.00010115421,0.00664372,0.00023399212,0.98897356,0.0034389729,0.0000052463874],"about_ca_topic_score_codex":0.0011558271,"about_ca_topic_score_gemma":0.0014603017,"teacher_disagreement_score":0.013505816,"about_ca_system_score_codex":0.00057447836,"about_ca_system_score_gemma":0.00026756572,"threshold_uncertainty_score":0.045181453},"labels":[],"label_agreement":null},{"id":"W2402472842","doi":"","title":"Combinatorial proofs of a kind of binomial and q-binomial coefficient identities.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Binomial coefficient; Mathematics; Gaussian binomial coefficient; Central binomial coefficient; Mathematical proof; Binomial (polynomial); Binomial approximation; Binomial theorem; Statistics; Binomial distribution; Negative binomial distribution; Discrete mathematics; Poisson distribution; Geometry","score_opus":0.019630532231098063,"score_gpt":0.2792168611617816,"score_spread":0.25958632893068356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402472842","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049756106,0.0060555483,0.44103128,0.012207742,0.0045125345,0.00011100902,0.0012949764,0.0005633601,0.4844675],"genre_scores_gemma":[0.7846434,0.004882545,0.103916384,0.0056053447,0.004594026,0.00032246517,0.0012930394,0.0005938479,0.0941489],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985311,0.00048328875,0.00007652535,0.00019518689,0.00056187,0.00015199372],"domain_scores_gemma":[0.9957041,0.002210911,0.00034156453,0.0006207531,0.0007706019,0.00035206898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017034765,0.00086510635,0.0007149578,0.001765909,0.001975458,0.002703203,0.0016205689,0.0012912202,0.020735232],"category_scores_gemma":[0.009561246,0.0005442073,0.0013806111,0.0019022704,0.0032703734,0.0071670962,0.0036243277,0.004327003,0.003925623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010299844,0.00001602187,0.00008763989,0.000049590923,0.000008525396,0.00007288636,0.00008657624,0.00012653453,0.00034523857,0.99021155,0.005311225,0.0036739325],"study_design_scores_gemma":[0.000014777555,0.000007847851,0.00020887777,0.000026975486,0.000012235086,0.0002415738,0.00003633831,0.00096894865,0.0003939678,0.9876988,0.010379036,0.000010581105],"about_ca_topic_score_codex":0.0008434384,"about_ca_topic_score_gemma":0.000966851,"teacher_disagreement_score":0.020735232,"about_ca_system_score_codex":0.0012230001,"about_ca_system_score_gemma":0.0007985313,"threshold_uncertainty_score":0.069366276},"labels":[],"label_agreement":null},{"id":"W2402494642","doi":"","title":"Potentially K-pr+1-graphic sequences.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arithmetic","score_opus":0.011221293487695464,"score_gpt":0.24757840790882693,"score_spread":0.23635711442113147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402494642","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25641283,0.0031399452,0.23972592,0.0028149053,0.0011305717,0.00033586498,0.0049696597,0.003426383,0.48804384],"genre_scores_gemma":[0.74658066,0.001278535,0.077762805,0.0007054411,0.0003217736,0.00020389141,0.004391906,0.0007849728,0.1679701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993237,0.000115303694,0.00005461176,0.00017860031,0.00017277797,0.00015505069],"domain_scores_gemma":[0.9988362,0.00043818192,0.00015818304,0.00025064367,0.00020203844,0.000114764196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029054563,0.0010091816,0.000550529,0.0015910873,0.0010231736,0.002680161,0.0008917422,0.0009082906,0.047175035],"category_scores_gemma":[0.003066016,0.00042622347,0.00054640486,0.0012695343,0.0009730212,0.00232406,0.0017586289,0.0014817027,0.014805883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001213458,0.00018912904,0.0025452776,0.00094573555,0.00007126932,0.0030243453,0.00078229303,0.005138544,0.03577169,0.71374494,0.035501085,0.20107217],"study_design_scores_gemma":[0.00012312668,0.00023432843,0.0038290187,0.0002645314,0.00009442279,0.005638519,0.00050057424,0.015315563,0.021216316,0.7856944,0.16696241,0.00012676357],"about_ca_topic_score_codex":0.00054897065,"about_ca_topic_score_gemma":0.0013151692,"teacher_disagreement_score":0.047175035,"about_ca_system_score_codex":0.0007275112,"about_ca_system_score_gemma":0.00042188625,"threshold_uncertainty_score":0.15781617},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Arithmetic","score_opus":0.005252879354272561,"score_gpt":0.2022782413432858,"score_spread":0.19702536198901321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402513589","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19995132,0.0009151319,0.7099171,0.00072528754,0.00010910798,0.00023442088,0.0014396262,0.00058493466,0.08612308],"genre_scores_gemma":[0.6579076,0.0016700026,0.28151855,0.0004579815,0.00019112605,0.00044092152,0.0028490995,0.00052718824,0.05443754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993981,0.00015540257,0.000040373277,0.00015380871,0.00014879755,0.00010353603],"domain_scores_gemma":[0.9980506,0.00079746125,0.00029277988,0.00036933768,0.00027753488,0.00021227468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005592414,0.000806879,0.00059206295,0.0023949326,0.0011083542,0.0028644197,0.0008584846,0.00068982947,0.0094295265],"category_scores_gemma":[0.0023870799,0.0007804188,0.0010623159,0.0019504377,0.0013754574,0.003654547,0.0012810963,0.0013760083,0.0009928979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004977616,0.000033237953,0.00035824554,0.000085666106,0.000022030228,0.000104022794,0.00030819615,0.008332717,0.001612035,0.96549505,0.0025564095,0.021042664],"study_design_scores_gemma":[0.000011695665,0.000010804824,0.00029380264,0.000034659824,0.000018966746,0.000102556245,0.0001209779,0.016489387,0.00063596567,0.97537404,0.006897854,0.0000092715],"about_ca_topic_score_codex":0.0015393719,"about_ca_topic_score_gemma":0.002493131,"teacher_disagreement_score":0.0094295265,"about_ca_system_score_codex":0.001005941,"about_ca_system_score_gemma":0.0007189791,"threshold_uncertainty_score":0.031544864},"labels":[],"label_agreement":null},{"id":"W2402546767","doi":"","title":"Pebbling Graph Products.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.028439147918434132,"score_gpt":0.22996687108919764,"score_spread":0.2015277231707635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402546767","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027124295,0.0022710452,0.9051991,0.0008581853,0.0005865328,0.00014012189,0.0008341326,0.0030278238,0.05995866],"genre_scores_gemma":[0.30099878,0.0027174312,0.615327,0.00087898155,0.00041949644,0.00030808817,0.0027761946,0.0019352889,0.0746388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868435,0.00027301974,0.00010080212,0.00030913623,0.0004923423,0.00014030562],"domain_scores_gemma":[0.9968066,0.0010733606,0.00015917259,0.0013834813,0.00045742333,0.00011992379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009229124,0.0009058452,0.0008198942,0.0022358808,0.001239309,0.0025460883,0.0014202832,0.0008754548,0.0190348],"category_scores_gemma":[0.0067254417,0.0005098332,0.0008759867,0.0034979496,0.0016198494,0.004890759,0.0029410867,0.0020344316,0.0099596325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018243684,0.00011258177,0.00046576417,0.00030304398,0.0000453919,0.00019440759,0.0002632209,0.009907163,0.005539432,0.62229395,0.022629734,0.33806288],"study_design_scores_gemma":[0.000023404811,0.0000727408,0.00018712647,0.00009755539,0.00003513016,0.000525571,0.00011560335,0.03687202,0.0143072475,0.8825661,0.06517082,0.000026794163],"about_ca_topic_score_codex":0.0010377478,"about_ca_topic_score_gemma":0.0021256013,"teacher_disagreement_score":0.0190348,"about_ca_system_score_codex":0.00091037474,"about_ca_system_score_gemma":0.00089530036,"threshold_uncertainty_score":0.06367779},"labels":[],"label_agreement":null},{"id":"W2402601247","doi":"","title":"A lower bound for 2-rainbow domination number of generalized Petersen graphs P(n, 3).","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Rainbow; Combinatorics; Domination analysis; Graph; Physics","score_opus":0.028371979712307385,"score_gpt":0.29753301196464027,"score_spread":0.2691610322523329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402601247","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44344378,0.010947468,0.20168,0.009194937,0.0014241416,0.00040704035,0.006794929,0.0021991627,0.32390863],"genre_scores_gemma":[0.9103446,0.003848354,0.056071877,0.0010470414,0.0007338492,0.0004953596,0.003223417,0.00044074244,0.023794744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854374,0.00018650765,0.000056720306,0.000345172,0.00043598496,0.00043190285],"domain_scores_gemma":[0.9942934,0.003898684,0.00033687998,0.00057788385,0.00028799928,0.0006051465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014026178,0.0013412131,0.0011871753,0.0027524554,0.0025568292,0.0035745474,0.0032109926,0.0018298484,0.018847546],"category_scores_gemma":[0.0073933075,0.0006369787,0.001114846,0.0027259365,0.0019050166,0.0063674217,0.0030977598,0.0036039453,0.0031138107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016580382,0.0006004015,0.008014486,0.0022399928,0.0003549355,0.0008862179,0.0011178328,0.059648685,0.039567664,0.69834197,0.080206804,0.107363045],"study_design_scores_gemma":[0.00014068968,0.00022327963,0.006773044,0.00028935162,0.00028895523,0.0012833632,0.0003749296,0.10998997,0.015930962,0.8203463,0.04421249,0.0001466088],"about_ca_topic_score_codex":0.0011790735,"about_ca_topic_score_gemma":0.0027672576,"teacher_disagreement_score":0.018847546,"about_ca_system_score_codex":0.0025342216,"about_ca_system_score_gemma":0.0012395032,"threshold_uncertainty_score":0.06305134},"labels":[],"label_agreement":null},{"id":"W2402605984","doi":"","title":"Fractional incidence coloring and star arboricity of graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arboricity; Mathematics; Edge coloring; Star (game theory); Combinatorics; Graph; Planar graph; Mathematical analysis; Line graph","score_opus":0.020157839940887285,"score_gpt":0.28700055136077607,"score_spread":0.2668427114198888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402605984","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63247967,0.0020158084,0.1798823,0.002670133,0.00052682863,0.000050766906,0.0005527475,0.00043810348,0.18138368],"genre_scores_gemma":[0.966743,0.0008158029,0.015743228,0.00023076826,0.00023109466,0.000026479027,0.0003394834,0.00005973882,0.01581038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973434,0.000066639084,0.00001247375,0.00005686554,0.0000563243,0.00007328699],"domain_scores_gemma":[0.9985594,0.0007595012,0.00019971574,0.00018565521,0.00014217259,0.00015360609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028914487,0.00026207886,0.00030691066,0.0008926186,0.0011261018,0.0014223596,0.00047359872,0.0005318573,0.005688107],"category_scores_gemma":[0.0026083407,0.00024023757,0.00035463882,0.0010822807,0.0013125282,0.0018854799,0.000683648,0.0010653625,0.00052962534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008547348,0.000050083698,0.0013658917,0.000052385098,0.00001028819,0.0001885264,0.0002442707,0.0048556747,0.0032617417,0.96495616,0.0045516724,0.020377899],"study_design_scores_gemma":[0.000013419989,0.000016303764,0.00076758076,0.000015834341,0.0000118856315,0.00023121209,0.00013725724,0.017390002,0.0014595074,0.9727912,0.007158482,0.000007216766],"about_ca_topic_score_codex":0.0022790062,"about_ca_topic_score_gemma":0.0032875328,"teacher_disagreement_score":0.005688107,"about_ca_system_score_codex":0.0009072078,"about_ca_system_score_gemma":0.00045545,"threshold_uncertainty_score":0.019028604},"labels":[],"label_agreement":null},{"id":"W2402627327","doi":"","title":"Spanning trees with bounded total excess","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Bounded function; Spanning tree; Combinatorics; Mathematical analysis","score_opus":0.01870950757343491,"score_gpt":0.2196476283567328,"score_spread":0.20093812078329787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402627327","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2926771,0.0020983757,0.6323339,0.0031137206,0.00027803826,0.00015403365,0.0013300603,0.001703778,0.06631103],"genre_scores_gemma":[0.861912,0.0016674739,0.10581286,0.0005812523,0.00033437915,0.0002236239,0.0009079114,0.0006014793,0.02795907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857914,0.00035807956,0.00010251943,0.0002443822,0.00044236134,0.00027349885],"domain_scores_gemma":[0.98993146,0.0061171474,0.00067551405,0.001549451,0.0007944954,0.0009319666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017053507,0.0009865537,0.0017319964,0.0018081884,0.0015696797,0.004056441,0.0022313145,0.001665836,0.009300838],"category_scores_gemma":[0.011890666,0.00084041397,0.00074332557,0.002858886,0.001687615,0.0064005484,0.0036758482,0.0026959262,0.001588315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027364938,0.00008038919,0.0005217848,0.00025106999,0.000044492783,0.00018584258,0.0002625018,0.03896019,0.005727068,0.91625595,0.005253286,0.03218381],"study_design_scores_gemma":[0.000042352232,0.00004064725,0.00019770113,0.000036162757,0.000049391452,0.00025318115,0.000074525116,0.082771145,0.0018516822,0.91041416,0.0042522606,0.000016663358],"about_ca_topic_score_codex":0.0005736836,"about_ca_topic_score_gemma":0.0012370156,"teacher_disagreement_score":0.009300838,"about_ca_system_score_codex":0.0016644447,"about_ca_system_score_gemma":0.0009171125,"threshold_uncertainty_score":0.03111434},"labels":[],"label_agreement":null},{"id":"W2402629944","doi":"","title":"Jacobi Forms and Hilbert-Siegel Modular Forms over Totally Real Fields and Self-Dual Codes over Polynomial Rings Z 2m [x] / .","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Geometry","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dual (grammatical number); Modular design; Pure mathematics; Polynomial ring; Polynomial; Algebra over a field; Mathematical analysis; Computer science; Programming language; Linguistics","score_opus":0.009842763444804248,"score_gpt":0.2605091660791301,"score_spread":0.2506664026343259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402629944","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7951645,0.0027068998,0.040794764,0.0028318493,0.00036244417,0.000047736372,0.00038920555,0.0001570766,0.15754545],"genre_scores_gemma":[0.97550654,0.0005820842,0.0035786447,0.00012686495,0.00024192368,0.000013182566,0.000116286334,0.000026450094,0.019807996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995796,0.000103127306,0.000017725488,0.00006058201,0.00013541886,0.00010361786],"domain_scores_gemma":[0.9992873,0.00015021132,0.00020455252,0.00007690819,0.00010667741,0.00017434708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077023264,0.0005875836,0.00038567604,0.0015693511,0.0010163031,0.0020101718,0.0005581955,0.00065879285,0.006055039],"category_scores_gemma":[0.0016168961,0.0003390329,0.00044209606,0.001048273,0.0026561676,0.0035921447,0.0015965102,0.0015692136,0.0008137499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003418644,0.000019939689,0.00030134676,0.000019901447,0.000005369899,0.00006415675,0.00019519133,0.0004913518,0.00047416007,0.9951893,0.0006240189,0.002580961],"study_design_scores_gemma":[0.000022556233,0.00002851734,0.0007385399,0.000014972993,0.000007716284,0.00023112411,0.00018448308,0.0029877883,0.00063178706,0.99212533,0.0030108255,0.00001646756],"about_ca_topic_score_codex":0.0008337537,"about_ca_topic_score_gemma":0.0008338089,"teacher_disagreement_score":0.006055039,"about_ca_system_score_codex":0.0010332129,"about_ca_system_score_gemma":0.00062274846,"threshold_uncertainty_score":0.020256102},"labels":[],"label_agreement":null},{"id":"W2402639370","doi":"","title":"The Hamiltonian number of graphs with prescribed connectivity.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hamiltonian (control theory); Combinatorics; Mathematical optimization","score_opus":0.01062008269438518,"score_gpt":0.27046130490837533,"score_spread":0.25984122221399014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402639370","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72091174,0.002175407,0.081079535,0.00410331,0.0007116184,0.0000914246,0.0020581672,0.0005171543,0.18835177],"genre_scores_gemma":[0.9835015,0.0006567041,0.0063875522,0.00018377324,0.00019310565,0.000075758406,0.00043945378,0.00008428216,0.00847779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963284,0.00012839651,0.000014385041,0.00006382852,0.00008772572,0.000072757975],"domain_scores_gemma":[0.9968696,0.0017714915,0.00046391305,0.00024315131,0.00019760014,0.00045418588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042893566,0.00032823894,0.00031574018,0.0018594958,0.0008065078,0.0012866424,0.00087208784,0.0007604698,0.0119249625],"category_scores_gemma":[0.0048973635,0.0002610927,0.00022490731,0.0009196063,0.0020049107,0.0027030406,0.0010245998,0.0006952772,0.00082326453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011011675,0.00002611345,0.0011248433,0.00015380884,0.000020489704,0.00010653977,0.0002402223,0.0050643994,0.0033329292,0.96703815,0.008314058,0.014468426],"study_design_scores_gemma":[0.00004551922,0.00003210824,0.0018939809,0.00005047493,0.000021481263,0.0002987036,0.00021597599,0.023592176,0.0019748001,0.9647069,0.0071473047,0.000020608582],"about_ca_topic_score_codex":0.00056892337,"about_ca_topic_score_gemma":0.0009841805,"teacher_disagreement_score":0.0119249625,"about_ca_system_score_codex":0.0007972665,"about_ca_system_score_gemma":0.00037919852,"threshold_uncertainty_score":0.039892912},"labels":[],"label_agreement":null},{"id":"W2402648100","doi":"","title":"Minimal weak separators of chordal graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chordal graph; Mathematics; Combinatorics; Graph","score_opus":0.025998766570302315,"score_gpt":0.2776326157876752,"score_spread":0.25163384921737286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402648100","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5215764,0.0017039785,0.21567796,0.0025460725,0.0004368717,0.00020075955,0.0027704674,0.0010873844,0.25400007],"genre_scores_gemma":[0.9038209,0.00067938934,0.039620314,0.00038585658,0.00018828816,0.00014051254,0.0022672524,0.00029816938,0.052599385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913424,0.00017473231,0.00007481927,0.00020057456,0.0002534405,0.00016216896],"domain_scores_gemma":[0.9962381,0.0017999841,0.0004700169,0.0005583879,0.0003809863,0.000552408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005661894,0.00059123454,0.0006449168,0.0012880597,0.00211281,0.0030139205,0.0014850921,0.0011072699,0.015780568],"category_scores_gemma":[0.005139689,0.0006063559,0.0005966594,0.0014258336,0.001723293,0.005462986,0.004193752,0.0023464274,0.0030323046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002491536,0.00006146492,0.00092270266,0.00025379236,0.000043214808,0.00020221881,0.0007932264,0.0010709844,0.0067552677,0.96088076,0.00607564,0.022691641],"study_design_scores_gemma":[0.000065250446,0.000038477436,0.00057984696,0.000067126384,0.00004914838,0.00027984483,0.0004899299,0.003684656,0.0049710893,0.96860594,0.021149082,0.000019632176],"about_ca_topic_score_codex":0.0005413633,"about_ca_topic_score_gemma":0.0010639471,"teacher_disagreement_score":0.015780568,"about_ca_system_score_codex":0.0010520668,"about_ca_system_score_gemma":0.00065126235,"threshold_uncertainty_score":0.052791238},"labels":[],"label_agreement":null},{"id":"W2402676548","doi":"","title":"On α-labelling of disconneted graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Labelling; Combinatorics; Chemistry","score_opus":0.02423523742204841,"score_gpt":0.23884651345714775,"score_spread":0.21461127603509933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402676548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26722467,0.002092249,0.5181155,0.00622416,0.000793224,0.00022690039,0.002888215,0.0015791272,0.20085597],"genre_scores_gemma":[0.7427903,0.0020203458,0.18933429,0.0020245707,0.0005589072,0.00034320072,0.00407851,0.000815907,0.058033973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804246,0.00070143,0.00011717405,0.00045282132,0.0003458511,0.00034022628],"domain_scores_gemma":[0.98957914,0.006205713,0.0009208434,0.0017434288,0.0006559285,0.0008950193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018190407,0.0007404386,0.0009248203,0.001974333,0.0029491181,0.004087798,0.0023347982,0.002254157,0.012035372],"category_scores_gemma":[0.009477321,0.0007922261,0.0010047565,0.002605432,0.0034771052,0.009031889,0.003989278,0.0035887668,0.0025119903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094809846,0.00006779056,0.00080468744,0.0001502335,0.000015167969,0.00009359184,0.0003337386,0.004565309,0.000970843,0.9614524,0.010058968,0.021392357],"study_design_scores_gemma":[0.000018500774,0.0000150264295,0.000308271,0.000051529587,0.000011285164,0.00016549333,0.00024769016,0.011683059,0.0008233812,0.97777975,0.0088802455,0.00001572823],"about_ca_topic_score_codex":0.001850721,"about_ca_topic_score_gemma":0.0023924217,"teacher_disagreement_score":0.012035372,"about_ca_system_score_codex":0.0022992415,"about_ca_system_score_gemma":0.00094616384,"threshold_uncertainty_score":0.04026234},"labels":[],"label_agreement":null},{"id":"W2402697736","doi":"","title":"A note on the value about a disjoint convex partition problem.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematical Inequalities and Applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Disjoint sets; Partition (number theory); Regular polygon; Combinatorics; Geometry","score_opus":0.04571363290064037,"score_gpt":0.31038494710349035,"score_spread":0.26467131420284995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402697736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01990441,0.025956195,0.55985457,0.10749624,0.011871389,0.00013780754,0.0013877895,0.00036258317,0.27302906],"genre_scores_gemma":[0.55045533,0.034151826,0.29863223,0.02229504,0.026125649,0.00067480665,0.0016623063,0.0013315728,0.0646713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942357,0.0027694788,0.00019550651,0.0009828496,0.001443942,0.00037250514],"domain_scores_gemma":[0.96920323,0.025643442,0.0006528332,0.0024957298,0.0011480986,0.0008566673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0082126595,0.0013171503,0.0025557424,0.002119707,0.0041715456,0.0076207663,0.0052303523,0.0047851265,0.016592618],"category_scores_gemma":[0.044811867,0.00084779714,0.0021820655,0.00462278,0.01350673,0.0226157,0.007074941,0.018257225,0.0023817203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007391782,0.000018038456,0.00014064081,0.00014585942,0.000024795097,0.000060729835,0.0000883297,0.0030277472,0.00017035645,0.96007,0.020561319,0.015618122],"study_design_scores_gemma":[0.0000103435095,0.000011772903,0.00007320731,0.000047835387,0.000012000364,0.000039577626,0.000036875663,0.004168606,0.00012561919,0.9850032,0.010459795,0.000011239174],"about_ca_topic_score_codex":0.0029725216,"about_ca_topic_score_gemma":0.0021756296,"teacher_disagreement_score":0.016592618,"about_ca_system_score_codex":0.0038656914,"about_ca_system_score_gemma":0.0018147186,"threshold_uncertainty_score":0.05550784},"labels":[],"label_agreement":null},{"id":"W2402699812","doi":"","title":"The existence of doubly disjoint (mt+1, m, m-1) difference families.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Disjoint sets; Mathematics; Combinatorics","score_opus":0.01082447369872883,"score_gpt":0.2015718169925771,"score_spread":0.19074734329384826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402699812","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73925716,0.0007826871,0.15403427,0.0017968384,0.00021880871,0.00005034242,0.00068618805,0.0002414554,0.10293226],"genre_scores_gemma":[0.98161924,0.00016794987,0.012246712,0.00019640742,0.000051620456,0.000047137328,0.00021701706,0.00003254702,0.005421284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990638,0.0002544271,0.000043818396,0.0002056907,0.0002327094,0.00019956828],"domain_scores_gemma":[0.99401313,0.0039609545,0.0005295296,0.00065093813,0.0004409373,0.00040447363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086488057,0.00020550049,0.00036599752,0.0011888802,0.0018517361,0.0015744226,0.00077399134,0.000901973,0.0061468715],"category_scores_gemma":[0.007545009,0.00044797512,0.00039433423,0.0005180827,0.0016026687,0.0027978003,0.0023618562,0.0013154573,0.0006824404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014920566,0.000029619383,0.0015401943,0.000045524645,0.000010994419,0.00019597664,0.0003477891,0.001013703,0.004331072,0.98130625,0.0017398719,0.009289792],"study_design_scores_gemma":[0.00005621561,0.00006106944,0.0016463445,0.000055262848,0.00002793596,0.0016234206,0.0004560279,0.014449252,0.008166907,0.96252,0.010904507,0.00003306107],"about_ca_topic_score_codex":0.00026093496,"about_ca_topic_score_gemma":0.00027068943,"teacher_disagreement_score":0.0061468715,"about_ca_system_score_codex":0.00082362856,"about_ca_system_score_gemma":0.00036889652,"threshold_uncertainty_score":0.020563364},"labels":[],"label_agreement":null},{"id":"W2402705223","doi":"","title":"Construction and enumeration of a special class of transitive relations.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Enumeration; Transitive relation; Mathematics; Class (philosophy); Combinatorics; Pure mathematics; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.005668462557410665,"score_gpt":0.20513138739459802,"score_spread":0.19946292483718736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402705223","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16436659,0.0010548861,0.5579726,0.0017026267,0.0008512151,0.0002888521,0.001953288,0.0023859204,0.26942402],"genre_scores_gemma":[0.7573026,0.0005112184,0.18613005,0.0005876052,0.00033079754,0.000267462,0.0021594586,0.00069744984,0.052013405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802655,0.000418306,0.00020952965,0.00051554345,0.00046995407,0.00036005833],"domain_scores_gemma":[0.9966652,0.0012837943,0.00026331923,0.0011011626,0.00036592857,0.00032061985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011469508,0.00050349586,0.001030784,0.0019641602,0.00311845,0.0046502342,0.0016657003,0.0015153432,0.014083231],"category_scores_gemma":[0.004871544,0.0007833843,0.0017738863,0.0022304317,0.0033483813,0.0082606375,0.0034268592,0.0030046145,0.0031246657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027376755,0.000035653888,0.00032256026,0.000041065094,0.00000832452,0.00014327059,0.0002519143,0.00020789205,0.0010464122,0.98656726,0.002628418,0.008719876],"study_design_scores_gemma":[0.000024221725,0.000020572108,0.0003419571,0.0000357379,0.000027360411,0.00073339517,0.00020123448,0.0030859045,0.0025835177,0.96307385,0.0298486,0.000023776625],"about_ca_topic_score_codex":0.0014555424,"about_ca_topic_score_gemma":0.0018890584,"teacher_disagreement_score":0.014083231,"about_ca_system_score_codex":0.0013659507,"about_ca_system_score_gemma":0.0010926682,"threshold_uncertainty_score":0.04711312},"labels":[],"label_agreement":null},{"id":"W2402710531","doi":"","title":"Semi-Deterministic Virtual Finite Automaton(SDVFA) of order (s, t) and Regular Grammar.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Two-way deterministic finite automaton; Deterministic automaton; Büchi automaton; Order (exchange); Nondeterministic finite automaton; Automaton; Deterministic finite automaton; Finite-state machine; Theoretical computer science; Computer science; Algorithm; Automata theory","score_opus":0.006092339025272047,"score_gpt":0.22023321515871075,"score_spread":0.2141408761334387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402710531","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14318869,0.0006017502,0.82114166,0.0006600908,0.00021826259,0.00011923588,0.0019331556,0.005263025,0.026874132],"genre_scores_gemma":[0.8588374,0.00022249577,0.12678802,0.00018009273,0.00004795642,0.00016863683,0.0012359562,0.0003758018,0.012143706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910825,0.0002117356,0.00009716231,0.00027885864,0.00015684844,0.00014706049],"domain_scores_gemma":[0.997336,0.0012874859,0.00022407508,0.00064784806,0.0003127493,0.00019181444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066724676,0.00035335403,0.0006598432,0.00068000454,0.0009605693,0.0021557075,0.0015438859,0.0009955813,0.003879255],"category_scores_gemma":[0.0035624988,0.00036034262,0.0012632759,0.00067644694,0.0024325484,0.001891113,0.001495938,0.0008151947,0.00096976495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023974218,0.000051572762,0.0015445285,0.00013610412,0.000043317767,0.0006722185,0.00039558503,0.039691377,0.0063295597,0.93092436,0.0020327717,0.017938763],"study_design_scores_gemma":[0.000059376882,0.00008037447,0.00043435153,0.000050743496,0.000056330144,0.0004688995,0.0001360315,0.1771621,0.006064453,0.801519,0.013912146,0.000056264318],"about_ca_topic_score_codex":0.0037750744,"about_ca_topic_score_gemma":0.004845099,"teacher_disagreement_score":0.003879255,"about_ca_system_score_codex":0.0012633505,"about_ca_system_score_gemma":0.0023096907,"threshold_uncertainty_score":0.012977362},"labels":[],"label_agreement":null},{"id":"W2402718296","doi":"","title":"Clique-chromatic Numbers of Line Graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Clique number; Chromatic scale; Clique; Combinatorics; Line (geometry); Geometry","score_opus":0.023174400193032622,"score_gpt":0.25065197426240815,"score_spread":0.22747757406937552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402718296","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48553002,0.0033072082,0.17465669,0.009647864,0.0006426107,0.00021623656,0.006782855,0.0010632046,0.3181533],"genre_scores_gemma":[0.9334866,0.0010466438,0.034698453,0.0005577157,0.00036076823,0.0001918364,0.0022305606,0.00025007038,0.027177393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999099,0.00028037047,0.000032392527,0.00023112471,0.00018161282,0.00017548347],"domain_scores_gemma":[0.99294573,0.0047571724,0.00070021866,0.0005512706,0.0004648322,0.00058068323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010200216,0.00055123074,0.0005287588,0.0025467859,0.001995206,0.004139282,0.0015498401,0.0014607761,0.023903789],"category_scores_gemma":[0.008105526,0.0006144295,0.0005297354,0.0024661056,0.0023517946,0.0066462453,0.0013480085,0.0024432915,0.0019103696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001891841,0.00006776006,0.0019150105,0.0001658434,0.00002532221,0.00005216802,0.00025917232,0.0061280252,0.001869525,0.9502213,0.020573191,0.018533504],"study_design_scores_gemma":[0.00005589093,0.00002414046,0.0017827778,0.000054647528,0.00002650618,0.00016695404,0.00026727465,0.029422954,0.001759687,0.9527074,0.0137062995,0.000025296957],"about_ca_topic_score_codex":0.0027657934,"about_ca_topic_score_gemma":0.004228753,"teacher_disagreement_score":0.023903789,"about_ca_system_score_codex":0.002414656,"about_ca_system_score_gemma":0.00093811465,"threshold_uncertainty_score":0.07996613},"labels":[],"label_agreement":null},{"id":"W2402732815","doi":"","title":"Spectral norm, Eigenvalues and Determinant of Circulant Matrix involving the Generalized k-Horadam numbers.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Circulant matrix; Eigenvalues and eigenvectors; Matrix norm; Norm (philosophy); Pure mathematics; Matrix (chemical analysis); Combinatorics","score_opus":0.012053039979164914,"score_gpt":0.2771455120921384,"score_spread":0.2650924721129735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402732815","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60732496,0.0070761703,0.2618493,0.003080721,0.002092531,0.00007355074,0.0008425705,0.00039074372,0.11726945],"genre_scores_gemma":[0.95365417,0.0016555941,0.02375053,0.00032786094,0.0009361702,0.000079736266,0.0002998876,0.00013964181,0.01915634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995914,0.00013116881,0.000016569473,0.00008046293,0.00011601832,0.00006438453],"domain_scores_gemma":[0.99853075,0.00048801667,0.000292102,0.00013621378,0.00030990926,0.00024293548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080862315,0.0007187216,0.000543392,0.002158914,0.00081093464,0.0017437463,0.0009829318,0.0008240486,0.006418495],"category_scores_gemma":[0.0037421642,0.0002582535,0.00036469783,0.00093294133,0.0021915887,0.0025836357,0.00092368433,0.0011493394,0.0012638818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006947871,0.000033497792,0.0004323284,0.00007473075,0.000014228214,0.00014936383,0.00018782793,0.002033483,0.0036857328,0.9820064,0.0035090293,0.007803835],"study_design_scores_gemma":[0.000015023451,0.00003967033,0.0011619846,0.00004018951,0.000010882936,0.00037941104,0.00018962656,0.033845015,0.0013644267,0.9582884,0.0046117348,0.000053736843],"about_ca_topic_score_codex":0.0006000832,"about_ca_topic_score_gemma":0.00093487307,"teacher_disagreement_score":0.006418495,"about_ca_system_score_codex":0.0005281098,"about_ca_system_score_gemma":0.00055141014,"threshold_uncertainty_score":0.021472037},"labels":[],"label_agreement":null},{"id":"W2402757052","doi":"","title":"Lattice of all subsets of a finite set and partition lattice of a n-set.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Lattice (music); Partition (number theory); Combinatorics; Discrete mathematics; Physics","score_opus":0.031041110975455997,"score_gpt":0.2733207220177396,"score_spread":0.2422796110422836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402757052","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21804011,0.0059725945,0.43504733,0.00432998,0.0023858524,0.00035226953,0.011208312,0.0008048747,0.32185882],"genre_scores_gemma":[0.7577139,0.0020782384,0.15531413,0.0007854402,0.0009859805,0.00052419695,0.005276351,0.00025986234,0.077061936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989042,0.00033001436,0.00008144253,0.00019514776,0.00031318225,0.00017602612],"domain_scores_gemma":[0.99895954,0.0002580785,0.00017167094,0.00013422432,0.00022333917,0.00025318746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083096226,0.00062508334,0.0007060489,0.0024664502,0.0019013253,0.004060323,0.0010393343,0.00065520254,0.01009293],"category_scores_gemma":[0.0019040657,0.00034381798,0.00091660494,0.0015855989,0.0028001852,0.004915245,0.001938695,0.0018539901,0.0023176232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086489905,0.000025254343,0.0004074189,0.00006187288,0.000018153023,0.00012592213,0.0002810634,0.00075543846,0.0012925126,0.98512876,0.0031897672,0.008627382],"study_design_scores_gemma":[0.00002220027,0.00004493808,0.000894412,0.0000438688,0.00001533781,0.00046670914,0.0003691813,0.003427301,0.00096760754,0.96394426,0.029777342,0.000026930762],"about_ca_topic_score_codex":0.001583403,"about_ca_topic_score_gemma":0.00178471,"teacher_disagreement_score":0.01009293,"about_ca_system_score_codex":0.0012851335,"about_ca_system_score_gemma":0.0012667901,"threshold_uncertainty_score":0.033764243},"labels":[],"label_agreement":null},{"id":"W2402760489","doi":"","title":"Decomposition Of Complete Graphs And Complete Bipartite Graphs Into α-Labelled Trees.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Decomposition; Robertson–Seymour theorem; Cograph; Modular decomposition; 1-planar graph; Indifference graph; Pathwidth; Chordal graph; Discrete mathematics; Graph; Line graph; Chemistry","score_opus":0.014551926494112716,"score_gpt":0.24584319492605639,"score_spread":0.23129126843194367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402760489","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15258418,0.0030156265,0.7170677,0.002355354,0.00024127404,0.00019985579,0.0035737911,0.00061937625,0.120342895],"genre_scores_gemma":[0.653976,0.0021679956,0.29629454,0.0008428945,0.00031850956,0.00030906,0.005533294,0.00042419587,0.04013349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999228,0.00025945643,0.00004729074,0.00017179601,0.00014668086,0.00014680892],"domain_scores_gemma":[0.99701655,0.001431604,0.00036883503,0.0005016611,0.00031048336,0.00037100856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009293052,0.00049958075,0.0006227476,0.0013606299,0.0011170385,0.003034084,0.0011259409,0.0009553172,0.008297121],"category_scores_gemma":[0.003737305,0.00055371755,0.00083234516,0.0016431271,0.0014845225,0.0047521587,0.0015396659,0.0020271074,0.0015857772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009091249,0.000048740345,0.00065379066,0.00013859101,0.000019297975,0.000046055513,0.00021605154,0.0044230246,0.0014052945,0.96170473,0.008222566,0.02303099],"study_design_scores_gemma":[0.000014050353,0.0000106619045,0.00042519715,0.000048516384,0.000015104279,0.00010122701,0.00015082867,0.013790546,0.00065386994,0.9748175,0.009963835,0.000008616334],"about_ca_topic_score_codex":0.0015629355,"about_ca_topic_score_gemma":0.0024935578,"teacher_disagreement_score":0.008297121,"about_ca_system_score_codex":0.0014821473,"about_ca_system_score_gemma":0.00080239016,"threshold_uncertainty_score":0.027756631},"labels":[],"label_agreement":null},{"id":"W2402766034","doi":"","title":"On D -equivalence class of complete bipartite graphs","year":2014,"lang":"ca","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Vertex (graph theory); Conjecture; Graph; Discrete mathematics; Complete bipartite graph; Dominating set","score_opus":0.02770719562700326,"score_gpt":0.29023539180456365,"score_spread":0.2625281961775604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402766034","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8837032,0.0007078789,0.061211854,0.0014983695,0.00007914545,0.00010341757,0.0015798281,0.0002692736,0.050847113],"genre_scores_gemma":[0.98557407,0.00045531205,0.00687131,0.00023944798,0.00021937827,0.00011640663,0.0017149572,0.00006581504,0.0047434107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834895,0.000264752,0.00006121926,0.00050130254,0.00037287283,0.00045102282],"domain_scores_gemma":[0.9952958,0.0026907027,0.0006502304,0.00030647736,0.00024363161,0.00081316644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010332464,0.0006486093,0.0011272604,0.0029698492,0.0022847166,0.0030294433,0.0011123694,0.0010026987,0.0066466075],"category_scores_gemma":[0.005744157,0.0004533188,0.0009495228,0.0020163802,0.0024133115,0.0037646445,0.002124382,0.00211114,0.0005767934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048379827,0.0002101569,0.004362229,0.00012398713,0.00003135047,0.0003401746,0.0008811651,0.0090171,0.003590853,0.9561707,0.003918854,0.020869672],"study_design_scores_gemma":[0.000099801204,0.000055629214,0.0031861274,0.000028495331,0.000012926553,0.00034481543,0.00015258483,0.042445365,0.0011615551,0.9473794,0.005106231,0.000027099959],"about_ca_topic_score_codex":0.002607201,"about_ca_topic_score_gemma":0.0011968651,"teacher_disagreement_score":0.0066466075,"about_ca_system_score_codex":0.0030745133,"about_ca_system_score_gemma":0.0007387717,"threshold_uncertainty_score":0.022307277},"labels":[],"label_agreement":null},{"id":"W2402778774","doi":"","title":"The smallest realization of a given vector.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Realization (probability); Mathematics; Pure mathematics; Statistics","score_opus":0.01296705521771443,"score_gpt":0.2043762451340071,"score_spread":0.19140918991629266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402778774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28829622,0.0016214666,0.42859054,0.0040029893,0.0018920256,0.00031073843,0.010813665,0.0017093017,0.26276308],"genre_scores_gemma":[0.83356506,0.001232093,0.10138532,0.0005601979,0.0005139687,0.00026579638,0.007529935,0.0006250285,0.054322563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923193,0.00011817609,0.000053261818,0.00022216227,0.00015897235,0.00021544372],"domain_scores_gemma":[0.99927133,0.00020063193,0.000093528266,0.00017586391,0.00014692817,0.00011180404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024589876,0.00060431357,0.00056507555,0.0011166417,0.0011810407,0.0025868188,0.0007383487,0.0010949846,0.019664934],"category_scores_gemma":[0.0018921142,0.00022106875,0.0005231876,0.0008067541,0.0010914822,0.002109963,0.0012106576,0.0015116278,0.0055741603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026894704,0.00008792892,0.0008789593,0.0002828482,0.000039376257,0.00032256581,0.00032978802,0.0018980134,0.02234134,0.91531783,0.014198968,0.044033423],"study_design_scores_gemma":[0.000055824174,0.00013643035,0.0016422127,0.00016490498,0.00004978856,0.0008038716,0.0004892128,0.009497938,0.013946885,0.9024733,0.07067116,0.00006860888],"about_ca_topic_score_codex":0.0008284612,"about_ca_topic_score_gemma":0.0009235347,"teacher_disagreement_score":0.019664934,"about_ca_system_score_codex":0.0005873,"about_ca_system_score_gemma":0.0008630333,"threshold_uncertainty_score":0.065785766},"labels":[],"label_agreement":null},{"id":"W2402800665","doi":"","title":"Edge-Coloring of Split Graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Edge coloring; Enhanced Data Rates for GSM Evolution; Combinatorics; Graph coloring; Graph; Computer science; Artificial intelligence; Line graph","score_opus":0.027047543567736636,"score_gpt":0.24017174978544226,"score_spread":0.21312420621770561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402800665","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4107479,0.0033342966,0.40934637,0.0049415994,0.00064859533,0.00018317305,0.003112257,0.0010905958,0.16659531],"genre_scores_gemma":[0.86498386,0.0013276212,0.09671799,0.00076856755,0.00028310055,0.00015114975,0.0026115838,0.00035310132,0.032802936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929833,0.0002358438,0.00003236323,0.00014874568,0.00012286723,0.00016185535],"domain_scores_gemma":[0.99688065,0.001660958,0.00026784922,0.00056840206,0.00025131242,0.00037082762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080343604,0.00053310866,0.0006412013,0.0011194684,0.0013589659,0.0025131747,0.0013167765,0.0010445825,0.011341785],"category_scores_gemma":[0.004209285,0.0005012192,0.0005615403,0.0014975793,0.0015281666,0.004729161,0.0018220684,0.0019406409,0.0015470454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017984492,0.0000991018,0.001570689,0.0001832833,0.000032993365,0.0000966764,0.0002583479,0.011390465,0.0022842302,0.92832106,0.019557457,0.03602575],"study_design_scores_gemma":[0.000028910292,0.000018960287,0.0005833708,0.00003584474,0.000018205172,0.00014275801,0.00020812236,0.030161815,0.0012678866,0.9580092,0.009514571,0.000010471593],"about_ca_topic_score_codex":0.001593249,"about_ca_topic_score_gemma":0.002689553,"teacher_disagreement_score":0.011341785,"about_ca_system_score_codex":0.0014698915,"about_ca_system_score_gemma":0.0007602322,"threshold_uncertainty_score":0.037942052},"labels":[],"label_agreement":null},{"id":"W2402805981","doi":"","title":"On the Rank Polynomial and Whitney Numbers of Order Ideals of a Garland.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Rank (graph theory); Order (exchange); Polynomial; Pure mathematics; Combinatorics; Mathematical analysis","score_opus":0.006687131847941576,"score_gpt":0.22097082518114647,"score_spread":0.2142836933332049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402805981","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61049694,0.0047599324,0.09641504,0.005654746,0.0009266807,0.00006911096,0.0010686872,0.00043229878,0.28017655],"genre_scores_gemma":[0.9692693,0.0010169188,0.008013758,0.00021754691,0.00053213397,0.000029004179,0.00027578144,0.00008097527,0.020564623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990608,0.00022311824,0.000042501193,0.00013625671,0.00028503532,0.00025232654],"domain_scores_gemma":[0.9963313,0.002044249,0.00046273204,0.00028400973,0.00033803625,0.00053974014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014174823,0.0006362194,0.0008574892,0.0026274421,0.0020122852,0.0035921123,0.00077806896,0.0007110579,0.011360294],"category_scores_gemma":[0.0068111955,0.00041380338,0.00052873004,0.0020890804,0.005443902,0.009570002,0.0023049705,0.0024153213,0.0011760438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006627609,0.000018527355,0.00044192933,0.000032354834,0.0000054043903,0.00005019652,0.00017980093,0.0010157882,0.0003507122,0.9908241,0.0017314554,0.0052834265],"study_design_scores_gemma":[0.000008308606,0.000014307273,0.000418676,0.000014027843,0.000005686927,0.000072305585,0.00009619396,0.0026797375,0.00031901838,0.99400866,0.0023503455,0.000012721972],"about_ca_topic_score_codex":0.0026537913,"about_ca_topic_score_gemma":0.003764904,"teacher_disagreement_score":0.011360294,"about_ca_system_score_codex":0.0017897997,"about_ca_system_score_gemma":0.0009108845,"threshold_uncertainty_score":0.03800392},"labels":[],"label_agreement":null},{"id":"W2402809063","doi":"","title":"Cyclic and Negacyclic codes of length 2 m over finite fields.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.017466509688733475,"score_gpt":0.2408639349457849,"score_spread":0.22339742525705142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402809063","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70435786,0.004639206,0.07894668,0.00535137,0.00068580185,0.00014072309,0.0017400857,0.00043210865,0.20370607],"genre_scores_gemma":[0.9740074,0.00061667856,0.00720707,0.00034608174,0.0003397446,0.00006115106,0.00038631042,0.000040048115,0.01699552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989367,0.00028017227,0.000059241276,0.00016341839,0.00029963764,0.0002609486],"domain_scores_gemma":[0.99476385,0.0028352588,0.00080092094,0.0007898879,0.00044057856,0.00036955017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007877537,0.0004162228,0.00050078606,0.0012144048,0.001229356,0.0017133378,0.0006032978,0.0010987697,0.006368399],"category_scores_gemma":[0.006569479,0.0003418175,0.00032948016,0.0010740351,0.0021649327,0.0021460513,0.0016858034,0.0013744556,0.00081217114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003291037,0.00007854171,0.0016943932,0.00010327263,0.00001525481,0.0006033858,0.00039132524,0.0061381403,0.0037385253,0.96357507,0.0064883544,0.016844628],"study_design_scores_gemma":[0.00007913768,0.00011012282,0.0016522937,0.000102364604,0.000019556834,0.00087737426,0.00020037468,0.02232593,0.003616959,0.95484596,0.016122123,0.0000478896],"about_ca_topic_score_codex":0.0012282904,"about_ca_topic_score_gemma":0.0018268027,"teacher_disagreement_score":0.006368399,"about_ca_system_score_codex":0.0011712963,"about_ca_system_score_gemma":0.0016479329,"threshold_uncertainty_score":0.021304429},"labels":[],"label_agreement":null},{"id":"W2402834344","doi":"","title":"Notes on the Support of t-Designs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.030698727157710326,"score_gpt":0.2524227132149179,"score_spread":0.22172398605720756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402834344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060513574,0.007704936,0.6686362,0.012015163,0.0021391795,0.000093783936,0.00076530175,0.0012604109,0.30133373],"genre_scores_gemma":[0.33675972,0.022528103,0.47674468,0.0095019685,0.0042171525,0.0007703975,0.0016892516,0.0011340926,0.14665462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978048,0.0007369762,0.00019806845,0.00042070946,0.0006765796,0.00016281872],"domain_scores_gemma":[0.99171853,0.005631763,0.00027087092,0.0014914236,0.0006409873,0.00024643258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034316466,0.0012134821,0.0009861308,0.0014369909,0.0012838385,0.002936814,0.0015864393,0.0017377944,0.032732505],"category_scores_gemma":[0.011628422,0.0006982922,0.0019020096,0.002744342,0.0036423237,0.0071862997,0.0027678788,0.0059695677,0.00740163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027141195,0.000024383053,0.00007462573,0.00016493248,0.000016009948,0.00008081549,0.00010924725,0.0011125284,0.00037380322,0.96030116,0.014054935,0.023660375],"study_design_scores_gemma":[0.000018791823,0.000023498425,0.00009232201,0.000060002934,0.000012343644,0.00015750562,0.00002468876,0.0027008466,0.0004809766,0.9446065,0.051807787,0.000014616062],"about_ca_topic_score_codex":0.0021564132,"about_ca_topic_score_gemma":0.0021794694,"teacher_disagreement_score":0.032732505,"about_ca_system_score_codex":0.0019362597,"about_ca_system_score_gemma":0.0012601195,"threshold_uncertainty_score":0.10950118},"labels":[],"label_agreement":null},{"id":"W2402854332","doi":"","title":"On extremal cacti with minimal degree distance","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Meromorphic and Entire Functions","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Combinatorics; Physics","score_opus":0.04934585781021096,"score_gpt":0.2556902412825882,"score_spread":0.20634438347237727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402854332","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6538593,0.0035376684,0.08868486,0.0044926703,0.00090664334,0.00009131805,0.000509092,0.0005193804,0.247399],"genre_scores_gemma":[0.9455263,0.001621267,0.012081562,0.00043954863,0.0009557001,0.00008057535,0.00035438823,0.00017617075,0.038764518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988846,0.00020962542,0.000049437327,0.00024829307,0.0003528682,0.0002552675],"domain_scores_gemma":[0.99787617,0.00096630194,0.0002860101,0.00020401797,0.0001962802,0.00047122547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011391357,0.001745452,0.0018283126,0.0061259186,0.0041123247,0.004515317,0.002131012,0.0020983755,0.009625913],"category_scores_gemma":[0.0053620115,0.0009022438,0.0010074438,0.0032251673,0.0057956646,0.0060664024,0.004462288,0.0045896657,0.0010599046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038804934,0.000019414747,0.00033292957,0.000039308547,0.000007645044,0.00010855043,0.00033436442,0.000853807,0.00044283274,0.99301904,0.0007881081,0.004015099],"study_design_scores_gemma":[0.000017215045,0.000015258232,0.00047203834,0.000023766348,0.000016643564,0.00015784439,0.00012016944,0.003171495,0.0002702619,0.99297696,0.0027398567,0.000018543773],"about_ca_topic_score_codex":0.001966289,"about_ca_topic_score_gemma":0.0022466113,"teacher_disagreement_score":0.009625913,"about_ca_system_score_codex":0.0032620912,"about_ca_system_score_gemma":0.00059728953,"threshold_uncertainty_score":0.032201886},"labels":[],"label_agreement":null},{"id":"W2402855873","doi":"","title":"Critical Sets in F-squares.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.01530497556825815,"score_gpt":0.2428644408379148,"score_spread":0.22755946526965665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402855873","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19717865,0.005616085,0.40941054,0.004058482,0.0010110172,0.00012844012,0.0005415148,0.0004480953,0.38160717],"genre_scores_gemma":[0.90378845,0.0014156206,0.04382584,0.00076776335,0.0005567226,0.00013430508,0.00028429076,0.0001410039,0.049086038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933654,0.00021765484,0.00002921185,0.00013268317,0.00017562583,0.00010835969],"domain_scores_gemma":[0.9970066,0.0019820675,0.00021117336,0.00022372375,0.0003469567,0.00022952663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062480784,0.00046665364,0.0005475299,0.002371614,0.0017898286,0.0021692272,0.0005683253,0.0010519816,0.013182255],"category_scores_gemma":[0.0056948373,0.0004245358,0.00045816417,0.0010165825,0.0024967052,0.0029816676,0.0014638075,0.0018548559,0.0014433531],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013345048,0.000006271733,0.000118408,0.00002659044,0.0000038452645,0.00004958428,0.00008995232,0.0010700466,0.00033956394,0.99104345,0.0023681838,0.0048706783],"study_design_scores_gemma":[0.0000064801798,0.000007900919,0.0001326973,0.000019562345,0.0000033025062,0.00010216375,0.00007438215,0.005042132,0.0004006676,0.98821753,0.005986926,0.0000062862946],"about_ca_topic_score_codex":0.001388645,"about_ca_topic_score_gemma":0.0019064876,"teacher_disagreement_score":0.013182255,"about_ca_system_score_codex":0.0012737432,"about_ca_system_score_gemma":0.0005764592,"threshold_uncertainty_score":0.044099033},"labels":[],"label_agreement":null},{"id":"W2402862338","doi":"","title":"Endomorphism monoids of generalized split graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Endomorphism; Pure mathematics; Combinatorics; Algebra over a field","score_opus":0.008809712647425761,"score_gpt":0.20874445760834834,"score_spread":0.1999347449609226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402862338","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47373486,0.0029475824,0.30824664,0.0020387694,0.00087488536,0.00015431271,0.0014239863,0.0011553549,0.20942357],"genre_scores_gemma":[0.9293207,0.00055472605,0.030980468,0.00049057923,0.0002239922,0.000110044144,0.00056599785,0.00014811971,0.037605353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993894,0.00014059279,0.000053858017,0.00015917918,0.00016333038,0.00009357161],"domain_scores_gemma":[0.99879175,0.00042134314,0.00014772885,0.00023298664,0.0002189256,0.00018724949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006035051,0.00034660767,0.00039419308,0.0012950031,0.001162215,0.0023058436,0.0005861829,0.0005701475,0.006403117],"category_scores_gemma":[0.001301486,0.00034235057,0.00062750676,0.0006855897,0.0018771216,0.004065633,0.00196903,0.0011999352,0.0012563086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035044104,0.000018756647,0.00028641458,0.000026984497,0.000007937491,0.00015681388,0.00034081456,0.00024197619,0.0018605352,0.98864985,0.0010889303,0.0072858147],"study_design_scores_gemma":[0.000014906234,0.00002406957,0.00045345968,0.000022290562,0.000015518726,0.000349975,0.00026815658,0.0018951523,0.0017448582,0.98084015,0.014358152,0.0000133771755],"about_ca_topic_score_codex":0.0004856574,"about_ca_topic_score_gemma":0.0006975855,"teacher_disagreement_score":0.006403117,"about_ca_system_score_codex":0.00077742373,"about_ca_system_score_gemma":0.0005015774,"threshold_uncertainty_score":0.021420538},"labels":[],"label_agreement":null},{"id":"W2402867239","doi":"","title":"On the number of subpermutations with fixed orbit size","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Geometry","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Orbit (dynamics); Aerospace engineering","score_opus":0.014555541477956744,"score_gpt":0.27332245888487944,"score_spread":0.2587669174069227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402867239","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85565674,0.001569452,0.078893326,0.0065267887,0.0005283682,0.0001298603,0.0016682115,0.0014042204,0.053622987],"genre_scores_gemma":[0.97882724,0.0005484408,0.012295357,0.00037849942,0.00044091957,0.00014391818,0.00073615625,0.00042937626,0.0062001245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944587,0.0014751368,0.00035014653,0.0012610999,0.0012675283,0.0011874146],"domain_scores_gemma":[0.9123072,0.06817048,0.004161344,0.008780577,0.002239911,0.004340535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059091724,0.0010870431,0.0029383851,0.0038952073,0.0047165356,0.00683479,0.0059476877,0.004820245,0.018254342],"category_scores_gemma":[0.047295865,0.0014614809,0.0023828573,0.002651478,0.00823549,0.015799591,0.0045159943,0.0056890487,0.0011958076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021325606,0.00028228055,0.009676316,0.0006680068,0.00025686156,0.0005894866,0.0008020168,0.030906547,0.008323168,0.9068053,0.01018784,0.02936977],"study_design_scores_gemma":[0.00018049068,0.00012618882,0.0024986023,0.00011049358,0.00021873995,0.00082529156,0.0002657792,0.08409471,0.004621912,0.9051665,0.0017963783,0.000095020696],"about_ca_topic_score_codex":0.0007040919,"about_ca_topic_score_gemma":0.00097040215,"teacher_disagreement_score":0.018254342,"about_ca_system_score_codex":0.00254419,"about_ca_system_score_gemma":0.0023136167,"threshold_uncertainty_score":0.061066866},"labels":[],"label_agreement":null},{"id":"W2402876546","doi":"","title":"Paths in the Square Unit Lattice.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Square (algebra); Square lattice; Unit (ring theory); Lattice (music); Unit square; Combinatorics; Statistical physics; Geometry; Physics; Mathematics education","score_opus":0.02329165036726255,"score_gpt":0.28435407931640216,"score_spread":0.2610624289491396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402876546","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33733436,0.0026685086,0.18797721,0.0034918177,0.0014844429,0.00017790234,0.0023014778,0.001142513,0.4634218],"genre_scores_gemma":[0.8040948,0.0015460761,0.09509103,0.0008988474,0.00032246864,0.0001838868,0.0015838786,0.00036516797,0.09591382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994407,0.00017106216,0.000026698997,0.000107234955,0.0001438832,0.00011036907],"domain_scores_gemma":[0.9991177,0.00034365946,0.00011958931,0.00009181052,0.00014336697,0.00018385278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027510413,0.00035474738,0.00038983513,0.0009904323,0.001577546,0.0022667442,0.0006865803,0.0006633204,0.020625617],"category_scores_gemma":[0.0021093464,0.00031602872,0.00039118427,0.0012739482,0.0014152365,0.0025913317,0.0014650634,0.0014779979,0.004659524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012719876,0.000031375905,0.00028722914,0.000093550545,0.000011523721,0.00019614937,0.00020945707,0.0014089943,0.0011906942,0.9682968,0.00736308,0.020784015],"study_design_scores_gemma":[0.000038450322,0.000023248063,0.00019504223,0.000024772608,0.0000072100033,0.00018240543,0.00021130544,0.004385708,0.00081366394,0.975662,0.018444495,0.000011791742],"about_ca_topic_score_codex":0.0022123284,"about_ca_topic_score_gemma":0.0031278357,"teacher_disagreement_score":0.020625617,"about_ca_system_score_codex":0.0006715373,"about_ca_system_score_gemma":0.0007694102,"threshold_uncertainty_score":0.06899959},"labels":[],"label_agreement":null},{"id":"W2402909918","doi":"","title":"The diameter and the chromatic number of almost self-complementary graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics","score_opus":0.009039655011315144,"score_gpt":0.26160114102053666,"score_spread":0.2525614860092215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402909918","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8447629,0.004004272,0.047385745,0.0035608823,0.0004131367,0.000039246283,0.001141696,0.00022784722,0.09846423],"genre_scores_gemma":[0.98806494,0.0010573703,0.005069705,0.00013250498,0.00032788696,0.000043097974,0.00026003158,0.000060899492,0.0049835183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947566,0.00015272714,0.000018992096,0.0001406924,0.0001092285,0.00010271467],"domain_scores_gemma":[0.991338,0.0058072554,0.0010929632,0.00045608412,0.00037456217,0.00093100534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008034112,0.00043590824,0.0005085929,0.0022959274,0.0011630306,0.0022420113,0.0012903915,0.0009138989,0.0052980892],"category_scores_gemma":[0.008067698,0.00049648486,0.00034799962,0.0012716146,0.0029557422,0.003908358,0.001608167,0.0011715501,0.0005528885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040281852,0.00006200896,0.0047344747,0.00015047837,0.00004991444,0.00017283243,0.0004921225,0.012765515,0.0067186607,0.9498042,0.009535669,0.01511128],"study_design_scores_gemma":[0.000052900374,0.000047862293,0.004974922,0.00006565275,0.00004920156,0.00060572,0.0003359658,0.043937817,0.0028856609,0.9395055,0.0075013633,0.00003750207],"about_ca_topic_score_codex":0.0011396436,"about_ca_topic_score_gemma":0.0013294176,"teacher_disagreement_score":0.0052980892,"about_ca_system_score_codex":0.0014498967,"about_ca_system_score_gemma":0.00048999046,"threshold_uncertainty_score":0.017723858},"labels":[],"label_agreement":null},{"id":"W2402911904","doi":"","title":"Some basic properties of a class of total transformation digraphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Transformation (genetics); Class (philosophy); Pure mathematics; Algebra over a field; Computer science; Chemistry; Artificial intelligence","score_opus":0.0150144772365516,"score_gpt":0.23880884342100983,"score_spread":0.22379436618445822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402911904","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25923708,0.0010116507,0.23745207,0.0019701035,0.0003214459,0.00028809748,0.0049319738,0.0012155991,0.49357197],"genre_scores_gemma":[0.9150485,0.0010345293,0.03367512,0.00065991073,0.00024512867,0.00019484294,0.0037629155,0.00023159082,0.045147542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996593,0.00004905461,0.000027666394,0.00011369842,0.000083117804,0.000067289024],"domain_scores_gemma":[0.9986142,0.0006215772,0.0001390152,0.00022612195,0.00021247925,0.00018651744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035836166,0.0003279665,0.00036975878,0.0016798897,0.0017142401,0.0031383724,0.0007058655,0.0008511879,0.018029576],"category_scores_gemma":[0.0018844411,0.00034102364,0.0006804684,0.0019593085,0.0012805478,0.0030615022,0.0010295847,0.0012355231,0.0016736367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019041872,0.000029983363,0.0005118769,0.00006452684,0.000012555387,0.0001764997,0.00022254298,0.0006379193,0.0009740758,0.9791291,0.003761415,0.014460448],"study_design_scores_gemma":[0.000019214698,0.000022755281,0.00072643947,0.00002465558,0.000019809613,0.00059561786,0.00017246323,0.0042297943,0.0007225289,0.97125477,0.022199737,0.000012182464],"about_ca_topic_score_codex":0.0013172715,"about_ca_topic_score_gemma":0.0019102097,"teacher_disagreement_score":0.018029576,"about_ca_system_score_codex":0.0008339893,"about_ca_system_score_gemma":0.000536419,"threshold_uncertainty_score":0.060314894},"labels":[],"label_agreement":null},{"id":"W2402912519","doi":"","title":"Dual Helly-Type Theorems For Unions Of Sets Starshaped Via Staircase Paths.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dual (grammatical number); Type (biology); Combinatorics; Discrete mathematics; Linguistics","score_opus":0.011388452935265074,"score_gpt":0.22248788142018214,"score_spread":0.21109942848491706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402912519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12979507,0.0021912754,0.6385971,0.004093671,0.0006644719,0.00018697676,0.0014603089,0.00057468575,0.22243646],"genre_scores_gemma":[0.76346546,0.0020594995,0.14351337,0.0019066841,0.00089012086,0.00039787454,0.0018216624,0.00057979027,0.08536553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99771464,0.00060187903,0.00012540328,0.00042831275,0.0007685364,0.00036123832],"domain_scores_gemma":[0.99154574,0.0058990195,0.00045263354,0.00087399717,0.0006424271,0.0005861866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002606167,0.0008448103,0.0011397684,0.0025975509,0.003222063,0.0056714406,0.0024255395,0.0018421488,0.019267779],"category_scores_gemma":[0.011185133,0.0011743578,0.0018266845,0.0025719674,0.003663914,0.014728088,0.006080925,0.006138834,0.0020575046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057040852,0.00002995634,0.00021539438,0.00006592472,0.000016180049,0.00005084842,0.00015617386,0.0013855417,0.00030479883,0.99050015,0.0027864254,0.0044315164],"study_design_scores_gemma":[0.000020618407,0.000015372325,0.00017514902,0.000028062246,0.000025747533,0.000118866155,0.000119841396,0.0061352155,0.0008523323,0.98761797,0.0048790416,0.000011741831],"about_ca_topic_score_codex":0.0012215595,"about_ca_topic_score_gemma":0.0015272734,"teacher_disagreement_score":0.019267779,"about_ca_system_score_codex":0.0029953383,"about_ca_system_score_gemma":0.0010637972,"threshold_uncertainty_score":0.06445712},"labels":[],"label_agreement":null},{"id":"W2402921037","doi":"","title":"On the number of genus embeddings of complete tripartite graph K n, n, l .","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Genus; Combinatorics; Graph; Zoology; Biology","score_opus":0.021815839223283128,"score_gpt":0.2515426423579493,"score_spread":0.2297268031346662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402921037","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85437095,0.0032311615,0.053616136,0.009492425,0.0006106277,0.00010961846,0.0040368475,0.0006769902,0.07385526],"genre_scores_gemma":[0.9639585,0.0010801738,0.020663908,0.0006047204,0.0004678926,0.00021068964,0.002439395,0.00027067206,0.010304004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978466,0.0006926605,0.00012400813,0.0005539094,0.00039546104,0.00038729986],"domain_scores_gemma":[0.9790426,0.014574389,0.0020886147,0.0015349564,0.0008476078,0.0019118441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018398084,0.0010020866,0.0013815443,0.002864518,0.0026977935,0.006719899,0.0030194174,0.0025582267,0.012798757],"category_scores_gemma":[0.01971276,0.0008978769,0.00086335116,0.0022382725,0.003733726,0.008983492,0.0031240124,0.0024703331,0.001312942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019202547,0.00033271915,0.020643566,0.0011203813,0.00025551682,0.00041942357,0.0016081148,0.04093507,0.008163846,0.7988879,0.053271808,0.07244144],"study_design_scores_gemma":[0.00018804314,0.00019033812,0.008062272,0.00020395446,0.0001909104,0.0009475569,0.0011319232,0.107581645,0.0037675041,0.86370397,0.013931519,0.00010034362],"about_ca_topic_score_codex":0.0012327642,"about_ca_topic_score_gemma":0.0018469178,"teacher_disagreement_score":0.012798757,"about_ca_system_score_codex":0.0027055435,"about_ca_system_score_gemma":0.0010959613,"threshold_uncertainty_score":0.042816103},"labels":[],"label_agreement":null},{"id":"W2402925056","doi":"","title":"Finite 2-Geodesic Transitive Graphs Of Valency 3p.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Valency; Mathematics; Transitive relation; Geodesic; Combinatorics; Pure mathematics; Geometry; Linguistics","score_opus":0.02335203755501963,"score_gpt":0.24542960700807456,"score_spread":0.22207756945305493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402925056","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43315795,0.00068050576,0.32866344,0.0011112416,0.00031625928,0.00016795442,0.0022504663,0.0011011738,0.23255095],"genre_scores_gemma":[0.90605074,0.00024917995,0.05267808,0.00019777473,0.000055905126,0.00009187788,0.0016287577,0.00034164358,0.038706068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996711,0.00006602879,0.000019823907,0.00006776114,0.0001149023,0.000060417573],"domain_scores_gemma":[0.9991536,0.00034585662,0.00011663387,0.00015143605,0.00011814136,0.00011432562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024314821,0.00043734757,0.00034252083,0.0011733801,0.0010085857,0.0015114645,0.0008622138,0.00076739077,0.013475583],"category_scores_gemma":[0.0017354204,0.00032376195,0.0005454245,0.000700027,0.0011068438,0.0017282664,0.0014625221,0.0009593793,0.0018378105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006831137,0.000021885367,0.00051499926,0.00007514818,0.000012955923,0.00035133233,0.00025235076,0.0041773207,0.00440398,0.97004175,0.0044272756,0.015652714],"study_design_scores_gemma":[0.000022707536,0.000026188058,0.0007057925,0.000043819702,0.000013717225,0.0004645071,0.00024688308,0.017845582,0.004269943,0.9562201,0.020120548,0.000020221514],"about_ca_topic_score_codex":0.0010848633,"about_ca_topic_score_gemma":0.0018949232,"teacher_disagreement_score":0.013475583,"about_ca_system_score_codex":0.00070894475,"about_ca_system_score_gemma":0.00036078726,"threshold_uncertainty_score":0.045080364},"labels":[],"label_agreement":null},{"id":"W2402929509","doi":"","title":"Direct Sum, Direct Product and Lexicographic Product of Lattices.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Lexicographical order; Mathematics; Direct product; Product (mathematics); Pure mathematics; Combinatorics; Geometry","score_opus":0.022893666161611287,"score_gpt":0.23203053641903418,"score_spread":0.2091368702574229,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402929509","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12800346,0.037009027,0.40068182,0.004009369,0.002108583,0.00012464105,0.0020616408,0.0010656565,0.42493588],"genre_scores_gemma":[0.73349303,0.011299964,0.1446723,0.0012760859,0.0020549053,0.00019023415,0.0017448055,0.00040625222,0.10486237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984238,0.0004284515,0.00016515188,0.0003200515,0.0005037014,0.00015877928],"domain_scores_gemma":[0.99820745,0.0008020671,0.00022972685,0.0002686942,0.0002653967,0.0002267047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012152791,0.0007545491,0.0009669266,0.0026034305,0.0018689192,0.0053096632,0.00094277086,0.0008508202,0.009239859],"category_scores_gemma":[0.0049779057,0.0006661078,0.00083780935,0.0032402494,0.0049609644,0.010019765,0.0033323572,0.002345875,0.002967879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037601258,0.00001895234,0.00022883997,0.00007614709,0.00001064992,0.000083726416,0.00021840143,0.0003393131,0.00031543974,0.98003346,0.0032764855,0.01536104],"study_design_scores_gemma":[0.000005965452,0.000013794952,0.0001259088,0.00001822327,0.000009268014,0.00031104058,0.00010419746,0.0010538937,0.00039447664,0.9864985,0.011452872,0.00001194758],"about_ca_topic_score_codex":0.0009736773,"about_ca_topic_score_gemma":0.0016092652,"teacher_disagreement_score":0.009239859,"about_ca_system_score_codex":0.0010973681,"about_ca_system_score_gemma":0.00085508224,"threshold_uncertainty_score":0.030910373},"labels":[],"label_agreement":null},{"id":"W2402934917","doi":"","title":"On the Independence Number of Edge Chromatic Critical Graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chromatic scale; Mathematics; Independence (probability theory); Enhanced Data Rates for GSM Evolution; Independence number; Critical graph; Combinatorics; Graph; Computer science; Statistics; Artificial intelligence; Line graph","score_opus":0.032152945611647936,"score_gpt":0.30465624579117373,"score_spread":0.2725033001795258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402934917","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61537814,0.0024046828,0.09928331,0.0046260874,0.0005337874,0.00011372135,0.0018462238,0.0004067757,0.27540737],"genre_scores_gemma":[0.9780312,0.00082983164,0.0088929515,0.00027072764,0.00046105625,0.00008447114,0.0007540435,0.00013781652,0.010537949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929535,0.00020352306,0.000022762948,0.00014509365,0.00018318115,0.00015004975],"domain_scores_gemma":[0.9874537,0.009012397,0.0010299992,0.0005893729,0.0006479647,0.0012665068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011140986,0.0006106476,0.00064760004,0.0038562992,0.0017391541,0.0020245383,0.001340549,0.0010140308,0.013504254],"category_scores_gemma":[0.011750729,0.0006081785,0.00038677477,0.0020413082,0.0028806413,0.00443168,0.0014421449,0.0025686633,0.0010034154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033849463,0.000094448005,0.004409715,0.00018719568,0.00004471149,0.00012758831,0.00031282505,0.01000066,0.0038340152,0.94523627,0.015717724,0.019696318],"study_design_scores_gemma":[0.000059041806,0.000041170057,0.0048959334,0.000058630187,0.00004472459,0.00029217376,0.00016046548,0.037567765,0.0024013284,0.9475027,0.006944645,0.000031516454],"about_ca_topic_score_codex":0.0015706276,"about_ca_topic_score_gemma":0.0021995858,"teacher_disagreement_score":0.013504254,"about_ca_system_score_codex":0.0017457089,"about_ca_system_score_gemma":0.0006590437,"threshold_uncertainty_score":0.045176268},"labels":[],"label_agreement":null},{"id":"W2402942974","doi":"","title":"Spanning trees whose stems have a few leaves.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spanning tree; Combinatorics; Horticulture; Biology","score_opus":0.02038433947615764,"score_gpt":0.28091679411747006,"score_spread":0.2605324546413124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402942974","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4308014,0.003857896,0.37972155,0.003509336,0.0007244411,0.00020742526,0.00660454,0.0026915069,0.17188181],"genre_scores_gemma":[0.7861746,0.0019166962,0.15443173,0.0012510093,0.00039290282,0.00013988875,0.0069428827,0.00037715703,0.04837309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997255,0.000051654784,0.000030201774,0.00008434652,0.000051197014,0.000057073667],"domain_scores_gemma":[0.9981889,0.0007042582,0.00022650146,0.00038116032,0.00027531714,0.00022390427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027643054,0.00035797714,0.0005017768,0.0007254221,0.0014196944,0.0011385368,0.00067781087,0.0010382966,0.011039368],"category_scores_gemma":[0.0028265521,0.00035635827,0.00045831923,0.0011628894,0.00052364665,0.0028760429,0.0011793037,0.0008525991,0.005628381],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030834833,0.0002457861,0.0065094708,0.0007110538,0.00012404741,0.0032196813,0.0013747286,0.0032431965,0.06495025,0.7005813,0.03176199,0.18697014],"study_design_scores_gemma":[0.000031070118,0.00009679204,0.0033350054,0.00016759866,0.00009713021,0.0050306055,0.00067376054,0.0094005065,0.011104558,0.8852035,0.08482468,0.000034809367],"about_ca_topic_score_codex":0.00030898667,"about_ca_topic_score_gemma":0.0009459664,"teacher_disagreement_score":0.011039368,"about_ca_system_score_codex":0.0002860506,"about_ca_system_score_gemma":0.000328335,"threshold_uncertainty_score":0.036930382},"labels":[],"label_agreement":null},{"id":"W2402960228","doi":"","title":"On the Maximum Number of Disjoint Chorded Cycles in Graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Disjoint sets; Combinatorics","score_opus":0.028278054149201388,"score_gpt":0.2801251987870706,"score_spread":0.2518471446378692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402960228","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54860455,0.02301891,0.23666944,0.01430756,0.0021358605,0.0003102296,0.0046019857,0.00085112907,0.1695003],"genre_scores_gemma":[0.92635936,0.007311271,0.05056806,0.0007871868,0.0018879658,0.0003261901,0.0014630499,0.00036760923,0.010929476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99786794,0.0006827498,0.0001603428,0.00050173263,0.0004332308,0.0003539326],"domain_scores_gemma":[0.96719813,0.026306026,0.001881754,0.0015754749,0.0012250794,0.0018134712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025657194,0.0011621515,0.0016205913,0.003935811,0.002079851,0.0041513084,0.0035431753,0.002532536,0.011632434],"category_scores_gemma":[0.032676447,0.0011644651,0.0008191711,0.003211445,0.0041583935,0.01165919,0.003250609,0.00279261,0.0013297024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010993523,0.00015706258,0.005869347,0.0014222716,0.00023694377,0.00037992815,0.00077808835,0.041839182,0.006381767,0.8345916,0.022822376,0.08442203],"study_design_scores_gemma":[0.00009814878,0.00009537297,0.0014772972,0.00019138743,0.0000903421,0.00050928054,0.00035162797,0.0344214,0.0019271005,0.9519116,0.008883917,0.00004256099],"about_ca_topic_score_codex":0.0010375669,"about_ca_topic_score_gemma":0.0017719327,"teacher_disagreement_score":0.011632434,"about_ca_system_score_codex":0.0022316745,"about_ca_system_score_gemma":0.0008524379,"threshold_uncertainty_score":0.038914382},"labels":[],"label_agreement":null},{"id":"W2402967678","doi":"","title":"Complete Arcs In Moulton Planes Of Odd Order.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Order (exchange); Geometry; Combinatorics; Pure mathematics; Business","score_opus":0.017923349833763303,"score_gpt":0.19105474725886565,"score_spread":0.17313139742510233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402967678","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5540524,0.0016559105,0.14315248,0.0014981093,0.00036591644,0.000089160174,0.0010867828,0.00038654028,0.2977127],"genre_scores_gemma":[0.91844136,0.00067985913,0.023292463,0.00027240193,0.000095161566,0.000055374112,0.0006226286,0.00012714269,0.0564136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965584,0.000088376684,0.000015390451,0.00005933562,0.00007543077,0.00010560643],"domain_scores_gemma":[0.9990771,0.0004321492,0.00016449904,0.00009552524,0.00010569668,0.00012508212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002343871,0.00038753988,0.0002918438,0.0015842853,0.0014252308,0.0020790088,0.00045117922,0.00081441866,0.0134810535],"category_scores_gemma":[0.0016276328,0.00029075984,0.00028555605,0.00097519526,0.0012281442,0.0025489111,0.0011542069,0.0011963369,0.0014279962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012604066,0.000025258885,0.0007661456,0.000055579963,0.000012172094,0.00023616785,0.00024738334,0.002256095,0.0019107381,0.9751222,0.0035518634,0.015690273],"study_design_scores_gemma":[0.000027277938,0.000024912566,0.00090883946,0.000045725275,0.000012360673,0.00028235707,0.0003757195,0.0072548543,0.0026533292,0.96777904,0.02062032,0.000015314106],"about_ca_topic_score_codex":0.0017118711,"about_ca_topic_score_gemma":0.003119169,"teacher_disagreement_score":0.0134810535,"about_ca_system_score_codex":0.0008282757,"about_ca_system_score_gemma":0.00043738258,"threshold_uncertainty_score":0.045098603},"labels":[],"label_agreement":null},{"id":"W2402992158","doi":"","title":"Decoding of Blockwise-Burst Errors in Row-Cyclic Array Codes.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Decoding methods; Mathematics; Burst error; Algorithm; Arithmetic","score_opus":0.010168663790176925,"score_gpt":0.22999640153959613,"score_spread":0.21982773774941922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402992158","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23320764,0.0018141906,0.7373224,0.0019498044,0.00048395808,0.00012414702,0.00095428835,0.0007962944,0.02334738],"genre_scores_gemma":[0.8971248,0.0012043309,0.0813433,0.0004911571,0.00025918963,0.00014576832,0.0008507425,0.00016427808,0.018416338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845815,0.00057471206,0.00009360236,0.00012811874,0.00049520837,0.0002502348],"domain_scores_gemma":[0.9937475,0.0037258489,0.00074819184,0.00088060106,0.0007376692,0.0001601897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011844649,0.0006247158,0.0007025767,0.000775289,0.0005710685,0.0015980827,0.00075717206,0.0012731319,0.0025309825],"category_scores_gemma":[0.010202677,0.0004192099,0.00030025002,0.0011600013,0.0010768074,0.0020591277,0.0018469002,0.0012027685,0.0011842902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011219524,0.000099007884,0.0030714257,0.00034472306,0.000089058034,0.00067805464,0.0005271379,0.121659,0.029624185,0.73254085,0.008974682,0.10126985],"study_design_scores_gemma":[0.00006841525,0.00012951433,0.00058747275,0.00011313973,0.000028722901,0.0004720841,0.00012830208,0.49800557,0.016026895,0.4801934,0.00419937,0.000047130878],"about_ca_topic_score_codex":0.0009884293,"about_ca_topic_score_gemma":0.0015708429,"teacher_disagreement_score":0.0025309825,"about_ca_system_score_codex":0.00080944184,"about_ca_system_score_gemma":0.0014713395,"threshold_uncertainty_score":0.008467019},"labels":[],"label_agreement":null},{"id":"W2402992720","doi":"","title":"The Sharp Lower Bound of the Least Eigenvalue of a Bicyclic Graph.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Bicyclic molecule; Graph; Combinatorics; Upper and lower bounds; Mathematical analysis; Medicinal chemistry; Chemistry; Physics","score_opus":0.016761976517218325,"score_gpt":0.2709001636376991,"score_spread":0.25413818712048075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402992720","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3114349,0.011543731,0.30584925,0.01687475,0.002587749,0.00012881616,0.0028208618,0.0011289577,0.34763095],"genre_scores_gemma":[0.9435657,0.0028931745,0.026167823,0.0017655793,0.0011730087,0.00019244441,0.00081901933,0.00029326085,0.023129923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988733,0.00025368767,0.00003794261,0.0002702784,0.0003031542,0.0002615921],"domain_scores_gemma":[0.9937309,0.00405176,0.000437589,0.00051241956,0.00055182655,0.0007155581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009208307,0.0012560035,0.0010923799,0.0026560137,0.0013576399,0.0031792421,0.0019784821,0.0020110302,0.015536397],"category_scores_gemma":[0.0131629845,0.00062287314,0.00056325697,0.0015431606,0.0026716932,0.0040243813,0.0027117324,0.00409376,0.0036975911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034029334,0.000067486224,0.00082582654,0.00046521242,0.000053263237,0.00028123552,0.0003210538,0.011240949,0.009988886,0.92717063,0.028533924,0.020711143],"study_design_scores_gemma":[0.000045336616,0.000055252665,0.0008275082,0.00011257953,0.00003975664,0.00039020096,0.00014819301,0.032474514,0.0035439911,0.9539053,0.008408275,0.00004917335],"about_ca_topic_score_codex":0.0009252685,"about_ca_topic_score_gemma":0.001158951,"teacher_disagreement_score":0.015536397,"about_ca_system_score_codex":0.0010302215,"about_ca_system_score_gemma":0.0005843669,"threshold_uncertainty_score":0.051974416},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.021453317542698594,"score_gpt":0.2789878806951229,"score_spread":0.25753456315242435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403011525","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23115219,0.02944772,0.28131053,0.0065831295,0.0043588765,0.0001356076,0.0010992504,0.00066976895,0.445243],"genre_scores_gemma":[0.8977612,0.010424734,0.07278454,0.0017121714,0.0018301482,0.00005223999,0.0004214229,0.00019189274,0.014821657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993175,0.00012266284,0.000045694695,0.0001653825,0.0002519186,0.00009678568],"domain_scores_gemma":[0.99828786,0.0009272819,0.00015893747,0.0002479581,0.00017943165,0.00019846865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006046719,0.0006391293,0.0007456054,0.0023023435,0.0010775251,0.0012361564,0.001200253,0.00077523105,0.005428205],"category_scores_gemma":[0.0031129257,0.00031811203,0.0004939639,0.0020750624,0.0025640994,0.003726988,0.0019227508,0.0025561738,0.00078009424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012456559,0.00004686694,0.0010907594,0.00033007117,0.00003086925,0.00039025012,0.000553339,0.003582482,0.008144785,0.93894,0.009266726,0.03749922],"study_design_scores_gemma":[0.000019928828,0.00011357297,0.0018228581,0.000083431696,0.000030980944,0.0008619264,0.00020866429,0.009240052,0.004311957,0.9370528,0.046145774,0.00010801405],"about_ca_topic_score_codex":0.0011819089,"about_ca_topic_score_gemma":0.0012612771,"teacher_disagreement_score":0.005428205,"about_ca_system_score_codex":0.000789788,"about_ca_system_score_gemma":0.0003731078,"threshold_uncertainty_score":0.018159151},"labels":[],"label_agreement":null},{"id":"W2403014172","doi":"","title":"The Modified Zagreb Indices About Disjunction And Symmetric Difference Of Graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Statistics","score_opus":0.017133518864651084,"score_gpt":0.2640155511588824,"score_spread":0.24688203229423134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403014172","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20720454,0.0044925814,0.2476156,0.003462872,0.0021143083,0.00009514255,0.0014242036,0.0004925353,0.53309816],"genre_scores_gemma":[0.89908403,0.0017599137,0.057203423,0.0010251275,0.0010670223,0.00011698139,0.00071528764,0.00035419234,0.038674023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897003,0.00026015597,0.00006700322,0.00022540576,0.00033194586,0.0001454742],"domain_scores_gemma":[0.99854773,0.00052465824,0.00019941917,0.00029401333,0.00026944486,0.00016469954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011002545,0.0004901149,0.0007714163,0.0025488797,0.0016039518,0.0032197088,0.0013842415,0.0010590471,0.010019869],"category_scores_gemma":[0.004388266,0.00036628547,0.00065848784,0.0020911372,0.0030465443,0.008031888,0.0019317038,0.0035752195,0.0018104988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021617101,0.000005558427,0.000080553305,0.000017436616,0.0000027902652,0.000017896935,0.00008120313,0.00015886842,0.0003073164,0.9919299,0.0010571466,0.006319799],"study_design_scores_gemma":[0.000007920643,0.000009492867,0.00016139467,0.000012162654,0.0000054997845,0.000086329615,0.000049249025,0.0010538768,0.0004111533,0.9921822,0.0060124355,0.000008323925],"about_ca_topic_score_codex":0.001086822,"about_ca_topic_score_gemma":0.0013464174,"teacher_disagreement_score":0.010019869,"about_ca_system_score_codex":0.001430876,"about_ca_system_score_gemma":0.000571891,"threshold_uncertainty_score":0.033519804},"labels":[],"label_agreement":null},{"id":"W2403021968","doi":"","title":"On the structure of graphs with exactly two near-perfect matchings.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.015499850818069281,"score_gpt":0.24958455808302155,"score_spread":0.23408470726495226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403021968","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7221413,0.004089069,0.12804711,0.006224017,0.0004707897,0.0001529715,0.0020792352,0.0006645948,0.13613093],"genre_scores_gemma":[0.9522037,0.0011584912,0.029604316,0.0006808691,0.00027273348,0.00008644302,0.0013479049,0.00012901447,0.014516559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993973,0.00019428399,0.000033475353,0.00013236374,0.000107343454,0.00013521737],"domain_scores_gemma":[0.9959572,0.0018172422,0.0009030074,0.00049988274,0.00031295526,0.00050971186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059354154,0.00043386407,0.0007758544,0.001975086,0.002660443,0.0021695986,0.0015426889,0.0018144075,0.0075429743],"category_scores_gemma":[0.0056185285,0.00061218493,0.0005117379,0.0016604468,0.00230692,0.006100898,0.0020871905,0.0018140621,0.0014411645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019167543,0.000066367975,0.0012839924,0.00013389578,0.000030455156,0.00035904715,0.00057210756,0.004474999,0.0021603748,0.970464,0.0064873984,0.013775648],"study_design_scores_gemma":[0.000023860843,0.00002548189,0.00056156766,0.000038595615,0.000017732245,0.00024029774,0.00023569401,0.007550723,0.00044960645,0.98637486,0.004467157,0.0000143074785],"about_ca_topic_score_codex":0.0009917817,"about_ca_topic_score_gemma":0.0014747258,"teacher_disagreement_score":0.0075429743,"about_ca_system_score_codex":0.0009409725,"about_ca_system_score_gemma":0.00059797,"threshold_uncertainty_score":0.025233746},"labels":[],"label_agreement":null},{"id":"W2403022016","doi":"","title":"On Vertex-Distinguishing Proper Edge Colorings of Graphs Satisfying the Ore Condition","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Vertex (graph theory); Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Graph; Computer science; Artificial intelligence","score_opus":0.011678092786222928,"score_gpt":0.23147951133755115,"score_spread":0.21980141855132823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403022016","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76445156,0.00083492784,0.1716171,0.0031599433,0.00023161592,0.00010910451,0.0013969527,0.00064240705,0.05755638],"genre_scores_gemma":[0.9478782,0.0005986801,0.039419737,0.00076649105,0.00026217016,0.00012050509,0.0016961445,0.000288112,0.008970008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780315,0.00078529026,0.0001363229,0.0004602258,0.000290361,0.0005247029],"domain_scores_gemma":[0.9795116,0.015128912,0.0016963473,0.001774963,0.0006202451,0.0012678207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027092244,0.0012573836,0.0017890239,0.0019337116,0.0025789384,0.004707157,0.0023406234,0.0024860268,0.008031478],"category_scores_gemma":[0.012186806,0.0013770597,0.0015062619,0.0026609378,0.0038936406,0.009068105,0.0041012536,0.0040864064,0.0006745668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008265958,0.00023297094,0.0038845844,0.00026596375,0.000057949088,0.00020738081,0.00063817203,0.019249914,0.004039409,0.94542897,0.0072273137,0.017940855],"study_design_scores_gemma":[0.000095754316,0.000045454137,0.0009640447,0.000034204797,0.00003515024,0.00013996041,0.00023558695,0.034495886,0.0010193865,0.9612957,0.0016109622,0.000027863465],"about_ca_topic_score_codex":0.0016228603,"about_ca_topic_score_gemma":0.0027544128,"teacher_disagreement_score":0.008031478,"about_ca_system_score_codex":0.002260228,"about_ca_system_score_gemma":0.0013085939,"threshold_uncertainty_score":0.026867986},"labels":[],"label_agreement":null},{"id":"W2403023109","doi":"","title":"Tricyclic Graphs With Minimum Modified Schultz Index And Maximum Zagreb Indices.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Tricyclic; Statistics; Combinatorics; Chemistry; Computer science; Stereochemistry; World Wide Web","score_opus":0.0348977643886674,"score_gpt":0.27573520183857586,"score_spread":0.24083743744990846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403023109","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61717415,0.0021561396,0.077051595,0.0015881888,0.00035172745,0.00013912914,0.003384587,0.00069734285,0.2974571],"genre_scores_gemma":[0.9591072,0.0007087098,0.017849933,0.00022278712,0.00010491561,0.00007397719,0.0012295153,0.0001074939,0.0205954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958485,0.00008310265,0.000030092133,0.00008615939,0.000116518524,0.00009914928],"domain_scores_gemma":[0.9985512,0.0004148141,0.00038414577,0.00028244435,0.00020416961,0.00016327074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002593901,0.0003196866,0.00053269643,0.0013288821,0.0009726347,0.0021749288,0.00084993005,0.0007705615,0.011017483],"category_scores_gemma":[0.0028897128,0.00033663734,0.00034400518,0.0015537338,0.00081871066,0.0021516094,0.0012411311,0.0010418652,0.0016969807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026734496,0.000047212954,0.0013892073,0.00017854894,0.00004020523,0.00025062409,0.00025742356,0.0046105245,0.006810408,0.940722,0.009791377,0.035635103],"study_design_scores_gemma":[0.00008571183,0.0000782187,0.0030474563,0.000081133,0.000087589426,0.001037837,0.00040718864,0.018031113,0.0063005085,0.94869846,0.022092722,0.000051999894],"about_ca_topic_score_codex":0.00084815227,"about_ca_topic_score_gemma":0.0016969694,"teacher_disagreement_score":0.011017483,"about_ca_system_score_codex":0.0007551206,"about_ca_system_score_gemma":0.0005383973,"threshold_uncertainty_score":0.03685713},"labels":[],"label_agreement":null},{"id":"W2403031090","doi":"","title":"Hamiltonian Cycles in Directed Toeplitz Graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Toeplitz matrix; Mathematics; Combinatorics; Pure mathematics","score_opus":0.03408045449087615,"score_gpt":0.3019720306341958,"score_spread":0.26789157614331965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403031090","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6619635,0.002958649,0.13162872,0.0019597388,0.00051414,0.00008746438,0.00045471377,0.00035902119,0.20007409],"genre_scores_gemma":[0.9644771,0.00079282385,0.009076669,0.0002637064,0.00012955576,0.000042211133,0.00016613666,0.0000515297,0.025000207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977976,0.000054558266,0.000011112233,0.0000413096,0.00005891088,0.00005436635],"domain_scores_gemma":[0.9993814,0.0002530503,0.000106377694,0.000054809745,0.00007678586,0.00012749361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020158301,0.0003827835,0.0002594841,0.0013185003,0.00096384395,0.0014752243,0.00049312157,0.0006332509,0.007739796],"category_scores_gemma":[0.0013099051,0.0002530883,0.00028053336,0.0009843357,0.0012602793,0.001745207,0.0009311652,0.00093784614,0.0008640568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017191878,0.000015987638,0.0001897454,0.000032566044,0.000005527836,0.00012222014,0.00018582217,0.0009468443,0.0010092254,0.9896293,0.0012390006,0.0066064806],"study_design_scores_gemma":[0.0000075114185,0.000009729754,0.00013665475,0.000011102365,0.0000047231997,0.000092949296,0.000107629,0.004261686,0.00041910654,0.99201876,0.0029234255,0.0000067824235],"about_ca_topic_score_codex":0.0012294685,"about_ca_topic_score_gemma":0.0021858497,"teacher_disagreement_score":0.007739796,"about_ca_system_score_codex":0.00072849804,"about_ca_system_score_gemma":0.0003227093,"threshold_uncertainty_score":0.025892138},"labels":[],"label_agreement":null},{"id":"W2403055888","doi":"","title":"Kernels by Monochromatic Directed Paths In m-Colored Digraphs With Quasi-Transitive Chromatic Classes.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Monochromatic color; Colored; Chromatic scale; Mathematics; Transitive relation; Fibonacci number; Combinatorics; Optics; Physics; Materials science; Composite material","score_opus":0.010168500101461857,"score_gpt":0.2549953809335078,"score_spread":0.24482688083204596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403055888","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76529616,0.0004584436,0.15765949,0.0005515257,0.00014827984,0.000108972956,0.0011884213,0.0008127696,0.073775895],"genre_scores_gemma":[0.9545002,0.00023821242,0.026349576,0.0001416786,0.0000425777,0.00007250838,0.00052474224,0.00015749867,0.017973023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959594,0.00008399749,0.00002427304,0.000114395436,0.00006524374,0.00011612002],"domain_scores_gemma":[0.9987344,0.00042966823,0.00026611076,0.00020805484,0.000117835305,0.00024390327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000271508,0.00036358298,0.0003522129,0.0010737993,0.00094734237,0.0021259168,0.00071566,0.00070228556,0.008893629],"category_scores_gemma":[0.0014793708,0.00053609005,0.0005645313,0.0008422924,0.0009937297,0.0024075864,0.0013244087,0.00080156745,0.0013252647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001741557,0.00007875066,0.0014913924,0.00013702149,0.000027077875,0.0005416893,0.00056337967,0.0042490256,0.009663255,0.9627374,0.004735583,0.015601372],"study_design_scores_gemma":[0.00008941644,0.000057910256,0.00221553,0.00006733428,0.00005247836,0.00094438036,0.00044969947,0.036920644,0.006921036,0.9397237,0.0125154415,0.000042439224],"about_ca_topic_score_codex":0.0020556531,"about_ca_topic_score_gemma":0.003385501,"teacher_disagreement_score":0.008893629,"about_ca_system_score_codex":0.0011439077,"about_ca_system_score_gemma":0.0004128144,"threshold_uncertainty_score":0.029752195},"labels":[],"label_agreement":null},{"id":"W2403071270","doi":"","title":"L(2,1)-labeling of a circular graph","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.02461642617630742,"score_gpt":0.23714212371680482,"score_spread":0.2125256975404974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403071270","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5976464,0.0005165767,0.27632785,0.006376089,0.0003583847,0.00019760236,0.0038942439,0.0014957396,0.11318718],"genre_scores_gemma":[0.7801593,0.00037150088,0.17629774,0.0014198096,0.0002057332,0.00025817676,0.0033902582,0.00062186574,0.03727554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989537,0.0003285914,0.0000640417,0.0002788687,0.00013155161,0.00024318004],"domain_scores_gemma":[0.995673,0.0020182182,0.00054359634,0.0008614718,0.00035364935,0.00054998574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081295555,0.0006267029,0.00085992465,0.0012708779,0.002954746,0.00394337,0.001794054,0.0023535497,0.013393171],"category_scores_gemma":[0.0033503599,0.00073636294,0.0008819414,0.0017932677,0.0019751056,0.0040049143,0.0020313738,0.0023564794,0.0019259469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043447377,0.00016377303,0.0019012276,0.00028116914,0.00003152149,0.00020265608,0.0006649068,0.008234,0.008585275,0.93119854,0.018739821,0.029562585],"study_design_scores_gemma":[0.00008591821,0.000051105504,0.001265327,0.00005677217,0.00004724296,0.00031484125,0.00046959284,0.036724966,0.005630368,0.93957096,0.015742498,0.00004037877],"about_ca_topic_score_codex":0.0025566127,"about_ca_topic_score_gemma":0.0033735698,"teacher_disagreement_score":0.013393171,"about_ca_system_score_codex":0.0019466191,"about_ca_system_score_gemma":0.0011977741,"threshold_uncertainty_score":0.044804573},"labels":[],"label_agreement":null},{"id":"W2403094376","doi":"","title":"On the Balaban Index of Trees.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Tree (set theory); Combinatorics; Computer science; World Wide Web","score_opus":0.04439641874231101,"score_gpt":0.2655193361685936,"score_spread":0.22112291742628257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403094376","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2613952,0.011199764,0.17302641,0.0064100684,0.0029220488,0.00007764442,0.00085806753,0.00064226834,0.5434685],"genre_scores_gemma":[0.9146421,0.0036208096,0.030058345,0.001901424,0.00137597,0.00011812766,0.00055721524,0.00035821187,0.047367662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990282,0.00030817662,0.00005730253,0.0001342388,0.00028352058,0.00018855426],"domain_scores_gemma":[0.9972983,0.0011087296,0.00036571067,0.00035112695,0.0004436206,0.00043262605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013042588,0.0005402283,0.001185469,0.004090371,0.002674466,0.0039714132,0.0011577152,0.0016008415,0.010564136],"category_scores_gemma":[0.007374903,0.00039854384,0.00055700896,0.0030236132,0.0033670943,0.008552624,0.003990873,0.003513269,0.0029285594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022305037,0.000009122848,0.00015513744,0.000020558635,0.0000031791903,0.000028834596,0.00009416302,0.00025309494,0.00021526832,0.9927898,0.0015489351,0.0048596244],"study_design_scores_gemma":[0.0000055220917,0.000006667562,0.000117304226,0.000017767858,0.0000034392801,0.00005889248,0.00006462291,0.0014880203,0.00012778117,0.9946306,0.0034726162,0.000006756388],"about_ca_topic_score_codex":0.0013022065,"about_ca_topic_score_gemma":0.0016824772,"teacher_disagreement_score":0.010564136,"about_ca_system_score_codex":0.0013597193,"about_ca_system_score_gemma":0.0007083339,"threshold_uncertainty_score":0.035340607},"labels":[],"label_agreement":null},{"id":"W2403114573","doi":"","title":"Chromatic Uniqueness of Certain Complete 4-partite Graphs.","year":2009,"lang":"fr","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Uniqueness; Combinatorics; Mathematical analysis","score_opus":0.02756299012734584,"score_gpt":0.25064975260103495,"score_spread":0.2230867624736891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403114573","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86162615,0.000622284,0.0459936,0.0014976414,0.00009899999,0.000066473505,0.0012804559,0.00018542577,0.08862884],"genre_scores_gemma":[0.96886873,0.00033541705,0.016641889,0.00024367527,0.000070994,0.000059215356,0.0011048003,0.00010194271,0.012573306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995815,0.000110094654,0.000017856437,0.000117249474,0.000068474095,0.00010471067],"domain_scores_gemma":[0.9978695,0.001175877,0.00030030656,0.00022794212,0.00017799363,0.00024836647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005350574,0.000368912,0.00050287734,0.0013751712,0.0025945997,0.0029774029,0.00096558157,0.00132705,0.010627664],"category_scores_gemma":[0.0029611136,0.0007637139,0.0006822109,0.001319761,0.001721182,0.002671457,0.001220103,0.0015098649,0.000778669],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021800553,0.0000481583,0.003272506,0.00013154195,0.00003280486,0.00022702783,0.00056970486,0.0066375737,0.005540778,0.9676117,0.0066987653,0.009011452],"study_design_scores_gemma":[0.00008186087,0.00005421396,0.005751037,0.000056928668,0.00006305739,0.00072924444,0.0010917276,0.029187309,0.0057813805,0.9445216,0.012630195,0.000051496478],"about_ca_topic_score_codex":0.001904905,"about_ca_topic_score_gemma":0.0032196443,"teacher_disagreement_score":0.010627664,"about_ca_system_score_codex":0.001290289,"about_ca_system_score_gemma":0.00059863535,"threshold_uncertainty_score":0.035553038},"labels":[],"label_agreement":null},{"id":"W2403124968","doi":"","title":"Large sets of P 3 -decompostitions of complete multipartite graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Multipartite; Mathematics; Combinatorics; Discrete mathematics; Physics; Quantum mechanics","score_opus":0.02941349928033445,"score_gpt":0.3080258019436919,"score_spread":0.27861230266335746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403124968","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76050687,0.00083289674,0.143427,0.0022940985,0.00025972593,0.00019068914,0.0038447068,0.00095366215,0.0876904],"genre_scores_gemma":[0.9462651,0.00030672553,0.032097142,0.0005064704,0.00015085908,0.00024767153,0.00460919,0.0003214123,0.0154954735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985784,0.00036836046,0.00007922913,0.00031687267,0.00040693663,0.00025021436],"domain_scores_gemma":[0.9907409,0.0052512847,0.00096768,0.0014207028,0.00074345036,0.00087601575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000922642,0.0006952384,0.0010535537,0.0020866662,0.0026588659,0.0039989254,0.0018030326,0.0020223872,0.01398026],"category_scores_gemma":[0.009523709,0.0011383037,0.0014056113,0.0016999446,0.0025092259,0.0041776113,0.003437738,0.0032162748,0.0013275981],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004401241,0.00017072879,0.0036911601,0.00026102937,0.000111780384,0.0010656444,0.0007519041,0.023181528,0.0058895587,0.9308161,0.014305461,0.01931487],"study_design_scores_gemma":[0.000042728887,0.00004010663,0.0013764474,0.0000483752,0.000026463802,0.0004535089,0.0003344048,0.036536917,0.0020192987,0.95430976,0.0047925236,0.000019408102],"about_ca_topic_score_codex":0.0007990364,"about_ca_topic_score_gemma":0.001304183,"teacher_disagreement_score":0.01398026,"about_ca_system_score_codex":0.0012053777,"about_ca_system_score_gemma":0.00069140445,"threshold_uncertainty_score":0.046768665},"labels":[],"label_agreement":null},{"id":"W2403130662","doi":"","title":"Negativity Subscripted Fibonacci And Lucas Numbers And Their Complex Factorizations.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Mathematics; Lucas number; Fibonacci polynomials; Combinatorics; Recurrence relation; Lucas sequence; Tridiagonal matrix; Sequence (biology); Pisano period; Discrete mathematics; Orthogonal polynomials; Classical orthogonal polynomials; Chemistry; Physics","score_opus":0.011274828233274458,"score_gpt":0.2524913952380181,"score_spread":0.24121656700474364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403130662","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15897256,0.006758,0.6171389,0.0018330624,0.0017765625,0.00011700966,0.00044251434,0.00038794734,0.21257333],"genre_scores_gemma":[0.80542743,0.0028551267,0.13069588,0.0006390678,0.0006759877,0.00016181011,0.00033724587,0.00013236982,0.059075207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992754,0.00015157704,0.000036532154,0.00015631525,0.00024731897,0.00013283925],"domain_scores_gemma":[0.9991185,0.00033770976,0.00019120834,0.00010383679,0.00017156158,0.000077322744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077788625,0.00083242124,0.0004106258,0.0014754484,0.0013901612,0.0021339862,0.0004458576,0.0008467961,0.011111178],"category_scores_gemma":[0.0039595836,0.00039643404,0.00050206075,0.0008252131,0.0028999737,0.0023724716,0.001047653,0.0012323345,0.0019732267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013675707,0.0000046546825,0.00013324435,0.000021225105,0.0000019132515,0.000104144965,0.00015066875,0.0006750258,0.0009978447,0.99034965,0.0012104352,0.0063376077],"study_design_scores_gemma":[0.000008303091,0.000024795305,0.00024270995,0.000028082619,0.00000596141,0.00043454248,0.00009158105,0.007637896,0.001602698,0.9599573,0.02994375,0.00002237473],"about_ca_topic_score_codex":0.0010322713,"about_ca_topic_score_gemma":0.0012870026,"teacher_disagreement_score":0.011111178,"about_ca_system_score_codex":0.0011621808,"about_ca_system_score_gemma":0.00054023607,"threshold_uncertainty_score":0.03717059},"labels":[],"label_agreement":null},{"id":"W2403137284","doi":"","title":"On a Family of 4-Critical Graphs with Diameter Three.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.021440355788581122,"score_gpt":0.28756598327571176,"score_spread":0.26612562748713064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403137284","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84505844,0.0023547395,0.04124388,0.0028466142,0.0002140224,0.00011961159,0.0010009747,0.00045056664,0.10671109],"genre_scores_gemma":[0.9709489,0.0011085288,0.0136408545,0.0003891347,0.0001438485,0.00009562283,0.0010514746,0.00012372684,0.012497972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995876,0.00009452475,0.000014308893,0.000102721264,0.00008686272,0.000113997194],"domain_scores_gemma":[0.9967116,0.0017303969,0.00047531354,0.00015663373,0.00028381022,0.0006422313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048515951,0.0007962832,0.00061738037,0.0028769688,0.003150741,0.0015578284,0.0011445432,0.0015445263,0.006972133],"category_scores_gemma":[0.0033785338,0.00054177427,0.0007220381,0.0011663118,0.0019116137,0.0018143946,0.0013723491,0.0015007678,0.0008686185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050721347,0.000091583366,0.0046793255,0.00023991971,0.0000741186,0.0036136082,0.0014947382,0.009816078,0.0080720745,0.936546,0.019015796,0.015849516],"study_design_scores_gemma":[0.00021397341,0.00011768633,0.0066756657,0.0002312638,0.000085977015,0.0052529387,0.0014405253,0.039346073,0.0041226503,0.90772784,0.034703538,0.00008182074],"about_ca_topic_score_codex":0.0021474448,"about_ca_topic_score_gemma":0.0020680744,"teacher_disagreement_score":0.006972133,"about_ca_system_score_codex":0.0015632481,"about_ca_system_score_gemma":0.00054049795,"threshold_uncertainty_score":0.023324132},"labels":[],"label_agreement":null},{"id":"W2403141327","doi":"","title":"On Star Chromatic Number of Sunlet Graph Families.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Star (game theory); Combinatorics; Graph; Mathematical analysis","score_opus":0.017007569895743056,"score_gpt":0.2448576919815253,"score_spread":0.22785012208578223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403141327","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7414654,0.0030587004,0.09868876,0.0063479403,0.00042946675,0.00010103342,0.0026306398,0.0004828261,0.14679526],"genre_scores_gemma":[0.96249855,0.0013130973,0.020557247,0.00045340718,0.0003153645,0.00010534022,0.0011047054,0.00017675049,0.013475547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991229,0.00027878725,0.000030014557,0.00022916606,0.00015653827,0.00018261287],"domain_scores_gemma":[0.9935899,0.0041508786,0.00064512854,0.0005015482,0.00041104748,0.00070156483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013859584,0.00054543593,0.0008133096,0.00306785,0.0024902227,0.0029993595,0.0017288892,0.0013000891,0.014472602],"category_scores_gemma":[0.00758582,0.0005337496,0.000593913,0.0027753066,0.002711343,0.0068195607,0.0018402928,0.0020896967,0.0011502572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002756903,0.00009400694,0.0039719,0.0001975668,0.00003722778,0.00008076776,0.00041290297,0.014615665,0.0019588105,0.9384303,0.018937973,0.02098717],"study_design_scores_gemma":[0.00004780671,0.00003884083,0.002508305,0.000066187335,0.00002960939,0.00020124632,0.00041427749,0.05286487,0.0013240061,0.93358886,0.008882399,0.00003361634],"about_ca_topic_score_codex":0.0028905512,"about_ca_topic_score_gemma":0.00365636,"teacher_disagreement_score":0.014472602,"about_ca_system_score_codex":0.002952453,"about_ca_system_score_gemma":0.0009205075,"threshold_uncertainty_score":0.04841566},"labels":[],"label_agreement":null},{"id":"W2403150329","doi":"","title":"Enumeration of isomorphism classes of self-orthogonal Latin squares.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enumeration; Isomorphism (crystallography); Latin square; Combinatorics; Orthogonal array; Statistics; Crystallography; Biology; Food science","score_opus":0.005106526150668462,"score_gpt":0.1909686889281681,"score_spread":0.18586216277749965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403150329","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61086255,0.0007918884,0.18413962,0.0013008543,0.0002419125,0.00013737696,0.0016877234,0.00079087785,0.20004715],"genre_scores_gemma":[0.9322684,0.000365114,0.038931925,0.00028561868,0.00011960519,0.00011866015,0.0019427959,0.00022343955,0.025744472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991565,0.00025635716,0.00005468527,0.00017372546,0.00018676899,0.0001719527],"domain_scores_gemma":[0.9977133,0.0012530913,0.00022106731,0.00039510478,0.00022311564,0.00019420299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038558434,0.0004691216,0.00046463826,0.0019287806,0.0012199816,0.0021733441,0.00071680284,0.0009137866,0.016615594],"category_scores_gemma":[0.0035381836,0.00038409905,0.0004217003,0.001538314,0.0011947112,0.0027046453,0.001814038,0.0010048212,0.0019531287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001948832,0.00018528386,0.0032515975,0.00013751202,0.000029911002,0.00029520647,0.00050802605,0.0030348008,0.010198338,0.90732473,0.008912399,0.065927394],"study_design_scores_gemma":[0.000047776168,0.00005922242,0.0020376414,0.00005935042,0.00003008275,0.00093689986,0.0004620799,0.017610665,0.008816237,0.9441001,0.025812712,0.000027173588],"about_ca_topic_score_codex":0.00040380977,"about_ca_topic_score_gemma":0.0006466336,"teacher_disagreement_score":0.016615594,"about_ca_system_score_codex":0.0006702365,"about_ca_system_score_gemma":0.00049008057,"threshold_uncertainty_score":0.05558473},"labels":[],"label_agreement":null},{"id":"W2403154468","doi":"","title":"Competition Graphs of Acyclic Digraphs Satisfying Condition C*(p).","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Competition (biology); Discrete mathematics; Biology","score_opus":0.013415520567717342,"score_gpt":0.2833103321507263,"score_spread":0.269894811583009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403154468","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49648115,0.00080704846,0.23721464,0.0030287665,0.00034453644,0.000720662,0.009968734,0.0012266474,0.2502079],"genre_scores_gemma":[0.93974894,0.00033849073,0.034079604,0.0006390834,0.00010898261,0.0003073927,0.0048654033,0.00017353895,0.019738613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853957,0.00032937396,0.00010477205,0.0003782714,0.0002630111,0.00038492202],"domain_scores_gemma":[0.9890906,0.0061862976,0.0009659041,0.00079869496,0.0012487688,0.0017097148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012954022,0.00053334935,0.0007565741,0.0013851982,0.0021048086,0.0028132338,0.0012376716,0.0014404249,0.022429414],"category_scores_gemma":[0.0101411,0.00056625926,0.00067985716,0.0018114875,0.0014250448,0.0036941604,0.0015400193,0.0016266844,0.0016191601],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044584443,0.00016771116,0.002862849,0.0003858558,0.000056401983,0.00070510723,0.0002660076,0.008725673,0.006042276,0.94305974,0.018225495,0.01905705],"study_design_scores_gemma":[0.00018048815,0.00012937243,0.0025502027,0.00008654368,0.00006991311,0.0012929222,0.0004864708,0.04455375,0.0043654256,0.9212107,0.025016716,0.00005763244],"about_ca_topic_score_codex":0.004011844,"about_ca_topic_score_gemma":0.0057832613,"teacher_disagreement_score":0.022429414,"about_ca_system_score_codex":0.0014593356,"about_ca_system_score_gemma":0.002201024,"threshold_uncertainty_score":0.07503384},"labels":[],"label_agreement":null},{"id":"W2403172418","doi":"","title":"On Sum-Balaban Index","year":2012,"lang":"fr","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Connectivity; Graph; Cyclomatic complexity; Discrete mathematics; Computer science","score_opus":0.022360903716578572,"score_gpt":0.2815170547368369,"score_spread":0.25915615102025835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403172418","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36872503,0.0054006046,0.48099253,0.001515019,0.0005194238,0.00009822094,0.0007360995,0.0009250595,0.14108795],"genre_scores_gemma":[0.93444294,0.0015885512,0.05317263,0.00053965295,0.00040986913,0.00013508808,0.0005019552,0.000416498,0.008792881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804604,0.00041999988,0.00011966434,0.00040800462,0.00060987653,0.00039636553],"domain_scores_gemma":[0.9911724,0.0047739637,0.00071650476,0.0013729498,0.001005159,0.00095902797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022779417,0.00077484845,0.0013591918,0.004130212,0.0024990398,0.003459453,0.001906534,0.0012595964,0.006324113],"category_scores_gemma":[0.0147259915,0.00044838613,0.00085770944,0.0035272078,0.0039205733,0.008582012,0.003792596,0.0035239626,0.0019256896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019844522,0.00006141868,0.0019334415,0.00010802902,0.000017489774,0.00012073411,0.0003025787,0.009420675,0.0029194998,0.95850736,0.0032282618,0.023182083],"study_design_scores_gemma":[0.000010943461,0.00004198171,0.0006054255,0.000051560834,0.000019399033,0.00023448926,0.000111229594,0.042626884,0.0025359462,0.9495998,0.0041262913,0.000036115438],"about_ca_topic_score_codex":0.0006969589,"about_ca_topic_score_gemma":0.00074857316,"teacher_disagreement_score":0.006324113,"about_ca_system_score_codex":0.0015944715,"about_ca_system_score_gemma":0.0008425296,"threshold_uncertainty_score":0.021156251},"labels":[],"label_agreement":null},{"id":"W2403173752","doi":"","title":"Asymmetric Cycle Avoidance Online Ramsey Games in Random Graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.06419502591758303,"score_gpt":0.35272492735197,"score_spread":0.28852990143438695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403173752","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5132083,0.0010501911,0.4046863,0.0042995093,0.0002933093,0.00054305734,0.001007528,0.0004745891,0.07443723],"genre_scores_gemma":[0.97216266,0.00031278317,0.016615428,0.0003330841,0.00009652338,0.0002243059,0.00018664477,0.000044092783,0.010024438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973308,0.0014200762,0.00009170857,0.00033609453,0.00036270957,0.0004586675],"domain_scores_gemma":[0.9877193,0.008343296,0.0012731565,0.0010032203,0.0005336932,0.0011272981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024896706,0.0006405386,0.0011999953,0.0009316648,0.0011655266,0.0023154027,0.0022804283,0.0017297223,0.007839983],"category_scores_gemma":[0.0125844395,0.0005347864,0.0007230613,0.0007376735,0.0017039533,0.0051408084,0.0021955455,0.002194805,0.0006401016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039720032,0.00022527591,0.00097170484,0.00015543541,0.000081786,0.00022242682,0.0002043047,0.04614741,0.002011197,0.9286503,0.0069948076,0.013938204],"study_design_scores_gemma":[0.00010990749,0.00007689092,0.0004182128,0.000035429257,0.000039567414,0.00015761174,0.00012592474,0.23634143,0.0008369239,0.75906694,0.002762413,0.000028699504],"about_ca_topic_score_codex":0.0013298976,"about_ca_topic_score_gemma":0.0022012868,"teacher_disagreement_score":0.007839983,"about_ca_system_score_codex":0.0018011437,"about_ca_system_score_gemma":0.001552719,"threshold_uncertainty_score":0.026227355},"labels":[],"label_agreement":null},{"id":"W2403192553","doi":"","title":"The Crossing Numbers of Cartesian Product of Cone Graph C m + K l with Path P n .","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Mathematics; Combinatorics; Graph; Path (computing); Product (mathematics); Geometry; Computer science","score_opus":0.014605114551273985,"score_gpt":0.21321666928822794,"score_spread":0.19861155473695397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403192553","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7461194,0.0008116371,0.10681479,0.00055194425,0.0004106569,0.00008793093,0.0017890995,0.00091244554,0.1425021],"genre_scores_gemma":[0.94990736,0.0003317855,0.029857678,0.00010624839,0.000053112115,0.00007319455,0.0011954021,0.00019968879,0.018275512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956757,0.0000723288,0.00002324621,0.00011922503,0.000111410096,0.00010618838],"domain_scores_gemma":[0.99845314,0.00043628353,0.00029637513,0.00015942563,0.00028727803,0.0003674727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037341722,0.00038184627,0.00024348461,0.002181674,0.0011573773,0.0021456685,0.0005866728,0.00057804986,0.01285021],"category_scores_gemma":[0.0023647635,0.00027772522,0.00027362746,0.0010950044,0.0009886011,0.0020406991,0.0009209399,0.0008735932,0.0016401799],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059853285,0.000121498015,0.009053588,0.00025736858,0.000034954035,0.0009034044,0.0009821851,0.0066145835,0.016083129,0.87181056,0.021871444,0.0716688],"study_design_scores_gemma":[0.00006079777,0.0002878883,0.016501194,0.00020635797,0.0000907734,0.0030039372,0.0014794557,0.052272726,0.024835138,0.8212458,0.07990016,0.00011569674],"about_ca_topic_score_codex":0.0016745493,"about_ca_topic_score_gemma":0.002181565,"teacher_disagreement_score":0.01285021,"about_ca_system_score_codex":0.0008325839,"about_ca_system_score_gemma":0.00056497374,"threshold_uncertainty_score":0.04298818},"labels":[],"label_agreement":null},{"id":"W2403213260","doi":"","title":"A Study on Radial Graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.019578667271630268,"score_gpt":0.3005948862521077,"score_spread":0.2810162189804774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403213260","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19798084,0.012636815,0.11413606,0.0026984324,0.00059446896,0.00020826152,0.00065278687,0.00035813526,0.67073417],"genre_scores_gemma":[0.7900591,0.015285233,0.052839305,0.0017162473,0.000829849,0.00016841333,0.0013500714,0.00069147913,0.1370603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991942,0.00042612784,0.000021980548,0.00012620435,0.00012912453,0.00010227643],"domain_scores_gemma":[0.9971727,0.0016973722,0.000221221,0.00035251398,0.00034924404,0.00020695676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065861834,0.0006639672,0.00052568957,0.0016169123,0.001619497,0.001715182,0.0012886052,0.00091594615,0.019204624],"category_scores_gemma":[0.005499736,0.0003193232,0.0007747857,0.0028647508,0.0012949322,0.0037933257,0.001082754,0.0013188513,0.0037674732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056657995,0.00010248055,0.0011286346,0.00032526907,0.000016214251,0.00030015298,0.00048560833,0.0036935508,0.0013868428,0.94855535,0.013666041,0.030283267],"study_design_scores_gemma":[0.000035159206,0.00015855335,0.002849265,0.00036519297,0.000088137036,0.0024341717,0.0016954594,0.028749876,0.0029368047,0.8151936,0.14546122,0.000032614655],"about_ca_topic_score_codex":0.0026898982,"about_ca_topic_score_gemma":0.0030344245,"teacher_disagreement_score":0.019204624,"about_ca_system_score_codex":0.0010426114,"about_ca_system_score_gemma":0.00046596976,"threshold_uncertainty_score":0.06424582},"labels":[],"label_agreement":null},{"id":"W2403235839","doi":"","title":"Bounds on Hosoya Index Involving Some Other Topological Indices.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Topological index; Topology (electrical circuits); Combinatorics; Statistics; Computer science","score_opus":0.014040801529501117,"score_gpt":0.2270899867526192,"score_spread":0.21304918522311808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403235839","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19958082,0.010577282,0.3415089,0.009147551,0.0015792918,0.00015660006,0.0026111412,0.0015549946,0.43328348],"genre_scores_gemma":[0.8698051,0.0038722714,0.083068006,0.0011941714,0.0014493555,0.00034785396,0.0016500575,0.00078433024,0.037828874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810874,0.00040509072,0.00009657794,0.00037494113,0.0005252892,0.0004892948],"domain_scores_gemma":[0.98547167,0.009829678,0.0008200852,0.001647559,0.00097320165,0.0012578388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028839302,0.0013776027,0.0016064177,0.0049915663,0.0030389067,0.005688137,0.0035588343,0.0023135417,0.017398018],"category_scores_gemma":[0.015611755,0.00056471885,0.001059957,0.00397233,0.0034837786,0.014018104,0.0044806465,0.005863309,0.0028564865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021155222,0.0000933151,0.0012329111,0.00022029484,0.000036998583,0.00010644851,0.00025082447,0.0045476696,0.0019311669,0.95864415,0.012909491,0.019815182],"study_design_scores_gemma":[0.000022852615,0.000026387215,0.000732957,0.000070708586,0.000049404458,0.00016804445,0.00012275767,0.022778567,0.0019217422,0.9648032,0.009266505,0.00003688892],"about_ca_topic_score_codex":0.0017639349,"about_ca_topic_score_gemma":0.003040226,"teacher_disagreement_score":0.017398018,"about_ca_system_score_codex":0.0033502516,"about_ca_system_score_gemma":0.0015983141,"threshold_uncertainty_score":0.058202207},"labels":[],"label_agreement":null},{"id":"W2403237451","doi":"","title":"The Binet-Like Formula Of A Family Of The Conditional Sequences By Matrix Methods.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Matrix (chemical analysis); Combinatorics; Statistics; Chemistry; Chromatography","score_opus":0.02080476729519759,"score_gpt":0.3168183018518296,"score_spread":0.296013534556632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403237451","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09005887,0.0025077777,0.7834255,0.0039857496,0.0010660144,0.00008912806,0.0009920538,0.00058178796,0.11729301],"genre_scores_gemma":[0.75912046,0.0015560489,0.17434926,0.0017247619,0.0012874596,0.00026787043,0.0008953811,0.00057029666,0.06022853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910116,0.00033258772,0.0000429926,0.00014238925,0.00026468933,0.000116210176],"domain_scores_gemma":[0.9975267,0.0012269382,0.00022447665,0.00028047996,0.00048271124,0.00025872415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018677908,0.0006496815,0.0007606431,0.0022827988,0.0015367848,0.0025235286,0.0015062812,0.0016661237,0.013770638],"category_scores_gemma":[0.009775347,0.000494682,0.0009133257,0.0013723406,0.0026135624,0.0052634105,0.0016886933,0.0035682097,0.0020731308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008727873,0.00000565605,0.00007288994,0.000017940229,0.0000042152137,0.000034625347,0.000034862685,0.00041559807,0.00016220582,0.9951348,0.0014543718,0.0026540312],"study_design_scores_gemma":[0.00000637281,0.000006454415,0.00009527266,0.00001579866,0.000004561336,0.000094898605,0.000015465406,0.013279601,0.00020550417,0.98421717,0.0020489693,0.000009900305],"about_ca_topic_score_codex":0.00158852,"about_ca_topic_score_gemma":0.0020341664,"teacher_disagreement_score":0.013770638,"about_ca_system_score_codex":0.0012489038,"about_ca_system_score_gemma":0.0008734971,"threshold_uncertainty_score":0.046067357},"labels":[],"label_agreement":null},{"id":"W2403255421","doi":"","title":"Some new results on the sum of squares of eccentricity in graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eccentricity (behavior); Explained sum of squares; Combinatorics; Statistics; Political science; Law","score_opus":0.028747296946464208,"score_gpt":0.2705013273307387,"score_spread":0.24175403038427445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403255421","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11461866,0.022137104,0.6076169,0.0065892995,0.0032950488,0.00011184814,0.0015161091,0.00089412875,0.2432209],"genre_scores_gemma":[0.7250993,0.015888968,0.17135127,0.0034467825,0.008346063,0.00023960324,0.0013896051,0.00136827,0.07287016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986952,0.00028547636,0.00009492589,0.00032007406,0.0004809066,0.00012348877],"domain_scores_gemma":[0.993761,0.003689955,0.000633405,0.0006386407,0.0007240469,0.00055284565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014206918,0.0014605862,0.0011007881,0.0040932796,0.0012204,0.0027965633,0.0020615826,0.0014502661,0.013753856],"category_scores_gemma":[0.009840824,0.00075604045,0.001130578,0.004022488,0.0033722331,0.007916042,0.0028957992,0.0039278725,0.0025805961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086507906,0.000070725255,0.0013758028,0.00047878086,0.00006586525,0.00039128755,0.00042749118,0.007249688,0.0037039134,0.9221623,0.015074384,0.048913397],"study_design_scores_gemma":[0.000012242825,0.000034231325,0.0009080577,0.000055146305,0.000039581202,0.00076542696,0.00012930205,0.011671022,0.0011043838,0.9689211,0.016332667,0.000026845371],"about_ca_topic_score_codex":0.00056091737,"about_ca_topic_score_gemma":0.0008985702,"teacher_disagreement_score":0.013753856,"about_ca_system_score_codex":0.0009935645,"about_ca_system_score_gemma":0.00034626448,"threshold_uncertainty_score":0.04601127},"labels":[],"label_agreement":null},{"id":"W2403260949","doi":"","title":"Distance-Dominating Cycles in P3-Dominated Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.016016955823797568,"score_gpt":0.2865911891191448,"score_spread":0.2705742332953472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403260949","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6677802,0.0026084988,0.17432836,0.0029147235,0.00022136066,0.0002781413,0.0025403367,0.0005243611,0.148804],"genre_scores_gemma":[0.9159837,0.0012130165,0.047654368,0.0007849091,0.00011726808,0.00021072131,0.0016126737,0.00016662433,0.0322567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992711,0.00018619408,0.000042393705,0.0001658336,0.00017401186,0.00016049141],"domain_scores_gemma":[0.99626863,0.0022206733,0.00036138686,0.00025146466,0.00042530624,0.00047250726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006014279,0.00049813284,0.00062932866,0.0014374317,0.0019041117,0.0025521636,0.0011336434,0.0012477041,0.009033972],"category_scores_gemma":[0.0052423542,0.0005243626,0.0006018603,0.0020034895,0.0011355246,0.0028115648,0.0018514222,0.001308946,0.0014526988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007261631,0.00016109787,0.005215384,0.00067438715,0.00009661508,0.0012829365,0.0013169219,0.014182151,0.009922809,0.8725093,0.019394679,0.07451747],"study_design_scores_gemma":[0.000088161985,0.000071254806,0.0015417386,0.000084121144,0.000053132007,0.0013310126,0.00046347754,0.02777185,0.0050635133,0.9445485,0.018959887,0.00002334628],"about_ca_topic_score_codex":0.0020028567,"about_ca_topic_score_gemma":0.0025848954,"teacher_disagreement_score":0.009033972,"about_ca_system_score_codex":0.0015030382,"about_ca_system_score_gemma":0.00073863904,"threshold_uncertainty_score":0.030221641},"labels":[],"label_agreement":null},{"id":"W2403261302","doi":"","title":"The Generalized k-Fibonacci and k-Lucas Numbers.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Mathematics; Lucas number; Lucas sequence; Pisano period; Fibonacci polynomials; Combinatorics; Orthogonal polynomials","score_opus":0.015559615050671261,"score_gpt":0.25352045282420976,"score_spread":0.2379608377735385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403261302","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13725701,0.03181072,0.120583445,0.0074561597,0.004059777,0.00009017128,0.0009767518,0.00049955584,0.6972664],"genre_scores_gemma":[0.832986,0.008381599,0.052902456,0.0016184576,0.0017503622,0.00016065166,0.0004191279,0.00016315386,0.10161821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995578,0.0001122465,0.000027910533,0.00007962483,0.00014642064,0.00007602463],"domain_scores_gemma":[0.99928623,0.0002444109,0.00010625218,0.000111983056,0.00017927894,0.00007182817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005084191,0.0007071149,0.0005611312,0.0023266599,0.0018140114,0.0031587742,0.00072532607,0.0012152368,0.0109832855],"category_scores_gemma":[0.0030787091,0.00035834577,0.0006558948,0.0016201077,0.003913409,0.004390337,0.0014457528,0.0017407517,0.0026780944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008450112,0.0000017539963,0.00004343069,0.000020774598,0.0000020005573,0.000037383797,0.00005737654,0.00022440997,0.0001395127,0.99309534,0.0021155493,0.0042539597],"study_design_scores_gemma":[0.000004573479,0.00000446154,0.00011732076,0.000018276165,0.0000028429652,0.00012757682,0.000054970405,0.0008334292,0.00011704841,0.9829338,0.01577646,0.000009196952],"about_ca_topic_score_codex":0.0019424462,"about_ca_topic_score_gemma":0.002632862,"teacher_disagreement_score":0.0109832855,"about_ca_system_score_codex":0.0017585426,"about_ca_system_score_gemma":0.0009211184,"threshold_uncertainty_score":0.036742747},"labels":[],"label_agreement":null},{"id":"W2403262110","doi":"","title":"Block transitive 2-(v, 13, 1) Designs and Suzuki Groups.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Transitive relation; Block (permutation group theory); Combinatorics; Arithmetic; Discrete mathematics","score_opus":0.010797301673421163,"score_gpt":0.19561830157523655,"score_spread":0.18482099990181539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403262110","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37983966,0.0010656436,0.28798226,0.00089652365,0.00045572798,0.00019281147,0.0006712926,0.00078735594,0.32810867],"genre_scores_gemma":[0.8967327,0.00047307598,0.04848896,0.00030865098,0.00010360341,0.00019343449,0.0003944188,0.00011998176,0.053185184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939287,0.00019708235,0.000032310618,0.00009902309,0.00012304456,0.00015565554],"domain_scores_gemma":[0.9991748,0.0002666377,0.00018584492,0.00018224325,0.00009830301,0.00009223967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045619914,0.0004443444,0.00031766653,0.00087032886,0.0011068127,0.0017380212,0.00046431922,0.0006404079,0.014062531],"category_scores_gemma":[0.0013275488,0.0003204406,0.0004088986,0.0007107124,0.0009920072,0.0016947275,0.0010145801,0.0006138836,0.0021665948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059208825,0.000017382663,0.00018126854,0.000028248203,0.000008357411,0.00008566513,0.00011118428,0.0013337756,0.0023120025,0.9858813,0.0017020656,0.008279517],"study_design_scores_gemma":[0.000041485444,0.000079994425,0.00028493107,0.000034242617,0.000020291272,0.00021826307,0.00017229102,0.010765331,0.003683706,0.9667446,0.017929489,0.000025377107],"about_ca_topic_score_codex":0.000785773,"about_ca_topic_score_gemma":0.0020738414,"teacher_disagreement_score":0.014062531,"about_ca_system_score_codex":0.00070338167,"about_ca_system_score_gemma":0.00070122886,"threshold_uncertainty_score":0.0470438},"labels":[],"label_agreement":null},{"id":"W2403274737","doi":"","title":"On Candelabra Quadruple Systems.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.012417371335014547,"score_gpt":0.18369782579320332,"score_spread":0.17128045445818876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403274737","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15081991,0.003950658,0.38651747,0.0038690446,0.0017762606,0.00017718431,0.00095026114,0.0007942407,0.45114493],"genre_scores_gemma":[0.8129871,0.0023987542,0.08331505,0.0018213579,0.0008227298,0.00026341353,0.0009901881,0.0002918546,0.097109556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991161,0.00024689382,0.000035463156,0.00015795536,0.00021563766,0.00022790152],"domain_scores_gemma":[0.99826056,0.00069197314,0.00017466396,0.00028373048,0.00030972346,0.0002792371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056276086,0.00058547634,0.0006938054,0.0022244703,0.0028671778,0.002270325,0.00096913864,0.0012612765,0.022708077],"category_scores_gemma":[0.0032723087,0.0003209977,0.0005504524,0.0015945255,0.0019619379,0.003412936,0.0027547586,0.0024828352,0.0043367594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022733868,0.000014249166,0.00009938954,0.000029402223,0.000004832663,0.00006375317,0.000089309215,0.0012625374,0.0004970188,0.98588645,0.0039078835,0.008122505],"study_design_scores_gemma":[0.00000729739,0.000015327272,0.000101817175,0.000026323432,0.000003062982,0.00012582219,0.00007679614,0.0057634283,0.00032991238,0.98086745,0.012669481,0.000013283105],"about_ca_topic_score_codex":0.0013288207,"about_ca_topic_score_gemma":0.0023331717,"teacher_disagreement_score":0.022708077,"about_ca_system_score_codex":0.0012227974,"about_ca_system_score_gemma":0.0006279695,"threshold_uncertainty_score":0.07596612},"labels":[],"label_agreement":null},{"id":"W2403289943","doi":"","title":"On the Folded hypercube and Bi-folded Hypercube.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hypercube; Mathematics; Combinatorics","score_opus":0.013915870917109222,"score_gpt":0.21893163015393358,"score_spread":0.20501575923682436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403289943","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20613576,0.022159249,0.4024739,0.0039265254,0.003076283,0.00015536301,0.000633093,0.00057225325,0.3608676],"genre_scores_gemma":[0.8083421,0.01174711,0.08292608,0.0013169186,0.0011966195,0.00020494404,0.0006021797,0.00024541857,0.09341871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967945,0.000118690616,0.000018209157,0.000045691286,0.00007509176,0.00006283499],"domain_scores_gemma":[0.9994729,0.00015456504,0.00006114527,0.00012275774,0.00010448544,0.00008421108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044361642,0.00046772044,0.00043172162,0.0010979259,0.0009815496,0.0014311294,0.0006278609,0.0006828119,0.0077054407],"category_scores_gemma":[0.001811141,0.00029544006,0.00033459425,0.0014475025,0.0016561742,0.00417112,0.0019699784,0.00120988,0.0015904738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090545655,0.000015910993,0.00021852291,0.00007915825,0.000011011221,0.00021433657,0.00015792932,0.00847069,0.001177491,0.96117514,0.006465087,0.021924164],"study_design_scores_gemma":[0.000009433684,0.000021237107,0.0002162909,0.00005099145,0.0000074106943,0.00021090345,0.00011400773,0.02122245,0.00051794696,0.9612582,0.01636016,0.000011065303],"about_ca_topic_score_codex":0.0007838517,"about_ca_topic_score_gemma":0.0012050208,"teacher_disagreement_score":0.0077054407,"about_ca_system_score_codex":0.00067006436,"about_ca_system_score_gemma":0.00033830747,"threshold_uncertainty_score":0.02577728},"labels":[],"label_agreement":null},{"id":"W2403294653","doi":"","title":"A Cube-covering Problem.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cube (algebra); Combinatorics","score_opus":0.010907786761450418,"score_gpt":0.22702334014891656,"score_spread":0.21611555338746616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403294653","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10601095,0.0036254104,0.66095334,0.009406959,0.0011263031,0.00058729266,0.012281038,0.00132898,0.20467974],"genre_scores_gemma":[0.49601543,0.0032642102,0.4298465,0.0016404106,0.00058091665,0.0005438234,0.011651171,0.00057949236,0.05587812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852896,0.00045750584,0.000080139056,0.00033255515,0.00037781708,0.0002230771],"domain_scores_gemma":[0.99721587,0.0018130044,0.0001604486,0.00036416986,0.00021117498,0.00023534604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008684484,0.00077889353,0.001113968,0.0007734048,0.0011040468,0.0029655714,0.0014497794,0.0021953867,0.025276694],"category_scores_gemma":[0.0061428095,0.000502381,0.001384047,0.0025085136,0.0009380673,0.0038717978,0.0021310537,0.0023141892,0.0027275237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036611778,0.00031939437,0.0016482003,0.000960561,0.00024338515,0.0007746084,0.00034043004,0.105203964,0.0034869213,0.56381977,0.12572567,0.19711094],"study_design_scores_gemma":[0.00009458454,0.00009100601,0.0008999883,0.00016689631,0.00009131063,0.0009216802,0.00040662114,0.18889296,0.0030031097,0.7364342,0.068958975,0.000038605358],"about_ca_topic_score_codex":0.0032423737,"about_ca_topic_score_gemma":0.00397213,"teacher_disagreement_score":0.025276694,"about_ca_system_score_codex":0.0010881397,"about_ca_system_score_gemma":0.0015641736,"threshold_uncertainty_score":0.084558964},"labels":[],"label_agreement":null},{"id":"W2403305660","doi":"","title":"Two new classes of spectrally arbitrary sign patterns.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Sign (mathematics); Mathematical analysis","score_opus":0.010400029965071549,"score_gpt":0.2249128926916732,"score_spread":0.21451286272660164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403305660","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3117458,0.0018596401,0.34072623,0.004158984,0.0015872711,0.00026717456,0.0017867584,0.00090802833,0.3369602],"genre_scores_gemma":[0.8481207,0.0011557445,0.08539227,0.0016479666,0.00052937266,0.00037696923,0.0019068051,0.0003594031,0.06051084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901724,0.00018411851,0.000069633104,0.00018432231,0.00031885874,0.00022578129],"domain_scores_gemma":[0.9981358,0.00059547595,0.00027063806,0.00042861432,0.00023764085,0.00033172683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054374273,0.0005841756,0.00060127716,0.0014993707,0.0013827262,0.0037643781,0.0012068966,0.0021997239,0.014760262],"category_scores_gemma":[0.0048315646,0.00051040703,0.0006612716,0.0015116171,0.002268278,0.0039804773,0.0021988405,0.0021913878,0.0019411729],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009487367,0.00006228059,0.0005971275,0.00006873377,0.0000075603,0.00021631001,0.00011416437,0.0011724859,0.0019628254,0.964895,0.008479551,0.02232913],"study_design_scores_gemma":[0.000073141775,0.00004828391,0.0007562082,0.000054862794,0.000012551005,0.0013178416,0.0002178271,0.017680228,0.002330214,0.94635093,0.031124938,0.0000329756],"about_ca_topic_score_codex":0.00034109972,"about_ca_topic_score_gemma":0.00061758404,"teacher_disagreement_score":0.014760262,"about_ca_system_score_codex":0.00068659696,"about_ca_system_score_gemma":0.00056494767,"threshold_uncertainty_score":0.049377978},"labels":[],"label_agreement":null},{"id":"W2403306657","doi":"","title":"Perfect state transfer between non-antipodal vertices in integral circulant graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Antipodal point; Circulant matrix; Mathematics; Combinatorics; Transfer (computing); Discrete mathematics; Geometry; Computer science","score_opus":0.047146575354170626,"score_gpt":0.3005098139403286,"score_spread":0.253363238586158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403306657","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6600638,0.00054972793,0.14551745,0.0013987795,0.0008444392,0.0001445346,0.00036702145,0.0012071453,0.1899071],"genre_scores_gemma":[0.9838395,0.00011636566,0.008054624,0.000233861,0.000065870685,0.00006464778,0.00011346493,0.0001004,0.0074113426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942064,0.000114853465,0.000022194467,0.000097507414,0.0001453854,0.00019956114],"domain_scores_gemma":[0.99876094,0.00045458673,0.0001241735,0.00034551902,0.00011052237,0.00020427872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005624828,0.00034532152,0.00063151633,0.0012341036,0.0020285095,0.0022079234,0.0012351043,0.0016509292,0.012450432],"category_scores_gemma":[0.0034099696,0.0003729883,0.00051557296,0.0006525758,0.002031629,0.0031617847,0.0019436901,0.0015600199,0.0011084055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006026859,0.00004543922,0.00015148806,0.000033223663,0.0000052796822,0.000105642604,0.000105201645,0.0018202681,0.0023763457,0.989474,0.0015348885,0.0042879493],"study_design_scores_gemma":[0.00002942721,0.0000443088,0.00022982336,0.000024765879,0.00001024163,0.00013009488,0.00012401423,0.026875017,0.0031324462,0.967452,0.0019284218,0.000019417615],"about_ca_topic_score_codex":0.0006704144,"about_ca_topic_score_gemma":0.000871467,"teacher_disagreement_score":0.012450432,"about_ca_system_score_codex":0.0009196418,"about_ca_system_score_gemma":0.00072840677,"threshold_uncertainty_score":0.04165083},"labels":[],"label_agreement":null},{"id":"W2403310330","doi":"","title":"Chromaticity of Bipartite Graphs With Seven Edges Deleted.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Chromaticity; Mathematics; Combinatorics; Complete bipartite graph; Graph; Computer science; Artificial intelligence","score_opus":0.012873559486165883,"score_gpt":0.18141902152911832,"score_spread":0.16854546204295243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403310330","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7594096,0.0003689648,0.06363093,0.0018597055,0.00020582814,0.000102875754,0.0030983982,0.00055004645,0.17077358],"genre_scores_gemma":[0.96179515,0.000203638,0.014280089,0.0002575105,0.000052221865,0.00007344943,0.0014208073,0.0001637189,0.02175352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999553,0.00011650892,0.000014024009,0.000102863385,0.00007072968,0.00014274944],"domain_scores_gemma":[0.9975968,0.0010560486,0.0003507818,0.00035103582,0.00029442436,0.00035081842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004889094,0.0003195705,0.00025810287,0.0015492565,0.0017301299,0.0018726179,0.0009436265,0.00073200726,0.015512347],"category_scores_gemma":[0.0027142598,0.00032096097,0.00030301444,0.00094236236,0.0014910409,0.0013369279,0.00089374115,0.0009174398,0.0015111609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063082646,0.00007625866,0.0038981666,0.00015786415,0.000037168375,0.00032224733,0.00063058437,0.01822866,0.017023547,0.92330927,0.017915023,0.017770352],"study_design_scores_gemma":[0.00016817676,0.00009419244,0.008211957,0.00010186243,0.00006898953,0.00077216956,0.00083886064,0.10107732,0.0129723465,0.8453252,0.030294,0.000074893505],"about_ca_topic_score_codex":0.006262761,"about_ca_topic_score_gemma":0.008388474,"teacher_disagreement_score":0.015512347,"about_ca_system_score_codex":0.0014401089,"about_ca_system_score_gemma":0.00088131975,"threshold_uncertainty_score":0.05189395},"labels":[],"label_agreement":null},{"id":"W2403321548","doi":"","title":"Maximum degree of 3-independent vertices and group connectivity.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Combinatorics; Group (periodic table); Physics; Quantum mechanics","score_opus":0.033559432396082875,"score_gpt":0.24326285946784204,"score_spread":0.20970342707175915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403321548","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6947032,0.002641007,0.11329626,0.004170491,0.00036553296,0.000112403046,0.002953561,0.00032628496,0.18143119],"genre_scores_gemma":[0.9789979,0.0011032257,0.010617119,0.0001798483,0.00018732072,0.000069737645,0.00065751094,0.000047500194,0.0081398925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995882,0.000100841884,0.000019924304,0.00009957784,0.000083316714,0.00010821459],"domain_scores_gemma":[0.9969199,0.0017242295,0.0005515459,0.00023070662,0.0002160171,0.00035757016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046300635,0.0004105322,0.00045485908,0.0015033245,0.0009577898,0.0015615365,0.00090162375,0.0008938131,0.008802011],"category_scores_gemma":[0.003989492,0.00032138996,0.0004751699,0.0013672189,0.0014914655,0.0025720163,0.001170495,0.0011181798,0.0010889693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046838558,0.00010991704,0.005420326,0.00038309663,0.00008126779,0.00064027373,0.0007903803,0.01492915,0.010506694,0.90639955,0.015583162,0.044687912],"study_design_scores_gemma":[0.000046933816,0.00004632376,0.0038290708,0.00007251782,0.000046593406,0.0009157303,0.00034157795,0.016144728,0.003142769,0.96312886,0.012259005,0.000025982175],"about_ca_topic_score_codex":0.000589352,"about_ca_topic_score_gemma":0.00093504676,"teacher_disagreement_score":0.008802011,"about_ca_system_score_codex":0.0005744871,"about_ca_system_score_gemma":0.0003389368,"threshold_uncertainty_score":0.029445589},"labels":[],"label_agreement":null},{"id":"W2403346498","doi":"","title":"On Potentially C 2, 6 -graphic Sequences.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.02254791586065287,"score_gpt":0.2603715939640396,"score_spread":0.23782367810338673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403346498","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2655075,0.0023413338,0.39929643,0.0015751484,0.0011768896,0.00021845047,0.0017997646,0.0021998917,0.32588473],"genre_scores_gemma":[0.71440136,0.0015351796,0.1231001,0.0007173954,0.00036489067,0.00020452164,0.0023261704,0.0007746902,0.15657566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919325,0.00014712405,0.000053715987,0.00013706567,0.0002681313,0.00020067462],"domain_scores_gemma":[0.9987907,0.00047181704,0.00015243074,0.0001728608,0.00024799615,0.00016429121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043294564,0.0010607591,0.00053633825,0.0027000462,0.0014421412,0.0030237194,0.0007474433,0.0010433482,0.03045095],"category_scores_gemma":[0.0033833683,0.0004338275,0.000574255,0.0020699785,0.0012951518,0.0030090658,0.0020984185,0.0014915059,0.00781948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043501274,0.00007497596,0.0007947483,0.00029655118,0.000027447892,0.00094390125,0.00052325334,0.007107767,0.011952547,0.86891323,0.016735308,0.092195235],"study_design_scores_gemma":[0.000049741542,0.000115922,0.00105388,0.00018008056,0.00002358087,0.0010725495,0.00034351562,0.027665753,0.011718614,0.88501394,0.072689176,0.00007319725],"about_ca_topic_score_codex":0.0013539413,"about_ca_topic_score_gemma":0.003139933,"teacher_disagreement_score":0.03045095,"about_ca_system_score_codex":0.00095860637,"about_ca_system_score_gemma":0.0006597922,"threshold_uncertainty_score":0.10186857},"labels":[],"label_agreement":null},{"id":"W2403346694","doi":"","title":"Skewness, splitting number and vertex deletion of some toroidal meshes.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Skewness; Vertex (graph theory); Toroid; Polygon mesh; Combinatorics; Geometry; Statistics; Physics; Plasma; Quantum mechanics","score_opus":0.01008359434466397,"score_gpt":0.26936116564442564,"score_spread":0.25927757129976164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403346694","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93756366,0.00025804536,0.036132053,0.00041857536,0.00009973898,0.000028774508,0.0005510642,0.00018051061,0.024767645],"genre_scores_gemma":[0.9877872,0.00016026456,0.0074098445,0.00004172474,0.000039406357,0.000025453577,0.0004063157,0.000043370852,0.0040863524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974114,0.00005020282,0.000014205382,0.000042501066,0.000074702395,0.000077188524],"domain_scores_gemma":[0.99829954,0.00064733956,0.0003463185,0.0001791793,0.0001955623,0.00033212127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003427459,0.00029709245,0.0003799633,0.0013342281,0.0011314313,0.0012949253,0.0006707697,0.00050529133,0.005236211],"category_scores_gemma":[0.0030646415,0.00021779761,0.0003222389,0.0010121476,0.0012698005,0.0015002205,0.0009739292,0.0007744705,0.00053731503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008880509,0.000088487264,0.008250906,0.00013028772,0.00004350707,0.0011063995,0.0009234189,0.026960153,0.02227477,0.89152044,0.006397303,0.04141635],"study_design_scores_gemma":[0.00007230121,0.00010734627,0.00636975,0.00004620936,0.000047079615,0.0012989128,0.0013365907,0.09270131,0.010306323,0.8797544,0.007913981,0.000045810073],"about_ca_topic_score_codex":0.00077998196,"about_ca_topic_score_gemma":0.000934593,"teacher_disagreement_score":0.005236211,"about_ca_system_score_codex":0.00069414737,"about_ca_system_score_gemma":0.0003488684,"threshold_uncertainty_score":0.017516851},"labels":[],"label_agreement":null},{"id":"W2403383766","doi":"","title":"A note on the charaterization of potentially K 1, 1, s -graphic sequences.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arithmetic","score_opus":0.01257930895811831,"score_gpt":0.2459077578593007,"score_spread":0.23332844890118237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403383766","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044450376,0.006695689,0.36170045,0.010192244,0.010263679,0.00015026041,0.0010064758,0.0015866896,0.5639541],"genre_scores_gemma":[0.57051855,0.0072812205,0.2546073,0.006261523,0.0051562204,0.0003323282,0.0012765637,0.0012818889,0.15328446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999276,0.00017553884,0.000055311335,0.00014227489,0.00023673223,0.00011420568],"domain_scores_gemma":[0.9976986,0.0011892241,0.00013225224,0.00044909166,0.00027380444,0.0002569972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089640915,0.0009406789,0.00078291784,0.0022504774,0.0028604944,0.0037516337,0.0014218722,0.0011613003,0.023326272],"category_scores_gemma":[0.0060420125,0.00043725292,0.0010350854,0.0021367783,0.0037401398,0.005372614,0.0036137118,0.004959331,0.004407618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008312842,0.000016019394,0.00015985128,0.00011500925,0.000007669781,0.00021808816,0.0001925137,0.00058691564,0.0014466067,0.9571784,0.017053826,0.022941984],"study_design_scores_gemma":[0.000011930713,0.000036427817,0.00020560266,0.00005341205,0.000010487719,0.0005313864,0.00007445412,0.002025747,0.0013610823,0.9311792,0.064478844,0.000031547963],"about_ca_topic_score_codex":0.0011010184,"about_ca_topic_score_gemma":0.0018853634,"teacher_disagreement_score":0.023326272,"about_ca_system_score_codex":0.0010318033,"about_ca_system_score_gemma":0.00086100446,"threshold_uncertainty_score":0.07803416},"labels":[],"label_agreement":null},{"id":"W2403401446","doi":"","title":"Some Transformations For The Well-Poised 7 F 6 (1)-series.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Series (stratigraphy); Mathematics; Geology","score_opus":0.01796812643970927,"score_gpt":0.2537781518770129,"score_spread":0.23581002543730364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403401446","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15166076,0.0029856612,0.09042606,0.0037767047,0.00229366,0.00012030039,0.0005727892,0.00064101955,0.7475231],"genre_scores_gemma":[0.79035145,0.0020600527,0.03794641,0.0012483428,0.0013296255,0.00016455159,0.00049859646,0.0005128228,0.16588816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958867,0.00010549646,0.000017495562,0.00006110513,0.00015065608,0.00007665017],"domain_scores_gemma":[0.9997098,0.000076838194,0.00004120268,0.000043406417,0.00005892029,0.00006980775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005819283,0.00066677254,0.00038749995,0.0020964604,0.0017676777,0.002464065,0.00070208474,0.0009524227,0.016633531],"category_scores_gemma":[0.0015869854,0.0002810235,0.0007032339,0.000938256,0.0022945746,0.0030250666,0.0013132247,0.0026998983,0.0038015589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011130835,0.000009113932,0.00004064635,0.000012428907,0.0000019410938,0.000060223596,0.00009775478,0.00018021828,0.00045151415,0.9917989,0.0021922202,0.0051439833],"study_design_scores_gemma":[0.000012029542,0.000012571962,0.000176367,0.000015769043,0.000003704054,0.00017264512,0.000085674765,0.0011594262,0.00052031205,0.9836659,0.014164787,0.000010870086],"about_ca_topic_score_codex":0.00062430307,"about_ca_topic_score_gemma":0.00088198506,"teacher_disagreement_score":0.016633531,"about_ca_system_score_codex":0.0011589299,"about_ca_system_score_gemma":0.00042609393,"threshold_uncertainty_score":0.05564475},"labels":[],"label_agreement":null},{"id":"W2403402995","doi":"","title":"Canonical form of the universal circuits matrix of feedback functions.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Matrix (chemical analysis); Electronic circuit; Pure mathematics; Algebra over a field; Canonical form; Arithmetic; Electrical engineering; Engineering","score_opus":0.009725310863182264,"score_gpt":0.23028933948091806,"score_spread":0.2205640286177358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403402995","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10644539,0.0016738527,0.6094672,0.002469035,0.001318388,0.00024785983,0.0026831825,0.0012717507,0.27442324],"genre_scores_gemma":[0.8533184,0.00097410794,0.062246308,0.0010021094,0.0007802293,0.0003188295,0.0010783615,0.0005741025,0.07970755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927753,0.00013476826,0.00003061279,0.000208279,0.00020089625,0.00014792675],"domain_scores_gemma":[0.99927205,0.00013323034,0.000095399024,0.00010040289,0.00026721074,0.0001317142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004167149,0.00087469054,0.0006977009,0.001590773,0.00092349155,0.0026737042,0.0012180123,0.0010773102,0.033333935],"category_scores_gemma":[0.0024604427,0.00035519354,0.0005518813,0.0007293493,0.0016254134,0.0028844583,0.0012223829,0.0017212804,0.0049646636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021389056,0.000016467577,0.00008900836,0.000034645633,0.000008938618,0.000052520496,0.00005039732,0.0009995018,0.0013070295,0.9846309,0.004503501,0.008285818],"study_design_scores_gemma":[0.00001727515,0.000026733627,0.00022164699,0.000020995274,0.000010227138,0.00021296543,0.00006765256,0.013589605,0.001302552,0.9713675,0.013139091,0.000023815344],"about_ca_topic_score_codex":0.0010598333,"about_ca_topic_score_gemma":0.0018814943,"teacher_disagreement_score":0.033333935,"about_ca_system_score_codex":0.0009443194,"about_ca_system_score_gemma":0.00079545926,"threshold_uncertainty_score":0.11151308},"labels":[],"label_agreement":null},{"id":"W2403434303","doi":"","title":"Chromatic Uniqueness of A Family of K 4 -Homeomorphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Fuzzy and Soft Set Theory","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Uniqueness; Chromatic scale; Mathematics; Combinatorics; Mathematical analysis","score_opus":0.07488187791486947,"score_gpt":0.34663069850399303,"score_spread":0.27174882058912353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403434303","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7654704,0.0009677013,0.081000924,0.0010846731,0.00019611011,0.000064583466,0.00061938935,0.00024190145,0.15035431],"genre_scores_gemma":[0.9616374,0.00027831626,0.017144108,0.00016353976,0.00006894463,0.00004126006,0.00040200382,0.000075768614,0.02018877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994808,0.00009827837,0.000032207998,0.0001573137,0.000107729626,0.0001238313],"domain_scores_gemma":[0.998928,0.00040871755,0.00018401729,0.00013308656,0.00014136692,0.00020486857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006214816,0.00037509354,0.00067127077,0.0023790991,0.003090253,0.0035738696,0.00083655806,0.0010737348,0.010875212],"category_scores_gemma":[0.0019747298,0.0005371942,0.0009396014,0.0012208167,0.0030547974,0.0028165341,0.0022596137,0.0015390554,0.0008218032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009311934,0.000019346451,0.0012506223,0.00004132485,0.000024000134,0.00022314151,0.00030128285,0.000954076,0.0014691837,0.9875159,0.0016262814,0.006481625],"study_design_scores_gemma":[0.00005757475,0.000056409543,0.0024873505,0.000049526487,0.000040078707,0.0010446989,0.00076025573,0.005977811,0.0014245907,0.97260094,0.015453901,0.000046940128],"about_ca_topic_score_codex":0.0016019867,"about_ca_topic_score_gemma":0.0015498844,"teacher_disagreement_score":0.010875212,"about_ca_system_score_codex":0.001506515,"about_ca_system_score_gemma":0.0006064328,"threshold_uncertainty_score":0.036381245},"labels":[],"label_agreement":null},{"id":"W2403442490","doi":"","title":"On the signless Laplacian spectral radius of digraphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; Combinatorics; Physics; Eigenvalues and eigenvectors; Quantum mechanics","score_opus":0.019904453225804947,"score_gpt":0.25328674069135465,"score_spread":0.2333822874655497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403442490","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5087982,0.009051115,0.2792707,0.006609505,0.0009127695,0.00007925217,0.0009220588,0.0007957829,0.1935606],"genre_scores_gemma":[0.9682552,0.0023800281,0.017639862,0.000677224,0.0006115849,0.000088963316,0.00029082008,0.00018850766,0.009867681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991103,0.00038243667,0.000037293306,0.00014398468,0.00020049975,0.00012554183],"domain_scores_gemma":[0.99346113,0.0041317157,0.00071461103,0.00042084762,0.0005011019,0.0007706392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011962815,0.0006851671,0.0008297351,0.00335078,0.0012042576,0.0023163348,0.0013552267,0.001427663,0.0059402417],"category_scores_gemma":[0.012676617,0.00040914954,0.00032911848,0.0014897621,0.0029782576,0.0047666775,0.002058198,0.0017645302,0.0013268467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004342916,0.000022217988,0.0004385203,0.000068560534,0.000010255066,0.00006087192,0.00015615596,0.0031160284,0.0009893788,0.98301125,0.004263879,0.007819494],"study_design_scores_gemma":[0.000012198175,0.000016915053,0.0004503256,0.00003211891,0.000009273105,0.000153463,0.00011464881,0.01831698,0.00034717715,0.977991,0.0025402,0.000015819129],"about_ca_topic_score_codex":0.00076881,"about_ca_topic_score_gemma":0.00079498795,"teacher_disagreement_score":0.0059402417,"about_ca_system_score_codex":0.0011566888,"about_ca_system_score_gemma":0.00039918153,"threshold_uncertainty_score":0.01987207},"labels":[],"label_agreement":null},{"id":"W2403450736","doi":"","title":"An Inequality on Laplacian Eigenvalues of Connected Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Inequality; Laplace operator; Laplacian matrix; Pure mathematics; Combinatorics; Mathematical analysis","score_opus":0.04934705980718329,"score_gpt":0.3339834472392321,"score_spread":0.28463638743204883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403450736","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2159769,0.0067922,0.33585623,0.012708035,0.0020655387,0.000068884285,0.0012816429,0.0006112403,0.4246393],"genre_scores_gemma":[0.9455058,0.0021774822,0.022962766,0.0015792451,0.001168037,0.00011611522,0.00046892485,0.00024422762,0.025777403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914587,0.00025681398,0.000027597649,0.00015185369,0.0002965757,0.00012122059],"domain_scores_gemma":[0.995407,0.003125607,0.00026502923,0.00027913094,0.0005563838,0.00036689354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008530961,0.00061840593,0.0005756244,0.002170748,0.00094918365,0.0015150829,0.0010443466,0.0012261822,0.013238473],"category_scores_gemma":[0.008083963,0.00024779548,0.00041590078,0.0013361598,0.0020129948,0.003446117,0.001992211,0.0023410388,0.001744991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057934358,0.000032016273,0.0006527824,0.00012013428,0.000017082642,0.00023132341,0.00026506593,0.0019214172,0.004820581,0.9646529,0.01182039,0.015408345],"study_design_scores_gemma":[0.00001519945,0.000020729489,0.0014396611,0.000055175507,0.000013320969,0.00025937092,0.00015845413,0.025213012,0.0008627964,0.9667467,0.005197518,0.00001801406],"about_ca_topic_score_codex":0.0009632518,"about_ca_topic_score_gemma":0.0013009723,"teacher_disagreement_score":0.013238473,"about_ca_system_score_codex":0.0008202424,"about_ca_system_score_gemma":0.00028127947,"threshold_uncertainty_score":0.044287086},"labels":[],"label_agreement":null},{"id":"W2403453367","doi":"","title":"Book Embeddings And Zero Divisors.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Library Science and Administration","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Zero (linguistics); Zero divisor; Pure mathematics; Linguistics; Philosophy","score_opus":0.01118780654017433,"score_gpt":0.2735439400316468,"score_spread":0.26235613349147247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403453367","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07954343,0.0075834966,0.044443645,0.009367409,0.0009051841,0.00002515826,0.0007928178,0.00029981224,0.85703903],"genre_scores_gemma":[0.8308421,0.0029068443,0.008871526,0.00062275183,0.00066096586,0.000033600307,0.0007228514,0.00017068625,0.15516868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898547,0.00038004437,0.000067524816,0.00020039463,0.00020845536,0.00015809853],"domain_scores_gemma":[0.9974746,0.0010004701,0.00031259327,0.00040165073,0.00040767205,0.00040303456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006790998,0.00036014325,0.00050839776,0.002623343,0.0025228923,0.0053513288,0.0005538566,0.0009242165,0.038299136],"category_scores_gemma":[0.0049116057,0.00039192574,0.00043406885,0.0029727437,0.003945008,0.011220453,0.00352337,0.002082177,0.0051284004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008236159,0.0000056983545,0.00013836865,0.000015762136,0.0000024533106,0.00001680436,0.00017268407,0.0000471059,0.000029843777,0.9909107,0.003652483,0.0049999286],"study_design_scores_gemma":[0.0000062343197,0.000004957254,0.00031037568,0.00002312638,0.000004722956,0.00010454785,0.00035523696,0.0002182968,0.000099069286,0.9609455,0.037923276,0.00000458391],"about_ca_topic_score_codex":0.00128605,"about_ca_topic_score_gemma":0.0017692981,"teacher_disagreement_score":0.038299136,"about_ca_system_score_codex":0.0016956313,"about_ca_system_score_gemma":0.0005436619,"threshold_uncertainty_score":0.1281234},"labels":[],"label_agreement":null},{"id":"W2403458251","doi":"","title":"Supergraphs And Graphical Complexity Of Permutation Groups.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Permutation (music); Permutation group; Combinatorics","score_opus":0.043855397309992855,"score_gpt":0.27886234143306055,"score_spread":0.2350069441230677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403458251","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6294367,0.0059779054,0.18169269,0.01246606,0.00035780258,0.000096564094,0.0017515166,0.0004963371,0.16772446],"genre_scores_gemma":[0.97153354,0.0018219881,0.014489907,0.00053197396,0.00040653217,0.000086886845,0.00082955585,0.00007260007,0.010227097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897003,0.00036059384,0.00003994593,0.00019414224,0.00027393436,0.00016143071],"domain_scores_gemma":[0.99211097,0.0057016104,0.00075323257,0.00057691935,0.00032798768,0.00052922085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007654965,0.0004373065,0.0006790775,0.0017995026,0.0011020278,0.0026952585,0.0011634213,0.0011606623,0.013326541],"category_scores_gemma":[0.0057285675,0.00038275064,0.00069365505,0.0017909067,0.0022891946,0.0067175436,0.0016042565,0.0024270285,0.0009610101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051649076,0.00004730509,0.0012710429,0.00008913137,0.000021275175,0.00008536487,0.00036933957,0.004555862,0.0007707864,0.97388667,0.005167978,0.013683759],"study_design_scores_gemma":[0.0000072485664,0.0000061976334,0.00047590514,0.000009228256,0.0000061812766,0.00006266071,0.00007813444,0.006204192,0.00011708181,0.9911573,0.0018710111,0.000005010397],"about_ca_topic_score_codex":0.0011387304,"about_ca_topic_score_gemma":0.0017898721,"teacher_disagreement_score":0.013326541,"about_ca_system_score_codex":0.0013515597,"about_ca_system_score_gemma":0.00058845896,"threshold_uncertainty_score":0.04458177},"labels":[],"label_agreement":null},{"id":"W2403495415","doi":"","title":"cλ-optimally connected mixed Cayley graph.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cayley graph; Mathematics; Combinatorics; Vertex-transitive graph; Cayley transform; Mixed graph; Cayley's theorem; Graph; Voltage graph; Line graph","score_opus":0.02306755692736293,"score_gpt":0.23393902127162738,"score_spread":0.21087146434426446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403495415","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47071457,0.0011517184,0.23414193,0.003880228,0.0005452996,0.00036960564,0.006974639,0.0014552796,0.28076667],"genre_scores_gemma":[0.85917085,0.00057272747,0.07981133,0.0011597256,0.000112658534,0.00025051492,0.0036404985,0.0002439533,0.05503779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967396,0.00008314669,0.00001377665,0.000085613676,0.0000657661,0.00007763647],"domain_scores_gemma":[0.9989002,0.0003995844,0.00013933405,0.00015468993,0.00022922622,0.00017701037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024235321,0.0006818807,0.00046482435,0.00084696634,0.0009924959,0.0017601303,0.0009815505,0.0012476376,0.022839598],"category_scores_gemma":[0.002179879,0.00042307493,0.00032637728,0.0008226207,0.0006197616,0.0017344756,0.00079062884,0.0013024502,0.0026642075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050009903,0.0002168954,0.0014452145,0.0006178551,0.00012800697,0.00047734805,0.00013256185,0.030492425,0.017987687,0.83090574,0.06301746,0.054078758],"study_design_scores_gemma":[0.00013455814,0.00011953453,0.0019862966,0.00010560521,0.00009432587,0.0006782576,0.00027533126,0.145585,0.008027635,0.8112849,0.031658392,0.000050167662],"about_ca_topic_score_codex":0.0018578334,"about_ca_topic_score_gemma":0.0048241923,"teacher_disagreement_score":0.022839598,"about_ca_system_score_codex":0.0010151955,"about_ca_system_score_gemma":0.0009660914,"threshold_uncertainty_score":0.07640612},"labels":[],"label_agreement":null},{"id":"W2403512408","doi":"","title":"The extremal fully loaded graphs with respect to Merrifield-Simmons index.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Combinatorics; Discrete mathematics; Computer science","score_opus":0.041253746329207336,"score_gpt":0.2898768608766027,"score_spread":0.24862311454739536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403512408","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5900436,0.0008135129,0.06342735,0.0028186375,0.0004622572,0.00010087655,0.001245313,0.00097470754,0.3401137],"genre_scores_gemma":[0.9615891,0.00036461808,0.010049635,0.0004289964,0.0003268858,0.00008189418,0.00059191143,0.0002645226,0.026302341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927694,0.0001673322,0.000028222204,0.00014162617,0.00020801547,0.0001779096],"domain_scores_gemma":[0.9978356,0.0005861579,0.00042315264,0.000344549,0.0003269406,0.0004835925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007833548,0.0006219966,0.0006511246,0.0034323495,0.0024453506,0.0036545887,0.0013581611,0.0016394882,0.017775526],"category_scores_gemma":[0.0047129043,0.0004332433,0.00046459088,0.0012082821,0.0022709083,0.004526719,0.002244449,0.001916345,0.0026197946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010349876,0.000023160324,0.00033076043,0.000033279157,0.000008631952,0.00012653136,0.00014668966,0.00086564943,0.0014543032,0.9865643,0.0036601736,0.006683042],"study_design_scores_gemma":[0.000027560563,0.000023226808,0.00070685527,0.000029079898,0.0000100346215,0.00030160477,0.0001675646,0.00618367,0.0012016108,0.986852,0.0044745174,0.000022247055],"about_ca_topic_score_codex":0.0007659358,"about_ca_topic_score_gemma":0.0010682325,"teacher_disagreement_score":0.017775526,"about_ca_system_score_codex":0.0010742239,"about_ca_system_score_gemma":0.0005919924,"threshold_uncertainty_score":0.05946511},"labels":[],"label_agreement":null},{"id":"W2403544395","doi":"","title":"A note on graphs containing all trees of a given size.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.01628100681929117,"score_gpt":0.29396104742290224,"score_spread":0.27768004060361107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403544395","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025743755,0.07027813,0.30675998,0.07524858,0.076189004,0.00024712257,0.0063380534,0.0042305603,0.43496487],"genre_scores_gemma":[0.25470388,0.07853149,0.32700494,0.028878069,0.06783481,0.0004677468,0.0058881207,0.0049038716,0.23178709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921036,0.00017964457,0.000069072485,0.00025096553,0.0001994887,0.000090415866],"domain_scores_gemma":[0.9948171,0.003091183,0.00017014677,0.0011189012,0.0005428396,0.00025987794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012566844,0.0011049022,0.00116456,0.0013876891,0.003044746,0.0020711767,0.0020351356,0.0012643683,0.010224205],"category_scores_gemma":[0.005764568,0.0006840951,0.0014947476,0.0024951927,0.0028864406,0.009005041,0.002190237,0.0058163134,0.0052624694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034240625,0.00008661812,0.0008286887,0.0008567911,0.0000761107,0.00071471126,0.00038197995,0.002204655,0.006051327,0.44717076,0.40368,0.13760588],"study_design_scores_gemma":[0.00001900652,0.00007484769,0.0013840904,0.00020273631,0.00007266459,0.0010491894,0.00017275894,0.0014024919,0.0026142867,0.51677114,0.476194,0.00004285686],"about_ca_topic_score_codex":0.0030045458,"about_ca_topic_score_gemma":0.006681015,"teacher_disagreement_score":0.010224205,"about_ca_system_score_codex":0.001343014,"about_ca_system_score_gemma":0.00088787806,"threshold_uncertainty_score":0.03420335},"labels":[],"label_agreement":null},{"id":"W2403552696","doi":"","title":"On The Cyclomatic Number Of Linear Hypergraphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cyclomatic complexity; Discrete mathematics; Computer science; Programming language; Software","score_opus":0.007735980619098375,"score_gpt":0.21010511163555218,"score_spread":0.2023691310164538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403552696","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3057545,0.0071171937,0.1606133,0.017250348,0.001765126,0.00012221279,0.0017717702,0.0005011173,0.5051043],"genre_scores_gemma":[0.9537963,0.0024526662,0.016130054,0.0012455523,0.0015815785,0.00018811125,0.00043203845,0.000118843665,0.024054876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989079,0.0003655393,0.000038263115,0.00021533218,0.0002754117,0.00019759276],"domain_scores_gemma":[0.99187136,0.0060168607,0.00061631575,0.0005317198,0.0004086561,0.00055518583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011200064,0.00057145295,0.00065530493,0.0033950647,0.0016155381,0.0034765005,0.00107727,0.0013065876,0.016910324],"category_scores_gemma":[0.009533299,0.0004740748,0.000406645,0.002192464,0.003237829,0.0061975224,0.0017087513,0.002957948,0.0014368992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004864265,0.00001581016,0.0003011833,0.000048842627,0.000006963436,0.00003185828,0.000075056225,0.0020357026,0.00035039548,0.98693824,0.0040750485,0.0060723233],"study_design_scores_gemma":[0.00001793828,0.000012972835,0.00032909663,0.000035764395,0.000007574779,0.000107465385,0.00004866273,0.007880766,0.00035605129,0.9864703,0.0047222897,0.000011107052],"about_ca_topic_score_codex":0.0009598502,"about_ca_topic_score_gemma":0.0013756446,"teacher_disagreement_score":0.016910324,"about_ca_system_score_codex":0.0022570987,"about_ca_system_score_gemma":0.00084842433,"threshold_uncertainty_score":0.05657065},"labels":[],"label_agreement":null},{"id":"W2403566370","doi":"","title":"On Self-Clique Graphs all of whose Cliques have Equal Size.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Clique; Mathematics; Clique-sum; Combinatorics; Chordal graph; Graph; 1-planar graph","score_opus":0.014987467703344,"score_gpt":0.26678409195421765,"score_spread":0.2517966242508736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403566370","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4444089,0.0022052063,0.3573786,0.003989027,0.00041946492,0.00029466132,0.004171945,0.0011706826,0.18596151],"genre_scores_gemma":[0.88035715,0.0013672268,0.067595236,0.00094507675,0.0006367768,0.0002660548,0.0033818623,0.00043950987,0.04501113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985274,0.00042674682,0.00006692616,0.00038099932,0.00030621557,0.0002916804],"domain_scores_gemma":[0.9940195,0.0034090583,0.0007080544,0.00090642227,0.0004464491,0.00051055447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010984521,0.0005322202,0.00071375456,0.0025681842,0.002304749,0.0023888894,0.0013705975,0.0011278931,0.012967212],"category_scores_gemma":[0.0052818926,0.00046721354,0.0009407569,0.0021711562,0.002142094,0.0076040085,0.0021258197,0.0013726216,0.0013456995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000160503,0.00008453276,0.0014474773,0.0002023927,0.00006320346,0.00027193336,0.00040194628,0.004745937,0.0029245352,0.962665,0.010445828,0.016586557],"study_design_scores_gemma":[0.000025525425,0.0000142178,0.000987418,0.000029207273,0.000027078391,0.00028590162,0.00016372683,0.013072064,0.0009021144,0.97712266,0.007356712,0.000013410247],"about_ca_topic_score_codex":0.0016712428,"about_ca_topic_score_gemma":0.0033275129,"teacher_disagreement_score":0.012967212,"about_ca_system_score_codex":0.0013478448,"about_ca_system_score_gemma":0.00051177153,"threshold_uncertainty_score":0.043379605},"labels":[],"label_agreement":null},{"id":"W2403587392","doi":"","title":"On (k, t)-choosability of graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; List coloring; Mathematics; Vertex (graph theory); Graph; Fractional coloring; Graph coloring; Complete coloring; Planar graph; Brooks' theorem; Edge coloring; Discrete mathematics; Chordal graph; 1-planar graph; Graph power; Line graph","score_opus":0.030211719015776954,"score_gpt":0.2773091559090248,"score_spread":0.2470974368932478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403587392","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23897019,0.0053815846,0.652842,0.0036439432,0.0008453889,0.0006556108,0.0030947353,0.0011156608,0.09345093],"genre_scores_gemma":[0.76079655,0.010312258,0.18189639,0.0027236608,0.0032795675,0.0016802597,0.0044910284,0.0008936362,0.033926647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99734783,0.0005614293,0.00020990857,0.0009954316,0.00042075486,0.00046451134],"domain_scores_gemma":[0.9919436,0.0053032404,0.0009843917,0.0009308925,0.00034608805,0.0004917733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00159291,0.0022373644,0.0013538362,0.0022668778,0.0024927077,0.0026731675,0.001907692,0.002847752,0.012898931],"category_scores_gemma":[0.008154301,0.0012209783,0.002468664,0.0051303036,0.005949921,0.010874719,0.0037586063,0.0047545116,0.0019838344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068852666,0.00019624263,0.0026776914,0.0006154639,0.00011383449,0.0008460382,0.0010752666,0.04626296,0.0070732594,0.8646993,0.008806046,0.06694528],"study_design_scores_gemma":[0.00009058122,0.0002472361,0.0010896302,0.00006947514,0.00004305126,0.00068939285,0.00013225258,0.03504775,0.0016789201,0.95231634,0.008531487,0.00006385882],"about_ca_topic_score_codex":0.002301312,"about_ca_topic_score_gemma":0.001506186,"teacher_disagreement_score":0.012898931,"about_ca_system_score_codex":0.0028796897,"about_ca_system_score_gemma":0.0010671497,"threshold_uncertainty_score":0.0431512},"labels":[],"label_agreement":null},{"id":"W2403588483","doi":"","title":"λ'-optimal regular graphs with two orbits.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.015965427051903538,"score_gpt":0.2299600730696368,"score_spread":0.21399464601773327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403588483","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.606055,0.0009795387,0.14417316,0.0058928183,0.000384695,0.00013443813,0.004109111,0.0016588651,0.2366124],"genre_scores_gemma":[0.88380784,0.00044668416,0.07744468,0.00081028184,0.000108616834,0.00011393948,0.0021516914,0.00031792524,0.034798373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952185,0.000111829075,0.00002381294,0.00012506216,0.000079562145,0.00013790044],"domain_scores_gemma":[0.99789435,0.0010711893,0.0002649044,0.0003222394,0.00015122573,0.0002961706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051512744,0.0004313138,0.00045720916,0.0007790453,0.001389026,0.0022879776,0.0010796192,0.0011180014,0.013307632],"category_scores_gemma":[0.0029565503,0.00048526845,0.0005154718,0.0008256237,0.0012750438,0.0032050416,0.0013485824,0.0014041228,0.0015291236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035300647,0.00012635614,0.0013032635,0.00019877094,0.000028357117,0.00012833165,0.00021658743,0.0066484157,0.004213995,0.9384729,0.021569503,0.026740493],"study_design_scores_gemma":[0.000064491105,0.000029711506,0.0009838133,0.000050886,0.000023449486,0.00020192824,0.00030524467,0.017443564,0.002469102,0.96597844,0.012432533,0.000016756947],"about_ca_topic_score_codex":0.0014367214,"about_ca_topic_score_gemma":0.0022131326,"teacher_disagreement_score":0.013307632,"about_ca_system_score_codex":0.0014257642,"about_ca_system_score_gemma":0.0008070559,"threshold_uncertainty_score":0.04451847},"labels":[],"label_agreement":null},{"id":"W2403590840","doi":"","title":"Quasi-tree graphs with the largest and the second largest numbers of maximum independent sets.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Tree (set theory); Combinatorics; Discrete mathematics","score_opus":0.007807377460355607,"score_gpt":0.23400131493171958,"score_spread":0.22619393747136396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403590840","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4761719,0.0040939213,0.386387,0.0057768375,0.000950107,0.00018048416,0.0072113783,0.001196714,0.11803169],"genre_scores_gemma":[0.87531173,0.0010385826,0.10254256,0.0008510646,0.0004584667,0.00017884935,0.002268708,0.00025747356,0.017092451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993037,0.0002114886,0.000036296762,0.0001586772,0.00016070832,0.00012907319],"domain_scores_gemma":[0.9915583,0.0053014616,0.00091606454,0.0008020396,0.0006949877,0.0007271375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009552935,0.000388377,0.0005954618,0.001341655,0.0013138421,0.0025505,0.0009776698,0.0011319973,0.009103213],"category_scores_gemma":[0.007978339,0.00064284785,0.00069113827,0.0012600104,0.001321376,0.004538272,0.0009487735,0.0015446005,0.000937057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029794054,0.000057600653,0.0017645662,0.00019801821,0.00003792914,0.00021107252,0.00017252736,0.0038489434,0.007191878,0.95647675,0.012161644,0.017581161],"study_design_scores_gemma":[0.00006330519,0.000047769958,0.0031618583,0.000059133963,0.00005114344,0.0009575701,0.00015402958,0.020877343,0.0035564462,0.959582,0.011460019,0.000029370385],"about_ca_topic_score_codex":0.0007917873,"about_ca_topic_score_gemma":0.0017638954,"teacher_disagreement_score":0.009103213,"about_ca_system_score_codex":0.0010067961,"about_ca_system_score_gemma":0.0009043282,"threshold_uncertainty_score":0.030453265},"labels":[],"label_agreement":null},{"id":"W2403593319","doi":"","title":"Extending matchings in planar odd graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Planar; Planar graph; Graph; Computer science","score_opus":0.029042415767146314,"score_gpt":0.2952516997471866,"score_spread":0.2662092839800403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403593319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30874887,0.004175524,0.38548726,0.003104595,0.0011122766,0.0001969106,0.0009851377,0.0017867152,0.29440284],"genre_scores_gemma":[0.831605,0.0030572414,0.11901944,0.0009631199,0.0004901705,0.00010892361,0.0010591673,0.0004952382,0.043201704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993649,0.0001716155,0.000043440967,0.00016601058,0.00012315947,0.00013079336],"domain_scores_gemma":[0.9982514,0.0007286856,0.00021221314,0.00043448547,0.00017678629,0.00019646171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062245975,0.00050207844,0.0005120575,0.0014775672,0.001258215,0.0016672537,0.001018942,0.0009267026,0.009209313],"category_scores_gemma":[0.003981816,0.0004275858,0.0008957347,0.0017428801,0.0015573462,0.0058277203,0.0036832918,0.001851594,0.0019146258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071728035,0.000045140045,0.000553351,0.0001346062,0.000012659157,0.00018752794,0.000316456,0.0019207422,0.002287524,0.9440045,0.0037295525,0.046736296],"study_design_scores_gemma":[0.000011559846,0.000019198116,0.00021744972,0.000028763112,0.000015900216,0.00020564276,0.0001229096,0.0034908163,0.00078860665,0.9762449,0.018845577,0.000008683567],"about_ca_topic_score_codex":0.0012722525,"about_ca_topic_score_gemma":0.0015515272,"teacher_disagreement_score":0.009209313,"about_ca_system_score_codex":0.00083030737,"about_ca_system_score_gemma":0.0004341485,"threshold_uncertainty_score":0.03080821},"labels":[],"label_agreement":null},{"id":"W2403622411","doi":"","title":"A Result on Linear Arboricity of Planar Graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arboricity; Mathematics; Planar; Planar graph; Combinatorics; Graph; Computer science; Computer graphics (images)","score_opus":0.037354521562636245,"score_gpt":0.3021261858310823,"score_spread":0.26477166426844606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403622411","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22985226,0.0044415602,0.21004136,0.007022849,0.000772021,0.00010656923,0.0028702698,0.001194535,0.5436986],"genre_scores_gemma":[0.8918969,0.004725201,0.035105933,0.0023576475,0.001215788,0.00015077631,0.0037891457,0.00054961396,0.060208965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943405,0.00011327986,0.000025376725,0.00014967166,0.00015780686,0.00011967362],"domain_scores_gemma":[0.99470407,0.0037056818,0.00038013584,0.00042169195,0.0003800597,0.00040831344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000478844,0.0006899057,0.00056117243,0.0016460159,0.0011179359,0.0020577984,0.0011480522,0.0007295937,0.018519051],"category_scores_gemma":[0.0037848533,0.0004738981,0.00075395935,0.002342828,0.0016792343,0.0044184895,0.002157616,0.0028758761,0.0035138787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018958829,0.00012590052,0.0025158408,0.0005763242,0.00006357951,0.0005161886,0.00072673714,0.004773562,0.0059479307,0.91662145,0.026941016,0.04100188],"study_design_scores_gemma":[0.00004031071,0.000068440495,0.0015142295,0.000069650465,0.00007823137,0.0006739347,0.0003383544,0.0076284073,0.002653988,0.95943654,0.027477847,0.00002010873],"about_ca_topic_score_codex":0.0009582608,"about_ca_topic_score_gemma":0.0012857585,"teacher_disagreement_score":0.018519051,"about_ca_system_score_codex":0.0007757391,"about_ca_system_score_gemma":0.00034540892,"threshold_uncertainty_score":0.061952353},"labels":[],"label_agreement":null},{"id":"W2403657490","doi":"","title":"A generalization of Chu's identity.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"History and Theory of Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Generalization; Identity (music); Genealogy; Mathematical analysis; History; Art; Aesthetics","score_opus":0.025366571595435868,"score_gpt":0.288909693344135,"score_spread":0.26354312174869915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403657490","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017874584,0.004554853,0.16735037,0.0075131673,0.0023819713,0.000059387556,0.0006944662,0.0003722414,0.7991989],"genre_scores_gemma":[0.67142874,0.006892547,0.067964196,0.0053651263,0.0032105607,0.0002542742,0.0008854718,0.0005528525,0.24344622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919146,0.00019807152,0.00003896846,0.00019791159,0.00023460347,0.00013897914],"domain_scores_gemma":[0.99897975,0.00036881136,0.00006860905,0.0001944569,0.00028205512,0.00010641498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009230597,0.00037158217,0.000682011,0.0020642783,0.0027703096,0.002900462,0.00087310554,0.0010562848,0.019610481],"category_scores_gemma":[0.0029063635,0.00031317156,0.0008384842,0.00218052,0.0044388887,0.009562153,0.0037192446,0.003133988,0.0030965083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025479042,0.0000024488193,0.000042911826,0.00001340652,0.0000018391742,0.000013080281,0.0000774827,0.000030764015,0.0000445143,0.9936707,0.0031028937,0.0029973434],"study_design_scores_gemma":[0.0000048248244,0.0000054202387,0.00016936744,0.000019841125,0.00000467088,0.0001092822,0.0000978659,0.00050365477,0.00012869407,0.9510028,0.047947414,0.0000061845303],"about_ca_topic_score_codex":0.0036331117,"about_ca_topic_score_gemma":0.0036412317,"teacher_disagreement_score":0.019610481,"about_ca_system_score_codex":0.0020323193,"about_ca_system_score_gemma":0.0017173028,"threshold_uncertainty_score":0.065603614},"labels":[],"label_agreement":null},{"id":"W2403658863","doi":"","title":"Circumferences of 2-connected quasi-claw-free graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Claw; Mathematics; Combinatorics; Structural engineering; Engineering","score_opus":0.017842507082741984,"score_gpt":0.2738109842358083,"score_spread":0.2559684771530663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403658863","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78983754,0.0011412126,0.06829326,0.0007890616,0.00028998125,0.000103198276,0.0019265496,0.00094227877,0.13667694],"genre_scores_gemma":[0.95391876,0.000511636,0.020338792,0.00016095726,0.000092253234,0.000123716,0.0014053053,0.000181561,0.023267126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996333,0.00006944466,0.000022740543,0.00009563769,0.000101343925,0.00007758247],"domain_scores_gemma":[0.99842155,0.0005978446,0.00041269278,0.00013918933,0.00014175294,0.00028702873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020620805,0.00052968715,0.00034743853,0.0019970853,0.0011558171,0.0017784949,0.0009548036,0.00084091176,0.013887321],"category_scores_gemma":[0.0019138121,0.00049731205,0.00034194347,0.0011125358,0.001253744,0.0017264425,0.0013972883,0.00072543806,0.0017553103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005127347,0.00008225663,0.003923647,0.00044510918,0.00007032898,0.00151675,0.0011069045,0.010028911,0.02190312,0.90455824,0.013994393,0.041857626],"study_design_scores_gemma":[0.00016539497,0.00018930988,0.018923262,0.00019259463,0.00012835355,0.0028399138,0.001646392,0.036169633,0.016083585,0.8589144,0.064624876,0.00012231906],"about_ca_topic_score_codex":0.0015227282,"about_ca_topic_score_gemma":0.0018595257,"teacher_disagreement_score":0.013887321,"about_ca_system_score_codex":0.0005737055,"about_ca_system_score_gemma":0.00024619952,"threshold_uncertainty_score":0.046457708},"labels":[],"label_agreement":null},{"id":"W2403682178","doi":"","title":"Remarks on the complexity of signed k-independece on graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Signed graph; Combinatorics; Discrete mathematics; Graph","score_opus":0.05864324606427127,"score_gpt":0.26354740712568364,"score_spread":0.20490416106141238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403682178","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1223346,0.0053543877,0.27536634,0.10538216,0.0050291857,0.0002428465,0.0042896587,0.0018492035,0.48015156],"genre_scores_gemma":[0.8539632,0.004141432,0.06212906,0.015294115,0.0052501373,0.00045708538,0.0025230367,0.0007411803,0.055500742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966768,0.00071979355,0.00017910758,0.0007735743,0.001119801,0.00053100375],"domain_scores_gemma":[0.9715921,0.021878252,0.0009511646,0.0028187733,0.0016518331,0.0011078244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028695986,0.0013518841,0.0013341252,0.002243807,0.0026086434,0.0051450194,0.0038019505,0.003724845,0.0436339],"category_scores_gemma":[0.02103742,0.00062276894,0.0019702034,0.002549075,0.0058241906,0.019842172,0.0055654314,0.007909551,0.0038706758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001870136,0.00007712907,0.0009401641,0.00027844546,0.000036866033,0.00036307893,0.0003015521,0.0038974755,0.0009550628,0.95464957,0.027440256,0.010873411],"study_design_scores_gemma":[0.000016810434,0.000016669152,0.00044281254,0.000024420764,0.000010352569,0.0001307332,0.00009182401,0.002795154,0.00034817567,0.9901653,0.0059381016,0.000019703608],"about_ca_topic_score_codex":0.0023928643,"about_ca_topic_score_gemma":0.0023423398,"teacher_disagreement_score":0.0436339,"about_ca_system_score_codex":0.0021860723,"about_ca_system_score_gemma":0.0008971141,"threshold_uncertainty_score":0.14596999},"labels":[],"label_agreement":null},{"id":"W2403712848","doi":"","title":"Fault-free cycles passing through prescribed a linear forest in a hypercube with faulty edges.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hypercube; Mathematics; Fault (geology); Parallel computing; Combinatorics; Computer science; Geology; Seismology","score_opus":0.017898883464014633,"score_gpt":0.2353897501708932,"score_spread":0.21749086670687856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403712848","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87139565,0.0004191411,0.10869579,0.00045125023,0.000064679465,0.00007724444,0.0004641259,0.0004479575,0.017984042],"genre_scores_gemma":[0.9724534,0.0001708653,0.019731732,0.000050459545,0.000012260827,0.000042467458,0.00022378488,0.000042152,0.0072728437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998275,0.000042839205,0.0000131737215,0.000029257715,0.00003756525,0.000049553793],"domain_scores_gemma":[0.9990557,0.00040428655,0.00017955751,0.00010376067,0.00013955934,0.00011712311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020290105,0.00020104383,0.00021642784,0.0006874193,0.00092322106,0.0009035178,0.00058153045,0.00059797935,0.0038017083],"category_scores_gemma":[0.0015678619,0.0002373873,0.00022633681,0.0005639645,0.00059033977,0.0011381557,0.0005743207,0.00034867355,0.00042388737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014448776,0.00023072393,0.009136914,0.00046814836,0.00009868241,0.0028708074,0.00091656815,0.39749584,0.040956844,0.4708385,0.008807426,0.06673475],"study_design_scores_gemma":[0.000096722004,0.00019330562,0.0028265426,0.00007330877,0.000048849033,0.0006404844,0.000528212,0.6746712,0.014463791,0.3001809,0.006239961,0.000036689136],"about_ca_topic_score_codex":0.0053075864,"about_ca_topic_score_gemma":0.008007808,"teacher_disagreement_score":0.0053075864,"about_ca_system_score_codex":0.00073293067,"about_ca_system_score_gemma":0.0005237278,"threshold_uncertainty_score":0.012717962},"labels":[],"label_agreement":null},{"id":"W2403732233","doi":"","title":"Some new classes of upper embeddable graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.009877066417694036,"score_gpt":0.23151536188302987,"score_spread":0.22163829546533584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403732233","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26948658,0.003971166,0.31751433,0.0061223637,0.00078064256,0.00022355016,0.003410159,0.002114879,0.39637637],"genre_scores_gemma":[0.7910869,0.0026598412,0.11102529,0.0024654057,0.00092303474,0.00031175796,0.004558957,0.00080139906,0.086167455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907184,0.00016893753,0.000049544873,0.00026994906,0.00022173725,0.00021790183],"domain_scores_gemma":[0.9967667,0.0016456884,0.0003357004,0.0006096247,0.00020224226,0.00044008874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072326395,0.0006842783,0.0005882762,0.0023438458,0.0016207033,0.0048935073,0.0014748493,0.0013911532,0.019526418],"category_scores_gemma":[0.0040056333,0.0006161859,0.0008441878,0.00207469,0.0021084724,0.007014791,0.0026553897,0.0038066888,0.0019049965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004982809,0.00005461638,0.0005753544,0.000083407846,0.000007925282,0.0001410362,0.00025385158,0.0011609748,0.0010081629,0.9648492,0.009947615,0.021868112],"study_design_scores_gemma":[0.000020995361,0.000019039642,0.00076308154,0.00004902946,0.000014528174,0.0004277235,0.00023366744,0.006796908,0.0009950016,0.95848674,0.032177553,0.00001576465],"about_ca_topic_score_codex":0.00093354104,"about_ca_topic_score_gemma":0.0016884683,"teacher_disagreement_score":0.019526418,"about_ca_system_score_codex":0.001598419,"about_ca_system_score_gemma":0.00039839666,"threshold_uncertainty_score":0.0653224},"labels":[],"label_agreement":null},{"id":"W2403749856","doi":"","title":"The total number of matchings in triangle graph of a connected graph.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics","score_opus":0.01968312109272709,"score_gpt":0.29154948413963094,"score_spread":0.27186636304690387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403749856","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7295558,0.0020180007,0.15644553,0.0023501816,0.0006824306,0.0001800555,0.0067547522,0.0010153326,0.100997955],"genre_scores_gemma":[0.9175187,0.0013433396,0.049313437,0.00031143517,0.00030163073,0.00021685385,0.003066045,0.00037687414,0.027551819],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899346,0.00019463843,0.00007487853,0.00026529052,0.0002644161,0.00020733563],"domain_scores_gemma":[0.99441695,0.0028686505,0.00078408764,0.00065411214,0.0006301649,0.000646122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064518885,0.00051254703,0.00076079316,0.002360525,0.0013442066,0.0024733383,0.001888131,0.0013179327,0.019800914],"category_scores_gemma":[0.007236202,0.00041318376,0.000613229,0.0021294188,0.0010917182,0.0044504707,0.0011649122,0.0008374833,0.0018233835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011201034,0.00022492201,0.013730647,0.0013861551,0.0002821071,0.0006718704,0.0007879698,0.021714399,0.03043057,0.774566,0.031043133,0.12404209],"study_design_scores_gemma":[0.00009414598,0.000181303,0.006776201,0.00014147187,0.00023330394,0.0023675694,0.0007029579,0.082118966,0.011941421,0.8672293,0.028163925,0.00004943302],"about_ca_topic_score_codex":0.000959981,"about_ca_topic_score_gemma":0.0017299586,"teacher_disagreement_score":0.019800914,"about_ca_system_score_codex":0.0008988048,"about_ca_system_score_gemma":0.0005570817,"threshold_uncertainty_score":0.06624061},"labels":[],"label_agreement":null},{"id":"W2403788893","doi":"","title":"Signed Edge Domination Numbers In Trees.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Artificial intelligence; Computer science","score_opus":0.012313408805457445,"score_gpt":0.28020714517940465,"score_spread":0.2678937363739472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403788893","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41506454,0.0036220078,0.29562533,0.0032283033,0.0014085978,0.000111194764,0.0012063282,0.0009153216,0.27881837],"genre_scores_gemma":[0.9312707,0.0011557481,0.037499983,0.00040108085,0.0004166433,0.00010876945,0.00041287026,0.00012537568,0.028608754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939907,0.00016249283,0.00004945053,0.00009328214,0.0002025562,0.000093152536],"domain_scores_gemma":[0.99743265,0.0013677687,0.0003388157,0.000198351,0.00038228527,0.00028008653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063011074,0.0002950719,0.00033803307,0.0019363464,0.0009021479,0.0024998137,0.0005507759,0.00073930447,0.00829523],"category_scores_gemma":[0.005766788,0.00022459554,0.00024975158,0.0016136148,0.0014441485,0.004333263,0.0010170019,0.0013055123,0.0013164663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006203386,0.000019541892,0.0005557533,0.000066148976,0.000007478642,0.0000942755,0.0001981488,0.0014534025,0.0020956947,0.9588653,0.004138104,0.032444105],"study_design_scores_gemma":[0.000015664447,0.000021837339,0.00051217445,0.000032943943,0.000010549418,0.00026062882,0.00012496489,0.0057061557,0.0014045873,0.9792644,0.012629428,0.000016606127],"about_ca_topic_score_codex":0.00033339093,"about_ca_topic_score_gemma":0.00066874316,"teacher_disagreement_score":0.00829523,"about_ca_system_score_codex":0.00072410435,"about_ca_system_score_gemma":0.0004067169,"threshold_uncertainty_score":0.027750313},"labels":[],"label_agreement":null},{"id":"W2403793505","doi":"","title":"A note on the neighbor condition for up-embeddability of graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.012931381662010528,"score_gpt":0.2580098579800494,"score_spread":0.24507847631803886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403793505","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14984192,0.0074950615,0.3627988,0.016401121,0.0051064347,0.00015631808,0.0017754798,0.0012947298,0.45513013],"genre_scores_gemma":[0.8480582,0.0054047513,0.097415715,0.004769449,0.0032691031,0.00025846274,0.0016590314,0.0005995877,0.03856568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858415,0.00035014586,0.00008314235,0.00039713635,0.00038234977,0.0002031483],"domain_scores_gemma":[0.9917617,0.0059205424,0.000271382,0.0010338502,0.00044433784,0.0005683005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014129215,0.00059214217,0.001179225,0.0013607932,0.0022258656,0.0030081116,0.0021651778,0.002563686,0.017015558],"category_scores_gemma":[0.011170049,0.00059594156,0.0010792244,0.0016472364,0.0033745642,0.0100935735,0.0036578998,0.0055887112,0.0021449723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102943224,0.000049228296,0.00081183366,0.00017145174,0.000012677573,0.00022120214,0.00022035635,0.0012275297,0.0024131371,0.96465087,0.01259006,0.017528668],"study_design_scores_gemma":[0.000025405892,0.000045438643,0.0008794549,0.00004541443,0.000026843338,0.0003185803,0.00020573015,0.0065409844,0.0021134422,0.9699146,0.019855522,0.000028657274],"about_ca_topic_score_codex":0.0019471741,"about_ca_topic_score_gemma":0.002296987,"teacher_disagreement_score":0.017015558,"about_ca_system_score_codex":0.0011180488,"about_ca_system_score_gemma":0.00054844975,"threshold_uncertainty_score":0.056922674},"labels":[],"label_agreement":null},{"id":"W2403814521","doi":"","title":"Forbidden subgraphs and the hamiltonian index of a 2-connected graph.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Graph; Hamiltonian (control theory); Index (typography); Hamiltonian path; Discrete mathematics; Computer science; Mathematical optimization; World Wide Web","score_opus":0.00857023606629457,"score_gpt":0.24250863033377912,"score_spread":0.23393839426748456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403814521","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8585576,0.0009092599,0.055570655,0.0009943368,0.0001588251,0.00005091958,0.0008979513,0.0001852241,0.0826752],"genre_scores_gemma":[0.9790381,0.00031986574,0.01160685,0.00014101346,0.000079319994,0.000049565853,0.00039310235,0.00005128087,0.008320814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999778,0.00006782088,0.000011924802,0.00003883399,0.000057230747,0.000046311663],"domain_scores_gemma":[0.99870455,0.0006767965,0.00028151687,0.0000998411,0.00008109635,0.00015616174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022784206,0.00022340275,0.00023956806,0.0013658648,0.00076970324,0.0011571937,0.0006021369,0.0005481542,0.0052440874],"category_scores_gemma":[0.0017421907,0.00020486151,0.00022840517,0.0009347011,0.00086284213,0.0016096184,0.0007392344,0.0006138833,0.00046449216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016632945,0.0000672739,0.0022990159,0.000095633,0.000025562238,0.0003925815,0.0004662027,0.0055797454,0.009305716,0.95608765,0.00483244,0.020681886],"study_design_scores_gemma":[0.000029242932,0.000024105191,0.002078604,0.000024372737,0.000019750201,0.00043471708,0.00019894297,0.02058133,0.002184158,0.9686161,0.005792459,0.000016097969],"about_ca_topic_score_codex":0.0008709092,"about_ca_topic_score_gemma":0.0014904852,"teacher_disagreement_score":0.0052440874,"about_ca_system_score_codex":0.0006147018,"about_ca_system_score_gemma":0.00027031184,"threshold_uncertainty_score":0.017543197},"labels":[],"label_agreement":null},{"id":"W2403821435","doi":"","title":"A Genus Inequality Of The Union Graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Genus; Inequality; Combinatorics; Mathematical economics; Zoology; Mathematical analysis; Biology","score_opus":0.020134050661004356,"score_gpt":0.28847178304732296,"score_spread":0.2683377323863186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403821435","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32120314,0.005099901,0.12418759,0.010390644,0.0012217389,0.0000681527,0.0010628807,0.0005215479,0.5362444],"genre_scores_gemma":[0.94239265,0.0026697924,0.019796487,0.0016838082,0.0011403081,0.00012732451,0.0007784951,0.0005220036,0.030889222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846494,0.00038170555,0.00005068338,0.0003045786,0.00046893934,0.00032907963],"domain_scores_gemma":[0.9923822,0.0045455107,0.0007032993,0.00079184136,0.0007315747,0.0008455842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012573466,0.0006921059,0.00093939377,0.0029430212,0.0032701478,0.0038246617,0.0017911333,0.0020903135,0.018658428],"category_scores_gemma":[0.014536453,0.0007469484,0.0008280591,0.0020511213,0.0045414446,0.01099087,0.004282879,0.0054188548,0.0026141242],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009439878,0.000019953628,0.0009944887,0.00006851708,0.000009677928,0.00013911762,0.00029219224,0.00075160747,0.0012783933,0.97855926,0.006238058,0.01155429],"study_design_scores_gemma":[0.000014624739,0.00001879778,0.0014624676,0.000070284215,0.000024256613,0.00034240747,0.00023825328,0.0067209643,0.00100821,0.9841926,0.0058929548,0.000014255267],"about_ca_topic_score_codex":0.0016686544,"about_ca_topic_score_gemma":0.0016009954,"teacher_disagreement_score":0.018658428,"about_ca_system_score_codex":0.0015640976,"about_ca_system_score_gemma":0.0005693731,"threshold_uncertainty_score":0.06241864},"labels":[],"label_agreement":null},{"id":"W2403822002","doi":"","title":"A sufficient condition for Set Reconstruction.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Set (abstract data type); Computer science; Programming language","score_opus":0.016800826709802014,"score_gpt":0.2629242137801512,"score_spread":0.24612338707034917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403822002","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08480141,0.0020002394,0.64819455,0.021123698,0.0030441082,0.0007514352,0.0087167965,0.004897511,0.22647025],"genre_scores_gemma":[0.781453,0.0014095264,0.17144352,0.00499233,0.0017493877,0.0008276027,0.01000648,0.00092998764,0.0271881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994995,0.0010181335,0.0006219892,0.0014078624,0.0011496491,0.00080743025],"domain_scores_gemma":[0.9625531,0.022064019,0.0014270076,0.0052517233,0.0064908657,0.0022133186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004197657,0.00083641586,0.00177274,0.002093095,0.00365487,0.004604842,0.0023871867,0.0051238895,0.045744844],"category_scores_gemma":[0.03923489,0.0014705629,0.003042062,0.0018088442,0.005964545,0.013049482,0.0059207967,0.008632727,0.010506834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034213334,0.00017366027,0.0016390976,0.00040091405,0.00006991495,0.0005698874,0.00039705125,0.0017598296,0.005537061,0.95880926,0.016145078,0.014156159],"study_design_scores_gemma":[0.00024183483,0.00016505376,0.0015640925,0.00030202986,0.0001117257,0.001858841,0.0006752737,0.015265618,0.013486053,0.92267525,0.04354462,0.00010952169],"about_ca_topic_score_codex":0.0013318324,"about_ca_topic_score_gemma":0.001796186,"teacher_disagreement_score":0.045744844,"about_ca_system_score_codex":0.0014852372,"about_ca_system_score_gemma":0.0035831614,"threshold_uncertainty_score":0.1530317},"labels":[],"label_agreement":null},{"id":"W2403839750","doi":"","title":"On The First Unknown Value Of Two Functions For Convex Lattice v-Gons.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Regular polygon; Lattice (music); Pure mathematics; Geometry; Physics","score_opus":0.020792921145311585,"score_gpt":0.27504887352015694,"score_spread":0.2542559523748454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403839750","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4465774,0.003689347,0.41352874,0.0109415315,0.0008974811,0.00008384816,0.00074773934,0.0006550188,0.122878924],"genre_scores_gemma":[0.9478989,0.0009143793,0.033673916,0.000552305,0.00035824842,0.00007982899,0.00029909576,0.00022528305,0.015998082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981908,0.00067479763,0.00006183926,0.0003332424,0.0003916331,0.0003476971],"domain_scores_gemma":[0.9839055,0.012211827,0.0008895467,0.00084204087,0.0008703299,0.0012808007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029142436,0.0008281017,0.001665912,0.0028420002,0.0028533712,0.0047344407,0.00286954,0.0038511704,0.00920984],"category_scores_gemma":[0.03217947,0.00077542686,0.0010533032,0.001409375,0.008364345,0.011328405,0.0042715226,0.0060233218,0.0009609487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007989235,0.00001908914,0.00037457258,0.00007188231,0.000010273326,0.00008065699,0.00015860106,0.003891421,0.00026347424,0.9883057,0.0015918704,0.005152579],"study_design_scores_gemma":[0.000009090914,0.000012228263,0.0001778502,0.000040544932,0.000006562043,0.00008263092,0.00011341552,0.016983457,0.0002789294,0.98112535,0.0011466037,0.00002335409],"about_ca_topic_score_codex":0.0018252365,"about_ca_topic_score_gemma":0.0012686851,"teacher_disagreement_score":0.00920984,"about_ca_system_score_codex":0.0025902302,"about_ca_system_score_gemma":0.0012063582,"threshold_uncertainty_score":0.030809999},"labels":[],"label_agreement":null},{"id":"W2403846823","doi":"","title":"Fuzzy K-ideals of K-algebras.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Fuzzy and Soft Set Theory","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Fuzzy logic; Pure mathematics; Algebra over a field; Artificial intelligence; Computer science","score_opus":0.08526591274786188,"score_gpt":0.3226862785512872,"score_spread":0.2374203658034253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403846823","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1406307,0.014363471,0.44598415,0.0047390256,0.0014457852,0.00021584827,0.0015794004,0.00054441625,0.39049727],"genre_scores_gemma":[0.88718075,0.0027167655,0.073167734,0.00059534993,0.0009256473,0.00012839376,0.00060205476,0.000060992126,0.03462239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811244,0.00054032926,0.00020149081,0.00028955052,0.000633688,0.00022252902],"domain_scores_gemma":[0.997736,0.0006863861,0.00035213752,0.00025458864,0.00059556816,0.0003753326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021462976,0.0005269935,0.00085915683,0.002721089,0.0021019883,0.004536644,0.0007992141,0.0007381893,0.009272542],"category_scores_gemma":[0.0035042977,0.00042529774,0.0010260185,0.0018260021,0.004773761,0.0068994197,0.002209896,0.001864675,0.002260543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018787889,0.000010361083,0.000107393906,0.000047809113,0.000012363797,0.000027366425,0.00011962217,0.00039589326,0.00026173872,0.99445313,0.0008591209,0.0036863815],"study_design_scores_gemma":[0.000010587054,0.000013386966,0.0001589806,0.000022621347,0.000008441379,0.00010230648,0.0001031548,0.001789635,0.00027945853,0.99076056,0.006740355,0.0000106791695],"about_ca_topic_score_codex":0.00086693536,"about_ca_topic_score_gemma":0.0010440532,"teacher_disagreement_score":0.009272542,"about_ca_system_score_codex":0.00159705,"about_ca_system_score_gemma":0.0010512914,"threshold_uncertainty_score":0.031019747},"labels":[],"label_agreement":null},{"id":"W2403857430","doi":"","title":"Essential Norm Of An Operator From The Weighted Hilbert-Bergman Space To The Bloch-Type Space.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Algebraic and Geometric Analysis","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bergman space; Operator space; Norm (philosophy); Multiplication operator; Pure mathematics; Hilbert space; Bloch space; Space (punctuation); Mathematical analysis; Finite-rank operator; Linguistics; Compact space; Banach space","score_opus":0.012216577440654203,"score_gpt":0.26499688402797156,"score_spread":0.25278030658731737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403857430","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4228791,0.0020760149,0.3442697,0.0034653433,0.0020016965,0.00006660648,0.0006923868,0.0003304921,0.22421864],"genre_scores_gemma":[0.9111865,0.000893839,0.032824334,0.00054104056,0.00075583777,0.00009178286,0.0003330725,0.00019416408,0.053179502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994179,0.00014612534,0.00002842907,0.00008718689,0.000215638,0.00010466448],"domain_scores_gemma":[0.9990363,0.00017409066,0.00012828391,0.00008115463,0.0002975102,0.00028267674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095149304,0.00053012586,0.00040575824,0.001514961,0.00094077806,0.0017526237,0.0008415558,0.000806771,0.005925637],"category_scores_gemma":[0.0019541003,0.00018038403,0.00044693224,0.00071487844,0.0021675795,0.003629832,0.0017145282,0.0019228834,0.0008247627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016280123,0.000009759455,0.00006288832,0.000015077673,0.0000050938206,0.00002645326,0.00006352297,0.000157049,0.0013584694,0.9956232,0.00057724706,0.0020849947],"study_design_scores_gemma":[0.0000104153205,0.000035146848,0.00034024264,0.000011654844,0.0000071491077,0.00019031944,0.00010190253,0.0053492314,0.0011895845,0.9880634,0.0046867654,0.000014131333],"about_ca_topic_score_codex":0.0006036156,"about_ca_topic_score_gemma":0.00064214185,"teacher_disagreement_score":0.005925637,"about_ca_system_score_codex":0.00086639286,"about_ca_system_score_gemma":0.00072736834,"threshold_uncertainty_score":0.019823194},"labels":[],"label_agreement":null},{"id":"W2403866431","doi":"","title":"Contractible edges of k-connected graphs for k=4, 5","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Contractible space; Mathematics; Combinatorics","score_opus":0.012247726329446922,"score_gpt":0.23948245569611745,"score_spread":0.22723472936667052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403866431","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89800596,0.00032565545,0.03336311,0.0006566167,0.00012370363,0.00008535392,0.0013205521,0.0002037619,0.06591512],"genre_scores_gemma":[0.95808935,0.0003147697,0.015040966,0.00019096518,0.00005048101,0.000111215566,0.0016175074,0.00014319828,0.024441462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995301,0.000090066496,0.00003091495,0.00009680876,0.00012055654,0.00013161812],"domain_scores_gemma":[0.9978136,0.0009958189,0.00029212667,0.00024380433,0.00021988907,0.00043464068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040102433,0.000475475,0.00040314952,0.0010412739,0.0019410648,0.0020020609,0.001211719,0.0010819095,0.013877658],"category_scores_gemma":[0.0022673146,0.000543088,0.0005718875,0.0009467355,0.0014164965,0.0019628177,0.0012622048,0.0014892182,0.0009167255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010625736,0.00012190131,0.002942385,0.00026552257,0.00004111594,0.0007528544,0.0010150642,0.01571597,0.008480577,0.9375254,0.0082514305,0.02382524],"study_design_scores_gemma":[0.00014948696,0.000091934,0.00656444,0.00011157472,0.00005781011,0.0006535029,0.00082773826,0.04664528,0.0059571955,0.91866887,0.02019397,0.00007831814],"about_ca_topic_score_codex":0.0025338237,"about_ca_topic_score_gemma":0.003941303,"teacher_disagreement_score":0.013877658,"about_ca_system_score_codex":0.0006770567,"about_ca_system_score_gemma":0.00071389094,"threshold_uncertainty_score":0.046425402},"labels":[],"label_agreement":null},{"id":"W2403885105","doi":"","title":"Packings and coverings for ten graphs with seven points, seven edges and an even-cycle.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.005329090428732821,"score_gpt":0.20027643113216984,"score_spread":0.19494734070343703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403885105","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8878373,0.00088048354,0.042026926,0.0005505335,0.00012365948,0.00006100624,0.0014069839,0.0003717255,0.066741504],"genre_scores_gemma":[0.97050065,0.00028460927,0.019691207,0.00006047119,0.00002559552,0.000036548612,0.0011184787,0.00006744885,0.008214981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996227,0.00009057039,0.000022449538,0.00006386806,0.00008606534,0.0001143384],"domain_scores_gemma":[0.99894005,0.00050944637,0.00015366873,0.00018185828,0.0000799443,0.00013517152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026801712,0.0004127578,0.00037378335,0.0012112637,0.0015234061,0.0011568982,0.0005513826,0.0008092653,0.009089228],"category_scores_gemma":[0.0019894172,0.0003855838,0.0005014347,0.0014942226,0.0009834437,0.0011941736,0.0009513996,0.00045357746,0.00069299166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084768195,0.00017539764,0.006530669,0.00032680336,0.00011452691,0.0019888969,0.0016236892,0.076044045,0.011943059,0.80909425,0.02131605,0.0699949],"study_design_scores_gemma":[0.0000942705,0.00015822533,0.010227201,0.000107688225,0.000111218025,0.0022462204,0.0019836698,0.22118676,0.010180808,0.7208339,0.032803413,0.00006661728],"about_ca_topic_score_codex":0.0026994362,"about_ca_topic_score_gemma":0.0035570373,"teacher_disagreement_score":0.009089228,"about_ca_system_score_codex":0.00079536636,"about_ca_system_score_gemma":0.0002932294,"threshold_uncertainty_score":0.030406535},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Harmonic; Combinatorics; Statistics; Computer science; Acoustics; Physics; World Wide Web","score_opus":0.0319056874760969,"score_gpt":0.29515694169507284,"score_spread":0.26325125421897594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403887512","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4409902,0.010466784,0.088977836,0.0044001653,0.0018482548,0.000075139906,0.0013261162,0.00038176193,0.45153382],"genre_scores_gemma":[0.9543715,0.0035373154,0.007431684,0.00036054506,0.0009356583,0.00006345586,0.0004474659,0.00013750276,0.032714922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995584,0.00008768857,0.000020587782,0.00008356704,0.00015903781,0.00009066238],"domain_scores_gemma":[0.998348,0.00073104625,0.00028825458,0.00018160997,0.0001859366,0.00026520307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039817416,0.00041125724,0.000618829,0.003541625,0.0010583814,0.0023764297,0.0010866045,0.00091500854,0.01037684],"category_scores_gemma":[0.004100023,0.00026969428,0.00024086806,0.0024097485,0.0019551401,0.0038115594,0.002123724,0.0014206384,0.0016908282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004133098,0.000012959608,0.00038806777,0.00006890885,0.000007864269,0.000057068686,0.00017559191,0.0010479649,0.0008782493,0.9737235,0.005322992,0.01827553],"study_design_scores_gemma":[0.000007583456,0.000010052034,0.00051109015,0.000026814654,0.0000067233896,0.00014426606,0.00011005682,0.0046606464,0.00043283572,0.9877577,0.006321847,0.000010519091],"about_ca_topic_score_codex":0.0009787398,"about_ca_topic_score_gemma":0.0010629983,"teacher_disagreement_score":0.01037684,"about_ca_system_score_codex":0.0012465513,"about_ca_system_score_gemma":0.00033841952,"threshold_uncertainty_score":0.034713984},"labels":[],"label_agreement":null},{"id":"W2403891536","doi":"","title":"An automatic approach to the generating functions of some special sequences.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arithmetic; Theoretical computer science; Algebra over a field; Computer science; Pure mathematics","score_opus":0.03267925575169846,"score_gpt":0.2876109675185714,"score_spread":0.25493171176687296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403891536","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048296414,0.0010443104,0.80318093,0.0017300469,0.0006798533,0.00008965984,0.00029475644,0.0005780525,0.14410587],"genre_scores_gemma":[0.66513216,0.00127267,0.26226458,0.0009611515,0.0015219905,0.00036450732,0.0006933095,0.0007586834,0.06703099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991774,0.00030025485,0.00004580416,0.00011209191,0.00027950364,0.00008488184],"domain_scores_gemma":[0.99836963,0.0007889859,0.000109473265,0.0002937773,0.00031168398,0.00012639422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012275161,0.0007638365,0.0005514764,0.0036554742,0.0015956515,0.0020043154,0.0015917957,0.0011402484,0.0126927355],"category_scores_gemma":[0.0050949845,0.0005640255,0.0012805016,0.0014380285,0.0027336332,0.0046239425,0.002312469,0.0037892573,0.0024761858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060739235,0.0000121755265,0.00007255243,0.000018032159,0.0000025791412,0.000038925624,0.000101866885,0.0004016857,0.00032314347,0.9913113,0.0011122007,0.006599546],"study_design_scores_gemma":[0.000005296192,0.0000065961663,0.00007053028,0.000010250206,0.000003261128,0.00009520258,0.000025544376,0.0058050193,0.00033892377,0.98987865,0.0037535073,0.000007154835],"about_ca_topic_score_codex":0.00055031385,"about_ca_topic_score_gemma":0.00093199953,"teacher_disagreement_score":0.0126927355,"about_ca_system_score_codex":0.0009922505,"about_ca_system_score_gemma":0.0005727128,"threshold_uncertainty_score":0.042461455},"labels":[],"label_agreement":null},{"id":"W2403908314","doi":"","title":"On Generalizing the.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.010584648451156939,"score_gpt":0.2177366835089529,"score_spread":0.20715203505779595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403908314","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004074226,0.0063762777,0.6688164,0.030143138,0.0039041557,0.00013623672,0.00087585405,0.0010236929,0.28465006],"genre_scores_gemma":[0.25141028,0.012348837,0.46703625,0.029617487,0.006099232,0.0007215405,0.0023538966,0.0020192112,0.22839335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997855,0.00076432014,0.00013842418,0.00052351766,0.0005419763,0.00017676462],"domain_scores_gemma":[0.9964541,0.0013066046,0.00013039014,0.0014027476,0.00055036636,0.00015580704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027938865,0.001838297,0.0012613209,0.0025781929,0.003467203,0.004840124,0.0028094116,0.0025778299,0.034388043],"category_scores_gemma":[0.010408089,0.00092932605,0.002231956,0.0029370412,0.005243284,0.012108043,0.006966025,0.0066935075,0.011815125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023320681,0.000022088254,0.00014184903,0.00008314202,0.0000137370835,0.000040742336,0.00017002529,0.0008669602,0.00021316086,0.939519,0.022389317,0.03651676],"study_design_scores_gemma":[0.000013907162,0.000012142706,0.00013644477,0.00007309634,0.000020121115,0.00010646018,0.00007250204,0.0056743254,0.00032978176,0.8942877,0.09925765,0.000015903424],"about_ca_topic_score_codex":0.0056061596,"about_ca_topic_score_gemma":0.007477763,"teacher_disagreement_score":0.034388043,"about_ca_system_score_codex":0.00209453,"about_ca_system_score_gemma":0.0016284334,"threshold_uncertainty_score":0.11503947},"labels":[],"label_agreement":null},{"id":"W2403916259","doi":"","title":"Noncrossing matchings with fixed points.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Fixed point; Mathematical analysis","score_opus":0.010903709763263011,"score_gpt":0.2549594325959743,"score_spread":0.2440557228327113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403916259","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.349951,0.002804035,0.31744912,0.0028182105,0.0009996303,0.00025316575,0.0016654897,0.001375311,0.322684],"genre_scores_gemma":[0.87613785,0.0013603036,0.059928842,0.0006570246,0.00037962204,0.00017534095,0.0014599608,0.00037180405,0.059529196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891424,0.00023044462,0.00006721753,0.00029844028,0.00029034357,0.00019946154],"domain_scores_gemma":[0.99694496,0.0015019043,0.00041798718,0.0005119579,0.00030496359,0.00031828627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008411378,0.00068600214,0.00095807126,0.0025285846,0.0023918129,0.002999251,0.0018001496,0.0025146992,0.020465953],"category_scores_gemma":[0.007586606,0.0007325934,0.00087466056,0.002357826,0.0017106143,0.0049252533,0.0029589408,0.0025997136,0.0039922306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006465825,0.000054606775,0.00047340753,0.00008283058,0.000021534392,0.00034005922,0.00017025613,0.0010940683,0.0015265853,0.97435915,0.004239094,0.01757369],"study_design_scores_gemma":[0.000028144583,0.000016257687,0.00033146408,0.000044424625,0.000019269011,0.0004304912,0.00012839657,0.005132634,0.0010505426,0.9824008,0.010405601,0.00001206307],"about_ca_topic_score_codex":0.0008728877,"about_ca_topic_score_gemma":0.0013481869,"teacher_disagreement_score":0.020465953,"about_ca_system_score_codex":0.001300309,"about_ca_system_score_gemma":0.00057829014,"threshold_uncertainty_score":0.06846541},"labels":[],"label_agreement":null},{"id":"W2403933701","doi":"","title":"Bordered magic squares: elements for a comprehensive approach","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Magic square; Mathematics; MAGIC (telescope); Geometry; Astrophysics; Physics","score_opus":0.05130015768727548,"score_gpt":0.25867670121241937,"score_spread":0.2073765435251439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403933701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008343627,0.008576307,0.8374519,0.009397727,0.0011931843,0.0000959237,0.0003016438,0.00054190616,0.13409775],"genre_scores_gemma":[0.2261108,0.011965624,0.6974477,0.004247031,0.002169439,0.0003901387,0.0008551482,0.0006684918,0.056145646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998555,0.00050337473,0.000102937825,0.00028794233,0.0004221139,0.00012861843],"domain_scores_gemma":[0.9976172,0.0008943626,0.00010200016,0.0007802097,0.00041826803,0.0001879641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001993071,0.00093463884,0.0015386137,0.002654651,0.0030815275,0.0058177556,0.0035479984,0.002765792,0.013061284],"category_scores_gemma":[0.004183962,0.0008566913,0.0011439458,0.0035717543,0.0063805073,0.012963881,0.0053229243,0.0075968946,0.0027225967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004498018,0.000008906934,0.000038222213,0.000038167214,0.0000032559196,0.000012742786,0.00006257808,0.0006629097,0.00010569457,0.987981,0.0032687865,0.0078132395],"study_design_scores_gemma":[0.0000024003318,0.0000034452423,0.00002000106,0.000021198932,0.0000031715854,0.00002849406,0.00004671134,0.0018320463,0.00009118838,0.97929823,0.018647801,0.000005251168],"about_ca_topic_score_codex":0.0010663585,"about_ca_topic_score_gemma":0.0023128332,"teacher_disagreement_score":0.013061284,"about_ca_system_score_codex":0.001727712,"about_ca_system_score_gemma":0.0011956885,"threshold_uncertainty_score":0.043694377},"labels":[],"label_agreement":null},{"id":"W2403935035","doi":"","title":"On the second maximal and minimal Wiener index of unicyclic graphs with given girth.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Girth (graph theory); Wiener index; Index (typography); Combinatorics; Discrete mathematics; Graph; Computer science","score_opus":0.018829465834408907,"score_gpt":0.25018057202563876,"score_spread":0.23135110619122984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403935035","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81072176,0.0028649599,0.064059794,0.0015054906,0.0003512635,0.00003808148,0.00058486324,0.0002644627,0.11960927],"genre_scores_gemma":[0.98282284,0.0008368341,0.006615668,0.00012470743,0.0002531678,0.00003997377,0.00025400554,0.00009711519,0.008955703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995388,0.00010031148,0.000021166315,0.00008270629,0.00012627944,0.00013070065],"domain_scores_gemma":[0.9971124,0.0014004199,0.00045744888,0.00021734861,0.00023035143,0.00058210286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006642121,0.0005098381,0.0008671639,0.0032362617,0.0011579512,0.002493418,0.0011244634,0.0009224812,0.0052443063],"category_scores_gemma":[0.005574488,0.0003676372,0.00046403875,0.001535951,0.0025079455,0.0036684233,0.0019970785,0.0015909064,0.00089781824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019471596,0.000039950508,0.0016624082,0.00009762607,0.000020278474,0.00014455731,0.00046808837,0.004266489,0.003653009,0.9743542,0.0030699056,0.012028666],"study_design_scores_gemma":[0.000020699617,0.000041491232,0.001812566,0.000058398906,0.00002186084,0.00028842597,0.0002513976,0.014852038,0.002088776,0.97710377,0.0034283195,0.000032314023],"about_ca_topic_score_codex":0.0008073143,"about_ca_topic_score_gemma":0.00118948,"teacher_disagreement_score":0.0052443063,"about_ca_system_score_codex":0.0012933797,"about_ca_system_score_gemma":0.0005047512,"threshold_uncertainty_score":0.017543972},"labels":[],"label_agreement":null},{"id":"W2403942000","doi":"","title":"L(j, k)-labelings of Cartesian products of three complete graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cartesian product; Combinatorics; Discrete mathematics","score_opus":0.03628478527906736,"score_gpt":0.23163073248893587,"score_spread":0.1953459472098685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403942000","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5490472,0.00071451144,0.26734307,0.0023503848,0.00038659287,0.00015977258,0.0028044733,0.001367792,0.17582616],"genre_scores_gemma":[0.849706,0.00027115698,0.11961061,0.0005020894,0.00008059581,0.00015624236,0.0022506807,0.0004033463,0.027019259],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999035,0.00029318104,0.00007016831,0.00024606308,0.0001460039,0.00020963396],"domain_scores_gemma":[0.9967535,0.0012868457,0.0005056508,0.0005462807,0.0004002721,0.00050729595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008092163,0.000424394,0.0004989397,0.0011733052,0.0022288924,0.0033761694,0.0010330948,0.0012509724,0.013375402],"category_scores_gemma":[0.002846041,0.0006898413,0.001043067,0.0013465853,0.0023692474,0.0033503931,0.002031165,0.001833388,0.0020549519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023118663,0.0000637533,0.0013786608,0.00014040778,0.000023444363,0.00027312626,0.00082509447,0.002101971,0.003870647,0.96611464,0.00717127,0.01780569],"study_design_scores_gemma":[0.000046485173,0.00004114142,0.0014569334,0.00006068073,0.000033788154,0.00047382148,0.00062046346,0.0067808265,0.0040241135,0.9629207,0.023501309,0.00003972297],"about_ca_topic_score_codex":0.0019930692,"about_ca_topic_score_gemma":0.0027783145,"teacher_disagreement_score":0.013375402,"about_ca_system_score_codex":0.0014320087,"about_ca_system_score_gemma":0.0007407191,"threshold_uncertainty_score":0.044745147},"labels":[],"label_agreement":null},{"id":"W2403955642","doi":"","title":"Hamiltonian Properties of the 3-(γ, 2)-Critical Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hamiltonian (control theory); Combinatorics; Pure mathematics; Mathematical optimization","score_opus":0.026700328697763495,"score_gpt":0.27766484826031174,"score_spread":0.2509645195625482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403955642","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80556405,0.0011198678,0.030975575,0.0012554394,0.0001611903,0.00010364183,0.0008783194,0.00017280287,0.15976912],"genre_scores_gemma":[0.98720306,0.00023693693,0.0040724725,0.00018406371,0.00004752379,0.000043962213,0.00030538824,0.000046921232,0.007859622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999907,0.000024395486,0.0000038119165,0.000016667307,0.00002148505,0.000026670323],"domain_scores_gemma":[0.9994899,0.00017410592,0.00013747992,0.000041783744,0.000067141096,0.00008948659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014549529,0.00028266723,0.0001624829,0.001313099,0.00083592307,0.0008942543,0.00036050173,0.00051989895,0.011030874],"category_scores_gemma":[0.0010973607,0.00021181545,0.00021287477,0.00046819643,0.00088383415,0.0009326573,0.00043581353,0.0005073117,0.00058026146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085391024,0.000031608575,0.0014144005,0.000116237265,0.00001606376,0.0005080242,0.000483412,0.0033375411,0.011927314,0.96663886,0.005239185,0.01020189],"study_design_scores_gemma":[0.000048515616,0.000028416413,0.0027360031,0.00005251089,0.000018106342,0.0005753117,0.0005234118,0.009300015,0.0032882155,0.9751926,0.008213491,0.000023436556],"about_ca_topic_score_codex":0.0014897408,"about_ca_topic_score_gemma":0.0023988707,"teacher_disagreement_score":0.011030874,"about_ca_system_score_codex":0.00039956073,"about_ca_system_score_gemma":0.000304803,"threshold_uncertainty_score":0.03690195},"labels":[],"label_agreement":null},{"id":"W2403995630","doi":"","title":"Solutions of fractional systems of difference equations.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Nonlinear Differential Equations Analysis","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Applied mathematics","score_opus":0.04906136912387824,"score_gpt":0.2928032306629661,"score_spread":0.24374186153908786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403995630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14296092,0.006674132,0.72281295,0.0030181045,0.0015894634,0.000100638514,0.00036884306,0.00025801014,0.12221683],"genre_scores_gemma":[0.8707888,0.0025318724,0.08094767,0.00040371943,0.0005641465,0.00011689882,0.00030653892,0.00011978256,0.044220474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959105,0.00013560962,0.000026770944,0.000050747603,0.00013956371,0.00005625085],"domain_scores_gemma":[0.99934727,0.0002830008,0.00012245844,0.000061032028,0.000108798136,0.000077400655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007323198,0.00059244706,0.0006717658,0.001518858,0.0010577257,0.0022772895,0.00073671946,0.0012761822,0.0069663646],"category_scores_gemma":[0.004181156,0.0003202067,0.0008184228,0.000770317,0.0015960177,0.002125045,0.001958395,0.0015429262,0.00076472946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015421308,0.000012217025,0.00020773984,0.000040203053,0.000013992322,0.00006071603,0.000106068015,0.0043448033,0.0010484954,0.9871978,0.00091972505,0.0060328115],"study_design_scores_gemma":[0.00001828313,0.000016125206,0.00017769042,0.000034664758,0.000010868499,0.00010868131,0.000093971285,0.095017344,0.0006597783,0.89807206,0.0057758046,0.000014674566],"about_ca_topic_score_codex":0.0014771376,"about_ca_topic_score_gemma":0.0014270799,"teacher_disagreement_score":0.0069663646,"about_ca_system_score_codex":0.0012803924,"about_ca_system_score_gemma":0.00064789417,"threshold_uncertainty_score":0.02330476},"labels":[],"label_agreement":null},{"id":"W2404003086","doi":"","title":"The Hamiltonicity of k-Connected [s, t]-Graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.02613998589114777,"score_gpt":0.2833053795794481,"score_spread":0.2571653936883004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404003086","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77468175,0.0009327607,0.05586246,0.0027127664,0.00019194794,0.00012990834,0.0017022245,0.00029886895,0.16348726],"genre_scores_gemma":[0.97731584,0.00044656207,0.006420325,0.000276063,0.000054610995,0.00006053759,0.000623825,0.000049999486,0.014752201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997452,0.00006853666,0.000015197106,0.000058375368,0.00004857197,0.00006400321],"domain_scores_gemma":[0.998511,0.0006839949,0.00028776604,0.000156013,0.00019194046,0.0001691031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020843944,0.00023323836,0.00026489343,0.0008402225,0.0011871549,0.0017092378,0.0005742208,0.0007697751,0.008553299],"category_scores_gemma":[0.0025488434,0.00033665227,0.00038062566,0.0010028802,0.0015597148,0.0018637966,0.0011337693,0.0007129812,0.00093506277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015941075,0.000025262309,0.001220615,0.000117072246,0.000026749118,0.00036128054,0.0005065363,0.0029294705,0.0042334413,0.9712762,0.0060663726,0.013077635],"study_design_scores_gemma":[0.000039885355,0.000023438628,0.0011131321,0.000029740118,0.00002029046,0.00025661057,0.0002912766,0.0071974597,0.0013138404,0.98445904,0.0052390886,0.000016146247],"about_ca_topic_score_codex":0.004133542,"about_ca_topic_score_gemma":0.005149715,"teacher_disagreement_score":0.008553299,"about_ca_system_score_codex":0.00078028085,"about_ca_system_score_gemma":0.0006939972,"threshold_uncertainty_score":0.028613627},"labels":[],"label_agreement":null},{"id":"W2404004722","doi":"","title":"On Graceful And Cordial Labeling Of Shell Graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Shell (structure); Combinatorics; Composite material; Materials science","score_opus":0.008118015804574432,"score_gpt":0.20633631412307196,"score_spread":0.19821829831849752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404004722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34025395,0.0023370367,0.3735483,0.006382407,0.0006106676,0.00015982684,0.0013194049,0.0018925738,0.27349594],"genre_scores_gemma":[0.8548269,0.0016197346,0.07997425,0.0012649754,0.0004905405,0.00016970486,0.0014265426,0.0006587186,0.05956859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911064,0.00026692616,0.00004729917,0.00019442843,0.00017861674,0.00020202844],"domain_scores_gemma":[0.9958423,0.002034875,0.00042505533,0.0009263578,0.0002680407,0.00050329434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010886763,0.00066506816,0.00067235157,0.0014166058,0.0024410426,0.0027032606,0.0013997329,0.0014264584,0.011944525],"category_scores_gemma":[0.0062044226,0.000505026,0.0007742167,0.0016354222,0.0035622534,0.0072352295,0.0032351464,0.0027472863,0.0016292257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049511513,0.000032198008,0.0003557439,0.00005456961,0.0000053338945,0.00004506566,0.00021945254,0.0024657424,0.0005926369,0.9790875,0.0052489545,0.01184332],"study_design_scores_gemma":[0.000008814923,0.0000072334974,0.0001836178,0.000018347242,0.00000544984,0.00005553771,0.00009431997,0.0068125804,0.00042928517,0.98744744,0.0049286205,0.000008783814],"about_ca_topic_score_codex":0.0033167277,"about_ca_topic_score_gemma":0.005029447,"teacher_disagreement_score":0.011944525,"about_ca_system_score_codex":0.002251438,"about_ca_system_score_gemma":0.0009574221,"threshold_uncertainty_score":0.039958417},"labels":[],"label_agreement":null},{"id":"W2404017857","doi":"","title":"The Modified Zagreb Indices About Join And Composition Of Graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Join (topology); Mathematics; Composition (language); Combinatorics; Linguistics","score_opus":0.015590429664716224,"score_gpt":0.27046048959017605,"score_spread":0.2548700599254598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404017857","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11823095,0.005682913,0.41946098,0.002481424,0.0026005558,0.00012140218,0.0011346332,0.00074958924,0.4495375],"genre_scores_gemma":[0.76241183,0.0035999287,0.16211429,0.001233352,0.0019108067,0.0002608369,0.0009704979,0.000758144,0.066740274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846005,0.00037632853,0.00011223459,0.00034576576,0.00051706354,0.00018859355],"domain_scores_gemma":[0.99844533,0.00045701384,0.00023431296,0.0003721903,0.00029280767,0.00019829524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015402876,0.0006721747,0.0009084404,0.003312262,0.0022300347,0.0042607104,0.0013006025,0.0012086625,0.008161844],"category_scores_gemma":[0.004872138,0.00048577454,0.000811192,0.0026791187,0.0035810904,0.009926769,0.0026747622,0.0041941446,0.002317285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022792372,0.0000058305222,0.00008773146,0.000020913183,0.0000034762388,0.000024392672,0.00014983892,0.00017738306,0.0003733533,0.9894856,0.0011071983,0.008541489],"study_design_scores_gemma":[0.0000074030113,0.000012975229,0.00019534297,0.000021835654,0.000010392386,0.00012016108,0.00009984729,0.0013450134,0.00070393586,0.9827533,0.014717642,0.000012195239],"about_ca_topic_score_codex":0.0013032461,"about_ca_topic_score_gemma":0.0018451184,"teacher_disagreement_score":0.008161844,"about_ca_system_score_codex":0.0014291424,"about_ca_system_score_gemma":0.00069885585,"threshold_uncertainty_score":0.027304113},"labels":[],"label_agreement":null},{"id":"W2404038546","doi":"","title":"On The Complexity Of Unique List Colourability And The Fixing Number Of Graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.018726383164453072,"score_gpt":0.24433112981344127,"score_spread":0.2256047466489882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404038546","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6155777,0.0071472465,0.17882268,0.021476839,0.00091511663,0.00027236165,0.0052229846,0.0013570088,0.16920803],"genre_scores_gemma":[0.9499438,0.0027165334,0.030958882,0.0008290503,0.0007520813,0.00024269159,0.0022393956,0.0004605139,0.011856999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960217,0.001373462,0.00018297463,0.00079994154,0.0007518143,0.00087008905],"domain_scores_gemma":[0.9418017,0.049738698,0.0025165859,0.0033696683,0.00095952005,0.0016138699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039586434,0.0011431909,0.0019981365,0.0026326254,0.0031150146,0.0074305744,0.0046823067,0.0038693156,0.022280648],"category_scores_gemma":[0.037502345,0.001346084,0.0020473932,0.004582615,0.0064622555,0.017740188,0.0044324454,0.005950502,0.001573894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053749915,0.0001967877,0.0042101275,0.00043815965,0.00009906815,0.00018096284,0.00050690444,0.041420855,0.0014444427,0.8962414,0.02283548,0.03188829],"study_design_scores_gemma":[0.00007190934,0.000026268559,0.0011138837,0.00005127502,0.00005574089,0.00019643336,0.00019118522,0.04402647,0.00071247405,0.9503484,0.003166367,0.00003961762],"about_ca_topic_score_codex":0.0044200253,"about_ca_topic_score_gemma":0.004046134,"teacher_disagreement_score":0.022280648,"about_ca_system_score_codex":0.004766277,"about_ca_system_score_gemma":0.0023824729,"threshold_uncertainty_score":0.074536264},"labels":[],"label_agreement":null},{"id":"W2404039472","doi":"","title":"Bicircular Matroid Designs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"BIM and Construction Integration","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Matroid; Mathematics; Combinatorics","score_opus":0.008514013380461477,"score_gpt":0.19002088874504447,"score_spread":0.181506875364583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404039472","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052754622,0.0011783015,0.6639845,0.00052551314,0.00032066982,0.00011818066,0.0010466157,0.00095147477,0.27912018],"genre_scores_gemma":[0.5517563,0.0010622172,0.33426917,0.0004687786,0.00013340263,0.00020534942,0.0018574531,0.00041141603,0.109835945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919766,0.00015299118,0.0000502019,0.00017405137,0.00033589185,0.000089227564],"domain_scores_gemma":[0.9994802,0.0000900249,0.00006881423,0.00014091782,0.00014982795,0.000070113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000498243,0.00061593635,0.00048638726,0.0012697309,0.0008866607,0.0017298196,0.0009710662,0.0006184304,0.02173482],"category_scores_gemma":[0.0012441634,0.00040663802,0.0004838901,0.0011563122,0.0010204585,0.0018116677,0.002359241,0.0012792363,0.005213768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005769439,0.000044320106,0.0003297027,0.00015757156,0.000022918011,0.00010457132,0.00014321967,0.004668444,0.00481381,0.8798906,0.008362762,0.1014043],"study_design_scores_gemma":[0.000033536104,0.0001250578,0.0008932456,0.00014446999,0.00005200756,0.00094711094,0.0004297887,0.027709221,0.009921274,0.7856242,0.17407793,0.000042177093],"about_ca_topic_score_codex":0.0009664595,"about_ca_topic_score_gemma":0.0025741044,"teacher_disagreement_score":0.02173482,"about_ca_system_score_codex":0.0007836138,"about_ca_system_score_gemma":0.00055118056,"threshold_uncertainty_score":0.072710276},"labels":[],"label_agreement":null},{"id":"W2404051240","doi":"","title":"A New Construction of Multisender Authentication Codes from Symplectic Geometry over Finite Fields.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Symplectic geometry; Mathematics; Finite field; Authentication (law); Geometry; Finite geometry; Pure mathematics; Discrete mathematics; Computer science; Computer security","score_opus":0.012724433974006313,"score_gpt":0.2380994169142365,"score_spread":0.22537498294023017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404051240","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19365354,0.001145215,0.7131717,0.0023518072,0.0009838216,0.00026860568,0.00065111247,0.0012619371,0.0865123],"genre_scores_gemma":[0.87283283,0.00063129124,0.104290076,0.0005114759,0.00030285137,0.00017056604,0.00042278593,0.00024154328,0.020596476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991241,0.00019223936,0.000061511055,0.00014687376,0.0003210114,0.00015434335],"domain_scores_gemma":[0.9981394,0.0005243524,0.00021053325,0.00065237546,0.00020279597,0.00027066565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006977112,0.0005413899,0.0006684331,0.0013771594,0.0013386938,0.0017399739,0.00093457784,0.0011440841,0.007341749],"category_scores_gemma":[0.0023923728,0.0004557797,0.0007034819,0.0010000255,0.002171278,0.0039676465,0.0054993164,0.0024720586,0.0018873195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000509379,0.00002883068,0.00019332048,0.000055428194,0.000006887143,0.00018072648,0.00021281016,0.001554838,0.0030970196,0.9796998,0.0022673183,0.01265213],"study_design_scores_gemma":[0.000044393404,0.00007826018,0.00021596502,0.000048291546,0.000015158887,0.00062840624,0.00009529264,0.022242146,0.0048153563,0.95684147,0.014932984,0.000042353655],"about_ca_topic_score_codex":0.00020383742,"about_ca_topic_score_gemma":0.0003546217,"teacher_disagreement_score":0.007341749,"about_ca_system_score_codex":0.0006021033,"about_ca_system_score_gemma":0.00078478706,"threshold_uncertainty_score":0.02456057},"labels":[],"label_agreement":null},{"id":"W2404057724","doi":"","title":"On Vertex Matching Polynomial of Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Matching (statistics); Graph; Statistics","score_opus":0.023183009138926524,"score_gpt":0.2858983258116701,"score_spread":0.26271531667274356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404057724","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26950425,0.013602822,0.32338062,0.017155265,0.0024008288,0.00014036694,0.0024686167,0.001086629,0.3702606],"genre_scores_gemma":[0.8911186,0.0075082653,0.039785918,0.0017012273,0.002332925,0.00014831698,0.0015289079,0.00044804125,0.055427812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921346,0.00021405183,0.00002723846,0.00016102471,0.00021363009,0.00017058052],"domain_scores_gemma":[0.9967242,0.0021805475,0.00029071915,0.0002918951,0.00027809961,0.00023447187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010648658,0.00073699234,0.0010139564,0.0029999427,0.0010435326,0.002270664,0.0014848596,0.0011894136,0.014108778],"category_scores_gemma":[0.009336928,0.00033718353,0.0007112585,0.0040308293,0.0025203596,0.0072853104,0.002044165,0.0038211353,0.0033720215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085944,0.000063054824,0.00087202026,0.00022269844,0.000019535111,0.000081161896,0.000291226,0.0038056308,0.0007992414,0.93894994,0.014883763,0.039925847],"study_design_scores_gemma":[0.000014255843,0.000016037144,0.00047101523,0.00003147112,0.000013311118,0.000094882605,0.000063394815,0.010772726,0.00029436755,0.9815197,0.006698101,0.000010856564],"about_ca_topic_score_codex":0.002542343,"about_ca_topic_score_gemma":0.0023945293,"teacher_disagreement_score":0.014108778,"about_ca_system_score_codex":0.0021692798,"about_ca_system_score_gemma":0.0007403007,"threshold_uncertainty_score":0.047198534},"labels":[],"label_agreement":null},{"id":"W2404068275","doi":"","title":"k-Generalized Order-k Perrin Number Presentation by Matrix Method.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Applied mathematics; Presentation (obstetrics); Matrix (chemical analysis); Order (exchange); Chemistry; Chromatography; Medicine","score_opus":0.012527953443992117,"score_gpt":0.3401658925372716,"score_spread":0.3276379390932795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404068275","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10144174,0.0037791256,0.4456778,0.0032103257,0.0040776916,0.00015852613,0.0009972545,0.0016663021,0.43899134],"genre_scores_gemma":[0.7348376,0.0019858016,0.124431364,0.0013873288,0.0019572505,0.00021703771,0.0007004122,0.0009691972,0.13351403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994572,0.00013512545,0.000028923432,0.00010697686,0.0001737148,0.00009808943],"domain_scores_gemma":[0.9995869,0.000058618487,0.000052479867,0.00008844039,0.00013067179,0.00008288873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048955815,0.000692192,0.0007076518,0.0022593322,0.0014273007,0.0027319293,0.0011860331,0.0009302142,0.022364026],"category_scores_gemma":[0.0013161058,0.00026772954,0.0006577304,0.0010481472,0.0016309089,0.0036845885,0.0019290148,0.0016092891,0.007880378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000272164,0.000013330805,0.000063957355,0.00005125746,0.0000053196313,0.000097138574,0.00013525177,0.000455842,0.0014400475,0.98300135,0.0054836427,0.009225595],"study_design_scores_gemma":[0.0000085162965,0.000022083526,0.00011902318,0.000020195526,0.000007892498,0.00028297203,0.00008425805,0.006619409,0.0011620449,0.9673141,0.024331648,0.00002778252],"about_ca_topic_score_codex":0.00046720865,"about_ca_topic_score_gemma":0.0006629163,"teacher_disagreement_score":0.022364026,"about_ca_system_score_codex":0.0007781423,"about_ca_system_score_gemma":0.0006277143,"threshold_uncertainty_score":0.074815094},"labels":[],"label_agreement":null},{"id":"W2404073835","doi":"","title":"Algebraic Properties and Panconnectivity of Folded Hypercubes.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hypercube; Algebraic number; Combinatorics; Mathematical analysis","score_opus":0.016356384914356193,"score_gpt":0.20624516979337124,"score_spread":0.18988878487901503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404073835","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72414815,0.0013679524,0.118824914,0.00074678694,0.00016509132,0.000082611376,0.0006743017,0.00018037825,0.15380992],"genre_scores_gemma":[0.977967,0.00070999924,0.012368332,0.00008924681,0.00009145092,0.000043602282,0.0004221208,0.000032069034,0.008276245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977535,0.000044481683,0.000016113334,0.000039067723,0.000087020424,0.00003797231],"domain_scores_gemma":[0.9992506,0.0002177279,0.00020916971,0.00009907388,0.0001456596,0.00007775879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013196532,0.00020949602,0.0001752202,0.00083348877,0.00059653714,0.0011979829,0.00025142397,0.00026177394,0.005097866],"category_scores_gemma":[0.0015235803,0.00020905425,0.00015354014,0.0009288986,0.0007946176,0.0016288736,0.00071730954,0.00051306124,0.00049605273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009101841,0.000021850585,0.0014258812,0.000113549395,0.00001659226,0.000393652,0.00044860257,0.0069237016,0.012477516,0.94444746,0.0030078702,0.030632311],"study_design_scores_gemma":[0.000021451073,0.00007144897,0.0033306398,0.00004557905,0.000026364542,0.0016319086,0.0006449124,0.022329623,0.0069566136,0.9424865,0.02243607,0.000018761364],"about_ca_topic_score_codex":0.00043871193,"about_ca_topic_score_gemma":0.0007866616,"teacher_disagreement_score":0.005097866,"about_ca_system_score_codex":0.00029430067,"about_ca_system_score_gemma":0.00015966251,"threshold_uncertainty_score":0.017054081},"labels":[],"label_agreement":null},{"id":"W2404107916","doi":"","title":"Characterizations and Structure of Sequential Graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.010124542616694543,"score_gpt":0.2571487610710402,"score_spread":0.24702421845434563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404107916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28917986,0.0027089654,0.5906938,0.0034781995,0.00033960238,0.00041817245,0.004960681,0.0018608284,0.10636002],"genre_scores_gemma":[0.8181113,0.0019238801,0.14254421,0.00072268624,0.0006583065,0.0004170658,0.007396504,0.00064504566,0.02758104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982332,0.0004070649,0.0001624733,0.00064051873,0.00036513933,0.00019163122],"domain_scores_gemma":[0.98838985,0.0053796293,0.0022518365,0.0019351647,0.0012662022,0.0007772689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010648962,0.0008677077,0.00071790285,0.0043864935,0.0018216808,0.0045105675,0.0016131595,0.0012174131,0.01217368],"category_scores_gemma":[0.011545377,0.00084772124,0.0010413205,0.005444914,0.002729301,0.010010022,0.0018759838,0.0022228495,0.0019506095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010473715,0.00008107704,0.002219513,0.00022730013,0.00002848437,0.00020150412,0.000842155,0.0027499122,0.0032600362,0.9613019,0.0044261776,0.024557097],"study_design_scores_gemma":[0.000015595253,0.00004117636,0.0011170077,0.000068875925,0.0000338599,0.0005433401,0.0003988935,0.010149798,0.0015496907,0.96832466,0.017736524,0.00002058348],"about_ca_topic_score_codex":0.0011769964,"about_ca_topic_score_gemma":0.0014981569,"teacher_disagreement_score":0.01217368,"about_ca_system_score_codex":0.001873463,"about_ca_system_score_gemma":0.0009873445,"threshold_uncertainty_score":0.040725052},"labels":[],"label_agreement":null},{"id":"W2404108205","doi":"","title":"On the spectrum of unitary Euclidean graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Unitary state; Mathematics; Spectrum (functional analysis); Euclidean geometry; Euclidean distance; Pure mathematics; Political science; Geometry; Quantum mechanics; Physics","score_opus":0.021164296380712818,"score_gpt":0.25253617238281845,"score_spread":0.23137187600210563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404108205","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38303855,0.012631184,0.21863389,0.0077001876,0.0017023023,0.000057354384,0.000786113,0.0004639248,0.3749865],"genre_scores_gemma":[0.9497202,0.003348418,0.015993912,0.0010460878,0.0010236382,0.00006429915,0.00033043083,0.00017759798,0.028295409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994498,0.00018082737,0.000021310134,0.00009268634,0.00015240411,0.00010294855],"domain_scores_gemma":[0.9987871,0.00050283194,0.00017123192,0.00014461987,0.00015583217,0.00023834854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005732507,0.000744002,0.0006415164,0.0024901622,0.001245791,0.0018654534,0.0008735092,0.001252514,0.008210656],"category_scores_gemma":[0.0031826154,0.00028582054,0.0004849938,0.0010822862,0.0028490154,0.00414007,0.0020697282,0.0018740266,0.001418495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010882714,0.0000066228254,0.000058493042,0.000018238748,0.0000023821922,0.00003121343,0.00006719576,0.0003983933,0.0003042074,0.99529463,0.0012609581,0.002546784],"study_design_scores_gemma":[0.0000043493797,0.0000048126394,0.00010334358,0.000012453203,0.000001537508,0.00005242615,0.00004421314,0.0023567528,0.00007172826,0.9959416,0.0014027362,0.0000038418116],"about_ca_topic_score_codex":0.0009367244,"about_ca_topic_score_gemma":0.00082172756,"teacher_disagreement_score":0.008210656,"about_ca_system_score_codex":0.00089088565,"about_ca_system_score_gemma":0.0003188453,"threshold_uncertainty_score":0.02746737},"labels":[],"label_agreement":null},{"id":"W2404118109","doi":"","title":"Hamiltonian graphs involving neighborhood conditions.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Graph; Hamiltonian (control theory); Independence number; Connectivity; Quartic graph; Graph power; Hamiltonian path; Discrete mathematics; Line graph","score_opus":0.029270861985529723,"score_gpt":0.2944553543768425,"score_spread":0.2651844923913128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404118109","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52668566,0.0014368604,0.31387296,0.0016178838,0.00044885042,0.00020655636,0.0013551407,0.00051613513,0.15385993],"genre_scores_gemma":[0.9355198,0.0006385256,0.049401518,0.00032324388,0.00013765563,0.00014347391,0.0008544217,0.00009362551,0.0128877945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996588,0.000098735574,0.00001464172,0.00007493562,0.000081437705,0.000071500785],"domain_scores_gemma":[0.99811435,0.0010912578,0.00026416752,0.00019183932,0.00015621762,0.00018225308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036595808,0.00029174588,0.0003045172,0.0006885739,0.0010629162,0.0006787646,0.0006326067,0.0005853544,0.008615987],"category_scores_gemma":[0.0025870157,0.00032989946,0.0004232609,0.0005618762,0.00095974194,0.0018816136,0.0012275741,0.0007614847,0.000581615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010261648,0.000053937107,0.0019787054,0.00025892773,0.00003942031,0.0008171841,0.00034901066,0.010687083,0.0065188925,0.94318,0.0069132033,0.029101051],"study_design_scores_gemma":[0.00005491139,0.000038063437,0.0013683408,0.000055338685,0.000044754284,0.00087025575,0.00034650878,0.046566717,0.0032448557,0.9279746,0.019410236,0.000025363384],"about_ca_topic_score_codex":0.00095540326,"about_ca_topic_score_gemma":0.0019725582,"teacher_disagreement_score":0.008615987,"about_ca_system_score_codex":0.0005771564,"about_ca_system_score_gemma":0.000334824,"threshold_uncertainty_score":0.028823376},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Square (algebra); Statistics; Geometry","score_opus":0.010605030798647835,"score_gpt":0.25718626835275066,"score_spread":0.24658123755410283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404127378","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13715477,0.0033288938,0.2484055,0.006194497,0.0027099524,0.00012809946,0.0021021878,0.0013451204,0.59863096],"genre_scores_gemma":[0.77991164,0.0019874356,0.057956364,0.0018583188,0.0011629168,0.00031172577,0.0010720219,0.00042424674,0.15531532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995753,0.000082110906,0.000020599877,0.000094556504,0.000118982876,0.00010840408],"domain_scores_gemma":[0.9986424,0.000638879,0.00016873049,0.00016259974,0.00019249551,0.000194985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051044184,0.0005172806,0.0004449834,0.0016939355,0.00097302353,0.002252741,0.0006698728,0.00073688733,0.03581395],"category_scores_gemma":[0.0039953245,0.00018972882,0.0003021542,0.00095066754,0.0012619477,0.0027595193,0.001516633,0.0012934302,0.008629655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006618157,0.000012423272,0.0001468133,0.00006797294,0.0000064815376,0.000051648003,0.000072451694,0.0009963519,0.00086374074,0.966108,0.012758025,0.018849926],"study_design_scores_gemma":[0.000032794556,0.00005263224,0.00043194526,0.000048834772,0.0000125273655,0.00027544625,0.00008687559,0.008242853,0.0013324259,0.9284764,0.060982063,0.000025043946],"about_ca_topic_score_codex":0.00061542966,"about_ca_topic_score_gemma":0.00093386084,"teacher_disagreement_score":0.03581395,"about_ca_system_score_codex":0.0008328485,"about_ca_system_score_gemma":0.00063321565,"threshold_uncertainty_score":0.11980963},"labels":[],"label_agreement":null},{"id":"W2404128441","doi":"","title":"Metamorphosis problems for graph designs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Metamorphosis; Graph; Combinatorics; Biology; Botany","score_opus":0.02131919775661296,"score_gpt":0.23246361615011185,"score_spread":0.2111444183934989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404128441","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04444939,0.0010498858,0.90628046,0.0021696684,0.00022863504,0.00024396936,0.00051228993,0.00064259866,0.044423077],"genre_scores_gemma":[0.53008157,0.002330541,0.41975304,0.00076887244,0.00030383043,0.00056140433,0.0018108878,0.00040560996,0.043984167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802965,0.0006869631,0.00018838698,0.00040480585,0.00054943055,0.00014076431],"domain_scores_gemma":[0.9939513,0.004222216,0.00047891404,0.000747923,0.00038606251,0.00021364485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020808547,0.0008811166,0.00087017,0.0015040253,0.0011653445,0.0026761058,0.0012374299,0.002043314,0.014093717],"category_scores_gemma":[0.009908219,0.0008744015,0.0019260001,0.0014962436,0.0018439709,0.005360857,0.002354366,0.0028777954,0.0015272471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052594663,0.000127116,0.00061344693,0.00033079696,0.00005044328,0.00019300258,0.00018796007,0.028764922,0.0011619127,0.89905334,0.007638643,0.06182584],"study_design_scores_gemma":[0.000028929564,0.00003392265,0.00011881284,0.000072294984,0.000017952585,0.00017507563,0.00008204589,0.04783126,0.00079963176,0.9437322,0.0070965947,0.000011263513],"about_ca_topic_score_codex":0.0008397492,"about_ca_topic_score_gemma":0.0015091046,"teacher_disagreement_score":0.014093717,"about_ca_system_score_codex":0.001605235,"about_ca_system_score_gemma":0.0012191667,"threshold_uncertainty_score":0.047148228},"labels":[],"label_agreement":null},{"id":"W2404131809","doi":"","title":"Multi-level distance labelings for helm graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.03730367357894914,"score_gpt":0.264582921999417,"score_spread":0.22727924842046787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404131809","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.119175866,0.0012280724,0.7497338,0.002990371,0.00039120569,0.00015595212,0.0018320035,0.0015674484,0.12292528],"genre_scores_gemma":[0.58446586,0.00095676066,0.3511009,0.0010660648,0.00035533126,0.00026957953,0.0026069148,0.0007795337,0.05839908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860257,0.00040059647,0.000087805296,0.000335683,0.00032818876,0.00024510332],"domain_scores_gemma":[0.9954334,0.0022285688,0.00040058422,0.0011102789,0.00041804797,0.00040907526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011514188,0.00053020474,0.0007423282,0.0020522685,0.0024134342,0.0029538865,0.002177502,0.0017449851,0.018618595],"category_scores_gemma":[0.0069393157,0.00063815055,0.00086807203,0.0023537625,0.001828883,0.007228615,0.003898615,0.0031068497,0.0037237636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006283422,0.000061979816,0.0005737017,0.00014796383,0.000013464676,0.000053041756,0.00021122662,0.0040268525,0.0013459733,0.9403111,0.010219213,0.04297273],"study_design_scores_gemma":[0.000014775277,0.000018224095,0.00031315873,0.000051039624,0.000015456224,0.00014002292,0.000214584,0.02205588,0.0016813419,0.9595676,0.015907032,0.000020850575],"about_ca_topic_score_codex":0.0014483305,"about_ca_topic_score_gemma":0.002844516,"teacher_disagreement_score":0.018618595,"about_ca_system_score_codex":0.0019736108,"about_ca_system_score_gemma":0.0008814785,"threshold_uncertainty_score":0.062285364},"labels":[],"label_agreement":null},{"id":"W2404135439","doi":"","title":"A Note on Wiener Indices of Unicyclic Graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Wiener index; Combinatorics; Statistics; Graph","score_opus":0.021139481878837577,"score_gpt":0.299635073351355,"score_spread":0.2784955914725174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404135439","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09504889,0.035310872,0.21812925,0.009281263,0.012411562,0.00005900677,0.0006577087,0.00077563786,0.6283258],"genre_scores_gemma":[0.75428337,0.027771855,0.09859374,0.0035861472,0.006978928,0.0001283959,0.00052753737,0.00083429506,0.107295685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958116,0.00010170781,0.000024984949,0.00007970669,0.00015327179,0.000059182898],"domain_scores_gemma":[0.9986432,0.000715331,0.00012273144,0.00023209957,0.00014365463,0.00014295545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000670285,0.00068005506,0.0007671447,0.0021742026,0.0013739052,0.0019373106,0.0011828042,0.00092036795,0.008068858],"category_scores_gemma":[0.003466598,0.00037977376,0.00050575344,0.0022925907,0.0019147097,0.004567716,0.0021363248,0.0028631997,0.0023901684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020389498,0.000013088088,0.00019711631,0.000070937036,0.000008713011,0.00013993272,0.0001786898,0.00056314527,0.0014385954,0.9691213,0.010393831,0.01785439],"study_design_scores_gemma":[0.0000034146044,0.000015554968,0.00028773939,0.00003057053,0.0000070563983,0.0001847902,0.000071402195,0.0016606016,0.00057857326,0.9668812,0.030265432,0.000013643643],"about_ca_topic_score_codex":0.00055978214,"about_ca_topic_score_gemma":0.0013796863,"teacher_disagreement_score":0.008068858,"about_ca_system_score_codex":0.00064485596,"about_ca_system_score_gemma":0.00032373573,"threshold_uncertainty_score":0.026993036},"labels":[],"label_agreement":null},{"id":"W2404142946","doi":"","title":"Angle Of Contact Of Lens And Lunar Maps And Products Of Composition And Iterated Differentiation.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Theoretical and Applied Studies in Material Sciences and Geometry","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Iterated function; Mathematics; Composition (language); Lens (geology); Optics; Art; Mathematical analysis; Physics; Literature","score_opus":0.004189695741443468,"score_gpt":0.1842188958246857,"score_spread":0.18002920008324225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404142946","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43154645,0.0028550525,0.13906418,0.0014166583,0.0005729541,0.000057394474,0.0004372857,0.00040260982,0.4236474],"genre_scores_gemma":[0.9447669,0.0008023298,0.009635541,0.00012697448,0.00027484985,0.00002872941,0.00017728301,0.00015455383,0.04403285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946827,0.00011594254,0.000027394568,0.00012287538,0.00017352613,0.00009203422],"domain_scores_gemma":[0.99864584,0.0003649398,0.00026130915,0.00012284887,0.000297655,0.00030743793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058738,0.000354142,0.00040172852,0.002209341,0.0013884077,0.0030039859,0.0005334052,0.0006768149,0.012015204],"category_scores_gemma":[0.0034108595,0.00025361707,0.00033344343,0.0008320517,0.0022450513,0.004554533,0.0018349175,0.0014675552,0.0016673695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029768138,0.000008031662,0.00034424436,0.000011081442,0.000003028995,0.00006529499,0.00019570916,0.00019516364,0.00046042522,0.9936626,0.00065328716,0.004371385],"study_design_scores_gemma":[0.000015422378,0.000028129138,0.001164492,0.000022162734,0.000011198883,0.00049784593,0.0005055575,0.0040772995,0.002043136,0.97667104,0.014946001,0.000017691658],"about_ca_topic_score_codex":0.0013413707,"about_ca_topic_score_gemma":0.0013002539,"teacher_disagreement_score":0.012015204,"about_ca_system_score_codex":0.0009279171,"about_ca_system_score_gemma":0.00043246555,"threshold_uncertainty_score":0.04019481},"labels":[],"label_agreement":null},{"id":"W2404156276","doi":"","title":"Long Paths containing k-ordered vertices in Graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.014797750166804078,"score_gpt":0.2744156440679045,"score_spread":0.2596178939011004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404156276","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5753814,0.004979477,0.28654307,0.003721446,0.0010756203,0.00026438653,0.006526425,0.002728372,0.11877971],"genre_scores_gemma":[0.81883734,0.002846314,0.122532256,0.00079979067,0.00028032967,0.0002698937,0.004469188,0.0006944611,0.049270317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917465,0.00017066047,0.00007842237,0.00021943226,0.00015888383,0.00019791337],"domain_scores_gemma":[0.9929248,0.0037308538,0.0012078361,0.00074008154,0.0007071956,0.0006891757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005001473,0.00057946565,0.00052303955,0.0020101613,0.002594464,0.002802635,0.001143412,0.0018840419,0.014874608],"category_scores_gemma":[0.0070456476,0.0007519055,0.0006416212,0.002600635,0.0014699978,0.005866484,0.0025282213,0.001761915,0.0044643874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075054326,0.00014463712,0.004612303,0.0009825743,0.000094306924,0.0022767356,0.0013389268,0.00936653,0.015093903,0.8711792,0.018828606,0.07533174],"study_design_scores_gemma":[0.000038825132,0.00006267992,0.0011104795,0.00017542193,0.000047001988,0.0010256339,0.0005818924,0.009362437,0.004368965,0.9594188,0.02376751,0.00004033342],"about_ca_topic_score_codex":0.0011644418,"about_ca_topic_score_gemma":0.0030193413,"teacher_disagreement_score":0.014874608,"about_ca_system_score_codex":0.0010814401,"about_ca_system_score_gemma":0.0008659736,"threshold_uncertainty_score":0.04976052},"labels":[],"label_agreement":null},{"id":"W2404157195","doi":"","title":"Abstract Ovals Of Order 9.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Order (exchange); Business","score_opus":0.012627319077684721,"score_gpt":0.25523535897619487,"score_spread":0.24260803989851015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404157195","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12996054,0.0015586929,0.46389046,0.0018601194,0.0029169803,0.0005231327,0.005842513,0.004016498,0.38943118],"genre_scores_gemma":[0.5912285,0.001014894,0.13201776,0.0004762241,0.00052530656,0.0002485758,0.005534833,0.0020820738,0.26687187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926466,0.00008178868,0.000058870588,0.00016109011,0.00023641819,0.00019713564],"domain_scores_gemma":[0.99892104,0.0002346758,0.00011458124,0.00020489059,0.00034443365,0.00018043118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042195787,0.0006822411,0.00091097003,0.001588585,0.0017957302,0.002654737,0.0011407785,0.0007553297,0.07029347],"category_scores_gemma":[0.002018038,0.00048037185,0.0009010079,0.0013069061,0.001521247,0.0024097129,0.0020713175,0.0014068157,0.01700399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052545266,0.00010178945,0.0012626013,0.00034014246,0.000038731127,0.00089442113,0.0004961846,0.0032514168,0.014515742,0.84872544,0.046907242,0.08294091],"study_design_scores_gemma":[0.00008586125,0.00012034997,0.0010843001,0.00012460077,0.000042038508,0.00069189747,0.0005728177,0.008133154,0.016111841,0.5942447,0.37873888,0.000049504895],"about_ca_topic_score_codex":0.0013772197,"about_ca_topic_score_gemma":0.001915209,"teacher_disagreement_score":0.07029347,"about_ca_system_score_codex":0.00084203994,"about_ca_system_score_gemma":0.0005764315,"threshold_uncertainty_score":0.2351551},"labels":[],"label_agreement":null},{"id":"W2404160708","doi":"","title":"Self-inverse sequences related to Sheffer sets.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"advanced mathematical theories","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Inverse; Combinatorics; Geometry","score_opus":0.04036860114852381,"score_gpt":0.30283477780042245,"score_spread":0.26246617665189864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404160708","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25861037,0.0042455713,0.22773322,0.0028083092,0.0015213129,0.000080382146,0.00032906924,0.0004272849,0.5042444],"genre_scores_gemma":[0.90424067,0.0014487654,0.0242043,0.0007365736,0.00076400256,0.00006234551,0.00030191636,0.00013373446,0.06810776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992872,0.00019846791,0.00004357496,0.00010679619,0.00025093099,0.00011304167],"domain_scores_gemma":[0.99845004,0.0005939931,0.00019076267,0.00021614926,0.00033618975,0.00021274581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092624134,0.0005290345,0.00045815934,0.0031370164,0.0016815563,0.002545973,0.00058085413,0.00095837034,0.009400247],"category_scores_gemma":[0.0033916445,0.00036454905,0.0006505409,0.0010937763,0.003041822,0.005330655,0.0022763903,0.002616052,0.0015800904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067349733,0.000008055859,0.00010346794,0.000012900422,0.0000025831027,0.00003925807,0.0001072933,0.00013057016,0.000221318,0.99653924,0.0005188224,0.0023097806],"study_design_scores_gemma":[0.000003825102,0.0000072317166,0.00014637623,0.000012036532,0.0000035889293,0.00013608782,0.000069394126,0.0010730193,0.00041906507,0.99424136,0.0038813257,0.0000067993697],"about_ca_topic_score_codex":0.00043875058,"about_ca_topic_score_gemma":0.0005305502,"teacher_disagreement_score":0.009400247,"about_ca_system_score_codex":0.0011098207,"about_ca_system_score_gemma":0.00044963678,"threshold_uncertainty_score":0.031446993},"labels":[],"label_agreement":null},{"id":"W2404163602","doi":"","title":"A Study On Stable, Positive And Negative Edges With Respect To Irregularity Strength Of A Graph.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.01733608514684852,"score_gpt":0.24828316501515454,"score_spread":0.23094707986830604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404163602","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87963164,0.0016893933,0.07871067,0.0012146505,0.0001337275,0.000056353238,0.00043336366,0.0001559564,0.03797429],"genre_scores_gemma":[0.98530316,0.0004392477,0.010133901,0.000103677245,0.000090946174,0.000025177333,0.00018654857,0.00006629486,0.0036510334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909604,0.00035585405,0.00004605513,0.00021699734,0.00015767707,0.00012733351],"domain_scores_gemma":[0.98435163,0.010284525,0.0018934058,0.0012111564,0.001006389,0.0012528871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016195987,0.00039677182,0.0005775503,0.0024075669,0.0012595406,0.0025987283,0.0009381326,0.00088786415,0.0044293264],"category_scores_gemma":[0.0130658895,0.00037119893,0.00050638197,0.0020372295,0.0022113884,0.0034484628,0.0010864395,0.0013080261,0.00031426564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002828986,0.000106897714,0.015662193,0.00015634455,0.00004236344,0.00024603444,0.00044165677,0.017831603,0.008573666,0.92456186,0.0028671918,0.029227337],"study_design_scores_gemma":[0.000046506506,0.00025695766,0.015038816,0.000118445896,0.00012927002,0.0013428471,0.0011270278,0.18757614,0.005968736,0.78014964,0.008168762,0.000076819575],"about_ca_topic_score_codex":0.0010647497,"about_ca_topic_score_gemma":0.0010033333,"teacher_disagreement_score":0.0044293264,"about_ca_system_score_codex":0.0011255302,"about_ca_system_score_gemma":0.00041181254,"threshold_uncertainty_score":0.0148175955},"labels":[],"label_agreement":null},{"id":"W2404171455","doi":"","title":"Codes from embeddings of the strong product of triangular graphs and K 2 and certain induced subgraphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Product (mathematics); Combinatorics; Discrete mathematics; Geometry","score_opus":0.013755864142924078,"score_gpt":0.23026023959278832,"score_spread":0.21650437544986426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404171455","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72130084,0.00074456923,0.18137248,0.0014422053,0.00025465965,0.00010473986,0.0019253762,0.0006536678,0.0922015],"genre_scores_gemma":[0.9712994,0.00023267038,0.0151485065,0.0002088255,0.00009353864,0.000061138606,0.0010263553,0.000103086386,0.011826433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955124,0.0001018458,0.000026900498,0.000089394845,0.000121923105,0.00010865825],"domain_scores_gemma":[0.9979522,0.0008631618,0.0004611795,0.0003444509,0.00019710592,0.00018173891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025113625,0.00041119233,0.00028519146,0.0006557991,0.00072577444,0.0015003906,0.0005969154,0.0009329057,0.006007359],"category_scores_gemma":[0.00287883,0.00030411303,0.00043149287,0.00079067284,0.0010890943,0.0023384797,0.0017233668,0.0012625878,0.0007780044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024963054,0.000046420024,0.0010260191,0.000101882375,0.00001742548,0.0003602159,0.0005095999,0.008428349,0.004687369,0.96285594,0.00563134,0.016085848],"study_design_scores_gemma":[0.000035358913,0.000040447325,0.00075826043,0.00003304654,0.000014944546,0.00028931512,0.00017810236,0.025230514,0.0030795452,0.96480477,0.005511044,0.000024653775],"about_ca_topic_score_codex":0.001250316,"about_ca_topic_score_gemma":0.0018336689,"teacher_disagreement_score":0.006007359,"about_ca_system_score_codex":0.0006488953,"about_ca_system_score_gemma":0.0004977403,"threshold_uncertainty_score":0.02009666},"labels":[],"label_agreement":null},{"id":"W2404171678","doi":"","title":"Small Complete Caps In Galois Spaces.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.025626231001825296,"score_gpt":0.2279426662588811,"score_spread":0.2023164352570558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404171678","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35453182,0.0049849655,0.23780873,0.0038099089,0.00075868686,0.00020215084,0.0014265055,0.0016421021,0.39483514],"genre_scores_gemma":[0.9425799,0.0010547279,0.012963464,0.00030075977,0.00040149613,0.00007932141,0.0005883084,0.00020494589,0.04182704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990583,0.00029295616,0.000042798656,0.0001974859,0.0002333108,0.00017520926],"domain_scores_gemma":[0.99812144,0.0008184036,0.00017645623,0.00039110874,0.00016172086,0.00033082042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008677904,0.0008068648,0.0006929335,0.0015789528,0.0017531511,0.004287616,0.0007062848,0.0006734334,0.017650176],"category_scores_gemma":[0.003291499,0.0005181565,0.00075409515,0.0012721198,0.0038139739,0.008103379,0.004391832,0.0023737913,0.0024925924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057032776,0.000013698978,0.00020391915,0.000061827006,0.0000094564475,0.00006608779,0.0002066472,0.0007891978,0.00057745905,0.9897065,0.0025057462,0.0058024717],"study_design_scores_gemma":[0.000023575549,0.000026158796,0.00022613358,0.000024273144,0.000013998108,0.00014183816,0.00017921321,0.0019928385,0.0014998943,0.9818465,0.014013872,0.000011747682],"about_ca_topic_score_codex":0.00055577623,"about_ca_topic_score_gemma":0.00069702003,"teacher_disagreement_score":0.017650176,"about_ca_system_score_codex":0.0009337696,"about_ca_system_score_gemma":0.00047012814,"threshold_uncertainty_score":0.059045732},"labels":[],"label_agreement":null},{"id":"W2404191035","doi":"","title":"Some Identities for Leibniz Numbers.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.008054133415898581,"score_gpt":0.27141768898820917,"score_spread":0.2633635555723106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404191035","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02851043,0.027451925,0.17775819,0.014522062,0.004105388,0.000083571074,0.0019982846,0.00043161816,0.74513847],"genre_scores_gemma":[0.60632104,0.025198802,0.10824352,0.006284019,0.006533143,0.0003532452,0.0030783988,0.0004871535,0.24350068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890625,0.00028564778,0.00010302099,0.00013849919,0.0004447053,0.00012177426],"domain_scores_gemma":[0.9987697,0.00051602005,0.000095517804,0.00016798016,0.00033047574,0.00012028218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002040878,0.00079751003,0.0006122925,0.0035274622,0.002975389,0.0046358374,0.000959214,0.0014692324,0.015126125],"category_scores_gemma":[0.003942114,0.0004724217,0.00093853305,0.0023158279,0.0029994207,0.009557016,0.0025065504,0.0036777013,0.005986754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022245977,0.000004798413,0.000044313212,0.000022344175,0.0000019957506,0.00002826905,0.0000820565,0.00003970294,0.000088206965,0.99134165,0.0050098747,0.0033346063],"study_design_scores_gemma":[0.0000029203152,0.0000031843647,0.00010717872,0.000019931074,0.0000034017012,0.00008223745,0.000040748633,0.00024264562,0.00011215759,0.98157835,0.01780131,0.0000059829727],"about_ca_topic_score_codex":0.0014626844,"about_ca_topic_score_gemma":0.002079553,"teacher_disagreement_score":0.015126125,"about_ca_system_score_codex":0.0019223326,"about_ca_system_score_gemma":0.0011091046,"threshold_uncertainty_score":0.05060196},"labels":[],"label_agreement":null},{"id":"W2404220842","doi":"","title":"A new construction of pooling designs based on bilinear forms.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Physics and Engineering Research Articles","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Pooling; Bilinear interpolation; Mathematics; Statistics; Artificial intelligence; Computer science","score_opus":0.02452054730371539,"score_gpt":0.23736995548755238,"score_spread":0.212849408183837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404220842","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03273128,0.000382884,0.93022466,0.0004422611,0.000555822,0.00018164878,0.00038023276,0.0009288801,0.03417222],"genre_scores_gemma":[0.54337776,0.0007338411,0.41044232,0.0010131547,0.0006676766,0.0005898682,0.0007940093,0.00064861693,0.041732717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834096,0.00041260358,0.000120693294,0.00037940906,0.0004870731,0.00025919746],"domain_scores_gemma":[0.99797076,0.00039608925,0.00018837245,0.0007706198,0.0003021763,0.00037205187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016692732,0.0009831955,0.000958975,0.0010469042,0.0013586929,0.0022747838,0.0014452987,0.0011003248,0.012528616],"category_scores_gemma":[0.0040764576,0.00077148585,0.0012406134,0.0009367392,0.0019142029,0.00415246,0.0052904272,0.0025950726,0.004047549],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016542673,0.000093147544,0.00034467963,0.00015845626,0.000033954675,0.00017168683,0.0002450397,0.0027370811,0.01088293,0.9197074,0.0075472756,0.057912905],"study_design_scores_gemma":[0.00008057397,0.0003576313,0.0002660675,0.000079241465,0.000064080574,0.0005822088,0.000087018016,0.029522909,0.012629483,0.9145061,0.041752115,0.000072521936],"about_ca_topic_score_codex":0.00028874737,"about_ca_topic_score_gemma":0.00042275648,"teacher_disagreement_score":0.012528616,"about_ca_system_score_codex":0.0006050397,"about_ca_system_score_gemma":0.00085277914,"threshold_uncertainty_score":0.041912436},"labels":[],"label_agreement":null},{"id":"W2404232981","doi":"","title":"Note on the number of rooted complete N-ary trees.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.020299227730678764,"score_gpt":0.2957994487092154,"score_spread":0.2755002209785366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404232981","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1285751,0.025681147,0.17128901,0.040574033,0.007583492,0.00019119993,0.007032763,0.0014727426,0.61760056],"genre_scores_gemma":[0.7970788,0.019575631,0.107622765,0.003703555,0.0063073626,0.00047252624,0.0033831415,0.000565301,0.061290897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99745435,0.0004180917,0.00016016098,0.00080716464,0.00083785376,0.00032240586],"domain_scores_gemma":[0.97918653,0.01582626,0.0007940269,0.0017965084,0.0012338258,0.0011628564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021189968,0.00072750007,0.0013200049,0.003426255,0.001865957,0.0039740754,0.0025262018,0.0015337464,0.01900572],"category_scores_gemma":[0.016043374,0.0006162135,0.0009525679,0.0034695049,0.0036445772,0.009052089,0.0034831644,0.0042503914,0.002819387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004870277,0.000086850305,0.0031800668,0.0008010336,0.00009039283,0.00047917964,0.00022099316,0.0053038,0.0033747198,0.8677962,0.05007229,0.06810752],"study_design_scores_gemma":[0.000047834998,0.00007150201,0.0021415742,0.00011265249,0.00007485789,0.0012644739,0.0001003704,0.0055452613,0.0018844558,0.9409974,0.04772563,0.00003410524],"about_ca_topic_score_codex":0.0009617029,"about_ca_topic_score_gemma":0.001601219,"teacher_disagreement_score":0.01900572,"about_ca_system_score_codex":0.0013262528,"about_ca_system_score_gemma":0.0010412273,"threshold_uncertainty_score":0.06358045},"labels":[],"label_agreement":null},{"id":"W2404234731","doi":"","title":"On the generalized competition index of a regular or almost regular tournament.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Sports Analytics and Performance","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tournament; Mathematics; Index (typography); Competition (biology); Combinatorics; Computer science; World Wide Web; Biology","score_opus":0.01967860267360897,"score_gpt":0.20740553822621904,"score_spread":0.18772693555261008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404234731","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78914285,0.0017891737,0.15287277,0.0018349561,0.00030593335,0.00009058599,0.0014176196,0.00031531302,0.052230854],"genre_scores_gemma":[0.98471165,0.00037253904,0.009573436,0.00016033826,0.00027612384,0.000052624982,0.00055307784,0.000062352854,0.004237926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856645,0.0005875379,0.000074225965,0.00029998826,0.00022129834,0.0002504238],"domain_scores_gemma":[0.9878027,0.006774738,0.0019618503,0.00089515105,0.00064923277,0.0019164718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024018863,0.00065124995,0.0015137764,0.0029371127,0.0007969091,0.003322537,0.0016632472,0.0009935545,0.007690336],"category_scores_gemma":[0.018080756,0.00027498874,0.00070735475,0.0026935004,0.002949483,0.004297457,0.001911472,0.0016119597,0.000598397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024187416,0.00014239756,0.010325449,0.00013199347,0.00010964057,0.00012963123,0.00016588246,0.04407276,0.0011881158,0.91112214,0.008094558,0.024275469],"study_design_scores_gemma":[0.00004131326,0.000085609514,0.006923554,0.000048226266,0.000032172255,0.00013627285,0.0001427147,0.19610128,0.00020970461,0.7938682,0.0023692115,0.000041706513],"about_ca_topic_score_codex":0.0017599058,"about_ca_topic_score_gemma":0.0014158982,"teacher_disagreement_score":0.007690336,"about_ca_system_score_codex":0.0015134354,"about_ca_system_score_gemma":0.0007239038,"threshold_uncertainty_score":0.025726736},"labels":[],"label_agreement":null},{"id":"W2404236729","doi":"","title":"Qualitative Behavior Of A Rational Difference Equation.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Intelligent Tutoring Systems and Adaptive Learning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.10122272059756181,"score_gpt":0.31684559800995327,"score_spread":0.21562287741239144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404236729","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17076443,0.0008152957,0.68063205,0.0037807946,0.00030024673,0.00007594519,0.0004147129,0.00047843633,0.14273804],"genre_scores_gemma":[0.9548233,0.00021728265,0.026242243,0.0001597755,0.000039300532,0.000055873516,0.00011161693,0.0000906863,0.018259991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955887,0.00013093732,0.000015529546,0.000049094935,0.00018869183,0.000056825855],"domain_scores_gemma":[0.9989504,0.0005741414,0.0001036043,0.00007043361,0.00020807603,0.00009342861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008147796,0.00034091942,0.00032339117,0.0005934567,0.00053113414,0.001438618,0.0006352327,0.0008958602,0.011585971],"category_scores_gemma":[0.004261738,0.0002596044,0.00045413038,0.00031642243,0.0016016092,0.0014503684,0.0010101887,0.0010758537,0.0010057766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002312845,0.000015751157,0.00036924524,0.000026267719,0.000011721006,0.000066293345,0.00013594705,0.01454883,0.002009495,0.9789007,0.0011019113,0.002790759],"study_design_scores_gemma":[0.000040193136,0.000021660559,0.00027791804,0.000021103999,0.000009667783,0.00006975716,0.00009124377,0.30326286,0.0011293109,0.6922489,0.002811151,0.000016369562],"about_ca_topic_score_codex":0.0032730992,"about_ca_topic_score_gemma":0.001601472,"teacher_disagreement_score":0.011585971,"about_ca_system_score_codex":0.001504422,"about_ca_system_score_gemma":0.00076366804,"threshold_uncertainty_score":0.038758993},"labels":[],"label_agreement":null},{"id":"W2404238687","doi":"","title":"A Property of the Roots of r-D Rook Polynomials.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Property (philosophy); Combinatorics; Pure mathematics","score_opus":0.008091183198022657,"score_gpt":0.21466628317159012,"score_spread":0.20657509997356746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404238687","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38935694,0.003405545,0.20962541,0.0045793564,0.0012131456,0.00017541765,0.001748478,0.0013761254,0.38851967],"genre_scores_gemma":[0.9662312,0.00063068036,0.00982087,0.0004093229,0.0004244558,0.00003099791,0.00030310833,0.0001213572,0.022027915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993237,0.00008710355,0.00003544577,0.0002150511,0.00018017954,0.0001584694],"domain_scores_gemma":[0.9982628,0.00060428656,0.00026243465,0.0004211987,0.0002519822,0.00019739794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004003318,0.00041517723,0.0005829542,0.0011458761,0.0013986815,0.002524795,0.0005993053,0.00067523995,0.01287793],"category_scores_gemma":[0.0057977065,0.00027600364,0.0004090842,0.0012415804,0.002345654,0.00342299,0.0019832416,0.0019996834,0.004504006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022748194,0.000051554307,0.0011113038,0.00016635239,0.000016489992,0.00030531362,0.00044743964,0.0009987038,0.008837234,0.93175906,0.0074076783,0.04867146],"study_design_scores_gemma":[0.00010013139,0.00015011618,0.0015809053,0.000080416095,0.000035217803,0.0015694136,0.00038317993,0.0038302154,0.008940245,0.93638,0.04687541,0.00007467265],"about_ca_topic_score_codex":0.00067078095,"about_ca_topic_score_gemma":0.0006186008,"teacher_disagreement_score":0.01287793,"about_ca_system_score_codex":0.0006326968,"about_ca_system_score_gemma":0.0005230336,"threshold_uncertainty_score":0.043080986},"labels":[],"label_agreement":null},{"id":"W2404318628","doi":"","title":"On Regular Graphs with Complete Tripartite Star Complements.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Star (game theory); Combinatorics; Mathematical analysis","score_opus":0.06989763830698675,"score_gpt":0.3015556413172234,"score_spread":0.23165800301023665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404318628","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31151655,0.0042598085,0.31986624,0.0055956007,0.0011080785,0.00021642358,0.0020467439,0.0007644294,0.3546261],"genre_scores_gemma":[0.83957535,0.0038337253,0.07597036,0.0016250069,0.0011274648,0.00029343177,0.0022884603,0.00046645442,0.074819736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868864,0.0004365862,0.000067889596,0.0002755929,0.00029798728,0.00023329764],"domain_scores_gemma":[0.99554366,0.0022833792,0.00074349775,0.0004433087,0.00047579952,0.00051037566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079882203,0.0008127015,0.001077226,0.0031101923,0.0024193919,0.0036747954,0.0016807441,0.0018054345,0.012538425],"category_scores_gemma":[0.005134423,0.00082679914,0.0011259838,0.0026274333,0.0032939797,0.0071118497,0.0032835917,0.0029185961,0.0025102391],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036114678,0.00002338725,0.00020388815,0.00009693644,0.000016301417,0.00015003662,0.00019510102,0.0015143771,0.00047302857,0.98650694,0.004664374,0.00611941],"study_design_scores_gemma":[0.000010968013,0.000009392127,0.00017150676,0.00003699287,0.000012885844,0.00023217592,0.00014713591,0.0052778684,0.00022748794,0.98818016,0.005682195,0.000011195746],"about_ca_topic_score_codex":0.001698834,"about_ca_topic_score_gemma":0.0022812376,"teacher_disagreement_score":0.012538425,"about_ca_system_score_codex":0.0015728936,"about_ca_system_score_gemma":0.00065952726,"threshold_uncertainty_score":0.04194522},"labels":[],"label_agreement":null},{"id":"W2404341627","doi":"","title":"More Identities And Tridiagonal Matrices About Fibonacci And Lucas Numbers.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Tridiagonal matrix; Mathematics; Lucas number; Lucas sequence; Fibonacci polynomials; Pisano period; Combinatorics; Algebra over a field; Pure mathematics; Orthogonal polynomials; Classical orthogonal polynomials; Eigenvalues and eigenvectors","score_opus":0.00546337756305458,"score_gpt":0.24977821970253714,"score_spread":0.24431484213948257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404341627","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07289542,0.017194485,0.22216208,0.011016076,0.0076141115,0.000078605604,0.0011681451,0.0005305223,0.6673406],"genre_scores_gemma":[0.62383527,0.008127077,0.116550006,0.005778519,0.0056532794,0.00017200511,0.0014613122,0.0005440818,0.23787847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994791,0.00010943763,0.000032272757,0.000087784785,0.00021260267,0.00007885633],"domain_scores_gemma":[0.9991135,0.00028314162,0.00011699168,0.00014982927,0.00024102881,0.000095449046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008894251,0.00076159684,0.000609818,0.00232691,0.0020609058,0.0035163239,0.0007400936,0.0015559174,0.023045776],"category_scores_gemma":[0.003083585,0.00037531013,0.0009397652,0.0017996586,0.002330771,0.0074372306,0.0014425747,0.0026520605,0.0047567184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008744722,0.000009477971,0.000054272918,0.000020153655,0.0000018334711,0.000055210563,0.00017629292,0.00015558879,0.00031291714,0.99003965,0.0044215363,0.004744358],"study_design_scores_gemma":[0.0000039253673,0.000007039853,0.000106602405,0.000014917617,0.0000027506062,0.00010841279,0.00007643856,0.00058660796,0.00018330259,0.981138,0.01776025,0.000011860367],"about_ca_topic_score_codex":0.0018011369,"about_ca_topic_score_gemma":0.003475987,"teacher_disagreement_score":0.023045776,"about_ca_system_score_codex":0.0012220285,"about_ca_system_score_gemma":0.00056584034,"threshold_uncertainty_score":0.07709581},"labels":[],"label_agreement":null},{"id":"W2404354977","doi":"","title":"On Constructions which yield Fully Magic Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; MAGIC (telescope); Yield (engineering); Combinatorics; Composite material; Materials science; Astronomy; Physics","score_opus":0.015235640461991422,"score_gpt":0.22582591326209314,"score_spread":0.21059027280010173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404354977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19578382,0.0030159352,0.4449496,0.0073734075,0.0006350031,0.0002491991,0.0019917646,0.0023465862,0.3436546],"genre_scores_gemma":[0.7608893,0.0026567532,0.18726167,0.0022841962,0.00033364983,0.00040615228,0.0025366056,0.0011967139,0.042435024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808085,0.0006990452,0.000105337924,0.0003312363,0.00038814073,0.00039549236],"domain_scores_gemma":[0.99179345,0.005526324,0.000532389,0.0013900326,0.0003691436,0.00038863544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018332351,0.0007961326,0.00067566027,0.0019399743,0.00270191,0.0034506675,0.001546873,0.0020007885,0.013996222],"category_scores_gemma":[0.008591864,0.0009917174,0.0011084055,0.0025892807,0.0038823867,0.010825799,0.0058040097,0.0038321158,0.0027119662],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005622639,0.000039852308,0.00030360065,0.000108430584,0.000009569462,0.000060983482,0.0002478318,0.001852096,0.0009968285,0.9741399,0.007908798,0.014275881],"study_design_scores_gemma":[0.000014511444,0.000008126562,0.00011315107,0.000041703035,0.0000092224345,0.00007702969,0.0001152186,0.0035560485,0.0007597915,0.9893461,0.0059469123,0.000012269829],"about_ca_topic_score_codex":0.001047199,"about_ca_topic_score_gemma":0.0025220287,"teacher_disagreement_score":0.013996222,"about_ca_system_score_codex":0.0018873097,"about_ca_system_score_gemma":0.00091291725,"threshold_uncertainty_score":0.04682201},"labels":[],"label_agreement":null},{"id":"W2404360708","doi":"","title":"Gracefulness Of A Cycle With Parallel Chords And Parallel P k -Chords Of Different Lengths.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Arithmetic","score_opus":0.009770357163489231,"score_gpt":0.21984016642465065,"score_spread":0.21006980926116142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404360708","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70152986,0.00087322894,0.15059616,0.0025913331,0.00034307444,0.00022221377,0.0026010673,0.00082854077,0.1404146],"genre_scores_gemma":[0.94687116,0.0003511735,0.028379995,0.00037584503,0.00015216012,0.00010385883,0.0013577724,0.00022637937,0.022181595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993382,0.000121172714,0.000049831535,0.00019787536,0.00011024245,0.00018278675],"domain_scores_gemma":[0.9972746,0.0010609959,0.00037958997,0.00062526116,0.00020061349,0.00045906656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048681817,0.00043326415,0.0005016508,0.0010322222,0.0024496734,0.0027959424,0.0011913622,0.001093842,0.013037304],"category_scores_gemma":[0.0033517964,0.00060930464,0.0009850134,0.0012490377,0.0020431867,0.003713948,0.0025932242,0.001594224,0.0013674814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059395045,0.00006912437,0.0017149547,0.00015603169,0.000033217297,0.00036309435,0.0007289937,0.005549648,0.008232164,0.95341724,0.007478566,0.021663101],"study_design_scores_gemma":[0.00008460573,0.000072400035,0.0012799951,0.000042317974,0.0000466596,0.000518718,0.00045035675,0.01222572,0.0041234093,0.9666473,0.014462344,0.000046282057],"about_ca_topic_score_codex":0.0039978335,"about_ca_topic_score_gemma":0.0037392303,"teacher_disagreement_score":0.013037304,"about_ca_system_score_codex":0.0011340302,"about_ca_system_score_gemma":0.00091209554,"threshold_uncertainty_score":0.04361409},"labels":[],"label_agreement":null},{"id":"W2404371155","doi":"","title":"Some new monoid and group constructions under semidirect products.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Monoid; Group (periodic table); Semidirect product; Algebra over a field; Pure mathematics; Chemistry; Organic chemistry","score_opus":0.009443995149665058,"score_gpt":0.21686068752378948,"score_spread":0.2074166923741244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404371155","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13816516,0.017169584,0.496192,0.0055273604,0.0033167629,0.00022165409,0.0012021262,0.0013187346,0.3368866],"genre_scores_gemma":[0.7132093,0.0060140165,0.174363,0.0020579314,0.002133188,0.00041690626,0.001083929,0.00054599356,0.10017564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870825,0.0003804915,0.00013346423,0.00026912885,0.0003814492,0.00012724574],"domain_scores_gemma":[0.998755,0.0004902793,0.0001325244,0.00021553936,0.00019000431,0.00021671092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015475132,0.000656753,0.00063124497,0.0020874755,0.0020658623,0.0040305615,0.0009358846,0.0011713058,0.008946568],"category_scores_gemma":[0.0022645635,0.00067788933,0.001105198,0.0018651107,0.0034571143,0.008852944,0.003548526,0.0026867457,0.0023137159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023742854,0.000024310815,0.00012157112,0.000061547646,0.0000061311116,0.00015119991,0.0003581608,0.00017568107,0.0008402407,0.9873669,0.0022012724,0.008669154],"study_design_scores_gemma":[0.0000134618695,0.000031040334,0.00018321669,0.000030268355,0.000014557694,0.00054754666,0.00013838522,0.0011994331,0.0011500721,0.96505994,0.031610403,0.000021705322],"about_ca_topic_score_codex":0.00037996424,"about_ca_topic_score_gemma":0.00066440296,"teacher_disagreement_score":0.008946568,"about_ca_system_score_codex":0.0015123945,"about_ca_system_score_gemma":0.00062786805,"threshold_uncertainty_score":0.02992928},"labels":[],"label_agreement":null},{"id":"W2404383345","doi":"","title":"Random mappings with Ewens cycle structure","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Random permutation; Poisson distribution; Permutation (music); Order (exchange); Vertex (graph theory); Distribution (mathematics); Mathematical sciences; Dirichlet distribution; Discrete mathematics; Statistics; Symmetric group; Mathematical analysis","score_opus":0.005309925755462508,"score_gpt":0.20880699473674294,"score_spread":0.20349706898128042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404383345","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5891629,0.000689506,0.4009228,0.0005563431,0.00009220957,0.0001964035,0.00029399287,0.00034745937,0.00773843],"genre_scores_gemma":[0.94948685,0.00044401563,0.03907285,0.00019545513,0.00007788686,0.00025637363,0.00037810262,0.00009658011,0.009991895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989517,0.00036670337,0.000037957165,0.000263831,0.00023801163,0.00014177627],"domain_scores_gemma":[0.9966217,0.001979732,0.00039924972,0.0004935557,0.00024071975,0.00026497585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020334406,0.0005063641,0.00086981774,0.0020139338,0.00079675764,0.0014070275,0.001341388,0.0014613173,0.0036508264],"category_scores_gemma":[0.010577823,0.0005665224,0.0010129015,0.001171269,0.002596648,0.0030991843,0.0011275467,0.0011098587,0.0004226797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011435739,0.00006715758,0.0031585768,0.00007742134,0.000053764306,0.0003366142,0.0002803487,0.09071285,0.004507411,0.8877994,0.0007194631,0.012172459],"study_design_scores_gemma":[0.0000509562,0.00008925973,0.0016426601,0.000024021916,0.000017897479,0.0002454803,0.00010511862,0.5785472,0.0018582093,0.41503227,0.002338808,0.000048179714],"about_ca_topic_score_codex":0.0020553607,"about_ca_topic_score_gemma":0.0016327183,"teacher_disagreement_score":0.0036508264,"about_ca_system_score_codex":0.0015385617,"about_ca_system_score_gemma":0.00053448573,"threshold_uncertainty_score":0.0122131705},"labels":[],"label_agreement":null},{"id":"W2404387207","doi":"","title":"Genralized Frobenius partitions and mock-theta functions.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.07112460593665482,"score_gpt":0.2926645719145958,"score_spread":0.22153996597794096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404387207","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35314977,0.0023885735,0.14976485,0.0034802593,0.0011477623,0.00006565605,0.000477742,0.00042576113,0.48909965],"genre_scores_gemma":[0.9152557,0.00061600195,0.017079229,0.00041368703,0.0003181804,0.00005251301,0.00023462919,0.00016554829,0.0658645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994191,0.0001486339,0.000023832778,0.000090710295,0.00017307368,0.00014465109],"domain_scores_gemma":[0.99934274,0.00013508627,0.00009076981,0.00013575227,0.00014784672,0.00014781626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075409014,0.0005143743,0.00050344615,0.0016306728,0.0017169734,0.0025942014,0.0006888089,0.0008293343,0.011317419],"category_scores_gemma":[0.0027966856,0.0002802131,0.0005377408,0.00064014125,0.0029703714,0.004053383,0.0026844926,0.0021241596,0.0025961502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007308278,0.0000033069791,0.00006862917,0.000005370891,0.0000012423828,0.000016236188,0.00006203623,0.000102540835,0.00017513141,0.9976501,0.00054230215,0.0013657634],"study_design_scores_gemma":[0.000006263762,0.000005133654,0.00018506819,0.000010205987,0.000002474654,0.000095279116,0.00008338989,0.0011784766,0.00034960473,0.9935062,0.0045715594,0.000006441103],"about_ca_topic_score_codex":0.0009248983,"about_ca_topic_score_gemma":0.001249354,"teacher_disagreement_score":0.011317419,"about_ca_system_score_codex":0.001126708,"about_ca_system_score_gemma":0.0006301675,"threshold_uncertainty_score":0.037860572},"labels":[],"label_agreement":null},{"id":"W2404406388","doi":"","title":"Diagonally switchable λ-fold 4-cycle systems, λ > 1.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"14-3-3 protein interactions","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fold (higher-order function); Mathematics; Combinatorics; Computer science; Programming language","score_opus":0.0052422336728127255,"score_gpt":0.235489125023063,"score_spread":0.23024689135025025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404406388","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74805325,0.0012007287,0.076486744,0.0008043748,0.0003379606,0.00014850842,0.0007811271,0.0010226722,0.17116451],"genre_scores_gemma":[0.96224296,0.00037562507,0.010234976,0.00017653445,0.000044858596,0.00014557908,0.0004216063,0.00010823316,0.026249608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997316,0.00005416434,0.00001580588,0.000044344666,0.00006728728,0.00008670713],"domain_scores_gemma":[0.9996635,0.00009821472,0.00005556148,0.00005205748,0.000039467057,0.00009130249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021221026,0.0004953565,0.00043761905,0.00073540397,0.000880441,0.0013175406,0.0008446054,0.000645977,0.017464194],"category_scores_gemma":[0.00079481106,0.0002686019,0.00034607755,0.00045324725,0.00078525086,0.0012526195,0.0012979142,0.0006981392,0.0019141254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034265567,0.00009217818,0.00042173322,0.0001548108,0.000026512402,0.00021504199,0.00017210595,0.0129614035,0.018560689,0.9383146,0.004557239,0.02418112],"study_design_scores_gemma":[0.00012892713,0.00015364318,0.00050211936,0.00002669297,0.000020700587,0.00016472618,0.00014284046,0.059582226,0.011113192,0.91255194,0.015548957,0.00006416447],"about_ca_topic_score_codex":0.0010776771,"about_ca_topic_score_gemma":0.0017297091,"teacher_disagreement_score":0.017464194,"about_ca_system_score_codex":0.00088927214,"about_ca_system_score_gemma":0.00046824326,"threshold_uncertainty_score":0.05842352},"labels":[],"label_agreement":null},{"id":"W2404415034","doi":"","title":"The Singular Chromatic Number of a Graph.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Graph; Combinatorics; Discrete mathematics","score_opus":0.016086258748206995,"score_gpt":0.24622616486728965,"score_spread":0.23013990611908267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404415034","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.645171,0.002652062,0.11023572,0.00882611,0.00077039754,0.0000975022,0.0035711299,0.0006419958,0.2280341],"genre_scores_gemma":[0.9632135,0.0009444443,0.017899735,0.00033110444,0.00030839347,0.00006105193,0.00085097324,0.00015565034,0.016235068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992619,0.00015699634,0.000032411466,0.00025916504,0.00014540323,0.00014407659],"domain_scores_gemma":[0.9965065,0.0018193999,0.00041478037,0.0004333508,0.0002790877,0.0005468344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007299995,0.00054855243,0.00059387286,0.0028568276,0.002242503,0.0036815037,0.0012193606,0.0014438191,0.013890911],"category_scores_gemma":[0.005239438,0.00040157902,0.0005293889,0.0023169683,0.004328295,0.004838627,0.0017607026,0.0020998968,0.001435038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014571627,0.000031583695,0.001896592,0.00013230357,0.000025862544,0.000069211565,0.00030021957,0.0048992606,0.0024827416,0.964593,0.010268904,0.01515459],"study_design_scores_gemma":[0.000019374402,0.000017462264,0.0010553167,0.000042064177,0.000024562367,0.0001887517,0.00024256547,0.014448121,0.0015611316,0.97362536,0.008754128,0.000021197115],"about_ca_topic_score_codex":0.0027109578,"about_ca_topic_score_gemma":0.0032033387,"teacher_disagreement_score":0.013890911,"about_ca_system_score_codex":0.0024266855,"about_ca_system_score_gemma":0.0009835997,"threshold_uncertainty_score":0.046469748},"labels":[],"label_agreement":null},{"id":"W2404421201","doi":"","title":"The cordiality of the complement of a graph.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Complement (music); Mathematics; Graph; Combinatorics","score_opus":0.01919454894763078,"score_gpt":0.28610220613432136,"score_spread":0.2669076571866906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404421201","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18531507,0.0043290965,0.22523886,0.007595012,0.002500117,0.0001004071,0.0015402086,0.00064657006,0.5727347],"genre_scores_gemma":[0.8771061,0.0025142066,0.050153818,0.0021243158,0.0016568693,0.00012957408,0.0011217617,0.00037745843,0.064815946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986822,0.00035861414,0.000062187115,0.00040911805,0.0002935102,0.00019439343],"domain_scores_gemma":[0.99587774,0.0019226272,0.00037569116,0.0006063411,0.0007179285,0.0004996174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009126738,0.00060759886,0.0007013735,0.0026912752,0.0029053409,0.004600235,0.0010106277,0.0012643901,0.016699323],"category_scores_gemma":[0.0069526294,0.00045337866,0.0009315543,0.0019775343,0.0065617654,0.007318149,0.0034005435,0.0032891864,0.002302315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024549476,0.000006644925,0.00011319899,0.000026689992,0.000004745591,0.00005270365,0.000121697885,0.0001644416,0.000332236,0.9923718,0.0019655423,0.004815715],"study_design_scores_gemma":[0.000008018839,0.000012008373,0.00016903308,0.00002678323,0.000008775934,0.00018610156,0.00008002564,0.0011305418,0.00047205156,0.9838922,0.014003958,0.000010530117],"about_ca_topic_score_codex":0.0033308323,"about_ca_topic_score_gemma":0.0029096913,"teacher_disagreement_score":0.016699323,"about_ca_system_score_codex":0.0015878818,"about_ca_system_score_gemma":0.0010830057,"threshold_uncertainty_score":0.05586475},"labels":[],"label_agreement":null},{"id":"W2404426095","doi":"","title":"The Signed Total Domination Number of Graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Domination analysis; Combinatorics; Graph; Vertex (graph theory)","score_opus":0.017725726149767678,"score_gpt":0.2737648429059831,"score_spread":0.2560391167562154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404426095","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67302567,0.0021463083,0.11888194,0.0021599499,0.00069136726,0.000088265195,0.0032842527,0.0006526694,0.19906966],"genre_scores_gemma":[0.97597945,0.00083777134,0.009230552,0.00015940638,0.00022583647,0.0000845744,0.000736529,0.00010095062,0.012644941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992513,0.00018820037,0.00005232983,0.00013566078,0.00024258297,0.00013003343],"domain_scores_gemma":[0.9948835,0.0026931171,0.00072415237,0.00048677233,0.0006459468,0.0005665472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081959466,0.00044507353,0.00045701218,0.0028045173,0.00086300564,0.0026747342,0.00078054075,0.00060108927,0.009369181],"category_scores_gemma":[0.008151636,0.00021634345,0.00028057455,0.0019147906,0.0016569613,0.0041827406,0.0011211145,0.0008941666,0.0009975239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031963247,0.000044965855,0.0037606622,0.00024669856,0.00005715533,0.00013151021,0.00030017958,0.007203284,0.0072214454,0.9009015,0.011037216,0.06877568],"study_design_scores_gemma":[0.00003684089,0.000060611314,0.002585624,0.00007120221,0.000043959462,0.0005075739,0.0001958271,0.020473506,0.0047582723,0.95486593,0.016362138,0.00003866065],"about_ca_topic_score_codex":0.00044844448,"about_ca_topic_score_gemma":0.0007602879,"teacher_disagreement_score":0.009369181,"about_ca_system_score_codex":0.0009957606,"about_ca_system_score_gemma":0.0006119489,"threshold_uncertainty_score":0.031343102},"labels":[],"label_agreement":null},{"id":"W2404460159","doi":"","title":"The relations among k-Fibonacci, k-Lucas and generalized k-Fibonacci numbers and the spectral norms of the matrices of involving these numbers.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Lucas number; Mathematics; Pisano period; Lucas sequence; Fibonacci polynomials; Recurrence relation; Combinatorics; Pure mathematics; Arithmetic; Algebra over a field; Orthogonal polynomials; Classical orthogonal polynomials","score_opus":0.008298297715818389,"score_gpt":0.2220503159066483,"score_spread":0.21375201819082992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404460159","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34679648,0.010430642,0.32972795,0.0047154934,0.0021516483,0.00014674093,0.0010143066,0.0004230189,0.30459374],"genre_scores_gemma":[0.90026826,0.0032297478,0.069695525,0.0010304723,0.0012498306,0.0002299759,0.00043017312,0.00013632147,0.023729663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935883,0.00017096203,0.00005709628,0.00012641995,0.0002033922,0.0000833448],"domain_scores_gemma":[0.99737227,0.0012449003,0.00043592136,0.0002237787,0.0005364615,0.00018669471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010032897,0.00051790173,0.00032619096,0.0021388533,0.0017772262,0.0033306347,0.0007535208,0.001312977,0.0069433083],"category_scores_gemma":[0.0077943387,0.00034805865,0.00042726088,0.0015541124,0.0033668976,0.005447652,0.0012697435,0.0015853898,0.0013305455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011678513,0.0000040945074,0.00012720026,0.000017241382,0.0000020944353,0.000046309433,0.00012513186,0.00037786388,0.00034229236,0.9940011,0.0009941056,0.003950809],"study_design_scores_gemma":[0.0000028714394,0.0000066724842,0.00015645192,0.000010565073,0.0000023534776,0.00010822121,0.0000685758,0.0019294873,0.00018116712,0.99432594,0.0031948427,0.000012869046],"about_ca_topic_score_codex":0.001431612,"about_ca_topic_score_gemma":0.0017819122,"teacher_disagreement_score":0.0069433083,"about_ca_system_score_codex":0.00080581557,"about_ca_system_score_gemma":0.0007393581,"threshold_uncertainty_score":0.023227692},"labels":[],"label_agreement":null},{"id":"W2404480738","doi":"","title":"On Some Finite Hyperbolic Spaces","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Algebraic and Geometric Analysis","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.028181439891435487,"score_gpt":0.2786248861450284,"score_spread":0.2504434462535929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404480738","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59136206,0.0029242872,0.060766313,0.00470701,0.0004951512,0.00007073735,0.0007460004,0.00023009426,0.3386984],"genre_scores_gemma":[0.9203671,0.0010138003,0.008028777,0.00039414637,0.0003008534,0.00004821621,0.0003683726,0.00008338502,0.069395304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933594,0.00018210168,0.000036020305,0.00010230382,0.00019677197,0.00014688066],"domain_scores_gemma":[0.9990907,0.00030530413,0.00013673828,0.000106663436,0.00011744846,0.0002432085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007667449,0.0011758589,0.00083139195,0.0028556813,0.0028253882,0.0038111033,0.001149554,0.0010638006,0.014078856],"category_scores_gemma":[0.0018073131,0.00051987864,0.00093868515,0.0023602457,0.004274422,0.005092251,0.0033652913,0.0029784802,0.0012539852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009507049,0.000006771373,0.00012586925,0.000013298263,0.0000047902563,0.00004683543,0.00019704166,0.00028010903,0.00015613568,0.9978048,0.00034105964,0.0010137348],"study_design_scores_gemma":[0.000012247367,0.000011340907,0.0003167428,0.00001320619,0.000010543543,0.00009249758,0.0002424617,0.0015195376,0.00025147144,0.9925949,0.004924753,0.0000102226995],"about_ca_topic_score_codex":0.0020688146,"about_ca_topic_score_gemma":0.002260044,"teacher_disagreement_score":0.014078856,"about_ca_system_score_codex":0.002202563,"about_ca_system_score_gemma":0.000543714,"threshold_uncertainty_score":0.047098458},"labels":[],"label_agreement":null},{"id":"W2404488293","doi":"","title":"Norm-Based Approximations in E-Convex Multi-objective Programming.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Control Systems Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Norm (philosophy); Regular polygon; Convex optimization; Mathematical optimization; Applied mathematics; Geometry; Epistemology","score_opus":0.009735538168407012,"score_gpt":0.22769746609415598,"score_spread":0.21796192792574898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404488293","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028599412,0.00084536313,0.9916186,0.00032650697,0.00010757892,0.0000257397,0.000069676506,0.00009937883,0.004047352],"genre_scores_gemma":[0.24320237,0.0018601064,0.7399699,0.00049336394,0.00028404407,0.00033118407,0.0006675243,0.00038952837,0.012802004],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997787,0.0013476657,0.000093463284,0.00015317653,0.00050702784,0.00011160794],"domain_scores_gemma":[0.99395883,0.0046062027,0.00028125456,0.0004244918,0.00054638484,0.0001828243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004163875,0.0012146108,0.0013013193,0.00095712976,0.0004493499,0.0015865036,0.0015623606,0.0015498314,0.0036755567],"category_scores_gemma":[0.01628105,0.0006494085,0.00078830944,0.0014320571,0.0015478862,0.0024547428,0.0023219835,0.0037506926,0.0010531679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000172428,0.00011183356,0.00052239397,0.0002850926,0.00010198617,0.00009136053,0.00011589479,0.65701073,0.00065841345,0.23818627,0.008966147,0.09377744],"study_design_scores_gemma":[0.00001136406,0.00002634124,0.00005523028,0.000038574308,0.000007698817,0.000017956521,0.000020064908,0.9157648,0.0002700622,0.08145819,0.0023235437,0.000006172213],"about_ca_topic_score_codex":0.0036163104,"about_ca_topic_score_gemma":0.0042037205,"teacher_disagreement_score":0.004163875,"about_ca_system_score_codex":0.0010979568,"about_ca_system_score_gemma":0.0011278383,"threshold_uncertainty_score":0.022020936},"labels":[],"label_agreement":null},{"id":"W2404505479","doi":"","title":"Some Methods Of Construction Of Rectangular Designs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Manufacturing Process and Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.012666123913154807,"score_gpt":0.25496204060695554,"score_spread":0.24229591669380074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404505479","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012397309,0.0006942071,0.9825822,0.00007171933,0.00008132276,0.00004741959,0.0001301186,0.00030447493,0.014848833],"genre_scores_gemma":[0.03734404,0.0014166354,0.940617,0.00013579881,0.00010766139,0.00035873274,0.00035434228,0.00041843063,0.019247307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991387,0.00031598253,0.00005456188,0.00013920976,0.00029650822,0.00005506895],"domain_scores_gemma":[0.99926907,0.00032882937,0.000048229405,0.00019018972,0.00013358604,0.000030104324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011855203,0.0010898114,0.0007843258,0.0016960462,0.00064547727,0.001031711,0.0013036478,0.000599966,0.017333599],"category_scores_gemma":[0.0033243073,0.0008323189,0.0016336077,0.0014035319,0.0015317869,0.0012320211,0.0017611679,0.0019717033,0.0053284457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007753019,0.00006499958,0.0003102166,0.0007191059,0.00006489744,0.0001308299,0.00029349184,0.027228087,0.0058197277,0.6502743,0.017526077,0.2974906],"study_design_scores_gemma":[0.000095650365,0.0001418151,0.00039555412,0.00023678367,0.00008272254,0.00044444343,0.00009984459,0.103752755,0.0076951915,0.74112785,0.1458728,0.00005458795],"about_ca_topic_score_codex":0.000831693,"about_ca_topic_score_gemma":0.0019796884,"teacher_disagreement_score":0.017333599,"about_ca_system_score_codex":0.0008391932,"about_ca_system_score_gemma":0.00068217935,"threshold_uncertainty_score":0.057986677},"labels":[],"label_agreement":null},{"id":"W2404506644","doi":"","title":"On the Four Color Ramsey Numbers for Hexagons.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Arithmetic","score_opus":0.018429798323042347,"score_gpt":0.22322380530119287,"score_spread":0.20479400697815053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404506644","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30021656,0.0067869597,0.17217019,0.012603043,0.0017838955,0.00016203156,0.001645978,0.0007456946,0.50388575],"genre_scores_gemma":[0.8762968,0.0031499916,0.068369955,0.0020263733,0.00064886047,0.00025554333,0.0008654018,0.00028289523,0.048104115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991934,0.0002994418,0.000038761606,0.00013788287,0.00015858389,0.00017201761],"domain_scores_gemma":[0.9970811,0.0017849241,0.00025817164,0.00028993073,0.0002465042,0.0003392806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012532133,0.0006372122,0.00074117846,0.0017892239,0.00232362,0.0034942913,0.0014288689,0.0014065077,0.01809035],"category_scores_gemma":[0.005704863,0.0005112849,0.00058683753,0.0015716772,0.003168145,0.007900845,0.0026395456,0.002966169,0.0025914586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011068817,0.000029528428,0.0002862983,0.00009440648,0.000008825869,0.00003800351,0.00015197476,0.0029280942,0.0005245352,0.9669138,0.01276152,0.01615237],"study_design_scores_gemma":[0.00002196845,0.000012689603,0.00023001592,0.000043087966,0.00000775836,0.0000746573,0.00017608474,0.0060024937,0.0003903674,0.98373,0.0092945825,0.000016342374],"about_ca_topic_score_codex":0.0019293809,"about_ca_topic_score_gemma":0.0026092774,"teacher_disagreement_score":0.01809035,"about_ca_system_score_codex":0.002023736,"about_ca_system_score_gemma":0.0009981447,"threshold_uncertainty_score":0.060518205},"labels":[],"label_agreement":null},{"id":"W2404520063","doi":"","title":"Lattices associated with subspaces in d-bounded distance-regular graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Linear subspace; Bounded function; Combinatorics; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.01745726954005517,"score_gpt":0.2419692203670435,"score_spread":0.22451195082698833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404520063","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7080604,0.0022103367,0.17442572,0.0022606505,0.0003107769,0.000080388905,0.0011191021,0.0006118492,0.11092082],"genre_scores_gemma":[0.97311497,0.00044211023,0.016510075,0.00020852224,0.00014364789,0.000045823126,0.00040284204,0.000059024755,0.009072915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991289,0.00029777738,0.000058104513,0.00014276168,0.00017511172,0.00019739516],"domain_scores_gemma":[0.99779534,0.00073391583,0.00042825364,0.00022027692,0.00023627283,0.0005860873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007268227,0.00036200671,0.0005522812,0.0018757078,0.0013369509,0.0026005732,0.0007770642,0.00064349273,0.0059677516],"category_scores_gemma":[0.0020728104,0.00033189377,0.00058210694,0.001225219,0.0022374613,0.0038593172,0.002976828,0.0012253013,0.0010016732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043164888,0.0000132600435,0.000343238,0.00002759017,0.0000069453117,0.00006502387,0.00015047762,0.00056738773,0.0006901382,0.99453014,0.00077797973,0.0027847816],"study_design_scores_gemma":[0.000021385238,0.000015797747,0.0003142514,0.000014437914,0.000009982927,0.00019029017,0.00022864783,0.003872387,0.0005558549,0.9919057,0.002858984,0.000012307828],"about_ca_topic_score_codex":0.0007700983,"about_ca_topic_score_gemma":0.00090230996,"teacher_disagreement_score":0.0059677516,"about_ca_system_score_codex":0.0008793758,"about_ca_system_score_gemma":0.00038035162,"threshold_uncertainty_score":0.019964159},"labels":[],"label_agreement":null},{"id":"W2404584973","doi":"","title":"Lattices generated by orbits of subspaces in t-singular spaces.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Linear subspace; Mathematics; Pure mathematics; Mathematical analysis","score_opus":0.020365878687000273,"score_gpt":0.25142102293650426,"score_spread":0.231055144249504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404584973","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6703297,0.0015118973,0.19060495,0.0016538645,0.0005366402,0.00011570443,0.001506439,0.00070439285,0.13303645],"genre_scores_gemma":[0.9667855,0.00033603655,0.015836215,0.00014498254,0.00023641073,0.000050023264,0.00063858967,0.00010210489,0.015870072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903667,0.00022942487,0.00007428742,0.00014261258,0.00028719357,0.0002299032],"domain_scores_gemma":[0.9985374,0.00035781422,0.00025979543,0.00014974715,0.00022743242,0.00046773168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076755974,0.0004150892,0.00053919485,0.0018690706,0.0017817434,0.003440614,0.0005492103,0.00056706724,0.0087157665],"category_scores_gemma":[0.001700925,0.0003131617,0.0011179694,0.001035691,0.0030239453,0.003817828,0.0028782685,0.0015428469,0.0015830133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013424446,0.00002874412,0.00052890595,0.00004869571,0.000019856712,0.00022295829,0.0004660795,0.00083574886,0.0018345114,0.98962456,0.0013862986,0.004869328],"study_design_scores_gemma":[0.00004449527,0.00003990398,0.00034675185,0.00002460015,0.00001548458,0.00029800768,0.0004159758,0.005014228,0.002050479,0.9871662,0.004564934,0.000018903997],"about_ca_topic_score_codex":0.001023898,"about_ca_topic_score_gemma":0.0010454147,"teacher_disagreement_score":0.0087157665,"about_ca_system_score_codex":0.0010189484,"about_ca_system_score_gemma":0.000706482,"threshold_uncertainty_score":0.029157162},"labels":[],"label_agreement":null},{"id":"W2404597151","doi":"","title":"Balanced House-systems and Nestings.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Urban Planning and Valuation","field":"Environmental Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.03607164576013791,"score_gpt":0.24557475553685568,"score_spread":0.20950310977671777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404597151","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33841875,0.0028793258,0.21875224,0.0014372033,0.00017477489,0.00009095557,0.0016963666,0.00016191651,0.43638846],"genre_scores_gemma":[0.9369091,0.00083747384,0.018399503,0.00006503942,0.00007021227,0.000040842548,0.0005890631,0.0000503117,0.04303838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999438,0.0002268712,0.000034748853,0.00010096443,0.00010719375,0.00009210362],"domain_scores_gemma":[0.99889994,0.00039894972,0.00018461485,0.00017231135,0.00015337621,0.0001907824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060197816,0.000345699,0.00032732333,0.00096978754,0.00069635577,0.0022032629,0.000508638,0.0003784032,0.028246788],"category_scores_gemma":[0.0027706786,0.00021822582,0.00034560147,0.0012887297,0.0013510919,0.0030358685,0.0012230695,0.0005366172,0.0013597368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026053445,0.000010726363,0.0010360598,0.000026634327,0.0000085400425,0.000026456537,0.000054622993,0.0020598802,0.0002852166,0.97905785,0.001713617,0.015694298],"study_design_scores_gemma":[0.000014995743,0.000021180995,0.0026075267,0.00002809065,0.000014973808,0.0001937449,0.000220508,0.0075827907,0.00038595687,0.9681341,0.020789132,0.0000068669797],"about_ca_topic_score_codex":0.0020220235,"about_ca_topic_score_gemma":0.00398037,"teacher_disagreement_score":0.028246788,"about_ca_system_score_codex":0.0011176005,"about_ca_system_score_gemma":0.00034160656,"threshold_uncertainty_score":0.09449494},"labels":[],"label_agreement":null},{"id":"W2404602741","doi":"","title":"Rainbow connection numbers of line graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Rainbow; Combinatorics; Mathematics; Edge coloring; Colored; Connection (principal bundle); Discrete mathematics; Graph; Line graph; Graph power; Geometry; Physics; Optics","score_opus":0.0388968721380673,"score_gpt":0.27240514713112196,"score_spread":0.23350827499305465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404602741","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8058925,0.00148862,0.11994114,0.00051819364,0.00015000299,0.00009470771,0.0005773424,0.00032751702,0.071009934],"genre_scores_gemma":[0.966084,0.00062502397,0.026122173,0.00008280195,0.00008336347,0.00012754154,0.0002442448,0.000064845815,0.0065659247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994648,0.00012680372,0.000029827845,0.00013212032,0.0001412698,0.00010515835],"domain_scores_gemma":[0.99685764,0.0016444344,0.00064726383,0.00017737804,0.00026127617,0.00041190351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058933353,0.00041113948,0.0002702392,0.002854712,0.0009280448,0.0012824013,0.0006440102,0.0005575694,0.0063753887],"category_scores_gemma":[0.0038714793,0.00027743596,0.00037916872,0.0013522401,0.0017549435,0.003235803,0.00090862514,0.0007755081,0.00051090785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001387316,0.000041586114,0.0030640033,0.00013118183,0.00002147663,0.00018182232,0.00060647883,0.005688492,0.0063479296,0.9586319,0.0023358753,0.022810567],"study_design_scores_gemma":[0.00002545099,0.00009488332,0.0027299775,0.000049262388,0.000023906166,0.0006349701,0.00036253466,0.02328208,0.0035933438,0.95843714,0.01073025,0.000036200832],"about_ca_topic_score_codex":0.00040213624,"about_ca_topic_score_gemma":0.0005064259,"teacher_disagreement_score":0.0063753887,"about_ca_system_score_codex":0.00085588027,"about_ca_system_score_gemma":0.0003010477,"threshold_uncertainty_score":0.021327853},"labels":[],"label_agreement":null},{"id":"W2404605154","doi":"","title":"The Maximum Number of One-Edge Extensions for Graphs with Bounded Degree","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Bounded function; Enhanced Data Rates for GSM Evolution; Combinatorics; Discrete mathematics; Mathematical analysis; Computer science; Telecommunications","score_opus":0.023157270652868798,"score_gpt":0.24781308170415545,"score_spread":0.22465581105128665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404605154","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89706075,0.00084217574,0.07645883,0.001655555,0.00011429263,0.00008859612,0.00094819843,0.0005486674,0.022282895],"genre_scores_gemma":[0.95958877,0.000602982,0.031611707,0.00021952091,0.000098200915,0.0001506001,0.0007761475,0.00019496704,0.0067571755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986168,0.0004247394,0.000093356895,0.00036502944,0.00020752406,0.00029255345],"domain_scores_gemma":[0.98136675,0.0116420025,0.0014466968,0.002312764,0.0007387866,0.0024930006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001723489,0.0010490683,0.0013516305,0.0012864738,0.0020781592,0.0041851844,0.002790319,0.0021726803,0.0064102076],"category_scores_gemma":[0.010604961,0.0008162483,0.0013264555,0.0010170591,0.0022155757,0.008519049,0.002300096,0.0024809912,0.00069998426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037741952,0.00060767744,0.009777201,0.0014213044,0.00026754924,0.0008245499,0.0015760097,0.08484128,0.054806937,0.74391466,0.010821993,0.087366655],"study_design_scores_gemma":[0.00016381513,0.00031678213,0.003218467,0.00020615068,0.0001835808,0.001262035,0.00044787105,0.12604465,0.016071873,0.8458981,0.0060950005,0.00009182389],"about_ca_topic_score_codex":0.0002517939,"about_ca_topic_score_gemma":0.0006378757,"teacher_disagreement_score":0.0064102076,"about_ca_system_score_codex":0.0010993059,"about_ca_system_score_gemma":0.00094024703,"threshold_uncertainty_score":0.02144432},"labels":[],"label_agreement":null},{"id":"W2404614881","doi":"","title":"On endotype of bipartite graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Endotype; Bipartite graph; Mathematics; Combinatorics; Graph; Medicine; Internal medicine","score_opus":0.009916802603308223,"score_gpt":0.2125497521483922,"score_spread":0.20263294954508398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404614881","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34206864,0.004145586,0.33397117,0.010507199,0.0011033135,0.00019344043,0.0043010116,0.0009299195,0.3027797],"genre_scores_gemma":[0.82961285,0.002781018,0.07928085,0.0030840759,0.0017914029,0.00033916716,0.004718834,0.0005722035,0.07781949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997976,0.0007017376,0.00011395024,0.00044194452,0.0004192405,0.0003471197],"domain_scores_gemma":[0.9921335,0.0046962174,0.00068168464,0.001110974,0.000564819,0.0008127036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015867786,0.0006866794,0.0011240334,0.002752759,0.0025108817,0.0040109316,0.0019646334,0.001700211,0.017959675],"category_scores_gemma":[0.007227466,0.00059508963,0.001226528,0.0029773756,0.0033206898,0.011780413,0.0041523655,0.004223947,0.0023057866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061086976,0.00003978525,0.00061693246,0.000068000336,0.000008639455,0.00005028761,0.00012549927,0.0011056962,0.00037431213,0.98350453,0.005271124,0.008774088],"study_design_scores_gemma":[0.000017087557,0.000010393088,0.00044359555,0.00003354555,0.0000071499207,0.00012571519,0.000094340765,0.0067371847,0.0003164038,0.9851553,0.007049919,0.000009564559],"about_ca_topic_score_codex":0.0015819337,"about_ca_topic_score_gemma":0.0021131488,"teacher_disagreement_score":0.017959675,"about_ca_system_score_codex":0.0022105502,"about_ca_system_score_gemma":0.0006413904,"threshold_uncertainty_score":0.060081124},"labels":[],"label_agreement":null},{"id":"W2404625738","doi":"","title":"Cubic edge-transitive graphs of order 12p or 12p 2 .","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Transitive relation; Enhanced Data Rates for GSM Evolution; Combinatorics; Computer science; Artificial intelligence","score_opus":0.00572214854852661,"score_gpt":0.19595199841861674,"score_spread":0.19022984987009012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404625738","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28883407,0.0010464821,0.14137316,0.0024815132,0.0006747053,0.00031887242,0.00615638,0.0014232869,0.5576916],"genre_scores_gemma":[0.8810818,0.0005613725,0.03408298,0.0005721681,0.00015243381,0.0001281861,0.0023059982,0.00018488061,0.08093026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995371,0.00007673311,0.000018831963,0.0000797028,0.000143262,0.00014438768],"domain_scores_gemma":[0.9984144,0.0005216373,0.0002580577,0.00033883288,0.00026435862,0.00020268903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021549957,0.0003661959,0.00040064793,0.0010242737,0.001536743,0.0019411839,0.00072114274,0.0006492383,0.02507631],"category_scores_gemma":[0.001957901,0.00025875113,0.00037834203,0.0014374651,0.00096423423,0.0014099623,0.0009690093,0.0012676035,0.0022036845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022751297,0.00008043654,0.0007636018,0.00016375522,0.00002320214,0.0004661261,0.00023013994,0.0052235667,0.004269014,0.93832475,0.021479242,0.028748741],"study_design_scores_gemma":[0.00007537438,0.000050266506,0.0015130356,0.000051159564,0.00002469507,0.0005374677,0.00033859813,0.02152085,0.004343169,0.9161711,0.05532998,0.000044351702],"about_ca_topic_score_codex":0.008465832,"about_ca_topic_score_gemma":0.015144874,"teacher_disagreement_score":0.02507631,"about_ca_system_score_codex":0.00144783,"about_ca_system_score_gemma":0.0017962885,"threshold_uncertainty_score":0.08388859},"labels":[],"label_agreement":null},{"id":"W2404648716","doi":"","title":"A note on enumeration of noncrossing partitions.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Enumeration; Mathematics; Combinatorics","score_opus":0.044163474192027444,"score_gpt":0.34352596137889946,"score_spread":0.29936248718687203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404648716","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032102775,0.011939162,0.45007938,0.010784684,0.011370545,0.00014349433,0.0008572226,0.0010677652,0.4816549],"genre_scores_gemma":[0.37756094,0.016138716,0.4261,0.007663124,0.0065029263,0.00039869949,0.0019948925,0.001317536,0.16232325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980787,0.00061980257,0.00012493234,0.00031154594,0.0006624677,0.00020251714],"domain_scores_gemma":[0.99565303,0.0025522022,0.00016151535,0.0008635294,0.0004998235,0.00026991856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020010304,0.00097211596,0.0013699164,0.0025264123,0.0032604514,0.004162074,0.0028109443,0.0016866977,0.016202424],"category_scores_gemma":[0.009423426,0.00060638395,0.0011607861,0.0034926627,0.003280171,0.008840593,0.0042969575,0.0062004016,0.005154698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002659888,0.000026668324,0.00023118732,0.00012497051,0.000006353448,0.000120869074,0.00018863348,0.0005217455,0.0006839188,0.9553812,0.017314596,0.025373396],"study_design_scores_gemma":[0.0000037085551,0.000010507117,0.00018186217,0.000055343353,0.000005694458,0.00017507703,0.00007819556,0.0014463569,0.00039184612,0.95774347,0.039897155,0.000010833682],"about_ca_topic_score_codex":0.0011319946,"about_ca_topic_score_gemma":0.0030889767,"teacher_disagreement_score":0.016202424,"about_ca_system_score_codex":0.001316823,"about_ca_system_score_gemma":0.0009259904,"threshold_uncertainty_score":0.054202497},"labels":[],"label_agreement":null},{"id":"W2404652390","doi":"","title":"Roman domination in a tree.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Classical Antiquity Studies","field":"Social Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Tree (set theory); Combinatorics","score_opus":0.03832427364785905,"score_gpt":0.2935507678455008,"score_spread":0.25522649419764176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404652390","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.118419,0.0019735948,0.018645398,0.0030551371,0.0001592594,0.000017454806,0.00011193903,0.00004138878,0.8575768],"genre_scores_gemma":[0.9652745,0.00062797853,0.003437716,0.00022704758,0.0001310234,0.000016699365,0.000053337717,0.000026877036,0.030204708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999084,0.00049344864,0.000026916223,0.00012103923,0.00013670293,0.00013781546],"domain_scores_gemma":[0.9985043,0.0007959854,0.00018058016,0.0001987259,0.00020698465,0.00011343878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089066965,0.00018297342,0.00035744775,0.0010657868,0.0030047558,0.0032933033,0.00043201965,0.0007737443,0.011992505],"category_scores_gemma":[0.0024063978,0.00014219085,0.00028897208,0.0013920439,0.0058275103,0.0046299687,0.0013643743,0.0013904467,0.0010195358],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037722866,0.0000018490774,0.00004911994,0.0000046991527,0.0000010191739,0.000012984729,0.0001654838,0.00003504573,0.000021848517,0.9984554,0.00036605855,0.00088264834],"study_design_scores_gemma":[0.000007604749,0.0000043367636,0.00030163903,0.000015972795,0.000003729799,0.00010575507,0.000327917,0.0004780617,0.000077239805,0.9809893,0.017685173,0.0000032989212],"about_ca_topic_score_codex":0.0013801004,"about_ca_topic_score_gemma":0.0024108894,"teacher_disagreement_score":0.011992505,"about_ca_system_score_codex":0.0014645179,"about_ca_system_score_gemma":0.00050140626,"threshold_uncertainty_score":0.040118933},"labels":[],"label_agreement":null},{"id":"W2404661821","doi":"","title":"Minimum Metric Dimension of Illiac Networks.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dimension (graph theory); Metric (unit); Combinatorics; Business","score_opus":0.008666398882376473,"score_gpt":0.21432591404807108,"score_spread":0.2056595151656946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404661821","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5497047,0.0049851905,0.26629293,0.008248802,0.00046613129,0.00013440657,0.0053813388,0.0006790885,0.16410746],"genre_scores_gemma":[0.9201129,0.0014718188,0.0575753,0.0006342617,0.00030512764,0.00015710146,0.0023764602,0.00018196493,0.017185051],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991019,0.00031286236,0.000043395747,0.00020416749,0.00018372279,0.0001539897],"domain_scores_gemma":[0.99542445,0.0025322547,0.00056422816,0.0004292331,0.00044944865,0.0006003268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007802032,0.0005477481,0.00079389097,0.0020778785,0.0017780141,0.0036733013,0.0015164858,0.0015571757,0.009193212],"category_scores_gemma":[0.0075147757,0.00045323904,0.0004461935,0.0018239861,0.0016890053,0.005604926,0.0020779704,0.0018816951,0.0009752589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001661987,0.00004431853,0.0020890718,0.00020706303,0.000032134365,0.00006329355,0.00022601234,0.010592198,0.0015667224,0.9492541,0.013000135,0.022758784],"study_design_scores_gemma":[0.000022534034,0.000021348185,0.0012300619,0.000053358122,0.000020204927,0.0001701272,0.00021289459,0.031133654,0.0012496971,0.955093,0.010775822,0.000017227983],"about_ca_topic_score_codex":0.0012754835,"about_ca_topic_score_gemma":0.0018326166,"teacher_disagreement_score":0.009193212,"about_ca_system_score_codex":0.002272948,"about_ca_system_score_gemma":0.0006144547,"threshold_uncertainty_score":0.030754328},"labels":[],"label_agreement":null},{"id":"W2404674776","doi":"","title":"(3, 2)*-choosability of triangle-free toroidal graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Toroid; Combinatorics; Physics","score_opus":0.011540723738946965,"score_gpt":0.23906462689504385,"score_spread":0.22752390315609688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404674776","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73857903,0.00043670702,0.11744913,0.0008262999,0.00019069074,0.000121322024,0.0015094082,0.00059881486,0.14028862],"genre_scores_gemma":[0.97370005,0.00017241204,0.012663153,0.000115925075,0.000026827918,0.000049106413,0.00091759267,0.000110238936,0.012244625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997342,0.00004797453,0.000015242371,0.000058526683,0.00006247238,0.00008158945],"domain_scores_gemma":[0.99908614,0.00041931716,0.00014585216,0.00016000253,0.00006872946,0.00011992588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002443164,0.0002876483,0.00037521368,0.00042900152,0.0007719701,0.001460808,0.0007366788,0.0006637312,0.014281947],"category_scores_gemma":[0.0016223043,0.00028349037,0.00041230593,0.000616767,0.0008933546,0.0013814515,0.00096254214,0.0008616889,0.0010275802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047175048,0.00007306263,0.0021587622,0.0002761344,0.00003278472,0.0006551509,0.0006242227,0.022536768,0.014155896,0.8915799,0.012344796,0.05509081],"study_design_scores_gemma":[0.000094391384,0.00007436167,0.0022785976,0.0000467032,0.000037798145,0.000685127,0.00048409638,0.053364307,0.009276996,0.9206161,0.013003057,0.000038359598],"about_ca_topic_score_codex":0.0020338122,"about_ca_topic_score_gemma":0.002364732,"teacher_disagreement_score":0.014281947,"about_ca_system_score_codex":0.0006301909,"about_ca_system_score_gemma":0.0003665981,"threshold_uncertainty_score":0.04777789},"labels":[],"label_agreement":null},{"id":"W2404682058","doi":"","title":"A Note on Z 5 -connectivity in 3-edge-connected graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Computer science; Artificial intelligence","score_opus":0.010063945597146911,"score_gpt":0.23010183354457925,"score_spread":0.22003788794743234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404682058","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07073916,0.030291108,0.27716777,0.025298456,0.017333474,0.00017318463,0.0017322426,0.0012849048,0.5759797],"genre_scores_gemma":[0.74397403,0.039410423,0.13135816,0.014430193,0.008531801,0.00035973842,0.0016148686,0.00060012494,0.05972048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959904,0.000097171294,0.00002660704,0.00009538112,0.0001170463,0.00006479785],"domain_scores_gemma":[0.9982326,0.0012605032,0.00009280037,0.00016755442,0.00013603382,0.00011044231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071752735,0.00061809487,0.0006053079,0.0015348727,0.001360599,0.0016556486,0.0013738216,0.0012051131,0.013325863],"category_scores_gemma":[0.0033084296,0.00033897266,0.0008032527,0.0019256739,0.0021605655,0.0036694552,0.0020661366,0.0034536612,0.0023587663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017390234,0.000038832546,0.0007175713,0.00055086456,0.000048633818,0.0011707597,0.00029744772,0.0043817265,0.0036256134,0.8757973,0.056793917,0.056403473],"study_design_scores_gemma":[0.000021116482,0.00008502658,0.0010921706,0.00012803917,0.00004664158,0.0008027658,0.00015636784,0.0046961717,0.0013851672,0.874685,0.11686444,0.00003706263],"about_ca_topic_score_codex":0.0017696265,"about_ca_topic_score_gemma":0.0025040288,"teacher_disagreement_score":0.013325863,"about_ca_system_score_codex":0.00076277787,"about_ca_system_score_gemma":0.00045403515,"threshold_uncertainty_score":0.044579506},"labels":[],"label_agreement":null},{"id":"W2404682706","doi":"","title":"Remarks on two special matrices.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.006189509537240962,"score_gpt":0.23702071083343013,"score_spread":0.23083120129618917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404682706","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0255059,0.007021468,0.12785959,0.15490982,0.03105552,0.0001263381,0.00073675247,0.0012250065,0.6515596],"genre_scores_gemma":[0.5515434,0.009844915,0.11130741,0.0894065,0.024199912,0.0005104823,0.0010984896,0.0008312056,0.21125765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877006,0.0003300714,0.00005392946,0.00025246514,0.00039418947,0.00019923809],"domain_scores_gemma":[0.9969848,0.0016016157,0.00015079939,0.00039812652,0.00049405196,0.00037064342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016955708,0.0010124433,0.00072556315,0.0016512587,0.0021277466,0.0017830738,0.0017761997,0.002455149,0.030726638],"category_scores_gemma":[0.0064666905,0.00030234957,0.0009465011,0.0009886246,0.004246002,0.0056354837,0.0027692416,0.004071261,0.004591788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007293111,0.000028256665,0.0001493773,0.00012108137,0.000012644251,0.00047744266,0.0002219221,0.00029787823,0.00056499837,0.9127953,0.07647722,0.008780937],"study_design_scores_gemma":[0.000036558467,0.000025864618,0.00036614417,0.00006126352,0.000009253836,0.0006113532,0.00019614534,0.0008360156,0.0005311681,0.8755432,0.12175972,0.000023423405],"about_ca_topic_score_codex":0.0011841028,"about_ca_topic_score_gemma":0.0009919726,"teacher_disagreement_score":0.030726638,"about_ca_system_score_codex":0.00092985266,"about_ca_system_score_gemma":0.00043160355,"threshold_uncertainty_score":0.10279083},"labels":[],"label_agreement":null},{"id":"W2404683094","doi":"","title":"Characterisation Of Graphs On Domination Parameters.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.0233302204979648,"score_gpt":0.2840831426103755,"score_spread":0.2607529221124107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404683094","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29105335,0.002349377,0.28273183,0.0044484558,0.00042355116,0.0002735132,0.0028742515,0.0016530011,0.41419274],"genre_scores_gemma":[0.93360686,0.00089499104,0.02496667,0.00071954954,0.00036224138,0.00015544279,0.0019561436,0.0006525141,0.036685478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987703,0.0002750003,0.0000812504,0.00032942428,0.0003498326,0.00019421802],"domain_scores_gemma":[0.9939944,0.0029331183,0.0007652951,0.0009201768,0.0007299949,0.00065689953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008611513,0.00075399206,0.00068189175,0.0035100235,0.001817207,0.005227641,0.0016205952,0.0014736714,0.018528372],"category_scores_gemma":[0.0067710336,0.00048599264,0.0006001493,0.0032328041,0.0030314154,0.009006914,0.0025143428,0.0031593225,0.0024974071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006565284,0.000033036795,0.00074743095,0.00008859784,0.0000141404125,0.0001683785,0.00061084254,0.0010958647,0.0022079546,0.9790227,0.003711254,0.012234071],"study_design_scores_gemma":[0.00001237998,0.000011354572,0.00051336596,0.000049332506,0.000012242192,0.0003820377,0.00032694062,0.004039055,0.0012714943,0.97759277,0.01577122,0.000017910092],"about_ca_topic_score_codex":0.001060015,"about_ca_topic_score_gemma":0.0010620023,"teacher_disagreement_score":0.018528372,"about_ca_system_score_codex":0.0016797251,"about_ca_system_score_gemma":0.0006981053,"threshold_uncertainty_score":0.061983585},"labels":[],"label_agreement":null},{"id":"W2404699845","doi":"","title":"Note on a Turan-type problem on distances.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"advanced mathematical theories","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Type (biology); Pure mathematics; Combinatorics; Geology","score_opus":0.05033149662041443,"score_gpt":0.3339359784178191,"score_spread":0.28360448179740466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404699845","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043203637,0.006242188,0.2779377,0.08240634,0.008302911,0.00013615117,0.0018706073,0.00073845824,0.57916206],"genre_scores_gemma":[0.6102525,0.010430823,0.15984607,0.017839985,0.0133902235,0.00038263094,0.002295022,0.0010483643,0.18451437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977366,0.00077689305,0.000116979616,0.00046195553,0.0006818785,0.0002256106],"domain_scores_gemma":[0.99238765,0.004918192,0.0003680602,0.0009954239,0.00072999805,0.00060070027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002545208,0.0013078799,0.0018014773,0.0027344443,0.0042564683,0.004627998,0.0041490565,0.004798686,0.030985365],"category_scores_gemma":[0.014588363,0.00062437175,0.001678467,0.0043437243,0.005777575,0.016864415,0.00766235,0.009937324,0.0044645444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002236894,0.000017683646,0.00011921121,0.0000688122,0.000010038528,0.000089233065,0.00008932152,0.0006498806,0.000118292875,0.977643,0.015812995,0.0053591025],"study_design_scores_gemma":[0.000010341134,0.000011906512,0.00015576223,0.0000243458,0.000009864305,0.00015101557,0.00006732433,0.002039326,0.000103896266,0.979868,0.017543467,0.000014727097],"about_ca_topic_score_codex":0.0029835254,"about_ca_topic_score_gemma":0.00289604,"teacher_disagreement_score":0.030985365,"about_ca_system_score_codex":0.002254598,"about_ca_system_score_gemma":0.0014158754,"threshold_uncertainty_score":0.10365635},"labels":[],"label_agreement":null},{"id":"W2404700317","doi":"","title":"On the choosability of bipartite graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Graph","score_opus":0.013018324968379688,"score_gpt":0.22769009035681367,"score_spread":0.214671765388434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404700317","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31062478,0.0074967495,0.41244462,0.013605676,0.00096088613,0.00022882456,0.0028291778,0.00093686994,0.25087252],"genre_scores_gemma":[0.8877622,0.004829957,0.068681374,0.0018583798,0.0012285584,0.0002845942,0.0024920614,0.00052266865,0.032340188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861515,0.000540908,0.00006792903,0.00027274186,0.00026233585,0.00024085068],"domain_scores_gemma":[0.98835605,0.00926779,0.0005379813,0.0010217635,0.000245282,0.00057107705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015363423,0.0006412862,0.001035947,0.0014176368,0.001565054,0.0030168048,0.0018162127,0.0017704244,0.01591538],"category_scores_gemma":[0.010612753,0.0008086551,0.00091537996,0.0022860777,0.0034166703,0.008100083,0.0025379802,0.00344233,0.001760608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014953925,0.00008169293,0.0012350149,0.00024123378,0.000032811902,0.000093823226,0.00023583537,0.0097218845,0.0013613242,0.9421238,0.016496794,0.028226404],"study_design_scores_gemma":[0.000039602703,0.000018625888,0.00060284487,0.000040506377,0.000017244241,0.00013620137,0.000118486016,0.01799714,0.00056079886,0.9750562,0.005398049,0.000014347608],"about_ca_topic_score_codex":0.0017391308,"about_ca_topic_score_gemma":0.002317493,"teacher_disagreement_score":0.01591538,"about_ca_system_score_codex":0.0019004043,"about_ca_system_score_gemma":0.00080449553,"threshold_uncertainty_score":0.053242326},"labels":[],"label_agreement":null},{"id":"W2404712476","doi":"","title":"Measures of disorder and straight insertion sort with erroneous comparisons.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"sort; Mathematics; Arithmetic; Statistics","score_opus":0.025323314013570887,"score_gpt":0.21994887072597255,"score_spread":0.19462555671240167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404712476","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67911917,0.0025582248,0.28106144,0.0024937785,0.00044699217,0.00026192085,0.004872406,0.0023845346,0.026801547],"genre_scores_gemma":[0.9710952,0.00021363978,0.02491973,0.00015895329,0.00014706553,0.00011001723,0.0011814163,0.00017908588,0.0019950038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9859747,0.004249409,0.0014186292,0.002327778,0.0045737303,0.0014556523],"domain_scores_gemma":[0.8230714,0.104115844,0.02565943,0.027926356,0.013306298,0.0059206137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010923677,0.00095922395,0.0015723506,0.009009876,0.0022424124,0.004602915,0.0031527728,0.0023684774,0.0051317075],"category_scores_gemma":[0.11876054,0.0005919625,0.0006412413,0.007227315,0.0066822744,0.011898652,0.0032778913,0.0020151667,0.0008956502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023235288,0.00041350554,0.09928066,0.00059602177,0.00043009664,0.0004890287,0.0011047823,0.08897923,0.005479728,0.6876339,0.012403078,0.10086651],"study_design_scores_gemma":[0.00010374835,0.0003747623,0.015851319,0.00014753253,0.00023700157,0.0013471316,0.0009002122,0.20699456,0.008882518,0.7582341,0.006747423,0.00017972343],"about_ca_topic_score_codex":0.0024094607,"about_ca_topic_score_gemma":0.0021739532,"teacher_disagreement_score":0.010923677,"about_ca_system_score_codex":0.003400406,"about_ca_system_score_gemma":0.00272138,"threshold_uncertainty_score":0.05777067},"labels":[],"label_agreement":null},{"id":"W2404722159","doi":"","title":"New Sums Identities In Weighted Catalan Triangle With The Powers Of Generalized Fibonacci And Lucas Numbers.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Catalan number; Mathematics; Combinatorics; Binomial coefficient; Catalan; Lucas number; Integer (computer science); Binomial (polynomial); Identity (music); Discrete mathematics; Statistics; Physics; Humanities","score_opus":0.004824248375444834,"score_gpt":0.2308680970544334,"score_spread":0.22604384867898855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404722159","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1895191,0.001999753,0.67402434,0.00070148986,0.00074062706,0.00014036514,0.00041698114,0.00053391274,0.13192339],"genre_scores_gemma":[0.7002932,0.0008825959,0.2577294,0.00040098044,0.00044853773,0.00017068083,0.0005134302,0.00036945828,0.03919169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990426,0.00013142086,0.000049313665,0.00011671682,0.00051800354,0.00014202112],"domain_scores_gemma":[0.9993813,0.00019614835,0.0000657429,0.00008686409,0.00020445141,0.000065460175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006761898,0.00047391962,0.00048729987,0.0018544482,0.0010067228,0.0016521298,0.0011576683,0.00066002214,0.009792619],"category_scores_gemma":[0.0037793608,0.0002940216,0.00078173477,0.0016160742,0.0013249335,0.0034804642,0.0015314238,0.0013113068,0.0016577148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003563244,0.000011781627,0.0009923477,0.00007856962,0.000008026614,0.00032784205,0.00028969068,0.0050651496,0.0035605761,0.952455,0.0019228909,0.035252564],"study_design_scores_gemma":[0.000012793942,0.000040079893,0.0009902146,0.00003443093,0.00001678332,0.00079772377,0.00016625332,0.06674152,0.004972497,0.9015604,0.02463367,0.00003361917],"about_ca_topic_score_codex":0.0017570917,"about_ca_topic_score_gemma":0.0024485376,"teacher_disagreement_score":0.009792619,"about_ca_system_score_codex":0.0008508069,"about_ca_system_score_gemma":0.00055664114,"threshold_uncertainty_score":0.032759607},"labels":[],"label_agreement":null},{"id":"W2404723669","doi":"","title":"A Degree Condition for Graphs to Have (g, f)-Factors.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Combinatorics; Physics","score_opus":0.04731212229158397,"score_gpt":0.3243610738014469,"score_spread":0.2770489515098629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404723669","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5320674,0.0016638469,0.18286975,0.010370383,0.00253214,0.0004182139,0.0076944167,0.002952515,0.25943124],"genre_scores_gemma":[0.95199376,0.0005138199,0.02877114,0.0013659176,0.0009005973,0.0001832099,0.0025752028,0.00037086155,0.013325429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983132,0.00029004132,0.00015364512,0.0005378594,0.0002630312,0.00044223026],"domain_scores_gemma":[0.98685735,0.00659808,0.0008431109,0.0015854454,0.0016239714,0.0024920504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013993072,0.0006620993,0.00095218857,0.0015264278,0.0027496468,0.002727656,0.0010602196,0.002877129,0.020024536],"category_scores_gemma":[0.015695456,0.0007697817,0.0013613125,0.0010486007,0.0029341246,0.006573096,0.0025128901,0.003151535,0.0042844266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013985129,0.00027805628,0.0066606794,0.0003538575,0.000060487208,0.0011455059,0.0011775928,0.0030363947,0.021788483,0.9041547,0.032712016,0.027233625],"study_design_scores_gemma":[0.00035829868,0.00031160982,0.005696594,0.00017329349,0.00009826526,0.0026983495,0.0013230151,0.009300357,0.010653763,0.93808854,0.03114917,0.00014887447],"about_ca_topic_score_codex":0.0018184044,"about_ca_topic_score_gemma":0.0021114242,"teacher_disagreement_score":0.020024536,"about_ca_system_score_codex":0.0009042718,"about_ca_system_score_gemma":0.001321775,"threshold_uncertainty_score":0.066988766},"labels":[],"label_agreement":null},{"id":"W2404724826","doi":"","title":"Spanning trees with a bounded number of leaves in a claw-free graph","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Spanning tree; Minimum degree spanning tree; Claw; Graph; Bounded function; Trémaux tree; Minimum spanning tree; Discrete mathematics; Degree (music); Line graph; Pathwidth; Physics; Biology","score_opus":0.017776776517319338,"score_gpt":0.2891600823010217,"score_spread":0.27138330578370234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404724826","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89418066,0.0008757697,0.09586963,0.0006773142,0.000028240267,0.000063137224,0.0006782779,0.00044898974,0.007178069],"genre_scores_gemma":[0.93182516,0.00054091145,0.061051145,0.00029487367,0.000057682417,0.00009811819,0.0012397306,0.00014886091,0.004743578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993519,0.00009730676,0.000051442905,0.00018143133,0.00015756681,0.0001602765],"domain_scores_gemma":[0.995628,0.0024251323,0.00053978723,0.0004107715,0.00029515574,0.0007011523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066095754,0.0006989354,0.0006830846,0.0013979718,0.0010944689,0.0014299995,0.0013900119,0.0013951216,0.0025806157],"category_scores_gemma":[0.0052442392,0.00090854726,0.0005643226,0.0012913493,0.0010010907,0.0030731864,0.0019179217,0.0012219214,0.00073467684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014595841,0.0005942536,0.01503474,0.0012149932,0.00031000178,0.0040059807,0.0031392546,0.13464527,0.2338175,0.5169329,0.011401006,0.07744454],"study_design_scores_gemma":[0.0002533457,0.00029877963,0.0065487446,0.0001492112,0.000146996,0.0034041393,0.0006239479,0.27771837,0.028563708,0.6733339,0.008876093,0.0000827887],"about_ca_topic_score_codex":0.001058269,"about_ca_topic_score_gemma":0.00226724,"teacher_disagreement_score":0.0025806157,"about_ca_system_score_codex":0.0007561824,"about_ca_system_score_gemma":0.0004688355,"threshold_uncertainty_score":0.008633018},"labels":[],"label_agreement":null},{"id":"W2404741992","doi":"","title":"The Maximal Total Irregularity of Unicyclic Graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01675135721819802,"score_gpt":0.2652470835438106,"score_spread":0.2484957263256126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404741992","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7406144,0.0019506717,0.05845506,0.002417955,0.00023292875,0.000052558902,0.0013004782,0.00028827836,0.19468762],"genre_scores_gemma":[0.9868504,0.00066232914,0.0041666487,0.00013961538,0.00015386718,0.000034521785,0.0004035238,0.000055066786,0.0075341845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993445,0.00015777287,0.00003560697,0.00016451595,0.00017605536,0.00012146192],"domain_scores_gemma":[0.99609333,0.001840248,0.0006224977,0.0006914956,0.0003605741,0.0003918585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060776883,0.0003645044,0.0005544942,0.001892323,0.0013152362,0.0025897757,0.000877727,0.0006041497,0.0055989306],"category_scores_gemma":[0.0060408185,0.00042340215,0.00046544016,0.0017741558,0.0028032411,0.0027635426,0.0018744023,0.0012347784,0.0005591015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000112833935,0.00001759457,0.0019791862,0.00013295162,0.000022870781,0.00012480422,0.0003813444,0.004513876,0.0016361995,0.97270715,0.004019418,0.014351856],"study_design_scores_gemma":[0.00001574364,0.000017736638,0.0011307893,0.00003333183,0.000024957008,0.00031033042,0.00018787054,0.008997827,0.0009774414,0.9825571,0.00573688,0.000010091595],"about_ca_topic_score_codex":0.0011182842,"about_ca_topic_score_gemma":0.0014523378,"teacher_disagreement_score":0.0055989306,"about_ca_system_score_codex":0.0010633112,"about_ca_system_score_gemma":0.00036704505,"threshold_uncertainty_score":0.018730283},"labels":[],"label_agreement":null},{"id":"W2404748425","doi":"","title":"On f-derivations of lattice implication algebras.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Lattice (music); Pure mathematics; Algebra over a field; Physics","score_opus":0.011419804889278708,"score_gpt":0.2413103506083579,"score_spread":0.2298905457190792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404748425","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.118478306,0.009496229,0.6035785,0.004386401,0.0011847107,0.00015779925,0.0015413612,0.00090840895,0.26026824],"genre_scores_gemma":[0.8140213,0.0045426646,0.13003035,0.001953147,0.0010303591,0.00011743634,0.0011551064,0.0002914149,0.046858203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983,0.0005965724,0.00012753991,0.00025647815,0.0005232623,0.00019611616],"domain_scores_gemma":[0.9970969,0.0015547429,0.00020344884,0.0003062114,0.00055038475,0.00028832696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020347985,0.00055995904,0.0006638599,0.0025323948,0.0022214518,0.00287769,0.0010331775,0.00118943,0.0076733218],"category_scores_gemma":[0.0067029675,0.000558572,0.0011168747,0.0020114465,0.003547882,0.009068217,0.002841672,0.003064697,0.0024525311],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028698358,0.000019788944,0.00033160875,0.00005229942,0.00001348848,0.00022190134,0.00027779574,0.00066456135,0.00047445117,0.9833883,0.002310514,0.012216588],"study_design_scores_gemma":[0.000007085329,0.0000052727255,0.00008226987,0.00001533644,0.000004257411,0.00013506992,0.000049702623,0.0013793296,0.00021795782,0.9940958,0.004001061,0.000006840791],"about_ca_topic_score_codex":0.0015968014,"about_ca_topic_score_gemma":0.0025238167,"teacher_disagreement_score":0.0076733218,"about_ca_system_score_codex":0.0016296345,"about_ca_system_score_gemma":0.0009974279,"threshold_uncertainty_score":0.025669813},"labels":[],"label_agreement":null},{"id":"W2404764228","doi":"","title":"Closed Monophonic and Minimal Closed Monophonic Numbers of a Graph.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Arithmetic; Combinatorics","score_opus":0.01552330662189666,"score_gpt":0.22314184700167305,"score_spread":0.2076185403797764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404764228","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6473487,0.0020195593,0.1762791,0.0020572685,0.00086285,0.00011885314,0.0014142192,0.00050188485,0.16939753],"genre_scores_gemma":[0.9489426,0.00038118762,0.023973903,0.00031997025,0.00039151887,0.00012910097,0.00050202163,0.00013045782,0.025229167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999332,0.00016706716,0.000053463347,0.00015572684,0.0001667698,0.00012490219],"domain_scores_gemma":[0.99797994,0.0009856336,0.00030262265,0.00017470447,0.00020212993,0.00035497823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005267454,0.00043789422,0.00048104566,0.0023249625,0.0012990612,0.0025310125,0.00084549637,0.00088454946,0.0091295615],"category_scores_gemma":[0.002965846,0.00032327216,0.000495788,0.0009588502,0.00245902,0.0032767758,0.0013012921,0.0009829684,0.0012170352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009196957,0.000024834042,0.0002979146,0.000060842805,0.000009392872,0.00012555736,0.00024547143,0.00069302245,0.002297766,0.9848986,0.0019642534,0.009290364],"study_design_scores_gemma":[0.000017550869,0.000025896878,0.0004496033,0.000024479512,0.000009470466,0.00025656135,0.00010183799,0.003556694,0.0009037765,0.98893225,0.0057015396,0.000020334253],"about_ca_topic_score_codex":0.0005061207,"about_ca_topic_score_gemma":0.0008392612,"teacher_disagreement_score":0.0091295615,"about_ca_system_score_codex":0.0007417685,"about_ca_system_score_gemma":0.00042057398,"threshold_uncertainty_score":0.03054142},"labels":[],"label_agreement":null},{"id":"W2404781106","doi":"","title":"A Sequential Locating Game on Graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Mathematical economics","score_opus":0.01985553086630328,"score_gpt":0.28000909311008143,"score_spread":0.26015356224377817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404781106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22294252,0.000358271,0.59803253,0.0036022777,0.00026245584,0.0006766537,0.00083939265,0.0006244151,0.17266148],"genre_scores_gemma":[0.8180064,0.0004648055,0.13508034,0.0005220191,0.00009987586,0.00037855585,0.0005863953,0.00014358442,0.044718172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831855,0.0006960767,0.00009635571,0.00035271412,0.00027013526,0.0002660989],"domain_scores_gemma":[0.995507,0.0028098726,0.0002944499,0.00051500805,0.00025409888,0.00061962695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014009072,0.0007971449,0.00093145896,0.0006685169,0.0015809204,0.002911648,0.0022509603,0.0028156142,0.01690094],"category_scores_gemma":[0.0071636327,0.0005045809,0.0008263084,0.0010629162,0.0021342034,0.0068800724,0.002998252,0.001951749,0.0015291848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030541737,0.0001754306,0.00060006557,0.00020411804,0.000047413876,0.00035908096,0.00037554046,0.022400886,0.0035652637,0.9459659,0.006471803,0.019529037],"study_design_scores_gemma":[0.00012403262,0.00013228222,0.00020609045,0.000032056905,0.000040044237,0.0003184937,0.0003285353,0.084218755,0.001058915,0.90332544,0.010192445,0.000022818087],"about_ca_topic_score_codex":0.0016710161,"about_ca_topic_score_gemma":0.002336246,"teacher_disagreement_score":0.01690094,"about_ca_system_score_codex":0.0014666973,"about_ca_system_score_gemma":0.0016259226,"threshold_uncertainty_score":0.056539237},"labels":[],"label_agreement":null},{"id":"W2404800073","doi":"","title":"Extremal Zeroth-Order General Randic Index Of Thorn Graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Order (exchange); Topological index; Combinatorics; Discrete mathematics; Statistics; Computer science; Business","score_opus":0.04256496288708617,"score_gpt":0.27728302598257365,"score_spread":0.23471806309548748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404800073","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7115719,0.0008637199,0.03050703,0.0009872381,0.0003066123,0.000046690857,0.00040357886,0.00037606157,0.25493717],"genre_scores_gemma":[0.973631,0.00027439964,0.006247121,0.00016420957,0.00012990383,0.000026119738,0.00020344488,0.00009808367,0.019225687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975306,0.000046285117,0.00000891205,0.000048102524,0.000073913274,0.000069748945],"domain_scores_gemma":[0.99939835,0.00017069608,0.00010631134,0.00008971799,0.000083654835,0.00015127247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002881146,0.00033276188,0.0005256595,0.0022228623,0.0013740336,0.0020950404,0.00076457975,0.0008802434,0.009590751],"category_scores_gemma":[0.0017766993,0.00025822865,0.00029827707,0.00062925764,0.0017826206,0.0018971366,0.0011315693,0.0012742426,0.0011416373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053729036,0.000015581723,0.00043396268,0.0000353982,0.000005624993,0.00012286259,0.00012725906,0.0009050888,0.0016690686,0.9899593,0.0020843563,0.0045878496],"study_design_scores_gemma":[0.000022583472,0.00001972576,0.0009706763,0.000024658846,0.00000922591,0.00035586557,0.00018061137,0.008501848,0.0009912712,0.98433465,0.004570649,0.000018182674],"about_ca_topic_score_codex":0.0009091652,"about_ca_topic_score_gemma":0.0019653882,"teacher_disagreement_score":0.009590751,"about_ca_system_score_codex":0.0009941497,"about_ca_system_score_gemma":0.0004165876,"threshold_uncertainty_score":0.032084227},"labels":[],"label_agreement":null},{"id":"W2404819344","doi":"","title":"On super (a, 1)-edge entimagic total labelings of grids and crowns.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Geometry; Artificial intelligence; Computer science","score_opus":0.009369720389831096,"score_gpt":0.22019661542364935,"score_spread":0.21082689503381824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404819344","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42680487,0.0024148854,0.33317736,0.0040296256,0.0003773102,0.00016011958,0.0029631776,0.0009914163,0.22908124],"genre_scores_gemma":[0.82898396,0.0013237532,0.12673949,0.0012948549,0.00026332313,0.00017579386,0.0021266951,0.0003271732,0.038764894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992817,0.00022369217,0.000040871975,0.0001507462,0.00014030427,0.00016273936],"domain_scores_gemma":[0.99727803,0.0015616491,0.0002427499,0.00041196152,0.00022911864,0.00027656998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008632327,0.0004599167,0.00060806953,0.0015284525,0.0021442184,0.0026666145,0.0011672882,0.0011254,0.01186467],"category_scores_gemma":[0.0040731155,0.00050575775,0.00061342685,0.0019363583,0.002035803,0.0053456943,0.0023550964,0.0018947005,0.0013621062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097512566,0.000030221325,0.000701814,0.000112696085,0.000012558872,0.000051750765,0.00025298455,0.0037493103,0.0010677644,0.9683562,0.007470533,0.018096708],"study_design_scores_gemma":[0.000020849677,0.0000165031,0.00052863377,0.00003209547,0.000013402,0.000109907654,0.0001965786,0.011431581,0.0005878054,0.9780903,0.00896163,0.000010678578],"about_ca_topic_score_codex":0.0029300372,"about_ca_topic_score_gemma":0.0060045603,"teacher_disagreement_score":0.01186467,"about_ca_system_score_codex":0.0018212681,"about_ca_system_score_gemma":0.0006806562,"threshold_uncertainty_score":0.03969127},"labels":[],"label_agreement":null},{"id":"W2404826996","doi":"","title":"All the Shortest Single Axioms for Boolean SQS-Skeins.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Axiom; Discrete mathematics; Geometry","score_opus":0.029226244380587033,"score_gpt":0.25986434110058365,"score_spread":0.23063809671999663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404826996","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12165965,0.0032415409,0.5609413,0.007820299,0.0033758292,0.0005495091,0.015092158,0.0053639077,0.28195578],"genre_scores_gemma":[0.64761305,0.0015097318,0.26777765,0.0028235402,0.00075347594,0.00032674908,0.011131574,0.0014855361,0.06657873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975374,0.0006037466,0.00037150196,0.0005392149,0.00063698576,0.00031115583],"domain_scores_gemma":[0.9933448,0.0027175106,0.000481434,0.0012630875,0.0017032236,0.0004899786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017185541,0.00081446214,0.0008353095,0.0014618183,0.0028287421,0.0035237833,0.0011713181,0.0013085047,0.029531335],"category_scores_gemma":[0.008612168,0.00083930197,0.0022192546,0.0015587355,0.0023641516,0.008523512,0.003618863,0.0043482576,0.008593887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024829965,0.00009084785,0.0011923796,0.00071657385,0.00009773191,0.00035040654,0.00061482016,0.00087168865,0.0034087235,0.90743876,0.028960807,0.056008946],"study_design_scores_gemma":[0.000036366502,0.000049450562,0.00052767474,0.0000983425,0.00006056366,0.0004133174,0.00032232367,0.00119993,0.0036411653,0.93589205,0.057717565,0.000041315918],"about_ca_topic_score_codex":0.0013267284,"about_ca_topic_score_gemma":0.0038402446,"teacher_disagreement_score":0.029531335,"about_ca_system_score_codex":0.0011697855,"about_ca_system_score_gemma":0.0021454336,"threshold_uncertainty_score":0.098792136},"labels":[],"label_agreement":null},{"id":"W2404828447","doi":"","title":"On Transitive Cayley Graphs of Strong Semilatttices of Rectangular Groups.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cayley graph; Mathematics; Transitive relation; Combinatorics; Vertex-transitive graph; Pure mathematics; Graph; Voltage graph; Line graph","score_opus":0.023982158909415057,"score_gpt":0.28700531360345893,"score_spread":0.26302315469404386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404828447","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6790747,0.0012190276,0.13860819,0.0009936981,0.00044603553,0.00013737203,0.0007878289,0.000532042,0.17820105],"genre_scores_gemma":[0.9512388,0.0006204192,0.018428907,0.00035012557,0.00019423357,0.000090961665,0.000772186,0.00012499419,0.02817938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999483,0.0001520735,0.00003097145,0.0001196756,0.0001034546,0.00011086047],"domain_scores_gemma":[0.9983583,0.0006284115,0.00037605825,0.00020975206,0.00016361669,0.00026381013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038258103,0.0005147608,0.00051256415,0.0014526042,0.0014804708,0.0022326228,0.0007957781,0.0007173417,0.011800903],"category_scores_gemma":[0.0019117749,0.00047816895,0.0006868234,0.00095922995,0.0019465291,0.0032590788,0.0018104342,0.0014076439,0.0015093503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045946137,0.000024836056,0.00048397147,0.00006460137,0.000013342453,0.00018939494,0.00038548838,0.0011219636,0.0016006,0.9877845,0.0018756852,0.0064097275],"study_design_scores_gemma":[0.000023862718,0.000033562246,0.0006915243,0.00004463903,0.000018458699,0.00025414562,0.0004221756,0.0059627905,0.0013018256,0.9844721,0.006759208,0.00001566157],"about_ca_topic_score_codex":0.0012840587,"about_ca_topic_score_gemma":0.0023372942,"teacher_disagreement_score":0.011800903,"about_ca_system_score_codex":0.00075435103,"about_ca_system_score_gemma":0.00033437484,"threshold_uncertainty_score":0.039478004},"labels":[],"label_agreement":null},{"id":"W2404829170","doi":"","title":"(k, α n-1 )-Fibonacci numbers and P k -matchings in multigraphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Mathematics; Combinatorics","score_opus":0.005764450171992145,"score_gpt":0.21962561792052132,"score_spread":0.21386116774852917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404829170","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4062648,0.0061381273,0.34688678,0.0054541416,0.0010871524,0.00018900544,0.0011346417,0.00085268484,0.23199253],"genre_scores_gemma":[0.8934811,0.001405051,0.066164136,0.0009734951,0.0003153745,0.00020193265,0.0005102289,0.00014307117,0.036805645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993272,0.00019417367,0.00006987453,0.00015541495,0.00012460475,0.00012866143],"domain_scores_gemma":[0.9979819,0.0011748656,0.0003154602,0.0001896533,0.00015430119,0.00018370684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091500586,0.00044836733,0.00050722854,0.0023390828,0.0018712815,0.0028230543,0.0008988853,0.0014973326,0.008231713],"category_scores_gemma":[0.0039545093,0.0005304777,0.0006859857,0.0018305611,0.0019593104,0.004143915,0.0017694302,0.0014488774,0.001701538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046237452,0.00001588311,0.0004254793,0.00006130265,0.000008897424,0.00021002718,0.00013674342,0.0012221178,0.0008454144,0.9855839,0.002563986,0.00888],"study_design_scores_gemma":[0.000009895546,0.000011358247,0.00030340656,0.000027437474,0.000006154078,0.0003325859,0.00005802999,0.004130179,0.0003812262,0.99024826,0.004479312,0.000012302048],"about_ca_topic_score_codex":0.0009886271,"about_ca_topic_score_gemma":0.0018337615,"teacher_disagreement_score":0.008231713,"about_ca_system_score_codex":0.0015115385,"about_ca_system_score_gemma":0.00059505505,"threshold_uncertainty_score":0.027537763},"labels":[],"label_agreement":null},{"id":"W2404868863","doi":"","title":"Self-dual Codes and Cyclic Codes over F p + vF p .","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dual (grammatical number); Discrete mathematics; Linguistics; Philosophy","score_opus":0.006912133094755612,"score_gpt":0.2196881174003381,"score_spread":0.2127759843055825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404868863","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5634988,0.005310616,0.14704266,0.004501844,0.0009546659,0.00008624231,0.0008890834,0.00034887285,0.27736717],"genre_scores_gemma":[0.96050304,0.0012931334,0.010265193,0.0003982457,0.0005501716,0.00004496148,0.00034135027,0.00005707738,0.026546752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992557,0.00018811542,0.000035474743,0.00009871204,0.0002442019,0.00017771371],"domain_scores_gemma":[0.99841833,0.00061087136,0.00034696236,0.00022840116,0.00020583972,0.00018966063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053575984,0.00041903486,0.00036374698,0.0020881789,0.0011294311,0.0021511589,0.0005263717,0.000975218,0.005726124],"category_scores_gemma":[0.0026577534,0.00027603604,0.00046367594,0.001315436,0.0020464796,0.0026758781,0.0022150245,0.0015571143,0.00095197896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003987859,0.000014604081,0.00024628997,0.000028268501,0.0000044351905,0.0001227861,0.000102030295,0.0006694923,0.00067349273,0.9908262,0.0014252425,0.0058471365],"study_design_scores_gemma":[0.000014026035,0.0000191094,0.00033532895,0.000029621277,0.000006323597,0.00040901324,0.000085814245,0.005030539,0.00091355195,0.9858133,0.0073280097,0.000015290872],"about_ca_topic_score_codex":0.0009062868,"about_ca_topic_score_gemma":0.00082642375,"teacher_disagreement_score":0.005726124,"about_ca_system_score_codex":0.0009865974,"about_ca_system_score_gemma":0.0007660091,"threshold_uncertainty_score":0.0191558},"labels":[],"label_agreement":null},{"id":"W2404883945","doi":"","title":"Willmore Lagrangian Submanifolds In Complex Euclidean Space.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Geometric Analysis and Curvature Flows","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Lagrangian; Euclidean space; Euclidean geometry; Pure mathematics; Space (punctuation); Willmore energy; Mathematical analysis; Geometry; Computer science; Mean curvature; Mean curvature flow; Curvature","score_opus":0.02715913364699494,"score_gpt":0.2647829052319364,"score_spread":0.2376237715849415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404883945","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49775374,0.00627483,0.17180754,0.010021383,0.0012356698,0.00014235995,0.0009177316,0.00060622557,0.3112405],"genre_scores_gemma":[0.8847902,0.0016697055,0.023248155,0.0008306108,0.00055218587,0.00006330803,0.0004690732,0.00019249145,0.0881843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997974,0.000053304924,0.000012018127,0.00003628174,0.0000615501,0.00003951057],"domain_scores_gemma":[0.99968636,0.000049330763,0.0000728154,0.00003521445,0.00004845641,0.00010778858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040301296,0.00073782186,0.00040152887,0.0024553684,0.0013957163,0.0015180592,0.00047504622,0.0008199864,0.0065526143],"category_scores_gemma":[0.00082687195,0.00023358419,0.0004090212,0.00053336506,0.0016162752,0.002628478,0.0018971177,0.001126414,0.0013153352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011285746,0.000008075349,0.00022219095,0.000017906072,0.0000050713697,0.00007953334,0.00014865941,0.00056983664,0.00078849785,0.99174845,0.002585528,0.0038149925],"study_design_scores_gemma":[0.000007728315,0.000015526088,0.0007353082,0.000017197945,0.0000061615906,0.00017889951,0.00016941791,0.006364494,0.0003621256,0.982163,0.009971093,0.000009091064],"about_ca_topic_score_codex":0.0014898664,"about_ca_topic_score_gemma":0.002040475,"teacher_disagreement_score":0.0065526143,"about_ca_system_score_codex":0.0008896226,"about_ca_system_score_gemma":0.00035985155,"threshold_uncertainty_score":0.021920681},"labels":[],"label_agreement":null},{"id":"W2404891737","doi":"","title":"Identities involving harmonic numbers and inverses of binomial coefficients.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Binomial coefficient; Harmonic number; Binomial (polynomial); Gaussian binomial coefficient; Central binomial coefficient; Harmonic; Pure mathematics; Applied mathematics; Negative binomial distribution; Statistics; Discrete mathematics; Poisson distribution","score_opus":0.009035073522629855,"score_gpt":0.23839994320380323,"score_spread":0.22936486968117337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404891737","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05698816,0.01155805,0.20172311,0.0043736277,0.0035766293,0.000052865686,0.0005457569,0.00024274502,0.72093916],"genre_scores_gemma":[0.764403,0.008071112,0.054355666,0.0020872883,0.0037074767,0.00011361916,0.00058009103,0.00027408355,0.16640764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989334,0.00029754115,0.00006416872,0.00016177201,0.00041185628,0.00013126458],"domain_scores_gemma":[0.9987594,0.0004858221,0.00015801437,0.00018320829,0.00028816005,0.00012550552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011408373,0.0005932726,0.0006015816,0.0022656864,0.0019086201,0.003589775,0.00075746933,0.0010645984,0.012318119],"category_scores_gemma":[0.0050120936,0.0003972741,0.00069682347,0.0014172839,0.0033344259,0.007112914,0.0025068424,0.0027774149,0.0033108408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003014314,0.000003507483,0.000036621455,0.000012888644,0.0000012413985,0.000029020917,0.000068182875,0.000045919445,0.00012686568,0.9958496,0.001504778,0.0023183445],"study_design_scores_gemma":[0.0000026849827,0.0000032156954,0.00008880052,0.000016545353,0.0000030190433,0.0001324744,0.000048367572,0.0005511077,0.00015298369,0.98967755,0.009317663,0.0000055632754],"about_ca_topic_score_codex":0.0009615133,"about_ca_topic_score_gemma":0.0012501482,"teacher_disagreement_score":0.012318119,"about_ca_system_score_codex":0.0010148141,"about_ca_system_score_gemma":0.00071230956,"threshold_uncertainty_score":0.041208148},"labels":[],"label_agreement":null},{"id":"W2404900926","doi":"","title":"Extraconnectivity of Folded Hypercubes.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hypercube; Mathematics; Arithmetic; Combinatorics","score_opus":0.010926820622835655,"score_gpt":0.2201957932466309,"score_spread":0.20926897262379526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404900926","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77824515,0.0015888071,0.10017327,0.00037319228,0.00017057447,0.00006372352,0.0004417581,0.00024400713,0.11869951],"genre_scores_gemma":[0.9636282,0.0008842128,0.017919881,0.00010012695,0.000064123604,0.0000628861,0.00054518116,0.000063024134,0.016732302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99979407,0.000055493645,0.000012457138,0.00003472836,0.00006260997,0.00004066349],"domain_scores_gemma":[0.999385,0.00021490415,0.00011676061,0.00009235362,0.000108356464,0.00008258519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013977209,0.00023963477,0.00018850587,0.0008662641,0.0006894473,0.00080004166,0.0002976575,0.00028890956,0.0055612396],"category_scores_gemma":[0.0011678237,0.00018843578,0.00017875011,0.0007183367,0.00051743473,0.0010587535,0.001067768,0.00042320302,0.00054467976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019494124,0.000051352123,0.0035547721,0.00025308577,0.00004001432,0.00083920825,0.00070952723,0.020733498,0.021035146,0.86078066,0.006095611,0.085712194],"study_design_scores_gemma":[0.000038622224,0.000104767045,0.0070636407,0.00013508214,0.000052821943,0.0016364794,0.0009895321,0.07267108,0.0151176285,0.86756104,0.034599736,0.000029679211],"about_ca_topic_score_codex":0.0007378897,"about_ca_topic_score_gemma":0.0015209154,"teacher_disagreement_score":0.0055612396,"about_ca_system_score_codex":0.0002972905,"about_ca_system_score_gemma":0.00017933465,"threshold_uncertainty_score":0.01860416},"labels":[],"label_agreement":null},{"id":"W2404905038","doi":"","title":"Boundary powerful k-alliances in graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Alliance; Boundary (topology); Combinatorics; Graph; Offensive; Discrete mathematics; Mathematical analysis; Political science; Operations research","score_opus":0.01297498511765379,"score_gpt":0.2712440401254521,"score_spread":0.25826905500779834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404905038","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5172976,0.0031344339,0.3948365,0.002797259,0.00014855497,0.0002579354,0.0013751675,0.0003819232,0.07977057],"genre_scores_gemma":[0.93369216,0.0013367538,0.057213873,0.0003114982,0.00020904325,0.00026729368,0.0006892138,0.000076004086,0.0062040747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99710613,0.00092021533,0.00022605798,0.0008344821,0.0005389758,0.00037416068],"domain_scores_gemma":[0.9858628,0.008373185,0.0025367287,0.001345005,0.0006419963,0.0012402708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021945576,0.0008395883,0.0010142371,0.002353423,0.0025979101,0.0031056877,0.0014650676,0.0012999976,0.0048277443],"category_scores_gemma":[0.011006894,0.0007265142,0.0011578827,0.0024944497,0.0045146463,0.010580997,0.0037274396,0.002028859,0.0007935665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012981116,0.0000421999,0.0022210064,0.00024848874,0.00005918651,0.00030049597,0.0010674219,0.008298554,0.0025453547,0.96911937,0.0023194868,0.013648628],"study_design_scores_gemma":[0.000031502594,0.00006943104,0.0014421261,0.00007278406,0.00006917209,0.0012578579,0.00060455047,0.026407424,0.0016293237,0.9570754,0.011309499,0.000030856827],"about_ca_topic_score_codex":0.0005200434,"about_ca_topic_score_gemma":0.0006945755,"teacher_disagreement_score":0.0048277443,"about_ca_system_score_codex":0.001362413,"about_ca_system_score_gemma":0.0004053471,"threshold_uncertainty_score":0.016150415},"labels":[],"label_agreement":null},{"id":"W2404911565","doi":"","title":"An Expansion Technique on Super Edge-Magic Total Graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; MAGIC (telescope); Enhanced Data Rates for GSM Evolution; Combinatorics; Astronomy; Computer science; Physics; Artificial intelligence","score_opus":0.009216528485985096,"score_gpt":0.23695937171858916,"score_spread":0.22774284323260408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404911565","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07826542,0.0010318367,0.78008497,0.0012745409,0.00024849983,0.00012581593,0.0006996541,0.0012161203,0.13705313],"genre_scores_gemma":[0.47700506,0.0012089928,0.46979198,0.0010622379,0.00024667016,0.00027900058,0.0014476611,0.0007753894,0.04818314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996045,0.0001079217,0.000014451968,0.00008039848,0.00012953716,0.0000632694],"domain_scores_gemma":[0.9990946,0.0004264909,0.00004185023,0.0002469422,0.00012424885,0.00006596511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005404171,0.0004047019,0.00041198215,0.0013838,0.00084260217,0.00089677057,0.0012798492,0.00051258196,0.011841136],"category_scores_gemma":[0.0020950423,0.00036256568,0.0005302143,0.0020074933,0.0010669535,0.0033749698,0.0024675932,0.0018689246,0.0014016745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008662063,0.00005462881,0.00033997186,0.00016375388,0.00001277083,0.000089982095,0.0003107436,0.0035850364,0.006605849,0.874672,0.014901694,0.09917692],"study_design_scores_gemma":[0.00003797574,0.000044377604,0.00052937237,0.00007968681,0.000042285923,0.0003272663,0.00019864381,0.042236976,0.005289732,0.9145938,0.03659857,0.0000211874],"about_ca_topic_score_codex":0.0011180047,"about_ca_topic_score_gemma":0.0026514954,"teacher_disagreement_score":0.011841136,"about_ca_system_score_codex":0.000675082,"about_ca_system_score_gemma":0.00051237975,"threshold_uncertainty_score":0.03961259},"labels":[],"label_agreement":null},{"id":"W2404912828","doi":"","title":"Minimal forbidden graphs of reducible additive hereditary graph properties.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Graph","score_opus":0.013715493714572657,"score_gpt":0.21769292330337592,"score_spread":0.20397742958880327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404912828","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67997044,0.0008946821,0.18193994,0.0020783055,0.00015162824,0.00012901291,0.0025464878,0.001016026,0.13127345],"genre_scores_gemma":[0.9648681,0.00021321834,0.023589358,0.00025082298,0.00006850844,0.00006730304,0.0014801204,0.000109396235,0.009353087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916077,0.00025240064,0.00004785729,0.00021807716,0.00017838193,0.000142476],"domain_scores_gemma":[0.9953892,0.0028607831,0.0005898986,0.00063281186,0.00025753406,0.0002698144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056025456,0.00038027513,0.00045776338,0.0011325069,0.0012705439,0.0026868174,0.001041972,0.00082706386,0.007370893],"category_scores_gemma":[0.0035102356,0.0005417203,0.0005762823,0.0009259502,0.0016852595,0.0030981163,0.0012823371,0.0013959176,0.00063528935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015005744,0.00009692559,0.001956396,0.00012843567,0.00003261111,0.00024129462,0.000352588,0.004586025,0.003875937,0.96774876,0.004625808,0.016205085],"study_design_scores_gemma":[0.000030681007,0.000022464565,0.0011086279,0.00003445715,0.000044817116,0.0004920552,0.0003037113,0.011445424,0.0037995426,0.97511035,0.007591971,0.000015909553],"about_ca_topic_score_codex":0.001142183,"about_ca_topic_score_gemma":0.001832491,"teacher_disagreement_score":0.007370893,"about_ca_system_score_codex":0.0010734893,"about_ca_system_score_gemma":0.0005625313,"threshold_uncertainty_score":0.024658084},"labels":[],"label_agreement":null},{"id":"W2404933767","doi":"","title":"On the tree with maximum general Randic Index.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Tree (set theory); Combinatorics; Statistics; Computer science","score_opus":0.00796176716452101,"score_gpt":0.19649131523824162,"score_spread":0.1885295480737206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404933767","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38553736,0.0067050993,0.26061967,0.010292645,0.00059277826,0.00015858372,0.003703264,0.0012910108,0.33109954],"genre_scores_gemma":[0.8388692,0.002453291,0.10654523,0.0017256384,0.0005540233,0.00015916962,0.0021629746,0.0005903814,0.046940148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917287,0.00024541127,0.000037167323,0.00018690125,0.00016852914,0.0001890373],"domain_scores_gemma":[0.99630415,0.002232737,0.0003414371,0.0005120721,0.00025372772,0.00035587602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010124795,0.00043942468,0.0010975129,0.0018776971,0.002079646,0.0037210668,0.0013019324,0.0017862822,0.012426536],"category_scores_gemma":[0.00660715,0.0004759961,0.0004991545,0.0021641592,0.0019792872,0.0068237614,0.00224263,0.0022079055,0.0025299257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014636762,0.000044025215,0.0005424712,0.00013265146,0.000014394283,0.000067565,0.00019153212,0.0040063593,0.0012666645,0.9543563,0.016528297,0.02270336],"study_design_scores_gemma":[0.000030139898,0.00001657044,0.00039662476,0.000046765268,0.000014689182,0.00017257313,0.00012280443,0.012860561,0.0006698564,0.9754402,0.0102151465,0.000013948201],"about_ca_topic_score_codex":0.0013735677,"about_ca_topic_score_gemma":0.0028931238,"teacher_disagreement_score":0.012426536,"about_ca_system_score_codex":0.0019315364,"about_ca_system_score_gemma":0.0008521094,"threshold_uncertainty_score":0.041570842},"labels":[],"label_agreement":null},{"id":"W2404964284","doi":"","title":"Logartihmic upper bound for the upper chromatic number of S(t, t+1, v) systems.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Upper and lower bounds; Combinatorics; Mathematical analysis","score_opus":0.007207518043931618,"score_gpt":0.22117580593495964,"score_spread":0.213968287891028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404964284","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13070367,0.011323478,0.2521057,0.017292809,0.0013678801,0.00031009925,0.00656637,0.002482704,0.57784724],"genre_scores_gemma":[0.89100015,0.0032383008,0.042572755,0.002441035,0.0008248293,0.00057112577,0.0023604082,0.00041020213,0.05658112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986332,0.00025861769,0.000045108347,0.00027077994,0.00036438953,0.00042780896],"domain_scores_gemma":[0.9950099,0.0030172593,0.0002508236,0.0008459357,0.00042759647,0.00044844902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015136956,0.000993351,0.0008155649,0.003518525,0.0026212176,0.004361931,0.0029439798,0.0015270356,0.033710774],"category_scores_gemma":[0.008965592,0.0005234523,0.00072038756,0.0020541805,0.0021847123,0.0056338753,0.0035298835,0.0038976914,0.003866323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005028644,0.00027723628,0.0019828796,0.0006044907,0.000056392444,0.0001855502,0.00043382373,0.032014903,0.009866775,0.8483597,0.058084957,0.047630467],"study_design_scores_gemma":[0.00005132588,0.00008756976,0.003369224,0.00023139846,0.000068237525,0.00042671483,0.00022888304,0.15689945,0.0068467087,0.7924062,0.039306637,0.00007759924],"about_ca_topic_score_codex":0.0037019062,"about_ca_topic_score_gemma":0.009967376,"teacher_disagreement_score":0.033710774,"about_ca_system_score_codex":0.0054750512,"about_ca_system_score_gemma":0.0021054037,"threshold_uncertainty_score":0.112773776},"labels":[],"label_agreement":null},{"id":"W2404970681","doi":"","title":"The existence of block-transitive 2-(q, 8, 1) designs with q a prime power.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Transitive relation; Mathematics; Prime (order theory); Prime power; Block (permutation group theory); Combinatorics; Power (physics); Discrete mathematics; Physics; Thermodynamics","score_opus":0.014607962313856556,"score_gpt":0.1864460365266482,"score_spread":0.17183807421279165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404970681","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49173018,0.001549118,0.3035167,0.0017846213,0.00036185,0.00026479948,0.0010223876,0.0006394815,0.19913091],"genre_scores_gemma":[0.92463565,0.0005503206,0.05519774,0.00042983305,0.00011336457,0.0002561028,0.000406508,0.00009100598,0.018319538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984713,0.0005870115,0.00009209583,0.0002286936,0.0003599633,0.00026091016],"domain_scores_gemma":[0.9946636,0.0026645774,0.00087682315,0.0009285639,0.00051214534,0.00035425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013292491,0.00037431734,0.00047123455,0.0010127067,0.0012552446,0.0024388535,0.0005527383,0.0014534309,0.007662364],"category_scores_gemma":[0.0070558367,0.00078490266,0.00045613697,0.00069418934,0.0013321901,0.0026241827,0.001440569,0.0011285653,0.0019153449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022846462,0.000039762355,0.0006208204,0.00010470441,0.000020291025,0.00014803321,0.00026047003,0.0020102346,0.007896637,0.97208756,0.0028691296,0.013713899],"study_design_scores_gemma":[0.0001379029,0.00014754552,0.0005566414,0.000076534,0.000043862514,0.0005785318,0.00014378839,0.01306898,0.006564593,0.9649871,0.0136569,0.0000375946],"about_ca_topic_score_codex":0.00040586793,"about_ca_topic_score_gemma":0.0006585091,"teacher_disagreement_score":0.007662364,"about_ca_system_score_codex":0.00063281803,"about_ca_system_score_gemma":0.000854892,"threshold_uncertainty_score":0.025633156},"labels":[],"label_agreement":null},{"id":"W2404980147","doi":"","title":"Right Triangular Dihedral f-Tilings of the Sphere: (α, β, π/2) and (γ, γ, π/2).","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dihedral angle; Combinatorics; Substitution tiling; Physics","score_opus":0.0072891501717525994,"score_gpt":0.1857004984515574,"score_spread":0.1784113482798048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404980147","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34483102,0.0007419053,0.19804054,0.0010068269,0.0018347934,0.00022831804,0.0023444726,0.0015044601,0.4494677],"genre_scores_gemma":[0.89805984,0.00025077557,0.04490866,0.00047104643,0.00012603127,0.00010769616,0.0009369542,0.00029886488,0.05484023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999706,0.000040721607,0.000015376729,0.000070306836,0.000062443876,0.000105152634],"domain_scores_gemma":[0.99968493,0.000063174455,0.000035238787,0.0000930513,0.000046618763,0.00007699832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011797925,0.0004183675,0.00038466338,0.0005837796,0.00090815825,0.00113493,0.0004616483,0.0007804322,0.044082522],"category_scores_gemma":[0.0008135069,0.00021511222,0.0002725745,0.0003908741,0.0010672855,0.00073536753,0.0008133514,0.00081794796,0.0042913305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005683737,0.00007089115,0.0007392144,0.00012249195,0.00002385874,0.0007976164,0.00041353027,0.010389499,0.02681967,0.8764048,0.02132846,0.06232162],"study_design_scores_gemma":[0.00018740403,0.00024702726,0.002210343,0.000097272634,0.000026377153,0.0012168626,0.0011144159,0.04664043,0.029791048,0.78814894,0.1302053,0.00011460533],"about_ca_topic_score_codex":0.0031684448,"about_ca_topic_score_gemma":0.003585779,"teacher_disagreement_score":0.044082522,"about_ca_system_score_codex":0.00049316196,"about_ca_system_score_gemma":0.0004128894,"threshold_uncertainty_score":0.14747071},"labels":[],"label_agreement":null},{"id":"W2404984448","doi":"","title":"The Labelings Of A Variation Of Banana Trees.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Banana Cultivation and Research","field":"Agricultural and Biological Sciences","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Variation (astronomy)","score_opus":0.015539014208706884,"score_gpt":0.2401677816402724,"score_spread":0.2246287674315655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404984448","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8208568,0.00060552644,0.08768402,0.0005217483,0.0002858307,0.000053283868,0.0033516418,0.0013671436,0.08527393],"genre_scores_gemma":[0.93669975,0.00015672322,0.035722736,0.00017423133,0.00003964492,0.000031657066,0.0027496822,0.00056448043,0.023861028],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99976486,0.00004310761,0.000012668613,0.00009048191,0.000046582136,0.00004233157],"domain_scores_gemma":[0.99942625,0.00011066595,0.00006184922,0.00017063247,0.00014492373,0.00008575571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014188152,0.00019944481,0.00014881066,0.0006278833,0.0007244159,0.0006895816,0.00039213637,0.0004475191,0.006975918],"category_scores_gemma":[0.00063180923,0.00019068095,0.00023435337,0.00083080307,0.0004642323,0.00054995704,0.0004476343,0.00056573085,0.0012998142],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011982138,0.00011701909,0.010571432,0.00018089906,0.000048245616,0.0008974929,0.00085552724,0.004840021,0.72393984,0.12559934,0.008205964,0.12354602],"study_design_scores_gemma":[0.00010814339,0.0005169681,0.103442766,0.00010403569,0.00020510658,0.004143771,0.0014761556,0.064399295,0.28338236,0.1647205,0.37728354,0.00021735363],"about_ca_topic_score_codex":0.0022671432,"about_ca_topic_score_gemma":0.006080928,"teacher_disagreement_score":0.006975918,"about_ca_system_score_codex":0.00053818896,"about_ca_system_score_gemma":0.00020747102,"threshold_uncertainty_score":0.023336768},"labels":[],"label_agreement":null},{"id":"W2404996762","doi":"","title":"Acyclic Total Colorings of Planar Graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Planar graph; Planar; Discrete mathematics; Graph; Computer science; Computer graphics (images)","score_opus":0.027790670485247873,"score_gpt":0.2829276525119263,"score_spread":0.25513698202667845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404996762","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38038543,0.0024215342,0.34726194,0.0023348932,0.0005641608,0.0001767388,0.0051025096,0.0017799899,0.2599729],"genre_scores_gemma":[0.8582784,0.0019753235,0.07058732,0.00076473795,0.0003261911,0.00015355808,0.0050588944,0.0005987118,0.062256906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994424,0.0001616681,0.000030885836,0.00012228313,0.00013184274,0.0001108305],"domain_scores_gemma":[0.9964568,0.001917139,0.0003879098,0.0004987022,0.00043189203,0.00030746873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005081812,0.00056126446,0.00038527642,0.0018173419,0.0011799538,0.0022816686,0.0008775532,0.000671038,0.01387283],"category_scores_gemma":[0.0035823854,0.0006522898,0.00071665604,0.0022547212,0.0012009912,0.002296937,0.0012019989,0.0014042204,0.0012349754],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009123312,0.0000437692,0.0011386964,0.00024847742,0.000037660946,0.00014735285,0.0003073919,0.006102564,0.0028788736,0.9385418,0.017224764,0.033237357],"study_design_scores_gemma":[0.000029167086,0.000021640006,0.0009373663,0.000046743437,0.00004049862,0.00029150417,0.000194549,0.01232977,0.0013236455,0.96476614,0.02000348,0.000015505451],"about_ca_topic_score_codex":0.0029835494,"about_ca_topic_score_gemma":0.0060203704,"teacher_disagreement_score":0.01387283,"about_ca_system_score_codex":0.0012686212,"about_ca_system_score_gemma":0.0005887656,"threshold_uncertainty_score":0.04640925},"labels":[],"label_agreement":null},{"id":"W2405008717","doi":"","title":"Minimal Covers of Maximal Cliques for Interval Graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Interval (graph theory); Combinatorics; Independence (probability theory); Discrete mathematics; Independence number; Order (exchange); Upper and lower bounds; Interval graph; Pathwidth; Graph; Statistics","score_opus":0.01653703275778776,"score_gpt":0.2634478112292585,"score_spread":0.24691077847147072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405008717","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61093634,0.00044606073,0.3740622,0.0003115063,0.00002768274,0.00016209942,0.0018557349,0.000412095,0.011786309],"genre_scores_gemma":[0.861342,0.00020910027,0.13300024,0.00007498978,0.00007051312,0.00016682156,0.002715301,0.00012572481,0.002295301],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901867,0.00017908862,0.000053097152,0.00024541855,0.00036504853,0.00013871823],"domain_scores_gemma":[0.9906283,0.0063136704,0.0012557759,0.001000769,0.00033555244,0.00046594127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007144344,0.00040843812,0.00059601257,0.001498346,0.0011744591,0.001565423,0.0009875933,0.00068361795,0.003946014],"category_scores_gemma":[0.007685487,0.00058349397,0.0010296641,0.0012161615,0.0012202774,0.0021806215,0.0011413204,0.0010002261,0.00038795237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012820072,0.00044092076,0.05312849,0.0008364342,0.00028883465,0.0010378135,0.0018436869,0.14319362,0.054071482,0.55393785,0.007840524,0.18209845],"study_design_scores_gemma":[0.000074317984,0.00024322051,0.015011687,0.00011341945,0.00013506094,0.0019651614,0.0006818222,0.31987876,0.029455401,0.6190303,0.013352257,0.00005859351],"about_ca_topic_score_codex":0.0007797367,"about_ca_topic_score_gemma":0.0012437606,"teacher_disagreement_score":0.003946014,"about_ca_system_score_codex":0.0007042824,"about_ca_system_score_gemma":0.000512949,"threshold_uncertainty_score":0.0132007},"labels":[],"label_agreement":null},{"id":"W2405014331","doi":"","title":"A brute-force method for studying the chromatic properties of homomorphic graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Homomorphic encryption; Mathematics; Chromatic scale; Brute force; Brute-force attack; Combinatorics; Algorithm; Computer science; Cryptography; Computer security; Encryption","score_opus":0.025129582280539832,"score_gpt":0.25088573591898544,"score_spread":0.22575615363844562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405014331","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08005059,0.00057017576,0.86061597,0.0008771063,0.00016498809,0.00030076524,0.0005739039,0.00093442615,0.055912066],"genre_scores_gemma":[0.62367964,0.0007592174,0.3465075,0.00047593119,0.00027043337,0.00072266127,0.0009906241,0.0006655088,0.025928566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998978,0.00032666812,0.000020761981,0.00024096693,0.00031534172,0.000118318916],"domain_scores_gemma":[0.9958192,0.0023734777,0.00020423139,0.0011970525,0.00021709301,0.00018892999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012635142,0.0008471855,0.0006313966,0.0022106983,0.0017404268,0.0012138088,0.0019460262,0.0011986883,0.009698854],"category_scores_gemma":[0.005185574,0.00063633034,0.0009020245,0.001613651,0.002197159,0.0028599126,0.0021614076,0.002705205,0.0017028328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021534777,0.00028308065,0.0017991306,0.00023659447,0.0000719397,0.0001282613,0.00047919725,0.019008504,0.013032194,0.88330704,0.011578744,0.069860004],"study_design_scores_gemma":[0.00008021728,0.000079721714,0.0011425698,0.000042065072,0.000040377887,0.00022016742,0.00017807525,0.15442748,0.007007988,0.82143563,0.015296583,0.000049282764],"about_ca_topic_score_codex":0.002303198,"about_ca_topic_score_gemma":0.004019417,"teacher_disagreement_score":0.009698854,"about_ca_system_score_codex":0.0013526698,"about_ca_system_score_gemma":0.0009764498,"threshold_uncertainty_score":0.032445967},"labels":[],"label_agreement":null},{"id":"W2405037780","doi":"","title":"Several identities involving q-harmonic numbers by q-Chu-Vandermonde convolution formula.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vandermonde matrix; Convolution (computer science); Harmonic; Pure mathematics; Combinatorics; Artificial intelligence; Computer science; Physics","score_opus":0.05180170741059192,"score_gpt":0.3093046022063185,"score_spread":0.2575028947957266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405037780","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.158857,0.0068317903,0.26087892,0.0087160785,0.003715012,0.000105162944,0.00048339675,0.00036498095,0.5600476],"genre_scores_gemma":[0.8088852,0.0036093253,0.055436406,0.0026496898,0.002450142,0.000109877285,0.00035198344,0.00024861013,0.12625885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994923,0.00011516103,0.0000244186,0.00006655438,0.00019857833,0.00010295164],"domain_scores_gemma":[0.9993175,0.0002352903,0.000071990624,0.0000821784,0.00016792955,0.00012504208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010220088,0.0005812936,0.0004934269,0.0015725311,0.0019896538,0.002035277,0.0009437685,0.0014015303,0.009345011],"category_scores_gemma":[0.0025232262,0.00027286392,0.0008825542,0.0012645695,0.0021061562,0.0049019665,0.0021542176,0.0025735935,0.0018883303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004619783,0.000008316577,0.00005660954,0.000016145661,0.0000019532758,0.000058376227,0.0000783213,0.000108965294,0.000263577,0.9949091,0.00177012,0.0027238987],"study_design_scores_gemma":[0.000005892786,0.000007908539,0.00016959575,0.000015750675,0.000006199467,0.00022690653,0.000050794413,0.002590557,0.00050049624,0.98855686,0.007856988,0.000012136648],"about_ca_topic_score_codex":0.0012153884,"about_ca_topic_score_gemma":0.0014123673,"teacher_disagreement_score":0.009345011,"about_ca_system_score_codex":0.0013524392,"about_ca_system_score_gemma":0.0008048134,"threshold_uncertainty_score":0.03126222},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.01014705084220965,"score_gpt":0.22276694766794833,"score_spread":0.21261989682573867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405045104","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9234059,0.0013031121,0.042930637,0.0013815138,0.00010637725,0.000028719374,0.00031196268,0.00007042596,0.030461337],"genre_scores_gemma":[0.98794156,0.0005465479,0.009035693,0.00016251144,0.0001002579,0.000023124654,0.00020468414,0.000017305763,0.0019683475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995708,0.000120184806,0.0000150480855,0.000106536856,0.00009035002,0.00009717911],"domain_scores_gemma":[0.9983853,0.00082453544,0.00034604385,0.00013490436,0.0000994933,0.00020965973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004862686,0.00042526957,0.00037181214,0.0015436837,0.0013378526,0.0012646213,0.0005476001,0.0007879437,0.0021971413],"category_scores_gemma":[0.0021586213,0.00026228308,0.00031248858,0.0012088295,0.0019718506,0.0025713022,0.0012805101,0.0009411568,0.00020059024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012338065,0.000042088348,0.0044015744,0.00010631635,0.000029384222,0.00020435752,0.00058361987,0.008220056,0.0037920196,0.96603507,0.0021998242,0.014262387],"study_design_scores_gemma":[0.000021563492,0.00006865148,0.004162083,0.00003009711,0.000024003039,0.0005941464,0.00037157672,0.025955591,0.002550886,0.9581478,0.008037137,0.000036419384],"about_ca_topic_score_codex":0.0007644264,"about_ca_topic_score_gemma":0.000691853,"teacher_disagreement_score":0.0021971413,"about_ca_system_score_codex":0.00095597375,"about_ca_system_score_gemma":0.00028676767,"threshold_uncertainty_score":0.0073502064},"labels":[],"label_agreement":null},{"id":"W2405072688","doi":"","title":"On the Szeged Index of some Benzenoid Graphs Applicable in Nanostructures.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Computer science; World Wide Web","score_opus":0.014286796395551563,"score_gpt":0.2590999318885012,"score_spread":0.24481313549294967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405072688","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64253473,0.0032589876,0.054544132,0.0026536474,0.00084297557,0.000093147115,0.0010112562,0.00034312904,0.294718],"genre_scores_gemma":[0.9691973,0.0012002608,0.011298938,0.00049146224,0.00036174257,0.000116862226,0.00036149946,0.00012171628,0.01685021],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967575,0.000065498134,0.000020151128,0.000053273077,0.000108756285,0.000076548735],"domain_scores_gemma":[0.9992893,0.00025668062,0.00013227122,0.00007342076,0.0000982156,0.00015025488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051882124,0.00043681488,0.000697323,0.0035330195,0.0018114228,0.0021032318,0.0008691715,0.001250802,0.0089860745],"category_scores_gemma":[0.0018628484,0.00028453665,0.00043342277,0.0013059232,0.0016905658,0.0031059699,0.0013206607,0.0015811793,0.0011803894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028109675,0.0000140275,0.00013084343,0.000034856672,0.0000036794625,0.000043312863,0.00009603249,0.0006730096,0.0010448664,0.9927718,0.0015070545,0.003652318],"study_design_scores_gemma":[0.000012207311,0.000013717406,0.0003265779,0.000020260757,0.000005171869,0.00010830988,0.000087677894,0.0055242255,0.0006624201,0.99026406,0.0029619369,0.000013390317],"about_ca_topic_score_codex":0.00076637056,"about_ca_topic_score_gemma":0.0010576728,"teacher_disagreement_score":0.0089860745,"about_ca_system_score_codex":0.0013017724,"about_ca_system_score_gemma":0.00046004995,"threshold_uncertainty_score":0.030061424},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.03461364176142281,"score_gpt":0.30700506329824184,"score_spread":0.27239142153681906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405098219","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10047403,0.008855851,0.54359317,0.004859599,0.0030192935,0.000046925852,0.0005168709,0.00047133764,0.33816296],"genre_scores_gemma":[0.83906806,0.0040732003,0.082468785,0.0014522923,0.002007039,0.000081123464,0.0003722807,0.0003054038,0.07017181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993161,0.00015627302,0.000029697478,0.00008809433,0.0003155387,0.00009432845],"domain_scores_gemma":[0.99875045,0.00048154432,0.00010783772,0.00015370832,0.00032394056,0.00018250912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011400307,0.00054806407,0.000605494,0.0015842824,0.0013587459,0.0022060238,0.00080365536,0.0010674843,0.008230133],"category_scores_gemma":[0.0051052794,0.00035666092,0.0007033743,0.0014933314,0.0018611391,0.004480542,0.0020537095,0.002887444,0.0024814738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009135647,0.0000076435645,0.00011633473,0.000019290632,0.0000027004096,0.00004761672,0.00006537585,0.00025576184,0.00044164044,0.990388,0.0023696064,0.006276893],"study_design_scores_gemma":[0.0000050850135,0.000010797917,0.0002209886,0.000022544533,0.000006978584,0.0002516674,0.000028818291,0.0075458437,0.00042809843,0.98261297,0.008855444,0.000010859508],"about_ca_topic_score_codex":0.0011942725,"about_ca_topic_score_gemma":0.0011611526,"teacher_disagreement_score":0.008230133,"about_ca_system_score_codex":0.0011532282,"about_ca_system_score_gemma":0.00083228445,"threshold_uncertainty_score":0.027532518},"labels":[],"label_agreement":null},{"id":"W2405110261","doi":"","title":"On the diameter and inverse degree.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Manufacturing Process and Optimization","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Inverse; Geometry; Acoustics; Physics","score_opus":0.024642969520860137,"score_gpt":0.1874140250473156,"score_spread":0.16277105552645546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405110261","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16515462,0.023190632,0.35876068,0.009721907,0.0025173095,0.00006782232,0.0012582551,0.0004389554,0.43888977],"genre_scores_gemma":[0.87892264,0.012491746,0.044827484,0.0013908828,0.0028693923,0.0001374227,0.00061693514,0.00041073735,0.058332853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992218,0.00024525553,0.00003556571,0.0001792291,0.00018210102,0.00013590022],"domain_scores_gemma":[0.99411064,0.0040012123,0.00042225583,0.0005127071,0.00041078686,0.00054242305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014511013,0.0008148348,0.000983529,0.0025380997,0.0010907338,0.0020175665,0.0012079213,0.0010223356,0.0101567255],"category_scores_gemma":[0.009985272,0.00044683172,0.0006738427,0.0015223527,0.0035128333,0.006620638,0.0023991205,0.0029742166,0.0021616821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054966527,0.000022757507,0.0006337285,0.00009087191,0.000013781068,0.000054866752,0.0001112141,0.0041095554,0.000647542,0.9724027,0.0072901957,0.014567834],"study_design_scores_gemma":[0.000012224254,0.000025452564,0.0009968424,0.000046449764,0.000014156734,0.00021848845,0.00008578609,0.011090497,0.00037764743,0.97195035,0.015165506,0.000016528895],"about_ca_topic_score_codex":0.0010685022,"about_ca_topic_score_gemma":0.0013959835,"teacher_disagreement_score":0.0101567255,"about_ca_system_score_codex":0.0013576515,"about_ca_system_score_gemma":0.00044720204,"threshold_uncertainty_score":0.033977628},"labels":[],"label_agreement":null},{"id":"W2405116333","doi":"","title":"A standard proof of Andrews' conjecture for 4φ3-series","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Geometry","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Conjecture; Series (stratigraphy); Calculus (dental); Discrete mathematics; Medicine","score_opus":0.03447560978599935,"score_gpt":0.3107166611970677,"score_spread":0.27624105141106836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405116333","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06985767,0.002116373,0.26671028,0.03664918,0.0057391333,0.00024344,0.0021791211,0.002207605,0.6142972],"genre_scores_gemma":[0.76400447,0.0028602253,0.082391456,0.009705013,0.0036307354,0.00034990296,0.0017395609,0.0009942923,0.13432424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983026,0.00027159925,0.000102226884,0.00039758114,0.0006520336,0.00027399685],"domain_scores_gemma":[0.99772125,0.0007830138,0.00013941694,0.0005776402,0.0005589601,0.00021963989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030328468,0.0018196929,0.001202043,0.0029877753,0.002933356,0.003314626,0.0018875378,0.0022879273,0.03899005],"category_scores_gemma":[0.0065308567,0.00078307156,0.0022618156,0.0024451343,0.007060525,0.01157445,0.0057549155,0.0062977127,0.0068963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032078322,0.000023442653,0.00016409064,0.00007254806,0.000010972857,0.00006179604,0.00021113886,0.00019923347,0.00052335026,0.9829655,0.009286532,0.0064493343],"study_design_scores_gemma":[0.000025746302,0.0000145031245,0.0002820241,0.000022957092,0.000014601521,0.000090226844,0.000053725445,0.0006526213,0.00051477,0.9759051,0.022407925,0.00001567417],"about_ca_topic_score_codex":0.0021620565,"about_ca_topic_score_gemma":0.0016988378,"teacher_disagreement_score":0.03899005,"about_ca_system_score_codex":0.0021572844,"about_ca_system_score_gemma":0.0013123658,"threshold_uncertainty_score":0.13043469},"labels":[],"label_agreement":null},{"id":"W2405125483","doi":"","title":"On the Laplacian Spectral Radius of Unicyclic Graphs with Fixed Diameter.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; Combinatorics; RADIUS; Laplace operator; Mathematical analysis; Eigenvalues and eigenvectors; Physics; Computer science; Computer network; Quantum mechanics","score_opus":0.02509817658149875,"score_gpt":0.26372755145711074,"score_spread":0.238629374875612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405125483","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70633405,0.016572466,0.15028411,0.0065442375,0.00073803193,0.00008430957,0.0011022673,0.00076509954,0.11757549],"genre_scores_gemma":[0.9820134,0.003415651,0.008798606,0.00032257923,0.0006082408,0.00008451979,0.00025864755,0.00018454975,0.0043138587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914646,0.00035927593,0.000029934594,0.00016273023,0.00016045992,0.00014113473],"domain_scores_gemma":[0.9892231,0.0076742717,0.0010470072,0.00051493954,0.00061533443,0.00092535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013546983,0.0007638144,0.0010880854,0.004356469,0.001219184,0.00204279,0.0022903548,0.0014417644,0.0047857715],"category_scores_gemma":[0.017155953,0.0005499958,0.0003655036,0.002160369,0.0029350147,0.0040402184,0.0022738858,0.0015425354,0.0010711893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003015791,0.00007733906,0.0022236095,0.00029253165,0.00005432927,0.0002649802,0.00062935456,0.034681983,0.005006954,0.91855216,0.015213998,0.022701172],"study_design_scores_gemma":[0.000052587486,0.000060101596,0.0019997645,0.00012704726,0.000048503138,0.00047823836,0.00050646055,0.11663218,0.0016040533,0.8726388,0.005787891,0.00006441003],"about_ca_topic_score_codex":0.001319526,"about_ca_topic_score_gemma":0.0010634201,"teacher_disagreement_score":0.0047857715,"about_ca_system_score_codex":0.001696542,"about_ca_system_score_gemma":0.0003771578,"threshold_uncertainty_score":0.016009986},"labels":[],"label_agreement":null},{"id":"W2405148593","doi":"","title":"Graphs with prescribed star complement for 1 as the second largest eigenvalue.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Complement (music); Star (game theory); Eigenvalues and eigenvectors; Combinatorics; Discrete mathematics; Mathematical analysis; Physics; Biology","score_opus":0.04851897042598737,"score_gpt":0.3150877258107681,"score_spread":0.26656875538478075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405148593","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49099272,0.0005769519,0.191346,0.003204732,0.000562452,0.00011764112,0.0015066128,0.0012719922,0.31042087],"genre_scores_gemma":[0.926685,0.000290382,0.037425168,0.0006022042,0.00012846029,0.00010268006,0.00088617404,0.00028220392,0.033597723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995338,0.00012787216,0.000016913214,0.000101395504,0.00010564893,0.000114388975],"domain_scores_gemma":[0.99837685,0.00061659695,0.00019504194,0.0002723249,0.000279482,0.0002596952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042667048,0.00043270693,0.0004888097,0.0010789982,0.0017950304,0.0016575697,0.0007359756,0.0011436859,0.012405394],"category_scores_gemma":[0.002400133,0.0003145261,0.00044209624,0.000664962,0.0017890936,0.001962512,0.0013630767,0.0012736237,0.0022686385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099442645,0.000025370027,0.00027529808,0.000047628902,0.000008638453,0.00016135685,0.00015249799,0.0013477101,0.0040773074,0.9824532,0.0062898435,0.0050615896],"study_design_scores_gemma":[0.000032819167,0.000015657277,0.00039384127,0.00002345952,0.0000096443,0.00018276645,0.00017355809,0.008557429,0.002422656,0.9810197,0.007152393,0.000016040076],"about_ca_topic_score_codex":0.0013223119,"about_ca_topic_score_gemma":0.0028881223,"teacher_disagreement_score":0.012405394,"about_ca_system_score_codex":0.00078855705,"about_ca_system_score_gemma":0.0008316094,"threshold_uncertainty_score":0.04150021},"labels":[],"label_agreement":null},{"id":"W2405149775","doi":"","title":"On the Laplacian integral (k-1)-cyclic graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.05150404660088367,"score_gpt":0.2963380189424615,"score_spread":0.2448339723415778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405149775","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5469804,0.004402569,0.09709339,0.007070099,0.001282947,0.00007895197,0.00069299556,0.00043042106,0.34196824],"genre_scores_gemma":[0.95030075,0.002360792,0.011711464,0.0011103381,0.0008758575,0.00005588868,0.0003647738,0.00015231971,0.03306775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963355,0.000094758805,0.000011978469,0.000065982065,0.00009522371,0.00009839318],"domain_scores_gemma":[0.9989667,0.00043480948,0.00018366237,0.00008370519,0.00013260813,0.00019846729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037491284,0.00062675244,0.0004983304,0.0022029486,0.0012323403,0.0014700874,0.00089672994,0.0011775711,0.010514521],"category_scores_gemma":[0.002650986,0.00029601666,0.0004681364,0.0014846256,0.0023108074,0.002498032,0.0017350245,0.0016537193,0.0013575385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002609027,0.000015972942,0.00025014376,0.000048207476,0.000005090814,0.00010432735,0.00020380286,0.0013827597,0.0010751836,0.98500305,0.0038724423,0.008013036],"study_design_scores_gemma":[0.00000695875,0.000009243372,0.00026832058,0.000020639165,0.000005509604,0.00018228692,0.000108553155,0.0057167173,0.00030858512,0.9897537,0.0036088426,0.000010635819],"about_ca_topic_score_codex":0.0019122354,"about_ca_topic_score_gemma":0.0022780567,"teacher_disagreement_score":0.010514521,"about_ca_system_score_codex":0.0011465925,"about_ca_system_score_gemma":0.00045831574,"threshold_uncertainty_score":0.03517461},"labels":[],"label_agreement":null},{"id":"W2405162587","doi":"","title":"Double hexagonal chains with the extremal PI indices.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pi; Hexagonal crystal system; Combinatorics; Geometry; Crystallography; Chemistry","score_opus":0.02565695033797098,"score_gpt":0.26077115085330893,"score_spread":0.23511420051533796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405162587","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38708314,0.0012483769,0.1230454,0.0017156036,0.0012246579,0.00012556957,0.00083676295,0.0005267718,0.4841938],"genre_scores_gemma":[0.9358547,0.00047304,0.027722511,0.00045130172,0.00018482495,0.00010913464,0.00038562293,0.00011312053,0.034705825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996989,0.000060034654,0.000013384561,0.000054439413,0.00009477909,0.000078561294],"domain_scores_gemma":[0.9995553,0.000073858355,0.000071998955,0.0001229556,0.00007289604,0.000102939186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001818138,0.00036275308,0.00032864252,0.0010004949,0.001338472,0.0021883547,0.00058302836,0.0009908174,0.017161502],"category_scores_gemma":[0.0012806497,0.00032916965,0.00023432095,0.0006605699,0.0010807253,0.0016329762,0.0014241555,0.0012361164,0.0020093312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010348896,0.000030250167,0.00047780303,0.000059603753,0.0000100717925,0.00027636669,0.00010365885,0.0010853243,0.005194084,0.9733932,0.0038417056,0.015424372],"study_design_scores_gemma":[0.00004814217,0.000047158013,0.0008344302,0.000060457045,0.000015604126,0.0007676033,0.00035459714,0.013672458,0.0075628306,0.9554332,0.02117768,0.000025903646],"about_ca_topic_score_codex":0.00056790246,"about_ca_topic_score_gemma":0.0012376227,"teacher_disagreement_score":0.017161502,"about_ca_system_score_codex":0.00042094925,"about_ca_system_score_gemma":0.00039639452,"threshold_uncertainty_score":0.057410896},"labels":[],"label_agreement":null},{"id":"W2405171052","doi":"","title":"A Zeta Function Of A Semiregular Weighted Bipartite Graph.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Graph; Complete bipartite graph; Riemann zeta function; Combinatorics; Function (biology); Prime zeta function; Discrete mathematics; Arithmetic zeta function; Pure mathematics","score_opus":0.034916556048798,"score_gpt":0.2531361223333386,"score_spread":0.2182195662845406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405171052","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78767574,0.00077521463,0.110041805,0.002056443,0.00049782626,0.000049943428,0.000543987,0.00028211917,0.09807691],"genre_scores_gemma":[0.97578365,0.0003423903,0.0047132894,0.00018450203,0.00023725482,0.000056236142,0.00020303315,0.000100590776,0.018379001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966216,0.00009391152,0.000010597166,0.000062306346,0.00008973868,0.00008134522],"domain_scores_gemma":[0.9983358,0.0006814721,0.00022550146,0.0001015502,0.00020845511,0.00044717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006920607,0.0006870951,0.00058273866,0.0027964758,0.0010281032,0.0020813786,0.0009045718,0.0010333542,0.010238083],"category_scores_gemma":[0.0030969235,0.00027345144,0.00042732296,0.0010285778,0.001967722,0.0028631003,0.0013379138,0.0013609282,0.001714777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090217734,0.000028965962,0.00054082315,0.00005786161,0.000014147611,0.00012203654,0.00016060733,0.0019940203,0.0025126918,0.98485273,0.0034621514,0.006163817],"study_design_scores_gemma":[0.000026455022,0.000024248911,0.00070811156,0.000030780426,0.000011998358,0.00024909558,0.00014629294,0.02564052,0.0009154787,0.9690607,0.003164789,0.000021549828],"about_ca_topic_score_codex":0.0005518858,"about_ca_topic_score_gemma":0.0004612597,"teacher_disagreement_score":0.010238083,"about_ca_system_score_codex":0.0010056094,"about_ca_system_score_gemma":0.00035052464,"threshold_uncertainty_score":0.034249783},"labels":[],"label_agreement":null},{"id":"W2405204346","doi":"","title":"Packings and coverings of λK v by the graphs with seven points, seven edges and one 5-circle.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Geometry","score_opus":0.0056100501551344245,"score_gpt":0.17476534877298783,"score_spread":0.1691552986178534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405204346","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8961704,0.00059357926,0.04422377,0.000411555,0.000117681346,0.00004266906,0.00087791827,0.00033701287,0.057225298],"genre_scores_gemma":[0.9740753,0.00028534693,0.015767207,0.000077715384,0.000031935873,0.0000516853,0.00073070824,0.00008109361,0.008899022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958795,0.00008967974,0.00002139515,0.00007776042,0.00009207729,0.00013107093],"domain_scores_gemma":[0.9992698,0.00025600847,0.0001487203,0.00014939596,0.000053544,0.00012265782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018310575,0.00038739876,0.00035156208,0.0010431171,0.0013614492,0.0011672992,0.00047291757,0.0006684083,0.0076042176],"category_scores_gemma":[0.0016780075,0.00051234214,0.00048636782,0.0012488533,0.0010397651,0.0008586117,0.0011348746,0.00049446814,0.0009942373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001054238,0.00015767677,0.008500181,0.0002909623,0.00015115822,0.0030304024,0.002267513,0.06807427,0.026955198,0.80272955,0.022111174,0.06467768],"study_design_scores_gemma":[0.00014014982,0.00020888857,0.022384055,0.00016310434,0.00013082387,0.0033298917,0.002626563,0.21004753,0.022341488,0.6952705,0.043224525,0.00013249241],"about_ca_topic_score_codex":0.0030651297,"about_ca_topic_score_gemma":0.0026735908,"teacher_disagreement_score":0.0076042176,"about_ca_system_score_codex":0.0006142307,"about_ca_system_score_gemma":0.00032202055,"threshold_uncertainty_score":0.025438607},"labels":[],"label_agreement":null},{"id":"W2405206777","doi":"","title":"Multicompetition numbers of some multigraphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Arithmetic","score_opus":0.0039240321351050765,"score_gpt":0.18986575783975831,"score_spread":0.18594172570465323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405206777","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40240383,0.0027105748,0.14845717,0.005330876,0.00089308963,0.00013607988,0.0019112854,0.0005188195,0.43763825],"genre_scores_gemma":[0.9019778,0.00081490964,0.046278644,0.00055506546,0.00044968707,0.00016961005,0.0005826263,0.00015277058,0.049018912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991868,0.00022728708,0.00004135327,0.00019351624,0.00021937468,0.00013168174],"domain_scores_gemma":[0.99445266,0.0034461007,0.0005935924,0.00040563193,0.000576207,0.00052571675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075253705,0.00042513193,0.00038337274,0.0039062314,0.0020099776,0.0027828682,0.00084437354,0.0008450638,0.019103274],"category_scores_gemma":[0.0046328832,0.0004361009,0.00041430347,0.0020620879,0.0015288441,0.003803616,0.0013117009,0.0021254283,0.0017786328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004887794,0.000021736232,0.00047269944,0.00006890811,0.000012318237,0.00010696581,0.00018132546,0.00083107356,0.0012506674,0.9810384,0.004640478,0.011326571],"study_design_scores_gemma":[0.00001937595,0.000031255026,0.0013146088,0.000051577335,0.00002680325,0.00059202965,0.00015039055,0.008589495,0.0020349908,0.96444297,0.022725519,0.000021079824],"about_ca_topic_score_codex":0.00052254274,"about_ca_topic_score_gemma":0.0011177735,"teacher_disagreement_score":0.019103274,"about_ca_system_score_codex":0.0016060859,"about_ca_system_score_gemma":0.00052152044,"threshold_uncertainty_score":0.06390679},"labels":[],"label_agreement":null},{"id":"W2405225288","doi":"","title":"A Family Of Chromatically Unique K 4 -Homeomorphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Synthesis of Organic Compounds","field":"Medicine","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.018205639339869444,"score_gpt":0.26087385377379985,"score_spread":0.2426682144339304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405225288","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5553531,0.002960794,0.052683044,0.0012222952,0.0005819325,0.000114836104,0.0010810548,0.0008573087,0.38514563],"genre_scores_gemma":[0.9112995,0.0012283034,0.020953085,0.00034497835,0.00008990553,0.00009492069,0.00062455214,0.00018074004,0.0651839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998374,0.000021280617,0.0000098129685,0.00004575563,0.00004130977,0.000044411958],"domain_scores_gemma":[0.99984574,0.000038240058,0.00003218217,0.000029000037,0.0000187555,0.000036135418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012915235,0.00038623717,0.00025254788,0.0012210069,0.0009263155,0.0013077466,0.00042350832,0.00037220473,0.013187691],"category_scores_gemma":[0.00037616547,0.00023413,0.00030833366,0.0006371834,0.0010953028,0.0010532055,0.0012627183,0.00079048116,0.0013348592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030991875,0.00005172889,0.0010496571,0.00022869001,0.000030444291,0.00088706205,0.00049366907,0.0012295288,0.026168145,0.8842192,0.00933629,0.075995594],"study_design_scores_gemma":[0.00018056358,0.00025261965,0.0031649529,0.00012259794,0.00006695363,0.004216367,0.0009739248,0.004378094,0.020258987,0.7256793,0.24061035,0.00009532134],"about_ca_topic_score_codex":0.00050782604,"about_ca_topic_score_gemma":0.0007460898,"teacher_disagreement_score":0.013187691,"about_ca_system_score_codex":0.000630741,"about_ca_system_score_gemma":0.00036853904,"threshold_uncertainty_score":0.044117153},"labels":[],"label_agreement":null},{"id":"W2405236066","doi":"","title":"Theorems About PI Indices.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Psychometric Methodologies and Testing","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pi; Pure mathematics; Geometry","score_opus":0.2720963887838566,"score_gpt":0.4342377935633694,"score_spread":0.16214140477951278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405236066","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0087463055,0.0034483233,0.80601496,0.0041936324,0.0005093718,0.00009955347,0.0010340896,0.0005600494,0.17539366],"genre_scores_gemma":[0.49694055,0.0066070063,0.4180519,0.00382942,0.0030539418,0.0010201458,0.0022926908,0.00067747873,0.067526914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.990516,0.003957181,0.00074178143,0.0014107078,0.0029838723,0.0003904804],"domain_scores_gemma":[0.95261145,0.035361044,0.002298298,0.0050606485,0.003889086,0.0007793691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011541062,0.0014840658,0.0013802573,0.006215399,0.0018300375,0.0065565575,0.0024350933,0.0015181055,0.019724509],"category_scores_gemma":[0.061380852,0.0007829805,0.0019344415,0.0058891894,0.005409368,0.015241075,0.003962272,0.0051423986,0.006164608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008760243,0.000014030543,0.00038209071,0.000058765636,0.000016714679,0.00002403895,0.000054264234,0.0004900245,0.000066418885,0.9747604,0.0043179197,0.019806568],"study_design_scores_gemma":[0.000004974257,0.000006242211,0.00019431398,0.00002416576,0.000007891481,0.000062831314,0.000018586317,0.0022619166,0.000108623564,0.9919952,0.00531043,0.000004881043],"about_ca_topic_score_codex":0.0011691132,"about_ca_topic_score_gemma":0.0009281753,"teacher_disagreement_score":0.019724509,"about_ca_system_score_codex":0.0024989222,"about_ca_system_score_gemma":0.0016836486,"threshold_uncertainty_score":0.06598508},"labels":[],"label_agreement":null},{"id":"W2405246703","doi":"","title":"Bases of primitive non-powerful signed symmetric digraphs with loops.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Pure mathematics","score_opus":0.003676281788547389,"score_gpt":0.180556490818496,"score_spread":0.1768802090299486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405246703","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32719225,0.0013788142,0.34224185,0.0009685178,0.0006713296,0.00019620566,0.0018247499,0.0007764615,0.32474983],"genre_scores_gemma":[0.91244346,0.00052574574,0.040398862,0.00024736213,0.00019565565,0.0001121386,0.0011430385,0.00011377501,0.04481999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995421,0.00009668575,0.000031069314,0.00008875336,0.00013709914,0.0001042845],"domain_scores_gemma":[0.9988625,0.00038064318,0.00016693372,0.00017761734,0.00021014559,0.00020210736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038905343,0.00047742474,0.00045909997,0.0014969633,0.0011369236,0.0023553756,0.00093166257,0.0005920189,0.014264839],"category_scores_gemma":[0.0015885109,0.00033242835,0.00045601127,0.0009821291,0.0011245678,0.002344495,0.0015143631,0.0013739092,0.0024926127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056054283,0.000034828965,0.000095987736,0.00006135025,0.0000074204104,0.00012706683,0.00012244828,0.0011076696,0.0019297579,0.98390824,0.0014262822,0.011122919],"study_design_scores_gemma":[0.000030954594,0.000035708454,0.00015162486,0.000032527834,0.00001219367,0.00015156675,0.0001038613,0.0059001725,0.0020808247,0.9809171,0.01056858,0.000014990061],"about_ca_topic_score_codex":0.00062444917,"about_ca_topic_score_gemma":0.0015751453,"teacher_disagreement_score":0.014264839,"about_ca_system_score_codex":0.0008650433,"about_ca_system_score_gemma":0.00063347217,"threshold_uncertainty_score":0.04772067},"labels":[],"label_agreement":null},{"id":"W2405269457","doi":"","title":"The Dynamics Of The Difference Equation x n+1 ={α x n-k }/{β +γ x p_{n-(k+1)} .","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematical and Theoretical Epidemiology and Ecology Models","field":"Medicine","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dynamics (music); Mathematical physics; Physics","score_opus":0.01834506230671996,"score_gpt":0.26973182027421677,"score_spread":0.2513867579674968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405269457","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42016852,0.0021107434,0.4647336,0.014161618,0.0011964461,0.00020535807,0.0026290545,0.00047354918,0.094321154],"genre_scores_gemma":[0.89116716,0.0011950765,0.034180403,0.00068580173,0.00019494638,0.00021469209,0.00074270327,0.000117484036,0.07150173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996203,0.00009328055,0.000017729119,0.00009748886,0.00011194296,0.0000592886],"domain_scores_gemma":[0.99866724,0.0006171918,0.00024937632,0.00009152161,0.00017622653,0.00019848104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009338008,0.0002532602,0.00042523592,0.0006940607,0.000621482,0.001606313,0.0013178235,0.0010852034,0.017778732],"category_scores_gemma":[0.0065688095,0.0002741202,0.00046460284,0.00038023308,0.0013979506,0.0028155192,0.0012826413,0.0015214665,0.0012769392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010088792,0.000047511727,0.0034834044,0.00007433067,0.00003743509,0.00024476252,0.0002211711,0.024854684,0.002646813,0.9512897,0.0051770015,0.011822246],"study_design_scores_gemma":[0.00013063369,0.000097650875,0.0038680946,0.000054848744,0.000027321403,0.00058845937,0.00019164497,0.36961088,0.0013932917,0.61099166,0.01294953,0.00009596537],"about_ca_topic_score_codex":0.0049196715,"about_ca_topic_score_gemma":0.0035030625,"teacher_disagreement_score":0.017778732,"about_ca_system_score_codex":0.0011311123,"about_ca_system_score_gemma":0.0011842585,"threshold_uncertainty_score":0.05947578},"labels":[],"label_agreement":null},{"id":"W2405270214","doi":"","title":"Values of a Class of Generalized Euler and Bernoulli Numbers.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bernoulli's principle; Class (philosophy); Euler's formula; Euler number (physics); Bernoulli number; Pure mathematics; Mathematical analysis; Semi-implicit Euler method; Euler equations; Backward Euler method; Computer science; Artificial intelligence; Physics","score_opus":0.05285146605033202,"score_gpt":0.30042824498810067,"score_spread":0.24757677893776864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405270214","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51081085,0.004863233,0.13867751,0.0039981855,0.0017674635,0.000056212713,0.0007197008,0.0003709153,0.33873588],"genre_scores_gemma":[0.9561716,0.00085626915,0.014698898,0.0002589057,0.0006073597,0.000043631917,0.00020132487,0.00007654968,0.027085619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993412,0.00017152439,0.000027183705,0.00011956406,0.00020226053,0.00013821031],"domain_scores_gemma":[0.99858606,0.00046564036,0.00025317635,0.0001862374,0.00021667819,0.0002922388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007817228,0.00060923386,0.00062080624,0.0026739824,0.0016900742,0.0028700065,0.0010002442,0.00103769,0.010110034],"category_scores_gemma":[0.0044454327,0.00030635376,0.0004219498,0.0015966889,0.0031227712,0.004768069,0.0023508822,0.0018345707,0.0012874882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012888981,0.000005754296,0.00016677585,0.000013063392,0.0000028805264,0.00003925307,0.00005586121,0.00021474755,0.00021452626,0.99552625,0.00083002844,0.0029179633],"study_design_scores_gemma":[0.0000072399234,0.000006477545,0.00023364286,0.000015839843,0.000003092506,0.00015885857,0.000042901367,0.0018636731,0.00020713652,0.99307513,0.004376538,0.000009370873],"about_ca_topic_score_codex":0.0005550412,"about_ca_topic_score_gemma":0.00057004695,"teacher_disagreement_score":0.010110034,"about_ca_system_score_codex":0.0010691376,"about_ca_system_score_gemma":0.00065544643,"threshold_uncertainty_score":0.033821404},"labels":[],"label_agreement":null},{"id":"W2405273397","doi":"","title":"Remarks On Group Rings And The Davenport Constant.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Constant (computer programming); Group (periodic table); Pure mathematics; Algebra over a field; Combinatorics; Physics; Computer science; Quantum mechanics","score_opus":0.026922638557456226,"score_gpt":0.24429493970863622,"score_spread":0.21737230115118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405273397","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013012232,0.031210301,0.03178249,0.2576031,0.014659084,0.000044970257,0.0010296608,0.00046678775,0.6501913],"genre_scores_gemma":[0.5623645,0.03905438,0.036006976,0.13002248,0.031473283,0.00029655488,0.0009307117,0.0005489175,0.19930214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849963,0.00052116247,0.000065466586,0.00028066093,0.00042098414,0.00021209838],"domain_scores_gemma":[0.9954267,0.0031732442,0.00021124912,0.00037805323,0.00052663835,0.00028414314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027902594,0.00083505287,0.0007358659,0.0017205243,0.0032592304,0.0028463588,0.001921142,0.0030680439,0.030171476],"category_scores_gemma":[0.006047032,0.0003290244,0.00088383415,0.0015824076,0.007260516,0.010925145,0.0028753157,0.004027664,0.003754966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030129633,0.000014087673,0.00011943101,0.000072244366,0.0000113151,0.00011614973,0.0002706838,0.00014355112,0.0001217608,0.94693494,0.048663765,0.0035018534],"study_design_scores_gemma":[0.00001721663,0.000016650827,0.00051194604,0.00006204412,0.000009858584,0.00011854894,0.0002732335,0.00017629727,0.00018023174,0.87649506,0.12212414,0.000014748693],"about_ca_topic_score_codex":0.0031368348,"about_ca_topic_score_gemma":0.0029741544,"teacher_disagreement_score":0.030171476,"about_ca_system_score_codex":0.0016515526,"about_ca_system_score_gemma":0.00070743804,"threshold_uncertainty_score":0.10093367},"labels":[],"label_agreement":null},{"id":"W2405294156","doi":"","title":"On the zeroth-order general Randic index of unicycle graphs with k pendant vertices.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Topological index; Combinatorics; Order (exchange); Index (typography); Computer science","score_opus":0.015121232968081134,"score_gpt":0.24849435882436374,"score_spread":0.23337312585628261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405294156","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81551677,0.0018796672,0.035373174,0.0009520567,0.00037105012,0.000048328817,0.00037728762,0.00024529244,0.14523631],"genre_scores_gemma":[0.9832077,0.00061645935,0.0053858967,0.00015021836,0.00015667592,0.000033247477,0.00021629524,0.00008807701,0.010145519],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995813,0.00010151885,0.000021341617,0.00008277474,0.00009458303,0.00011851191],"domain_scores_gemma":[0.9982212,0.0007176383,0.00035410025,0.00018891346,0.00019288689,0.00032521007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005222691,0.0004744975,0.0006884978,0.0030027253,0.0016207556,0.002417526,0.0012684206,0.0010125027,0.0067695235],"category_scores_gemma":[0.003502588,0.0003601007,0.00034090792,0.0012045772,0.0024061403,0.0028045427,0.0012924998,0.0012671008,0.001161744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017731069,0.00003695104,0.0012367108,0.00009384465,0.000011357665,0.00020271585,0.00036034366,0.0031011943,0.0030089929,0.9771991,0.0028918497,0.011679763],"study_design_scores_gemma":[0.000029018925,0.000045626974,0.0012858799,0.000059536607,0.000017028886,0.00034769002,0.0002848688,0.015013107,0.0014826577,0.976184,0.0052184425,0.000032072196],"about_ca_topic_score_codex":0.0013391069,"about_ca_topic_score_gemma":0.002224244,"teacher_disagreement_score":0.0067695235,"about_ca_system_score_codex":0.0011857557,"about_ca_system_score_gemma":0.00047694647,"threshold_uncertainty_score":0.022646368},"labels":[],"label_agreement":null},{"id":"W2405304254","doi":"","title":"Connectivity and super-connectivity of Cartesian product graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Mathematics; Product (mathematics); Cartesian coordinate system; Combinatorics; Order (exchange); Degree (music); Discrete mathematics; Geometry; Business; Physics","score_opus":0.008479422549771593,"score_gpt":0.21955807577360473,"score_spread":0.21107865322383312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405304254","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70937604,0.002957239,0.23097907,0.0010677712,0.0001479146,0.00006343196,0.00076227356,0.00030209575,0.05434413],"genre_scores_gemma":[0.973813,0.0006945811,0.022829695,0.00010255169,0.000085758555,0.000042265838,0.00041197904,0.00003503751,0.0019851339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991398,0.00021598936,0.00005296602,0.00031503176,0.00018658946,0.000089466856],"domain_scores_gemma":[0.99581224,0.002135128,0.0008040077,0.00039819436,0.0005024557,0.0003478405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065999443,0.00034927804,0.00037711463,0.0012097227,0.00072452327,0.0010376386,0.0005605112,0.0005595458,0.0050959922],"category_scores_gemma":[0.0041465685,0.00034683757,0.0003856643,0.0012556877,0.0017094584,0.0035069596,0.0010192683,0.0008465415,0.00037575336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036619898,0.000052488278,0.008882695,0.00044265602,0.00006184832,0.0012018201,0.001330145,0.012029724,0.015629698,0.9185261,0.0034489823,0.038027674],"study_design_scores_gemma":[0.000044614113,0.00034553537,0.014678861,0.00014795434,0.00014249326,0.0057959016,0.0008786968,0.048545875,0.013059591,0.88497525,0.031313848,0.00007136035],"about_ca_topic_score_codex":0.00061028515,"about_ca_topic_score_gemma":0.00082915695,"teacher_disagreement_score":0.0050959922,"about_ca_system_score_codex":0.0004929775,"about_ca_system_score_gemma":0.00027665676,"threshold_uncertainty_score":0.017047763},"labels":[],"label_agreement":null},{"id":"W2405309453","doi":"","title":"On super (a, d)-edge-antimagic total labeling of subdivided stars.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Stars; Enhanced Data Rates for GSM Evolution; Combinatorics; Astrophysics; Artificial intelligence; Physics; Computer science","score_opus":0.01470256567222547,"score_gpt":0.23355309271789368,"score_spread":0.2188505270456682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405309453","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43944657,0.0020441345,0.4077856,0.0024343075,0.00029619303,0.00019422943,0.0021786734,0.0009798487,0.14464036],"genre_scores_gemma":[0.7588974,0.0013865068,0.20852554,0.0011401337,0.00018685036,0.00019715633,0.0026614459,0.00033740752,0.02666752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991968,0.00025654506,0.000052922693,0.00018000862,0.0001564794,0.0001571681],"domain_scores_gemma":[0.99722123,0.0014338532,0.00023218035,0.000549065,0.00024405986,0.00031967481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009688381,0.00051433704,0.0008053431,0.0013217529,0.0019489217,0.0025141875,0.0012592011,0.0014376075,0.0080632195],"category_scores_gemma":[0.0036952223,0.000492717,0.00077298377,0.0023412248,0.0016284403,0.0044065784,0.002999518,0.0017028004,0.0013792325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022782724,0.00007019692,0.0011560018,0.0002728189,0.000032148786,0.00010325099,0.00040597035,0.009243809,0.003834815,0.93688554,0.010474757,0.037292894],"study_design_scores_gemma":[0.000038824535,0.000042612075,0.00069266197,0.000052359344,0.00003593893,0.00019101251,0.00026903168,0.021556305,0.0015824036,0.96480733,0.010713708,0.000017897077],"about_ca_topic_score_codex":0.0019844472,"about_ca_topic_score_gemma":0.0034142374,"teacher_disagreement_score":0.0080632195,"about_ca_system_score_codex":0.0016517878,"about_ca_system_score_gemma":0.0008338864,"threshold_uncertainty_score":0.026974201},"labels":[],"label_agreement":null},{"id":"W2405309804","doi":"","title":"On the harmonic index and the matching number of a tree.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Upper and lower bounds; Matching (statistics); Harmonic; Index (typography); Tree (set theory); Graph; Discrete mathematics; Mathematical analysis; Statistics; Physics; Quantum mechanics","score_opus":0.016207131169212588,"score_gpt":0.2697401001770398,"score_spread":0.25353296900782724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405309804","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20384774,0.020327913,0.5377077,0.007504734,0.0019639747,0.00020788738,0.0018636478,0.0006499177,0.22592655],"genre_scores_gemma":[0.8443769,0.010880513,0.10646099,0.0016905203,0.0036298374,0.00052924803,0.0016386312,0.0006486183,0.030144747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977519,0.0003867364,0.000106586565,0.0005637359,0.0006571309,0.0005339391],"domain_scores_gemma":[0.98941094,0.0075544645,0.00073122716,0.000880317,0.00048241578,0.0009406194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002124471,0.0016010321,0.0020121634,0.0042829583,0.0017445593,0.0031731215,0.003346854,0.0020555202,0.010609029],"category_scores_gemma":[0.015309467,0.0006265001,0.0011717639,0.0031042888,0.0046745446,0.010628155,0.0047852537,0.0054954733,0.0029063702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033376133,0.000117032614,0.0019945155,0.00033613376,0.00007005726,0.00028102522,0.00038273353,0.01678301,0.009161262,0.91242856,0.008772735,0.049339153],"study_design_scores_gemma":[0.000029509287,0.00012988086,0.0021578341,0.00012029372,0.0000700135,0.00056049245,0.00011424427,0.053967066,0.0043862103,0.92259336,0.015793113,0.000077923876],"about_ca_topic_score_codex":0.0009168015,"about_ca_topic_score_gemma":0.0008589399,"teacher_disagreement_score":0.010609029,"about_ca_system_score_codex":0.0026587078,"about_ca_system_score_gemma":0.00071259635,"threshold_uncertainty_score":0.03549075},"labels":[],"label_agreement":null},{"id":"W2405330168","doi":"","title":"A New Sufficient Condition for Graphs to Have (g, f)-Factors.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.011438246691691752,"score_gpt":0.22834143345803912,"score_spread":0.21690318676634737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405330168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20923953,0.0027136544,0.49583045,0.008074926,0.0035450642,0.0006823548,0.0076464037,0.0037405454,0.26852718],"genre_scores_gemma":[0.85943985,0.0010559898,0.10933151,0.0025643709,0.0016381965,0.0005598369,0.004641935,0.0006220935,0.020146213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99741423,0.00052327284,0.00027377074,0.00082754524,0.00046852115,0.00049258396],"domain_scores_gemma":[0.983836,0.008401987,0.0012321433,0.0019324347,0.0022290412,0.002368364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017573067,0.000867647,0.0014177752,0.002504017,0.0028228408,0.0033298275,0.0012728634,0.0033161195,0.020972835],"category_scores_gemma":[0.018090762,0.0009891264,0.0013398661,0.0013265775,0.003204743,0.0077846525,0.0030102246,0.0040004794,0.0044097803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089686154,0.00031788388,0.0040138327,0.0005463158,0.000094501636,0.001984149,0.0008074498,0.0032507225,0.02495639,0.89572436,0.042096104,0.025311457],"study_design_scores_gemma":[0.00031711257,0.0002539781,0.0030358438,0.00022744619,0.00011669757,0.0032596574,0.0011366179,0.015207677,0.013595616,0.9095685,0.05310763,0.00017318927],"about_ca_topic_score_codex":0.0015086484,"about_ca_topic_score_gemma":0.0020645906,"teacher_disagreement_score":0.020972835,"about_ca_system_score_codex":0.0011582705,"about_ca_system_score_gemma":0.0016338589,"threshold_uncertainty_score":0.070161164},"labels":[],"label_agreement":null},{"id":"W2405338386","doi":"","title":"Restricted arc-connectivity of digraphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arc (geometry); Mathematics; Geometry","score_opus":0.010046070011547937,"score_gpt":0.2185926251496004,"score_spread":0.20854655513805245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405338386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31779745,0.003191594,0.44051522,0.0017967104,0.0003149846,0.00017089506,0.0042183236,0.0012869835,0.23070793],"genre_scores_gemma":[0.9373381,0.001940609,0.035633236,0.0003501412,0.00018458342,0.00013548697,0.002784782,0.00016545874,0.021467619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934226,0.0001814799,0.00005498497,0.0002022006,0.0001334396,0.00008558494],"domain_scores_gemma":[0.9974293,0.0014599059,0.00027833806,0.0003998199,0.0002410704,0.00019158465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036210904,0.0003792269,0.00043809676,0.0012286964,0.00062312366,0.001684111,0.00086365355,0.00065277854,0.013914027],"category_scores_gemma":[0.0036226748,0.00035459417,0.0005039383,0.0014032852,0.0009101749,0.0035408677,0.0010312373,0.001223595,0.0016844567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009791529,0.000051682633,0.0011321651,0.00035618382,0.000052799278,0.0004645785,0.00027283878,0.008858282,0.0037086704,0.94122756,0.0074955225,0.036281694],"study_design_scores_gemma":[0.000028988674,0.000038228904,0.0009774241,0.000060449165,0.00004266398,0.0009629788,0.00012247292,0.023814881,0.0017691127,0.95283836,0.019326124,0.000018180031],"about_ca_topic_score_codex":0.00077308645,"about_ca_topic_score_gemma":0.0011099201,"teacher_disagreement_score":0.013914027,"about_ca_system_score_codex":0.0005283152,"about_ca_system_score_gemma":0.00031576338,"threshold_uncertainty_score":0.046547055},"labels":[],"label_agreement":null},{"id":"W2405354386","doi":"","title":"Determinants involving generalized Stirling numbers.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Lipid Membrane Structure and Behavior","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Stirling engine; Stirling numbers of the first kind; Stirling number; Stirling numbers of the second kind; Applied mathematics; Pure mathematics; Thermodynamics; Physics","score_opus":0.009691122043654412,"score_gpt":0.2614114745324278,"score_spread":0.2517203524887734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405354386","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2602428,0.004961757,0.2853619,0.0031901393,0.001967192,0.00014901752,0.000727709,0.0012263069,0.44217312],"genre_scores_gemma":[0.883813,0.0020337312,0.025800843,0.00064170145,0.0010939167,0.00014467524,0.00042550446,0.00043971284,0.08560696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993088,0.00015462739,0.00003487436,0.000102676175,0.00027136112,0.0001275493],"domain_scores_gemma":[0.99846715,0.0005972835,0.00022128563,0.00020269588,0.00024212853,0.00026949943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008634733,0.00086084445,0.0007877099,0.0028807193,0.00084911456,0.0024039298,0.0008191855,0.000860382,0.016415423],"category_scores_gemma":[0.0033277897,0.00032012333,0.000775025,0.0010490323,0.0021010973,0.0032502797,0.0015208573,0.0014142711,0.0032123162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012118222,0.000010466764,0.00009014671,0.000035872865,0.0000046854207,0.000048054724,0.000027949833,0.0006623993,0.000636429,0.99273336,0.0017759795,0.003962527],"study_design_scores_gemma":[0.0000072547814,0.000011791337,0.00021558757,0.000013479326,0.0000043645223,0.00017603298,0.000025744212,0.0077437977,0.00050660066,0.98664993,0.0046276185,0.000017885139],"about_ca_topic_score_codex":0.0005984685,"about_ca_topic_score_gemma":0.001004315,"teacher_disagreement_score":0.016415423,"about_ca_system_score_codex":0.0010391135,"about_ca_system_score_gemma":0.0006345686,"threshold_uncertainty_score":0.05491507},"labels":[],"label_agreement":null},{"id":"W2405356971","doi":"","title":"On the existence and the number of (2-d)-kernels in graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.03151041872127789,"score_gpt":0.30050542928615226,"score_spread":0.26899501056487435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405356971","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8355738,0.003020783,0.08066876,0.0050527873,0.00040241555,0.00008267845,0.0013452033,0.0003854366,0.07346812],"genre_scores_gemma":[0.9749428,0.0009844112,0.016527493,0.00028975547,0.00022085034,0.00009677117,0.0004354217,0.000095237076,0.0064073876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983931,0.00045102774,0.000106773936,0.00043459752,0.00026102312,0.00035347327],"domain_scores_gemma":[0.977485,0.014551313,0.0024373059,0.001747017,0.0011354209,0.0026438911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017111266,0.0005788074,0.0011917198,0.0030519047,0.002935951,0.0051088533,0.002605157,0.0030277125,0.008789746],"category_scores_gemma":[0.014466883,0.00095970347,0.0009286374,0.0020246897,0.0051640184,0.011061895,0.0037898603,0.002910639,0.0010608354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003560354,0.0001364108,0.0048989896,0.00029745913,0.00004326434,0.000190918,0.0005531146,0.004080067,0.00377814,0.9650844,0.0052894233,0.015291832],"study_design_scores_gemma":[0.0000614738,0.000062291336,0.0039732833,0.000116273586,0.000065805434,0.00089234137,0.00067699066,0.02479216,0.0029702191,0.9608509,0.005480271,0.00005798892],"about_ca_topic_score_codex":0.000887251,"about_ca_topic_score_gemma":0.0011429202,"teacher_disagreement_score":0.008789746,"about_ca_system_score_codex":0.0014891394,"about_ca_system_score_gemma":0.0006411096,"threshold_uncertainty_score":0.02940464},"labels":[],"label_agreement":null},{"id":"W2405359541","doi":"","title":"Generating 3-connected quadrangulations on surfaces","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01779331823970243,"score_gpt":0.27962684747481426,"score_spread":0.26183352923511183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405359541","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6833798,0.00030521982,0.16982079,0.0008047724,0.0005603419,0.0002957577,0.0005622934,0.0009847253,0.14328618],"genre_scores_gemma":[0.8943757,0.00027158638,0.054364324,0.00035981342,0.0001070117,0.0001618367,0.00071433757,0.0008666758,0.048778664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995604,0.00009179656,0.00002176246,0.00007480736,0.00013780991,0.00011330434],"domain_scores_gemma":[0.99939466,0.00025811902,0.00006862333,0.0000961386,0.000076591015,0.00010590375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000250752,0.0009926718,0.00073192874,0.001283616,0.0013473174,0.0023213672,0.0012004628,0.0015880655,0.023926085],"category_scores_gemma":[0.0013733205,0.0007312751,0.0010473317,0.00113607,0.0014300416,0.0017299948,0.0028411017,0.0019441757,0.0035396582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015904168,0.00020440626,0.00091731874,0.00021860455,0.000037934555,0.00070954603,0.0010236735,0.01714893,0.013615938,0.9027851,0.0073298984,0.05584957],"study_design_scores_gemma":[0.000113983144,0.00010839939,0.0006578522,0.000072686846,0.000032478936,0.0005065461,0.00072898134,0.053741373,0.0086669205,0.9167946,0.018531233,0.00004491477],"about_ca_topic_score_codex":0.00066547585,"about_ca_topic_score_gemma":0.0013543635,"teacher_disagreement_score":0.023926085,"about_ca_system_score_codex":0.00078626396,"about_ca_system_score_gemma":0.00026890196,"threshold_uncertainty_score":0.08004069},"labels":[],"label_agreement":null},{"id":"W2405364265","doi":"","title":"Combinatorial Aspects of Mixed Arrangements.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.0064617018763778915,"score_gpt":0.18691422422824985,"score_spread":0.18045252235187195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405364265","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1998606,0.0060026245,0.26511538,0.0034827003,0.00077484956,0.0001134315,0.0006511076,0.0003106964,0.5236886],"genre_scores_gemma":[0.90536785,0.0019554691,0.038959403,0.0005155794,0.0004898616,0.00015059292,0.00040528234,0.00011059006,0.05204538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991091,0.0003316566,0.00004399151,0.00012584568,0.00027997675,0.00010943426],"domain_scores_gemma":[0.99843687,0.0007699903,0.00021182752,0.00023259311,0.0002093325,0.00013935298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042964914,0.00040635417,0.00037421295,0.0020794591,0.0013597789,0.0031924467,0.0008085569,0.00083795306,0.015969273],"category_scores_gemma":[0.0032207663,0.00044485487,0.00036461107,0.0016108518,0.001919866,0.0040898095,0.0013713248,0.0013041128,0.001686232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012585806,0.000009352897,0.00014943813,0.00002303929,0.0000044858916,0.0000624083,0.00006506453,0.0007828844,0.00045622827,0.9920534,0.0012737116,0.005107461],"study_design_scores_gemma":[0.000008119871,0.000012015187,0.00025087013,0.000021817903,0.000009196431,0.00036320495,0.0001545538,0.0074345255,0.0005137947,0.98041415,0.0108100185,0.0000076662145],"about_ca_topic_score_codex":0.0006686606,"about_ca_topic_score_gemma":0.001286646,"teacher_disagreement_score":0.015969273,"about_ca_system_score_codex":0.000835208,"about_ca_system_score_gemma":0.00033896603,"threshold_uncertainty_score":0.05342257},"labels":[],"label_agreement":null},{"id":"W2405378676","doi":"","title":"The Diameters of Almost All Bi-Cayley Graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cayley graph; Combinatorics; Graph","score_opus":0.01693888341381419,"score_gpt":0.26619785381850813,"score_spread":0.24925897040469394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405378676","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6553141,0.0051602963,0.104176,0.0048727137,0.0008113742,0.00008379307,0.0038739482,0.00067132054,0.22503652],"genre_scores_gemma":[0.9474356,0.0025129858,0.024609098,0.00074120966,0.00062203204,0.0001551109,0.0017479125,0.00021057413,0.021965636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934787,0.00017463823,0.00004256935,0.00016014888,0.00015961261,0.00011516558],"domain_scores_gemma":[0.9943403,0.002790067,0.0008586397,0.00052329,0.00068743865,0.0008002273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064785435,0.00062965835,0.00049016706,0.002033068,0.0011793914,0.0029347413,0.0012075636,0.0009651354,0.0076577896],"category_scores_gemma":[0.0075234734,0.00068179815,0.0003875014,0.0012720986,0.0013077611,0.004462288,0.0015951754,0.0017095356,0.0018481278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013900903,0.000023337927,0.0014758433,0.00011628394,0.000028797147,0.000086206805,0.00032588525,0.0020089764,0.0039299424,0.96227354,0.01042383,0.019168325],"study_design_scores_gemma":[0.000027528735,0.000028659828,0.0025448133,0.0000534714,0.00003239869,0.00055621425,0.00032028303,0.010376591,0.0024949259,0.9641556,0.019389892,0.000019716612],"about_ca_topic_score_codex":0.00081794994,"about_ca_topic_score_gemma":0.0011234301,"teacher_disagreement_score":0.0076577896,"about_ca_system_score_codex":0.0008043671,"about_ca_system_score_gemma":0.00040197044,"threshold_uncertainty_score":0.025617898},"labels":[],"label_agreement":null},{"id":"W2405397543","doi":"","title":"On super edge magic deficiency of kite graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Kite; Mathematics; MAGIC (telescope); Enhanced Data Rates for GSM Evolution; Geometry; Astronomy; Computer science; Telecommunications; Physics","score_opus":0.013389781274663658,"score_gpt":0.2268194314642749,"score_spread":0.21342965018961124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405397543","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6271959,0.003236126,0.16400108,0.0064259,0.0004734541,0.00009752209,0.0013801967,0.0005599878,0.19662984],"genre_scores_gemma":[0.94212306,0.0011999838,0.03716923,0.0008671701,0.00022350198,0.00009397592,0.00093672454,0.00015429028,0.01723219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992661,0.0002471078,0.000031807267,0.00013339202,0.00017022807,0.00015132171],"domain_scores_gemma":[0.9963348,0.0023285146,0.00027553027,0.0004473838,0.00027618825,0.00033754972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010117823,0.00047384258,0.000813879,0.0018062812,0.0014359744,0.0021003734,0.0011827219,0.0013796358,0.009149434],"category_scores_gemma":[0.005437815,0.000468291,0.00045715226,0.0014227905,0.002505039,0.0058243927,0.0024725173,0.0023337721,0.0011858755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096434705,0.000035671284,0.0009139381,0.00011226679,0.00001087112,0.00008649926,0.00019657565,0.002953529,0.0010418855,0.9725487,0.0065480117,0.01545554],"study_design_scores_gemma":[0.000019189234,0.000014415904,0.0003962125,0.000030363793,0.00000830377,0.00017477656,0.00014262725,0.009066541,0.00051936915,0.98533636,0.0042801825,0.0000115881],"about_ca_topic_score_codex":0.0011222679,"about_ca_topic_score_gemma":0.0014227465,"teacher_disagreement_score":0.009149434,"about_ca_system_score_codex":0.0011077399,"about_ca_system_score_gemma":0.0005509269,"threshold_uncertainty_score":0.03060788},"labels":[],"label_agreement":null},{"id":"W2405406696","doi":"","title":"Barycentric and zero-sum Ramsey numbers.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Barycentric coordinate system; Zero (linguistics); Combinatorics; Ramsey theory; Geometry","score_opus":0.03235377198159075,"score_gpt":0.29853872014731614,"score_spread":0.2661849481657254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405406696","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21979961,0.00892468,0.13486817,0.0050399704,0.0015874254,0.000050906336,0.00066884106,0.00040659835,0.6286538],"genre_scores_gemma":[0.9264561,0.0017658442,0.013476872,0.0006460233,0.0006298278,0.00004673812,0.00028075758,0.00009361349,0.056604188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994684,0.0001472665,0.000024809688,0.000104463645,0.00016463034,0.000090416346],"domain_scores_gemma":[0.9987424,0.0005249933,0.00015655537,0.00013793411,0.00023160299,0.00020656186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007396759,0.00044527484,0.0005220869,0.0014183715,0.0014005977,0.0026980876,0.00081609393,0.00069571665,0.01149529],"category_scores_gemma":[0.0034842105,0.00033606912,0.0003835727,0.000977783,0.0027009645,0.00520899,0.002457646,0.0020745944,0.0017552837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001043223,0.0000048676898,0.000057900783,0.00001602229,0.0000019176073,0.000015466774,0.000052419513,0.00012070805,0.00016550462,0.9962573,0.0009795474,0.0023179925],"study_design_scores_gemma":[0.0000059548065,0.000005381505,0.00013777633,0.000010937598,0.0000048766306,0.00008153571,0.00006152343,0.00070172845,0.00016709631,0.9930636,0.00575397,0.0000056304293],"about_ca_topic_score_codex":0.0011459723,"about_ca_topic_score_gemma":0.0018374991,"teacher_disagreement_score":0.01149529,"about_ca_system_score_codex":0.0012398238,"about_ca_system_score_gemma":0.000556109,"threshold_uncertainty_score":0.038455606},"labels":[],"label_agreement":null},{"id":"W2405439435","doi":"","title":"Stable Well-Covered Graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.013570825426856514,"score_gpt":0.2684787006737458,"score_spread":0.2549078752468893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405439435","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48877978,0.0029691753,0.19325046,0.0036700368,0.00045196648,0.00012893174,0.0033408355,0.0011041234,0.30630463],"genre_scores_gemma":[0.925368,0.0014377473,0.014994392,0.00041389334,0.00026595764,0.0000822817,0.002332397,0.0002450904,0.054860283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994159,0.00011116735,0.000025992393,0.00013506587,0.00019119303,0.00012073133],"domain_scores_gemma":[0.9982779,0.00073676015,0.00019512734,0.00026293163,0.00027968676,0.0002475379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040792412,0.0005029387,0.0005508418,0.0017960969,0.0013471422,0.0021765118,0.00061457296,0.00084587274,0.015313241],"category_scores_gemma":[0.002286501,0.00046021593,0.00048814018,0.001280421,0.00095410924,0.0042359214,0.0014916983,0.0010698666,0.0028459285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010259043,0.000038550374,0.0010992567,0.00010128416,0.00003965819,0.00030386538,0.00037173423,0.0013130897,0.0046270993,0.96016836,0.011856279,0.019978141],"study_design_scores_gemma":[0.000022053004,0.000024122906,0.0011999928,0.000035209156,0.000042558575,0.0006069859,0.00026611035,0.0070626102,0.003640747,0.9633626,0.023721348,0.000015761609],"about_ca_topic_score_codex":0.0007920166,"about_ca_topic_score_gemma":0.0014482167,"teacher_disagreement_score":0.015313241,"about_ca_system_score_codex":0.00076869974,"about_ca_system_score_gemma":0.0003869824,"threshold_uncertainty_score":0.051227868},"labels":[],"label_agreement":null},{"id":"W2405458804","doi":"","title":"Doubly resolvable designs with small parameters.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Correctness; Mathematics; Isomorphism (crystallography); Range (aeronautics); Algorithm; Combinatorics; Discrete mathematics; Geometry; Crystallography","score_opus":0.017414890843408783,"score_gpt":0.18680161939479156,"score_spread":0.1693867285513828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405458804","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2576423,0.00077334774,0.7171796,0.00018302507,0.000086015505,0.00015822347,0.00047719516,0.00088216015,0.022618156],"genre_scores_gemma":[0.74930245,0.00028014136,0.2431495,0.00008277923,0.000040043127,0.00019644201,0.0005944954,0.00008757508,0.006266584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990876,0.00034466395,0.00006198566,0.0001848823,0.00019566367,0.00012532223],"domain_scores_gemma":[0.9976956,0.0011574507,0.0002815532,0.00063712086,0.00011713535,0.00011109693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081399694,0.00052718236,0.0004853214,0.0009297981,0.0006277852,0.0015661735,0.00063901965,0.00076942047,0.007203121],"category_scores_gemma":[0.0042469944,0.0004217942,0.0006847101,0.00075316906,0.0008724208,0.001784068,0.001567217,0.0010840456,0.0013397557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006695586,0.00016215508,0.0021500948,0.00034479157,0.00008475047,0.000315983,0.0004703499,0.032604154,0.037802693,0.7667237,0.0023627484,0.15630908],"study_design_scores_gemma":[0.00023026309,0.00063512195,0.0011676601,0.00017393571,0.00010382126,0.0012239104,0.00033155986,0.1908716,0.059089888,0.7189954,0.027041921,0.0001348565],"about_ca_topic_score_codex":0.00016643475,"about_ca_topic_score_gemma":0.0002688445,"teacher_disagreement_score":0.007203121,"about_ca_system_score_codex":0.0004079908,"about_ca_system_score_gemma":0.00044070728,"threshold_uncertainty_score":0.024096906},"labels":[],"label_agreement":null},{"id":"W2405462627","doi":"","title":"On the δ-α-open sets and the δ-α-continuous functions.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Fuzzy and Soft Set Theory","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Open set; Pure mathematics","score_opus":0.03787725711455701,"score_gpt":0.30317801656278015,"score_spread":0.2653007594482231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405462627","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15349507,0.013343474,0.57905656,0.007725986,0.00091605977,0.0001147013,0.0012534313,0.00023226072,0.24386242],"genre_scores_gemma":[0.873315,0.0062592416,0.08636981,0.0012358517,0.0012643576,0.00021586198,0.0006421797,0.00010090248,0.0305967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792933,0.00065747224,0.00017371708,0.00038186024,0.00061476,0.00024283548],"domain_scores_gemma":[0.9921232,0.005022053,0.0007064698,0.00068431353,0.0008365217,0.0006275142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029317972,0.00074169313,0.0010106917,0.004713902,0.0023673715,0.006159095,0.0013468432,0.0015504225,0.008278442],"category_scores_gemma":[0.00978249,0.000633269,0.0013987035,0.0032586262,0.010077122,0.011463636,0.0039631436,0.0038369133,0.0014623844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011302656,0.0000063171724,0.00012131215,0.000025114787,0.000005865648,0.000045694986,0.00007476191,0.00047094852,0.00010774496,0.99469805,0.0005591698,0.0038737822],"study_design_scores_gemma":[0.0000053900717,0.0000072366765,0.00018276973,0.000037660127,0.000005110376,0.000079039986,0.000077931705,0.0024901582,0.00008921981,0.99425745,0.0027596208,0.000008337906],"about_ca_topic_score_codex":0.0017872781,"about_ca_topic_score_gemma":0.0012171756,"teacher_disagreement_score":0.008278442,"about_ca_system_score_codex":0.002333659,"about_ca_system_score_gemma":0.0008879517,"threshold_uncertainty_score":0.027694106},"labels":[],"label_agreement":null},{"id":"W2405476814","doi":"","title":"Strict lower bounds on the multiplicative Zagreb indices of graph operations.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Multiplicative function; Graph; Combinatorics; Mathematical analysis","score_opus":0.024062053785271917,"score_gpt":0.28137397878235254,"score_spread":0.2573119249970806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405476814","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16873303,0.0116642155,0.35095072,0.007946759,0.002155788,0.0001350759,0.001826222,0.0010158677,0.45557243],"genre_scores_gemma":[0.88101935,0.00508329,0.067169055,0.0016718383,0.00204641,0.00031681926,0.001186856,0.0005734405,0.040933035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964354,0.0007451281,0.00023277393,0.00058216666,0.0013611681,0.0006433319],"domain_scores_gemma":[0.9811708,0.012588236,0.0009943049,0.002554547,0.0015191298,0.0011729515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035494333,0.0017343228,0.0014232309,0.0044615846,0.0024393757,0.0062294938,0.0032044004,0.0016878702,0.013833107],"category_scores_gemma":[0.023710854,0.0010154451,0.0010778675,0.0034479583,0.0038983854,0.012749107,0.004859799,0.008125839,0.0042732125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011299169,0.000049592396,0.0005986288,0.00011868313,0.000017032145,0.000056433248,0.00018289883,0.0012210559,0.0012769559,0.9755332,0.0040973136,0.016735328],"study_design_scores_gemma":[0.000014146767,0.000030250221,0.00048529584,0.000049643797,0.000028839484,0.00013089656,0.000055036526,0.0046077766,0.0012594131,0.98643327,0.00688725,0.000018154105],"about_ca_topic_score_codex":0.00084411376,"about_ca_topic_score_gemma":0.0018521688,"teacher_disagreement_score":0.013833107,"about_ca_system_score_codex":0.0021820809,"about_ca_system_score_gemma":0.0011079515,"threshold_uncertainty_score":0.04627633},"labels":[],"label_agreement":null},{"id":"W2405487607","doi":"","title":"On The Second Order Linear Recurrences By Generalized Doubly Stochastic Matrices.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Applied mathematics; Order (exchange); Pure mathematics; Combinatorics","score_opus":0.010433486561389165,"score_gpt":0.26796924158733837,"score_spread":0.2575357550259492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405487607","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17303249,0.010278985,0.687061,0.0041227294,0.0016400318,0.00009929586,0.00071886275,0.00044015888,0.12260641],"genre_scores_gemma":[0.90251637,0.0045443885,0.04372996,0.0011117195,0.0018115311,0.00017075993,0.0004428386,0.00020846758,0.04546396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925643,0.0002635719,0.0000399471,0.00008918305,0.00018603906,0.00016477684],"domain_scores_gemma":[0.9980286,0.0009188308,0.00034482454,0.00021577466,0.00029562402,0.00019632648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011456279,0.00078007905,0.00084420264,0.0013126502,0.000901448,0.0017605963,0.00081420876,0.0009558052,0.007312235],"category_scores_gemma":[0.004906679,0.0003581646,0.0007513211,0.0011283315,0.0018434945,0.0030247706,0.0011416401,0.0016568397,0.0016523502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015916758,0.000010580727,0.00012582952,0.000027247002,0.00000779854,0.00007824707,0.00008228126,0.0031811926,0.0004722801,0.99035347,0.002048719,0.0035963987],"study_design_scores_gemma":[0.000006854337,0.000014905585,0.00012687498,0.000016975893,0.0000056606204,0.00010529165,0.000029150118,0.025496637,0.00021008131,0.9713179,0.002654078,0.000015619133],"about_ca_topic_score_codex":0.0013436013,"about_ca_topic_score_gemma":0.0021128391,"teacher_disagreement_score":0.007312235,"about_ca_system_score_codex":0.00096095883,"about_ca_system_score_gemma":0.00068301236,"threshold_uncertainty_score":0.024461865},"labels":[],"label_agreement":null},{"id":"W2405502509","doi":"","title":"θ-graphs of partial cubes and strong edge colorings.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Computer science; Artificial intelligence","score_opus":0.017846575939835834,"score_gpt":0.28261183447950045,"score_spread":0.2647652585396646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405502509","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3275872,0.0021178613,0.3574241,0.0045185606,0.00076525315,0.00018091057,0.002734226,0.0009910722,0.30368087],"genre_scores_gemma":[0.87161785,0.0015331944,0.06974729,0.0012501795,0.0003235233,0.0002308263,0.002457484,0.00027515547,0.052564424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992803,0.00023041083,0.000038185135,0.00016587389,0.000121233075,0.00016396827],"domain_scores_gemma":[0.9964309,0.0016489142,0.00060817396,0.00047969777,0.0003849761,0.00044735716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005506896,0.0006328202,0.00044835318,0.0010450259,0.001531485,0.0023996981,0.0011022766,0.00094771653,0.019205254],"category_scores_gemma":[0.004386733,0.0007166383,0.00078598945,0.0016247953,0.0018804228,0.0049190084,0.0021874686,0.0019490181,0.0020960025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075135846,0.000023846156,0.00059486536,0.000081532584,0.000019336141,0.00012391788,0.00014256143,0.001895958,0.0009878789,0.97645426,0.0058321417,0.013768477],"study_design_scores_gemma":[0.00002148191,0.000018282964,0.0005701034,0.000037040398,0.000020938107,0.0003129422,0.00024985237,0.004252498,0.00076379033,0.9800126,0.013729274,0.00001121921],"about_ca_topic_score_codex":0.0015484587,"about_ca_topic_score_gemma":0.0021459053,"teacher_disagreement_score":0.019205254,"about_ca_system_score_codex":0.00095028034,"about_ca_system_score_gemma":0.0006140536,"threshold_uncertainty_score":0.064247966},"labels":[],"label_agreement":null},{"id":"W2405507427","doi":"","title":"Some C 4 -supermagic graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.010009002474049724,"score_gpt":0.20966783335995443,"score_spread":0.1996588308859047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405507427","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44603974,0.00087092246,0.12797943,0.0057564243,0.00039153668,0.00013726336,0.0034951025,0.0008326429,0.41449693],"genre_scores_gemma":[0.88128906,0.00046580893,0.06269012,0.0013115598,0.00014490393,0.0001099209,0.002520142,0.00017361164,0.05129488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959296,0.000104012695,0.000015683738,0.00009288112,0.00008612986,0.0001083324],"domain_scores_gemma":[0.998769,0.0004854954,0.00015474044,0.00016798469,0.0002012522,0.00022153056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035747397,0.00044012078,0.00033863075,0.0012238945,0.0019373078,0.0019604082,0.000882907,0.0009330044,0.013794956],"category_scores_gemma":[0.0014095958,0.00032247737,0.0004970706,0.0012571077,0.0012268785,0.0020661887,0.0012400493,0.001756503,0.0016192371],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009723513,0.000037926446,0.00055991975,0.00009337181,0.000014094387,0.00017589386,0.00017552136,0.0011744662,0.0024441462,0.9739525,0.010633049,0.010641931],"study_design_scores_gemma":[0.000034790293,0.000013550319,0.0008317507,0.000030571664,0.000018343744,0.00026081628,0.0002749682,0.00701869,0.0021114666,0.9611372,0.028252397,0.000015575719],"about_ca_topic_score_codex":0.0025856108,"about_ca_topic_score_gemma":0.0048969104,"teacher_disagreement_score":0.013794956,"about_ca_system_score_codex":0.0012777238,"about_ca_system_score_gemma":0.00056994695,"threshold_uncertainty_score":0.046148717},"labels":[],"label_agreement":null},{"id":"W2405544010","doi":"","title":"The sum numbers and the integral sum numbers of C n and W n .","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01338394134819497,"score_gpt":0.2903295264600493,"score_spread":0.2769455851118543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405544010","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.124732286,0.0073050396,0.18104471,0.00657678,0.0035260876,0.00007850418,0.0006399621,0.00036333056,0.6757334],"genre_scores_gemma":[0.8080463,0.0043788147,0.06259506,0.0015587577,0.0026023262,0.00024210275,0.00062772667,0.00041812976,0.119530745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987446,0.00029686626,0.00007988058,0.00024083159,0.00044134297,0.00019638789],"domain_scores_gemma":[0.99812263,0.000681187,0.00027082016,0.00023002607,0.00039045326,0.0003047731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001434928,0.0011007226,0.00081830117,0.0045036785,0.0028883722,0.005374276,0.0014019369,0.0015967998,0.01352931],"category_scores_gemma":[0.008062762,0.0005637632,0.0007167506,0.0022482227,0.0068898504,0.012384804,0.0032308546,0.004292616,0.0031498983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011734157,0.0000051327993,0.000056775778,0.00001518843,0.0000025220554,0.000021233838,0.000061462306,0.00008434264,0.00013561374,0.99529415,0.0012455789,0.0030662124],"study_design_scores_gemma":[0.0000033174313,0.0000045571855,0.00011172988,0.000015172593,0.000004242177,0.00009580453,0.00004199471,0.0007105439,0.00026155668,0.9926684,0.0060739475,0.000008566001],"about_ca_topic_score_codex":0.00068292156,"about_ca_topic_score_gemma":0.0007414278,"teacher_disagreement_score":0.01352931,"about_ca_system_score_codex":0.0013842547,"about_ca_system_score_gemma":0.00080485136,"threshold_uncertainty_score":0.045260012},"labels":[],"label_agreement":null},{"id":"W2405545741","doi":"","title":"Maximum Detour Index of Unicyclic Graphs with Given Maximum Degree.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Degree (music); Combinatorics; Statistics; Computer science; Physics; World Wide Web","score_opus":0.03357057070404769,"score_gpt":0.25792935872662576,"score_spread":0.22435878802257808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405545741","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9227384,0.00072332704,0.026361989,0.0007023294,0.00007575752,0.000038784034,0.0016430623,0.00027628013,0.047440086],"genre_scores_gemma":[0.988806,0.00037554273,0.0050093425,0.000045909423,0.000044702545,0.00002862726,0.0005851219,0.00005572104,0.0050490187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995869,0.00010018542,0.000023584294,0.00006597307,0.000102272046,0.00012118287],"domain_scores_gemma":[0.9964064,0.0017279675,0.0005947495,0.00035334224,0.0003808532,0.0005367573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004429585,0.00037791237,0.0005595272,0.0019235718,0.0012983957,0.0021291259,0.0008632956,0.0006782454,0.0039339554],"category_scores_gemma":[0.0052517666,0.00023374638,0.00023970287,0.0014273789,0.000878612,0.0021070363,0.0010134551,0.00063232303,0.00060930056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028355033,0.0002668849,0.01610782,0.00087350555,0.00012639929,0.0010853057,0.0020565141,0.042902578,0.05406836,0.7862223,0.015267636,0.07818712],"study_design_scores_gemma":[0.00017501047,0.00026933843,0.010172232,0.00017902086,0.00012463736,0.001821587,0.0012339276,0.119979665,0.02758673,0.81416404,0.02421428,0.00007960679],"about_ca_topic_score_codex":0.0010822127,"about_ca_topic_score_gemma":0.0020851258,"teacher_disagreement_score":0.0039339554,"about_ca_system_score_codex":0.0011831243,"about_ca_system_score_gemma":0.00046794568,"threshold_uncertainty_score":0.013160408},"labels":[],"label_agreement":null},{"id":"W2405565081","doi":"","title":"Pebbling Number Of The Graph D n , C m .","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Graph","score_opus":0.00910272598086932,"score_gpt":0.22505562980620158,"score_spread":0.21595290382533228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405565081","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7082505,0.000856149,0.10463483,0.0051436834,0.00042687144,0.00011805811,0.0040565883,0.0008013005,0.17571191],"genre_scores_gemma":[0.92288345,0.00032749146,0.040026996,0.00042537614,0.00010907688,0.0001062067,0.0015527327,0.00019132218,0.03437732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951065,0.00010307339,0.000022747774,0.00013721986,0.00009277273,0.00013349645],"domain_scores_gemma":[0.9975262,0.0012732935,0.00022598161,0.00031476066,0.00023352221,0.00042625045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004701651,0.00042128947,0.0005083677,0.0014774962,0.0023124272,0.0027608473,0.0010631644,0.0013575669,0.018334452],"category_scores_gemma":[0.0034779364,0.00030654483,0.000358189,0.0009950711,0.0013382776,0.0029297879,0.001115341,0.001641576,0.002480183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044752512,0.0001601113,0.0031662534,0.00026753443,0.000024603461,0.00022606611,0.0003821801,0.0095447805,0.013524506,0.906657,0.022036586,0.04356289],"study_design_scores_gemma":[0.000048994476,0.000086140804,0.0034173043,0.000075499236,0.000035978694,0.00058945944,0.00042478836,0.04023331,0.010524191,0.91838914,0.026129242,0.000045919118],"about_ca_topic_score_codex":0.0018764775,"about_ca_topic_score_gemma":0.0030375419,"teacher_disagreement_score":0.018334452,"about_ca_system_score_codex":0.0015230973,"about_ca_system_score_gemma":0.0010336393,"threshold_uncertainty_score":0.06133485},"labels":[],"label_agreement":null},{"id":"W2405576942","doi":"","title":"Lattices Associated With Vector Spaces Over A Finite Field.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics; Vector field; Field (mathematics); Vector space; Vector (molecular biology); Finite field; Geometry; Discrete mathematics; Biology","score_opus":0.009954606684701252,"score_gpt":0.23635521995703213,"score_spread":0.22640061327233088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405576942","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3582984,0.0054626833,0.35362896,0.00689313,0.0022317693,0.00022516308,0.002310713,0.001292519,0.2696566],"genre_scores_gemma":[0.89345473,0.0015686307,0.051468898,0.0005567262,0.0011873846,0.00013940179,0.0011042354,0.00022706563,0.05029288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99795854,0.0006363644,0.0001429654,0.00026780125,0.00057831674,0.00041594528],"domain_scores_gemma":[0.99754864,0.00076586,0.00045934864,0.0002503005,0.00033220265,0.0006436003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012423677,0.0005652851,0.0006721645,0.002769273,0.002218238,0.005421744,0.00097463094,0.0009073352,0.011520854],"category_scores_gemma":[0.003207509,0.0004969027,0.000852377,0.0020461103,0.004032472,0.007487636,0.003499208,0.0028767213,0.0020219542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032073265,0.000016590984,0.00017348386,0.000025451021,0.0000055588093,0.00006329617,0.00013887472,0.00027262876,0.00033682433,0.9950663,0.0010120941,0.0028567433],"study_design_scores_gemma":[0.000018784236,0.000015958278,0.00013056985,0.00002219246,0.000006348891,0.00018909179,0.00016624531,0.0016791368,0.00043105008,0.9899283,0.0073991804,0.000013268175],"about_ca_topic_score_codex":0.0010020173,"about_ca_topic_score_gemma":0.0009706707,"teacher_disagreement_score":0.011520854,"about_ca_system_score_codex":0.0015917093,"about_ca_system_score_gemma":0.0010519685,"threshold_uncertainty_score":0.03854114},"labels":[],"label_agreement":null},{"id":"W2405578918","doi":"","title":"Dominating cycles in triangle-free graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Independence number; Graph; Dominating set; Connectivity; Discrete mathematics; Vertex (graph theory)","score_opus":0.0340622158210912,"score_gpt":0.2772688516101176,"score_spread":0.2432066357890264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405578918","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54049635,0.004659649,0.34575143,0.001184986,0.00029987487,0.0002537524,0.0012912506,0.00040093498,0.10566173],"genre_scores_gemma":[0.9146043,0.0024342134,0.06372203,0.00049902033,0.00017779692,0.0001673987,0.0015210294,0.00010358111,0.01677056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937195,0.000105580664,0.000043855533,0.00015718126,0.00018013413,0.00014137056],"domain_scores_gemma":[0.9973316,0.0014324387,0.00041719532,0.00025557043,0.00026361344,0.00029961273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000416647,0.00046196434,0.00033647852,0.0014140643,0.0012114247,0.0012591255,0.0006701148,0.0006618668,0.0055166176],"category_scores_gemma":[0.003521201,0.0004750671,0.000636462,0.0015574665,0.0010447268,0.0019972685,0.001447508,0.00083571114,0.00071923237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005397202,0.00008217025,0.007958034,0.0007870974,0.00010229628,0.0018873535,0.0017336938,0.019177895,0.032633748,0.8296762,0.008670024,0.0967518],"study_design_scores_gemma":[0.000065878994,0.000112686386,0.003615522,0.000117813775,0.00008255484,0.002856308,0.0005462603,0.04638492,0.014733634,0.8869878,0.044446547,0.000050037102],"about_ca_topic_score_codex":0.0017419187,"about_ca_topic_score_gemma":0.0027140342,"teacher_disagreement_score":0.0055166176,"about_ca_system_score_codex":0.0007460002,"about_ca_system_score_gemma":0.00033070083,"threshold_uncertainty_score":0.01845491},"labels":[],"label_agreement":null},{"id":"W2405593239","doi":"","title":"Orthogonal (g, f)-Factorization in Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Factorization; Combinatorics; Algorithm","score_opus":0.007537132509937611,"score_gpt":0.1967244218576037,"score_spread":0.18918728934766607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405593239","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18662515,0.0018356014,0.66617006,0.0027617824,0.0006792827,0.00016244415,0.0013538897,0.00061755214,0.1397942],"genre_scores_gemma":[0.82635635,0.0011754454,0.12426765,0.0007959418,0.000418536,0.00014399791,0.0008319463,0.00014114204,0.045868922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991761,0.00023453635,0.000034700868,0.00018947017,0.00016922431,0.0001959774],"domain_scores_gemma":[0.9982855,0.0005379454,0.00027985775,0.00033695198,0.00031389933,0.0002457664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067803403,0.00048859965,0.0004645191,0.0014674768,0.0013088894,0.0018170452,0.00044437803,0.0007732486,0.00935608],"category_scores_gemma":[0.003073483,0.00029796557,0.0004858317,0.0010401778,0.0014659844,0.0027302785,0.001442403,0.0011688047,0.0018067299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006127256,0.00003546996,0.0003392648,0.00004742197,0.00001120899,0.00010036962,0.00014487021,0.0020009717,0.0017484118,0.9743303,0.0051599583,0.016020486],"study_design_scores_gemma":[0.000012939624,0.000022752713,0.00030029015,0.000026878677,0.00000963213,0.00021128374,0.00013318409,0.011442551,0.00081034517,0.9773926,0.009622862,0.000014662906],"about_ca_topic_score_codex":0.0016352517,"about_ca_topic_score_gemma":0.0027809672,"teacher_disagreement_score":0.00935608,"about_ca_system_score_codex":0.0009506815,"about_ca_system_score_gemma":0.00089464127,"threshold_uncertainty_score":0.031299233},"labels":[],"label_agreement":null},{"id":"W2405614798","doi":"","title":"The Vertex Linear Arboricity of a Special Class of Integer Distance Graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arboricity; Mathematics; Vertex (graph theory); Combinatorics; Class (philosophy); Integer (computer science); Discrete mathematics; Graph; Planar graph; Computer science; Artificial intelligence","score_opus":0.011205868209185203,"score_gpt":0.25843431065947703,"score_spread":0.24722844245029182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405614798","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8554907,0.000659291,0.03623368,0.00089202117,0.000104037106,0.000036939255,0.00063451816,0.00025704334,0.10569189],"genre_scores_gemma":[0.9909875,0.000257119,0.0033729319,0.00008213567,0.00008139319,0.000016967266,0.0003721382,0.000030236552,0.0047995565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998154,0.00003461034,0.000008162274,0.0000531433,0.000039964947,0.000048818918],"domain_scores_gemma":[0.998696,0.00067048275,0.00026713722,0.00013140209,0.00007192897,0.00016302911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015304156,0.00022682354,0.00025141105,0.0008350219,0.0007445581,0.0015008814,0.0004851579,0.0005603878,0.005354281],"category_scores_gemma":[0.0017185508,0.00017534754,0.00024505876,0.0007788052,0.0008201958,0.0012929856,0.00061835494,0.0007875013,0.00045970496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025661525,0.000083633175,0.0069921003,0.0001712559,0.00003175638,0.0011710763,0.00060152775,0.009309158,0.010217321,0.9245775,0.007831819,0.038756315],"study_design_scores_gemma":[0.00006145352,0.00008291222,0.005288362,0.00005005168,0.00004136506,0.0021918113,0.00052920345,0.04822105,0.0036459223,0.9219577,0.017903479,0.000026770887],"about_ca_topic_score_codex":0.0006314363,"about_ca_topic_score_gemma":0.0008893133,"teacher_disagreement_score":0.005354281,"about_ca_system_score_codex":0.0004356659,"about_ca_system_score_gemma":0.00018592771,"threshold_uncertainty_score":0.017911851},"labels":[],"label_agreement":null},{"id":"W2405623444","doi":"","title":"An improved upper bound on the adjacent vertex distinguishing edge chromatic number of a simple graph.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Windmill graph; Chromatic scale; Combinatorics; Edge contraction; Simple graph; Simple (philosophy); Graph; Upper and lower bounds; Enhanced Data Rates for GSM Evolution; Friendship graph; Edge coloring; Line graph; Graph power; Computer science; Mathematical analysis; Telecommunications","score_opus":0.011408938425104027,"score_gpt":0.23971276136335537,"score_spread":0.22830382293825136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405623444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2170053,0.006305671,0.486318,0.0066370717,0.0023054709,0.00048419676,0.006028734,0.004870466,0.270045],"genre_scores_gemma":[0.68691957,0.00234291,0.2727903,0.001787192,0.0010971138,0.0004797783,0.004454729,0.0012787208,0.028849678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976497,0.0004056647,0.00010090437,0.000610825,0.0007419656,0.00049088825],"domain_scores_gemma":[0.9875437,0.008053807,0.00045357997,0.0024221162,0.00073535653,0.0007914982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023421682,0.0019005735,0.0016328138,0.0032556215,0.0022857364,0.004701968,0.004995864,0.0020016131,0.022467637],"category_scores_gemma":[0.012210461,0.00087955216,0.0013878444,0.003642358,0.002799967,0.008300598,0.0046008313,0.0052933996,0.0047853445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018214303,0.0008654763,0.005094712,0.0012272649,0.00019173096,0.0005035998,0.0006012652,0.07640873,0.040836792,0.62993675,0.084436804,0.15807554],"study_design_scores_gemma":[0.00018928052,0.00023511476,0.0039698407,0.00020397478,0.00025943478,0.0007886986,0.00025210655,0.26419342,0.014102348,0.6676144,0.048038956,0.00015246919],"about_ca_topic_score_codex":0.0033247152,"about_ca_topic_score_gemma":0.007535802,"teacher_disagreement_score":0.022467637,"about_ca_system_score_codex":0.0038722553,"about_ca_system_score_gemma":0.0021914062,"threshold_uncertainty_score":0.075161755},"labels":[],"label_agreement":null},{"id":"W2405638771","doi":"","title":"Uniformly Least Reliable Graphs in Class Ω(n, e) as e ≤ n+1.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Class (philosophy); Combinatorics; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.003918950575033811,"score_gpt":0.18814208400397403,"score_spread":0.18422313342894023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405638771","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6660599,0.0019028089,0.23488913,0.006548942,0.00024647047,0.00010469491,0.0032516203,0.0011439974,0.08585241],"genre_scores_gemma":[0.96796316,0.0005162762,0.017847177,0.00046734858,0.00013393312,0.0000951318,0.00085922994,0.00015063418,0.011967073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991812,0.0002155931,0.000035831,0.00022193309,0.00015584745,0.00018959207],"domain_scores_gemma":[0.9875607,0.0077817966,0.0015073579,0.0016822594,0.00087880355,0.0005890773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011472922,0.00038748427,0.00051532633,0.0013146613,0.0013768341,0.0017934385,0.0009879369,0.0008507914,0.0065952246],"category_scores_gemma":[0.01204901,0.00040807,0.00026308402,0.0008958892,0.0012404101,0.003130934,0.0012903449,0.0013114249,0.00083831005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000909224,0.00011321336,0.00843505,0.00038585011,0.00007405846,0.0005112915,0.0009707392,0.0399178,0.010717088,0.842236,0.033250563,0.06247915],"study_design_scores_gemma":[0.00010562849,0.00011224413,0.0071025235,0.00017722101,0.00007734072,0.0011025674,0.00096992846,0.12914325,0.010279092,0.8221291,0.028744861,0.000056276556],"about_ca_topic_score_codex":0.0012765944,"about_ca_topic_score_gemma":0.0021819305,"teacher_disagreement_score":0.0065952246,"about_ca_system_score_codex":0.0011199105,"about_ca_system_score_gemma":0.0006790474,"threshold_uncertainty_score":0.022063196},"labels":[],"label_agreement":null},{"id":"W2405654472","doi":"","title":"Perfect r-Codes in Lexicographic Products of Graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Lexicographical order; Combinatorics; Discrete mathematics","score_opus":0.012559735036800681,"score_gpt":0.2298691556552674,"score_spread":0.2173094206184667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405654472","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3978149,0.0025348188,0.48925805,0.0022347695,0.00045927815,0.00015052065,0.0014024168,0.0009106656,0.10523462],"genre_scores_gemma":[0.8654081,0.0010007726,0.107650295,0.000547857,0.0002755585,0.00014405463,0.00076100754,0.00016623622,0.024046006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979298,0.000641049,0.00021769156,0.00037920434,0.00053717976,0.00029497576],"domain_scores_gemma":[0.9937397,0.0029304905,0.0010344788,0.0010824497,0.00077707606,0.00043566912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013495628,0.00036591463,0.0008425296,0.002253382,0.001607912,0.0036771372,0.00077495445,0.0010114055,0.00721564],"category_scores_gemma":[0.007698265,0.0005126172,0.0008421198,0.0019679142,0.0025711958,0.005049112,0.001961864,0.0011697776,0.0019627418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055034623,0.000016173468,0.000358175,0.000063800195,0.000016221138,0.00012578462,0.00022806256,0.001471528,0.0007784308,0.98317957,0.0017261006,0.0119811585],"study_design_scores_gemma":[0.00001163808,0.000019978414,0.00016528092,0.00002755599,0.000011991868,0.00018522222,0.0001204756,0.0042008474,0.00087554805,0.99058783,0.003775122,0.000018460245],"about_ca_topic_score_codex":0.00097191357,"about_ca_topic_score_gemma":0.0012042192,"teacher_disagreement_score":0.00721564,"about_ca_system_score_codex":0.0010879118,"about_ca_system_score_gemma":0.0008480925,"threshold_uncertainty_score":0.024138749},"labels":[],"label_agreement":null},{"id":"W2405659013","doi":"","title":"Independent sets in trees.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.015495804366295458,"score_gpt":0.2755330185237369,"score_spread":0.26003721415744147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405659013","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049510535,0.034414727,0.25696462,0.011483121,0.0030965125,0.00014265484,0.0025536097,0.0009241543,0.64091],"genre_scores_gemma":[0.65436435,0.02206998,0.116651736,0.0038593393,0.006113243,0.00044247354,0.004375578,0.00069426943,0.19142896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991605,0.00021819922,0.00004998649,0.00017654427,0.00028321217,0.00011145631],"domain_scores_gemma":[0.9980445,0.0011896006,0.00012746447,0.00024756382,0.00021343614,0.00017744921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007797015,0.0006370549,0.001088331,0.003144623,0.002139802,0.0032543037,0.0012251256,0.0013844998,0.016057601],"category_scores_gemma":[0.003149103,0.00078306335,0.0011254353,0.003445788,0.0023859593,0.00620942,0.0024326178,0.004343079,0.006028211],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016686348,0.000020073481,0.00018127196,0.000098000244,0.000014359409,0.000066108354,0.00022707299,0.0004973285,0.00029416804,0.9675974,0.013480061,0.017507536],"study_design_scores_gemma":[0.0000064999804,0.000004427912,0.00018947403,0.000026646918,0.000011721151,0.00015548742,0.00006175167,0.0012445246,0.00016620259,0.9763796,0.021748286,0.0000054686643],"about_ca_topic_score_codex":0.0011618675,"about_ca_topic_score_gemma":0.0018257891,"teacher_disagreement_score":0.016057601,"about_ca_system_score_codex":0.001506231,"about_ca_system_score_gemma":0.00069860974,"threshold_uncertainty_score":0.05371803},"labels":[],"label_agreement":null},{"id":"W2405660549","doi":"","title":"Graphs with fourth largest signless-Laplacian eigenvalue less than two.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Combinatorics; Physics","score_opus":0.024470155320361172,"score_gpt":0.26557758174876084,"score_spread":0.24110742642839966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405660549","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75057495,0.000945532,0.07073426,0.0040074354,0.0009199349,0.00010329393,0.0030105952,0.0020028532,0.16770126],"genre_scores_gemma":[0.9593321,0.0002606404,0.015457141,0.0005284076,0.00014198087,0.00006742466,0.0012339747,0.00017731993,0.022800881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968576,0.00007356977,0.000014988914,0.000060013717,0.00006828527,0.000097313365],"domain_scores_gemma":[0.9982327,0.0005551475,0.0003118333,0.0003107373,0.00030877194,0.0002807307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002621486,0.0005573813,0.00055139075,0.0015339624,0.0010848591,0.0013464919,0.0008633573,0.0010573725,0.015059629],"category_scores_gemma":[0.0029342666,0.00024418064,0.00033909822,0.0008124104,0.0010198142,0.0013406714,0.0011344586,0.0008642314,0.0024426186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077674136,0.00023258125,0.008063591,0.0006170515,0.00011753823,0.004015539,0.0005674827,0.0050079767,0.064338006,0.78299147,0.074837215,0.0584348],"study_design_scores_gemma":[0.000114073075,0.00009500616,0.00599966,0.00008020442,0.00007075937,0.0031526294,0.000588962,0.020539481,0.017249418,0.92576414,0.026272513,0.00007304472],"about_ca_topic_score_codex":0.00041520552,"about_ca_topic_score_gemma":0.0010097736,"teacher_disagreement_score":0.015059629,"about_ca_system_score_codex":0.00039066214,"about_ca_system_score_gemma":0.000481971,"threshold_uncertainty_score":0.050379455},"labels":[],"label_agreement":null},{"id":"W2405675654","doi":"","title":"Noncrossing partitions with fixed points having specific properties.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Fixed point; Combinatorics; Mathematical analysis","score_opus":0.02552286593011667,"score_gpt":0.1974335337472431,"score_spread":0.17191066781712644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405675654","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5228035,0.0012010123,0.28077918,0.00083583477,0.0005234375,0.00017235533,0.00072527875,0.00055725715,0.19240214],"genre_scores_gemma":[0.96300393,0.00042249018,0.019622076,0.00015721782,0.00013665495,0.00010682968,0.00048530914,0.00013351151,0.015931996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929714,0.00015146763,0.000034692435,0.0001673517,0.00019949063,0.00014978564],"domain_scores_gemma":[0.9976794,0.0010684031,0.00034421656,0.00040233054,0.00024897838,0.00025681933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005220148,0.00052534166,0.0005359006,0.0021245547,0.0022009967,0.0035984959,0.00097389496,0.0017432269,0.009570466],"category_scores_gemma":[0.004199232,0.00050824904,0.0006194445,0.001398561,0.0021157407,0.0022631213,0.0016929433,0.0017255405,0.0015466175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049048613,0.000030744606,0.0004569689,0.000039280447,0.000011697303,0.0003216446,0.00016748816,0.0016205604,0.0035161274,0.98699087,0.0013033241,0.0054923226],"study_design_scores_gemma":[0.0000347031,0.000039596744,0.0009503857,0.000052015443,0.000021358192,0.00108362,0.0003300799,0.013064254,0.003693312,0.9729812,0.007723064,0.000026520689],"about_ca_topic_score_codex":0.0005489322,"about_ca_topic_score_gemma":0.00093792885,"teacher_disagreement_score":0.009570466,"about_ca_system_score_codex":0.0008636555,"about_ca_system_score_gemma":0.00046447662,"threshold_uncertainty_score":0.032016456},"labels":[],"label_agreement":null},{"id":"W2405684560","doi":"","title":"Some lower bounds for constant weight codes.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Constant (computer programming); Computer science","score_opus":0.006075279834648352,"score_gpt":0.2026145908808941,"score_spread":0.19653931104624575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405684560","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05378827,0.058071177,0.46409407,0.01911977,0.0055102804,0.0003569007,0.0048852423,0.0022537927,0.3919205],"genre_scores_gemma":[0.6363166,0.04771998,0.18923719,0.009428511,0.0092471745,0.0019849478,0.006055161,0.0025254898,0.09748501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950199,0.0008917815,0.00017323821,0.0006286155,0.0020983706,0.0011880111],"domain_scores_gemma":[0.97140044,0.021685425,0.00088449655,0.002378608,0.0025355017,0.0011155426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043376284,0.004153387,0.0021310984,0.008722027,0.0036979215,0.009091354,0.0051219356,0.0034410132,0.030089883],"category_scores_gemma":[0.0385695,0.0013968094,0.0022116222,0.009516402,0.0043166755,0.010252695,0.00669981,0.010929743,0.009777998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004332162,0.0002372566,0.0008113292,0.00088330935,0.00012524071,0.00022462166,0.00047004363,0.018416772,0.0033114068,0.8260172,0.06345112,0.0856185],"study_design_scores_gemma":[0.000047278234,0.00007449964,0.00045836644,0.00038014914,0.00011916824,0.00031281283,0.00013677932,0.034972746,0.0025892432,0.9354266,0.025414133,0.00006831205],"about_ca_topic_score_codex":0.0037698469,"about_ca_topic_score_gemma":0.005725616,"teacher_disagreement_score":0.030089883,"about_ca_system_score_codex":0.007032463,"about_ca_system_score_gemma":0.0025990547,"threshold_uncertainty_score":0.10066068},"labels":[],"label_agreement":null},{"id":"W2405688950","doi":"","title":"The Harary index of digraphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Combinatorics; Computer science; World Wide Web","score_opus":0.03885242831579169,"score_gpt":0.2925452513961638,"score_spread":0.2536928230803721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405688950","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2643071,0.007992576,0.13289808,0.005148958,0.0017975853,0.000095090116,0.0029331176,0.00060089637,0.58422655],"genre_scores_gemma":[0.9299222,0.0031483392,0.02153371,0.0007859999,0.0010136771,0.0001056654,0.0009553054,0.00022707117,0.042308092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892753,0.00025452542,0.00008218864,0.00024098554,0.00029307348,0.00020169864],"domain_scores_gemma":[0.9964378,0.0015146161,0.0005404984,0.0004424877,0.00046942258,0.0005952694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087561127,0.0005980623,0.0010714128,0.0063186833,0.0027569483,0.0058844094,0.0011637111,0.0012966255,0.014207592],"category_scores_gemma":[0.006418477,0.00044980974,0.00061315775,0.003958168,0.0027663538,0.010358229,0.00308561,0.0025810343,0.0025369846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002761167,0.000012274147,0.00042102914,0.00004759399,0.000011425804,0.0000390785,0.00016290988,0.000316793,0.00036627118,0.98594207,0.0032999795,0.009353028],"study_design_scores_gemma":[0.000008091375,0.000011625165,0.0005350456,0.000037560578,0.000013432006,0.00015703765,0.00013437061,0.0018884736,0.00034281355,0.9859666,0.010892431,0.000012518443],"about_ca_topic_score_codex":0.0011088981,"about_ca_topic_score_gemma":0.0015399107,"teacher_disagreement_score":0.014207592,"about_ca_system_score_codex":0.0022442995,"about_ca_system_score_gemma":0.0006605419,"threshold_uncertainty_score":0.04752916},"labels":[],"label_agreement":null},{"id":"W2405693563","doi":"","title":"Graphs with complete minimal k-vertex separators.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chordal graph; Combinatorics; Mathematics; Vertex (graph theory); Maximal independent set; Separator (oil production); Clique-sum; Discrete mathematics; Indifference graph; Split graph; Graph; 1-planar graph; Physics","score_opus":0.021869780911674106,"score_gpt":0.27722341290001556,"score_spread":0.25535363198834143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405693563","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51979285,0.002931064,0.3170898,0.0022227732,0.0004999935,0.00028786788,0.0025243529,0.0006308424,0.15402038],"genre_scores_gemma":[0.9139543,0.00064086606,0.06461044,0.00043174505,0.00010883345,0.00011232494,0.0013207115,0.000079674086,0.018741166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997346,0.00004935009,0.000013862073,0.000069264235,0.000072311435,0.000060599148],"domain_scores_gemma":[0.9991748,0.0003104666,0.00016183843,0.00014069014,0.000114308634,0.00009778492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023652066,0.0003801829,0.00027403032,0.0005739376,0.0010604889,0.0007411276,0.00055913744,0.00047835155,0.002952815],"category_scores_gemma":[0.0016980408,0.00030769967,0.0005149547,0.0006753229,0.00085225195,0.0016327066,0.0011885552,0.00090921886,0.0007117942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021456079,0.000030793046,0.001170509,0.00022442696,0.0000617611,0.00045280918,0.0005231666,0.006553909,0.009981392,0.93928957,0.00706597,0.034431234],"study_design_scores_gemma":[0.000033904627,0.000041427233,0.0009511699,0.000032129075,0.000028490773,0.00044954667,0.00013578702,0.006959446,0.0034293164,0.9606821,0.02723826,0.000018475248],"about_ca_topic_score_codex":0.0006914858,"about_ca_topic_score_gemma":0.001118955,"teacher_disagreement_score":0.002952815,"about_ca_system_score_codex":0.00065462204,"about_ca_system_score_gemma":0.0004909643,"threshold_uncertainty_score":0.009878159},"labels":[],"label_agreement":null},{"id":"W2405695800","doi":"","title":"The Induced Matching Extendability of C 2n (1, k).","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Matching (statistics); Statistics","score_opus":0.009758420077197174,"score_gpt":0.25530096853625955,"score_spread":0.24554254845906237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405695800","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46399873,0.00075589685,0.17528678,0.001980141,0.0004893449,0.0001422716,0.0020646602,0.0010268722,0.35425535],"genre_scores_gemma":[0.9426197,0.0003065263,0.016267048,0.000445765,0.00017254852,0.000116593284,0.0010050092,0.00024198004,0.038824808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889463,0.00017380387,0.000062901505,0.00033020767,0.0002661334,0.0002723604],"domain_scores_gemma":[0.99832803,0.0005480568,0.00023445887,0.0003688322,0.00021040584,0.0003102801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070776884,0.0004323977,0.00041560212,0.001134034,0.0012777317,0.0023615516,0.0009411635,0.00069712166,0.016954048],"category_scores_gemma":[0.0034225543,0.0002704325,0.000563363,0.0010872455,0.0014968992,0.0037962873,0.0027058008,0.0014614104,0.0022451764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013400789,0.000046502817,0.0005805725,0.00008420412,0.000014286488,0.00017802548,0.00020165871,0.0013257967,0.0026925346,0.972259,0.005069867,0.01741362],"study_design_scores_gemma":[0.000030654744,0.000029028784,0.0010432961,0.000027723641,0.000017452527,0.0003614491,0.00007096866,0.0041957935,0.0025760813,0.9747525,0.016868155,0.000026869548],"about_ca_topic_score_codex":0.0012197259,"about_ca_topic_score_gemma":0.0011635693,"teacher_disagreement_score":0.016954048,"about_ca_system_score_codex":0.0011245366,"about_ca_system_score_gemma":0.00062344805,"threshold_uncertainty_score":0.05671692},"labels":[],"label_agreement":null},{"id":"W2405709304","doi":"","title":"Super edge-magic total labeling of subdivided stars","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"MAGIC (telescope); Stars; Combinatorics; Mathematics; Graph; Enhanced Data Rates for GSM Evolution; Integer (computer science); Physics; Astrophysics; Computer science; Artificial intelligence","score_opus":0.02445440731796151,"score_gpt":0.23909247914728635,"score_spread":0.21463807182932484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405709304","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5302051,0.00053793873,0.42062804,0.0004204894,0.00007017406,0.000056610854,0.00041584266,0.0002452368,0.04742067],"genre_scores_gemma":[0.87566173,0.00032503018,0.11150244,0.00014204772,0.000059931437,0.000064895896,0.0005566768,0.00007743695,0.011609768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997068,0.0000692596,0.000017237104,0.00008185477,0.0000636224,0.000061170365],"domain_scores_gemma":[0.99951303,0.00014597364,0.000065963286,0.000114166665,0.00008576291,0.00007499402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000309654,0.0002218568,0.0002840913,0.0005262591,0.00062105147,0.0007998854,0.0005378895,0.00035568676,0.0028297782],"category_scores_gemma":[0.0007663475,0.0002001993,0.00037524267,0.00071564905,0.000825118,0.0014111781,0.0008710291,0.0005617108,0.00027295706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011295328,0.000024654457,0.0013208927,0.00010376906,0.000010907627,0.00008211862,0.00036762355,0.020901391,0.008026861,0.93891066,0.0023697594,0.0277684],"study_design_scores_gemma":[0.000026789834,0.00010051041,0.0013182821,0.00003228153,0.000027878172,0.00030201516,0.00032737947,0.12742297,0.006019122,0.8409141,0.023488827,0.000019836154],"about_ca_topic_score_codex":0.0011364548,"about_ca_topic_score_gemma":0.0018784004,"teacher_disagreement_score":0.0028297782,"about_ca_system_score_codex":0.0008105278,"about_ca_system_score_gemma":0.00037425078,"threshold_uncertainty_score":0.0094665885},"labels":[],"label_agreement":null},{"id":"W2405720617","doi":"","title":"Some results on neighbourhood highly irregular graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Neighbourhood (mathematics); Mathematical analysis","score_opus":0.020585298826413335,"score_gpt":0.21466408654415936,"score_spread":0.19407878771774603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405720617","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17448975,0.0123233525,0.24042118,0.012669415,0.0015265786,0.00015799809,0.0026108266,0.0011669312,0.55463403],"genre_scores_gemma":[0.7968418,0.010937568,0.08253049,0.0037394585,0.002421919,0.0003377776,0.0043767085,0.0008304398,0.09798381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992238,0.00020068936,0.000040732022,0.00017287921,0.00024062338,0.00012126033],"domain_scores_gemma":[0.99476504,0.003258293,0.00041852676,0.0006983436,0.00033671048,0.0005231041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009892045,0.0006955811,0.00095368526,0.0026387626,0.0024215828,0.0031858315,0.0015179436,0.0015245983,0.016098652],"category_scores_gemma":[0.0063027125,0.0006206861,0.0009200033,0.0038594313,0.0027730362,0.0058224597,0.0028070027,0.0035176221,0.0028999434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062874125,0.000055558066,0.0007976779,0.00029475772,0.000018705168,0.00015477899,0.0002708377,0.0039403634,0.00086561724,0.95540375,0.018991053,0.019144047],"study_design_scores_gemma":[0.000015123798,0.000017621649,0.0005256803,0.000045462937,0.000019031755,0.00026015993,0.00018200757,0.006771404,0.0005261455,0.9693944,0.022229873,0.000013081842],"about_ca_topic_score_codex":0.0015687458,"about_ca_topic_score_gemma":0.0022617853,"teacher_disagreement_score":0.016098652,"about_ca_system_score_codex":0.0018801464,"about_ca_system_score_gemma":0.0005111714,"threshold_uncertainty_score":0.05385536},"labels":[],"label_agreement":null},{"id":"W2405742734","doi":"","title":"A kind of conditional vertex connectivity of recursive circulants.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Graph","score_opus":0.057658729856271594,"score_gpt":0.31222086328666004,"score_spread":0.25456213343038847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405742734","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.357013,0.0013649131,0.3525034,0.0018445975,0.0007546605,0.00013811384,0.0017367831,0.001380636,0.2832639],"genre_scores_gemma":[0.9538141,0.00043076594,0.029528666,0.0005503139,0.0003598134,0.000078375124,0.0006939233,0.00026052416,0.0142835025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993992,0.00013597918,0.000021025859,0.00017451134,0.00015079323,0.00011848162],"domain_scores_gemma":[0.99672925,0.0013816436,0.0004190779,0.00055954244,0.0005031002,0.00040737208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037601189,0.00030316296,0.00042112864,0.0016102078,0.00151947,0.002208621,0.00087021734,0.0011924664,0.010079233],"category_scores_gemma":[0.006057364,0.00036568672,0.0004548845,0.0012586921,0.0021248672,0.0025241335,0.0012161464,0.0016879564,0.0010922664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011869687,0.0000063572047,0.00022955229,0.000024713889,0.000003570574,0.00008626488,0.00009187579,0.0003918559,0.0009846269,0.9927533,0.0018655797,0.003550327],"study_design_scores_gemma":[0.000015474432,0.000017860306,0.0007813358,0.000032170974,0.000015109266,0.00051781797,0.00009785787,0.009315685,0.001027117,0.9775939,0.010566882,0.000018869066],"about_ca_topic_score_codex":0.0014416223,"about_ca_topic_score_gemma":0.002062087,"teacher_disagreement_score":0.010079233,"about_ca_system_score_codex":0.00082063634,"about_ca_system_score_gemma":0.0004480375,"threshold_uncertainty_score":0.033718407},"labels":[],"label_agreement":null},{"id":"W2405745185","doi":"","title":"A self-orthogonal doubly-even code invariant under M c L.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Invariant (physics); Combinatorics; Pure mathematics; Mathematical physics","score_opus":0.01297457008147015,"score_gpt":0.23292094683837236,"score_spread":0.2199463767569022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405745185","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7689699,0.00051938486,0.083076745,0.0018652548,0.0007352877,0.00009128929,0.0012291523,0.00084136985,0.1426716],"genre_scores_gemma":[0.9793128,0.000102753,0.0072024018,0.0003059224,0.00011077768,0.000029867688,0.00030480095,0.000065886714,0.012564817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995797,0.00005182255,0.000017422746,0.000079079124,0.0001302748,0.00014178343],"domain_scores_gemma":[0.99910873,0.00020215756,0.0001996934,0.00017766588,0.00014238383,0.00016935947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023373569,0.0002772559,0.0002591187,0.0007843482,0.00096539897,0.001252162,0.00037965682,0.00080136163,0.004191851],"category_scores_gemma":[0.001195868,0.00014319363,0.00029698142,0.00045547044,0.0009966603,0.0008504458,0.0014808289,0.00074040226,0.0011146915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004109356,0.00011085261,0.0019075547,0.000084828775,0.000020790721,0.0015432949,0.00040728608,0.002286075,0.025823569,0.92723185,0.009078729,0.031094247],"study_design_scores_gemma":[0.00017785252,0.00025592255,0.0036986484,0.000097533055,0.000052859814,0.002833327,0.00032587114,0.037257534,0.039469287,0.87948567,0.03621554,0.00012990902],"about_ca_topic_score_codex":0.00066339504,"about_ca_topic_score_gemma":0.0005700296,"teacher_disagreement_score":0.004191851,"about_ca_system_score_codex":0.000511284,"about_ca_system_score_gemma":0.00087595,"threshold_uncertainty_score":0.014023125},"labels":[],"label_agreement":null},{"id":"W2405749931","doi":"","title":"Recognizing Tenacious Graphs Is NP-Hard.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.014142947458738002,"score_gpt":0.21921614121325944,"score_spread":0.20507319375452143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405749931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30616966,0.0022959644,0.56200314,0.013397344,0.000817763,0.00038672512,0.009481022,0.0055763694,0.09987197],"genre_scores_gemma":[0.7623529,0.001015728,0.19969392,0.0015487302,0.0002892417,0.00022692156,0.010233143,0.00073603267,0.023903314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835336,0.00033236318,0.000121400364,0.00063460605,0.0003098388,0.00024853024],"domain_scores_gemma":[0.98972255,0.0073701623,0.00060771866,0.0013373471,0.00055773783,0.0004045165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088867755,0.00087033754,0.0011307902,0.0014986085,0.002408867,0.0047528287,0.002047363,0.0021423255,0.010456625],"category_scores_gemma":[0.0077142073,0.00083148427,0.0015985516,0.002490867,0.0021706645,0.008153175,0.0026052215,0.003959732,0.0023350948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042711748,0.0004680324,0.007924597,0.001151522,0.00016984472,0.0006875111,0.0011168638,0.036554817,0.006697161,0.6590148,0.09152014,0.1942676],"study_design_scores_gemma":[0.000024169596,0.000020582978,0.0008271025,0.000066399654,0.000036212517,0.00040092034,0.0005644805,0.057783734,0.0029011818,0.9201913,0.017152825,0.00003101899],"about_ca_topic_score_codex":0.0041423356,"about_ca_topic_score_gemma":0.008113004,"teacher_disagreement_score":0.010456625,"about_ca_system_score_codex":0.0016872165,"about_ca_system_score_gemma":0.0013261972,"threshold_uncertainty_score":0.034980893},"labels":[],"label_agreement":null},{"id":"W2405750571","doi":"","title":"On pairs of graphs having n-2 cards in common.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Arithmetic; Discrete mathematics","score_opus":0.0055266059417526745,"score_gpt":0.1902429468726312,"score_spread":0.18471634093087855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405750571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37072852,0.0015447545,0.40075666,0.0036103867,0.00076809915,0.00029912795,0.0017421116,0.000569675,0.2199807],"genre_scores_gemma":[0.8436399,0.001241737,0.09874311,0.001141758,0.00041895054,0.00027317693,0.0017305388,0.00027042156,0.05254032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972861,0.0010148634,0.00012490529,0.00059281854,0.00042010113,0.00056114566],"domain_scores_gemma":[0.9934075,0.0033477927,0.0011243214,0.0009934925,0.0005087091,0.0006181376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011190787,0.00089230685,0.00091720687,0.0036917373,0.003425822,0.0039779316,0.0014287226,0.0022351013,0.0146243945],"category_scores_gemma":[0.0071313516,0.0008389042,0.0010856558,0.0027526019,0.0026751996,0.008743686,0.0044149226,0.0018893749,0.0024505253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015943008,0.00007584858,0.000970954,0.00013309963,0.000043636002,0.0005498251,0.0004321992,0.0047927154,0.0016412999,0.97130144,0.0053462293,0.014553251],"study_design_scores_gemma":[0.0000249848,0.000027380365,0.0005349419,0.00008347152,0.000028186323,0.0004906812,0.0003978859,0.015340088,0.0012493151,0.97208947,0.009706007,0.000027711465],"about_ca_topic_score_codex":0.0017801515,"about_ca_topic_score_gemma":0.0027661,"teacher_disagreement_score":0.0146243945,"about_ca_system_score_codex":0.0017309124,"about_ca_system_score_gemma":0.0008296639,"threshold_uncertainty_score":0.048923433},"labels":[],"label_agreement":null},{"id":"W2405759364","doi":"","title":"Generalized Lucas' Theorem.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Lucas number; Pure mathematics; Discrete mathematics; Fibonacci number","score_opus":0.018734953940525472,"score_gpt":0.2816531314021061,"score_spread":0.26291817746158064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405759364","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0189242,0.008770621,0.050283395,0.008914323,0.0019459465,0.000033470653,0.0012311664,0.000495089,0.90940183],"genre_scores_gemma":[0.57000166,0.007815768,0.04086877,0.0038245767,0.0021478538,0.00016107765,0.0013822074,0.0004288589,0.37336916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964404,0.00006992842,0.000014240299,0.00008633872,0.00013599357,0.000049581664],"domain_scores_gemma":[0.999684,0.00008729247,0.000035790268,0.00006181976,0.00009574777,0.000035540004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003851176,0.0007501749,0.0005983565,0.0016435018,0.0013349163,0.0022584337,0.000717999,0.0009925365,0.025877677],"category_scores_gemma":[0.0013821583,0.00029206203,0.00063085795,0.0011416494,0.0018801973,0.004070575,0.001799297,0.0021794382,0.006448246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008330434,0.0000029228609,0.0000408418,0.000034173285,0.000004070696,0.000025640538,0.000058320737,0.00006997327,0.00014267088,0.98264945,0.010063259,0.0069002453],"study_design_scores_gemma":[0.000007942543,0.0000039665156,0.00020243743,0.00001807948,0.0000070636715,0.00009755665,0.00004517063,0.00034044575,0.00015899818,0.9373598,0.061753538,0.000005041025],"about_ca_topic_score_codex":0.0013483474,"about_ca_topic_score_gemma":0.002096254,"teacher_disagreement_score":0.025877677,"about_ca_system_score_codex":0.001445225,"about_ca_system_score_gemma":0.0006102011,"threshold_uncertainty_score":0.08656949},"labels":[],"label_agreement":null},{"id":"W2405767764","doi":"","title":"On the lexicographical ordering by spectral moments of bicyclic graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Lexicographical order; Mathematics; Combinatorics","score_opus":0.017958184928951345,"score_gpt":0.2663089914562024,"score_spread":0.24835080652725106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405767764","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51379126,0.005689998,0.24637574,0.004093028,0.0009697695,0.000090425565,0.0011216989,0.0007404158,0.22712766],"genre_scores_gemma":[0.95008755,0.0019753615,0.027783714,0.0008158198,0.0006740451,0.00007607907,0.00052432215,0.00025916996,0.017804043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994104,0.00019047948,0.000025380772,0.000089149326,0.00014041098,0.00014415215],"domain_scores_gemma":[0.996986,0.0016544444,0.0003985768,0.00031290174,0.0002981487,0.00034988803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057100074,0.00051164866,0.0007420315,0.0025172206,0.0012689172,0.002319345,0.0009173908,0.001027568,0.009686756],"category_scores_gemma":[0.0053318664,0.00049766724,0.00043480084,0.0020675852,0.002459337,0.0034324,0.0014839513,0.0017092549,0.0015717474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053932843,0.00002194617,0.00031658215,0.000052273357,0.0000056194112,0.00007303602,0.00016730314,0.0017667009,0.0011274534,0.98317105,0.00360324,0.009640921],"study_design_scores_gemma":[0.000010892972,0.000014675749,0.00029987431,0.000027424077,0.000005454561,0.0001219588,0.00009380819,0.0077243224,0.0004514301,0.98802954,0.0032064444,0.000014205367],"about_ca_topic_score_codex":0.0012651242,"about_ca_topic_score_gemma":0.0022660529,"teacher_disagreement_score":0.009686756,"about_ca_system_score_codex":0.0010696959,"about_ca_system_score_gemma":0.00053461106,"threshold_uncertainty_score":0.032405496},"labels":[],"label_agreement":null},{"id":"W2405774642","doi":"","title":"q-Analogues Of Two Families Of Terminating 2 F 1 (2)-Series Identities.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Geometry","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Normalization property; Mathematics; Series (stratigraphy); Combinatorics; Computer science; Programming language","score_opus":0.027209410294448122,"score_gpt":0.31355129448232566,"score_spread":0.28634188418787754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405774642","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28562006,0.0013490809,0.18282886,0.0017156098,0.0027977475,0.00015426564,0.00050505233,0.0005045931,0.52452475],"genre_scores_gemma":[0.8722637,0.00049172895,0.034608148,0.0010099736,0.00064758817,0.0001341641,0.00037115702,0.00024633715,0.090227254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992028,0.00017559076,0.000038816608,0.00014774413,0.00021442772,0.00022066127],"domain_scores_gemma":[0.99910164,0.00022660631,0.00013170128,0.00013156509,0.00021357462,0.00019495416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009278741,0.000542748,0.00059378,0.001552082,0.0021196513,0.0026317453,0.00094047823,0.0015330826,0.0133218635],"category_scores_gemma":[0.002966406,0.00038914746,0.0009107461,0.00092431245,0.0023267493,0.003095172,0.0018568176,0.0026698222,0.0021161493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044452627,0.000021687447,0.00012978436,0.000019312038,0.000003849159,0.0002752859,0.00024711958,0.00012328889,0.00088636554,0.9923602,0.0014954387,0.004393294],"study_design_scores_gemma":[0.00005491783,0.00004645816,0.0006246566,0.000037828475,0.000012580428,0.00096741045,0.00022024168,0.0020884373,0.0018112372,0.9706679,0.023438653,0.000029750752],"about_ca_topic_score_codex":0.00072953955,"about_ca_topic_score_gemma":0.0008731335,"teacher_disagreement_score":0.0133218635,"about_ca_system_score_codex":0.0011317995,"about_ca_system_score_gemma":0.000627374,"threshold_uncertainty_score":0.044566095},"labels":[],"label_agreement":null},{"id":"W2405774736","doi":"","title":"The digraphs from finite fields.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Finite field; Pure mathematics; Combinatorics","score_opus":0.017489910646369483,"score_gpt":0.20540920711880778,"score_spread":0.1879192964724383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405774736","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10874925,0.015770528,0.3551097,0.014411819,0.001722643,0.00017624383,0.0043692067,0.0009286884,0.49876198],"genre_scores_gemma":[0.7920356,0.010590785,0.06342013,0.0029868635,0.0013254941,0.00030137107,0.0030247301,0.0003657239,0.12594925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993849,0.00020124306,0.0000436003,0.00013940908,0.00013137025,0.00009941318],"domain_scores_gemma":[0.99809116,0.0010230228,0.00017036586,0.00033228096,0.00018561666,0.00019756398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006223667,0.0005909867,0.00066513,0.0027374574,0.002096237,0.003493891,0.0008192612,0.001225331,0.014592825],"category_scores_gemma":[0.003736714,0.0005295756,0.00057196297,0.00220731,0.0023486107,0.008488229,0.0026827394,0.0028340816,0.0034216582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009692863,0.0000063753005,0.0000504739,0.000033179436,0.0000029804105,0.000034973316,0.000071132716,0.00026356595,0.00011811006,0.9904522,0.002851305,0.0061059706],"study_design_scores_gemma":[0.000004686826,0.000003388958,0.000051827723,0.000021219928,0.0000027454278,0.00007502226,0.000026681755,0.0006225466,0.000110934845,0.98593485,0.013141577,0.000004562921],"about_ca_topic_score_codex":0.0011062435,"about_ca_topic_score_gemma":0.0013201087,"teacher_disagreement_score":0.014592825,"about_ca_system_score_codex":0.0016630889,"about_ca_system_score_gemma":0.00096080545,"threshold_uncertainty_score":0.048817873},"labels":[],"label_agreement":null},{"id":"W2405803305","doi":"","title":"(a, d)-Edge-Antimagic Total Labelings Of Cycle.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Artificial intelligence; Computer science","score_opus":0.01656134205944651,"score_gpt":0.21529835908835226,"score_spread":0.19873701702890575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405803305","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39747423,0.0017177614,0.3260641,0.0025185272,0.00039554373,0.00023061203,0.0060242573,0.0015057763,0.26406923],"genre_scores_gemma":[0.79569846,0.0009224546,0.14890842,0.0008662148,0.00014593486,0.00026056872,0.0044462825,0.0004033741,0.048348166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993242,0.00018770467,0.000054263794,0.00017795179,0.00012288238,0.00013286626],"domain_scores_gemma":[0.99757403,0.0010093391,0.00021743121,0.00055532454,0.0003324932,0.0003114187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005699701,0.00048638173,0.0005570467,0.0014180419,0.0018431162,0.0030917064,0.0010938685,0.0012913198,0.012770784],"category_scores_gemma":[0.0032736047,0.0004899503,0.0007617456,0.0019917693,0.001139338,0.0032395334,0.0019340318,0.0014169147,0.0018739688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016845502,0.000051132753,0.00087426626,0.00019489108,0.000030696552,0.00010097134,0.00026384182,0.003577661,0.0034289923,0.94614303,0.013869155,0.031296916],"study_design_scores_gemma":[0.000036890484,0.00003680288,0.00068631343,0.000051940537,0.00004069343,0.00027958333,0.00019949731,0.012743547,0.0024648872,0.96083516,0.022604601,0.000020063704],"about_ca_topic_score_codex":0.0017281413,"about_ca_topic_score_gemma":0.002877259,"teacher_disagreement_score":0.012770784,"about_ca_system_score_codex":0.0014638884,"about_ca_system_score_gemma":0.0007040654,"threshold_uncertainty_score":0.042722464},"labels":[],"label_agreement":null},{"id":"W2405826658","doi":"","title":"Flag-transitive 2-(v, k, 4) symmetric designs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Flag (linear algebra); Mathematics; Transitive relation; Combinatorics; Pure mathematics; Algebra over a field","score_opus":0.007775203233054368,"score_gpt":0.19661416787257907,"score_spread":0.1888389646395247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405826658","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37930277,0.00065955496,0.34654033,0.0008865313,0.0007711571,0.00026088627,0.0017271305,0.0013750403,0.26847658],"genre_scores_gemma":[0.92215115,0.00019532997,0.041175906,0.000295936,0.00006138563,0.000110037436,0.00052057125,0.00011211638,0.035377536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891114,0.00034437902,0.000074112504,0.00015110834,0.00022782628,0.00029149157],"domain_scores_gemma":[0.99844223,0.00036476433,0.00028275014,0.00043754294,0.0003069976,0.00016574173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077796326,0.0004349279,0.000372767,0.0009984951,0.0011600284,0.0021193074,0.00074757193,0.0008563408,0.014842013],"category_scores_gemma":[0.0024982626,0.00031930435,0.00044425775,0.00073518255,0.0008678991,0.0017484657,0.0011193975,0.0005484134,0.003335691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029513222,0.00006973438,0.00081692555,0.00011175662,0.000027165694,0.0003365681,0.00024631084,0.0030902775,0.008080128,0.9454861,0.0070632636,0.034376647],"study_design_scores_gemma":[0.00011688443,0.00024545807,0.0008388187,0.000095818075,0.000047251033,0.00075937656,0.00032635144,0.021733288,0.011361915,0.92568207,0.038728204,0.000064557775],"about_ca_topic_score_codex":0.0008481175,"about_ca_topic_score_gemma":0.0022500171,"teacher_disagreement_score":0.014842013,"about_ca_system_score_codex":0.00091113104,"about_ca_system_score_gemma":0.0008864876,"threshold_uncertainty_score":0.049651444},"labels":[],"label_agreement":null},{"id":"W2405828630","doi":"","title":"On the Hosoya index of unicyclic graphs with a new given diameter.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Index (typography); Computer science; World Wide Web","score_opus":0.018651515790496523,"score_gpt":0.2531056592473146,"score_spread":0.2344541434568181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405828630","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74389106,0.0048539806,0.078924,0.0022112005,0.0008365047,0.00006092225,0.00084734766,0.00037911744,0.16799593],"genre_scores_gemma":[0.9818232,0.0010583231,0.010000765,0.00016634943,0.0005008785,0.000050382456,0.00020314511,0.00010395873,0.0060930606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939036,0.0001309928,0.000032907206,0.00013756864,0.00016453667,0.00014369933],"domain_scores_gemma":[0.9965055,0.0017476534,0.0005207396,0.00027314964,0.00030918335,0.0006437119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081714714,0.00045379283,0.0009600473,0.0030312166,0.0014553734,0.002717548,0.0013628919,0.0011850118,0.004924856],"category_scores_gemma":[0.006409169,0.00030585064,0.00036740315,0.002182648,0.002558109,0.004666179,0.0018628228,0.0016833183,0.0005921718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020352185,0.000035561745,0.0015253939,0.00010868213,0.000015859452,0.00010318472,0.00038947002,0.0036370556,0.0031227332,0.97526723,0.0040096515,0.011581632],"study_design_scores_gemma":[0.000044261567,0.00006221212,0.002704417,0.000072968585,0.000047249297,0.00041071165,0.00048560454,0.030253265,0.00230998,0.95363605,0.009923973,0.000049345574],"about_ca_topic_score_codex":0.0011500272,"about_ca_topic_score_gemma":0.0015319926,"teacher_disagreement_score":0.004924856,"about_ca_system_score_codex":0.0019491081,"about_ca_system_score_gemma":0.0005235935,"threshold_uncertainty_score":0.01647532},"labels":[],"label_agreement":null},{"id":"W2405869798","doi":"","title":"Pebbling number of Bi-wheel: A diameter three class 0 graph.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Class (philosophy); Graph; Combinatorics; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.0289685387406294,"score_gpt":0.2502724503530625,"score_spread":0.2213039116124331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405869798","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70608324,0.00061555597,0.13300356,0.0015114945,0.00044377087,0.00012271621,0.0017195694,0.0009781976,0.15552193],"genre_scores_gemma":[0.9065963,0.00031913535,0.046848122,0.00025654095,0.00007089997,0.00007348031,0.0018262076,0.0003000847,0.043709144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99980956,0.000030407957,0.0000083699515,0.0000513801,0.000040995954,0.00005931566],"domain_scores_gemma":[0.99919444,0.00028113383,0.00007704624,0.00010377489,0.000122022866,0.00022155918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019409745,0.00036240535,0.00041629997,0.00097059173,0.0019033181,0.0013669039,0.001034176,0.0009981304,0.01872128],"category_scores_gemma":[0.0011795919,0.00025838945,0.00048529828,0.0006500141,0.0009458966,0.0012771842,0.00079002255,0.0010811718,0.0022279052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045905035,0.00018170032,0.0031163117,0.0003186967,0.00003308144,0.00070574915,0.00056744355,0.013385494,0.021014506,0.8731541,0.030210186,0.056853637],"study_design_scores_gemma":[0.000108341475,0.00017830067,0.006198662,0.00012333825,0.00009725421,0.001265577,0.00087009295,0.09444985,0.017725749,0.80967015,0.06922205,0.00009068176],"about_ca_topic_score_codex":0.0039596683,"about_ca_topic_score_gemma":0.0053689512,"teacher_disagreement_score":0.01872128,"about_ca_system_score_codex":0.0009881919,"about_ca_system_score_gemma":0.0006235838,"threshold_uncertainty_score":0.062628925},"labels":[],"label_agreement":null},{"id":"W2405879761","doi":"","title":"A note on the graphs with given small matching number.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Matching (statistics); Combinatorics; Statistics","score_opus":0.029044962929171775,"score_gpt":0.2824514324751962,"score_spread":0.2534064695460244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405879761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06848321,0.033699367,0.43035492,0.045106225,0.02501509,0.00021227235,0.0015323593,0.0019280444,0.39366847],"genre_scores_gemma":[0.6591201,0.02311542,0.21491157,0.009750521,0.014424718,0.00032824633,0.0011560884,0.000940225,0.07625314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992483,0.00025161545,0.000036995778,0.00023454949,0.00016436899,0.00006404324],"domain_scores_gemma":[0.9956098,0.0025985916,0.00023089815,0.00077772693,0.00046180026,0.00032122462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012683705,0.0006377061,0.00090098946,0.0014251216,0.0016667815,0.0014668766,0.001788518,0.0012768717,0.010103517],"category_scores_gemma":[0.009431753,0.0003036411,0.0007444357,0.001736225,0.002143543,0.005313304,0.0020432023,0.0035258252,0.0018803566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014973273,0.000040083873,0.00058759813,0.00055282394,0.00003388563,0.00055094284,0.00018638663,0.002739586,0.0033760015,0.8947076,0.052050494,0.045024686],"study_design_scores_gemma":[0.000012611517,0.00003566449,0.0006682939,0.000058341877,0.000029128141,0.00060730556,0.00008296924,0.0045002694,0.0009387339,0.9407569,0.05228714,0.000022700102],"about_ca_topic_score_codex":0.00095657277,"about_ca_topic_score_gemma":0.0014142246,"teacher_disagreement_score":0.010103517,"about_ca_system_score_codex":0.0010499576,"about_ca_system_score_gemma":0.0005987073,"threshold_uncertainty_score":0.03379965},"labels":[],"label_agreement":null},{"id":"W2405972438","doi":"","title":"The List Point Arboricity of Some Complete Multi-partite Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arboricity; Mathematics; Point (geometry); Combinatorics; Graph; Geometry; Planar graph","score_opus":0.024149819981733815,"score_gpt":0.24352770042509123,"score_spread":0.2193778804433574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405972438","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7992554,0.0007457935,0.07106658,0.0021013848,0.000088836496,0.000075921635,0.0025592793,0.000333453,0.12377342],"genre_scores_gemma":[0.96580285,0.00045506767,0.017180996,0.00021180157,0.00009416788,0.0000730792,0.0015750035,0.0000803315,0.014526657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999699,0.000092300994,0.00001560437,0.00006944511,0.000058777216,0.00006492254],"domain_scores_gemma":[0.99779546,0.0013509223,0.00029180732,0.00020359314,0.00016322981,0.00019510654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002919913,0.00028054244,0.00034956654,0.0011725572,0.001386388,0.0019891663,0.0006131104,0.00080793386,0.0088264225],"category_scores_gemma":[0.002222011,0.0003425799,0.00042872122,0.0012654345,0.0010237006,0.002423911,0.00088271906,0.0012500748,0.000829166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023134224,0.00006502856,0.0025917948,0.00021181672,0.000031443178,0.00040476836,0.00064485933,0.009199662,0.0053680553,0.946393,0.011294937,0.023563368],"study_design_scores_gemma":[0.00005675639,0.000058948113,0.002950774,0.000060849852,0.00005510259,0.0005598853,0.0006184695,0.035132825,0.004304989,0.942258,0.013917112,0.000026355787],"about_ca_topic_score_codex":0.0010737072,"about_ca_topic_score_gemma":0.0017705255,"teacher_disagreement_score":0.0088264225,"about_ca_system_score_codex":0.00074213755,"about_ca_system_score_gemma":0.00028363205,"threshold_uncertainty_score":0.029527366},"labels":[],"label_agreement":null},{"id":"W2405974128","doi":"","title":"Extraconnectivity of Cartesian product graphs of paths.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Mathematics; Product (mathematics); Cartesian coordinate system; Combinatorics; Geometry","score_opus":0.006517413491374454,"score_gpt":0.21628948675238846,"score_spread":0.20977207326101402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405974128","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6800164,0.0018031687,0.17724375,0.0011141476,0.00017381029,0.00011737397,0.0014453728,0.0005286462,0.13755727],"genre_scores_gemma":[0.9336815,0.0009919786,0.04246486,0.00025177057,0.00011251472,0.00009148071,0.0019447799,0.00018477919,0.02027642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892515,0.00031555726,0.000059841746,0.00026323288,0.00028482353,0.00015135435],"domain_scores_gemma":[0.99453765,0.003089699,0.0005855772,0.0006709403,0.00070859137,0.0004075197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006284746,0.00040090733,0.0004826008,0.0019093488,0.0015089659,0.0019450763,0.0007075604,0.00056909095,0.0094574625],"category_scores_gemma":[0.005122458,0.00056738325,0.0004645185,0.0021704682,0.0018637807,0.0037713174,0.0024840247,0.0013532548,0.00089951756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018081063,0.00006192492,0.004060735,0.00022608077,0.000036004898,0.0004899632,0.0014703145,0.002350831,0.0032879096,0.9386544,0.005129203,0.04405184],"study_design_scores_gemma":[0.00002658151,0.00006087331,0.004053384,0.000078324425,0.00008072829,0.0013540793,0.0008717812,0.009442902,0.0038695056,0.9572262,0.02291033,0.000025347617],"about_ca_topic_score_codex":0.0019950867,"about_ca_topic_score_gemma":0.0027435394,"teacher_disagreement_score":0.0094574625,"about_ca_system_score_codex":0.00054269604,"about_ca_system_score_gemma":0.0004071925,"threshold_uncertainty_score":0.031638384},"labels":[],"label_agreement":null},{"id":"W2405993510","doi":"","title":"Randomly r-Orthogonal (0, f)-Factorizations of Bipartite (0, mf-(m-1)r)-Graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Discrete mathematics; Graph","score_opus":0.004848225536207917,"score_gpt":0.19210333891340617,"score_spread":0.18725511337719825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405993510","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7014199,0.00043891737,0.24892363,0.0014908817,0.00025086247,0.00032800724,0.0029780546,0.0007496774,0.04342007],"genre_scores_gemma":[0.9363454,0.00014537542,0.04818006,0.00038551213,0.00009036694,0.00016136588,0.0013274464,0.00013896912,0.013225473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980763,0.0007757136,0.00007606502,0.00030144778,0.00032180216,0.0004486888],"domain_scores_gemma":[0.99580574,0.0017174885,0.00056857074,0.0009552046,0.00046352492,0.00048934325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010802236,0.00055521843,0.000451483,0.0010069823,0.0011185565,0.0010129112,0.00066605833,0.00094647496,0.011021172],"category_scores_gemma":[0.008003036,0.00039169026,0.00054681563,0.0006338113,0.0012656153,0.0017407833,0.0016434642,0.00082481105,0.0017835159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0038219101,0.00053482444,0.0073868833,0.00041198445,0.00017210547,0.0008322973,0.0007431643,0.048705403,0.06391135,0.76486814,0.037976388,0.07063556],"study_design_scores_gemma":[0.00045797654,0.00051480345,0.0056923092,0.00013821742,0.00009606216,0.0013507584,0.00084402843,0.23794416,0.020893127,0.71809745,0.013822178,0.00014896913],"about_ca_topic_score_codex":0.0012036958,"about_ca_topic_score_gemma":0.003019993,"teacher_disagreement_score":0.011021172,"about_ca_system_score_codex":0.0008103835,"about_ca_system_score_gemma":0.0008548199,"threshold_uncertainty_score":0.036869466},"labels":[],"label_agreement":null},{"id":"W2405999666","doi":"","title":"On the average eccentricity of unicyclic graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eccentricity (behavior); Combinatorics; Psychology","score_opus":0.030527434356021697,"score_gpt":0.2790060066540664,"score_spread":0.24847857229804468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405999666","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7628306,0.010770368,0.15350758,0.0040537794,0.00057103374,0.000058025005,0.0018999745,0.00054903136,0.06575963],"genre_scores_gemma":[0.98237777,0.002758096,0.009700723,0.00021785585,0.00044424794,0.00004870083,0.00040133632,0.00017848886,0.0038729208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988526,0.000322807,0.000047382386,0.00033963556,0.0002318345,0.0002056988],"domain_scores_gemma":[0.9770808,0.015758744,0.0025959339,0.0018947724,0.0012432722,0.0014265053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018196808,0.0005970406,0.0012709801,0.0033132886,0.0010955558,0.002220745,0.0019133423,0.0013548454,0.00676669],"category_scores_gemma":[0.028932715,0.0005651994,0.00032584596,0.002447756,0.0023248706,0.005828903,0.0019287356,0.0014847027,0.0012498088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008052367,0.00014898137,0.0138095915,0.0006677725,0.0001859314,0.00044656105,0.00072016305,0.09496408,0.0097655505,0.77669144,0.02228334,0.07951132],"study_design_scores_gemma":[0.00006090395,0.00009862023,0.005352468,0.00014749802,0.000078638004,0.0010040603,0.00033168134,0.100002065,0.0029043572,0.8820691,0.007896209,0.000054365497],"about_ca_topic_score_codex":0.0007724992,"about_ca_topic_score_gemma":0.0009807238,"teacher_disagreement_score":0.00676669,"about_ca_system_score_codex":0.0012600044,"about_ca_system_score_gemma":0.00042552382,"threshold_uncertainty_score":0.022636771},"labels":[],"label_agreement":null},{"id":"W2406017096","doi":"","title":"On resolvable packing RMP(3, 3, v) and covering RMC(3, 3, v).","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.011970310693283286,"score_gpt":0.18032626804368657,"score_spread":0.1683559573504033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406017096","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4173289,0.0044333492,0.19294576,0.0046329424,0.00084679027,0.0002979872,0.0024214617,0.00097153574,0.37612125],"genre_scores_gemma":[0.8513443,0.004091209,0.08464134,0.0019888585,0.0008261112,0.0003316415,0.004507695,0.0006412028,0.051627673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834204,0.0004538718,0.0000560269,0.00026487772,0.000413787,0.0004693532],"domain_scores_gemma":[0.9944674,0.0033557157,0.0007138281,0.0008027351,0.0002634685,0.00039697322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008630653,0.0010786677,0.0012274536,0.002150944,0.002831913,0.0033663327,0.002005029,0.00207783,0.01767045],"category_scores_gemma":[0.006436587,0.00080934085,0.0010491667,0.003670491,0.00246896,0.0052825715,0.00409902,0.0035629324,0.0029672538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025062653,0.00014237339,0.00070543226,0.00020685596,0.000037679965,0.0003997148,0.00053604436,0.01602095,0.0016093819,0.92881423,0.024904236,0.026372412],"study_design_scores_gemma":[0.000043367058,0.000046234753,0.0006020788,0.00008611066,0.00002212222,0.000446304,0.00029142614,0.030098202,0.001012856,0.95588654,0.01143051,0.000034071283],"about_ca_topic_score_codex":0.0030863099,"about_ca_topic_score_gemma":0.0045844056,"teacher_disagreement_score":0.01767045,"about_ca_system_score_codex":0.0019932059,"about_ca_system_score_gemma":0.0010397543,"threshold_uncertainty_score":0.059113562},"labels":[],"label_agreement":null},{"id":"W2406017774","doi":"","title":"Domination In The Cross Product Of Digraphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cross product; Product (mathematics); Combinatorics; Geometry","score_opus":0.012294303277651677,"score_gpt":0.3021413337009847,"score_spread":0.28984703042333304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406017774","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6569527,0.0017490006,0.18254831,0.0010690723,0.00012538357,0.00009727851,0.0007698979,0.00034407523,0.15634423],"genre_scores_gemma":[0.94353676,0.0008431621,0.02064233,0.0002310392,0.00012991371,0.00008608056,0.0006313556,0.00012468861,0.033774626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990175,0.00029803082,0.000056762372,0.00024279188,0.00022342455,0.00016143468],"domain_scores_gemma":[0.99485826,0.0032046796,0.00052041304,0.0003930757,0.00046825848,0.00055532774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008504826,0.0003872169,0.0005324703,0.0019884205,0.0014476514,0.0028104298,0.0007370952,0.0007234218,0.010854647],"category_scores_gemma":[0.0054547456,0.00051160133,0.0005222875,0.0015787159,0.0015155041,0.003937847,0.0021497428,0.0010493196,0.0010912499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008585295,0.00003802543,0.0024639543,0.00011122229,0.000045039036,0.000511453,0.0008140337,0.0031292522,0.0029368624,0.96277934,0.0030885818,0.023996476],"study_design_scores_gemma":[0.000037984486,0.00005804622,0.0022792874,0.0000681766,0.00007897229,0.0014373477,0.0005068038,0.02544978,0.003333578,0.94540733,0.02131335,0.000029287263],"about_ca_topic_score_codex":0.0014625787,"about_ca_topic_score_gemma":0.0023093545,"teacher_disagreement_score":0.010854647,"about_ca_system_score_codex":0.0010262404,"about_ca_system_score_gemma":0.00045026987,"threshold_uncertainty_score":0.03631234},"labels":[],"label_agreement":null},{"id":"W2406020986","doi":"","title":"The Vertices of Lower Degree in Contraction-Critical k-Connected Graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Contraction (grammar); Combinatorics; Degree (music); Physics; Internal medicine; Medicine","score_opus":0.03778802458224832,"score_gpt":0.29298102535967374,"score_spread":0.2551930007774254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406020986","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9432269,0.00039558468,0.020309146,0.00092008745,0.000097943586,0.000040427516,0.00036138683,0.000104929124,0.034543533],"genre_scores_gemma":[0.98502284,0.00024901106,0.005910823,0.00014859205,0.00004163333,0.000038515373,0.00034214396,0.00005299426,0.008193466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997532,0.000051206047,0.0000105242425,0.000052329557,0.00004625225,0.00008659885],"domain_scores_gemma":[0.9978405,0.00086280063,0.00033636895,0.0001917973,0.00025372353,0.00051472354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027205423,0.00037888144,0.00041175447,0.0015534903,0.0016100269,0.0018045212,0.00068080897,0.0009442825,0.007650858],"category_scores_gemma":[0.0035233882,0.0004358333,0.00028914682,0.00094005355,0.0017798626,0.0016963483,0.0012476441,0.0010146361,0.0009269269],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009473302,0.00013012796,0.010315752,0.00036952237,0.000039054812,0.002016158,0.0029101996,0.01119215,0.033294436,0.890852,0.009944082,0.03798921],"study_design_scores_gemma":[0.0001385938,0.00009085042,0.009086646,0.00016962027,0.000065583234,0.0017178778,0.0023881656,0.025948016,0.015278978,0.9295365,0.015527018,0.00005212859],"about_ca_topic_score_codex":0.0019627335,"about_ca_topic_score_gemma":0.0034231385,"teacher_disagreement_score":0.007650858,"about_ca_system_score_codex":0.0005920274,"about_ca_system_score_gemma":0.00044364264,"threshold_uncertainty_score":0.025594652},"labels":[],"label_agreement":null},{"id":"W2406055012","doi":"","title":"On The Second Order Linear Recurrences By Tridiagonal Matrices.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tridiagonal matrix; Mathematics; Order (exchange); Applied mathematics; Algebra over a field; Pure mathematics; Eigenvalues and eigenvectors","score_opus":0.008789542342975213,"score_gpt":0.26287609582068816,"score_spread":0.254086553477713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406055012","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08376757,0.021923207,0.6089677,0.005808743,0.004719222,0.00008700659,0.00080848206,0.0007527402,0.27316523],"genre_scores_gemma":[0.7532756,0.012354229,0.10105111,0.0026433682,0.004558371,0.00021654718,0.00091319694,0.0006881921,0.12429941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934703,0.00021146005,0.000045337496,0.000089582834,0.0001811956,0.00012532106],"domain_scores_gemma":[0.99879634,0.00051607215,0.00016564483,0.00018585536,0.00023269972,0.000103446255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010111213,0.000820516,0.00075278943,0.001633599,0.0010481597,0.0020400914,0.00081215607,0.0007979737,0.010590387],"category_scores_gemma":[0.0039293165,0.0003918727,0.0007059917,0.0016076189,0.0020372062,0.004468397,0.0011763553,0.0020845237,0.0037379088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019912912,0.000014083183,0.00012437098,0.00005097,0.0000085597085,0.0000921992,0.00017765236,0.0013231125,0.0005232477,0.9804238,0.007641397,0.009600816],"study_design_scores_gemma":[0.00000645947,0.000012618537,0.00010277388,0.000024261333,0.0000058869978,0.00013519864,0.000045290577,0.0061632143,0.0003146978,0.9836428,0.009534873,0.000011932097],"about_ca_topic_score_codex":0.0011604832,"about_ca_topic_score_gemma":0.0020967827,"teacher_disagreement_score":0.010590387,"about_ca_system_score_codex":0.00091633294,"about_ca_system_score_gemma":0.0004994755,"threshold_uncertainty_score":0.035428345},"labels":[],"label_agreement":null},{"id":"W2406055866","doi":"","title":"On the m-Hull Number of the Join and Composition of Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Join (topology); Mathematics; Hull; Composition (language); Combinatorics; Discrete mathematics; Materials science; Composite material","score_opus":0.011367421330954955,"score_gpt":0.2246293934790618,"score_spread":0.21326197214810685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406055866","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64572954,0.001305733,0.24053591,0.0017009857,0.00032045986,0.00010703522,0.0009582711,0.00030427607,0.109037764],"genre_scores_gemma":[0.9465525,0.00046304215,0.04618049,0.00017079704,0.00023580354,0.00010183342,0.00045099898,0.000072803305,0.005771708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982363,0.0004700788,0.00010540117,0.0003655716,0.000517355,0.000305142],"domain_scores_gemma":[0.98863727,0.007712764,0.0012191744,0.0010403884,0.00044735582,0.0009429517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018908321,0.0005227004,0.0007109264,0.0029584498,0.0025140042,0.0036427407,0.0013515302,0.001184417,0.00789433],"category_scores_gemma":[0.00940542,0.00051010423,0.0007188387,0.0021015683,0.004543331,0.010276324,0.0032520893,0.0023274391,0.0009519863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028191772,0.00005621431,0.0029446061,0.000096372554,0.0000177209,0.000120341,0.00043743066,0.006038806,0.0027064115,0.96880597,0.0028775304,0.015616657],"study_design_scores_gemma":[0.000031310716,0.00010513679,0.0038946124,0.00006960339,0.000032307642,0.0005411031,0.00057228864,0.039621092,0.0053895423,0.9420143,0.0076730396,0.00005559956],"about_ca_topic_score_codex":0.00061576377,"about_ca_topic_score_gemma":0.00062957016,"teacher_disagreement_score":0.00789433,"about_ca_system_score_codex":0.0016119389,"about_ca_system_score_gemma":0.00046985128,"threshold_uncertainty_score":0.026409209},"labels":[],"label_agreement":null},{"id":"W2406057942","doi":"","title":"Lattices associated with partial linear maps of finite vector spaces.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vector space; Vector (molecular biology); Pure mathematics; Biology","score_opus":0.01256508586739747,"score_gpt":0.22909138528661213,"score_spread":0.21652629941921467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406057942","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39538866,0.003205505,0.37581983,0.0035925687,0.0012627331,0.00015709925,0.0015552354,0.0011889796,0.21782929],"genre_scores_gemma":[0.9241716,0.00079583813,0.032513313,0.00039876756,0.00068837573,0.00010687981,0.00076281093,0.00019039382,0.040372003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980724,0.000564088,0.00012535162,0.00026367718,0.00059428054,0.00038014376],"domain_scores_gemma":[0.99750715,0.000833064,0.0004209754,0.00024850672,0.0003846614,0.0006057047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009675269,0.00057526876,0.0005874338,0.0025450953,0.0018789504,0.0051392894,0.0008606705,0.00078589655,0.010750832],"category_scores_gemma":[0.0035929983,0.00055694155,0.0008631751,0.0017044856,0.0036272116,0.006135975,0.0038225562,0.0025267187,0.0018176265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003349224,0.00001596635,0.00019473826,0.000025122186,0.000007791603,0.00006909791,0.00015642736,0.00034013097,0.00048052554,0.9944988,0.0008103979,0.0033674818],"study_design_scores_gemma":[0.000017166123,0.000019633064,0.00018410354,0.000018461365,0.000008212324,0.00022169143,0.00017243132,0.0028356146,0.00089224445,0.9902249,0.005389972,0.000015521171],"about_ca_topic_score_codex":0.0010304762,"about_ca_topic_score_gemma":0.0010169777,"teacher_disagreement_score":0.010750832,"about_ca_system_score_codex":0.0015440711,"about_ca_system_score_gemma":0.0008720227,"threshold_uncertainty_score":0.035965085},"labels":[],"label_agreement":null},{"id":"W2406073954","doi":"","title":"Lattices Generated by Subspaces under Symplectic Group over a Finite Field.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Linear subspace; Symplectic geometry; Mathematics; Pure mathematics; Group (periodic table); Symplectic group; Field (mathematics); Finite field; Combinatorics; Physics; Quantum mechanics","score_opus":0.008412945792830077,"score_gpt":0.23048592114800145,"score_spread":0.22207297535517137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406073954","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77720606,0.0010599527,0.0934733,0.0027563581,0.00038457775,0.00011810155,0.000991196,0.00038226933,0.12362824],"genre_scores_gemma":[0.97424805,0.00031945025,0.009796989,0.00017409003,0.00028847903,0.00005785829,0.00038977605,0.00006132538,0.014663907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989592,0.0003187548,0.00005269981,0.00011647647,0.00030319704,0.0002496727],"domain_scores_gemma":[0.998365,0.00054937147,0.0003499362,0.00018577598,0.00016198601,0.00038794032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007933321,0.00036559784,0.0005069437,0.0013875344,0.0013223422,0.0023245402,0.00056270376,0.0004970168,0.0076836613],"category_scores_gemma":[0.0017153706,0.00029577178,0.00052484515,0.00077698386,0.002206243,0.0035710502,0.0024030246,0.0013080885,0.001119918],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011041306,0.00003099298,0.00037722645,0.000029963088,0.000007696353,0.00016020269,0.00031575444,0.00088785536,0.0014730048,0.9904975,0.0013593595,0.0047499207],"study_design_scores_gemma":[0.00006462897,0.00005590702,0.00037248465,0.000022803777,0.000008261659,0.00031691193,0.00026325515,0.0056168465,0.0017956877,0.98548,0.005984524,0.000018527391],"about_ca_topic_score_codex":0.0004380324,"about_ca_topic_score_gemma":0.0004643168,"teacher_disagreement_score":0.0076836613,"about_ca_system_score_codex":0.0007656847,"about_ca_system_score_gemma":0.0008128285,"threshold_uncertainty_score":0.025704443},"labels":[],"label_agreement":null},{"id":"W2406090923","doi":"","title":"The Graham's pebbling conjecture for K -k1 r, s x K -k2 m, n .","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Discrete mathematics","score_opus":0.03070349463851688,"score_gpt":0.3037449742684744,"score_spread":0.2730414796299575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406090923","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31114864,0.004066633,0.07647015,0.030351717,0.0014421104,0.00007180662,0.0015154724,0.0011166221,0.5738169],"genre_scores_gemma":[0.92141014,0.0012107046,0.014067998,0.0027496393,0.00044267255,0.00008068989,0.00067860243,0.00018938495,0.059170175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912804,0.000195325,0.00003484338,0.00021326376,0.00016476211,0.00026377817],"domain_scores_gemma":[0.99694663,0.0015788003,0.00026506404,0.0005146689,0.0003494197,0.00034543267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009704558,0.0005006727,0.000835974,0.0010045398,0.0038464759,0.0039109373,0.0010642406,0.00245462,0.016196078],"category_scores_gemma":[0.006855358,0.0005285597,0.0006936544,0.0016230111,0.0047696643,0.008877936,0.0029629949,0.0032535023,0.0035417648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004939293,0.000011609133,0.00028981126,0.000034035274,0.000004948296,0.00007866779,0.00015425336,0.0005837208,0.00017795767,0.9852513,0.009690724,0.0036736075],"study_design_scores_gemma":[0.000008112817,0.0000042076144,0.00012700341,0.000012281655,0.0000028612008,0.000057399466,0.00007100871,0.00071346253,0.00009601644,0.99463934,0.004261724,0.000006627984],"about_ca_topic_score_codex":0.0067785294,"about_ca_topic_score_gemma":0.0071176635,"teacher_disagreement_score":0.016196078,"about_ca_system_score_codex":0.0020634416,"about_ca_system_score_gemma":0.0016741212,"threshold_uncertainty_score":0.054181278},"labels":[],"label_agreement":null},{"id":"W2406096518","doi":"","title":"Rooted General Maps on All Surfaces.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Geometry; Pure mathematics","score_opus":0.012872839994744,"score_gpt":0.22521423765963247,"score_spread":0.21234139766488846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406096518","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3914685,0.00204734,0.22608057,0.003465872,0.0006003457,0.00010225312,0.0022815627,0.0009694039,0.3729841],"genre_scores_gemma":[0.8569059,0.001248958,0.053962644,0.0006240353,0.0003421734,0.000096999065,0.0020442936,0.00039741065,0.084377624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994789,0.000087263834,0.000023513994,0.00016522915,0.00012157444,0.00012363897],"domain_scores_gemma":[0.9991704,0.00032038247,0.00008614462,0.00018600459,0.000117028925,0.00012003383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029963432,0.0005683667,0.00056300685,0.0014439841,0.0017720509,0.0026589986,0.0009878945,0.0010691263,0.01356913],"category_scores_gemma":[0.0015708767,0.00038621874,0.00066676526,0.0013376902,0.0015515471,0.004735005,0.0023940133,0.0022538172,0.0023692022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029839512,0.000016877166,0.00026994426,0.000047409572,0.0000065409267,0.000053211475,0.00012837333,0.00086621894,0.0010361412,0.97936636,0.0045947563,0.013584205],"study_design_scores_gemma":[0.0000066799853,0.000007341806,0.0003411933,0.00001555883,0.0000074096347,0.00011490236,0.0001414356,0.0028040903,0.00082981406,0.97965485,0.016068932,0.000007852225],"about_ca_topic_score_codex":0.0011760236,"about_ca_topic_score_gemma":0.0020309137,"teacher_disagreement_score":0.01356913,"about_ca_system_score_codex":0.0011734248,"about_ca_system_score_gemma":0.000409384,"threshold_uncertainty_score":0.04539323},"labels":[],"label_agreement":null},{"id":"W2406104576","doi":"","title":"Some Results On Strong Generalized Neighborhood Systems.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.023027847055165997,"score_gpt":0.2497194157725645,"score_spread":0.2266915687173985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406104576","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16483553,0.008103573,0.5571348,0.0070103155,0.0009927369,0.00019208311,0.0010572877,0.0005405322,0.26013324],"genre_scores_gemma":[0.82465607,0.005338997,0.09484568,0.0017838984,0.0010444634,0.00035657067,0.0014043136,0.00024453958,0.07032532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896836,0.00029533118,0.000059746533,0.00020396098,0.00032960996,0.00014299108],"domain_scores_gemma":[0.99734515,0.0012765522,0.0002188626,0.0004120537,0.00039823513,0.00034915423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011850602,0.00053284323,0.0007518023,0.0016841487,0.0024639375,0.0024261074,0.0011464598,0.0009248653,0.01252569],"category_scores_gemma":[0.0050385655,0.00041146294,0.0009359866,0.002160692,0.0021135733,0.005635428,0.0036878055,0.0021867892,0.0013381578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001225225,0.00001208438,0.00022402749,0.00006221227,0.000012199478,0.000057249745,0.0001341699,0.0011954652,0.00026816723,0.9875395,0.0036055662,0.0068770596],"study_design_scores_gemma":[0.00001280629,0.000023099541,0.0003083474,0.000028631175,0.000018395527,0.00017700638,0.0001418634,0.008976709,0.00028217048,0.9726236,0.01739739,0.000010060289],"about_ca_topic_score_codex":0.0016852802,"about_ca_topic_score_gemma":0.0023018136,"teacher_disagreement_score":0.01252569,"about_ca_system_score_codex":0.001303808,"about_ca_system_score_gemma":0.0007740359,"threshold_uncertainty_score":0.041902542},"labels":[],"label_agreement":null},{"id":"W2406120758","doi":"","title":"A Note on Upper Generalized Exponents of Tournaments.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Pure mathematics; Mathematical economics","score_opus":0.022841130286643162,"score_gpt":0.2829236461014747,"score_spread":0.26008251581483155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406120758","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10814023,0.014557895,0.26413602,0.0125175305,0.005874166,0.000128196,0.0009678232,0.0005622525,0.5931159],"genre_scores_gemma":[0.8219108,0.008976077,0.08028306,0.0047665765,0.0052030687,0.00022235162,0.00058116374,0.0005847535,0.07747214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841344,0.00046211507,0.000100939935,0.00031166023,0.0004301567,0.00028171221],"domain_scores_gemma":[0.9940264,0.00388893,0.00029590173,0.00076959,0.00053240673,0.000486785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018876167,0.0011863207,0.0011838474,0.0022022445,0.002043666,0.0044686114,0.0014690945,0.0012775547,0.017632855],"category_scores_gemma":[0.010630301,0.0005142983,0.0013698824,0.0022569709,0.0039761467,0.0075707673,0.00349294,0.007243605,0.003170114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003572478,0.000013256384,0.00020990096,0.000059455993,0.000007901659,0.000109473905,0.00011658028,0.0005320133,0.0004446441,0.98754334,0.004117562,0.0068101403],"study_design_scores_gemma":[0.000013493503,0.000018905994,0.00023272353,0.000039492865,0.000009668806,0.00013808625,0.00004388102,0.0019752157,0.0002380682,0.9809823,0.016294979,0.000013190584],"about_ca_topic_score_codex":0.0010143772,"about_ca_topic_score_gemma":0.00138586,"teacher_disagreement_score":0.017632855,"about_ca_system_score_codex":0.0013461118,"about_ca_system_score_gemma":0.0005759562,"threshold_uncertainty_score":0.058987737},"labels":[],"label_agreement":null},{"id":"W2406123407","doi":"","title":"Generalization of the Erdos-Gallai Inequality.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Generalization; Inequality; Combinatorics; Mathematical analysis","score_opus":0.04687713431653109,"score_gpt":0.275436888416087,"score_spread":0.2285597540995559,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406123407","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041127674,0.0089938035,0.21088059,0.012963224,0.0023120465,0.000088949484,0.0013845621,0.00037234538,0.7218769],"genre_scores_gemma":[0.8145055,0.010322623,0.06635415,0.0048896447,0.0029062433,0.00031707314,0.001138243,0.00037755162,0.09918901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839514,0.00041590427,0.00007137453,0.00036426427,0.00055672886,0.00019650332],"domain_scores_gemma":[0.99670035,0.0016694906,0.00025514158,0.00051044597,0.00056936056,0.0002952463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016649337,0.00076943886,0.0010806487,0.00286415,0.0016869458,0.0031212752,0.0017397908,0.001761214,0.015340845],"category_scores_gemma":[0.008490019,0.00037757185,0.00090245437,0.0023653293,0.003485991,0.010342844,0.0046421983,0.004757552,0.0032284893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009241388,0.0000059412505,0.000083050996,0.00003500296,0.0000047863196,0.00003625483,0.00005333065,0.00023764132,0.00017103316,0.99154586,0.00402817,0.0037897283],"study_design_scores_gemma":[0.000004416375,0.0000043532827,0.00013068147,0.000019983436,0.000004990849,0.00009723451,0.000033479297,0.0014085374,0.00014004065,0.9879005,0.01025049,0.000005344303],"about_ca_topic_score_codex":0.0014426393,"about_ca_topic_score_gemma":0.0013592384,"teacher_disagreement_score":0.015340845,"about_ca_system_score_codex":0.0017972274,"about_ca_system_score_gemma":0.0008010868,"threshold_uncertainty_score":0.051320195},"labels":[],"label_agreement":null},{"id":"W2406155186","doi":"","title":"On the Merrifield-Simmons index and Hosoya index of bicyclic graphs with a given girth.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Girth (graph theory); Mathematics; Combinatorics; Index (typography); Discrete mathematics; Computer science","score_opus":0.019514727435922315,"score_gpt":0.25834961748710167,"score_spread":0.23883489005117936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406155186","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78550977,0.0052595064,0.042899147,0.002091559,0.00048381364,0.00006204507,0.00095823465,0.00023758347,0.1624984],"genre_scores_gemma":[0.98565173,0.0014926767,0.0059000403,0.00017713038,0.0003483707,0.000039158902,0.00030405808,0.00005056165,0.006036293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995419,0.00011924697,0.000020819873,0.0000731182,0.00014101068,0.000104017],"domain_scores_gemma":[0.997472,0.0012476706,0.00039155563,0.00018862933,0.00028665186,0.00041348708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008564077,0.0005227074,0.00080167403,0.0042792954,0.0011235003,0.0017124702,0.000995357,0.0008007593,0.006202808],"category_scores_gemma":[0.005402489,0.0002282863,0.00027879863,0.0027288094,0.0020455876,0.0036229107,0.0014891522,0.0013141361,0.00076854636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026044264,0.00004657369,0.003059065,0.00010585964,0.000023714103,0.0001185106,0.0005193127,0.0058744377,0.0023009698,0.95430154,0.006658731,0.026730968],"study_design_scores_gemma":[0.000042883006,0.000072913965,0.0039638407,0.000075331605,0.000032001182,0.0003832587,0.00041276068,0.018536504,0.0015635986,0.9668455,0.008020361,0.00005099588],"about_ca_topic_score_codex":0.0015640105,"about_ca_topic_score_gemma":0.0018910095,"teacher_disagreement_score":0.006202808,"about_ca_system_score_codex":0.0011647164,"about_ca_system_score_gemma":0.00050567585,"threshold_uncertainty_score":0.020750463},"labels":[],"label_agreement":null},{"id":"W2406159084","doi":"","title":"Maximum Hexagon Packing of K v -L Where L is a 2-regular Subgraph.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.005187919504921489,"score_gpt":0.17967688053724337,"score_spread":0.1744889610323219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406159084","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71534705,0.00076194375,0.090469874,0.00112617,0.0002627791,0.00015871103,0.0065592984,0.0013058527,0.18400829],"genre_scores_gemma":[0.9381436,0.00023351269,0.03850561,0.00017560372,0.000028010658,0.000058660164,0.0036288006,0.00018906574,0.019037161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997179,0.00006071047,0.000012565143,0.00006189606,0.000049410526,0.0000974611],"domain_scores_gemma":[0.99961543,0.00010996229,0.00006251722,0.00008455668,0.000046482168,0.00008092954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000086789405,0.00039521654,0.0005354796,0.00048523952,0.0008605956,0.0010634931,0.00064077176,0.00071690266,0.02273678],"category_scores_gemma":[0.0007990165,0.00031733114,0.00030245908,0.00090110156,0.00043278246,0.0009952717,0.0009257107,0.00047815297,0.00362513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0041049267,0.00083319255,0.01285502,0.001743187,0.00025605634,0.006179324,0.0015215515,0.153765,0.10186064,0.34537727,0.14135198,0.2301519],"study_design_scores_gemma":[0.00027786265,0.0004996956,0.014799399,0.0002551859,0.00011614297,0.003835307,0.0031277232,0.4534868,0.07049189,0.3888997,0.064105116,0.00010516587],"about_ca_topic_score_codex":0.0017765514,"about_ca_topic_score_gemma":0.0025892523,"teacher_disagreement_score":0.02273678,"about_ca_system_score_codex":0.00045252524,"about_ca_system_score_gemma":0.0003922599,"threshold_uncertainty_score":0.07606214},"labels":[],"label_agreement":null},{"id":"W2406159111","doi":"","title":"Extremal Trees of the Eccentric Connectivity Index","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eccentric; Index (typography); Statistics; Topological index; Combinatorics; Computer science; World Wide Web; Structural engineering","score_opus":0.043572902612251094,"score_gpt":0.28565826364942415,"score_spread":0.24208536103717304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406159111","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7901748,0.0013430823,0.10965984,0.0016475809,0.0001399457,0.0000410243,0.0008061318,0.00030187608,0.095885545],"genre_scores_gemma":[0.9779309,0.0006287433,0.012872464,0.00020176786,0.00024107262,0.000050362032,0.00034421094,0.00012191012,0.0076085315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999569,0.0001000472,0.000017975097,0.00009788528,0.00012470398,0.00009030179],"domain_scores_gemma":[0.99613994,0.002141952,0.00062913913,0.00025829326,0.00037569512,0.00045500492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007242103,0.00040356384,0.00090109167,0.003244432,0.0015033896,0.0032147083,0.0010450856,0.0014519949,0.008097291],"category_scores_gemma":[0.006292248,0.0005142878,0.00033740752,0.0019057846,0.0018515015,0.003599113,0.0015832983,0.0019495765,0.0006748404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061953564,0.000020204601,0.0010811219,0.00005455758,0.000010242622,0.00014475848,0.00019216139,0.003225915,0.0014388388,0.9853416,0.0018404238,0.006588342],"study_design_scores_gemma":[0.00001420674,0.000009151032,0.0010427323,0.000022443766,0.000012783282,0.00027211208,0.0000903975,0.01571199,0.00047943386,0.9802719,0.0020607298,0.000012111881],"about_ca_topic_score_codex":0.00048169954,"about_ca_topic_score_gemma":0.0007351769,"teacher_disagreement_score":0.008097291,"about_ca_system_score_codex":0.000997057,"about_ca_system_score_gemma":0.00028388904,"threshold_uncertainty_score":0.027088165},"labels":[],"label_agreement":null},{"id":"W2406162040","doi":"","title":"A Computational Criterion For The Supersolvability Of Line Arrangements.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Line (geometry); Mathematical economics; Applied mathematics; Geometry","score_opus":0.04346805573420112,"score_gpt":0.3283473303519447,"score_spread":0.28487927461774354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406162040","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3530623,0.00097329024,0.3624604,0.0061180377,0.0004942693,0.00041727503,0.0049498156,0.0012187257,0.2703059],"genre_scores_gemma":[0.9250583,0.00034153968,0.05515179,0.00051847455,0.00039217438,0.00031730218,0.003356098,0.00029146924,0.014572943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99709535,0.0008060885,0.00023870805,0.0005865898,0.00092854036,0.00034479247],"domain_scores_gemma":[0.97496074,0.017847434,0.0012316742,0.0027476877,0.0022702045,0.0009423431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017671206,0.00066855294,0.0009483859,0.0027187476,0.0026065276,0.0069515337,0.0029970307,0.0022703358,0.021717742],"category_scores_gemma":[0.02210265,0.00091970357,0.0013015486,0.0026513606,0.0061675855,0.011222724,0.0036302009,0.0046148193,0.0031378097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001401229,0.000066780165,0.0011749164,0.000114211296,0.000020037032,0.000114514485,0.00026511625,0.003868427,0.0016612433,0.9767875,0.0054379394,0.010349234],"study_design_scores_gemma":[0.000042683496,0.00004590744,0.00072514033,0.000058222366,0.000023647064,0.00022539702,0.000213514,0.016212784,0.0020737266,0.974006,0.0063389656,0.000034032135],"about_ca_topic_score_codex":0.0014257262,"about_ca_topic_score_gemma":0.0018157742,"teacher_disagreement_score":0.021717742,"about_ca_system_score_codex":0.0018944867,"about_ca_system_score_gemma":0.0014618761,"threshold_uncertainty_score":0.072653115},"labels":[],"label_agreement":null},{"id":"W2406179673","doi":"","title":"Note On odd path extendable graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Path (computing); Combinatorics; Computer science; Programming language","score_opus":0.014090335045029358,"score_gpt":0.2849480019081853,"score_spread":0.27085766686315593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406179673","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0641589,0.012106108,0.12385953,0.02573372,0.015326867,0.00014405466,0.001309827,0.0009908141,0.75637025],"genre_scores_gemma":[0.67049146,0.030817132,0.10051608,0.013266765,0.012642095,0.00022956959,0.0016468607,0.0006206797,0.16976938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996952,0.00005316535,0.000013577599,0.00008770008,0.00009656498,0.000053821703],"domain_scores_gemma":[0.99837935,0.00094954163,0.00007964343,0.00024869153,0.00016622769,0.00017652792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065104297,0.00077275577,0.00054289965,0.0010934882,0.0013783376,0.0011246835,0.0010451488,0.00066496263,0.016952707],"category_scores_gemma":[0.0021186885,0.00020806416,0.0006346264,0.0012432922,0.0018243559,0.0039859316,0.0028007806,0.0029576877,0.0018721535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014384529,0.000056034223,0.0007232896,0.00042176075,0.000027343145,0.0012420377,0.0003308128,0.0012896466,0.0032899163,0.8912568,0.051144667,0.050073914],"study_design_scores_gemma":[0.0000123752925,0.000049568913,0.0010079087,0.0000586204,0.000029592093,0.000836247,0.00011375182,0.0008887566,0.0009396149,0.8692941,0.12675159,0.000017875826],"about_ca_topic_score_codex":0.001415709,"about_ca_topic_score_gemma":0.0021923315,"teacher_disagreement_score":0.016952707,"about_ca_system_score_codex":0.00050413504,"about_ca_system_score_gemma":0.00037337485,"threshold_uncertainty_score":0.05671239},"labels":[],"label_agreement":null},{"id":"W2406187070","doi":"","title":"The spectral characterization of graphs of index less than 2 with no Z n as a component.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Characterization (materials science); Index (typography); Component (thermodynamics); Combinatorics; Physics; Computer science; Materials science; Nanotechnology; World Wide Web; Thermodynamics","score_opus":0.011045731583445876,"score_gpt":0.24482581669248316,"score_spread":0.23378008510903728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406187070","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69659156,0.0018706187,0.089672156,0.00295823,0.00046457743,0.0000595666,0.0012094686,0.0004531988,0.20672046],"genre_scores_gemma":[0.9742312,0.0005681146,0.00981484,0.00042789543,0.00028641726,0.00004719361,0.0006693101,0.00012833337,0.013826669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974054,0.000061186154,0.000011056828,0.00006604944,0.000063692794,0.00005748954],"domain_scores_gemma":[0.9985808,0.0005433436,0.0002685216,0.00015373732,0.00020750887,0.00024607746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002980593,0.00043134074,0.00036525837,0.0022583853,0.0010142477,0.0016145279,0.00072414643,0.0006472508,0.005215841],"category_scores_gemma":[0.0023950236,0.0002612984,0.0003241227,0.0009382738,0.0016422331,0.0027238491,0.0009970798,0.0011115618,0.0011374332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020668902,0.00004211876,0.0014632097,0.0001031925,0.000012319205,0.00018973979,0.00055409095,0.0017063364,0.009933111,0.9609414,0.007832468,0.01701537],"study_design_scores_gemma":[0.000020166128,0.000027830129,0.0019170522,0.000044835713,0.000018622377,0.0006004123,0.00041101407,0.009790785,0.003291821,0.97375643,0.010102189,0.000018835693],"about_ca_topic_score_codex":0.00078293425,"about_ca_topic_score_gemma":0.0006790455,"teacher_disagreement_score":0.005215841,"about_ca_system_score_codex":0.0006116171,"about_ca_system_score_gemma":0.00032269637,"threshold_uncertainty_score":0.017448783},"labels":[],"label_agreement":null},{"id":"W2406194317","doi":"","title":"Edge colorings of planar graphs with maximum degree five.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Combinatorics; Planar graph; Enhanced Data Rates for GSM Evolution; Planar; Graph; Artificial intelligence; Computer science; Physics; Computer graphics (images)","score_opus":0.03775239169665943,"score_gpt":0.25280587512344765,"score_spread":0.21505348342678823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406194317","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7638515,0.0012131671,0.09700886,0.0019384563,0.00032731108,0.00010144219,0.0017325775,0.0007310618,0.13309556],"genre_scores_gemma":[0.9495378,0.0004392054,0.029196346,0.00026997027,0.00006884882,0.00003954255,0.0012565696,0.0001359229,0.01905581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962556,0.00009612239,0.000018173845,0.00006604241,0.0000693069,0.00012470198],"domain_scores_gemma":[0.99818414,0.0008681844,0.00026450944,0.0002359658,0.00018295756,0.0002641671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030016014,0.000385482,0.00029685293,0.0010486546,0.0011945633,0.0014478859,0.00086434215,0.0007594277,0.009190301],"category_scores_gemma":[0.0025583387,0.00046398278,0.0004470665,0.0011292492,0.00096755504,0.0012387548,0.0009693774,0.0010039227,0.0009726347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005209569,0.00016184637,0.005441803,0.00030476443,0.000058935588,0.00080481876,0.00078749354,0.025031937,0.013317894,0.8698819,0.024578564,0.059109032],"study_design_scores_gemma":[0.0001227235,0.000094980904,0.0060138316,0.00010339057,0.00006194959,0.0010392544,0.00085381867,0.051142454,0.0065018786,0.9045839,0.0294296,0.000052231604],"about_ca_topic_score_codex":0.0029946323,"about_ca_topic_score_gemma":0.005101989,"teacher_disagreement_score":0.009190301,"about_ca_system_score_codex":0.0009100031,"about_ca_system_score_gemma":0.00045902384,"threshold_uncertainty_score":0.030744612},"labels":[],"label_agreement":null},{"id":"W2406207104","doi":"","title":"The number of independent sets in bicyclic graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.014718971238258537,"score_gpt":0.2827254303497995,"score_spread":0.268006459111541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406207104","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5937862,0.0076837596,0.09325285,0.006437246,0.0008470918,0.00011296204,0.0025269913,0.0004750132,0.29487786],"genre_scores_gemma":[0.97544086,0.00180764,0.008049451,0.00028815377,0.00034202205,0.0001362746,0.0004664902,0.000068224595,0.013401009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986644,0.00031557388,0.000085154876,0.00025930366,0.00046591542,0.00020971113],"domain_scores_gemma":[0.9904631,0.0059279045,0.001170233,0.0007213819,0.0007285119,0.0009889895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013488226,0.00057631946,0.0008461387,0.0047369734,0.0017609358,0.004456335,0.0020306064,0.0013734272,0.007488306],"category_scores_gemma":[0.0127633205,0.00067108724,0.00043645132,0.0024521016,0.0042922474,0.0064935456,0.0023803317,0.0019143221,0.001020389],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072855335,0.000023314185,0.0006812202,0.000107786225,0.000015754524,0.00005605459,0.00018373494,0.0015002032,0.0008766323,0.98524046,0.002826571,0.008415365],"study_design_scores_gemma":[0.00001314869,0.000013248417,0.00059843116,0.000049458744,0.000016134976,0.0002672835,0.00010657232,0.0052480856,0.0007209741,0.98936427,0.003587871,0.000014577041],"about_ca_topic_score_codex":0.00084979006,"about_ca_topic_score_gemma":0.0010029328,"teacher_disagreement_score":0.007488306,"about_ca_system_score_codex":0.0015597214,"about_ca_system_score_gemma":0.0006865001,"threshold_uncertainty_score":0.025050879},"labels":[],"label_agreement":null},{"id":"W2406211933","doi":"","title":"Recurrence Relations Of The Second Order And Infinite Series Identities.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Recurrence relation; Series (stratigraphy); Order (exchange); Pure mathematics; Combinatorics; Geology","score_opus":0.019422118267744495,"score_gpt":0.22019451655729352,"score_spread":0.20077239828954901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406211933","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12918696,0.014108297,0.38907135,0.005654295,0.0017076505,0.00011997651,0.0010166513,0.00077724206,0.4583576],"genre_scores_gemma":[0.897149,0.0024969177,0.040258273,0.0006264509,0.0011280337,0.00015045363,0.00051681884,0.00021640978,0.057457626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877197,0.0003551024,0.00009773618,0.00020013942,0.00041180736,0.0001632198],"domain_scores_gemma":[0.9964684,0.0019241739,0.00037946008,0.00042332956,0.0006040247,0.0002006707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014069418,0.0005145079,0.00079831673,0.0024072153,0.0016268921,0.0038422681,0.0009060432,0.00088724814,0.010800053],"category_scores_gemma":[0.010645804,0.00041612226,0.00091187324,0.0017739792,0.0027264734,0.005692926,0.0014476073,0.0026256668,0.0021820175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009329772,0.000006156725,0.00013660666,0.000017128521,0.0000034829645,0.000041089148,0.000104493825,0.00031248975,0.000137416,0.99394095,0.0013664712,0.0039244103],"study_design_scores_gemma":[0.0000051271227,0.0000047124563,0.00013140732,0.000010256021,0.000005122695,0.00009997371,0.000028063694,0.003538481,0.00020960237,0.9917653,0.004193091,0.00000868086],"about_ca_topic_score_codex":0.0022397893,"about_ca_topic_score_gemma":0.0029935006,"teacher_disagreement_score":0.010800053,"about_ca_system_score_codex":0.0022762213,"about_ca_system_score_gemma":0.0009549128,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2406233418","doi":"","title":"Some Commutativity Conditions in Prime MA-Semirings.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Prime (order theory); Commutative property; Pure mathematics; Algebra over a field; Combinatorics","score_opus":0.023374801621589045,"score_gpt":0.2836769572060236,"score_spread":0.26030215558443454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406233418","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33290875,0.009166804,0.17509355,0.006989193,0.00137701,0.00016804926,0.0016672328,0.0005955932,0.47203392],"genre_scores_gemma":[0.95404786,0.0018069361,0.020504477,0.0010013281,0.0011141364,0.00013640919,0.0007208559,0.00011138406,0.020556645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831593,0.0005934196,0.00018423563,0.00029700127,0.00036814582,0.00024138665],"domain_scores_gemma":[0.99529195,0.002750185,0.00032889374,0.00041651743,0.0006789135,0.0005336276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033194085,0.00053950533,0.0008023332,0.0018946184,0.0024824112,0.0037956925,0.00065784453,0.0011681936,0.012694038],"category_scores_gemma":[0.005633494,0.0005828175,0.0008623535,0.0014499968,0.00449743,0.009211333,0.0023103005,0.0026406818,0.0019735761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030498351,0.000022388593,0.0002882918,0.0000364463,0.00000516674,0.000097229255,0.0002776217,0.000099352605,0.00052816473,0.99438417,0.001379683,0.0028510806],"study_design_scores_gemma":[0.000022890361,0.00002913075,0.00051658956,0.000021342754,0.000013162165,0.0002472496,0.00029447876,0.0007476752,0.00074473827,0.9904697,0.006879035,0.000013952594],"about_ca_topic_score_codex":0.00085732015,"about_ca_topic_score_gemma":0.0010229816,"teacher_disagreement_score":0.012694038,"about_ca_system_score_codex":0.0013067165,"about_ca_system_score_gemma":0.0007458662,"threshold_uncertainty_score":0.042465746},"labels":[],"label_agreement":null},{"id":"W2406243916","doi":"","title":"Defensive alliances in circulant graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Circulant matrix; Mathematics; Combinatorics","score_opus":0.02530739306303901,"score_gpt":0.27995575678977586,"score_spread":0.2546483637267368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406243916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33028892,0.0020519048,0.33135563,0.004900657,0.00063551136,0.00024470498,0.00078826596,0.0008526792,0.3288817],"genre_scores_gemma":[0.92401284,0.00096409017,0.034372203,0.0007122765,0.0002553822,0.00017984721,0.0004378942,0.000109584274,0.038955975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986816,0.00047596288,0.000056742745,0.00025372897,0.00027392525,0.0002579516],"domain_scores_gemma":[0.99407864,0.0023664308,0.001066553,0.00067712885,0.0005758143,0.0012355188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009966413,0.000490972,0.0007216446,0.0019676716,0.0030687966,0.0034563588,0.0011517243,0.0017794288,0.014243306],"category_scores_gemma":[0.0069083907,0.0004376639,0.00067340967,0.0017402164,0.0024757253,0.004905611,0.0026967162,0.0023590478,0.002576169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016463167,0.000017131413,0.00020516168,0.000029100112,0.000007726013,0.00008182042,0.00018476907,0.00071146776,0.00044697468,0.99105704,0.0022081698,0.005034202],"study_design_scores_gemma":[0.000018080516,0.00001764796,0.00027476304,0.000032930664,0.000016050839,0.00028324738,0.00026889698,0.008946968,0.00032381757,0.9801942,0.009610154,0.000013190398],"about_ca_topic_score_codex":0.0011352559,"about_ca_topic_score_gemma":0.0017554417,"teacher_disagreement_score":0.014243306,"about_ca_system_score_codex":0.0013278062,"about_ca_system_score_gemma":0.0008055864,"threshold_uncertainty_score":0.04764861},"labels":[],"label_agreement":null},{"id":"W2406248079","doi":"","title":"Lower and Upper Orientable Strong Radius and Strong Diameter of the Cartesian Product of Complete Graphs","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Mathematics; RADIUS; Cartesian coordinate system; Product (mathematics); Combinatorics; Geometry; Computer science","score_opus":0.00913719301420765,"score_gpt":0.20880120925466283,"score_spread":0.19966401624045518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406248079","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78894585,0.003994497,0.14873396,0.0017139638,0.00012860584,0.000056949215,0.0009421948,0.0007105152,0.05477353],"genre_scores_gemma":[0.9629131,0.0012512726,0.027264865,0.0002838876,0.00025912258,0.00012364211,0.0007100776,0.00026863615,0.0069255126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99759334,0.00071636395,0.00014819395,0.0007511537,0.0004188496,0.00037203726],"domain_scores_gemma":[0.97772676,0.0147586,0.0022889816,0.0014629683,0.0008195528,0.0029431018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025318156,0.00158314,0.0021806331,0.0023324625,0.0018364752,0.006746747,0.0032000928,0.0016282991,0.007138705],"category_scores_gemma":[0.013027301,0.0021192662,0.0013721825,0.0019924461,0.0043771616,0.00902323,0.0046624267,0.0034450726,0.0011856158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067254284,0.00010609796,0.0037734695,0.00037677464,0.000073511255,0.00019199771,0.0012405174,0.013019878,0.0065699513,0.9573789,0.004357671,0.0122386515],"study_design_scores_gemma":[0.00010959162,0.00022539472,0.0050575277,0.00010913169,0.00019172835,0.0007661202,0.0006509361,0.053633384,0.007124802,0.9219446,0.010070356,0.00011631885],"about_ca_topic_score_codex":0.0007515129,"about_ca_topic_score_gemma":0.0009275489,"teacher_disagreement_score":0.007138705,"about_ca_system_score_codex":0.0015481728,"about_ca_system_score_gemma":0.00058396463,"threshold_uncertainty_score":0.023881316},"labels":[],"label_agreement":null},{"id":"W2406267159","doi":"","title":"The Degree-Sum of Adjacent Vertices, Girth and Upper Embeddability.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Girth (graph theory); Degree (music); Discrete mathematics","score_opus":0.009551465894280459,"score_gpt":0.1904916603778103,"score_spread":0.18094019448352983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406267159","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6713159,0.0034073198,0.17577162,0.0023859174,0.00049166277,0.000051689676,0.0013380427,0.00039665596,0.14484121],"genre_scores_gemma":[0.98089683,0.0010077792,0.0086362045,0.00015479601,0.00029337275,0.000035156932,0.00029845454,0.000073813106,0.008603673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914634,0.0002022751,0.00004352916,0.00022484391,0.00021880647,0.00016427983],"domain_scores_gemma":[0.9956636,0.002506033,0.00060418353,0.00063283474,0.00018029238,0.0004131746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006787381,0.00055084337,0.0006423524,0.0026116662,0.0010400916,0.002925711,0.0011362133,0.0007108431,0.008081378],"category_scores_gemma":[0.006246839,0.00047280872,0.00039899393,0.0016752963,0.0026664357,0.0043134177,0.0021857552,0.0017792247,0.00094621617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016471268,0.000063106956,0.0025028612,0.00011181021,0.000032622953,0.00024200739,0.00035243173,0.011143417,0.0039427103,0.9486533,0.00393578,0.02885525],"study_design_scores_gemma":[0.00001517026,0.000041144645,0.0021665748,0.000048115857,0.000032705007,0.00068353565,0.00019651603,0.020073589,0.002159622,0.9688993,0.005658863,0.000024880634],"about_ca_topic_score_codex":0.0006113007,"about_ca_topic_score_gemma":0.0007875087,"teacher_disagreement_score":0.008081378,"about_ca_system_score_codex":0.00071135745,"about_ca_system_score_gemma":0.00034532644,"threshold_uncertainty_score":0.027034879},"labels":[],"label_agreement":null},{"id":"W2406279947","doi":"","title":"Hamilton cycles in claw-heavy graphs with Fan-type condition restricted to two induced subgraphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Claw; Mathematics; Combinatorics; Type (biology); Structural engineering; Biology; Engineering; Ecology","score_opus":0.017130595200870645,"score_gpt":0.2411993602845563,"score_spread":0.22406876508368564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406279947","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7918478,0.00051896874,0.11658797,0.0008897894,0.0001923103,0.00018993173,0.0010769574,0.00047723,0.08821903],"genre_scores_gemma":[0.9727303,0.00016120134,0.013430706,0.00018982608,0.000059057944,0.00009557679,0.0006359993,0.000052624044,0.012644782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965334,0.00008405337,0.000015006621,0.0000767593,0.00007174616,0.00009912109],"domain_scores_gemma":[0.9986106,0.00059787,0.00018499118,0.00013721352,0.00021244648,0.00025681005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029857323,0.00031637747,0.0003460063,0.0011102717,0.0010150882,0.001087933,0.0006331028,0.0008211233,0.008556397],"category_scores_gemma":[0.0025241624,0.00033717358,0.00029563843,0.0007691493,0.000853608,0.0012878776,0.00074381806,0.00069924584,0.00056331255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027479147,0.00010690573,0.0028662658,0.00016210749,0.000036240886,0.0008584561,0.00039639656,0.007966107,0.013288264,0.9446905,0.007707045,0.021647004],"study_design_scores_gemma":[0.00008419794,0.00006835459,0.0025337818,0.00006554954,0.00003771063,0.0006431129,0.0004853966,0.064319715,0.0059744613,0.91678864,0.008961099,0.000038046586],"about_ca_topic_score_codex":0.0024857917,"about_ca_topic_score_gemma":0.004337241,"teacher_disagreement_score":0.008556397,"about_ca_system_score_codex":0.0007014771,"about_ca_system_score_gemma":0.0007694935,"threshold_uncertainty_score":0.028623998},"labels":[],"label_agreement":null},{"id":"W2406306592","doi":"","title":"Defensive alliances in regular graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.013542901488435264,"score_gpt":0.2653162974456306,"score_spread":0.25177339595719533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406306592","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33515012,0.002076045,0.31551215,0.006213846,0.0004990028,0.00024847488,0.0008740717,0.0010737351,0.33835253],"genre_scores_gemma":[0.9225067,0.00083750737,0.034843773,0.0005713423,0.00016173611,0.00014710505,0.00046657334,0.00011978823,0.040345438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99833655,0.00062785327,0.0000986728,0.00037133414,0.00028859568,0.00027701512],"domain_scores_gemma":[0.9927579,0.0029058072,0.0012861883,0.0012057009,0.0005405533,0.0013037084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012116232,0.00042218884,0.00069216924,0.0017550071,0.0029547682,0.0037845946,0.0012937482,0.0016473322,0.01592537],"category_scores_gemma":[0.008297286,0.0004910991,0.0008860518,0.0016804561,0.0027806882,0.0077875257,0.003371653,0.002367616,0.0028914653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003413713,0.000025944439,0.0004889622,0.00004984841,0.000015650923,0.00015744616,0.0004901315,0.00086041307,0.0006304114,0.9862132,0.0026568002,0.008377076],"study_design_scores_gemma":[0.000019606125,0.000019913281,0.00034741388,0.000038227645,0.000022857661,0.00040427534,0.0004964282,0.005515609,0.00042128967,0.980789,0.011912949,0.000012392037],"about_ca_topic_score_codex":0.0008744577,"about_ca_topic_score_gemma":0.0012694885,"teacher_disagreement_score":0.01592537,"about_ca_system_score_codex":0.0011339653,"about_ca_system_score_gemma":0.0007087664,"threshold_uncertainty_score":0.053275704},"labels":[],"label_agreement":null},{"id":"W2406309141","doi":"","title":"On the (Laplacian) spectral radius of bipartite graphs with given number of blocks.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Spectral radius; Combinatorics; RADIUS; Laplace operator; Graph; Mathematical analysis; Eigenvalues and eigenvectors; Computer science; Physics; Computer network","score_opus":0.02758121325164764,"score_gpt":0.25775508451875734,"score_spread":0.2301738712671097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406309141","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47359818,0.00766061,0.41059247,0.0061713373,0.000620787,0.000098476805,0.0012204486,0.0009504148,0.09908738],"genre_scores_gemma":[0.94901574,0.002346651,0.038403008,0.0006441426,0.0007303444,0.00016667262,0.00049809605,0.0003875698,0.0078077293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984547,0.00080426136,0.00004970697,0.00024040378,0.00026017602,0.00019068681],"domain_scores_gemma":[0.98610014,0.010262572,0.0011012628,0.0007702063,0.00075038854,0.0010155395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020212452,0.00079451536,0.0010309137,0.0029214185,0.0010291444,0.0019114463,0.0021960814,0.0018739491,0.006586704],"category_scores_gemma":[0.020558847,0.0005440499,0.00041462743,0.0016272322,0.0033106806,0.0046352413,0.0020805786,0.0018932419,0.00141821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024314808,0.00007129354,0.0015677987,0.00022874128,0.000043740092,0.00012818663,0.00034133875,0.03593011,0.0037100818,0.9270312,0.012647271,0.018057022],"study_design_scores_gemma":[0.000034652887,0.00003800739,0.0010991502,0.0000655857,0.000021330341,0.00025529214,0.00018734962,0.123961315,0.0010193266,0.87025696,0.003023303,0.00003779648],"about_ca_topic_score_codex":0.0011801303,"about_ca_topic_score_gemma":0.0011666691,"teacher_disagreement_score":0.006586704,"about_ca_system_score_codex":0.0015068853,"about_ca_system_score_gemma":0.0004390761,"threshold_uncertainty_score":0.022034705},"labels":[],"label_agreement":null},{"id":"W2406331434","doi":"","title":"Fundamental relation on Γ-hyperrings.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Fuzzy and Soft Set Theory","field":"Decision Sciences","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Relation (database); Computer science; Data mining","score_opus":0.11280071197118743,"score_gpt":0.3263497665584711,"score_spread":0.21354905458728365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406331434","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14154719,0.005595282,0.49641475,0.005300094,0.00087599497,0.00017561669,0.0015546371,0.00030858454,0.34822792],"genre_scores_gemma":[0.866163,0.0024707448,0.09581103,0.0010291449,0.0010355016,0.00018690339,0.00086489535,0.00008960362,0.032349072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975937,0.0006493397,0.00024919093,0.0005484855,0.00070672104,0.00025250565],"domain_scores_gemma":[0.99593395,0.0019487389,0.00049105356,0.0005005337,0.0006690169,0.00045669827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027115957,0.00050676585,0.00060471514,0.003373121,0.0020845165,0.0058549433,0.0007527733,0.0011737763,0.00985911],"category_scores_gemma":[0.0051629553,0.00040607748,0.0010577943,0.0022130653,0.004839862,0.007989075,0.0030528205,0.002659741,0.001615932],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066852235,0.000005586928,0.000082929815,0.000016435682,0.0000047374015,0.000017347777,0.00008442509,0.00012941397,0.00017346445,0.99564594,0.0004924052,0.00334062],"study_design_scores_gemma":[0.0000063960542,0.000010725869,0.00016345698,0.000018733152,0.0000056078084,0.00008649286,0.00008079523,0.0011223933,0.00020162137,0.9906088,0.00768795,0.0000070033125],"about_ca_topic_score_codex":0.0010171409,"about_ca_topic_score_gemma":0.0010922946,"teacher_disagreement_score":0.00985911,"about_ca_system_score_codex":0.0020690449,"about_ca_system_score_gemma":0.00085773686,"threshold_uncertainty_score":0.03298205},"labels":[],"label_agreement":null},{"id":"W2406367216","doi":"","title":"ON SUPER (a, 2)-EDGE-ANTIMAGIC TOTAL LABELING OF DISCONNECTED GRAPHS","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Edge-graceful labeling; Arithmetic progression; Graph; Graph labeling; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Graph power; Line graph; Computer science; Artificial intelligence","score_opus":0.008266548985325757,"score_gpt":0.21469165795534087,"score_spread":0.20642510897001512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406367216","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79488105,0.0010004677,0.14691885,0.00102968,0.00008083353,0.00006673885,0.0007214315,0.00035574232,0.054945286],"genre_scores_gemma":[0.9493794,0.0006552794,0.042939536,0.00024396554,0.0000928648,0.000088370594,0.00072438596,0.00006720059,0.0058090487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993266,0.00021139122,0.000055710396,0.00015836065,0.0001230918,0.00012487362],"domain_scores_gemma":[0.9964737,0.0021490406,0.00041029596,0.0003116046,0.00025625664,0.00039909378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007934421,0.00046346823,0.0005035177,0.0019459577,0.0015726307,0.0019134679,0.00057594466,0.0011899428,0.003606544],"category_scores_gemma":[0.0031204014,0.00041766677,0.00053575804,0.0019344056,0.002009399,0.002697406,0.0017366086,0.0011384262,0.00047932574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016004205,0.000046952453,0.0024415348,0.00015208722,0.000016148342,0.00025911772,0.00064586755,0.009560627,0.0061555305,0.961845,0.002578026,0.016139083],"study_design_scores_gemma":[0.00002865602,0.000054890497,0.0010857044,0.000033244196,0.000022395108,0.0005763818,0.00043387193,0.031690903,0.0024565835,0.95703095,0.006558569,0.000027891796],"about_ca_topic_score_codex":0.0007636022,"about_ca_topic_score_gemma":0.001106829,"teacher_disagreement_score":0.003606544,"about_ca_system_score_codex":0.0012595694,"about_ca_system_score_gemma":0.00047063592,"threshold_uncertainty_score":0.012065113},"labels":[],"label_agreement":null},{"id":"W2406396761","doi":"","title":"Computation of the edge Wiener indices of the sum of graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Computation; Enhanced Data Rates for GSM Evolution; Wiener index; Combinatorics; Graph; Algorithm; Computer science; Artificial intelligence","score_opus":0.03589183753706476,"score_gpt":0.26737686522212983,"score_spread":0.23148502768506507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406396761","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49132505,0.0013092374,0.43354338,0.00065056066,0.00043886513,0.000045171768,0.00058429607,0.0006148216,0.07148859],"genre_scores_gemma":[0.8982811,0.0004937842,0.08240631,0.00010339288,0.00012194131,0.000060980685,0.0006227271,0.00042136386,0.017488344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996904,0.00007326666,0.000018145356,0.000047374393,0.000119696895,0.000051184135],"domain_scores_gemma":[0.9990526,0.00040319026,0.00009978621,0.00013414238,0.0001605402,0.00014970388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006762285,0.00058159337,0.0006592347,0.0022599804,0.00068836,0.0015712634,0.0011795133,0.0007008026,0.006109361],"category_scores_gemma":[0.0049185976,0.00037364705,0.0005244966,0.00095343584,0.0010706664,0.003479596,0.0015965117,0.0012776138,0.0014645925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011607426,0.000044373915,0.0011199857,0.00012070851,0.000039829283,0.0001645598,0.00019865116,0.0103906905,0.00645192,0.95469,0.003458434,0.023204817],"study_design_scores_gemma":[0.0000136913495,0.000023775794,0.00092163624,0.00003383714,0.000019894484,0.00018968961,0.00007842096,0.107174724,0.0054681436,0.8828652,0.0031863232,0.000024718458],"about_ca_topic_score_codex":0.00045568324,"about_ca_topic_score_gemma":0.0014023087,"teacher_disagreement_score":0.006109361,"about_ca_system_score_codex":0.00056636805,"about_ca_system_score_gemma":0.00039918363,"threshold_uncertainty_score":0.020437837},"labels":[],"label_agreement":null},{"id":"W2406417745","doi":"","title":"On the Wiener index of rooted product of graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Wiener index; Index (typography); Combinatorics; Product (mathematics); Statistics; Discrete mathematics; Graph; Computer science; Geometry; World Wide Web","score_opus":0.019957228077385876,"score_gpt":0.2559265809331849,"score_spread":0.235969352855799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406417745","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46879876,0.00783544,0.28574535,0.00275964,0.0013557439,0.000056687702,0.0006735907,0.00039297013,0.23238184],"genre_scores_gemma":[0.93208444,0.003393547,0.029438637,0.00044587173,0.0011228456,0.000081026614,0.00040703267,0.0003224472,0.03270421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914455,0.00023059428,0.000052335017,0.00015332615,0.00025389646,0.00016526463],"domain_scores_gemma":[0.99660707,0.0015218724,0.00055864506,0.0002971275,0.00039841773,0.00061681436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013300318,0.00077806145,0.0010548729,0.005043684,0.0014741087,0.0033431454,0.0012698548,0.0013890583,0.0065395134],"category_scores_gemma":[0.0076404484,0.0005040507,0.00065316254,0.002346395,0.0032431167,0.008590191,0.002890322,0.0022423922,0.001740799],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019256697,0.000008615371,0.00023206124,0.000024642119,0.000006044873,0.00003973372,0.00012002494,0.00061568356,0.000543683,0.9936195,0.0008728733,0.0038979363],"study_design_scores_gemma":[0.0000040946748,0.000011224328,0.00027746547,0.000020432784,0.0000067992887,0.00009469809,0.000062895466,0.0054706708,0.000302942,0.99161595,0.0021215696,0.000011158826],"about_ca_topic_score_codex":0.0008748181,"about_ca_topic_score_gemma":0.0011961801,"teacher_disagreement_score":0.0065395134,"about_ca_system_score_codex":0.0014327051,"about_ca_system_score_gemma":0.00045139,"threshold_uncertainty_score":0.021876872},"labels":[],"label_agreement":null},{"id":"W2406434350","doi":"","title":"Distance Fibonacci numbers, distance Lucas numbers and their applications.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Mathematics; Lucas number; Lucas sequence; Pisano period; Arithmetic; Combinatorics; Discrete mathematics; Fibonacci polynomials","score_opus":0.004838139742126608,"score_gpt":0.2312477579736204,"score_spread":0.2264096182314938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406434350","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04802461,0.29899225,0.13563886,0.010464458,0.006207427,0.000055787325,0.0005073543,0.0003147993,0.49979457],"genre_scores_gemma":[0.66151136,0.11411021,0.09448286,0.003944032,0.009155377,0.00022362423,0.0006480934,0.000177956,0.115746535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954295,0.00013356686,0.00003389224,0.00006965925,0.00017313873,0.000046841637],"domain_scores_gemma":[0.99886286,0.00069648377,0.00012781886,0.000067684276,0.00015723414,0.00008804396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000740058,0.0008603754,0.0008177617,0.0043486785,0.0018080669,0.003161086,0.0008346293,0.0017692685,0.009618923],"category_scores_gemma":[0.0043085264,0.0004932616,0.0005374403,0.0043961164,0.003273166,0.004932705,0.0019460011,0.0027859597,0.0021752745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008545027,0.00000741314,0.000093938186,0.00006726854,0.0000044261787,0.000053661446,0.00009793696,0.00040556575,0.00016256748,0.98362124,0.0043871487,0.01109028],"study_design_scores_gemma":[0.000002938277,0.000007640538,0.00013703655,0.000035567555,0.0000040509494,0.0001657167,0.000091249036,0.0011030935,0.00007370928,0.97334135,0.025029238,0.000008410333],"about_ca_topic_score_codex":0.0011652935,"about_ca_topic_score_gemma":0.0016410094,"teacher_disagreement_score":0.009618923,"about_ca_system_score_codex":0.001520515,"about_ca_system_score_gemma":0.0005380423,"threshold_uncertainty_score":0.03217846},"labels":[],"label_agreement":null},{"id":"W2406440815","doi":"","title":"Minimizing the least eigenvalue of bicyclic graphs with k pendant vertices.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Combinatorics; Bicyclic molecule; Chemistry; Medicinal chemistry; Physics","score_opus":0.03411369322353293,"score_gpt":0.2815135971341634,"score_spread":0.2473999039106305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406440815","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7413009,0.00088681094,0.19305137,0.0015631417,0.0002468367,0.000109600616,0.00087736244,0.00055526604,0.061408788],"genre_scores_gemma":[0.9374988,0.00043498163,0.044445395,0.00018618764,0.000079255115,0.00013453941,0.00056538056,0.00022138328,0.01643413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996959,0.00008498609,0.000011845368,0.00006238188,0.000065128785,0.00007976299],"domain_scores_gemma":[0.99899834,0.00048522517,0.00014287556,0.000079483936,0.000117286276,0.00017678077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027473402,0.00073143473,0.0005849946,0.000743508,0.0006483096,0.0010143844,0.00088212756,0.0010541747,0.0064243027],"category_scores_gemma":[0.0030595977,0.0003205185,0.00020894823,0.00066209707,0.0006445057,0.0009813776,0.00091976445,0.00063860137,0.0012274677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008905415,0.00027775558,0.0038493467,0.0011894996,0.0001183757,0.00076359854,0.0006719013,0.1981163,0.06439185,0.5789267,0.042311177,0.108493],"study_design_scores_gemma":[0.000097047465,0.0001492926,0.002290363,0.00008586654,0.00003448678,0.00043093826,0.00054477697,0.3699376,0.010520959,0.610179,0.0056773266,0.00005238085],"about_ca_topic_score_codex":0.0009734162,"about_ca_topic_score_gemma":0.0020151255,"teacher_disagreement_score":0.0064243027,"about_ca_system_score_codex":0.0005153905,"about_ca_system_score_gemma":0.00037554043,"threshold_uncertainty_score":0.021491468},"labels":[],"label_agreement":null},{"id":"W2406442302","doi":"","title":"Two Constructions of Multireceiver Authentication Codes from Symplectic Geometry over Finite Fields.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Symplectic geometry; Mathematics; Finite field; Geometry; Pure mathematics; Discrete mathematics","score_opus":0.018435253564025006,"score_gpt":0.23745136593627753,"score_spread":0.21901611237225252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406442302","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096826956,0.0017814878,0.78319204,0.0044467407,0.0012651624,0.0004339618,0.00075707235,0.0012650907,0.11003148],"genre_scores_gemma":[0.7777076,0.0011569217,0.18188776,0.00092939823,0.00038996933,0.0003723076,0.00063276297,0.0003637806,0.0365596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826163,0.00045024036,0.000131315,0.00023241283,0.00056299695,0.00036147996],"domain_scores_gemma":[0.99602723,0.0012046596,0.00036693312,0.0015525722,0.0003950665,0.00045366836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012723452,0.00077933446,0.00080413494,0.0017904864,0.0017312684,0.002848796,0.0014393369,0.002336466,0.009059878],"category_scores_gemma":[0.0050912197,0.00065325847,0.00104599,0.0013964556,0.0030206696,0.005358381,0.00680138,0.0036148364,0.0026250875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043364864,0.000031892654,0.00012715472,0.000046209847,0.0000054324,0.00014225546,0.0002888347,0.0009639913,0.0010425549,0.98561376,0.0019909753,0.009703683],"study_design_scores_gemma":[0.00005253113,0.00007063007,0.00021708795,0.00008063708,0.000016809567,0.0007023565,0.00017171711,0.015525916,0.004690507,0.9622396,0.016168535,0.00006354533],"about_ca_topic_score_codex":0.00031809052,"about_ca_topic_score_gemma":0.0005450639,"teacher_disagreement_score":0.009059878,"about_ca_system_score_codex":0.0010705374,"about_ca_system_score_gemma":0.0013454395,"threshold_uncertainty_score":0.030308306},"labels":[],"label_agreement":null},{"id":"W2406446571","doi":"","title":"Some Comvolution Sums And The Representation Numbers.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Representation (politics); Arithmetic; Law","score_opus":0.025178373393326528,"score_gpt":0.30491804121829613,"score_spread":0.2797396678249696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406446571","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13097087,0.008416135,0.18009205,0.0071301856,0.0022616235,0.000057570884,0.00052537175,0.00036669162,0.6701794],"genre_scores_gemma":[0.8221057,0.0030477433,0.04184183,0.0015225686,0.0015692606,0.000119567856,0.00043156743,0.00023464968,0.12912709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992939,0.00021320807,0.000045292734,0.00011412324,0.00023582029,0.00009761618],"domain_scores_gemma":[0.9990589,0.0003736955,0.000100920355,0.0001383651,0.00019623211,0.00013193964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009634835,0.0007070683,0.0006098723,0.0022164434,0.0021175786,0.003516633,0.0009220813,0.0011010471,0.013267663],"category_scores_gemma":[0.0034235597,0.00035923475,0.00073991803,0.0014960214,0.0031347019,0.006905679,0.002692928,0.0029774779,0.002362364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032131663,0.0000032156554,0.00003169008,0.000007955257,0.0000016270852,0.00001614384,0.000030107583,0.00007005713,0.00007248586,0.99663997,0.00089825987,0.002225219],"study_design_scores_gemma":[0.0000020894909,0.0000037677717,0.000057084348,0.0000066734515,0.000002175115,0.000060037295,0.000023726003,0.0007852209,0.00011528914,0.9947973,0.0041432413,0.0000035345827],"about_ca_topic_score_codex":0.00056658837,"about_ca_topic_score_gemma":0.000745804,"teacher_disagreement_score":0.013267663,"about_ca_system_score_codex":0.0011454336,"about_ca_system_score_gemma":0.0004641743,"threshold_uncertainty_score":0.044384778},"labels":[],"label_agreement":null},{"id":"W2406468902","doi":"","title":"A function on bounds of the spectral radius of graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; RADIUS; Function (biology); Combinatorics; Computer science; Physics; Eigenvalues and eigenvectors; Computer network","score_opus":0.014209811686800767,"score_gpt":0.2554356070726158,"score_spread":0.24122579538581504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406468902","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24690859,0.018778361,0.49352667,0.01094911,0.0014247391,0.00011437188,0.0016126743,0.0019281122,0.22475745],"genre_scores_gemma":[0.90302914,0.0058793733,0.062409285,0.0012995714,0.002268441,0.00036245023,0.0007859735,0.0011344488,0.022831377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974003,0.001093976,0.00009528001,0.0005500324,0.0005340671,0.00032636317],"domain_scores_gemma":[0.9629434,0.02860833,0.002145759,0.002154409,0.0017404626,0.0024075625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039257295,0.00175406,0.0014947825,0.0056728525,0.0015574842,0.0040486986,0.0029226923,0.0027214163,0.011449934],"category_scores_gemma":[0.042169254,0.0007625246,0.0009957341,0.0027114386,0.004877366,0.009958599,0.0036206483,0.0047242623,0.0031111934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022910192,0.00005467777,0.0013468805,0.00020104328,0.000042549033,0.0001053392,0.00039891092,0.008340917,0.0025358945,0.95409596,0.010559599,0.022089103],"study_design_scores_gemma":[0.000025809913,0.00007207916,0.002552695,0.00019278917,0.000056318637,0.00046463765,0.0002279563,0.0678796,0.0020125597,0.9140338,0.012423745,0.00005791596],"about_ca_topic_score_codex":0.0009245661,"about_ca_topic_score_gemma":0.0005932607,"teacher_disagreement_score":0.011449934,"about_ca_system_score_codex":0.002588053,"about_ca_system_score_gemma":0.00061307003,"threshold_uncertainty_score":0.038303852},"labels":[],"label_agreement":null},{"id":"W2406485966","doi":"","title":"On Randic index and the matching number.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Matching (statistics); Index (typography); Statistics; Combinatorics; Computer science; World Wide Web","score_opus":0.010943963129212479,"score_gpt":0.2666375419769148,"score_spread":0.25569357884770233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406485966","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.202916,0.025816465,0.114679284,0.012934944,0.003428266,0.00008665522,0.0009720019,0.00046289852,0.63870347],"genre_scores_gemma":[0.89148194,0.010852256,0.0316033,0.0019026613,0.00371356,0.00016696262,0.00059669133,0.0002927481,0.059389908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991035,0.000267555,0.000048559872,0.0001944658,0.0002309574,0.0001549766],"domain_scores_gemma":[0.99597615,0.0021650856,0.0006519417,0.00040456495,0.00041807312,0.00038417726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014718658,0.0006671123,0.0012168474,0.0050424733,0.0018578115,0.003203491,0.0015595878,0.0015296282,0.011403332],"category_scores_gemma":[0.010280424,0.00040582055,0.00048748104,0.0030570682,0.0037999316,0.008593082,0.0027068856,0.0032301687,0.0027763706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026613261,0.000010710911,0.00023702369,0.000037621845,0.000004870358,0.000027389144,0.00006873092,0.0005377873,0.00020527739,0.98777175,0.0035427967,0.007529448],"study_design_scores_gemma":[0.0000063901757,0.000008094658,0.00029836633,0.000028099486,0.0000064781543,0.00008903899,0.000050683906,0.0018999017,0.00015477891,0.9908393,0.006609202,0.0000096448575],"about_ca_topic_score_codex":0.001119099,"about_ca_topic_score_gemma":0.0012370092,"teacher_disagreement_score":0.011403332,"about_ca_system_score_codex":0.001809632,"about_ca_system_score_gemma":0.00055696437,"threshold_uncertainty_score":0.038147926},"labels":[],"label_agreement":null},{"id":"W2406491841","doi":"","title":"Nowhere-zero 3-flows in Tensor Products of Graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Zero (linguistics); Tensor (intrinsic definition); Tensor product; Pure mathematics; Linguistics","score_opus":0.010336862100538177,"score_gpt":0.22285045510788196,"score_spread":0.2125135930073438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406491841","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44538188,0.0013474753,0.413094,0.0013690239,0.0011737756,0.00013555434,0.00061598705,0.0010496861,0.13583265],"genre_scores_gemma":[0.87367165,0.0006415426,0.08075742,0.00039457672,0.00026450842,0.00009044306,0.0005233834,0.000616056,0.043040443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993542,0.00016626975,0.00004543408,0.000118308955,0.00016243315,0.00015349658],"domain_scores_gemma":[0.9987859,0.00036159702,0.00020038323,0.000188105,0.00021468442,0.00024929896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007954555,0.0006269263,0.0004602377,0.0018543899,0.0017128541,0.0023724402,0.00094554876,0.0009948588,0.009774585],"category_scores_gemma":[0.0022585758,0.00047028187,0.00085208705,0.0008105997,0.0022023062,0.0042078765,0.0023059885,0.001595009,0.0017661991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003092703,0.000017966182,0.0002096664,0.000029741701,0.0000048835864,0.00008470796,0.00016389509,0.0008332107,0.001147852,0.98951334,0.0015770878,0.006386797],"study_design_scores_gemma":[0.000007168752,0.000013350399,0.00015387517,0.00002075784,0.000006446572,0.0001281821,0.00011266124,0.0043753954,0.001132398,0.98888946,0.005147556,0.000012813059],"about_ca_topic_score_codex":0.0012579934,"about_ca_topic_score_gemma":0.0020583968,"teacher_disagreement_score":0.009774585,"about_ca_system_score_codex":0.0010025454,"about_ca_system_score_gemma":0.00064760004,"threshold_uncertainty_score":0.032699287},"labels":[],"label_agreement":null},{"id":"W2406494304","doi":"","title":"On generalized Pell numbers generated by Fibonacci and Lucas numbers.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Lucas number; Lucas sequence; Mathematics; Fibonacci polynomials; Pisano period; Combinatorics; Arithmetic; Classical orthogonal polynomials; Orthogonal polynomials","score_opus":0.005420133839280236,"score_gpt":0.24237682022355425,"score_spread":0.23695668638427403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406494304","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25183395,0.016612517,0.2015415,0.0042715827,0.00258114,0.00014628984,0.0008209701,0.00054463267,0.5216474],"genre_scores_gemma":[0.8803358,0.0063062287,0.037106674,0.0010425958,0.0016514646,0.00019832938,0.00062576035,0.0002535583,0.07247946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994711,0.00014790916,0.000025530355,0.00008421776,0.00015420228,0.00011706659],"domain_scores_gemma":[0.99912626,0.00042369496,0.00013543027,0.00007142019,0.0001548014,0.00008838961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054626685,0.0010237698,0.0007520087,0.002912537,0.0017559003,0.0029071774,0.0007818439,0.001052908,0.013088525],"category_scores_gemma":[0.0032834823,0.00043159653,0.0007854477,0.0022556558,0.0029290842,0.004760316,0.0018189473,0.0017925568,0.0029043036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013367361,0.0000041024896,0.000064370615,0.000031300664,0.0000028004258,0.00007597236,0.00010436421,0.0005900671,0.00030032694,0.9930698,0.0014043085,0.004339095],"study_design_scores_gemma":[0.000008003544,0.000007656222,0.000113693175,0.00001947303,0.0000045852835,0.00014464925,0.000053997737,0.0016768529,0.00021560304,0.9906572,0.007086905,0.000011296757],"about_ca_topic_score_codex":0.0012407936,"about_ca_topic_score_gemma":0.0016199049,"teacher_disagreement_score":0.013088525,"about_ca_system_score_codex":0.0013479481,"about_ca_system_score_gemma":0.0006507228,"threshold_uncertainty_score":0.043785453},"labels":[],"label_agreement":null},{"id":"W2406516169","doi":"","title":"On Konhauser Matrix Polynomials.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.016111796866289028,"score_gpt":0.23843353679213558,"score_spread":0.22232173992584656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406516169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1348634,0.0147160115,0.44823572,0.007768186,0.0019253957,0.00010563209,0.0011059534,0.00076451356,0.39051515],"genre_scores_gemma":[0.79858404,0.010442401,0.07967689,0.0021648386,0.002152424,0.0001239769,0.0009935548,0.0003104965,0.10555135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913883,0.0002361935,0.000034136465,0.00013925027,0.0002803375,0.00017118541],"domain_scores_gemma":[0.9986077,0.0007453765,0.00014119873,0.000193613,0.00018578251,0.00012629265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095586356,0.0007993025,0.00056900363,0.0020398526,0.0014167177,0.0018877462,0.000769884,0.00077279954,0.0140817035],"category_scores_gemma":[0.004250819,0.00032175265,0.00047673486,0.0024797807,0.002324906,0.0057323226,0.0024706186,0.003344782,0.0045993854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024294011,0.000023047482,0.00015943519,0.0000534283,0.000005723299,0.000046980553,0.00015489226,0.0010059865,0.0005334361,0.97728205,0.0051809703,0.015529785],"study_design_scores_gemma":[0.000007879544,0.000012866174,0.0001838333,0.000021090977,0.0000050525455,0.000116453506,0.000065522276,0.003947266,0.0004357102,0.9850969,0.010096691,0.000010685064],"about_ca_topic_score_codex":0.0012426245,"about_ca_topic_score_gemma":0.00205862,"teacher_disagreement_score":0.0140817035,"about_ca_system_score_codex":0.0011339751,"about_ca_system_score_gemma":0.00055654836,"threshold_uncertainty_score":0.047108054},"labels":[],"label_agreement":null},{"id":"W2406529202","doi":"","title":"The local bases of primitive non-powerfull signed symmetric digraphs with loops.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Pure mathematics","score_opus":0.0029945307393601348,"score_gpt":0.17497462976232142,"score_spread":0.1719800990229613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406529202","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5136579,0.0009183251,0.24434921,0.0009569016,0.00027668383,0.00014626807,0.0013036196,0.0005415905,0.2378495],"genre_scores_gemma":[0.94445574,0.00025846844,0.017130667,0.00016114434,0.00010276988,0.000096563905,0.0005404781,0.0000825932,0.037171625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996258,0.00008526026,0.000023005667,0.00007416397,0.00009819303,0.00009353976],"domain_scores_gemma":[0.9989786,0.00029213293,0.00017986413,0.00017130443,0.00018339328,0.00019475436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038797013,0.00031350044,0.00039727977,0.0014434789,0.0010492846,0.0022977588,0.00077655935,0.0005231034,0.013502353],"category_scores_gemma":[0.0018211216,0.00028465874,0.00032567853,0.00072903844,0.0013983259,0.0024536569,0.0015465866,0.0011201601,0.0025537203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004289548,0.000030110366,0.00013790888,0.00005053499,0.0000053932627,0.00008812584,0.00018680507,0.0009405843,0.0021823924,0.98502016,0.0010836724,0.010231576],"study_design_scores_gemma":[0.00003322552,0.000041063504,0.00034905443,0.00003730042,0.000011070341,0.00017029734,0.00019587573,0.008035429,0.0028050616,0.97906655,0.009233952,0.000021174159],"about_ca_topic_score_codex":0.0005448574,"about_ca_topic_score_gemma":0.001127676,"teacher_disagreement_score":0.013502353,"about_ca_system_score_codex":0.0008518554,"about_ca_system_score_gemma":0.00054003805,"threshold_uncertainty_score":0.04516989},"labels":[],"label_agreement":null},{"id":"W2406603664","doi":"","title":"On the Laplacian spectral characterization of the generalized T-shape trees.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Characterization (materials science); Laplace operator; Pure mathematics; Combinatorics; Mathematical analysis; Materials science; Nanotechnology","score_opus":0.011737116681990033,"score_gpt":0.2074694668757511,"score_spread":0.19573235019376106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406603664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30165213,0.0013290144,0.65160704,0.002598244,0.0002029975,0.00007911363,0.0010007031,0.0008387981,0.04069198],"genre_scores_gemma":[0.9298108,0.0011320933,0.056028068,0.0006916132,0.00055622566,0.00009833035,0.0010921968,0.00030094566,0.010289799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990526,0.0002528117,0.000056543875,0.00020395659,0.00028688522,0.00014715218],"domain_scores_gemma":[0.9955942,0.0018527771,0.0005349831,0.0007677453,0.0006575698,0.00059262523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010291267,0.00050858344,0.0007746554,0.0036559086,0.0015328526,0.0032467735,0.0012973116,0.001228889,0.0066778734],"category_scores_gemma":[0.010025512,0.0003236697,0.0007059856,0.003789131,0.0029110862,0.0054363455,0.0024155488,0.0022109835,0.0015586829],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053485113,0.000039668525,0.0013154125,0.000053913136,0.000012376037,0.00017868388,0.00044529932,0.005521956,0.002671742,0.9593915,0.00427584,0.026040204],"study_design_scores_gemma":[0.0000070272777,0.000019623958,0.00068069086,0.000025110416,0.000009957532,0.0003198834,0.00031615456,0.044005685,0.0006190401,0.9497491,0.0042257546,0.000022016495],"about_ca_topic_score_codex":0.0014303665,"about_ca_topic_score_gemma":0.0011771214,"teacher_disagreement_score":0.0066778734,"about_ca_system_score_codex":0.0009296103,"about_ca_system_score_gemma":0.0006150074,"threshold_uncertainty_score":0.022339702},"labels":[],"label_agreement":null},{"id":"W2406622082","doi":"","title":"Identities For The Bernoulli And Euler Numbers And Polynomials.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"History and Theory of Mathematics","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bernoulli's principle; Euler's formula; Bernoulli polynomials; Pure mathematics; Algebra over a field; Difference polynomials; Orthogonal polynomials; Mathematical analysis; Physics","score_opus":0.03365641134269772,"score_gpt":0.28529861233502063,"score_spread":0.25164220099232293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406622082","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02599935,0.049455166,0.11020602,0.014215141,0.0041392744,0.00003335978,0.00086366973,0.00021502275,0.79487306],"genre_scores_gemma":[0.7281395,0.027365,0.045127764,0.0033313944,0.005429167,0.00013775566,0.00087603217,0.00019853242,0.18939482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907684,0.0003197191,0.000047760444,0.00013493613,0.0003237465,0.00009696625],"domain_scores_gemma":[0.9985569,0.00070481724,0.00012898693,0.00018453614,0.00030483535,0.000119829085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013871383,0.0005468639,0.00062219583,0.0025851547,0.002465152,0.0036065835,0.00078332005,0.0012825088,0.011546448],"category_scores_gemma":[0.0048058606,0.0003737311,0.0006152305,0.0020437469,0.005225306,0.008652371,0.0021185484,0.0037168846,0.0032922204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014984871,0.0000016093907,0.000024545325,0.000008665687,6.5522266e-7,0.000007180991,0.000044085114,0.000030301539,0.000025174892,0.996626,0.0017830097,0.0014472905],"study_design_scores_gemma":[0.0000018272291,0.0000018488719,0.00007670933,0.000014568989,0.0000011868832,0.00004310059,0.000028054728,0.00016662992,0.0000433461,0.98290586,0.016713835,0.000003004374],"about_ca_topic_score_codex":0.0022174031,"about_ca_topic_score_gemma":0.002636972,"teacher_disagreement_score":0.011546448,"about_ca_system_score_codex":0.0025812774,"about_ca_system_score_gemma":0.0012461417,"threshold_uncertainty_score":0.03862679},"labels":[],"label_agreement":null},{"id":"W2406638558","doi":"","title":"Edge Colorings of Planar Graphs without adjacent special cycles.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Planar graph; Edge coloring; Planar; Geometry; Graph; Computer science; Artificial intelligence; Computer graphics (images); Line graph","score_opus":0.01648212332690365,"score_gpt":0.23399863046376645,"score_spread":0.2175165071368628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406638558","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66475177,0.0024282408,0.17034408,0.0037249948,0.0004298597,0.00014996705,0.0032875347,0.0009269266,0.15395671],"genre_scores_gemma":[0.9232281,0.0009626606,0.053017054,0.0005083118,0.00018697657,0.00010522961,0.002088011,0.00022730051,0.019676436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994161,0.00018539623,0.00003644619,0.00012530416,0.0000884586,0.00014839962],"domain_scores_gemma":[0.996815,0.001863292,0.00040998988,0.00041448246,0.00019779612,0.00029939986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052786974,0.0004988739,0.0005309982,0.0014365365,0.0016739699,0.0029042056,0.001084804,0.0012024449,0.008861341],"category_scores_gemma":[0.003965817,0.0007105877,0.00059477746,0.0016595972,0.0014897487,0.003062498,0.0014717123,0.0015268989,0.0010143487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024235729,0.00009872901,0.0026865522,0.00019799951,0.00003440233,0.00019701984,0.00034804753,0.012106637,0.0039619356,0.9262996,0.018895945,0.0349308],"study_design_scores_gemma":[0.00006451796,0.00003208328,0.0015859114,0.000055845165,0.000034667348,0.00038076504,0.00036869326,0.02527279,0.0021639597,0.95465654,0.015357775,0.000026447477],"about_ca_topic_score_codex":0.0021927445,"about_ca_topic_score_gemma":0.00326617,"teacher_disagreement_score":0.008861341,"about_ca_system_score_codex":0.0013751502,"about_ca_system_score_gemma":0.00061873876,"threshold_uncertainty_score":0.029644132},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Closeness; Mathematics; Residual; Statistics; Combinatorics; Algorithm","score_opus":0.03400394482779249,"score_gpt":0.3046801913416691,"score_spread":0.2706762465138766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406639167","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7907247,0.00089235976,0.11965171,0.0032413998,0.00012289474,0.00008870377,0.0010339981,0.0004922682,0.0837519],"genre_scores_gemma":[0.98922056,0.00027850122,0.004933185,0.00018424791,0.0000616959,0.00003406622,0.00028604447,0.000067124485,0.004934707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989343,0.00031444896,0.00004440088,0.00024385437,0.00026822012,0.00019472197],"domain_scores_gemma":[0.9924306,0.004410684,0.0012380531,0.00079307595,0.0005187591,0.0006088047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008293533,0.0003878978,0.0006380666,0.0021028796,0.0015661513,0.002667307,0.00093020214,0.0012145026,0.00780443],"category_scores_gemma":[0.010374823,0.00047153744,0.0006142532,0.0012320423,0.0026543215,0.0055686547,0.0033911674,0.002196254,0.0007788523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016371523,0.000038349048,0.0032621382,0.00010902021,0.00003468948,0.00024387009,0.0007153526,0.007361328,0.0022547392,0.9737438,0.0028797826,0.009193328],"study_design_scores_gemma":[0.000023739722,0.000029020433,0.0013982686,0.000035981884,0.00003577426,0.0004076949,0.0003643805,0.016071169,0.0012187435,0.97673017,0.003663192,0.000021991298],"about_ca_topic_score_codex":0.0010360419,"about_ca_topic_score_gemma":0.00079938135,"teacher_disagreement_score":0.00780443,"about_ca_system_score_codex":0.0011006691,"about_ca_system_score_gemma":0.00042208075,"threshold_uncertainty_score":0.026108384},"labels":[],"label_agreement":null},{"id":"W2406672015","doi":"","title":"The Generalized Pell p-Sequences in Groups.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Arithmetic","score_opus":0.05178874408818458,"score_gpt":0.3084652999284593,"score_spread":0.2566765558402747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406672015","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1891564,0.00533223,0.23725958,0.006434652,0.0017377861,0.0001544849,0.0009309837,0.0008774973,0.5581164],"genre_scores_gemma":[0.8383078,0.0039763846,0.05288266,0.0015925688,0.0011696939,0.00022329962,0.00064144447,0.00033081486,0.10087538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999506,0.00016999085,0.00002564237,0.00010381457,0.000113979295,0.000080565085],"domain_scores_gemma":[0.9993243,0.00022172244,0.00009578838,0.00010106392,0.000121064884,0.00013606226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041601178,0.0007904582,0.00047780148,0.0021954118,0.001591751,0.002951159,0.00069445436,0.0011529877,0.01471234],"category_scores_gemma":[0.0031619938,0.0003744758,0.00053557754,0.0019191807,0.0030233916,0.004929048,0.0026946268,0.002190017,0.003940987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013261867,0.0000035255453,0.000072877,0.000025278816,0.0000027355798,0.000045449782,0.00010999095,0.0002658165,0.00033526553,0.988655,0.0019402903,0.008530536],"study_design_scores_gemma":[0.0000042128513,0.0000064788837,0.00007858399,0.000010366505,0.000002641736,0.00010270674,0.00006925483,0.00069403555,0.00022889658,0.9915937,0.0072036874,0.000005476729],"about_ca_topic_score_codex":0.00090834516,"about_ca_topic_score_gemma":0.0009454965,"teacher_disagreement_score":0.01471234,"about_ca_system_score_codex":0.0009148599,"about_ca_system_score_gemma":0.00065235066,"threshold_uncertainty_score":0.04921764},"labels":[],"label_agreement":null},{"id":"W2406672111","doi":"","title":"A Ballot Number Formulary.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Formulary; Ballot; Mathematics; Medicine; Law; Political science; Pharmacology","score_opus":0.02255550886581559,"score_gpt":0.2381163041885609,"score_spread":0.2155607953227453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406672111","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015080671,0.0027189723,0.51168025,0.0058016554,0.0069592246,0.00017466288,0.0019671812,0.0025397225,0.45307773],"genre_scores_gemma":[0.3649639,0.0028040637,0.3465194,0.0050370824,0.0022379656,0.000481332,0.0032806315,0.0027669522,0.27190864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985594,0.00025025994,0.00010712547,0.00033561455,0.0005928569,0.00015474072],"domain_scores_gemma":[0.99878556,0.00039439206,0.00007039795,0.00033661415,0.00031647147,0.000096658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001060751,0.00086190406,0.0009480023,0.0013883804,0.0020203365,0.0037550551,0.0017559838,0.0013879403,0.0527914],"category_scores_gemma":[0.0053693256,0.0005164184,0.00091995596,0.0017378035,0.0027637267,0.0068393946,0.0032923252,0.0038622275,0.019911379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006706829,0.000021955339,0.0001133555,0.000090843234,0.000006924853,0.00007374621,0.00010285497,0.0004332076,0.0009367119,0.9306186,0.033699255,0.033835415],"study_design_scores_gemma":[0.000025456855,0.00004023097,0.00014971444,0.000087258646,0.000018415656,0.0003067362,0.000099540695,0.004136807,0.0020244892,0.7971358,0.19594842,0.000027178236],"about_ca_topic_score_codex":0.0011979379,"about_ca_topic_score_gemma":0.0019089199,"teacher_disagreement_score":0.0527914,"about_ca_system_score_codex":0.0015207545,"about_ca_system_score_gemma":0.0008513843,"threshold_uncertainty_score":0.1766048},"labels":[],"label_agreement":null},{"id":"W2406672557","doi":"","title":"Permutations with interval cycles.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Permutation (music); Combinatorics; Interval (graph theory); Notation; Partition (number theory); Sequence (biology); Class (philosophy); Discrete mathematics; Set (abstract data type); Parity of a permutation; Arithmetic; Cyclic permutation; Symmetric group; Computer science","score_opus":0.037441877098813546,"score_gpt":0.32076729752742206,"score_spread":0.28332542042860853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406672557","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11589601,0.0068294173,0.5047737,0.0015740889,0.0025174331,0.000547464,0.001760198,0.00074590096,0.3653558],"genre_scores_gemma":[0.6321173,0.00642656,0.18287973,0.0018228408,0.0022522868,0.0013096991,0.0033669025,0.0007397147,0.16908495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848807,0.00039809122,0.00013756522,0.00032284652,0.00035149755,0.00030193734],"domain_scores_gemma":[0.9982734,0.0006281502,0.00040829665,0.00030322737,0.0002513709,0.0001355823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007433213,0.001045597,0.0005840253,0.0018587426,0.0017859889,0.003197215,0.00090306206,0.0013389016,0.02351387],"category_scores_gemma":[0.003957369,0.000521596,0.0014419649,0.0026262589,0.0019751075,0.0040158243,0.0018472343,0.00135985,0.005803118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003415814,0.000020752486,0.0002957792,0.00007459834,0.000010115362,0.00024652848,0.00023450311,0.0017742013,0.0008565648,0.97575325,0.003313102,0.017386585],"study_design_scores_gemma":[0.000018330931,0.00005791778,0.00024738265,0.000052692863,0.000015219167,0.00085051626,0.0001254497,0.0063269925,0.000972577,0.8937019,0.09760831,0.000022700535],"about_ca_topic_score_codex":0.0011757924,"about_ca_topic_score_gemma":0.0009956615,"teacher_disagreement_score":0.02351387,"about_ca_system_score_codex":0.0011151662,"about_ca_system_score_gemma":0.00073638995,"threshold_uncertainty_score":0.0786618},"labels":[],"label_agreement":null},{"id":"W2406685393","doi":"","title":"A Characterization on Potentially K 6 -E(K 3 )-graphic Sequences.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Characterization (materials science); Mathematics; Nanotechnology; Materials science","score_opus":0.010274289344532762,"score_gpt":0.2252204665717146,"score_spread":0.21494617722718184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406685393","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5226761,0.001309349,0.18312363,0.0017837475,0.00051772076,0.00017537315,0.0024718705,0.0013231776,0.28661898],"genre_scores_gemma":[0.8987579,0.00065183075,0.035236523,0.0004716556,0.0002108783,0.00013988861,0.0024179437,0.00031861418,0.06179477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994937,0.00007071254,0.000048951533,0.00010747325,0.00014678159,0.00013233814],"domain_scores_gemma":[0.9985214,0.0005964359,0.00024239815,0.00016509148,0.000230627,0.00024402456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002800462,0.0008204096,0.0004370133,0.0021004744,0.0012577646,0.0027853476,0.00072115683,0.00096888805,0.02549774],"category_scores_gemma":[0.0027753715,0.00038132555,0.0004818649,0.0018632468,0.0012783294,0.002541794,0.001866107,0.0015520044,0.0053266995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004998292,0.00008490506,0.0018655455,0.00025456815,0.000019229112,0.0010419392,0.0007508923,0.003168962,0.01292527,0.91178244,0.0097706495,0.05783581],"study_design_scores_gemma":[0.00006412441,0.00018566007,0.002894013,0.00017572712,0.000036605383,0.002658399,0.0006314808,0.013899682,0.008443257,0.9081305,0.06280347,0.000077151446],"about_ca_topic_score_codex":0.0007027478,"about_ca_topic_score_gemma":0.0009841308,"teacher_disagreement_score":0.02549774,"about_ca_system_score_codex":0.00069620874,"about_ca_system_score_gemma":0.00047821546,"threshold_uncertainty_score":0.08529842},"labels":[],"label_agreement":null},{"id":"W2406688209","doi":"","title":"Some Combinatorial Identities on the Stirling Number Based on a Probabilistic Model.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Stirling engine; Stirling number; Stirling numbers of the first kind; Probabilistic logic; Stirling numbers of the second kind; Bell polynomials; Combinatorics; Statistics; Physics; Thermodynamics","score_opus":0.0704612975315338,"score_gpt":0.3145788949942736,"score_spread":0.2441175974627398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406688209","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071802735,0.0062401216,0.6305096,0.0057473565,0.0020869137,0.00013792531,0.0010406444,0.0003620737,0.28207257],"genre_scores_gemma":[0.82569206,0.005930748,0.09388233,0.002374248,0.004789698,0.0003754627,0.001031705,0.00048016227,0.065443546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983581,0.00054663594,0.0000846893,0.00023580172,0.0005786975,0.00019607651],"domain_scores_gemma":[0.9945304,0.0034079005,0.00056104106,0.0005572271,0.0005221992,0.00042127026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034283248,0.0012504971,0.0013341024,0.0038260715,0.002292051,0.004161066,0.0027838198,0.0026062464,0.015758077],"category_scores_gemma":[0.011905415,0.00077845756,0.0027185627,0.002679325,0.0044851196,0.009326093,0.003521599,0.0058282367,0.0037914596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005885997,0.0000075565003,0.000051859075,0.00002225635,0.0000038324215,0.000034381155,0.00003603915,0.0009905689,0.000096696,0.99608994,0.0010412448,0.0016197155],"study_design_scores_gemma":[0.0000036050192,0.0000050413996,0.000056216988,0.000014575814,0.0000055689065,0.00006036134,0.00001149171,0.009237378,0.00006826204,0.9890169,0.001508661,0.000011939941],"about_ca_topic_score_codex":0.0011964571,"about_ca_topic_score_gemma":0.0010664718,"teacher_disagreement_score":0.015758077,"about_ca_system_score_codex":0.0020706633,"about_ca_system_score_gemma":0.001280543,"threshold_uncertainty_score":0.052716017},"labels":[],"label_agreement":null},{"id":"W2406707922","doi":"","title":"Two Constructions of Authentication Codes with Multiple Arbiters.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Authentication (law); Computer science; Computer security","score_opus":0.007116645898977458,"score_gpt":0.22987979319818552,"score_spread":0.22276314729920807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406707922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049271416,0.0006404631,0.86657023,0.0031759408,0.0014084915,0.00046540165,0.0006782797,0.003266656,0.07452306],"genre_scores_gemma":[0.6653919,0.0005404329,0.28058165,0.001138867,0.00041966757,0.0007184053,0.0005547145,0.000701366,0.04995298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960389,0.0010788399,0.0002964635,0.00052149047,0.001038775,0.0010253637],"domain_scores_gemma":[0.9917923,0.0026560333,0.00052906346,0.0032213337,0.0009363375,0.000864901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002428712,0.0013521069,0.0009372204,0.0016466383,0.0027855835,0.003156997,0.002047284,0.0025783437,0.009758721],"category_scores_gemma":[0.007927671,0.0008238295,0.0015822673,0.0015895049,0.003979041,0.0044261585,0.006676153,0.0035913766,0.0041399146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024534375,0.00007867214,0.00019347119,0.000089038294,0.000015143981,0.00018767756,0.00028411587,0.0024151148,0.003868212,0.96671194,0.0047253845,0.021185797],"study_design_scores_gemma":[0.00019430644,0.00019853788,0.00028001508,0.00013294102,0.000067336994,0.0007122925,0.00018210211,0.037564177,0.025037002,0.90062714,0.034811944,0.00019224554],"about_ca_topic_score_codex":0.0010174987,"about_ca_topic_score_gemma":0.0011879853,"teacher_disagreement_score":0.009758721,"about_ca_system_score_codex":0.0018852163,"about_ca_system_score_gemma":0.0031624804,"threshold_uncertainty_score":0.03264612},"labels":[],"label_agreement":null},{"id":"W2406728108","doi":"","title":"Integer-Magic Spectra of Sun Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; MAGIC (telescope); Integer (computer science); Combinatorics; Spectral line; Discrete mathematics; Astrophysics; Astronomy; Physics; Computer science","score_opus":0.013286494821636602,"score_gpt":0.22980663798093548,"score_spread":0.21652014315929888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406728108","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61933637,0.0016455576,0.11765344,0.0025540362,0.000366161,0.000050973398,0.0014820948,0.00060669234,0.25630474],"genre_scores_gemma":[0.9632648,0.00044989397,0.021307737,0.00029453557,0.00010514376,0.000036761878,0.0006486006,0.00011636943,0.013776178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996468,0.00008201613,0.00001870961,0.000085493375,0.00007852125,0.000088441055],"domain_scores_gemma":[0.9989654,0.00047700887,0.00016073039,0.00013527746,0.00009528084,0.00016625009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035783113,0.00033261222,0.0003775024,0.0014350271,0.0015168664,0.002211581,0.00074003823,0.0006793711,0.013749328],"category_scores_gemma":[0.0016884137,0.00029615551,0.00037059802,0.0009864852,0.0013101503,0.004002773,0.0012083206,0.0011985359,0.001198654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007852458,0.000022315096,0.00045576575,0.00005640922,0.0000057754555,0.000065609864,0.00015082982,0.0011266867,0.0015080652,0.98325044,0.0039338376,0.009345788],"study_design_scores_gemma":[0.00001636565,0.0000074137433,0.00037002368,0.0000182802,0.0000055806727,0.00013362114,0.00018788927,0.0050764005,0.0010871463,0.98859173,0.004497592,0.000007953361],"about_ca_topic_score_codex":0.00084999285,"about_ca_topic_score_gemma":0.0015187777,"teacher_disagreement_score":0.013749328,"about_ca_system_score_codex":0.00086237525,"about_ca_system_score_gemma":0.00040238223,"threshold_uncertainty_score":0.04599607},"labels":[],"label_agreement":null},{"id":"W2406758234","doi":"","title":"On b-coloring of cartesian product of graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Combinatorics; Mathematics; Chromatic scale; Brooks' theorem; Complete coloring; Vertex (graph theory); Graph coloring; Graph; Fractional coloring; Edge coloring; Discrete mathematics; Product (mathematics); Graph power; 1-planar graph; Chordal graph; Line graph; Geometry","score_opus":0.014121446160679224,"score_gpt":0.2284767205718585,"score_spread":0.21435527441117927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406758234","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40405822,0.008483126,0.46619907,0.0020049487,0.000559948,0.00016188492,0.00092072965,0.00036851125,0.117243655],"genre_scores_gemma":[0.81933963,0.0046257684,0.1536403,0.0006614822,0.00063957204,0.0002635197,0.0009031126,0.00026289045,0.01966368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985446,0.0005265265,0.00006944468,0.00038545404,0.00025521786,0.00021885954],"domain_scores_gemma":[0.99462056,0.003090158,0.0007027589,0.00053051405,0.00052308466,0.00053288357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019324237,0.0009280284,0.0007032868,0.002603781,0.001978435,0.0022651388,0.00082269084,0.0010319238,0.005998186],"category_scores_gemma":[0.0052719587,0.00065524934,0.00085186266,0.0032016584,0.0041140337,0.006469494,0.002559988,0.001832036,0.00095021375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007047511,0.000021518284,0.0010339598,0.00008391608,0.00001240512,0.000081131904,0.00038746156,0.0030309898,0.0011583247,0.98074645,0.002521518,0.010851877],"study_design_scores_gemma":[0.000021141028,0.00007194393,0.0009621246,0.000052432046,0.000019268613,0.0004983456,0.00021597232,0.014537315,0.0010396616,0.96464634,0.01790936,0.000025986481],"about_ca_topic_score_codex":0.002038201,"about_ca_topic_score_gemma":0.0014041857,"teacher_disagreement_score":0.005998186,"about_ca_system_score_codex":0.0017558184,"about_ca_system_score_gemma":0.000585538,"threshold_uncertainty_score":0.020065963},"labels":[],"label_agreement":null},{"id":"W2406758422","doi":"","title":"Global Defensive Alliances in the Join, Corona and Composition of Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Join (topology); Mathematics; Composition (language); Corona (planetary geology); Combinatorics; Astrobiology; Art; Physics","score_opus":0.014566551260108097,"score_gpt":0.24126506585155755,"score_spread":0.22669851459144946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406758422","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46528137,0.0020391757,0.32240224,0.005387355,0.0002637376,0.00019692289,0.00078387046,0.00058147794,0.20306383],"genre_scores_gemma":[0.91043836,0.000831392,0.05773724,0.0004126863,0.0001683312,0.00013530218,0.00058199256,0.00012276933,0.029571928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986387,0.0005037132,0.00006970158,0.0003382943,0.00019986232,0.0002497848],"domain_scores_gemma":[0.99418384,0.002876737,0.0007403801,0.00088566524,0.00031015975,0.0010032965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015882849,0.00039876142,0.00087266933,0.0011174089,0.0033284875,0.004377425,0.0010865342,0.0018493773,0.010187783],"category_scores_gemma":[0.006276843,0.0005094888,0.000856535,0.0015662316,0.0031467376,0.011385713,0.0034416607,0.0025404212,0.0011530909],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040974017,0.000021283695,0.00045692324,0.00003686074,0.000009023246,0.00005053896,0.00027612437,0.0017932525,0.00042438047,0.9885232,0.0018724928,0.006494858],"study_design_scores_gemma":[0.0000229994,0.00001849854,0.0004734057,0.000031055926,0.000024929375,0.00018505925,0.00059439143,0.009469907,0.0006307103,0.9784815,0.010054884,0.000012478015],"about_ca_topic_score_codex":0.0010764786,"about_ca_topic_score_gemma":0.0019476413,"teacher_disagreement_score":0.010187783,"about_ca_system_score_codex":0.0013772275,"about_ca_system_score_gemma":0.0008334094,"threshold_uncertainty_score":0.03408152},"labels":[],"label_agreement":null},{"id":"W2406786077","doi":"","title":"On The Properties Of New Families Of Pell And Pell-Lucas Numbers.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Lucas sequence; Lucas number; Recurrence relation; Combinatorics; Genealogy; Fibonacci number; Fibonacci polynomials; History","score_opus":0.012219270250112357,"score_gpt":0.22993139417829217,"score_spread":0.21771212392817982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406786077","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31954637,0.010609036,0.4709519,0.0021422433,0.0012345695,0.00026697575,0.0011903394,0.0007627768,0.19329579],"genre_scores_gemma":[0.89775455,0.00400004,0.0670498,0.0004775917,0.00078381196,0.00031751482,0.0008575722,0.00027211293,0.028486973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992538,0.00015191558,0.00004720356,0.00016942914,0.0002514856,0.00012617216],"domain_scores_gemma":[0.9976131,0.0011140011,0.00044933936,0.00020286387,0.00041566332,0.0002050912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009799597,0.000589345,0.00048583592,0.0029582796,0.0020582725,0.0016071368,0.0006404174,0.0009754349,0.008844938],"category_scores_gemma":[0.008154618,0.00037670395,0.00067944295,0.0014598172,0.0016000294,0.005319058,0.0010801706,0.001339843,0.0013351789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034156226,0.000009288455,0.0007153416,0.00008025294,0.0000071133627,0.00028709686,0.0004075052,0.0018212487,0.0026653996,0.9726847,0.0030635304,0.018224347],"study_design_scores_gemma":[0.000016892967,0.00005143456,0.0012900279,0.00005918653,0.000019436366,0.0024792973,0.00030968554,0.01597453,0.0032566148,0.9346992,0.041754637,0.00008899842],"about_ca_topic_score_codex":0.0007449591,"about_ca_topic_score_gemma":0.000677101,"teacher_disagreement_score":0.008844938,"about_ca_system_score_codex":0.0010639855,"about_ca_system_score_gemma":0.0005894956,"threshold_uncertainty_score":0.029589295},"labels":[],"label_agreement":null},{"id":"W2406787877","doi":"","title":"On constructions of infinite families of k-tight optimal double-loop networks.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Loop (graph theory); Double loop; Combinatorics; Business","score_opus":0.011532152093615858,"score_gpt":0.23139718019724215,"score_spread":0.2198650281036263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406787877","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15222308,0.0012643803,0.75902563,0.0008381923,0.00012358822,0.000114666385,0.0004507212,0.0010904553,0.08486929],"genre_scores_gemma":[0.8112981,0.0011633404,0.17166905,0.00032287164,0.000059991664,0.00030823026,0.0007182647,0.00039453266,0.014065697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992348,0.00024656876,0.00004430961,0.00013884366,0.00016772264,0.00016772967],"domain_scores_gemma":[0.99753606,0.0014277205,0.00022006201,0.00035999948,0.00023781716,0.00021827951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011103839,0.0006821575,0.0006720998,0.0011588422,0.0017413617,0.002098045,0.0014514303,0.00088683644,0.010180137],"category_scores_gemma":[0.0074193464,0.0007621167,0.00075326744,0.0012154191,0.0017983468,0.0041837576,0.0029619655,0.001969402,0.0014660422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000120059274,0.000047876663,0.0005509958,0.00018011466,0.00002381829,0.00015802201,0.00054620404,0.034192476,0.0027721312,0.92602175,0.004474998,0.030911494],"study_design_scores_gemma":[0.000034070046,0.00004747204,0.0003009748,0.00013903607,0.000028547332,0.00022216947,0.00026578695,0.093318485,0.0024040516,0.8909876,0.012217248,0.00003460934],"about_ca_topic_score_codex":0.0009120757,"about_ca_topic_score_gemma":0.0014283049,"teacher_disagreement_score":0.010180137,"about_ca_system_score_codex":0.0015959479,"about_ca_system_score_gemma":0.0006877201,"threshold_uncertainty_score":0.034056008},"labels":[],"label_agreement":null},{"id":"W2406793730","doi":"","title":"The minimal Kirchhoff index of graphs with k edge-disjoint cycles.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Disjoint sets; Enhanced Data Rates for GSM Evolution; Index (typography); Combinatorics; Computer science; Telecommunications","score_opus":0.014301038652346413,"score_gpt":0.25554152942606795,"score_spread":0.24124049077372153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406793730","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7279444,0.0016826033,0.060817122,0.0013711546,0.0005870368,0.00007868267,0.0014538093,0.000483229,0.20558204],"genre_scores_gemma":[0.98007065,0.0004612314,0.007640859,0.00012874432,0.0001498695,0.000049595656,0.00043417758,0.000094222436,0.01097055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960285,0.00006558211,0.00002901988,0.000085110376,0.000102401034,0.00011500375],"domain_scores_gemma":[0.9986707,0.00040124168,0.00024500804,0.00015374442,0.00019088892,0.00033844146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003649592,0.00043337344,0.00064807176,0.002934119,0.002011744,0.0028362817,0.0014844934,0.00091875636,0.010302557],"category_scores_gemma":[0.0033548945,0.00030520285,0.00036450196,0.0013938926,0.0016503525,0.0039084195,0.0015111652,0.001019195,0.0017330387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019017584,0.000047543504,0.0011520418,0.00009854137,0.000018072518,0.00012742013,0.00023287191,0.0021357334,0.0038682912,0.9735797,0.004316693,0.014232867],"study_design_scores_gemma":[0.000019599553,0.000022593116,0.0011054929,0.000034450615,0.000018009367,0.00028074943,0.0002293789,0.012381707,0.0023251176,0.9784762,0.0050800373,0.000026579768],"about_ca_topic_score_codex":0.0014707,"about_ca_topic_score_gemma":0.0016507627,"teacher_disagreement_score":0.010302557,"about_ca_system_score_codex":0.0011572338,"about_ca_system_score_gemma":0.00069829426,"threshold_uncertainty_score":0.034465432},"labels":[],"label_agreement":null},{"id":"W2406813510","doi":"","title":"Uniform cacti with extremal Wiener indices.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Meromorphic and Entire Functions","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Wiener index; Combinatorics","score_opus":0.07289193210773094,"score_gpt":0.2774850391055179,"score_spread":0.204593106997787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406813510","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35295725,0.0033032317,0.07486737,0.0020430747,0.0013985941,0.00006581585,0.00065271516,0.00067359896,0.56403846],"genre_scores_gemma":[0.90920234,0.0009975581,0.011176736,0.0003255219,0.000886255,0.00004990062,0.000371688,0.000255808,0.07673413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929833,0.000094832234,0.0000351262,0.00015435452,0.00025810793,0.00015914114],"domain_scores_gemma":[0.9988697,0.00030572372,0.00017959173,0.00018413347,0.00019266515,0.0002682268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059099,0.00083321956,0.00077881117,0.0028602472,0.0019233377,0.0034860256,0.0008765369,0.0010714424,0.014087536],"category_scores_gemma":[0.0044891434,0.0004564279,0.00048914953,0.0011981181,0.0024912236,0.0045509655,0.0026700115,0.0023045768,0.0023127925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025021784,0.00001254349,0.00022260727,0.000027185457,0.0000059983763,0.000118658674,0.000102168306,0.0003182647,0.0006201906,0.992297,0.0017586215,0.0044916733],"study_design_scores_gemma":[0.00001951797,0.000022347283,0.0011132756,0.000042227904,0.000019615058,0.00060645817,0.00013662907,0.0047984286,0.0013658869,0.9807802,0.011073866,0.00002163143],"about_ca_topic_score_codex":0.00074625155,"about_ca_topic_score_gemma":0.00086472026,"teacher_disagreement_score":0.014087536,"about_ca_system_score_codex":0.001393511,"about_ca_system_score_gemma":0.00045396524,"threshold_uncertainty_score":0.047127485},"labels":[],"label_agreement":null},{"id":"W2406826233","doi":"","title":"Further Results On Super Edge-Magic Deficiency Of Graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; MAGIC (telescope); Enhanced Data Rates for GSM Evolution; Combinatorics; Astrophysics; Computer science; Artificial intelligence; Physics","score_opus":0.02431516721843813,"score_gpt":0.22228861468510125,"score_spread":0.19797344746666312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406826233","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27126145,0.0065255803,0.24638848,0.017132089,0.0012108056,0.00012563489,0.0024231107,0.0010531773,0.45387968],"genre_scores_gemma":[0.8883048,0.0033117633,0.06784911,0.0033427742,0.00078485854,0.00011773849,0.0022852113,0.00033264695,0.03367097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992034,0.00020956036,0.0000346737,0.00016684743,0.00023089923,0.00015473232],"domain_scores_gemma":[0.9941947,0.0036257524,0.00034976093,0.00079961115,0.00049991073,0.0005303076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012944057,0.0007942663,0.0008879035,0.002145984,0.0013095152,0.0023557586,0.0013940366,0.0013322117,0.022527631],"category_scores_gemma":[0.0071676495,0.00047873653,0.00074922974,0.0024974141,0.0022578225,0.007593488,0.0025563377,0.0039005948,0.0019486127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001655874,0.00008411807,0.0017992238,0.00027503847,0.000020089981,0.00014469672,0.000285237,0.0031804394,0.002479363,0.94960356,0.01789871,0.024063954],"study_design_scores_gemma":[0.000023425764,0.000020293775,0.0007190368,0.000045845918,0.000017356233,0.00025787728,0.00015628492,0.0070395456,0.0010164874,0.97763515,0.013055057,0.000013639963],"about_ca_topic_score_codex":0.0013510598,"about_ca_topic_score_gemma":0.0018033509,"teacher_disagreement_score":0.022527631,"about_ca_system_score_codex":0.0012587694,"about_ca_system_score_gemma":0.0007141896,"threshold_uncertainty_score":0.075362444},"labels":[],"label_agreement":null},{"id":"W2406837711","doi":"","title":"Number of disjoint 5-cycles in graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Disjoint sets; Combinatorics","score_opus":0.012320935471179507,"score_gpt":0.293827753271477,"score_spread":0.28150681780029746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406837711","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7767359,0.0034226559,0.056495734,0.0041176896,0.00055673823,0.00015907788,0.006069099,0.0006232043,0.15181983],"genre_scores_gemma":[0.9568157,0.0010455666,0.02289216,0.00039622514,0.00016429875,0.00021012245,0.0024281756,0.0001213938,0.01592643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998689,0.00028869396,0.00011012073,0.00035809402,0.00031264927,0.00024147637],"domain_scores_gemma":[0.9944999,0.0029066815,0.00083193154,0.00041281982,0.00051268213,0.0008359885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084190594,0.0005766387,0.0007639952,0.003138466,0.0021950975,0.0040066037,0.002063685,0.0016762718,0.023412894],"category_scores_gemma":[0.0065114526,0.00058796984,0.00073704426,0.0019906368,0.0018363197,0.0044387374,0.0018041098,0.0011483314,0.0020567598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070172356,0.00014744751,0.010884917,0.00080492755,0.00020127602,0.00041124912,0.00076227763,0.0077426555,0.007789114,0.89253217,0.016245384,0.061776914],"study_design_scores_gemma":[0.00011268935,0.00009635118,0.005727921,0.00022206202,0.00018349537,0.001434641,0.00069159095,0.015911348,0.005619418,0.9420346,0.027912542,0.000053453598],"about_ca_topic_score_codex":0.0008441234,"about_ca_topic_score_gemma":0.0015824707,"teacher_disagreement_score":0.023412894,"about_ca_system_score_codex":0.0012310592,"about_ca_system_score_gemma":0.00086801534,"threshold_uncertainty_score":0.0783239},"labels":[],"label_agreement":null},{"id":"W2406840950","doi":"","title":"On the interior H-points of H-polygons.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematics and Applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Geometry","score_opus":0.06548402835300934,"score_gpt":0.3150770994044432,"score_spread":0.24959307105143383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406840950","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32696518,0.00486852,0.31689763,0.002305065,0.00097223325,0.00016959412,0.0018068306,0.00041094908,0.34560403],"genre_scores_gemma":[0.8372081,0.004014505,0.08732498,0.0007852141,0.0009125041,0.00015917503,0.0019398924,0.00042339455,0.06723229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939907,0.00016608372,0.000025966685,0.00011264289,0.00016384991,0.00013242637],"domain_scores_gemma":[0.99882835,0.0005310494,0.00017192279,0.0001397188,0.00016800861,0.00016094546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052482716,0.00073451933,0.0010672027,0.0025727616,0.0016936903,0.0027587845,0.0010459044,0.0009203469,0.013326898],"category_scores_gemma":[0.0039666537,0.00059745036,0.00087573135,0.0015112069,0.00414314,0.003223497,0.0035392246,0.0042962697,0.0035056218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019769573,0.00004794971,0.0012489918,0.00015716933,0.000027532496,0.00039790434,0.00056230207,0.004409537,0.0016471064,0.9500956,0.0064811185,0.034727056],"study_design_scores_gemma":[0.000038314512,0.000037274363,0.00080811867,0.000073916715,0.000019743284,0.00034677534,0.00043522613,0.007861644,0.00092914276,0.9782314,0.011200304,0.000018161154],"about_ca_topic_score_codex":0.0018902556,"about_ca_topic_score_gemma":0.0019202553,"teacher_disagreement_score":0.013326898,"about_ca_system_score_codex":0.00089753646,"about_ca_system_score_gemma":0.00037640778,"threshold_uncertainty_score":0.044582963},"labels":[],"label_agreement":null},{"id":"W2406857893","doi":"","title":"λ-Designs with Two Block Sizes II.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Block (permutation group theory); Arithmetic; Combinatorics","score_opus":0.007694619601587805,"score_gpt":0.20159603403396145,"score_spread":0.19390141443237366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406857893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12981592,0.00086542714,0.7016285,0.0014611002,0.0007693357,0.00056483527,0.0012393668,0.0018552841,0.16180022],"genre_scores_gemma":[0.7192538,0.0005614263,0.23546457,0.00090057356,0.00023689611,0.0009082178,0.00046696016,0.00023036252,0.041977238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99795663,0.00073984195,0.0001235503,0.00032736306,0.00045738625,0.00039511145],"domain_scores_gemma":[0.9959883,0.0016232736,0.0003316666,0.0011422082,0.0006053635,0.00030921833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016190582,0.0006448458,0.00047122268,0.000770288,0.0010831687,0.001997341,0.000776583,0.0011834449,0.014068903],"category_scores_gemma":[0.005128376,0.0005284993,0.00051617954,0.00056848326,0.0012838953,0.001924656,0.0014041248,0.0011933686,0.003905621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080901873,0.00016579253,0.0006446216,0.00027474598,0.0000538209,0.00016053462,0.00018148121,0.007277285,0.023312327,0.8997384,0.00880665,0.058575347],"study_design_scores_gemma":[0.00032410613,0.00054969924,0.0007236653,0.0001728289,0.00008077709,0.00056526344,0.00016249945,0.04397199,0.032899145,0.8708936,0.049563795,0.000092590024],"about_ca_topic_score_codex":0.0005831223,"about_ca_topic_score_gemma":0.0008169323,"teacher_disagreement_score":0.014068903,"about_ca_system_score_codex":0.000983896,"about_ca_system_score_gemma":0.0014144004,"threshold_uncertainty_score":0.04706514},"labels":[],"label_agreement":null},{"id":"W2406858909","doi":"","title":"The maximum Sum-Balaban index of trees with given diameter.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Combinatorics; Statistics; Computer science","score_opus":0.014088627495174292,"score_gpt":0.24614539956981885,"score_spread":0.23205677207464456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406858909","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6624225,0.005507781,0.16283436,0.0031241984,0.00070825935,0.000072452356,0.0025905296,0.00088522834,0.16185474],"genre_scores_gemma":[0.957905,0.0011604304,0.027814547,0.00031014695,0.00036608422,0.000085351356,0.00083165267,0.0002469321,0.011279819],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919754,0.00022569868,0.000054476597,0.00017100765,0.00020047674,0.00015082206],"domain_scores_gemma":[0.99481934,0.0028403143,0.00056562154,0.00054117665,0.00050578936,0.0007277763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014179433,0.0005080289,0.0012550128,0.0027471285,0.001986507,0.004884931,0.0016694361,0.0013495845,0.006184394],"category_scores_gemma":[0.011710353,0.0004180219,0.00047434447,0.0023998602,0.0019373188,0.0069088684,0.0022755328,0.0018279708,0.0016521041],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035876207,0.00004722637,0.001803614,0.00020207773,0.000029811612,0.00008901751,0.000400359,0.0056651817,0.0037146045,0.9565919,0.0074069817,0.02369039],"study_design_scores_gemma":[0.000026127056,0.000040587463,0.00078145537,0.000055556644,0.000030063167,0.00032807584,0.0002184781,0.020348093,0.002124908,0.9687571,0.007267209,0.000022405955],"about_ca_topic_score_codex":0.00053919764,"about_ca_topic_score_gemma":0.0007879925,"teacher_disagreement_score":0.006184394,"about_ca_system_score_codex":0.0016104861,"about_ca_system_score_gemma":0.0007468509,"threshold_uncertainty_score":0.020688891},"labels":[],"label_agreement":null},{"id":"W2406906987","doi":"","title":"Colourfully panconnected subgraphs II.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Graph; Order (exchange); Vertex connectivity; Discrete mathematics","score_opus":0.01684305340759623,"score_gpt":0.2724569552815831,"score_spread":0.25561390187398686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406906987","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75596625,0.0018452571,0.11946135,0.000818372,0.00024547178,0.00040582786,0.0045265215,0.00075257197,0.11597844],"genre_scores_gemma":[0.93201876,0.0007494163,0.040609907,0.00037733253,0.00010143736,0.00018208123,0.004340889,0.000107706044,0.021512583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994143,0.00006360834,0.000038301867,0.00021914481,0.000118719356,0.00014607563],"domain_scores_gemma":[0.9987923,0.00026434264,0.00028424678,0.00027596948,0.00019337896,0.00018980188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021179467,0.0004011314,0.0003019218,0.00066457427,0.00082481926,0.0012818535,0.00067396276,0.0005730538,0.006476409],"category_scores_gemma":[0.001241033,0.00037972344,0.0004933634,0.00092014484,0.00077181164,0.0012190302,0.0011430635,0.0008271896,0.0012569819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014662696,0.00021409601,0.019207338,0.0012838573,0.00014510562,0.0026685533,0.0018138782,0.015710216,0.13744019,0.65977776,0.019137327,0.14113533],"study_design_scores_gemma":[0.0001240734,0.00044529405,0.025612801,0.00017971665,0.00021967413,0.008709547,0.00084848225,0.036699392,0.055015095,0.7572935,0.11476067,0.00009166099],"about_ca_topic_score_codex":0.001168999,"about_ca_topic_score_gemma":0.001638998,"teacher_disagreement_score":0.006476409,"about_ca_system_score_codex":0.00063185557,"about_ca_system_score_gemma":0.00032840326,"threshold_uncertainty_score":0.021665752},"labels":[],"label_agreement":null},{"id":"W2406907246","doi":"","title":"Umbral calculus and invariant sequences.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Algebraic and Geometric Analysis","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Invariant (physics); Calculus (dental); Pure mathematics; Mathematical physics; Medicine; Orthodontics","score_opus":0.04891664942570296,"score_gpt":0.26746127399458103,"score_spread":0.21854462456887808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406907246","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10144684,0.019654639,0.19026384,0.005473864,0.001970981,0.000057690824,0.00068673975,0.00044263244,0.6800028],"genre_scores_gemma":[0.8637269,0.0055071823,0.033438828,0.0011240824,0.0019442667,0.000068612346,0.000574069,0.00015789036,0.093458176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989938,0.000305253,0.000049311497,0.00015196501,0.0003522489,0.00014741377],"domain_scores_gemma":[0.9990435,0.00029884776,0.00014585958,0.00013719604,0.00021272573,0.00016179292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011392409,0.0006776691,0.00072060764,0.0028093022,0.0023693137,0.0034519634,0.0009784787,0.0008126542,0.010996278],"category_scores_gemma":[0.003499218,0.00022981371,0.0007236997,0.0018833023,0.003273309,0.0053538545,0.0024068616,0.0023698052,0.002294284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063613934,0.000004918123,0.000062988256,0.00001248652,0.0000025728323,0.000022194385,0.00006353981,0.00011913455,0.000119863456,0.9953762,0.000990072,0.0032196392],"study_design_scores_gemma":[0.0000034472948,0.000006065084,0.00012792098,0.000010878396,0.0000039916927,0.00004510458,0.000054067095,0.0008031093,0.00013128377,0.99166006,0.007149787,0.0000043442947],"about_ca_topic_score_codex":0.0018179042,"about_ca_topic_score_gemma":0.002053476,"teacher_disagreement_score":0.010996278,"about_ca_system_score_codex":0.0020717266,"about_ca_system_score_gemma":0.00072715554,"threshold_uncertainty_score":0.0367862},"labels":[],"label_agreement":null},{"id":"W2406936419","doi":"","title":"External Difference Families over GF(q 2k ).","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics; Combinatorics","score_opus":0.00790448847446348,"score_gpt":0.21598888469067273,"score_spread":0.20808439621620925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406936419","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34144706,0.001713297,0.39114112,0.003170936,0.0008046278,0.00025331273,0.0023427093,0.001863435,0.2572635],"genre_scores_gemma":[0.91466165,0.0007358415,0.034665015,0.0007054925,0.0003053737,0.00020720396,0.0013410328,0.00031388478,0.04706447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983908,0.00043689122,0.00008933748,0.00024782927,0.00045521915,0.0003798844],"domain_scores_gemma":[0.9975389,0.0009905157,0.00029531555,0.0006522778,0.00033911286,0.0001838857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00134087,0.00055913744,0.0006360327,0.001521202,0.0014341049,0.0019759068,0.0008096625,0.0006310669,0.02100558],"category_scores_gemma":[0.004229109,0.0002874934,0.00057879003,0.001572409,0.0015767268,0.0037780632,0.002924348,0.0016458797,0.005075607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008086387,0.000135516,0.001420618,0.00020865828,0.000034530636,0.0003942174,0.00038645952,0.0033087535,0.008493632,0.9190125,0.009140599,0.0566559],"study_design_scores_gemma":[0.00029060716,0.00021865875,0.0012911225,0.00024485166,0.00006650672,0.0017426673,0.00037027898,0.017252803,0.03074036,0.87246627,0.07521735,0.000098665376],"about_ca_topic_score_codex":0.00031045923,"about_ca_topic_score_gemma":0.0003771488,"teacher_disagreement_score":0.02100558,"about_ca_system_score_codex":0.000992799,"about_ca_system_score_gemma":0.00079695653,"threshold_uncertainty_score":0.07027066},"labels":[],"label_agreement":null},{"id":"W2406936546","doi":"","title":"On Vertex-Robust Identifying Codes of Level Three.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Graph","score_opus":0.03658330796721529,"score_gpt":0.2541426917889521,"score_spread":0.2175593838217368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406936546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35772085,0.0016971224,0.43599412,0.0026421992,0.0005335152,0.00013745675,0.0012523931,0.0012083263,0.19881403],"genre_scores_gemma":[0.9313839,0.0008414347,0.042994644,0.00067749043,0.00022761253,0.00010635295,0.00069033314,0.00026659574,0.022811713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870574,0.00032255985,0.000059957743,0.00014819375,0.0004513725,0.00031215756],"domain_scores_gemma":[0.99511355,0.0023421056,0.00072148634,0.0010143962,0.00047983017,0.00032860218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008865492,0.00054823275,0.0006239955,0.0016139223,0.0014063811,0.0021110384,0.0010008767,0.0013647928,0.005424226],"category_scores_gemma":[0.006961887,0.0003421463,0.0005793262,0.0013206803,0.0025443921,0.0030395298,0.003114647,0.0025226658,0.0019891378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007041584,0.000017719962,0.00030934287,0.000036114743,0.0000071987147,0.00008921206,0.00012110609,0.0051382696,0.0011029165,0.98096704,0.0026631427,0.009477466],"study_design_scores_gemma":[0.000009510284,0.000018138539,0.00014169572,0.000025643627,0.000006198111,0.00010907687,0.00005323384,0.016797027,0.0010793998,0.9790055,0.0027379184,0.000016582686],"about_ca_topic_score_codex":0.0012153919,"about_ca_topic_score_gemma":0.0011223038,"teacher_disagreement_score":0.005424226,"about_ca_system_score_codex":0.0010880926,"about_ca_system_score_gemma":0.0009019356,"threshold_uncertainty_score":0.01814586},"labels":[],"label_agreement":null},{"id":"W2406945348","doi":"","title":"Full cycle extendability of triangularly connected almost claw-free graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Claw; Mathematics; Combinatorics; Structural engineering; Engineering","score_opus":0.011092520383730512,"score_gpt":0.2691681834380562,"score_spread":0.2580756630543257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406945348","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80428344,0.00042930897,0.08349079,0.000501912,0.00007363504,0.000057662968,0.0008771937,0.0005512071,0.10973483],"genre_scores_gemma":[0.984148,0.00016999814,0.0054323687,0.00010817556,0.000030498994,0.000023732962,0.0005828706,0.00005646567,0.009447855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997218,0.00003424295,0.000012813973,0.000080044956,0.00007648811,0.00007445735],"domain_scores_gemma":[0.99869823,0.0005062077,0.00014333644,0.0002509769,0.0001596411,0.0002415742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022261494,0.0002587309,0.00027837206,0.00073510996,0.0007509706,0.0011427047,0.0006510659,0.0004928643,0.012630478],"category_scores_gemma":[0.0019074804,0.00025198195,0.00033302978,0.00074292545,0.0009054577,0.0023506584,0.0014801337,0.0009038825,0.0007859992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001979974,0.00007237014,0.0016572415,0.00014969238,0.000025041789,0.00053647714,0.0008580159,0.005380257,0.013425616,0.93533355,0.0039668675,0.038396973],"study_design_scores_gemma":[0.000021343805,0.000039447015,0.001317548,0.000024982486,0.000021789823,0.00041332707,0.00026515205,0.01148069,0.005076653,0.97477233,0.00655083,0.00001603705],"about_ca_topic_score_codex":0.0012443259,"about_ca_topic_score_gemma":0.0014810059,"teacher_disagreement_score":0.012630478,"about_ca_system_score_codex":0.00035222666,"about_ca_system_score_gemma":0.00020947844,"threshold_uncertainty_score":0.042253196},"labels":[],"label_agreement":null},{"id":"W2406959043","doi":"","title":"Some Identities Of Symmetry For Carlitz q-Bernoulli Polynomials Invariant Under S 4 .","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Invariant (physics); Pure mathematics; Symmetry (geometry); Bernoulli's principle; Algebra over a field; Mathematical physics; Geometry; Physics","score_opus":0.07598120615535635,"score_gpt":0.33348510025445216,"score_spread":0.2575038940990958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406959043","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36965823,0.0030421363,0.13143504,0.005170224,0.0016469532,0.00016398994,0.0009977483,0.000319376,0.48756632],"genre_scores_gemma":[0.9337303,0.0011706826,0.018347472,0.0007951123,0.0009295795,0.00010538213,0.0004345465,0.000111986505,0.044375036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939454,0.00015352723,0.000031066298,0.0000708162,0.00021806163,0.00013199027],"domain_scores_gemma":[0.9992337,0.00022465352,0.0001356095,0.00008638958,0.00016938665,0.00015027447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012665741,0.00050807686,0.00047570508,0.0016189974,0.0018459002,0.002123923,0.00070358545,0.00097167195,0.011353581],"category_scores_gemma":[0.0024625852,0.00036090147,0.0009670058,0.0011182943,0.002476307,0.0029903853,0.0015195531,0.002039836,0.0021067886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010061709,0.000010049712,0.00010712397,0.000013607209,0.0000017622721,0.00005371639,0.000092615715,0.00015043684,0.00034501674,0.9953394,0.0014118245,0.0024643776],"study_design_scores_gemma":[0.0000110078345,0.0000129438795,0.00028489658,0.000008563342,0.0000030927501,0.00010465199,0.000059568545,0.00181109,0.0002755722,0.994286,0.0031331307,0.000009464745],"about_ca_topic_score_codex":0.0016584527,"about_ca_topic_score_gemma":0.0012569443,"teacher_disagreement_score":0.011353581,"about_ca_system_score_codex":0.0014626503,"about_ca_system_score_gemma":0.001094386,"threshold_uncertainty_score":0.03798151},"labels":[],"label_agreement":null},{"id":"W2406975124","doi":"","title":"The exponents of double vertex graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Graph","score_opus":0.027384973600296222,"score_gpt":0.29142627137063637,"score_spread":0.26404129777034013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406975124","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49552092,0.0082439585,0.10069031,0.0065216566,0.003349998,0.000099053854,0.0008987458,0.0005415277,0.38413382],"genre_scores_gemma":[0.95199895,0.0023962685,0.0092979865,0.00045133985,0.0009877809,0.000055305616,0.00023128199,0.00017934166,0.034401737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996209,0.0001047176,0.000020171481,0.00005648638,0.00011128733,0.00008647383],"domain_scores_gemma":[0.9978296,0.0009228295,0.0003977137,0.00020998114,0.00027996858,0.0003597268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052408304,0.00078530813,0.0005274244,0.0029838162,0.001185945,0.0026627963,0.00060706603,0.0007620084,0.010558247],"category_scores_gemma":[0.0058219796,0.00036233058,0.00039463976,0.0008950245,0.0021866653,0.0043813256,0.0018441405,0.0020057352,0.0019644613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047968475,0.000011595238,0.00041339287,0.000064967535,0.0000067463834,0.00019783516,0.00021021478,0.00055605225,0.0011573005,0.9858511,0.003573331,0.007909533],"study_design_scores_gemma":[0.00001828745,0.000014524542,0.00044406374,0.000063299776,0.000009861747,0.0003156907,0.00019454243,0.0031060218,0.00074417307,0.9841591,0.010918193,0.000012233305],"about_ca_topic_score_codex":0.0004690279,"about_ca_topic_score_gemma":0.0006711006,"teacher_disagreement_score":0.010558247,"about_ca_system_score_codex":0.00084713905,"about_ca_system_score_gemma":0.0003203676,"threshold_uncertainty_score":0.035320878},"labels":[],"label_agreement":null},{"id":"W2407009606","doi":"","title":"The Cayley digraph associated to the Kautz digraph.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Digraph; Mathematics; Combinatorics","score_opus":0.014421888408352918,"score_gpt":0.2671424952072362,"score_spread":0.2527206067988833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407009606","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27538177,0.002184986,0.14127806,0.0027155168,0.0009299066,0.00013768756,0.002823031,0.0007203024,0.5738288],"genre_scores_gemma":[0.89375085,0.0013372761,0.019175466,0.0007069762,0.00020520372,0.0000710311,0.0012510145,0.00014083688,0.08336121],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99979156,0.00004368015,0.000009315753,0.000056976773,0.000045798584,0.00005277899],"domain_scores_gemma":[0.99934834,0.00016492596,0.00008798416,0.00007963062,0.00016387503,0.00015508127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001625996,0.00032150978,0.00034423402,0.001490109,0.0016344221,0.003315946,0.00058801664,0.0008300894,0.0151349995],"category_scores_gemma":[0.0010973864,0.0002787343,0.0002574857,0.0012644515,0.0012833452,0.0027290585,0.001064015,0.0013150107,0.0029737826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001535593,0.0000079904585,0.00013791451,0.000023069992,0.000004333446,0.00008954776,0.000085418134,0.0002896233,0.00058578345,0.99176896,0.0026120634,0.004379872],"study_design_scores_gemma":[0.000012607199,0.000010884276,0.00037432797,0.000018145192,0.000010289519,0.0002516069,0.00017973527,0.0026894447,0.0007155981,0.970021,0.025702577,0.000013728567],"about_ca_topic_score_codex":0.002959996,"about_ca_topic_score_gemma":0.0041126977,"teacher_disagreement_score":0.0151349995,"about_ca_system_score_codex":0.0011234231,"about_ca_system_score_gemma":0.0007732541,"threshold_uncertainty_score":0.050631583},"labels":[],"label_agreement":null},{"id":"W2407010454","doi":"","title":"Weighted Composition Operators On Musielak-Orlicz Spaces.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Banach Space Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Composition (language); Pure mathematics; Linguistics","score_opus":0.019701195169616288,"score_gpt":0.28846814155304046,"score_spread":0.2687669463834242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407010454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2544319,0.0045660967,0.52194005,0.0020728656,0.000788122,0.00008978383,0.00046382542,0.00036362352,0.2152837],"genre_scores_gemma":[0.81174064,0.0022621204,0.10117247,0.0005126191,0.00042199882,0.00013213573,0.00035994785,0.00018519237,0.08321288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994272,0.00014954337,0.000038682814,0.000095170915,0.00019875144,0.0000906613],"domain_scores_gemma":[0.9994011,0.00014663632,0.00009683237,0.00006445139,0.0001548698,0.00013606572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093309424,0.0006415906,0.0004395856,0.0017196237,0.0010383877,0.0017509309,0.00051820074,0.0005290938,0.0055245734],"category_scores_gemma":[0.0017462457,0.00022948044,0.00051647995,0.0010835687,0.0013727648,0.004432309,0.0023768253,0.0015097434,0.0009835272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021479942,0.00001003522,0.00010567012,0.000023139883,0.0000067484525,0.000038194397,0.00010598541,0.0002818491,0.0013362949,0.9907895,0.0006658509,0.006615434],"study_design_scores_gemma":[0.000009573976,0.000023055565,0.0002739281,0.00001782347,0.000013780243,0.00014625514,0.00015836726,0.0044774115,0.0012971305,0.9827868,0.010784827,0.00001105716],"about_ca_topic_score_codex":0.000545299,"about_ca_topic_score_gemma":0.00072827976,"teacher_disagreement_score":0.0055245734,"about_ca_system_score_codex":0.0008135476,"about_ca_system_score_gemma":0.0004217009,"threshold_uncertainty_score":0.018481553},"labels":[],"label_agreement":null},{"id":"W2407014563","doi":"","title":"The PI Index of Gated Amalgam.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Amalgam (chemistry); Mathematics; Index (typography); Pi; Statistics; Geometry; Chemistry; Computer science; World Wide Web","score_opus":0.009923892266603762,"score_gpt":0.23517233029302723,"score_spread":0.22524843802642347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407014563","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22307794,0.002130422,0.19581702,0.002610839,0.0023935006,0.00015782686,0.0011402256,0.001936979,0.5707353],"genre_scores_gemma":[0.8710022,0.00083710504,0.046374563,0.0011806475,0.0006652057,0.00021595368,0.0007918408,0.00080153084,0.07813094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912554,0.00014231657,0.000055746747,0.00017066022,0.00023911447,0.00026654344],"domain_scores_gemma":[0.99868494,0.0003556627,0.00015833143,0.00031475985,0.00020277663,0.00028352617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067097467,0.0005901215,0.00082014815,0.002313981,0.003055374,0.0044591604,0.0014390437,0.0012457749,0.029638682],"category_scores_gemma":[0.004511801,0.00037782136,0.00063635886,0.001982032,0.0031698775,0.007056645,0.0034301989,0.002453391,0.006110922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009913895,0.000025262803,0.0002660507,0.000042516873,0.0000068910904,0.00006021402,0.00011437058,0.00037688343,0.00088560855,0.977005,0.004503191,0.016614832],"study_design_scores_gemma":[0.000013734235,0.000032790555,0.00027357077,0.000033192424,0.0000106782745,0.00016441233,0.000080160185,0.0034866238,0.0016451223,0.97625834,0.017982768,0.00001852509],"about_ca_topic_score_codex":0.00081514416,"about_ca_topic_score_gemma":0.00095998595,"teacher_disagreement_score":0.029638682,"about_ca_system_score_codex":0.0014086256,"about_ca_system_score_gemma":0.0009462625,"threshold_uncertainty_score":0.09915125},"labels":[],"label_agreement":null},{"id":"W2407019363","doi":"","title":"The Wiener-type indices of the corona of two graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Type (biology); Corona (planetary geology); Combinatorics; Physics; Geology; Astrobiology","score_opus":0.02840760911434877,"score_gpt":0.3027431880251227,"score_spread":0.2743355789107739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407019363","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5709826,0.0026056583,0.13165836,0.0017223106,0.0013634957,0.000065136024,0.00079507317,0.00028721645,0.2905201],"genre_scores_gemma":[0.95945364,0.0008004009,0.018588569,0.00030636817,0.0004958218,0.00005845076,0.00034172754,0.00013733552,0.0198177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943846,0.0001567703,0.000036138343,0.00011125726,0.00014014094,0.000117242984],"domain_scores_gemma":[0.99857426,0.00041680367,0.00025144903,0.0001784126,0.0002484888,0.0003306667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008072639,0.0005995324,0.00066951,0.0031923493,0.0016647887,0.0034722148,0.00089398294,0.0014937886,0.006412702],"category_scores_gemma":[0.0041575446,0.00043467464,0.0006794248,0.0013355929,0.0028029908,0.005744734,0.0018752624,0.0016301777,0.0013014779],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026553515,0.000009206883,0.00031631312,0.000017040435,0.0000058419796,0.00005838022,0.0001208012,0.00025378278,0.00093632314,0.9942431,0.0008709905,0.0031415657],"study_design_scores_gemma":[0.000011292705,0.000017251305,0.0008217522,0.000027938679,0.000010567316,0.00026288934,0.00015532468,0.0032803214,0.00069131976,0.9907391,0.003964829,0.000017406499],"about_ca_topic_score_codex":0.0005511879,"about_ca_topic_score_gemma":0.00074673776,"teacher_disagreement_score":0.006412702,"about_ca_system_score_codex":0.0011149712,"about_ca_system_score_gemma":0.00044223873,"threshold_uncertainty_score":0.021452665},"labels":[],"label_agreement":null},{"id":"W2407053998","doi":"","title":"n-Colour Even Compositions.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Color Science and Applications","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.006969700167460536,"score_gpt":0.23705929335273354,"score_spread":0.230089593185273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407053998","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056979004,0.0011040512,0.15907651,0.0015773992,0.002495577,0.00016284476,0.0016562758,0.0017958159,0.7751525],"genre_scores_gemma":[0.48988068,0.0014838956,0.10193969,0.002037508,0.00068925077,0.00022384273,0.0023308427,0.0024503386,0.39896396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902654,0.00020443088,0.000055613786,0.00022000316,0.000258916,0.00023446344],"domain_scores_gemma":[0.9992205,0.00019975004,0.00007072814,0.00021169396,0.00017113653,0.00012612213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009766091,0.001068032,0.00068645296,0.0012461435,0.0023346648,0.002544172,0.000941525,0.00081206247,0.03691992],"category_scores_gemma":[0.0021191037,0.00044411444,0.0010007137,0.00089163973,0.0018938368,0.004250549,0.0032372784,0.0016549953,0.012591653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001950881,0.000048224876,0.0004188881,0.00013803258,0.000025709314,0.00037484555,0.00018561634,0.00037913717,0.005167891,0.9441848,0.015163659,0.033718217],"study_design_scores_gemma":[0.000028204826,0.000015433523,0.00042377724,0.000048815058,0.000034436925,0.0006199886,0.00013439661,0.0014411001,0.005794616,0.8588614,0.13256744,0.000030439269],"about_ca_topic_score_codex":0.0012242665,"about_ca_topic_score_gemma":0.0026156004,"teacher_disagreement_score":0.03691992,"about_ca_system_score_codex":0.0012177716,"about_ca_system_score_gemma":0.00073120644,"threshold_uncertainty_score":0.12350947},"labels":[],"label_agreement":null},{"id":"W2407064758","doi":"","title":"A Family of Chromatically Unique 6-bridge Graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bridge (graph theory); Combinatorics; Medicine","score_opus":0.006194934746990607,"score_gpt":0.19794748961370587,"score_spread":0.19175255486671527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407064758","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49499518,0.0023788197,0.15995346,0.0024602578,0.0005132002,0.0001517121,0.0023519523,0.0009478032,0.3362476],"genre_scores_gemma":[0.9114039,0.00093007064,0.035601072,0.0005832881,0.000095292286,0.0001126966,0.0018544494,0.00016336961,0.049255807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970275,0.000050485454,0.000009755629,0.00009191528,0.00007319325,0.00007184715],"domain_scores_gemma":[0.9991897,0.00029642836,0.00011829659,0.00011527063,0.00012436845,0.00015598183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026711175,0.00037338608,0.00025791297,0.0013287149,0.0016240707,0.0012615564,0.0007417967,0.00089226605,0.014328421],"category_scores_gemma":[0.0013719413,0.0003246865,0.0003607697,0.0008496807,0.0007361654,0.0015322056,0.0011604279,0.0011733896,0.0018344495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010687976,0.000053563734,0.0012549238,0.00010345743,0.00002476371,0.0006961248,0.0004745597,0.0019012328,0.006323943,0.9465421,0.01324475,0.02927369],"study_design_scores_gemma":[0.000059435457,0.00006787865,0.0031086658,0.000101889855,0.000037533224,0.00306709,0.0006489999,0.013065959,0.00455292,0.8684662,0.10677877,0.00004467492],"about_ca_topic_score_codex":0.0007353857,"about_ca_topic_score_gemma":0.0012867117,"teacher_disagreement_score":0.014328421,"about_ca_system_score_codex":0.00068750384,"about_ca_system_score_gemma":0.0004048395,"threshold_uncertainty_score":0.04793334},"labels":[],"label_agreement":null},{"id":"W2407067407","doi":"","title":"Doubly transitive parabolic ovals in affine planes of even order n ≤ 64.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematics and Applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Affine transformation; Transitive relation; Order (exchange); Affine plane (incidence geometry); Pure mathematics; Combinatorics","score_opus":0.03793097320938357,"score_gpt":0.3131842519261724,"score_spread":0.27525327871678884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407067407","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8192663,0.0006512906,0.04019514,0.00064062665,0.0002732888,0.00007755502,0.0008001837,0.000224884,0.1378707],"genre_scores_gemma":[0.9653305,0.0003652741,0.0063929544,0.0000855453,0.00007863048,0.000033310756,0.00044619374,0.00007425043,0.02719347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996068,0.00007531852,0.000026557558,0.00006615343,0.00009502024,0.00013025384],"domain_scores_gemma":[0.99961495,0.00007488725,0.000120858844,0.00005696915,0.000042343632,0.00009004958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028786887,0.00046957834,0.00032912413,0.0009769055,0.0011807662,0.002080031,0.00038876964,0.00043418637,0.008715289],"category_scores_gemma":[0.0007558474,0.00034415346,0.0004372179,0.0006288697,0.0017658535,0.0021003615,0.00199396,0.00083007076,0.0016316645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033983123,0.0000366143,0.0019169106,0.00008438812,0.000022864559,0.0009602403,0.0009010804,0.0015140189,0.008618328,0.9680454,0.0031229327,0.014437457],"study_design_scores_gemma":[0.00010048739,0.00015921562,0.004269568,0.00007100781,0.00003601869,0.0011644303,0.0016940172,0.006196478,0.010228676,0.94014484,0.035888195,0.000046980498],"about_ca_topic_score_codex":0.0016641818,"about_ca_topic_score_gemma":0.0019129472,"teacher_disagreement_score":0.008715289,"about_ca_system_score_codex":0.000748054,"about_ca_system_score_gemma":0.00043337856,"threshold_uncertainty_score":0.029155612},"labels":[],"label_agreement":null},{"id":"W2407067553","doi":"","title":"A kind of identities for generalized q-harmonic numbers and reciprocals of q-binomial coefficients.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Binomial coefficient; Harmonic number; Binomial (polynomial); Negative binomial distribution; Gaussian binomial coefficient; Harmonic; Statistics; Pure mathematics; Discrete mathematics; Poisson distribution; Riemann hypothesis","score_opus":0.07337266772921572,"score_gpt":0.3423084657564692,"score_spread":0.26893579802725354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407067553","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08698006,0.0044598537,0.32469273,0.008091609,0.0057558767,0.00010663117,0.00068008987,0.00053123536,0.56870186],"genre_scores_gemma":[0.8021853,0.00298124,0.07476524,0.0042893025,0.003130543,0.00017583705,0.0004593813,0.00031899137,0.11169409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990274,0.00023016213,0.000055249235,0.0001777814,0.00038129263,0.00012815167],"domain_scores_gemma":[0.9988085,0.0003366108,0.00013302141,0.00024525603,0.0003093274,0.00016732316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012447414,0.000541261,0.00047597,0.0019680508,0.0019466904,0.0033939548,0.000981934,0.0014146125,0.01356162],"category_scores_gemma":[0.00493351,0.00038002347,0.0009238515,0.001467994,0.0033811727,0.006461643,0.0027929433,0.0031240378,0.003300221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004144984,0.0000043093614,0.000053456057,0.000015607897,0.0000017285208,0.00004204546,0.00009169256,0.000035395733,0.00029965563,0.99514836,0.0018598952,0.0024437804],"study_design_scores_gemma":[0.000007188052,0.0000066921207,0.00016358496,0.000016635344,0.0000051724883,0.00032453673,0.000066581815,0.000662387,0.00028297043,0.9871437,0.011310265,0.000010229014],"about_ca_topic_score_codex":0.00080698205,"about_ca_topic_score_gemma":0.00091641844,"teacher_disagreement_score":0.01356162,"about_ca_system_score_codex":0.0009289352,"about_ca_system_score_gemma":0.00069331465,"threshold_uncertainty_score":0.045368075},"labels":[],"label_agreement":null},{"id":"W2407084241","doi":"","title":"Strongly Regular Graphs Admitting an Automorphism Group with Two Orbits.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Automorphism group; Combinatorics; Outer automorphism group; Automorphism; Group (periodic table); Inner automorphism; Pure mathematics; Chemistry","score_opus":0.045039098455258345,"score_gpt":0.31923395720390324,"score_spread":0.2741948587486449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407084241","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7382284,0.00035937256,0.12537481,0.0015925404,0.00021890196,0.00007656312,0.0006355131,0.00071311573,0.13280086],"genre_scores_gemma":[0.9766198,0.00011700852,0.010267407,0.00011899665,0.00007536288,0.000030863393,0.00038546807,0.000063854575,0.012321322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947697,0.00012672837,0.000030591935,0.00014166426,0.000120662284,0.00010332255],"domain_scores_gemma":[0.9980136,0.0008320551,0.00034787646,0.00038371072,0.00016354164,0.00025908827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043281648,0.0004004868,0.00042174433,0.0008502489,0.0011734125,0.0016613187,0.00063082995,0.0008541714,0.0059862747],"category_scores_gemma":[0.0020532159,0.0003688638,0.0006529783,0.0005953849,0.0022062284,0.002588612,0.0015850978,0.0011841649,0.00072734273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010178464,0.00003212594,0.0008628713,0.00003951536,0.00001440464,0.0002945377,0.00027306008,0.0010105147,0.003378405,0.9881108,0.0013529662,0.004529115],"study_design_scores_gemma":[0.00003672519,0.000031132022,0.00069395045,0.000017108649,0.000025496018,0.00041020088,0.00022372427,0.0063181054,0.002271678,0.9852309,0.004728311,0.000012585937],"about_ca_topic_score_codex":0.0008168069,"about_ca_topic_score_gemma":0.0009009985,"teacher_disagreement_score":0.0059862747,"about_ca_system_score_codex":0.0006789186,"about_ca_system_score_gemma":0.00046558506,"threshold_uncertainty_score":0.020026088},"labels":[],"label_agreement":null},{"id":"W2407087625","doi":"","title":"A novel characterization of n-extendable bipartite graphs","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Characterization (materials science); Combinatorics; Graph; Nanotechnology","score_opus":0.015949664627679903,"score_gpt":0.2696472850536127,"score_spread":0.2536976204259328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407087625","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53914124,0.0007667247,0.34413323,0.0021350237,0.00022933763,0.00020088197,0.0018661829,0.00071717036,0.11081021],"genre_scores_gemma":[0.91701216,0.00067794207,0.058785718,0.0006476592,0.00049818057,0.0001972461,0.001571252,0.00023814237,0.020371811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984478,0.00029136604,0.00010095814,0.00060246204,0.00035878204,0.00019866065],"domain_scores_gemma":[0.99411386,0.0026553888,0.0010052312,0.0009207891,0.0004312124,0.0008735891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010225718,0.00085784023,0.00078608154,0.0026158092,0.0015518772,0.0031777357,0.002000224,0.0012964124,0.0075297854],"category_scores_gemma":[0.00515564,0.0005722184,0.0009831294,0.0034048527,0.0023984679,0.00745295,0.0034060488,0.002968206,0.0008265234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019020285,0.00013580848,0.00288375,0.00015263507,0.000026336795,0.0004545435,0.000610418,0.0046082065,0.009121814,0.9528769,0.0036255408,0.025313735],"study_design_scores_gemma":[0.000024004865,0.000063342784,0.0029862046,0.000056657478,0.00003438869,0.0010617981,0.00028502473,0.022543771,0.002012087,0.9557957,0.015101372,0.000035580808],"about_ca_topic_score_codex":0.0006403088,"about_ca_topic_score_gemma":0.00084229273,"teacher_disagreement_score":0.0075297854,"about_ca_system_score_codex":0.0011771517,"about_ca_system_score_gemma":0.00055458164,"threshold_uncertainty_score":0.025189698},"labels":[],"label_agreement":null},{"id":"W2407092834","doi":"","title":"L(j, k)-Labelings and L(j, k)-Edge-Labelings of Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Computer science; Artificial intelligence","score_opus":0.012016427333859747,"score_gpt":0.2242686751119269,"score_spread":0.21225224777806717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407092834","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46170616,0.0035159888,0.27229163,0.01147305,0.000829061,0.00017374476,0.0062328926,0.001182003,0.24259546],"genre_scores_gemma":[0.8712168,0.0013083662,0.08963902,0.0015549537,0.00044322998,0.00018150701,0.003240485,0.00032761807,0.032087967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832433,0.0005014963,0.00012792624,0.00043615507,0.00022222588,0.0003879338],"domain_scores_gemma":[0.9929792,0.00354898,0.0010090313,0.001025039,0.00054982357,0.00088786456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011355462,0.0005343128,0.00057485385,0.0017116944,0.0026953006,0.0043264236,0.0014554011,0.0020269367,0.012144835],"category_scores_gemma":[0.006833877,0.00067497935,0.0010100112,0.0021520334,0.003099246,0.007200834,0.0027011351,0.0027937747,0.0019398116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014151438,0.000050144296,0.0016157436,0.000118387055,0.000017918488,0.000105012026,0.0003576028,0.0015806814,0.0014619826,0.96981066,0.009367233,0.0153731],"study_design_scores_gemma":[0.000022493407,0.000015556601,0.00090881373,0.000041586427,0.000017185923,0.00030380063,0.00025002594,0.0050295983,0.0010740255,0.9810637,0.011251661,0.000021467476],"about_ca_topic_score_codex":0.0016285643,"about_ca_topic_score_gemma":0.0021221833,"teacher_disagreement_score":0.012144835,"about_ca_system_score_codex":0.00185552,"about_ca_system_score_gemma":0.0008393211,"threshold_uncertainty_score":0.040628493},"labels":[],"label_agreement":null},{"id":"W2407094030","doi":"","title":"On Right Derivations Of Weak BCC-Algebras.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics; Algebra over a field","score_opus":0.008377234516240865,"score_gpt":0.22187330890301574,"score_spread":0.21349607438677487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407094030","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0848908,0.0052580885,0.51186574,0.0040513845,0.0013183178,0.00015141827,0.0013056414,0.00093401864,0.3902246],"genre_scores_gemma":[0.7926286,0.0029575273,0.08053623,0.0017036885,0.0008309238,0.00012634414,0.0011597092,0.0005238896,0.11953305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808383,0.00061718246,0.00012699228,0.00024623258,0.0006729927,0.00025286278],"domain_scores_gemma":[0.9975629,0.00081855577,0.00014525639,0.0003669655,0.0008394126,0.00026693818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016902656,0.00047077143,0.00050399185,0.0014902445,0.0022241147,0.0025823568,0.0007953081,0.00093468424,0.013293801],"category_scores_gemma":[0.004546265,0.0005022965,0.0007125196,0.0014580451,0.0023772425,0.0072399364,0.0027149701,0.0025303157,0.004269473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014129239,0.000010573938,0.00012664832,0.000031152777,0.000004948901,0.000074875876,0.0001765218,0.00030014856,0.0004850479,0.99159825,0.0017039924,0.0054737567],"study_design_scores_gemma":[0.0000058049854,0.0000036592737,0.00007143678,0.000016451137,0.000004688945,0.000081143866,0.000065925844,0.0013837449,0.0005665311,0.9900816,0.0077125933,0.000006381978],"about_ca_topic_score_codex":0.0025998892,"about_ca_topic_score_gemma":0.0045063365,"teacher_disagreement_score":0.013293801,"about_ca_system_score_codex":0.0016203668,"about_ca_system_score_gemma":0.0011031701,"threshold_uncertainty_score":0.044472218},"labels":[],"label_agreement":null},{"id":"W2407122695","doi":"","title":"Unit distance representations of the Petersen graph in the plane.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Unit (ring theory); Combinatorics; Graph; Plane (geometry); Geometry; Mathematics education","score_opus":0.036970490430902496,"score_gpt":0.30514793856466876,"score_spread":0.26817744813376626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407122695","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47419778,0.0019493301,0.1632692,0.0016412014,0.00046076457,0.000062521314,0.0009408718,0.00052056246,0.3569577],"genre_scores_gemma":[0.9504246,0.00084415,0.018323576,0.00018780556,0.00019705744,0.000033529024,0.00042683716,0.00015363412,0.029408928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997795,0.000045926798,0.00000856012,0.000040297044,0.00008109836,0.000044594766],"domain_scores_gemma":[0.99965453,0.00008343468,0.00008203006,0.000059594022,0.000056594832,0.00006379741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017731331,0.00039001484,0.00032580277,0.0017396401,0.000841042,0.0021826343,0.000758391,0.00080421043,0.011663346],"category_scores_gemma":[0.001194548,0.00019800704,0.00026639886,0.0013378673,0.0009922746,0.0026757405,0.0013627043,0.0014047553,0.0017628077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023588138,0.000012416628,0.000089090514,0.000019409717,0.000003327874,0.00004127099,0.000114531045,0.0011318161,0.00048832764,0.987087,0.0016990808,0.009290003],"study_design_scores_gemma":[0.000011468331,0.00001614366,0.00032742927,0.000015806101,0.0000067795954,0.00013873288,0.00025659613,0.0097798435,0.0006676774,0.98050505,0.008263201,0.000011243381],"about_ca_topic_score_codex":0.001029982,"about_ca_topic_score_gemma":0.0010375363,"teacher_disagreement_score":0.011663346,"about_ca_system_score_codex":0.0005040649,"about_ca_system_score_gemma":0.00024228643,"threshold_uncertainty_score":0.039017797},"labels":[],"label_agreement":null},{"id":"W2407126472","doi":"","title":"A new family of pooling designs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Water resources management and optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Pooling; Mathematics; Computer science; Artificial intelligence","score_opus":0.011493405220604396,"score_gpt":0.18511938308274445,"score_spread":0.17362597786214004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407126472","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01854764,0.0011546084,0.9392212,0.0004596238,0.0002651673,0.00017122316,0.00062045135,0.0008173743,0.038742676],"genre_scores_gemma":[0.42606497,0.0024423413,0.5060645,0.0017629539,0.0006168537,0.001363776,0.001572341,0.0007140869,0.059398174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982528,0.00059936126,0.00014304054,0.0004145725,0.00038665687,0.00020357885],"domain_scores_gemma":[0.99790657,0.00074837304,0.00021580611,0.0005979004,0.00032069083,0.00021071693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027940352,0.0013443494,0.0012039612,0.0010067697,0.00087016216,0.0022503757,0.0017069199,0.001298708,0.018542234],"category_scores_gemma":[0.0072423127,0.00064962794,0.0014227337,0.0013816549,0.0010846194,0.0035211155,0.0024006492,0.0017751633,0.0044528544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046200943,0.00019359522,0.00087052945,0.00046602372,0.00015623744,0.00024053322,0.00015679,0.033018053,0.008811368,0.6193066,0.023298666,0.3130196],"study_design_scores_gemma":[0.00018862412,0.00065501925,0.0006495049,0.00016423402,0.0001733149,0.000798884,0.000078598896,0.19427948,0.00763804,0.72439796,0.07089394,0.000082454244],"about_ca_topic_score_codex":0.0005591204,"about_ca_topic_score_gemma":0.0008268262,"teacher_disagreement_score":0.018542234,"about_ca_system_score_codex":0.00083961827,"about_ca_system_score_gemma":0.0013708201,"threshold_uncertainty_score":0.062029958},"labels":[],"label_agreement":null},{"id":"W2407129199","doi":"","title":"Families Of Generating Functions For The Jacobi And Related Matrix Polynomials.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Jacobi polynomials; Matrix (chemical analysis); Pure mathematics; Algebra over a field; Orthogonal polynomials; Chemistry","score_opus":0.007498580002478342,"score_gpt":0.2275648589387481,"score_spread":0.22006627893626973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407129199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25234148,0.003848773,0.48002568,0.0037938764,0.00068152003,0.00017589075,0.0018404411,0.000952501,0.25633985],"genre_scores_gemma":[0.8957432,0.002028752,0.046181418,0.0005989458,0.0006787149,0.00033587337,0.0013265206,0.00037350648,0.052733153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921155,0.00022119099,0.000029674356,0.000110976114,0.00028450607,0.00014211927],"domain_scores_gemma":[0.9968574,0.0019396156,0.00028316525,0.00030099237,0.0003684793,0.00025025496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012700841,0.00071795547,0.00055427256,0.0038888096,0.0016151568,0.0025301846,0.0011626602,0.0010655614,0.01205922],"category_scores_gemma":[0.00745211,0.00046741086,0.00085308676,0.0018644903,0.0016387056,0.0034338897,0.0015291017,0.0018960409,0.0025066563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001133754,0.000014487816,0.00019037056,0.000018214143,0.0000033264253,0.00003850885,0.00010362584,0.00063317484,0.00020672198,0.9891237,0.0024300956,0.0072263684],"study_design_scores_gemma":[0.0000122161755,0.000010598061,0.00023592667,0.000023263772,0.0000052038704,0.0002544629,0.00007001041,0.010020393,0.00042019365,0.98292255,0.006009309,0.00001590742],"about_ca_topic_score_codex":0.00051968737,"about_ca_topic_score_gemma":0.0006104346,"teacher_disagreement_score":0.01205922,"about_ca_system_score_codex":0.0011541289,"about_ca_system_score_gemma":0.0006679014,"threshold_uncertainty_score":0.040342093},"labels":[],"label_agreement":null},{"id":"W2407149601","doi":"","title":"Maximum Minimal k-rankings of Cycles.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Statistics","score_opus":0.00956610690804818,"score_gpt":0.22578229488137028,"score_spread":0.2162161879733221,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407149601","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43298715,0.006155238,0.22848627,0.006799836,0.00075585255,0.0005720291,0.03677086,0.003845758,0.28362703],"genre_scores_gemma":[0.8608766,0.0013984035,0.08193772,0.000996351,0.0002868967,0.00026154547,0.014085417,0.00079074554,0.03936629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982514,0.00048322778,0.00016293618,0.00037886252,0.00032170513,0.00040189258],"domain_scores_gemma":[0.99359137,0.002785741,0.0005495443,0.00097297406,0.0011363032,0.0009641041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010243868,0.0008286274,0.0011348817,0.0024390926,0.0024714167,0.005413882,0.001484721,0.0013292524,0.023290027],"category_scores_gemma":[0.009650408,0.00073798216,0.00093691587,0.0030368401,0.001206353,0.006721595,0.0020381147,0.0015840689,0.0045636785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011572056,0.00026342488,0.005018924,0.0018998513,0.00017104673,0.00047741632,0.00080860965,0.0065441076,0.008723434,0.80341285,0.06913021,0.10239293],"study_design_scores_gemma":[0.0000896146,0.000082132145,0.001854526,0.0001959776,0.000099792276,0.0006262683,0.00060654513,0.008871398,0.004418435,0.94599557,0.037096597,0.000063334024],"about_ca_topic_score_codex":0.0021405667,"about_ca_topic_score_gemma":0.0058882628,"teacher_disagreement_score":0.023290027,"about_ca_system_score_codex":0.0017856506,"about_ca_system_score_gemma":0.0016780804,"threshold_uncertainty_score":0.07791293},"labels":[],"label_agreement":null},{"id":"W2407156328","doi":"","title":"An Extremal Problem Resulting in Many Paths.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Mathematical optimization; Applied mathematics; Mathematical economics","score_opus":0.016209006955684398,"score_gpt":0.2811812595192991,"score_spread":0.26497225256361473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407156328","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4669433,0.0021196392,0.24228695,0.016130425,0.0016447237,0.00024909765,0.0026397079,0.0013490869,0.26663715],"genre_scores_gemma":[0.8541955,0.0009862586,0.09335332,0.0014711386,0.00033108087,0.00015957846,0.002027828,0.00058286544,0.046892464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893445,0.00031074346,0.000047294663,0.00024517096,0.0002009089,0.00026145647],"domain_scores_gemma":[0.99547714,0.0027767674,0.0003360025,0.00058367546,0.0002856585,0.00054081227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079874136,0.00076776376,0.00080436294,0.0010962924,0.0039097876,0.0025836122,0.001758844,0.0034515318,0.023023289],"category_scores_gemma":[0.009609325,0.00063061237,0.0011252027,0.0014197734,0.0019154022,0.0051909736,0.004347735,0.005071705,0.0025273522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038203254,0.00019506509,0.0010032811,0.00027108594,0.00007334675,0.0013267867,0.0004584933,0.007754563,0.0023486835,0.9178048,0.034443673,0.033938073],"study_design_scores_gemma":[0.00004067201,0.000026778313,0.00024658907,0.000041280167,0.00003023185,0.00049193617,0.00024500073,0.012773562,0.0009462223,0.9779272,0.007214909,0.000015543288],"about_ca_topic_score_codex":0.00077272375,"about_ca_topic_score_gemma":0.0014985437,"teacher_disagreement_score":0.023023289,"about_ca_system_score_codex":0.0009799158,"about_ca_system_score_gemma":0.0008518695,"threshold_uncertainty_score":0.077020526},"labels":[],"label_agreement":null},{"id":"W2407166722","doi":"","title":"Decycling Bipartite Tournaments by Deleting Arcs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Combinatorics","score_opus":0.040890626566109624,"score_gpt":0.34749712197723526,"score_spread":0.3066064954111256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407166722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20810919,0.0011036091,0.67002016,0.00084738096,0.0005575272,0.000392413,0.0011535123,0.0012633746,0.116552815],"genre_scores_gemma":[0.6999661,0.0007604224,0.23302883,0.0006189222,0.000152264,0.00030417694,0.0016323642,0.00038425316,0.06315264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989839,0.00035890655,0.00006141544,0.00024453487,0.00015397988,0.00019714699],"domain_scores_gemma":[0.99718684,0.0012031654,0.0002442645,0.0007791911,0.00019161901,0.00039490344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010333728,0.00051825604,0.0008417451,0.00084053166,0.0011115591,0.0019084349,0.0016597908,0.0008961491,0.015541234],"category_scores_gemma":[0.0055388277,0.0003776678,0.0007754305,0.0013336957,0.00093598984,0.0019913702,0.0018470462,0.0020014693,0.0022374154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006957082,0.0005498877,0.0024140333,0.00052271876,0.00014243911,0.00042369627,0.00036428173,0.09458056,0.007473621,0.5792162,0.02129166,0.2923252],"study_design_scores_gemma":[0.00017233835,0.00029437328,0.0012508471,0.00015535047,0.00008915737,0.0006131557,0.00027669073,0.22165179,0.0054659722,0.7292772,0.040700752,0.000052447416],"about_ca_topic_score_codex":0.0014704661,"about_ca_topic_score_gemma":0.0023109105,"teacher_disagreement_score":0.015541234,"about_ca_system_score_codex":0.00057735416,"about_ca_system_score_gemma":0.0006963634,"threshold_uncertainty_score":0.05199057},"labels":[],"label_agreement":null},{"id":"W2407176354","doi":"","title":"On Finding Lagrangians of 3-uniform Hypergraphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Pure mathematics","score_opus":0.013276416988822702,"score_gpt":0.20700683761048091,"score_spread":0.1937304206216582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407176354","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3005191,0.0013418685,0.6410403,0.0013426263,0.00014985901,0.00021956328,0.0014638634,0.0009893874,0.05293348],"genre_scores_gemma":[0.667218,0.0008893269,0.29980424,0.00048824362,0.00010593545,0.0001566277,0.0027941251,0.00036201134,0.02818145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959105,0.00014816732,0.000020933969,0.00008598607,0.00006580796,0.00008800754],"domain_scores_gemma":[0.9983286,0.0010373337,0.0002227573,0.00015529786,0.00012491083,0.00013102121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006237449,0.00062464585,0.00067599583,0.0018404357,0.0010671858,0.0017789114,0.000855815,0.0009054129,0.009951347],"category_scores_gemma":[0.0042625493,0.0005108468,0.0006260509,0.0013412673,0.0011850162,0.0029016908,0.0018484718,0.0011260788,0.0018665858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038666924,0.00027833774,0.0061900453,0.00088049663,0.00011432749,0.0005976364,0.0013153431,0.095862046,0.010182731,0.629622,0.026889935,0.2276805],"study_design_scores_gemma":[0.000063330175,0.00012403929,0.001641799,0.00016760489,0.00003622115,0.00034413388,0.00088266126,0.23224625,0.0038255956,0.74668604,0.013944066,0.00003817927],"about_ca_topic_score_codex":0.001924994,"about_ca_topic_score_gemma":0.0039563337,"teacher_disagreement_score":0.009951347,"about_ca_system_score_codex":0.00081038,"about_ca_system_score_gemma":0.0007665853,"threshold_uncertainty_score":0.033290565},"labels":[],"label_agreement":null},{"id":"W2407188313","doi":"","title":"On the number of 5-matchings in boron-nitrogen fullerene graphs","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Boron; Fullerene; Combinatorics; Mathematics; Nitrogen; Chemistry; Organic chemistry","score_opus":0.03511994836403767,"score_gpt":0.2989461793533954,"score_spread":0.26382623098935776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407188313","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88452864,0.001342469,0.02966653,0.004824075,0.00037325727,0.000078174235,0.0013656211,0.00043386832,0.07738732],"genre_scores_gemma":[0.9758807,0.00064803363,0.011308149,0.00046076937,0.00017773164,0.000096245014,0.00077073224,0.0001361818,0.010521502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986702,0.00028253274,0.00008392835,0.00033928527,0.00032300767,0.00030104924],"domain_scores_gemma":[0.993453,0.0036447803,0.0012354356,0.0005243661,0.00040458512,0.0007378769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012801772,0.0006401473,0.0011957313,0.0029186571,0.0027326348,0.0040029464,0.0022978396,0.0026319781,0.015285555],"category_scores_gemma":[0.006281056,0.0006186745,0.0009425733,0.0022950526,0.0024920923,0.0059443964,0.0016219867,0.0019642904,0.0009128381],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074714015,0.00018504851,0.003590701,0.0004842849,0.00008793531,0.0002117442,0.0005382711,0.01669032,0.009922396,0.9328007,0.008627698,0.026113762],"study_design_scores_gemma":[0.00011674616,0.000083123545,0.0027729739,0.00013757058,0.00011090303,0.00036567388,0.0004800316,0.05252065,0.0052624154,0.9321071,0.0059825103,0.000060223658],"about_ca_topic_score_codex":0.0018901773,"about_ca_topic_score_gemma":0.003311357,"teacher_disagreement_score":0.015285555,"about_ca_system_score_codex":0.0025002859,"about_ca_system_score_gemma":0.0010626834,"threshold_uncertainty_score":0.051135242},"labels":[],"label_agreement":null},{"id":"W2407230819","doi":"","title":"On restricted edge connectivity of strong product graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Product (mathematics); Combinatorics; Computer science; Artificial intelligence; Geometry","score_opus":0.027725665696173244,"score_gpt":0.250759130913431,"score_spread":0.22303346521725775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407230819","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49719593,0.0032791526,0.3422491,0.003232826,0.00035018995,0.0001372896,0.0014766118,0.0004555528,0.15162332],"genre_scores_gemma":[0.9539908,0.0026627837,0.02668968,0.0005305318,0.00049896137,0.00020931756,0.0013019942,0.00016220857,0.013953752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992507,0.00028399428,0.000040955452,0.00017098151,0.00015159034,0.00010163318],"domain_scores_gemma":[0.993845,0.004249324,0.0005980473,0.0005085136,0.00042240557,0.00037672106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007207978,0.00053110754,0.00060993154,0.0017554623,0.0009629728,0.0015345081,0.0010366688,0.0010351316,0.010652873],"category_scores_gemma":[0.0068372795,0.0004668585,0.0005145464,0.0017114745,0.0020200163,0.0059119826,0.0017287099,0.0016942951,0.00097612286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010702021,0.00004074973,0.001089175,0.0001970266,0.000032329004,0.00026337357,0.00029714886,0.009358554,0.0017609894,0.9635299,0.005792304,0.017531365],"study_design_scores_gemma":[0.000023816063,0.000037236987,0.000886903,0.00004693632,0.000022970533,0.0003527658,0.00013955118,0.024351992,0.0004948987,0.968483,0.0051465225,0.000013280651],"about_ca_topic_score_codex":0.0008074705,"about_ca_topic_score_gemma":0.001051969,"teacher_disagreement_score":0.010652873,"about_ca_system_score_codex":0.0005993793,"about_ca_system_score_gemma":0.00030802193,"threshold_uncertainty_score":0.03563738},"labels":[],"label_agreement":null},{"id":"W2407239930","doi":"","title":"On Mean Graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.009171224263642476,"score_gpt":0.21356839097634212,"score_spread":0.20439716671269964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407239930","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10239676,0.014121348,0.4406387,0.017613659,0.0023006268,0.00012537169,0.0030628925,0.0015110818,0.41822955],"genre_scores_gemma":[0.6971059,0.009653577,0.12832254,0.0058082566,0.0042195907,0.00046998868,0.004798902,0.0012933142,0.14832805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908304,0.00026955793,0.000037806836,0.00024941738,0.00022389677,0.00013626053],"domain_scores_gemma":[0.99614775,0.0019095222,0.0003084616,0.00080948346,0.0004303187,0.00039435877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010424986,0.0008842217,0.001302204,0.0031542177,0.0024728982,0.0031302806,0.0016045368,0.0019946443,0.02110819],"category_scores_gemma":[0.0067607383,0.00062542956,0.0011248715,0.0027772868,0.0023564515,0.007252237,0.0031365468,0.0044254926,0.004200843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023527606,0.00002217151,0.00037726903,0.00007199948,0.000016360973,0.000025255595,0.00009881093,0.0012047909,0.00025918786,0.96313816,0.017397052,0.017365392],"study_design_scores_gemma":[0.0000052523474,0.0000047811727,0.0002589398,0.000020244766,0.000008909128,0.000053639174,0.000046233377,0.003996424,0.00012198822,0.9855854,0.00989254,0.000005562593],"about_ca_topic_score_codex":0.001507544,"about_ca_topic_score_gemma":0.0029841284,"teacher_disagreement_score":0.02110819,"about_ca_system_score_codex":0.0022130674,"about_ca_system_score_gemma":0.0007226411,"threshold_uncertainty_score":0.07061392},"labels":[],"label_agreement":null},{"id":"W2407255115","doi":"","title":"Recurrence relations for Steiner systems with t = 2.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Steiner system","score_opus":0.029264235934984274,"score_gpt":0.29456113096548364,"score_spread":0.26529689503049936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407255115","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35123017,0.005096504,0.2410629,0.003394542,0.0011467364,0.0001852046,0.002610195,0.0010437326,0.39423],"genre_scores_gemma":[0.9275205,0.0014896427,0.0359303,0.00047312264,0.0004915678,0.00013111393,0.0017005813,0.00023172479,0.03203142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943835,0.00013159837,0.0000519447,0.00010143563,0.00016461048,0.000112017944],"domain_scores_gemma":[0.9988176,0.00048059694,0.0002782819,0.00011918807,0.00019298408,0.00011133924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065524806,0.0004173231,0.0005216477,0.0018203486,0.0012268726,0.001922533,0.00067860394,0.0008340004,0.017224267],"category_scores_gemma":[0.0033186374,0.000344575,0.00074432715,0.0017547582,0.0012085837,0.0029312703,0.0011720016,0.0014781316,0.002916801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026962836,0.000011789598,0.00034821153,0.00007137055,0.000009775225,0.00017020006,0.0002383922,0.0012471693,0.0007934222,0.9826471,0.005852572,0.008583061],"study_design_scores_gemma":[0.00001556153,0.000015214667,0.0003238389,0.000021745816,0.000009803076,0.00027166374,0.00009690877,0.0049839,0.0004808061,0.9876352,0.0061276946,0.00001775233],"about_ca_topic_score_codex":0.0011624646,"about_ca_topic_score_gemma":0.0019233767,"teacher_disagreement_score":0.017224267,"about_ca_system_score_codex":0.0010558456,"about_ca_system_score_gemma":0.0005802938,"threshold_uncertainty_score":0.057620943},"labels":[],"label_agreement":null},{"id":"W2407261787","doi":"","title":"Several Identities Involving Second-order Recurrent Sequences.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Order (exchange); Pure mathematics","score_opus":0.009190091268149386,"score_gpt":0.26334374034533226,"score_spread":0.25415364907718285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407261787","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0916692,0.003429646,0.27594474,0.005249745,0.0028186087,0.000141008,0.0007297756,0.0004194853,0.61959773],"genre_scores_gemma":[0.7260643,0.0036227573,0.06487551,0.002392621,0.0025014863,0.0001640273,0.0007630579,0.00029333367,0.19932297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999062,0.0002073829,0.00007779105,0.00016118804,0.0003344005,0.0001572331],"domain_scores_gemma":[0.99810684,0.00067296077,0.00021273294,0.0003147895,0.00044785778,0.00024485012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011254642,0.00061636884,0.0004938163,0.0017584823,0.0023596515,0.0029655865,0.00093499245,0.0016955659,0.017560333],"category_scores_gemma":[0.0043693692,0.0002955863,0.0012401219,0.0012560503,0.0019562636,0.0060387375,0.0021689257,0.0024565905,0.0038926457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062741883,0.000011290706,0.00008867127,0.000023913735,0.0000026690334,0.000132478,0.000122004305,0.000101442754,0.0003168389,0.9929852,0.0022612868,0.003947969],"study_design_scores_gemma":[0.0000054517004,0.000008505149,0.00015680936,0.00002376151,0.0000073634715,0.00046248265,0.00008872514,0.0019591704,0.0006166856,0.9831269,0.013530259,0.000013909276],"about_ca_topic_score_codex":0.0010872739,"about_ca_topic_score_gemma":0.0016201787,"teacher_disagreement_score":0.017560333,"about_ca_system_score_codex":0.0012354713,"about_ca_system_score_gemma":0.0008366901,"threshold_uncertainty_score":0.058745146},"labels":[],"label_agreement":null},{"id":"W2407266695","doi":"","title":"Sign-Imbalance Of Alternating Permutations Avoiding A Pattern Of Length Three.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Sign (mathematics); Combinatorics; Mathematical analysis","score_opus":0.0076332010010652035,"score_gpt":0.196673426288001,"score_spread":0.1890402252869358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407266695","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8457362,0.00041422716,0.06132048,0.00095402263,0.00045513478,0.000075414544,0.00077394024,0.0003136617,0.089957],"genre_scores_gemma":[0.9795303,0.00013906721,0.008664891,0.00016931769,0.00011221556,0.000057071113,0.00044820626,0.00006256796,0.010816276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908376,0.00022642383,0.00006539864,0.00012903407,0.00021568661,0.00027974788],"domain_scores_gemma":[0.9967463,0.0012579951,0.00070069585,0.00046089117,0.00035874682,0.00047534413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006813097,0.0003604376,0.0004300671,0.001708963,0.001277486,0.0023875989,0.0007196633,0.000986013,0.0111260675],"category_scores_gemma":[0.0049573975,0.000253731,0.0003181815,0.0010445426,0.0013534648,0.0025491405,0.0013035496,0.0010119283,0.0012651797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010896511,0.00017692875,0.0039570415,0.00011066725,0.0000320802,0.0008846796,0.0003065293,0.0066163307,0.02258639,0.92096514,0.007159829,0.036114786],"study_design_scores_gemma":[0.00010522203,0.0001616544,0.0025280623,0.000051615938,0.00003471688,0.0013947486,0.00037483504,0.04512612,0.010714249,0.9299922,0.009471817,0.00004469032],"about_ca_topic_score_codex":0.00051254313,"about_ca_topic_score_gemma":0.00065713545,"teacher_disagreement_score":0.0111260675,"about_ca_system_score_codex":0.0007242554,"about_ca_system_score_gemma":0.0006266622,"threshold_uncertainty_score":0.03722042},"labels":[],"label_agreement":null},{"id":"W2407269589","doi":"","title":"Nonexistence of Some (945, 177, 33)-difference Sets.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.007304961951530924,"score_gpt":0.20191479449025918,"score_spread":0.19460983253872824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407269589","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6610022,0.0005313776,0.12688933,0.0033028412,0.00048799117,0.00011041139,0.0016225642,0.00054326496,0.20550996],"genre_scores_gemma":[0.94272345,0.00012950176,0.03331704,0.00047480178,0.000076143806,0.000113509566,0.00094541657,0.0001266925,0.02209332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832374,0.00028575907,0.000089348694,0.000463775,0.00048738765,0.00035004754],"domain_scores_gemma":[0.99397415,0.0037652343,0.0003828376,0.0008751089,0.000534827,0.00046774955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012000175,0.00040478216,0.0007222033,0.0013810325,0.0036299522,0.0033311667,0.0016803177,0.0014275203,0.012198935],"category_scores_gemma":[0.007941916,0.0007869262,0.0009303582,0.0008033763,0.0027038623,0.003594494,0.0034087496,0.0030494859,0.0017091134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014819263,0.000048121474,0.0008138812,0.00006443161,0.000021427784,0.00023205281,0.00022571113,0.0007419825,0.005006928,0.98477256,0.002855315,0.005069249],"study_design_scores_gemma":[0.0000740563,0.00004007974,0.0008992677,0.000034781526,0.000032856202,0.00084924145,0.00036831028,0.0056814463,0.011376317,0.96869546,0.01191702,0.00003115299],"about_ca_topic_score_codex":0.00051553245,"about_ca_topic_score_gemma":0.0007196046,"teacher_disagreement_score":0.012198935,"about_ca_system_score_codex":0.0013236753,"about_ca_system_score_gemma":0.00074603787,"threshold_uncertainty_score":0.040809453},"labels":[],"label_agreement":null},{"id":"W2407272553","doi":"","title":"Recounting Relations for Set Partitions with Restrictions.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Partition (number theory); Set (abstract data type); Stirling number; Block (permutation group theory); Stirling numbers of the second kind; Finite set; Combinatorics; Stirling numbers of the first kind; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.04473153085492097,"score_gpt":0.31749660825007936,"score_spread":0.2727650773951584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407272553","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22971882,0.0028043566,0.4726203,0.0029346189,0.00071369583,0.00019612725,0.0009614076,0.0011981743,0.28885242],"genre_scores_gemma":[0.88822883,0.0011554917,0.080580935,0.0005648071,0.0005896079,0.00018387068,0.00080369343,0.00027684568,0.027616052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99770606,0.0006346805,0.00014421805,0.00035802554,0.0007000387,0.00045691742],"domain_scores_gemma":[0.99198055,0.0040525054,0.0009614452,0.0015727624,0.00078103686,0.00065173116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001854562,0.00057386706,0.00067246944,0.0028802017,0.0027174512,0.0034711608,0.0017163239,0.0010738673,0.0116628455],"category_scores_gemma":[0.012764053,0.00063092285,0.0010915019,0.0025557813,0.005394324,0.008399289,0.0029868109,0.0033968433,0.0016136148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021343814,0.00000551372,0.00007314102,0.000019629304,0.0000017067308,0.000028870165,0.00015071273,0.00028019564,0.0003435757,0.9966114,0.0004927964,0.0019711547],"study_design_scores_gemma":[0.000016183503,0.000023778526,0.0003216586,0.00004126168,0.000019189962,0.00029629777,0.00025101157,0.0046315943,0.0026583644,0.9759216,0.01578553,0.000033663666],"about_ca_topic_score_codex":0.0022802718,"about_ca_topic_score_gemma":0.00226977,"teacher_disagreement_score":0.0116628455,"about_ca_system_score_codex":0.0026788318,"about_ca_system_score_gemma":0.0010079598,"threshold_uncertainty_score":0.039016068},"labels":[],"label_agreement":null},{"id":"W2407306632","doi":"","title":"Some results on transverse Steiner quadruple systems of type g t u 1 .","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Type (biology); Transverse plane; Combinatorics; Mathematical analysis; Pure mathematics; Structural engineering; Geology; Engineering","score_opus":0.029344809867676774,"score_gpt":0.24558135880408888,"score_spread":0.21623654893641212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407306632","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33842358,0.0029397223,0.1405901,0.003108066,0.0014911334,0.00013521806,0.0020866387,0.0005377749,0.5106877],"genre_scores_gemma":[0.9035871,0.002360164,0.028540157,0.00092294184,0.00075617665,0.00013070303,0.0018896614,0.00021531456,0.06159773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967027,0.0000777213,0.000023216428,0.000050969415,0.000091932015,0.000085885025],"domain_scores_gemma":[0.9991171,0.00032034854,0.00018968804,0.0001261353,0.00011155226,0.00013509119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044009814,0.00056696945,0.00046396197,0.0020447935,0.001856779,0.0017907958,0.0006274122,0.0010410269,0.023026513],"category_scores_gemma":[0.0016273073,0.0004076481,0.0006348445,0.0018934456,0.0011626375,0.002650037,0.001893267,0.0016422075,0.0032032446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046992867,0.000023063594,0.0004058918,0.00010783634,0.000010369635,0.0002614102,0.00017315603,0.0017800517,0.0016519082,0.97785336,0.007997345,0.009688455],"study_design_scores_gemma":[0.000016353473,0.000054892662,0.000535561,0.000047126778,0.000014267997,0.00043486146,0.00020861119,0.0054994375,0.0010629288,0.9769359,0.0151677895,0.000022302253],"about_ca_topic_score_codex":0.0004910993,"about_ca_topic_score_gemma":0.000644429,"teacher_disagreement_score":0.023026513,"about_ca_system_score_codex":0.00065340754,"about_ca_system_score_gemma":0.00038604793,"threshold_uncertainty_score":0.077031374},"labels":[],"label_agreement":null},{"id":"W2407309435","doi":"","title":"On Some Properties of Cages.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Mathematics; Cage; Combinatorics; Graph; Girth (graph theory); Discrete mathematics","score_opus":0.015348732664037603,"score_gpt":0.2023332096057612,"score_spread":0.1869844769417236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407309435","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3755513,0.014092555,0.40115067,0.007081273,0.00065600115,0.00018700649,0.002249811,0.0006021717,0.19842917],"genre_scores_gemma":[0.9277289,0.008596613,0.04520612,0.001528667,0.0011527996,0.00029742325,0.0014086139,0.00026891613,0.013811904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993006,0.00020224905,0.000040074785,0.00017527015,0.00016892594,0.00011297066],"domain_scores_gemma":[0.9954939,0.0027015756,0.00063753256,0.00038909714,0.00044942342,0.0003284871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092369836,0.0006054752,0.0005989156,0.0021545354,0.001446996,0.0014677955,0.00092613685,0.0011312228,0.0071865236],"category_scores_gemma":[0.006044101,0.00039145045,0.0007218675,0.0018607776,0.0029087425,0.0054018865,0.0015855763,0.0013300141,0.0008731567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006856566,0.000036255755,0.0024271724,0.0001932867,0.000031803753,0.00029104424,0.00048906315,0.0073961033,0.003596624,0.96173495,0.0070343902,0.016700663],"study_design_scores_gemma":[0.000026026462,0.00013982986,0.003132811,0.000106341446,0.0000521058,0.0013103483,0.00053981884,0.02805894,0.0030921565,0.93429345,0.029207049,0.000041090578],"about_ca_topic_score_codex":0.001160722,"about_ca_topic_score_gemma":0.00083708245,"teacher_disagreement_score":0.0071865236,"about_ca_system_score_codex":0.00076786877,"about_ca_system_score_gemma":0.0002851325,"threshold_uncertainty_score":0.024041355},"labels":[],"label_agreement":null},{"id":"W2407321404","doi":"","title":"On edge colorings of 1-planar graphs without chordal 5-cycles.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chordal graph; Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Outerplanar graph; Planar graph; Planar; Pathwidth; Graph; Computer science; Telecommunications; Line graph","score_opus":0.019376495285452763,"score_gpt":0.28517836554494047,"score_spread":0.2658018702594877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407321404","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5211338,0.0038740148,0.19612412,0.0040247245,0.0009687947,0.00029908455,0.0026698285,0.0011964662,0.2697091],"genre_scores_gemma":[0.851578,0.003672186,0.08558933,0.0017530653,0.00073071383,0.00024239675,0.003554322,0.0007643522,0.05211567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992192,0.0002159571,0.000038406153,0.00016330984,0.00014556086,0.00021765065],"domain_scores_gemma":[0.9963349,0.0021232853,0.0005065693,0.0003668038,0.00029929646,0.00036909964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006262634,0.00086329115,0.00068923936,0.001928151,0.0019833501,0.0026053083,0.0015537611,0.0014623257,0.016637307],"category_scores_gemma":[0.0048070895,0.0008709772,0.0009778067,0.0022968724,0.0019872568,0.0038101638,0.0020749904,0.0023001956,0.0026637083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032719027,0.00013000744,0.0019920885,0.00038947092,0.000051191393,0.0004502614,0.0007028611,0.014546202,0.0043525407,0.91042966,0.022886634,0.04374181],"study_design_scores_gemma":[0.000054135715,0.000039214603,0.0009815228,0.000094175426,0.00003038459,0.0003222924,0.00030774096,0.013914816,0.0009811742,0.97221065,0.011036873,0.000027028427],"about_ca_topic_score_codex":0.0031697932,"about_ca_topic_score_gemma":0.005482261,"teacher_disagreement_score":0.016637307,"about_ca_system_score_codex":0.0016347403,"about_ca_system_score_gemma":0.0007156896,"threshold_uncertainty_score":0.055657327},"labels":[],"label_agreement":null},{"id":"W2407327571","doi":"","title":"Zero-divisor Semigroups of Star Graphs and Two-star Graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Star (game theory); Zero (linguistics); Zero divisor; Combinatorics; Discrete mathematics; Mathematical analysis; Linguistics","score_opus":0.031010168172181312,"score_gpt":0.2658903510536899,"score_spread":0.2348801828815086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407327571","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46977216,0.0048440746,0.18124618,0.003068566,0.00096883706,0.00012671272,0.00094395666,0.0006006915,0.3384288],"genre_scores_gemma":[0.9587852,0.0007471723,0.015353154,0.00027787848,0.0004011977,0.000054993372,0.00029496994,0.000054791457,0.02403064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918383,0.0002546317,0.000055772703,0.00015836414,0.00019848222,0.00014896272],"domain_scores_gemma":[0.9973658,0.0009756167,0.00039377864,0.00028047324,0.0003228624,0.0006614177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012978486,0.0004661681,0.0006587577,0.0020932956,0.0018433742,0.0030444667,0.0007857996,0.00060448033,0.009036158],"category_scores_gemma":[0.0028152354,0.00040166802,0.00081818225,0.00096721173,0.0030989249,0.0049905456,0.0024178685,0.0013374258,0.0012254169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014087878,0.000009039902,0.00011506545,0.000014541523,0.0000028870456,0.00004102535,0.00011795435,0.00010247249,0.00020943978,0.99721426,0.00050060154,0.001658601],"study_design_scores_gemma":[0.000012370725,0.000011731271,0.00019912401,0.0000100350435,0.000006068704,0.00015663204,0.00010920142,0.0009071407,0.00028920145,0.9945797,0.003711101,0.000007713251],"about_ca_topic_score_codex":0.00056268094,"about_ca_topic_score_gemma":0.00071412267,"teacher_disagreement_score":0.009036158,"about_ca_system_score_codex":0.0009845269,"about_ca_system_score_gemma":0.00058241934,"threshold_uncertainty_score":0.030228972},"labels":[],"label_agreement":null},{"id":"W2407341457","doi":"","title":"The critical group of C 4 x C n .","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"History and Theory of Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Group (periodic table); Combinatorics; Chemistry; Organic chemistry","score_opus":0.02103201532847341,"score_gpt":0.2914668186883726,"score_spread":0.27043480335989917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407341457","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24689415,0.0027098875,0.017923322,0.0039653126,0.00089007337,0.000068892026,0.00025398727,0.00021279897,0.72708166],"genre_scores_gemma":[0.8894101,0.0008688171,0.0052617555,0.00054475374,0.00033583204,0.00005904086,0.00022169642,0.00005066052,0.10324743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975246,0.00006488169,0.000008710382,0.0000452895,0.00006396504,0.000064620916],"domain_scores_gemma":[0.99967146,0.00008333772,0.00007353988,0.000030069494,0.000066402215,0.000075258926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026484925,0.00051908585,0.00026518301,0.0018265097,0.0017213629,0.0017997477,0.0004816754,0.0005924383,0.01153147],"category_scores_gemma":[0.0010530755,0.00015089856,0.0002229376,0.00066468323,0.002718387,0.0021821286,0.0016305315,0.0010313572,0.0011891038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037209003,0.00000678135,0.00016786845,0.000022932942,0.0000041660282,0.0000996936,0.00019292888,0.0002267479,0.0005285001,0.99001044,0.0026251732,0.006077564],"study_design_scores_gemma":[0.0000190738,0.00002546866,0.00066471804,0.000031262047,0.0000069179214,0.0001835614,0.00028705713,0.0009289225,0.0009910832,0.95629126,0.04055874,0.000011954054],"about_ca_topic_score_codex":0.0035562397,"about_ca_topic_score_gemma":0.003453325,"teacher_disagreement_score":0.01153147,"about_ca_system_score_codex":0.001722518,"about_ca_system_score_gemma":0.0010591515,"threshold_uncertainty_score":0.038576603},"labels":[],"label_agreement":null},{"id":"W2407372527","doi":"","title":"Binding numbers and (a, b, k)-critical graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.029864495822640415,"score_gpt":0.2918640294097059,"score_spread":0.2619995335870655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407372527","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34897465,0.0034811103,0.15519176,0.007323693,0.0012325463,0.00016212382,0.0008397844,0.0010090299,0.48178527],"genre_scores_gemma":[0.91380775,0.0010104274,0.03298727,0.0010413269,0.00023117603,0.00016453525,0.0004436702,0.0002061089,0.050107792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992211,0.000228412,0.000041024057,0.0001640205,0.00016510417,0.00018044184],"domain_scores_gemma":[0.9960473,0.0021383835,0.00046772716,0.0002592734,0.00041679142,0.0006705341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007725551,0.0005397224,0.00050538284,0.0030262233,0.003636151,0.0036614414,0.0010831258,0.0017514786,0.02052185],"category_scores_gemma":[0.0058257617,0.0006634036,0.0003916133,0.0017122371,0.0033929613,0.005620178,0.0021125958,0.0027338567,0.0025925855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026631344,0.000009782457,0.0001727614,0.00002966799,0.0000029734624,0.000058695416,0.00013862307,0.00033940477,0.00064093154,0.9924166,0.0024567158,0.0037071516],"study_design_scores_gemma":[0.000010213098,0.0000060838047,0.00017241278,0.00002592166,0.000005546266,0.00012445601,0.0001584193,0.0012699132,0.000414832,0.991585,0.00621756,0.000009644857],"about_ca_topic_score_codex":0.002015092,"about_ca_topic_score_gemma":0.0031065885,"teacher_disagreement_score":0.02052185,"about_ca_system_score_codex":0.0018795781,"about_ca_system_score_gemma":0.00092577474,"threshold_uncertainty_score":0.06865245},"labels":[],"label_agreement":null},{"id":"W2407380772","doi":"","title":"Efficient domination in directed tori and the Vizing's conjecture for directed graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Conjecture; Torus; Combinatorics; Domination analysis; Discrete mathematics; Graph; Geometry","score_opus":0.008464802313407668,"score_gpt":0.26430056715055583,"score_spread":0.25583576483714815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407380772","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57044655,0.0019651896,0.15477486,0.010032182,0.0004360132,0.00018475557,0.0017263414,0.00061289134,0.25982115],"genre_scores_gemma":[0.9649643,0.00061128,0.011419006,0.000522366,0.00014529409,0.00010592318,0.0007552105,0.00010265085,0.021373965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873465,0.00033447813,0.000062898274,0.0002244362,0.0002282144,0.00041531154],"domain_scores_gemma":[0.9937594,0.004007954,0.00037116275,0.0010896988,0.00035838317,0.00041349966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012873496,0.00039911337,0.0007797579,0.00073201524,0.002335007,0.0032140038,0.0014746042,0.0015186707,0.012706236],"category_scores_gemma":[0.009551037,0.0005009656,0.0008966898,0.0012005521,0.0032894195,0.0069072135,0.0029769326,0.0023820878,0.0011582699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109769695,0.000035678317,0.0010028691,0.00008342464,0.000013122603,0.00011582662,0.00047545083,0.0054548355,0.0008626142,0.9750354,0.0071467073,0.009664225],"study_design_scores_gemma":[0.000029594788,0.0000097762795,0.00039383344,0.000017591967,0.000012069125,0.00010336071,0.0002139334,0.010796009,0.0005933584,0.9832697,0.0045493874,0.0000114720115],"about_ca_topic_score_codex":0.0027430567,"about_ca_topic_score_gemma":0.0035709569,"teacher_disagreement_score":0.012706236,"about_ca_system_score_codex":0.0014969612,"about_ca_system_score_gemma":0.00093373546,"threshold_uncertainty_score":0.042506635},"labels":[],"label_agreement":null},{"id":"W2407401919","doi":"","title":"On edge cover coloring of join graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Join (topology); Mathematics; Enhanced Data Rates for GSM Evolution; Edge coloring; Cover (algebra); Combinatorics; Graph; Computer science; Line graph; Artificial intelligence","score_opus":0.024780045162280693,"score_gpt":0.2188419330595564,"score_spread":0.19406188789727571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407401919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27627927,0.0046814885,0.4633161,0.008936386,0.0010856873,0.0002664108,0.0025874726,0.0012596127,0.24158753],"genre_scores_gemma":[0.76923394,0.0039325543,0.15456893,0.0019571942,0.0014241546,0.00031726918,0.0037572214,0.0007921694,0.06401644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987344,0.00042495658,0.000042310123,0.00023218298,0.0002602179,0.00030591505],"domain_scores_gemma":[0.9946138,0.0035398896,0.0003347389,0.0007618553,0.00030348948,0.00044618742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011594744,0.00078019046,0.0009597181,0.0017034424,0.002372501,0.0030740383,0.0016747748,0.0015977923,0.013940888],"category_scores_gemma":[0.006017398,0.0006595009,0.0008364437,0.0026057332,0.0021631327,0.0076660058,0.0027963533,0.002741432,0.002062671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018315128,0.00014682805,0.001366889,0.00020586753,0.000036886646,0.000115551506,0.00034474974,0.01412105,0.0016742116,0.9122938,0.029473787,0.04003714],"study_design_scores_gemma":[0.000036078483,0.00003178994,0.0007705546,0.0000523537,0.000026554548,0.00018581649,0.00027775808,0.03800679,0.0011626774,0.94365555,0.015775885,0.000018098719],"about_ca_topic_score_codex":0.002757335,"about_ca_topic_score_gemma":0.004116086,"teacher_disagreement_score":0.013940888,"about_ca_system_score_codex":0.0023234854,"about_ca_system_score_gemma":0.001000634,"threshold_uncertainty_score":0.04663694},"labels":[],"label_agreement":null},{"id":"W2407401989","doi":"","title":"Packings and coverings for four particular graphs each with six vertices and nine edges (λ = 1).","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.009350327919304222,"score_gpt":0.19242279357565728,"score_spread":0.18307246565635305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407401989","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88467884,0.0007833003,0.0353953,0.0006928906,0.00018989993,0.000060388556,0.0019016389,0.0006134185,0.07568438],"genre_scores_gemma":[0.9692749,0.0003135479,0.022430262,0.00008315961,0.000025303132,0.000041648564,0.0015048556,0.00008596934,0.0062402827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996543,0.00006892402,0.0000187454,0.00006925682,0.00006809446,0.00012082199],"domain_scores_gemma":[0.9991185,0.00040090436,0.00012531367,0.00017060092,0.000068223024,0.00011639188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018718817,0.00046347486,0.00041039506,0.0010951,0.0017538845,0.0009581772,0.00054089894,0.0010719462,0.010500922],"category_scores_gemma":[0.0014749735,0.0004066861,0.0005729768,0.0016332484,0.0009726199,0.0009680912,0.0008388442,0.00044748987,0.0007461971],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016427976,0.00030215055,0.013348957,0.00071707286,0.000264624,0.005458026,0.0020653245,0.17101493,0.039622184,0.6362,0.042180993,0.08718291],"study_design_scores_gemma":[0.00015459945,0.0002661639,0.023077033,0.00015027681,0.00023855436,0.004995676,0.0033023749,0.33968365,0.029271591,0.54627705,0.052442763,0.00014022362],"about_ca_topic_score_codex":0.0028459611,"about_ca_topic_score_gemma":0.0038255355,"teacher_disagreement_score":0.010500922,"about_ca_system_score_codex":0.00061823067,"about_ca_system_score_gemma":0.00028161035,"threshold_uncertainty_score":0.03512901},"labels":[],"label_agreement":null},{"id":"W2407405250","doi":"","title":"On the Erdos-Faber-Lovasz Conjecture.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Analytic and geometric function theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Conjecture; Combinatorics","score_opus":0.018099517443304663,"score_gpt":0.25761076539771016,"score_spread":0.2395112479544055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407405250","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16441408,0.016777577,0.10168463,0.06700252,0.0039734337,0.00006490681,0.001430762,0.0004814108,0.6441707],"genre_scores_gemma":[0.9185416,0.010180542,0.012918382,0.0055309595,0.0036056945,0.00009502793,0.0011718927,0.00015148926,0.047804378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885726,0.00029933223,0.000043883727,0.00023819052,0.0003259136,0.00023541575],"domain_scores_gemma":[0.9961384,0.0023075286,0.0003284334,0.00048445296,0.00045686433,0.0002843664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025250367,0.00075659796,0.0013522003,0.001694613,0.0027705415,0.003925185,0.0013045153,0.002977649,0.011660235],"category_scores_gemma":[0.010137869,0.00039771816,0.00082449475,0.0020369405,0.00486832,0.012704716,0.0035253712,0.00459091,0.0028507444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039459224,0.000013582712,0.00019606925,0.000031629457,0.0000057217176,0.000043988643,0.00008320038,0.00034662118,0.00008746734,0.9871646,0.0076698423,0.004317911],"study_design_scores_gemma":[0.000011637888,0.0000044895273,0.0001667328,0.000015057057,0.0000054127086,0.00005064982,0.000058911588,0.0007943086,0.00005238826,0.9932648,0.005570312,0.0000052260034],"about_ca_topic_score_codex":0.0019269234,"about_ca_topic_score_gemma":0.001287026,"teacher_disagreement_score":0.011660235,"about_ca_system_score_codex":0.001677982,"about_ca_system_score_gemma":0.0008781679,"threshold_uncertainty_score":0.039007425},"labels":[],"label_agreement":null},{"id":"W2407423171","doi":"","title":"Domination in lexicographic product digraphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Lexicographical order; Mathematics; Product (mathematics); Combinatorics; Geometry","score_opus":0.01552132551322981,"score_gpt":0.2427508621659651,"score_spread":0.22722953665273526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407423171","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21098687,0.003568878,0.5325556,0.002968115,0.00031059197,0.00025850374,0.0032752613,0.0015857497,0.2444904],"genre_scores_gemma":[0.7607668,0.0025280763,0.1468891,0.00083096506,0.00033154408,0.00027435005,0.0035830997,0.00048173362,0.08431435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895096,0.0003285958,0.00011080536,0.00025987774,0.00023204979,0.00011766791],"domain_scores_gemma":[0.99601495,0.0028069625,0.00026404692,0.00036054503,0.00036700035,0.0001865036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086380244,0.00036882618,0.00072384346,0.002365396,0.0017789818,0.003985373,0.00071300636,0.00058150745,0.014776478],"category_scores_gemma":[0.0050873086,0.0005709782,0.00072665757,0.0032593498,0.001837304,0.0062925075,0.0016452395,0.0011066272,0.002257235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000778544,0.000043633056,0.0009605189,0.00023328546,0.000034141147,0.00036025402,0.00065020786,0.0016914066,0.0014334474,0.9403931,0.0065933517,0.047528826],"study_design_scores_gemma":[0.000025846342,0.000021605192,0.00046322885,0.00005833313,0.000033617973,0.00057080045,0.00023659278,0.009006428,0.0016310314,0.95810556,0.02982601,0.000020885962],"about_ca_topic_score_codex":0.0024788857,"about_ca_topic_score_gemma":0.0051663974,"teacher_disagreement_score":0.014776478,"about_ca_system_score_codex":0.0015785919,"about_ca_system_score_gemma":0.0009065588,"threshold_uncertainty_score":0.049432218},"labels":[],"label_agreement":null},{"id":"W2407427864","doi":"","title":"On the signed edge domination numbers of K m, n .","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Arithmetic; Telecommunications; Computer science","score_opus":0.012944301504125903,"score_gpt":0.2590284015321941,"score_spread":0.2460841000280682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407427864","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71066725,0.0014250912,0.09117912,0.0029786308,0.00051278726,0.00007151039,0.001195567,0.00028987628,0.19168015],"genre_scores_gemma":[0.9685976,0.0006162904,0.0151030915,0.00031758723,0.00021344135,0.000100938014,0.00040532844,0.00009263688,0.0145530775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937373,0.0001855065,0.00004140035,0.00009917533,0.00016052429,0.00013972765],"domain_scores_gemma":[0.99496365,0.0031840545,0.00061904336,0.0002942564,0.00046305233,0.00047603616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010551864,0.0004603469,0.00039117696,0.002494597,0.0012381986,0.0024717094,0.00088011427,0.0007595537,0.009679454],"category_scores_gemma":[0.010227791,0.00024608124,0.0002623361,0.0013510333,0.00197757,0.0045812037,0.0015004941,0.0013595277,0.0012451664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002963052,0.000055269396,0.0021740936,0.00011168463,0.00001592018,0.00013011525,0.00038422545,0.006609597,0.0027745944,0.9456848,0.0077309324,0.034032516],"study_design_scores_gemma":[0.00002950706,0.00003587574,0.0017927781,0.00007467996,0.000015477875,0.00022334559,0.0002326113,0.017174361,0.0014117956,0.9722129,0.006764219,0.000032287964],"about_ca_topic_score_codex":0.00080897927,"about_ca_topic_score_gemma":0.0015744398,"teacher_disagreement_score":0.009679454,"about_ca_system_score_codex":0.0010835439,"about_ca_system_score_gemma":0.0006099723,"threshold_uncertainty_score":0.032381058},"labels":[],"label_agreement":null},{"id":"W2407434450","doi":"","title":"On Even and Harmonic-Even Partial Cubes.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cube (algebra); Isometric exercise; Dimension (graph theory); Harmonic; Combinatorics; Mathematical analysis; Physics; Quantum mechanics","score_opus":0.04657593467857038,"score_gpt":0.3268044681636693,"score_spread":0.2802285334850989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407434450","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5369539,0.011896405,0.22644927,0.011614973,0.0013327424,0.00014997085,0.0020234347,0.0002137698,0.2093655],"genre_scores_gemma":[0.93472487,0.004614681,0.037148822,0.0016722943,0.0012914636,0.00013850056,0.0019083364,0.000057815745,0.018443162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990514,0.00024694396,0.0000415615,0.00022419992,0.00020951207,0.00022639836],"domain_scores_gemma":[0.9958106,0.002751555,0.00048518067,0.00028312104,0.00029958662,0.00036997625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009391141,0.0008672617,0.0008858775,0.0010222339,0.0019244675,0.0018055823,0.0010199376,0.0013242111,0.008259071],"category_scores_gemma":[0.006129688,0.00045872794,0.0009257619,0.0014882569,0.0031538624,0.008132637,0.0038797688,0.0022326198,0.000818153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020216026,0.000027345122,0.0016844206,0.00021125906,0.000027407465,0.00043446914,0.0004015199,0.0031748635,0.0017722226,0.9666531,0.0064723063,0.018938983],"study_design_scores_gemma":[0.000016974114,0.00003578878,0.0009727801,0.000035707708,0.000021439537,0.00041202223,0.00050699495,0.0066471086,0.0009873965,0.9808724,0.009466182,0.000025187039],"about_ca_topic_score_codex":0.0013686899,"about_ca_topic_score_gemma":0.0011254175,"teacher_disagreement_score":0.008259071,"about_ca_system_score_codex":0.0012682115,"about_ca_system_score_gemma":0.000419889,"threshold_uncertainty_score":0.027629316},"labels":[],"label_agreement":null},{"id":"W2407434981","doi":"","title":"A note on the Merrifield-Simmons index of connected graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Combinatorics; Discrete mathematics; Computer science; World Wide Web","score_opus":0.031073673351009412,"score_gpt":0.289381530602243,"score_spread":0.25830785725123356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407434981","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.099516355,0.023719778,0.12283999,0.016091537,0.0083234,0.00009193994,0.0010269361,0.00081118266,0.727579],"genre_scores_gemma":[0.8714577,0.012271369,0.05489505,0.0038104414,0.006285919,0.00014036425,0.0005157872,0.00056289334,0.0500605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991258,0.00023556147,0.00004505843,0.00018701295,0.00031684476,0.00008982784],"domain_scores_gemma":[0.99617165,0.0022369134,0.0003478373,0.0004267734,0.0003645267,0.00045232786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013987701,0.00075171347,0.0011166678,0.0056404374,0.001932088,0.0033277217,0.0017781291,0.0018510064,0.012921725],"category_scores_gemma":[0.009934331,0.0004242031,0.00063148927,0.0051008393,0.0038143548,0.008958785,0.0030615022,0.003814273,0.0017973515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023824225,0.000008420816,0.00021781996,0.000052379444,0.0000063899524,0.00006754456,0.00014132485,0.00037581148,0.00036200872,0.98123944,0.0075650006,0.009939995],"study_design_scores_gemma":[0.00000688512,0.000010287994,0.00034833179,0.00002928637,0.0000070555516,0.00014720458,0.000058280457,0.0014140795,0.00025258504,0.98019123,0.017521337,0.000013402907],"about_ca_topic_score_codex":0.0013284195,"about_ca_topic_score_gemma":0.001792865,"teacher_disagreement_score":0.012921725,"about_ca_system_score_codex":0.0018028008,"about_ca_system_score_gemma":0.0005664714,"threshold_uncertainty_score":0.043227434},"labels":[],"label_agreement":null},{"id":"W2407462674","doi":"","title":"The hypergraph of θ-classes and θ-graphs of partial cubes.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chordal graph; Combinatorics; Mathematics; Hypergraph; Interval graph; Pathwidth; Indifference graph; Split graph; Discrete mathematics; Vertex (graph theory); Graph; Line graph; 1-planar graph","score_opus":0.010957420666458346,"score_gpt":0.2600561760749702,"score_spread":0.24909875540851187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407462674","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47710434,0.0016085847,0.32810342,0.0028398214,0.00028963637,0.00018507386,0.0033016228,0.00035706733,0.18621045],"genre_scores_gemma":[0.93208694,0.0007627372,0.044238266,0.00059069524,0.00011613976,0.00012733242,0.0014815773,0.00007257258,0.020523734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971503,0.000069696485,0.000013766131,0.00008913994,0.000059526858,0.000052799718],"domain_scores_gemma":[0.99915195,0.00029805588,0.00014402748,0.000110838446,0.00013301046,0.00016208619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023610228,0.00020428687,0.00018485171,0.00080279046,0.001032833,0.0013812127,0.0005513626,0.00042402174,0.0074295686],"category_scores_gemma":[0.0014362877,0.00021368657,0.000301952,0.0010417292,0.0012341136,0.0031705059,0.0011503258,0.0010973964,0.00064088625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004640251,0.000011494411,0.0012827284,0.000063100604,0.000009901698,0.000110668145,0.00024657647,0.0011460054,0.0018895894,0.9750351,0.0021627052,0.01799574],"study_design_scores_gemma":[0.00001276744,0.000024592196,0.0031821283,0.00004076917,0.000024530544,0.00053811894,0.0006034566,0.008726627,0.0021308868,0.9457302,0.038968187,0.000017751228],"about_ca_topic_score_codex":0.003129333,"about_ca_topic_score_gemma":0.002571121,"teacher_disagreement_score":0.0074295686,"about_ca_system_score_codex":0.0008339484,"about_ca_system_score_gemma":0.0004273914,"threshold_uncertainty_score":0.024854362},"labels":[],"label_agreement":null},{"id":"W2407485278","doi":"","title":"On traceable and upper traceable numbers of graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.02202488961978434,"score_gpt":0.2776144362891288,"score_spread":0.25558954666934447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407485278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2834521,0.004438926,0.38057384,0.006839687,0.0011378212,0.00013891321,0.0012223274,0.0010444496,0.32115194],"genre_scores_gemma":[0.89681035,0.002433901,0.049163833,0.0010112571,0.0012465965,0.0002042736,0.00078287855,0.00038503722,0.047961827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975414,0.000565382,0.00015319698,0.000525643,0.0007246191,0.00048978475],"domain_scores_gemma":[0.981459,0.012701784,0.001334987,0.0018792215,0.001096191,0.0015288662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020404155,0.0010086597,0.0010435744,0.00394077,0.002395828,0.0051900875,0.0020930863,0.001578861,0.014036908],"category_scores_gemma":[0.019221485,0.0006647206,0.0010810101,0.003298145,0.006753342,0.015378224,0.004084645,0.0060894266,0.0017571487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004672166,0.000025542073,0.00026998227,0.00003652928,0.000004864475,0.0000444186,0.00021134278,0.0012006229,0.00033229962,0.9895865,0.0010808373,0.007160289],"study_design_scores_gemma":[0.0000059788763,0.000008938643,0.00012743464,0.000015800688,0.0000039273455,0.000041090396,0.000047045807,0.0027111892,0.00020620221,0.99489105,0.0019349791,0.000006455355],"about_ca_topic_score_codex":0.002147038,"about_ca_topic_score_gemma":0.0023032518,"teacher_disagreement_score":0.014036908,"about_ca_system_score_codex":0.002824706,"about_ca_system_score_gemma":0.0010986851,"threshold_uncertainty_score":0.04695809},"labels":[],"label_agreement":null},{"id":"W2407487162","doi":"","title":"Solid Bursts-From Hamming to TR-Spaces.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hamming graph; Hamming code; Pure mathematics; Combinatorics; Statistics; Block code","score_opus":0.017311168554507452,"score_gpt":0.2559720261343311,"score_spread":0.23866085757982367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407487162","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12557042,0.004703064,0.7203059,0.0026916503,0.0014562154,0.00010593799,0.0015030734,0.00069525174,0.14296839],"genre_scores_gemma":[0.82514507,0.002657777,0.076819144,0.0012977656,0.0009571834,0.00014911863,0.0014298968,0.00070132094,0.09084272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989956,0.00031055274,0.00006729503,0.00018496139,0.00025168233,0.00018994573],"domain_scores_gemma":[0.9974443,0.00079840625,0.0003112707,0.00063939876,0.00043707728,0.00036960258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008510647,0.00081114325,0.00068719656,0.0013747547,0.001054242,0.0030399312,0.0012762236,0.0009927881,0.022623848],"category_scores_gemma":[0.0055859718,0.0003384405,0.0006323966,0.0015455192,0.0020029873,0.0056570354,0.0036656603,0.0024976993,0.0038499995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066038476,0.000020834575,0.00020574739,0.000049599636,0.000009617383,0.000051359308,0.0000779496,0.00413168,0.00045330328,0.9727305,0.004600807,0.017602595],"study_design_scores_gemma":[0.0000065853483,0.000030413685,0.000113079775,0.000023333218,0.0000046396362,0.000091154565,0.00007890726,0.0159467,0.0003802681,0.9760433,0.0072721136,0.000009621117],"about_ca_topic_score_codex":0.000785047,"about_ca_topic_score_gemma":0.00075126195,"teacher_disagreement_score":0.022623848,"about_ca_system_score_codex":0.000928637,"about_ca_system_score_gemma":0.00059818313,"threshold_uncertainty_score":0.07568425},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.006300082100492631,"score_gpt":0.2459441925894685,"score_spread":0.23964411048897588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407498472","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14882214,0.014470051,0.5634537,0.0027117454,0.0022304996,0.00015515165,0.0007227422,0.0003940024,0.26703992],"genre_scores_gemma":[0.76461935,0.012997584,0.09917317,0.0009688492,0.0021373592,0.0002117929,0.00063762005,0.0001813839,0.119072914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996934,0.00007982937,0.000016011893,0.000057926594,0.00009187954,0.00006104035],"domain_scores_gemma":[0.99940705,0.00027592244,0.00011183841,0.0000539228,0.000095239004,0.000056056244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005022149,0.00064486824,0.0003177974,0.001299269,0.00069691805,0.0014186125,0.00043300717,0.00064353686,0.011116712],"category_scores_gemma":[0.0027515471,0.00022715944,0.00038372062,0.00139159,0.001991989,0.0032089315,0.0009018252,0.000987967,0.0018590029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053449817,0.0000029713972,0.00005738128,0.000023762555,0.0000013617652,0.000032188073,0.000060992294,0.0014427075,0.0002860046,0.98838216,0.0010090575,0.008696062],"study_design_scores_gemma":[0.0000034794307,0.000017393937,0.00014823559,0.00001345782,0.0000021912647,0.00013496439,0.00004145206,0.0059424327,0.0004680874,0.97897434,0.014243351,0.000010662839],"about_ca_topic_score_codex":0.00090563507,"about_ca_topic_score_gemma":0.0010186611,"teacher_disagreement_score":0.011116712,"about_ca_system_score_codex":0.00074196997,"about_ca_system_score_gemma":0.0005761434,"threshold_uncertainty_score":0.037189126},"labels":[],"label_agreement":null},{"id":"W2407529045","doi":"","title":"On Balance Index Sets of Rooted Trees.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Vertex (graph theory); Combinatorics; Balance (ability); Graph; Tree (set theory); Set (abstract data type); Discrete mathematics; Computer science","score_opus":0.008650949077141224,"score_gpt":0.22895129333622213,"score_spread":0.2203003442590809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407529045","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48874325,0.0015890851,0.44467866,0.0005799581,0.000092099486,0.00016347016,0.0021861354,0.0003887471,0.061578695],"genre_scores_gemma":[0.8508138,0.0010500802,0.1366678,0.00029028545,0.00024575897,0.00038921356,0.002575413,0.0002778702,0.0076898625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849474,0.0002669504,0.00010346207,0.00029507268,0.00059170893,0.00024803833],"domain_scores_gemma":[0.99324507,0.0046278895,0.00079756626,0.0005145175,0.0003852742,0.00042968066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016812419,0.0007428154,0.00092829554,0.0044903113,0.0022941849,0.0027530354,0.0011892539,0.0008442554,0.004231714],"category_scores_gemma":[0.009175057,0.00074316125,0.00084689044,0.0032112922,0.0024306828,0.0049761673,0.002655502,0.001513408,0.00076827605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027047255,0.000118874916,0.0048489426,0.00013761171,0.00003256598,0.00018770836,0.0009843961,0.01676589,0.010068229,0.9070045,0.0031426752,0.056438185],"study_design_scores_gemma":[0.00002633397,0.000045116238,0.0022353102,0.00006718435,0.000020886251,0.0003726853,0.00023799665,0.035935346,0.0053044083,0.9494015,0.0063196644,0.000033570668],"about_ca_topic_score_codex":0.0009563003,"about_ca_topic_score_gemma":0.00093607185,"teacher_disagreement_score":0.0044903113,"about_ca_system_score_codex":0.0021390375,"about_ca_system_score_gemma":0.00046059382,"threshold_uncertainty_score":0.015519857},"labels":[],"label_agreement":null},{"id":"W2407535970","doi":"","title":"Identities involving Partitions with bounded Parts.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bounded function; Mathematical analysis","score_opus":0.07245696759753573,"score_gpt":0.3111333002046125,"score_spread":0.23867633260707677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407535970","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08075772,0.0037447845,0.24987927,0.0030604452,0.0020990325,0.000094409326,0.0006821128,0.00041834774,0.65926385],"genre_scores_gemma":[0.8189749,0.0022445386,0.054552585,0.001650265,0.0013162581,0.00016325078,0.0007783855,0.00044919294,0.11987057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99833786,0.0005336785,0.00008675396,0.0002495717,0.0005646666,0.00022737157],"domain_scores_gemma":[0.99788314,0.00089008897,0.00019545222,0.00043422476,0.0003775369,0.00021950003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012604509,0.00076516176,0.00068948866,0.0018519599,0.0025580795,0.003898,0.0010011871,0.0012870652,0.01451966],"category_scores_gemma":[0.005877139,0.000499401,0.00092643953,0.0013256378,0.00423452,0.008407172,0.0037534356,0.0034573644,0.0044843275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072708854,0.000004065568,0.00004480892,0.000014145882,0.0000015832268,0.000040840718,0.000115792136,0.000078792844,0.00023018531,0.99613106,0.001398708,0.0019328134],"study_design_scores_gemma":[0.0000036717934,0.000003253258,0.00007688427,0.000015631822,0.0000037033662,0.000115127514,0.00005731985,0.00066772645,0.0002454389,0.99232894,0.006477233,0.0000050233625],"about_ca_topic_score_codex":0.001126222,"about_ca_topic_score_gemma":0.0016914215,"teacher_disagreement_score":0.01451966,"about_ca_system_score_codex":0.0014260331,"about_ca_system_score_gemma":0.00078221236,"threshold_uncertainty_score":0.048573136},"labels":[],"label_agreement":null},{"id":"W2407539193","doi":"","title":"Roman domination subdivision number of a graph and its complement.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Subdivision; Mathematics; Complement (music); Combinatorics; Graph; Discrete mathematics; Geography; Biology; Archaeology","score_opus":0.0162250119811454,"score_gpt":0.2957556756950597,"score_spread":0.27953066371391433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407539193","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7011363,0.0006772331,0.039053928,0.0011490855,0.00020090159,0.00004329448,0.0006142396,0.00023155849,0.2568934],"genre_scores_gemma":[0.9691803,0.00024989917,0.009179347,0.00011882527,0.000082507635,0.00003570852,0.00039246478,0.000055472832,0.020705445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996766,0.00008822643,0.00001287476,0.00006465188,0.000079844176,0.000077882054],"domain_scores_gemma":[0.9988827,0.00049083936,0.00016808347,0.00012312269,0.00016007388,0.00017512268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038717242,0.00025404495,0.00035936816,0.0015729923,0.0009896095,0.0016626029,0.00064990664,0.0005090359,0.009772814],"category_scores_gemma":[0.002086849,0.00016443928,0.00035010185,0.0009221596,0.0017652293,0.0016551103,0.00083189557,0.0010321691,0.0011564554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016986148,0.0000330528,0.0020016292,0.000048364556,0.000015143848,0.00012570355,0.00036287622,0.0030217431,0.003659648,0.9691348,0.004075978,0.017351162],"study_design_scores_gemma":[0.00003578137,0.000056122604,0.004226047,0.00004096115,0.000032151755,0.00056371046,0.00033268135,0.027036745,0.0036690298,0.9402248,0.02375546,0.000026490121],"about_ca_topic_score_codex":0.0016423059,"about_ca_topic_score_gemma":0.001630402,"teacher_disagreement_score":0.009772814,"about_ca_system_score_codex":0.000891576,"about_ca_system_score_gemma":0.00039952068,"threshold_uncertainty_score":0.032693326},"labels":[],"label_agreement":null},{"id":"W2407581734","doi":"","title":"On Prime Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Prime (order theory); Combinatorics","score_opus":0.012789955418397708,"score_gpt":0.22931111650859382,"score_spread":0.21652116109019612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407581734","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088212624,0.013213052,0.18516682,0.014492754,0.0022335695,0.00011567771,0.0022128678,0.0010031002,0.69334954],"genre_scores_gemma":[0.7131992,0.0096152,0.07346234,0.003990706,0.0029933266,0.0002604596,0.003229471,0.0007304694,0.19251886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991841,0.00022764396,0.000031710402,0.00022005841,0.0001985205,0.00013798181],"domain_scores_gemma":[0.9980533,0.00096420967,0.00016065486,0.00041345393,0.0001740994,0.00023435189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007857037,0.0007722883,0.00096170756,0.0023583656,0.0021303338,0.003211385,0.0010197777,0.0012022342,0.023214264],"category_scores_gemma":[0.0032284078,0.00053421146,0.00078946643,0.0024791297,0.0023441268,0.006786161,0.0031511858,0.003542246,0.0046210946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025402398,0.000021910602,0.00029451045,0.00007232344,0.000008748729,0.000031688534,0.00011539279,0.0007020402,0.0002920539,0.9618783,0.017815106,0.018742595],"study_design_scores_gemma":[0.0000064056558,0.0000058169067,0.00020907063,0.000023180783,0.000006833823,0.0001004383,0.00006134771,0.002085832,0.0002332585,0.9774361,0.019826602,0.0000051718043],"about_ca_topic_score_codex":0.0009488988,"about_ca_topic_score_gemma":0.0016440089,"teacher_disagreement_score":0.023214264,"about_ca_system_score_codex":0.0019797366,"about_ca_system_score_gemma":0.0006247397,"threshold_uncertainty_score":0.07765943},"labels":[],"label_agreement":null},{"id":"W2407603576","doi":"","title":"On Oriented Graphs with Certain Extension Properties.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Extension (predicate logic); Computer science; Programming language","score_opus":0.02385744119622255,"score_gpt":0.21961450156388734,"score_spread":0.1957570603676648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407603576","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5481647,0.0016934577,0.23695442,0.004177061,0.00026089692,0.00010957612,0.0013783623,0.0005339236,0.20672753],"genre_scores_gemma":[0.92489195,0.0013641894,0.050066683,0.00086167105,0.0004062974,0.0001453378,0.0014324026,0.00019351605,0.020637859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990299,0.00032634847,0.000056971112,0.00023132107,0.0001604253,0.00019507368],"domain_scores_gemma":[0.99426985,0.0034223686,0.000650997,0.00072512473,0.00033382117,0.00059798895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012689922,0.00047812267,0.0005915806,0.0017097741,0.0017560465,0.0029106182,0.00095018797,0.0011503883,0.007012971],"category_scores_gemma":[0.00535769,0.00046096474,0.00070033193,0.002150762,0.0026404131,0.0076561267,0.002486615,0.0020662302,0.0009629797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053371095,0.000045967798,0.0010259714,0.00006391742,0.000008386348,0.00010850398,0.00021266913,0.0017248928,0.00073770666,0.98135847,0.0035075368,0.011152619],"study_design_scores_gemma":[0.00001758817,0.00001264412,0.0006345987,0.000034149547,0.000011132715,0.00027394367,0.00022631533,0.0060861637,0.0005487599,0.9857875,0.0063565997,0.00001058505],"about_ca_topic_score_codex":0.0007964248,"about_ca_topic_score_gemma":0.0010845409,"teacher_disagreement_score":0.007012971,"about_ca_system_score_codex":0.0010946414,"about_ca_system_score_gemma":0.00051214633,"threshold_uncertainty_score":0.023460686},"labels":[],"label_agreement":null},{"id":"W2407621886","doi":"","title":"The Independence Number of the Cartesian Product of Graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Mathematics; Independence (probability theory); Independence number; Product (mathematics); Combinatorics; Discrete mathematics; Arithmetic; Statistics; Geometry; Graph","score_opus":0.014823919605706953,"score_gpt":0.22128805892366804,"score_spread":0.2064641393179611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407621886","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49174032,0.00366282,0.18317874,0.0059982855,0.00056381547,0.00009248424,0.0037329616,0.0005262304,0.31050435],"genre_scores_gemma":[0.9534357,0.0011693585,0.023415491,0.0003521549,0.0004442943,0.00009845164,0.0015802984,0.00018916067,0.019315124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854267,0.00043122208,0.00008013275,0.0003849965,0.0003239226,0.0002370698],"domain_scores_gemma":[0.990262,0.0065703783,0.00078801805,0.0009793136,0.00056480675,0.0008355155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013525918,0.0004946971,0.0007277338,0.0022324095,0.0018751866,0.003631101,0.0011295581,0.0010523875,0.0118665155],"category_scores_gemma":[0.009299784,0.00081764255,0.00064247206,0.0020662055,0.0034764544,0.007200759,0.0019602636,0.0029214865,0.0016351856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001355555,0.000035624227,0.0016025017,0.00010663765,0.000019575944,0.000045680157,0.00022421737,0.002386389,0.0010792337,0.971475,0.008701114,0.014188391],"study_design_scores_gemma":[0.000022144191,0.000022132073,0.0018876536,0.000033681787,0.00002471178,0.00022770718,0.00010219517,0.0111652585,0.0016922294,0.97513753,0.009663537,0.000021221233],"about_ca_topic_score_codex":0.0012293602,"about_ca_topic_score_gemma":0.0013690771,"teacher_disagreement_score":0.0118665155,"about_ca_system_score_codex":0.0014150876,"about_ca_system_score_gemma":0.00082872837,"threshold_uncertainty_score":0.03969741},"labels":[],"label_agreement":null},{"id":"W2407623588","doi":"","title":"The Global Connected Domination In Graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.00913539524891057,"score_gpt":0.2703753785844049,"score_spread":0.26123998333549436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407623588","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3211281,0.0123104835,0.24939747,0.008578601,0.0007710201,0.00011074602,0.0009801345,0.00048364422,0.40623984],"genre_scores_gemma":[0.9498782,0.0035597489,0.012621813,0.00080426084,0.0007328649,0.000109201384,0.0003735127,0.0001309256,0.03178951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993511,0.0002143238,0.000026057147,0.00016375221,0.00015755648,0.00008718214],"domain_scores_gemma":[0.9972485,0.0016987005,0.0002523203,0.00030534368,0.000241617,0.0002536816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007071162,0.0004244114,0.00048504162,0.0020608136,0.0013500365,0.002379941,0.00073279487,0.0008716737,0.008880937],"category_scores_gemma":[0.004410473,0.00033176376,0.00051402434,0.0017709966,0.0038205418,0.005267584,0.002062132,0.0018271167,0.00083169655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024265653,0.000008395619,0.00044273297,0.00009108359,0.00001617124,0.000087826855,0.0002829818,0.0010955228,0.00071049074,0.9799936,0.0037279774,0.013518887],"study_design_scores_gemma":[0.000008228312,0.000007289868,0.0004502651,0.000023880408,0.000012715355,0.00018554278,0.00010491639,0.0025234697,0.00029636142,0.9903756,0.006005384,0.000006333347],"about_ca_topic_score_codex":0.0010386177,"about_ca_topic_score_gemma":0.0014085459,"teacher_disagreement_score":0.008880937,"about_ca_system_score_codex":0.0009930284,"about_ca_system_score_gemma":0.00045915227,"threshold_uncertainty_score":0.029709697},"labels":[],"label_agreement":null},{"id":"W2407629294","doi":"","title":"A note on the identities of special polynomials","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics; Algebra over a field","score_opus":0.029859613936929996,"score_gpt":0.29973905327567124,"score_spread":0.26987943933874126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407629294","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05053611,0.020702621,0.25580037,0.03834715,0.02019083,0.00006338506,0.00045662146,0.0006962659,0.6132066],"genre_scores_gemma":[0.64680445,0.024436831,0.1288414,0.012716835,0.03428229,0.00013790598,0.0005191742,0.00072426867,0.15153691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885464,0.00038634133,0.000067918365,0.00018708885,0.00038470124,0.00011939192],"domain_scores_gemma":[0.99713683,0.0015596622,0.0001899338,0.00048707335,0.00038187025,0.00024461895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003002731,0.00091013836,0.0011363253,0.0023381372,0.0031511304,0.0037254377,0.0017049278,0.0016219815,0.008254299],"category_scores_gemma":[0.0054479544,0.0004911356,0.0011908858,0.0019148043,0.0069233994,0.008700311,0.0039170724,0.006271902,0.0022966692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000087500375,0.000007018982,0.00006158967,0.00002883799,0.0000028067213,0.000072139715,0.00017134334,0.00010164681,0.0002051439,0.9901833,0.005272538,0.0038849306],"study_design_scores_gemma":[0.0000046815258,0.000008111013,0.00011310865,0.000014955044,0.0000045449087,0.00010488071,0.00004412677,0.00044171629,0.00015376057,0.9696497,0.029451216,0.00000924211],"about_ca_topic_score_codex":0.0015760305,"about_ca_topic_score_gemma":0.0022166194,"teacher_disagreement_score":0.008254299,"about_ca_system_score_codex":0.0015102035,"about_ca_system_score_gemma":0.0010973895,"threshold_uncertainty_score":0.027613342},"labels":[],"label_agreement":null},{"id":"W2407657421","doi":"","title":"Embedding handcuffed designs into a maximum packing of the complete graph with 4-cycles.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Embedding; Graph; Combinatorics; Computer science; Artificial intelligence","score_opus":0.012411224007322084,"score_gpt":0.21391384295560992,"score_spread":0.20150261894828783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407657421","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4644407,0.000781012,0.45351636,0.000407,0.00019534474,0.00013342478,0.00062877,0.00094248104,0.078954905],"genre_scores_gemma":[0.7747422,0.00034766557,0.20358525,0.0001516099,0.000043935157,0.0001228975,0.0005666369,0.00018424785,0.020255454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959475,0.00012316747,0.000020575222,0.000080578306,0.0000890142,0.000091924194],"domain_scores_gemma":[0.9993074,0.00023029691,0.00009251411,0.00023878743,0.00006802398,0.00006298142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023639532,0.00045605737,0.00040513714,0.0005300766,0.0006705722,0.0009677269,0.000592013,0.0008065135,0.007842428],"category_scores_gemma":[0.0015583757,0.00053593656,0.00036464413,0.00064606563,0.0006510411,0.0014127137,0.0012795202,0.0006684592,0.0012433585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013942899,0.00034931122,0.0025814003,0.00047204286,0.000117984484,0.0010818846,0.0010185766,0.13135327,0.06918774,0.51948375,0.017629137,0.2553307],"study_design_scores_gemma":[0.00014182855,0.0005723229,0.002408398,0.0002247845,0.00008588369,0.0011171484,0.0007718983,0.35444883,0.04610593,0.5397641,0.054277357,0.000081556514],"about_ca_topic_score_codex":0.0011886106,"about_ca_topic_score_gemma":0.002254952,"teacher_disagreement_score":0.007842428,"about_ca_system_score_codex":0.0004937657,"about_ca_system_score_gemma":0.00039148438,"threshold_uncertainty_score":0.02623552},"labels":[],"label_agreement":null},{"id":"W2407691524","doi":"","title":"A Note on Set Families and Codes.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Set (abstract data type); Combinatorics; Discrete mathematics; Computer science; Programming language","score_opus":0.01383771580167542,"score_gpt":0.2441813027448969,"score_spread":0.2303435869432215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407691524","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00868791,0.15987702,0.15702781,0.1512237,0.05848476,0.00008266341,0.0013845807,0.0005667209,0.46266487],"genre_scores_gemma":[0.25686833,0.23126662,0.16541174,0.06342418,0.09545969,0.00044941614,0.0017464194,0.0010117332,0.18436188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855024,0.0005473907,0.00006971076,0.00018016873,0.00052632863,0.00012600112],"domain_scores_gemma":[0.99044245,0.0076133534,0.00017341705,0.0008591954,0.0006135926,0.00029789095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021707108,0.00085335545,0.0011309448,0.0028301924,0.003163948,0.003779214,0.0017521332,0.0026095307,0.012707658],"category_scores_gemma":[0.008310935,0.0005342252,0.001234046,0.0040923897,0.006373766,0.013526193,0.0038084881,0.008246691,0.0036654407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023146897,0.00001835721,0.00013273252,0.00017026167,0.000015529897,0.00013907607,0.00016996251,0.00045119526,0.00026560063,0.8759826,0.105370365,0.017261192],"study_design_scores_gemma":[0.000004357528,0.000014402496,0.00014034912,0.00009273361,0.000006065837,0.00019125744,0.000079936646,0.00049517275,0.00013422305,0.83977836,0.15905021,0.0000130045],"about_ca_topic_score_codex":0.002417987,"about_ca_topic_score_gemma":0.0034321882,"teacher_disagreement_score":0.012707658,"about_ca_system_score_codex":0.002059551,"about_ca_system_score_gemma":0.0013632261,"threshold_uncertainty_score":0.042511344},"labels":[],"label_agreement":null},{"id":"W2407706320","doi":"","title":"Signed and minus total domination on subclasses of bipartite graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Complete bipartite graph; Discrete mathematics; Graph","score_opus":0.024405225870331063,"score_gpt":0.2605811588223199,"score_spread":0.23617593295198885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407706320","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7791311,0.0007780295,0.06732942,0.0018629634,0.00022749303,0.00007398871,0.0009915709,0.00036895333,0.1492365],"genre_scores_gemma":[0.97071224,0.00036142697,0.0085558165,0.00030949028,0.00021029118,0.00006380526,0.00077654707,0.000121992125,0.018888446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989421,0.00024972655,0.000081140475,0.00024553877,0.0002926225,0.00018900138],"domain_scores_gemma":[0.99452776,0.002745663,0.000744512,0.00059901975,0.00052375894,0.0008591698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011019463,0.00038310728,0.00061499805,0.0017248621,0.0016851111,0.0032151653,0.0009921126,0.0008843446,0.007321538],"category_scores_gemma":[0.006668906,0.0004281952,0.00071562926,0.0010432632,0.0019466848,0.0043557994,0.0018995989,0.0014552223,0.0006691075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011840797,0.000047549485,0.0024308683,0.000058547255,0.00002271333,0.00024547553,0.00039490312,0.0013026113,0.0018771767,0.9751017,0.003915668,0.014484416],"study_design_scores_gemma":[0.00002706011,0.000016065644,0.001509225,0.000035777644,0.000022330607,0.00076864427,0.00025835482,0.0090819,0.0011174493,0.98132116,0.0058238013,0.000018240873],"about_ca_topic_score_codex":0.0013557348,"about_ca_topic_score_gemma":0.0018446337,"teacher_disagreement_score":0.007321538,"about_ca_system_score_codex":0.0012097153,"about_ca_system_score_gemma":0.0005457095,"threshold_uncertainty_score":0.024492979},"labels":[],"label_agreement":null},{"id":"W2407737784","doi":"","title":"Notes on Endomorphisms of Henson Graphs and their Complements.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Endomorphism; Mathematics; Combinatorics","score_opus":0.021565794672974346,"score_gpt":0.28024049619726915,"score_spread":0.2586747015242948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407737784","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14020512,0.012905599,0.082024954,0.006663905,0.0032889615,0.000059680366,0.0006457169,0.00030274218,0.75390345],"genre_scores_gemma":[0.8217206,0.011660139,0.035631355,0.002212561,0.002029035,0.00012655258,0.00059816195,0.00018082152,0.12584075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996985,0.000073497,0.000015279755,0.0000543792,0.00010774323,0.000050611055],"domain_scores_gemma":[0.9993327,0.00040310778,0.000045745226,0.0000652873,0.00008019882,0.000072910385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005795358,0.0005673909,0.00038590445,0.0018119005,0.0012894118,0.0016306101,0.00046415132,0.00067283993,0.0094793085],"category_scores_gemma":[0.0011938073,0.0002844873,0.00043811658,0.0019256998,0.0026858707,0.0034816836,0.0016874856,0.0023807734,0.0009619751],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014157603,0.000012297571,0.0001236035,0.000032008178,0.0000036314125,0.0001034246,0.00021683826,0.00017437954,0.0005389214,0.987362,0.003268521,0.008150226],"study_design_scores_gemma":[0.000006333048,0.000021247768,0.0005642122,0.000025727337,0.0000066041894,0.0002650459,0.00019361438,0.00041480674,0.0004997439,0.9632598,0.03473208,0.000010690204],"about_ca_topic_score_codex":0.0011512822,"about_ca_topic_score_gemma":0.0019000174,"teacher_disagreement_score":0.0094793085,"about_ca_system_score_codex":0.0010057574,"about_ca_system_score_gemma":0.00044140776,"threshold_uncertainty_score":0.03171146},"labels":[],"label_agreement":null},{"id":"W2407743056","doi":"","title":"On Helly Hypergraphs with Variable Intersection Sizes.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hypergraph; Combinatorics; Mathematics; Intersection (aeronautics); Cardinality (data modeling); Characterization (materials science); Generalization; Disjoint sets; Discrete mathematics; Computer science","score_opus":0.007428131006928234,"score_gpt":0.23315796827942664,"score_spread":0.2257298372724984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407743056","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.369306,0.0010149502,0.6107651,0.0011012653,0.00006622543,0.00042746853,0.0023681896,0.0010671539,0.013883691],"genre_scores_gemma":[0.807785,0.000806744,0.17900701,0.0004381991,0.00021568884,0.0005336614,0.0029972359,0.00030673976,0.007909689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794203,0.0005736387,0.00016957633,0.0005985387,0.00045788364,0.00025840517],"domain_scores_gemma":[0.9865194,0.008029107,0.001953909,0.0018717909,0.00093829806,0.000687435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014562793,0.00083997723,0.0007455162,0.0037383477,0.0019971298,0.0022538719,0.0010285547,0.0011155056,0.003522804],"category_scores_gemma":[0.011571897,0.0008362366,0.0007438833,0.003751008,0.0031860827,0.009597851,0.0029350522,0.0020159895,0.00057935045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010539048,0.00024791728,0.024479792,0.0005475238,0.00020065776,0.0013193367,0.003010445,0.07820253,0.02130288,0.7125388,0.008764751,0.14833146],"study_design_scores_gemma":[0.0000539933,0.00012714064,0.005243754,0.00013574302,0.00008070606,0.0013095022,0.000829097,0.13722503,0.009764871,0.83289486,0.012240961,0.00009427588],"about_ca_topic_score_codex":0.0013119209,"about_ca_topic_score_gemma":0.0014643534,"teacher_disagreement_score":0.0037383477,"about_ca_system_score_codex":0.0020861877,"about_ca_system_score_gemma":0.0008137143,"threshold_uncertainty_score":0.01513648},"labels":[],"label_agreement":null},{"id":"W2407746905","doi":"","title":"Cyclic m-Cycle Systems of K n, n for m ≤ 30.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.00655382706042493,"score_gpt":0.20567951379392013,"score_spread":0.1991256867334952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407746905","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6180879,0.0028279559,0.055808127,0.0013358605,0.0005452543,0.00026869358,0.003367463,0.00070237543,0.3170564],"genre_scores_gemma":[0.9257783,0.0005013103,0.014058111,0.00023056389,0.00006486734,0.00010694061,0.001253122,0.00007848581,0.057928223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971527,0.000050406463,0.000015365906,0.000054335324,0.00006300664,0.00010156645],"domain_scores_gemma":[0.99949634,0.00010648554,0.00011030018,0.000089729525,0.00010297985,0.00009418904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017177682,0.00030618382,0.00019127184,0.0009581142,0.0011634944,0.0008541047,0.00063504296,0.0005154,0.02186879],"category_scores_gemma":[0.0010367635,0.00016447503,0.00022649895,0.00075389503,0.0005459506,0.00074055884,0.0010062404,0.00043985195,0.002543157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057624467,0.000117607335,0.0025338125,0.0003273206,0.000035662604,0.00061617995,0.0006109852,0.007283777,0.018900275,0.88170666,0.026195833,0.061095666],"study_design_scores_gemma":[0.000087046545,0.00022713872,0.005023571,0.00011482499,0.000030654515,0.00089810224,0.0006698395,0.02302937,0.022403266,0.822366,0.12505727,0.000092886454],"about_ca_topic_score_codex":0.0019399299,"about_ca_topic_score_gemma":0.005145815,"teacher_disagreement_score":0.02186879,"about_ca_system_score_codex":0.0007915617,"about_ca_system_score_gemma":0.00078210654,"threshold_uncertainty_score":0.07315838},"labels":[],"label_agreement":null},{"id":"W2407758378","doi":"","title":"On Optimal Orientations Of Tensor Product Of Graphs And Circulant Graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Circulant matrix; Tensor product; Combinatorics; Product (mathematics); Indifference graph; Discrete mathematics; Pure mathematics; Graph; Geometry","score_opus":0.02012450017543241,"score_gpt":0.28443272586301593,"score_spread":0.2643082256875835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407758378","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46095538,0.005021013,0.29919955,0.0035904476,0.0011197022,0.00013776697,0.0010024734,0.0005812039,0.22839248],"genre_scores_gemma":[0.8789948,0.0033332377,0.08149156,0.0005947385,0.00073456485,0.00013631115,0.0012036687,0.00059732766,0.03291373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992248,0.00023306564,0.000034745877,0.00013446125,0.00016830595,0.00020458225],"domain_scores_gemma":[0.99733907,0.0009994092,0.00039484302,0.00033174254,0.00033863194,0.0005963063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008850313,0.0007803778,0.0007420792,0.0017242318,0.0016428985,0.0031508536,0.0010548985,0.0012259142,0.0105700055],"category_scores_gemma":[0.0045524347,0.00069054315,0.0006317596,0.0015349801,0.0025696177,0.0057037086,0.0018908638,0.0024280297,0.0017424586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050721304,0.000039672246,0.0003915742,0.000052017254,0.0000058108103,0.000046655765,0.00013856168,0.0021929364,0.0009149137,0.9797641,0.0048420005,0.011560978],"study_design_scores_gemma":[0.0000106984,0.000015922185,0.00030656077,0.000027707123,0.000008069401,0.00007975448,0.00016251938,0.008508081,0.00048660772,0.9857997,0.004582933,0.000011494763],"about_ca_topic_score_codex":0.0019910727,"about_ca_topic_score_gemma":0.003570075,"teacher_disagreement_score":0.0105700055,"about_ca_system_score_codex":0.0015188934,"about_ca_system_score_gemma":0.0007203518,"threshold_uncertainty_score":0.035360217},"labels":[],"label_agreement":null},{"id":"W2407759797","doi":"","title":"An alternative a pproach to the classification of the regular near hexagons with parameters (s, t, t 2 ) = (2, 11, 1).","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Uniqueness; Addendum; Binary Golay code; Ternary Golay code; Mathematics; Ternary operation; Characterization (materials science); Code (set theory); Section (typography); Combinatorics; Elementary proof; Discrete mathematics; Pure mathematics; Algorithm; Computer science; Mathematical analysis; Programming language; Linear code; Law","score_opus":0.030475987556596498,"score_gpt":0.24732872936238037,"score_spread":0.21685274180578387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407759797","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031588994,0.0077973446,0.78147846,0.00670349,0.0047479225,0.00023857859,0.0005392707,0.00043070805,0.1664752],"genre_scores_gemma":[0.4658148,0.007501507,0.41118717,0.009155787,0.005369848,0.0005238669,0.0012531568,0.0003791273,0.098814726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822754,0.00047685887,0.00008463237,0.00057325314,0.0004978439,0.00013989481],"domain_scores_gemma":[0.9978866,0.00059633306,0.00025959985,0.0005131738,0.0005671545,0.00017707901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014258525,0.00091497676,0.0010179286,0.0029806772,0.0022283886,0.003988914,0.002200223,0.0027713769,0.009196065],"category_scores_gemma":[0.004363925,0.0004946037,0.0008500281,0.002431388,0.004265382,0.005838671,0.00380004,0.004860325,0.0038125103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040885665,0.00003157869,0.00035977122,0.00022811916,0.00001605494,0.00019387843,0.00035067112,0.000581822,0.0016564137,0.972021,0.007064497,0.01745525],"study_design_scores_gemma":[0.000023995644,0.00016784576,0.0004347477,0.0001612686,0.000017294526,0.0011709329,0.00040089563,0.006528885,0.002333597,0.88630575,0.102408536,0.000046115045],"about_ca_topic_score_codex":0.0004545429,"about_ca_topic_score_gemma":0.00057654444,"teacher_disagreement_score":0.009196065,"about_ca_system_score_codex":0.0009783007,"about_ca_system_score_gemma":0.000775721,"threshold_uncertainty_score":0.030763924},"labels":[],"label_agreement":null},{"id":"W2407794129","doi":"","title":"Properties of Lucas Trees.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Lucas number; Combinatorics; Fibonacci number","score_opus":0.012890832104815222,"score_gpt":0.2498048554518345,"score_spread":0.23691402334701928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407794129","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27091286,0.004483055,0.11737889,0.0039705583,0.0005332298,0.00011483287,0.0023788966,0.0013060214,0.5989216],"genre_scores_gemma":[0.90703684,0.0014592401,0.0219929,0.00048400645,0.00035327018,0.000079873214,0.0013344525,0.00030358622,0.06695581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995913,0.00007436992,0.00002668739,0.00008493036,0.00013229366,0.00009046439],"domain_scores_gemma":[0.99874425,0.00051335414,0.00021338116,0.00015955593,0.00022663956,0.00014273041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032953545,0.00042050268,0.0005258983,0.002203785,0.0017314629,0.0033302752,0.00053119665,0.00079318666,0.0197902],"category_scores_gemma":[0.002818761,0.0004481571,0.00046942712,0.0017708037,0.0016332843,0.0049164207,0.0013837065,0.0014143742,0.0048026233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027218328,0.000009509941,0.00035270816,0.000047827634,0.000004214188,0.00008843254,0.00027708837,0.00030619305,0.0010197766,0.98445004,0.0039098724,0.009507132],"study_design_scores_gemma":[0.000011045743,0.000014124312,0.0006760649,0.000027379883,0.000011554707,0.00042060055,0.00023988522,0.0014627227,0.00084746245,0.9642263,0.032049414,0.000013373115],"about_ca_topic_score_codex":0.0012220104,"about_ca_topic_score_gemma":0.0017766292,"teacher_disagreement_score":0.0197902,"about_ca_system_score_codex":0.0012525897,"about_ca_system_score_gemma":0.0004922708,"threshold_uncertainty_score":0.066204846},"labels":[],"label_agreement":null},{"id":"W2407803650","doi":"","title":"On bounds for the norms of circulant matrices with the generalized Fibonacci and Lucas numbers.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Circulant matrix; Lucas number; Mathematics; Fibonacci polynomials; Lucas sequence; Pisano period; Combinatorics; Algebra over a field; Pure mathematics; Discrete mathematics; Arithmetic; Orthogonal polynomials; Classical orthogonal polynomials","score_opus":0.014234020915503574,"score_gpt":0.2474128530370896,"score_spread":0.23317883212158602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407803650","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070773676,0.03859458,0.5957105,0.011261261,0.0040192395,0.00025804373,0.0020240077,0.0014161177,0.27594262],"genre_scores_gemma":[0.6347281,0.019424621,0.27983916,0.004223984,0.007752879,0.0015446242,0.0025934267,0.0019047833,0.04798845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99410206,0.0017626953,0.00025695833,0.0007361674,0.0022493298,0.0008927867],"domain_scores_gemma":[0.94155824,0.044171542,0.002872428,0.0029286696,0.005281546,0.0031875821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00842509,0.004595355,0.0027891358,0.008012369,0.0034308285,0.00852288,0.00656942,0.0040422278,0.01786738],"category_scores_gemma":[0.06571478,0.0016422677,0.0018889048,0.005922371,0.0078349,0.017192913,0.00868615,0.011778598,0.005961512],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001441476,0.00008033603,0.0007277478,0.00027884482,0.00004821479,0.00013494733,0.0004504224,0.006751193,0.0013381483,0.9586482,0.011290497,0.020107262],"study_design_scores_gemma":[0.000016074691,0.00004455277,0.0005619768,0.00019837721,0.000036440713,0.0001911893,0.00015038498,0.029431872,0.0009287145,0.95869523,0.009686379,0.00005885471],"about_ca_topic_score_codex":0.0032949834,"about_ca_topic_score_gemma":0.0066559743,"teacher_disagreement_score":0.01786738,"about_ca_system_score_codex":0.0046617365,"about_ca_system_score_gemma":0.0025360314,"threshold_uncertainty_score":0.059772372},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.018605445227475998,"score_gpt":0.26704525977528215,"score_spread":0.24843981454780614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407807588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38629466,0.002534689,0.4584287,0.0017590594,0.0010499568,0.00008913267,0.00047005338,0.00026104014,0.14911278],"genre_scores_gemma":[0.89477503,0.001651076,0.05476009,0.0004384384,0.00072339934,0.0001524642,0.0004464587,0.00024170769,0.046811346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990846,0.00024402297,0.000058650192,0.00011697022,0.00037231922,0.00012344871],"domain_scores_gemma":[0.9979996,0.00047766475,0.00028224717,0.00013929886,0.000546918,0.0005543127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013321628,0.00072772265,0.0004656998,0.0019066556,0.0010358454,0.0022631157,0.0009717317,0.0007186346,0.005235538],"category_scores_gemma":[0.0040410724,0.00033627165,0.00061427726,0.00079790904,0.0022285392,0.005348981,0.0027101599,0.002020369,0.00075741997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015145396,0.000008124043,0.000071057344,0.000015203673,0.000003609006,0.000025969932,0.000078105935,0.00018649251,0.00069151353,0.9960517,0.00041046966,0.0024426642],"study_design_scores_gemma":[0.000008977615,0.00001890047,0.00020595592,0.000010806601,0.0000055472074,0.00011976525,0.00010062706,0.004138896,0.0007107723,0.9919653,0.0027055684,0.000008855473],"about_ca_topic_score_codex":0.00059069804,"about_ca_topic_score_gemma":0.00072740304,"teacher_disagreement_score":0.005235538,"about_ca_system_score_codex":0.0008356515,"about_ca_system_score_gemma":0.00061291055,"threshold_uncertainty_score":0.017514586},"labels":[],"label_agreement":null},{"id":"W2407813301","doi":"","title":"On flag-transitive 6 - (v, k, λ) designs with λ ≤ 5.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Flag (linear algebra); Mathematics; Transitive relation; Combinatorics; Arithmetic; Pure mathematics; Algebra over a field","score_opus":0.005895360350289094,"score_gpt":0.1853010819631754,"score_spread":0.17940572161288632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407813301","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49789968,0.00116723,0.3054812,0.0009967783,0.00042067893,0.00021414425,0.0010169165,0.00079920946,0.19200411],"genre_scores_gemma":[0.91167855,0.0005420077,0.058256343,0.00039081965,0.00010230861,0.00020055365,0.000520365,0.00013568625,0.028173318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801135,0.00073606585,0.00012143368,0.00024047491,0.00043703118,0.00045364402],"domain_scores_gemma":[0.99702126,0.0012194352,0.0006223653,0.00049945846,0.0003699934,0.0002675625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012252133,0.0005890117,0.00043708668,0.0013356858,0.0015609916,0.0021404924,0.000620451,0.0011531597,0.009366246],"category_scores_gemma":[0.003580959,0.0005011179,0.0005468034,0.0011661819,0.001468161,0.002274747,0.0016853453,0.00094260654,0.0019909819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025537866,0.000048564343,0.00064892235,0.00011340132,0.000021027028,0.0002036297,0.00035671334,0.0047777104,0.0050261556,0.96609205,0.0034023223,0.019054104],"study_design_scores_gemma":[0.0000818173,0.00014998572,0.0004963779,0.00014655282,0.000033284752,0.00036636755,0.00027579154,0.0162716,0.0050567524,0.9587423,0.018330552,0.000048523707],"about_ca_topic_score_codex":0.0010121255,"about_ca_topic_score_gemma":0.0022687786,"teacher_disagreement_score":0.009366246,"about_ca_system_score_codex":0.0013423414,"about_ca_system_score_gemma":0.0008186856,"threshold_uncertainty_score":0.031333208},"labels":[],"label_agreement":null},{"id":"W2407850864","doi":"","title":"On Cliques and Forcing m-Convexity Numbers of Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Convexity; Forcing (mathematics); Combinatorics; Mathematical analysis; Economics","score_opus":0.013092285066528236,"score_gpt":0.23910913531164196,"score_spread":0.22601685024511373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407850864","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4286749,0.0049943277,0.28143358,0.018623512,0.0007883909,0.00019750357,0.0025689234,0.00063316553,0.26208562],"genre_scores_gemma":[0.92979336,0.0016581641,0.045374062,0.0013487715,0.0008167099,0.00030553836,0.0010817492,0.00020176159,0.019419936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983512,0.00061165687,0.0000756002,0.00033194086,0.00029900545,0.0003306783],"domain_scores_gemma":[0.98436487,0.0119864885,0.0008549797,0.0010933599,0.00054750306,0.0011527387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024762766,0.000685203,0.0010918046,0.002374086,0.0036104734,0.0041214605,0.0017819029,0.0019142376,0.011606373],"category_scores_gemma":[0.0124201635,0.00094531005,0.001205565,0.0023822677,0.0060186447,0.010943514,0.0036195524,0.0047573936,0.0010736121],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000635044,0.00003303834,0.0007330226,0.00006635539,0.000011730229,0.000038919545,0.00013039829,0.003401044,0.0005108601,0.9846192,0.005236146,0.005155894],"study_design_scores_gemma":[0.000023651526,0.000014297682,0.00091207685,0.00003436253,0.000011697909,0.00007748628,0.0001482419,0.011381114,0.00043531222,0.9832388,0.0037039437,0.000019054043],"about_ca_topic_score_codex":0.0030357651,"about_ca_topic_score_gemma":0.004789466,"teacher_disagreement_score":0.011606373,"about_ca_system_score_codex":0.0032466117,"about_ca_system_score_gemma":0.0013333198,"threshold_uncertainty_score":0.03882718},"labels":[],"label_agreement":null},{"id":"W2407866540","doi":"","title":"The Second-minimum Gutman Index of The Unicyclic Graphs With Given Girth","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Girth (graph theory); Combinatorics","score_opus":0.023401138733837396,"score_gpt":0.2644847689060365,"score_spread":0.2410836301721991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407866540","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90781724,0.0008968767,0.026441777,0.0009541336,0.00021021238,0.000028501563,0.00073273544,0.00025454702,0.062663965],"genre_scores_gemma":[0.98695314,0.00030631304,0.0070985802,0.00011147799,0.00012277148,0.00004510342,0.0003851961,0.000085114254,0.0048924536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996092,0.00008758288,0.000017888942,0.0000890503,0.0000881126,0.0001083011],"domain_scores_gemma":[0.9984359,0.00059953297,0.00032161,0.00017737193,0.00016539093,0.00030018197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004608422,0.0006490768,0.0009509478,0.002691137,0.001643429,0.0029325748,0.0013391955,0.0012592701,0.005647328],"category_scores_gemma":[0.0031521267,0.00038421882,0.00048386565,0.0016400691,0.0013728451,0.0023231737,0.0011486745,0.0014322904,0.0006330808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057076185,0.00007193597,0.0035266974,0.0002845975,0.00005656484,0.00029870137,0.00065728504,0.00943336,0.014008555,0.945047,0.006501583,0.019542918],"study_design_scores_gemma":[0.00007188846,0.00013667595,0.005451365,0.00010863782,0.000065392174,0.0007407421,0.0004373153,0.043667126,0.00689149,0.9350906,0.0072655585,0.00007319715],"about_ca_topic_score_codex":0.0006634425,"about_ca_topic_score_gemma":0.0010679668,"teacher_disagreement_score":0.005647328,"about_ca_system_score_codex":0.0013502294,"about_ca_system_score_gemma":0.0006913507,"threshold_uncertainty_score":0.018892229},"labels":[],"label_agreement":null},{"id":"W2407870741","doi":"","title":"Chromatic Uniqueness of Complete Bipartite Graphs With Certain Edges Deleted.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Uniqueness; Chromatic scale; Combinatorics; Foster graph; Discrete mathematics; Graph; Mathematical analysis; Line graph; Voltage graph","score_opus":0.030791085862214265,"score_gpt":0.21710684521645315,"score_spread":0.18631575935423889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407870741","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83177125,0.00072412024,0.10236797,0.0022306198,0.00017681862,0.00010400242,0.0014990317,0.00026953136,0.060856655],"genre_scores_gemma":[0.9571817,0.0003432264,0.027814114,0.00032525288,0.000112357775,0.00009585919,0.0011876551,0.0001536465,0.012786305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992964,0.0002539234,0.000028625347,0.00018100422,0.00008379889,0.00015626293],"domain_scores_gemma":[0.9957052,0.002471842,0.0005219121,0.00051102054,0.00031875868,0.00047130874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011420932,0.00039534087,0.0005781077,0.001490331,0.0027683673,0.002680143,0.0016343085,0.0015410336,0.008380323],"category_scores_gemma":[0.005942235,0.00069346733,0.00065616827,0.0013440787,0.0022908289,0.0038905037,0.0015850373,0.0017826002,0.0007762744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003798991,0.00007150554,0.0039359513,0.00014136282,0.00003522099,0.00018736892,0.0004706718,0.009681092,0.004747677,0.95882136,0.008667561,0.01286033],"study_design_scores_gemma":[0.00009121133,0.000056358007,0.0036522185,0.000056682817,0.00005818233,0.00051886885,0.0007675317,0.045982946,0.0054756324,0.9340732,0.00920923,0.000057853948],"about_ca_topic_score_codex":0.002463321,"about_ca_topic_score_gemma":0.003178624,"teacher_disagreement_score":0.008380323,"about_ca_system_score_codex":0.0016399232,"about_ca_system_score_gemma":0.0010575162,"threshold_uncertainty_score":0.028034985},"labels":[],"label_agreement":null},{"id":"W2407897314","doi":"","title":"The (s, t) Jacobsthal and (s, t) Jacobsthal-Lucas Matrix Sequences.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.006518763573583821,"score_gpt":0.25729646948308627,"score_spread":0.25077770590950244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407897314","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30171785,0.00426915,0.31508723,0.005561237,0.0026275588,0.00027549738,0.0025285194,0.0010371364,0.36689577],"genre_scores_gemma":[0.7720229,0.0017183046,0.07326453,0.0011041538,0.0007087943,0.00024904046,0.0012800416,0.00039491407,0.14925726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949026,0.00009246452,0.000028955576,0.000094953626,0.0001479347,0.00014534286],"domain_scores_gemma":[0.999,0.00015147183,0.00018515953,0.00010243518,0.00033131344,0.0002295552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041172132,0.0008166871,0.0003978384,0.0024008797,0.0015739856,0.0022582705,0.00073130336,0.0011993919,0.017860277],"category_scores_gemma":[0.002999468,0.00031975887,0.0004729306,0.001283388,0.0019684453,0.0025083942,0.0014675963,0.001904808,0.005314496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006809431,0.000015185795,0.00019392159,0.00003556019,0.0000051993297,0.000113908354,0.00017252464,0.00051472214,0.002200288,0.9777018,0.0047077625,0.014271145],"study_design_scores_gemma":[0.000026299878,0.000048503796,0.00063015596,0.000049095717,0.000008973318,0.0004333775,0.00022511951,0.0059179724,0.003101797,0.95592535,0.033592258,0.000041063984],"about_ca_topic_score_codex":0.0022869871,"about_ca_topic_score_gemma":0.0030258591,"teacher_disagreement_score":0.017860277,"about_ca_system_score_codex":0.0012597949,"about_ca_system_score_gemma":0.0014393226,"threshold_uncertainty_score":0.05974853},"labels":[],"label_agreement":null},{"id":"W2407900408","doi":"","title":"Toughness and Existence of Fractional (g, f)-factors in Graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Toughness; Composite material; Materials science","score_opus":0.014090947025186651,"score_gpt":0.2377869134994423,"score_spread":0.22369596647425566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407900408","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78615576,0.0013814445,0.1406166,0.0031470885,0.0002299635,0.000082649116,0.0010603874,0.00050336827,0.0668228],"genre_scores_gemma":[0.96907985,0.0003198312,0.02199274,0.0002511821,0.00013185303,0.00007178289,0.0004451723,0.00009369113,0.007613985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869627,0.0003006769,0.00007720865,0.000377477,0.00020582967,0.00034251448],"domain_scores_gemma":[0.99097997,0.0053823073,0.0010381107,0.0008421504,0.00043834027,0.0013189785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011641219,0.0005890137,0.00085298065,0.0023453783,0.0036203607,0.004376621,0.0012473869,0.00163043,0.0105754165],"category_scores_gemma":[0.009768486,0.00081214326,0.0009937297,0.0017402454,0.0044390685,0.006852505,0.0027298827,0.0020263745,0.0008194958],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021409626,0.00005411689,0.0023336317,0.00010088271,0.00002398456,0.00014292316,0.0006548997,0.003307022,0.002466638,0.9768718,0.0040657204,0.009764329],"study_design_scores_gemma":[0.000031788197,0.00002356329,0.001169427,0.000041322968,0.000023653147,0.00028493957,0.00045587675,0.009877463,0.0012899699,0.98208964,0.0046822764,0.000030098383],"about_ca_topic_score_codex":0.0027326036,"about_ca_topic_score_gemma":0.0025016502,"teacher_disagreement_score":0.0105754165,"about_ca_system_score_codex":0.0017334957,"about_ca_system_score_gemma":0.0006713166,"threshold_uncertainty_score":0.035378277},"labels":[],"label_agreement":null},{"id":"W2407919410","doi":"","title":"(2, t)-choosasble graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.004380206951899161,"score_gpt":0.1767560710955668,"score_spread":0.17237586414366762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407919410","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29868224,0.0005298848,0.39499018,0.0030889974,0.00055555184,0.000354117,0.0046445015,0.0020227667,0.29513168],"genre_scores_gemma":[0.8302307,0.0004016201,0.063688196,0.0006481187,0.000113220805,0.0002340941,0.0023088004,0.0003494331,0.10202588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994754,0.00010286933,0.000026551637,0.00014355623,0.000109466455,0.00014212656],"domain_scores_gemma":[0.998323,0.00066227897,0.0002328269,0.00037327802,0.0001726336,0.00023590209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035328753,0.0005852219,0.00037601293,0.0008745793,0.0012519708,0.002366257,0.0008304023,0.0011972317,0.037984718],"category_scores_gemma":[0.0023294794,0.00039733315,0.00055565865,0.00097375474,0.0008845166,0.0024880392,0.0013071016,0.0015029587,0.0045973994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000440524,0.0001604034,0.0018365864,0.00023638764,0.000060072394,0.0009149906,0.0003786358,0.008171248,0.017438238,0.8997457,0.023501638,0.04711552],"study_design_scores_gemma":[0.00010384341,0.00007995698,0.0019587753,0.00007858947,0.00005778638,0.0014991763,0.00043981458,0.031967595,0.012816558,0.91426426,0.03668193,0.000051682677],"about_ca_topic_score_codex":0.0013397187,"about_ca_topic_score_gemma":0.002916941,"teacher_disagreement_score":0.037984718,"about_ca_system_score_codex":0.00088544626,"about_ca_system_score_gemma":0.000960918,"threshold_uncertainty_score":0.12707156},"labels":[],"label_agreement":null},{"id":"W2407922042","doi":"","title":"Further results on super edge magic deficiency of unicyclic graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; MAGIC (telescope); Enhanced Data Rates for GSM Evolution; Combinatorics; Astrophysics; Artificial intelligence; Computer science; Physics","score_opus":0.026578258816374763,"score_gpt":0.22588227168264205,"score_spread":0.19930401286626728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407922042","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38035947,0.0070273136,0.15467703,0.013046869,0.0010886965,0.0001244147,0.0021577396,0.0008606753,0.44065776],"genre_scores_gemma":[0.93141824,0.0031648995,0.03673428,0.0020695326,0.00057247415,0.00008905114,0.0018281179,0.00019670639,0.023926724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993772,0.00014335265,0.000028504632,0.00013515652,0.00018157541,0.00013429427],"domain_scores_gemma":[0.99513334,0.0030429866,0.00034696332,0.00064844126,0.00038000895,0.00044828613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008507209,0.00069988024,0.00080446264,0.0019485534,0.0011937892,0.002119955,0.0012364485,0.001085391,0.01935894],"category_scores_gemma":[0.005923191,0.0004200305,0.0005460258,0.0025880323,0.0018559952,0.005420261,0.0023822824,0.0030207653,0.0014671673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002522487,0.000104681436,0.002263519,0.00042249728,0.000024821467,0.00022182986,0.000364657,0.0046900534,0.004584291,0.9297837,0.01958744,0.037700452],"study_design_scores_gemma":[0.000036478228,0.00003409955,0.001054165,0.00006831409,0.000025080422,0.0004250917,0.00024555303,0.009762853,0.0018868907,0.9691417,0.017300442,0.00001933977],"about_ca_topic_score_codex":0.0012651471,"about_ca_topic_score_gemma":0.0017222312,"teacher_disagreement_score":0.01935894,"about_ca_system_score_codex":0.0011343403,"about_ca_system_score_gemma":0.0006356867,"threshold_uncertainty_score":0.064762056},"labels":[],"label_agreement":null},{"id":"W2407942700","doi":"","title":"Adjacent vertex distinguishing edge-coloring of planar graphs with girth at least five.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Girth (graph theory); Vertex (graph theory); Combinatorics; Planar graph; Enhanced Data Rates for GSM Evolution; Planar; Edge coloring; Graph; Computer science; Telecommunications; Line graph","score_opus":0.00910409737301284,"score_gpt":0.19796429761199413,"score_spread":0.18886020023898129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407942700","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7725292,0.0011615789,0.1298135,0.002339494,0.00028212674,0.00014107754,0.0023184514,0.000821274,0.09059316],"genre_scores_gemma":[0.9368303,0.00035742178,0.051372845,0.00030019044,0.0000787878,0.000056731085,0.0019288108,0.00012465476,0.008950232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991536,0.00023899968,0.000050652794,0.00018101805,0.00012960845,0.00024616084],"domain_scores_gemma":[0.995507,0.0027688898,0.00047290447,0.0006407434,0.00022778186,0.0003826948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070042006,0.00051980384,0.0005824449,0.0009967639,0.001493401,0.002285025,0.0015712813,0.0010754659,0.0059305406],"category_scores_gemma":[0.004149423,0.00049782643,0.00060446706,0.0015258619,0.0013649917,0.0024987806,0.0018498509,0.0016560962,0.000708631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085938594,0.0003121787,0.0075955335,0.0004521005,0.000073288924,0.00045051667,0.0006142126,0.03219703,0.0112479,0.8443279,0.023217207,0.07865268],"study_design_scores_gemma":[0.00010018555,0.00009933701,0.0033924822,0.00006422879,0.000071219925,0.00064999255,0.0006461517,0.0583674,0.007219758,0.91540706,0.013939033,0.00004319756],"about_ca_topic_score_codex":0.0021915827,"about_ca_topic_score_gemma":0.0031820568,"teacher_disagreement_score":0.0059305406,"about_ca_system_score_codex":0.0013949873,"about_ca_system_score_gemma":0.000946612,"threshold_uncertainty_score":0.019839644},"labels":[],"label_agreement":null},{"id":"W2407946072","doi":"","title":"Construction of Authentication Codes with Arbitration from Singular Symplectic Geometry.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Symplectic geometry; Mathematics; Arbitration; Geometry; Authentication (law); Computer science; Computer security; Law","score_opus":0.013167111322832261,"score_gpt":0.22219339557439616,"score_spread":0.2090262842515639,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407946072","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26550153,0.0006279806,0.6318546,0.0017895646,0.0006163673,0.00028036034,0.0005114433,0.00096375943,0.097854465],"genre_scores_gemma":[0.9358819,0.00023219029,0.048873063,0.0002661344,0.00011761681,0.000115942064,0.00024545804,0.00015795452,0.014109779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898976,0.00028060432,0.000064788,0.00012538767,0.00032383966,0.00021562418],"domain_scores_gemma":[0.99815744,0.00058925216,0.00021313911,0.0005797983,0.00020320891,0.00025718164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008310062,0.0005468232,0.00067099987,0.0011760702,0.0016070749,0.0016672021,0.0008202251,0.0012637133,0.0058692214],"category_scores_gemma":[0.0033225226,0.000408341,0.0007436834,0.0008541527,0.0027423762,0.0028289063,0.00526377,0.0020702877,0.0016370128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046873178,0.000019228552,0.00015483492,0.00002913157,0.0000054729344,0.0001501874,0.0001865597,0.0016456177,0.0017067044,0.98819077,0.0014719609,0.006392608],"study_design_scores_gemma":[0.000030312394,0.000040496914,0.00012584489,0.000023474635,0.000008992103,0.00024976008,0.00007255163,0.017461905,0.0026104418,0.97434324,0.005010605,0.00002235198],"about_ca_topic_score_codex":0.0003416284,"about_ca_topic_score_gemma":0.00038968708,"teacher_disagreement_score":0.0058692214,"about_ca_system_score_codex":0.00057285227,"about_ca_system_score_gemma":0.0010295783,"threshold_uncertainty_score":0.019634485},"labels":[],"label_agreement":null},{"id":"W2407951356","doi":"","title":"On the path-connectivity of lexicographic product graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Lexicographical order; Mathematics; Path (computing); Product (mathematics); Combinatorics; Computer science; Computer network; Geometry","score_opus":0.024398730678705793,"score_gpt":0.23422302795536384,"score_spread":0.20982429727665805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407951356","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34816578,0.0039433255,0.4935607,0.008492144,0.00032207067,0.00027441196,0.0034085673,0.0009901221,0.14084293],"genre_scores_gemma":[0.8422279,0.0035200033,0.12943763,0.0011051575,0.0004586805,0.00031862868,0.0035480168,0.00041042047,0.018973684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983595,0.000674113,0.00011073765,0.0003607223,0.00029313486,0.0002018881],"domain_scores_gemma":[0.97547543,0.019637447,0.0013203234,0.0016698731,0.0010374644,0.00085939304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016104417,0.00055214757,0.0007988669,0.0029743807,0.0021000428,0.0033316428,0.0014426344,0.0018002789,0.017988227],"category_scores_gemma":[0.021005714,0.0007659343,0.00063411676,0.0045844754,0.0034526803,0.012377651,0.0031289107,0.0024122589,0.0018081502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017723395,0.000088906425,0.0024961168,0.00024875428,0.000041125346,0.00037237105,0.00076800183,0.007968294,0.0012117692,0.9340376,0.011214779,0.041375056],"study_design_scores_gemma":[0.000027900856,0.000037619615,0.00069861056,0.00007335112,0.0000293026,0.00035918137,0.00029466435,0.016469123,0.00061706605,0.9734514,0.007925525,0.000016388947],"about_ca_topic_score_codex":0.002136814,"about_ca_topic_score_gemma":0.0027651663,"teacher_disagreement_score":0.017988227,"about_ca_system_score_codex":0.001187462,"about_ca_system_score_gemma":0.0008789519,"threshold_uncertainty_score":0.06017661},"labels":[],"label_agreement":null},{"id":"W2407981316","doi":"","title":"Reversing arcs in transitive tournaments to obtain maximum number of spanning cycles.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Reversing; Mathematics; Transitive relation; Combinatorics","score_opus":0.0065398971124581585,"score_gpt":0.21563064596938306,"score_spread":0.20909074885692489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407981316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.453992,0.0006736226,0.47133553,0.0005982103,0.0002687478,0.00024004695,0.00037000288,0.00093803904,0.071583875],"genre_scores_gemma":[0.88669837,0.00024254009,0.10229294,0.00014794499,0.000053001626,0.00010417969,0.0002943652,0.00015594542,0.010010803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993531,0.00023285141,0.00003852514,0.0001326058,0.00010427086,0.00013870433],"domain_scores_gemma":[0.9979232,0.0010913939,0.00017521494,0.0004297225,0.00014836769,0.00023209797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069268857,0.00038931798,0.00052155746,0.0007328382,0.0010121829,0.0014750992,0.00094790163,0.0007165065,0.0068918173],"category_scores_gemma":[0.0045881676,0.00027214733,0.00064093305,0.00079761486,0.000639323,0.0012085773,0.0008524915,0.001088004,0.0007274848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053473737,0.0005597177,0.003378544,0.00035015863,0.0001367221,0.0006111219,0.0005174318,0.106137395,0.027379286,0.6734312,0.012089372,0.1748744],"study_design_scores_gemma":[0.00015339087,0.0002750974,0.0013054645,0.00005986473,0.000111882786,0.00061244797,0.00023883823,0.34318373,0.0123500405,0.6288015,0.012868625,0.00003908105],"about_ca_topic_score_codex":0.0009186863,"about_ca_topic_score_gemma":0.0021545414,"teacher_disagreement_score":0.0068918173,"about_ca_system_score_codex":0.0005663009,"about_ca_system_score_gemma":0.0005607361,"threshold_uncertainty_score":0.023055434},"labels":[],"label_agreement":null},{"id":"W2408004674","doi":"","title":"On trees with double domination number equal to total domination number plus one.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Domination analysis; Combinatorics; Graph","score_opus":0.031216537974426327,"score_gpt":0.2883537486928328,"score_spread":0.2571372107184065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408004674","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50958323,0.00534553,0.2272179,0.004048151,0.00062594883,0.00015596054,0.0018664174,0.00070939446,0.25044748],"genre_scores_gemma":[0.91685,0.0025883021,0.04188624,0.000920271,0.0007490482,0.00015547815,0.001362037,0.00033410572,0.03515452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891865,0.0003017471,0.000058896072,0.00021377126,0.00021788174,0.0002889692],"domain_scores_gemma":[0.9941391,0.0039190473,0.00052971684,0.00045751128,0.00037966165,0.00057498575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086552114,0.00050095125,0.00086366583,0.0022514767,0.0019300091,0.0025761987,0.0011266693,0.0012675287,0.008614046],"category_scores_gemma":[0.0055637504,0.0004082937,0.0005808591,0.0020494997,0.0021474701,0.005449169,0.0022630459,0.0018563794,0.0013821331],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020215087,0.00006645928,0.0018285257,0.00026937248,0.000051150946,0.0005220965,0.000516829,0.008133987,0.004499393,0.93836033,0.012065956,0.033483867],"study_design_scores_gemma":[0.000031564374,0.000030403344,0.0010275989,0.00006418195,0.000040041923,0.0007279145,0.00024410921,0.016611533,0.0012299994,0.97016925,0.009800398,0.000022993836],"about_ca_topic_score_codex":0.0012501809,"about_ca_topic_score_gemma":0.0021955916,"teacher_disagreement_score":0.008614046,"about_ca_system_score_codex":0.0014395309,"about_ca_system_score_gemma":0.0006112593,"threshold_uncertainty_score":0.02881682},"labels":[],"label_agreement":null},{"id":"W2408032326","doi":"","title":"A study on the chaotic numbers of graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chaotic; Computer science; Artificial intelligence","score_opus":0.0193211483478812,"score_gpt":0.24495170933397864,"score_spread":0.22563056098609743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408032326","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6420327,0.006055447,0.106563665,0.004783991,0.00057636754,0.00008908794,0.0006267267,0.00019634131,0.23907565],"genre_scores_gemma":[0.9767551,0.0016244913,0.010360799,0.00020969287,0.00021475115,0.000053279644,0.00018048799,0.00005640013,0.010545166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966705,0.00011634221,0.00001300433,0.00006037413,0.00007800686,0.000065253545],"domain_scores_gemma":[0.99712676,0.0018621663,0.00030775557,0.0002811314,0.00017773634,0.00024450335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004549406,0.00027445023,0.0003733535,0.0014193957,0.0012011004,0.0018651213,0.00060690753,0.0006347894,0.005092418],"category_scores_gemma":[0.004763044,0.0001966578,0.00036479277,0.0013892475,0.0019733245,0.0030345672,0.0011832037,0.0010393121,0.00038628926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026117841,0.000012364238,0.000862991,0.000048925023,0.0000045087468,0.000038222915,0.00016617897,0.003152532,0.0006221406,0.9886126,0.0018057473,0.004647686],"study_design_scores_gemma":[0.000016225218,0.000032777403,0.0015281071,0.000043975477,0.000011569935,0.00024285672,0.00030120046,0.025397193,0.0011513152,0.95846605,0.012792081,0.000016537866],"about_ca_topic_score_codex":0.00089907757,"about_ca_topic_score_gemma":0.00087422645,"teacher_disagreement_score":0.005092418,"about_ca_system_score_codex":0.0012787586,"about_ca_system_score_gemma":0.00051931274,"threshold_uncertainty_score":0.017035842},"labels":[],"label_agreement":null},{"id":"W2408036120","doi":"","title":"Lattices generated by partial injective maps of finite sets.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Injective function; Mathematics; Pure mathematics","score_opus":0.01131094783969793,"score_gpt":0.23740451453196723,"score_spread":0.2260935666922693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408036120","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31509277,0.0036423118,0.38136357,0.0020755087,0.0009084408,0.00015122518,0.0023111836,0.0015945594,0.29286045],"genre_scores_gemma":[0.9107218,0.00083139463,0.043349355,0.00033358176,0.00051225844,0.000117252544,0.0012159247,0.00026964085,0.04264889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998326,0.00048587788,0.0001101891,0.0002857995,0.0005246876,0.0002673672],"domain_scores_gemma":[0.9969597,0.0013797196,0.0003347851,0.00039087934,0.0004223609,0.0005125199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011713983,0.0005843413,0.0005965462,0.0018541093,0.0016309773,0.0044261315,0.00088769075,0.0005442356,0.009691034],"category_scores_gemma":[0.0036106962,0.0005547675,0.0012046392,0.0010774811,0.002932769,0.005849362,0.002985678,0.0020299677,0.0022548984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007392829,0.000024418287,0.00028192214,0.00005227354,0.000014599678,0.00013033504,0.00026699004,0.0005770087,0.0010898544,0.9893644,0.001392528,0.0067317514],"study_design_scores_gemma":[0.000032716653,0.000025184107,0.0002756289,0.000029060713,0.000017307411,0.00036231044,0.00020398494,0.003679353,0.0029351667,0.98007005,0.012346676,0.000022489277],"about_ca_topic_score_codex":0.0006905539,"about_ca_topic_score_gemma":0.0008055311,"teacher_disagreement_score":0.009691034,"about_ca_system_score_codex":0.0012814624,"about_ca_system_score_gemma":0.0008400373,"threshold_uncertainty_score":0.03241974},"labels":[],"label_agreement":null},{"id":"W2408040767","doi":"","title":"A New Construction of Authentication Code with Arbitration from (2v+2+e)-dimensional Singular Pseudo-Symplectic Space.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Symplectic geometry; Mathematics; Arbitration; Space (punctuation); Code (set theory); Authentication (law); Pure mathematics; Computer science; Computer security; Programming language; Law; Political science","score_opus":0.009213695797496143,"score_gpt":0.21617221121582117,"score_spread":0.20695851541832502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408040767","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30202916,0.000647624,0.6256478,0.0012287395,0.00075292075,0.00019459105,0.00044507833,0.00095955195,0.068094485],"genre_scores_gemma":[0.9229321,0.00022574935,0.061460987,0.00024983505,0.00012261751,0.000105946834,0.00021131583,0.00012801841,0.014563511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957746,0.0000929036,0.000028095543,0.00006776287,0.00013751005,0.00009620516],"domain_scores_gemma":[0.9994629,0.000091110924,0.000059849866,0.00017200249,0.0000878393,0.00012632851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030384987,0.00034638995,0.00041408787,0.0007394514,0.001147859,0.0009928175,0.0005277988,0.0007989408,0.0045093643],"category_scores_gemma":[0.0009368816,0.00021189547,0.00052362494,0.0005752701,0.0013667698,0.001462119,0.002816032,0.0010735344,0.00092164736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087849585,0.000029221668,0.0002762127,0.000063774336,0.0000096764725,0.00033085817,0.00024170885,0.0020478002,0.010959333,0.96892405,0.0021109825,0.014918509],"study_design_scores_gemma":[0.00008330173,0.00018685528,0.00053532055,0.000045369696,0.000028610513,0.0012423729,0.00012150861,0.06379176,0.01718402,0.89655197,0.020138279,0.00009065613],"about_ca_topic_score_codex":0.00025534193,"about_ca_topic_score_gemma":0.00026190074,"teacher_disagreement_score":0.0045093643,"about_ca_system_score_codex":0.00030142223,"about_ca_system_score_gemma":0.0005976395,"threshold_uncertainty_score":0.01508534},"labels":[],"label_agreement":null},{"id":"W2408046040","doi":"","title":"Groups With Restricted Squaring Properties.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.010133294088683555,"score_gpt":0.1755435700132,"score_spread":0.16541027592451646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408046040","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3297307,0.0013167666,0.22605017,0.0020456775,0.00073458796,0.00013203561,0.00083987357,0.0009338805,0.4382163],"genre_scores_gemma":[0.9324483,0.0004999842,0.019323895,0.0005044328,0.0003744219,0.000072935276,0.0005266411,0.00014046044,0.04610899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992507,0.00016805064,0.0000481201,0.00018608484,0.00017842231,0.00016851173],"domain_scores_gemma":[0.99779236,0.00083212374,0.00029229574,0.00059177895,0.00027694862,0.00021458931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004980203,0.0005051206,0.0005277804,0.0012517703,0.0014610091,0.00256523,0.00056212564,0.0007490256,0.017171558],"category_scores_gemma":[0.0027003968,0.00029786414,0.000596181,0.0009569483,0.0019922925,0.003475407,0.002223716,0.0014027862,0.0031496151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005507435,0.000023221257,0.0002616715,0.000044268723,0.000011562931,0.00015554471,0.000184728,0.00055241707,0.0024929778,0.98439527,0.0020622925,0.009761041],"study_design_scores_gemma":[0.000017985358,0.000035690537,0.00026810213,0.000022583556,0.000016544842,0.0004338864,0.00014920664,0.0026986455,0.0025833324,0.9798884,0.013867445,0.000018100578],"about_ca_topic_score_codex":0.00044836925,"about_ca_topic_score_gemma":0.00067303755,"teacher_disagreement_score":0.017171558,"about_ca_system_score_codex":0.0004841794,"about_ca_system_score_gemma":0.00044991286,"threshold_uncertainty_score":0.057444572},"labels":[],"label_agreement":null},{"id":"W2408050576","doi":"","title":"An implicit degree Dirac condition for hamiltonian cycles.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"History and Theory of Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Dirac (video compression format); Hamiltonian (control theory); Pure mathematics; Mathematical physics; Mathematical optimization; Quantum mechanics; Physics; Acoustics","score_opus":0.05280466886297408,"score_gpt":0.3254888515919923,"score_spread":0.27268418272901823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408050576","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23233159,0.0026175897,0.08952559,0.004963728,0.0012307325,0.000050519157,0.0006577342,0.00019872433,0.66842383],"genre_scores_gemma":[0.9490055,0.0008001313,0.0100806095,0.00072274054,0.00034154856,0.00003885591,0.0002513953,0.00007524409,0.038683962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996859,0.00006694938,0.000018051878,0.00005994423,0.00010802759,0.00006123511],"domain_scores_gemma":[0.9992211,0.00030632663,0.00006376409,0.00013320232,0.00016607283,0.000109581684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042531252,0.00022844589,0.0002922687,0.0008990039,0.001366775,0.0019027947,0.00051487633,0.00088690914,0.011778298],"category_scores_gemma":[0.002800943,0.00022181765,0.00025910488,0.0007503479,0.0025106217,0.0041500335,0.0016581536,0.0018736877,0.0011159276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053941058,0.0000030568272,0.00006241999,0.0000088708275,7.224098e-7,0.000018379485,0.000045323075,0.000071210714,0.00017850393,0.99734616,0.0006904014,0.0015693814],"study_design_scores_gemma":[0.0000072429566,0.000004262416,0.00014628684,0.000009991943,0.0000020329585,0.000063730084,0.000053365868,0.0006024914,0.00021534151,0.9919962,0.006894225,0.000004768033],"about_ca_topic_score_codex":0.0011079167,"about_ca_topic_score_gemma":0.0017330304,"teacher_disagreement_score":0.011778298,"about_ca_system_score_codex":0.0009834114,"about_ca_system_score_gemma":0.000613597,"threshold_uncertainty_score":0.039402306},"labels":[],"label_agreement":null},{"id":"W2408059908","doi":"","title":"Note on the choosability of bipartite graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Discrete mathematics; Graph","score_opus":0.011782587158340381,"score_gpt":0.2348878012915454,"score_spread":0.22310521413320503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408059908","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060848475,0.01754349,0.27789712,0.03546676,0.008484235,0.00013713796,0.0020567058,0.0009888248,0.5965772],"genre_scores_gemma":[0.7762137,0.02369442,0.1015495,0.011020448,0.011911747,0.00026623308,0.002137598,0.0006131931,0.07259321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998992,0.00024795084,0.00004234401,0.00028144062,0.0003084739,0.00012778018],"domain_scores_gemma":[0.99162614,0.006717081,0.00020462861,0.00080305204,0.0002464054,0.00040271424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012821698,0.00089026784,0.0009454376,0.0015409632,0.0013790821,0.0024341238,0.0016208667,0.0013184614,0.01835794],"category_scores_gemma":[0.0065794257,0.0006066276,0.0009240223,0.002174183,0.0042593754,0.005049418,0.0029859843,0.005101943,0.0019323922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010753233,0.000056844554,0.0006943929,0.00029055311,0.00003305074,0.00029015407,0.00015589845,0.0025294537,0.0022960554,0.93732196,0.035812605,0.020411449],"study_design_scores_gemma":[0.000021255479,0.000032676962,0.00074934296,0.0000401202,0.000023431834,0.0002952274,0.00006631878,0.0038499916,0.00093129074,0.96424925,0.029720005,0.000021151342],"about_ca_topic_score_codex":0.0024145436,"about_ca_topic_score_gemma":0.0032406037,"teacher_disagreement_score":0.01835794,"about_ca_system_score_codex":0.0014133098,"about_ca_system_score_gemma":0.0006961318,"threshold_uncertainty_score":0.061413407},"labels":[],"label_agreement":null},{"id":"W2408065670","doi":"","title":"On bipartite factorization of complete bipartite multigraphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Factorization; Complete bipartite graph; Combinatorics; Algorithm; Graph","score_opus":0.009828748261300205,"score_gpt":0.1919110959007925,"score_spread":0.1820823476394923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408065670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06020256,0.0029070356,0.80639416,0.002238923,0.0004600945,0.00018174067,0.0014010796,0.00047439357,0.12574005],"genre_scores_gemma":[0.70166075,0.004081287,0.2194206,0.0015473721,0.0012917944,0.00039458906,0.0034681726,0.0004683031,0.06766715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984591,0.00059812603,0.00005400931,0.0003049599,0.000322562,0.000261194],"domain_scores_gemma":[0.99538463,0.0026521925,0.00041228588,0.00065814523,0.00054026424,0.00035240507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014234938,0.00091803004,0.0009567924,0.002104292,0.0016000743,0.0022286875,0.0010068249,0.0011943927,0.017019052],"category_scores_gemma":[0.006792344,0.0005841183,0.0010051543,0.0018461188,0.002205414,0.0058954656,0.0020951738,0.0022575464,0.0029451766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004854662,0.00003937034,0.00026593753,0.00012835089,0.000018043354,0.00009545289,0.00017763204,0.0057440703,0.0007592943,0.96925753,0.0097923735,0.013673355],"study_design_scores_gemma":[0.000008784357,0.000012423883,0.0001758826,0.000056292174,0.000007877693,0.000109747874,0.00006552426,0.020176934,0.0002241683,0.97282356,0.006328146,0.000010676129],"about_ca_topic_score_codex":0.0023265667,"about_ca_topic_score_gemma":0.0036559103,"teacher_disagreement_score":0.017019052,"about_ca_system_score_codex":0.0017199748,"about_ca_system_score_gemma":0.0008215444,"threshold_uncertainty_score":0.056934416},"labels":[],"label_agreement":null},{"id":"W2408084491","doi":"","title":"Dominating Sets and Independent Sets in a Tree.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Tree (set theory); Combinatorics","score_opus":0.012446516962027863,"score_gpt":0.2880995305409314,"score_spread":0.27565301357890354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408084491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25700474,0.017232772,0.4123596,0.008871793,0.0011277638,0.00022393238,0.0026172798,0.0004539384,0.30010822],"genre_scores_gemma":[0.7906159,0.007401926,0.13525549,0.0014162867,0.0012430162,0.00024947096,0.002117478,0.00019776243,0.061502706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901915,0.0002792114,0.000063392894,0.0002441511,0.00023579164,0.00015836947],"domain_scores_gemma":[0.9965211,0.0023196149,0.00027519258,0.00028807638,0.00026258512,0.00033344224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008725479,0.0005493498,0.00086251454,0.002303734,0.002063856,0.003593864,0.0010585014,0.0012832804,0.0067214672],"category_scores_gemma":[0.004289947,0.00070861576,0.00092722947,0.0031351338,0.0025015385,0.006750435,0.002058813,0.0027555698,0.001580806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044971606,0.00003374761,0.00046914793,0.00013427771,0.000026519538,0.00018367944,0.00044075435,0.0018627356,0.0013044532,0.9761435,0.0053089964,0.014047358],"study_design_scores_gemma":[0.000012353493,0.00001464084,0.00038711232,0.0000347868,0.000026416143,0.00036191533,0.00014805603,0.0041207424,0.00046824044,0.9809269,0.013490187,0.000008653242],"about_ca_topic_score_codex":0.0010965457,"about_ca_topic_score_gemma":0.0019629558,"teacher_disagreement_score":0.0067214672,"about_ca_system_score_codex":0.0015352367,"about_ca_system_score_gemma":0.000603376,"threshold_uncertainty_score":0.022485554},"labels":[],"label_agreement":null},{"id":"W2408117154","doi":"","title":"A Note On Off-Diagonal Small On-Line Ramsey Numbers For Paths.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Diagonal; Mathematics; Line (geometry); Combinatorics; Ramsey's theorem; Arithmetic; Geometry","score_opus":0.04508002687629247,"score_gpt":0.31045422223413716,"score_spread":0.2653741953578447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408117154","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067434825,0.0052437866,0.25394142,0.010234043,0.004426872,0.000106136,0.0004532896,0.0014528616,0.6567067],"genre_scores_gemma":[0.80733,0.0039992756,0.10973812,0.004192223,0.0021224332,0.00032083807,0.00028101774,0.00065137935,0.07136467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892634,0.0003938725,0.000047469017,0.00020543639,0.00030274127,0.00012407544],"domain_scores_gemma":[0.99509525,0.0032492199,0.0002222939,0.0005783413,0.0003877037,0.0004672694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00158397,0.00073010597,0.000638791,0.0016747883,0.0021917755,0.0031269467,0.0018249325,0.0015886138,0.024526043],"category_scores_gemma":[0.010689274,0.0003995868,0.00055804575,0.0012032745,0.003836294,0.010235367,0.003677588,0.004585807,0.0030377991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030467281,0.000013911037,0.00008106034,0.000049988666,0.0000027023334,0.000038114482,0.000075290474,0.0003930213,0.00048285248,0.98655385,0.005804159,0.0064745755],"study_design_scores_gemma":[0.000006881099,0.000012737662,0.00007982942,0.000022698807,0.0000038440953,0.00007446749,0.000040577102,0.0019761638,0.00038428404,0.9864871,0.010901519,0.000009967754],"about_ca_topic_score_codex":0.0006380031,"about_ca_topic_score_gemma":0.00095883425,"teacher_disagreement_score":0.024526043,"about_ca_system_score_codex":0.0010971485,"about_ca_system_score_gemma":0.0005866672,"threshold_uncertainty_score":0.08204776},"labels":[],"label_agreement":null},{"id":"W2408124517","doi":"","title":"(d, 1)-Total labellings of regular nonbipartite graphs and an application to flower snarks.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.00617550334832843,"score_gpt":0.2297922704067854,"score_spread":0.22361676705845698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408124517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35262853,0.0011379003,0.48310226,0.002420837,0.00045051874,0.00025883873,0.0023862757,0.0018049326,0.15580995],"genre_scores_gemma":[0.7427171,0.0008005623,0.21959259,0.00073422684,0.00021815741,0.0002605873,0.002131839,0.00055623084,0.032988794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992267,0.0002912018,0.00005023871,0.00017538277,0.00013262202,0.0001238727],"domain_scores_gemma":[0.9966523,0.0018539868,0.00034416319,0.0005327036,0.00027765054,0.00033919018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011416477,0.0004738961,0.00066838186,0.0015690738,0.0021415509,0.0031187774,0.0015230798,0.0015372063,0.008648126],"category_scores_gemma":[0.005532779,0.0006267244,0.0011941718,0.0022127314,0.001782405,0.0030214577,0.0021971788,0.0017260178,0.0009277044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009459686,0.000044534474,0.0006724764,0.00012228488,0.000015148479,0.00008086215,0.00021362098,0.006139182,0.0013395657,0.9610856,0.007655919,0.0225361],"study_design_scores_gemma":[0.000029871473,0.000023296407,0.0003800029,0.000036501417,0.000018189467,0.00016118288,0.00013721864,0.02802569,0.0010379694,0.9630042,0.007125581,0.000020297815],"about_ca_topic_score_codex":0.0026234204,"about_ca_topic_score_gemma":0.004520799,"teacher_disagreement_score":0.008648126,"about_ca_system_score_codex":0.0020981699,"about_ca_system_score_gemma":0.0007818435,"threshold_uncertainty_score":0.028930843},"labels":[],"label_agreement":null},{"id":"W2408144770","doi":"","title":"A Note on Edge Coloring of Graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Edge coloring; Enhanced Data Rates for GSM Evolution; Graph coloring; Combinatorics; Graph; Computer science; Artificial intelligence; Line graph","score_opus":0.02661254135441729,"score_gpt":0.2514698320177264,"score_spread":0.2248572906633091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408144770","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011032337,0.04978235,0.34521696,0.08242499,0.06088033,0.0001453112,0.0019407136,0.0019661132,0.44661093],"genre_scores_gemma":[0.22893406,0.07972354,0.42429632,0.05405349,0.0468604,0.0004374479,0.0024133425,0.0023559835,0.16092552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985164,0.0005659116,0.000069715505,0.00032537204,0.00035994453,0.00016265988],"domain_scores_gemma":[0.99275076,0.0053416286,0.00013094489,0.0009387818,0.00046276025,0.0003751625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001983534,0.0012475229,0.0013481664,0.0019488716,0.0026862833,0.0034096602,0.0029907979,0.0021545333,0.01627869],"category_scores_gemma":[0.0069314893,0.00073184015,0.0013555048,0.0036515084,0.004388672,0.008891208,0.0033138462,0.011132071,0.005026098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008499801,0.00007384917,0.00040097738,0.00043221822,0.000032716314,0.00026436232,0.00022777451,0.0020305424,0.0011687261,0.7339058,0.21638247,0.044995464],"study_design_scores_gemma":[0.000012334791,0.000023621391,0.00034712238,0.00010327499,0.000020229316,0.00021964089,0.000118322954,0.0024491884,0.0005509557,0.7922978,0.20383179,0.000025854131],"about_ca_topic_score_codex":0.0047151595,"about_ca_topic_score_gemma":0.008610056,"teacher_disagreement_score":0.01627869,"about_ca_system_score_codex":0.0019666278,"about_ca_system_score_gemma":0.0011795615,"threshold_uncertainty_score":0.054457605},"labels":[],"label_agreement":null},{"id":"W2408150763","doi":"","title":"[r, s, t]-colorings of fans.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Games and Media","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.03158892888145371,"score_gpt":0.2913085796984474,"score_spread":0.2597196508169937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408150763","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1630608,0.0015513838,0.3984835,0.0039632847,0.001298697,0.00046753843,0.0058457754,0.0016618104,0.42366716],"genre_scores_gemma":[0.678723,0.0012059724,0.15631102,0.0013374198,0.00041226202,0.00051679614,0.004022639,0.0007575214,0.15671335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984388,0.00055221346,0.00009696672,0.00037945295,0.00020974356,0.0003228207],"domain_scores_gemma":[0.9959496,0.0017794494,0.00035011998,0.00067710347,0.0006916751,0.0005519792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011639694,0.000947936,0.00090107066,0.0018869513,0.0028671531,0.0040841307,0.0013666846,0.0011917033,0.030915402],"category_scores_gemma":[0.0055846847,0.0007081021,0.0013960127,0.0018758059,0.0019302801,0.0037981668,0.0019336233,0.0019290954,0.00436799],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014690432,0.00006587177,0.0007898437,0.00016490392,0.00004481072,0.00021966721,0.00030643077,0.0036687576,0.0014477202,0.9527521,0.018684031,0.021709038],"study_design_scores_gemma":[0.00006243881,0.000029018694,0.0006058052,0.000066442895,0.00002997636,0.00039278096,0.00022808087,0.009334604,0.00086030696,0.9547425,0.03362066,0.000027392956],"about_ca_topic_score_codex":0.003411738,"about_ca_topic_score_gemma":0.0053622536,"teacher_disagreement_score":0.030915402,"about_ca_system_score_codex":0.0020400952,"about_ca_system_score_gemma":0.0011826723,"threshold_uncertainty_score":0.103422344},"labels":[],"label_agreement":null},{"id":"W2408167455","doi":"","title":"Alternating Subsets and Successions.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.014368515993745282,"score_gpt":0.28083414515952987,"score_spread":0.2664656291657846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408167455","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0892123,0.0088981725,0.31778964,0.005269736,0.002466467,0.00011996887,0.0009848961,0.0010244761,0.5742343],"genre_scores_gemma":[0.70993394,0.0041809073,0.10687033,0.002207401,0.001791517,0.00021779546,0.0014118309,0.00062093756,0.17276528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985964,0.0005116651,0.00012787277,0.0003132016,0.0002617047,0.00018928747],"domain_scores_gemma":[0.9980622,0.00090690044,0.00015757447,0.00037651023,0.0002826776,0.00021421626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001158255,0.00062659563,0.0007121738,0.0018101145,0.0024893368,0.002761563,0.0010336274,0.0009086684,0.017736832],"category_scores_gemma":[0.0039026705,0.0005936275,0.0011483189,0.0016743803,0.0032394177,0.00776393,0.0025954638,0.0027537881,0.004430186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002003329,0.000014415601,0.000150873,0.000035131972,0.0000064224723,0.00008560324,0.00018394885,0.00014099572,0.00031456153,0.9867488,0.0032764794,0.009022663],"study_design_scores_gemma":[0.0000067743467,0.000010232032,0.000151978,0.000016998254,0.000008475827,0.0002451955,0.00011250434,0.0007830136,0.00030283324,0.97833145,0.020023467,0.0000071123573],"about_ca_topic_score_codex":0.0010815066,"about_ca_topic_score_gemma":0.0019646268,"teacher_disagreement_score":0.017736832,"about_ca_system_score_codex":0.0011151397,"about_ca_system_score_gemma":0.0005239909,"threshold_uncertainty_score":0.05933559},"labels":[],"label_agreement":null},{"id":"W2408197132","doi":"","title":"The linear 2-arboricity of some planar graphs","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arboricity; Mathematics; Planar graph; Planar; Dense graph; 1-planar graph; Combinatorics; Chordal graph; Graph; Computer science","score_opus":0.004609191502419453,"score_gpt":0.18747168088702892,"score_spread":0.18286248938460947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408197132","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8111871,0.00036604333,0.07697341,0.001685704,0.000043725755,0.000053043565,0.00093649863,0.00017277237,0.10858176],"genre_scores_gemma":[0.96818775,0.00036762032,0.013024239,0.0002668809,0.00009294538,0.000050472747,0.0007819128,0.000074952346,0.01715329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996929,0.00008489341,0.00001158434,0.00006738955,0.00008148002,0.00006179963],"domain_scores_gemma":[0.99872154,0.00078658067,0.00022652182,0.00006845094,0.000085325504,0.000111439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024496438,0.0005696646,0.00036483936,0.0009540342,0.0007120689,0.0016361137,0.0006933566,0.00066342,0.00839112],"category_scores_gemma":[0.0017698354,0.00045813358,0.00051202846,0.001258619,0.0011320652,0.0015322231,0.0007500734,0.0015083409,0.0005926015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021020556,0.00012747617,0.0030407133,0.0002076813,0.000058294536,0.00062575424,0.0006376797,0.046510246,0.009033994,0.9091514,0.006082352,0.024314225],"study_design_scores_gemma":[0.000058423295,0.000061754865,0.0021734792,0.000027146383,0.000033333763,0.0003254084,0.00026352852,0.07795295,0.0028200974,0.91143936,0.0048230747,0.000021529922],"about_ca_topic_score_codex":0.0017162478,"about_ca_topic_score_gemma":0.002704922,"teacher_disagreement_score":0.00839112,"about_ca_system_score_codex":0.00079479173,"about_ca_system_score_gemma":0.00035997096,"threshold_uncertainty_score":0.028071046},"labels":[],"label_agreement":null},{"id":"W2408216048","doi":"","title":"Some Properties of Padovan Sequence by Matrix Methods.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Sequence (biology); Matrix (chemical analysis); Composite material; Materials science; Genetics; Biology","score_opus":0.027655477010485298,"score_gpt":0.33281840729094625,"score_spread":0.30516293028046093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408216048","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13777117,0.0048957653,0.4772915,0.0030750257,0.0020649333,0.00014747823,0.000965977,0.000873371,0.3729148],"genre_scores_gemma":[0.764935,0.0033541636,0.106759034,0.0014264967,0.0018030484,0.00031274458,0.0010367869,0.00095508643,0.11941762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943465,0.0001950344,0.000033596156,0.00008513729,0.00017268892,0.0000789139],"domain_scores_gemma":[0.9986313,0.00059052894,0.00014570724,0.0001721622,0.00025762714,0.00020269923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001062855,0.00073132734,0.00061193726,0.0024591181,0.001230649,0.0023887565,0.0010328513,0.0009683703,0.019179976],"category_scores_gemma":[0.005357032,0.00035946837,0.0006271982,0.0016809121,0.0020688146,0.003774332,0.0021063988,0.002248809,0.0047598844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021656639,0.00001457334,0.00011097947,0.000045821533,0.0000049133664,0.000059054404,0.000099150035,0.000592011,0.0005810393,0.9842445,0.0030552964,0.011171013],"study_design_scores_gemma":[0.000013473091,0.000024422037,0.00013443513,0.000029026816,0.0000062098657,0.00020222025,0.000040222993,0.0062093777,0.000868337,0.9825821,0.009874367,0.000015862423],"about_ca_topic_score_codex":0.0005760753,"about_ca_topic_score_gemma":0.0006732486,"teacher_disagreement_score":0.019179976,"about_ca_system_score_codex":0.0006373364,"about_ca_system_score_gemma":0.0005540879,"threshold_uncertainty_score":0.06416339},"labels":[],"label_agreement":null},{"id":"W2408235952","doi":"","title":"On geodetic and k-geodetic sets in graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Geodetic datum; Mathematics; Graph; Geodesy; Combinatorics; Geography","score_opus":0.009871037274039877,"score_gpt":0.27051668293231473,"score_spread":0.26064564565827486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408235952","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5221213,0.012756873,0.32670394,0.007673203,0.00061770977,0.00023408631,0.00169474,0.00021385205,0.12798433],"genre_scores_gemma":[0.93687737,0.006267107,0.044286475,0.00078263716,0.0011003689,0.00024563173,0.00070828985,0.00007899347,0.009653061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774677,0.0006854682,0.00013096533,0.00049611815,0.0005639645,0.00037670688],"domain_scores_gemma":[0.9725628,0.021922864,0.0026336801,0.0010548444,0.0008698814,0.0009559885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018936187,0.0012408787,0.0013664978,0.0043195947,0.0029229955,0.0039457646,0.0021001687,0.0019007807,0.00690445],"category_scores_gemma":[0.014332246,0.0008215573,0.0011003311,0.0065815956,0.005430123,0.009144283,0.0039386144,0.0034853301,0.00085697335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001827569,0.000113676404,0.0043199915,0.0005088539,0.00009201583,0.0004053439,0.001112837,0.028920576,0.0028369087,0.93411773,0.004729841,0.022659471],"study_design_scores_gemma":[0.000037036596,0.00013219194,0.003970328,0.0001605403,0.00010209498,0.0010484909,0.0006837694,0.036846768,0.0021096377,0.9450145,0.0098409485,0.00005372593],"about_ca_topic_score_codex":0.0012973963,"about_ca_topic_score_gemma":0.0015368096,"teacher_disagreement_score":0.00690445,"about_ca_system_score_codex":0.0026927001,"about_ca_system_score_gemma":0.0007438769,"threshold_uncertainty_score":0.023097694},"labels":[],"label_agreement":null},{"id":"W2408238360","doi":"","title":"Conditional Lucas Pseudoprimes.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"History and Theory of Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.036131853184050045,"score_gpt":0.29248237238352803,"score_spread":0.256350519199478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408238360","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050990894,0.002960874,0.046951167,0.004634516,0.001033419,0.000028857008,0.000608807,0.0005527612,0.89223874],"genre_scores_gemma":[0.8287278,0.0013719857,0.016557088,0.0010574836,0.000630387,0.000054318658,0.00034954483,0.0002351269,0.15101618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961424,0.00011131291,0.000015632315,0.00007939425,0.0001167698,0.00006264905],"domain_scores_gemma":[0.9994159,0.00021618983,0.000069531205,0.00010714743,0.00012532384,0.000065926935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043444388,0.00045159593,0.0002965073,0.0011783948,0.0015645906,0.002240173,0.00047192478,0.0006728643,0.02371093],"category_scores_gemma":[0.0019769722,0.0002485491,0.00028877766,0.00072146585,0.0027544678,0.0040776557,0.0015979161,0.001953668,0.003804467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009645569,0.000002106811,0.000028779823,0.000008650678,7.374348e-7,0.000016306833,0.00004512154,0.000036677255,0.000101693426,0.99497956,0.0019184292,0.0028522885],"study_design_scores_gemma":[0.000011757515,0.0000096765325,0.00023282557,0.00002448958,0.0000052373266,0.00015764135,0.000076764474,0.0005279765,0.0007401733,0.9314139,0.066789925,0.000009558391],"about_ca_topic_score_codex":0.0007686016,"about_ca_topic_score_gemma":0.0013118272,"teacher_disagreement_score":0.02371093,"about_ca_system_score_codex":0.0016022087,"about_ca_system_score_gemma":0.00045963153,"threshold_uncertainty_score":0.07932097},"labels":[],"label_agreement":null},{"id":"W2408256222","doi":"","title":"A note on fragments in a locally k-critical n-connected graph.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Graph","score_opus":0.011176491418987328,"score_gpt":0.26357124492893474,"score_spread":0.25239475350994744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408256222","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2596666,0.011823094,0.42194515,0.011514504,0.0022154332,0.00022088447,0.001673751,0.0015198507,0.28942063],"genre_scores_gemma":[0.81051916,0.0049660914,0.14559898,0.0015499387,0.0012820385,0.00010658126,0.0013787753,0.00051649177,0.034082048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948883,0.00011494262,0.000028961831,0.00014567653,0.00014995504,0.000071558],"domain_scores_gemma":[0.9973303,0.0014598286,0.00018637111,0.00050383975,0.0002049353,0.00031460702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006151329,0.00059027004,0.00066606654,0.0028147306,0.0025449696,0.0020623205,0.0016362291,0.0012903645,0.010531501],"category_scores_gemma":[0.005112793,0.000465108,0.00074249797,0.0024909214,0.0040680217,0.0063233166,0.0034426225,0.0029502697,0.0014422457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016491419,0.000024261226,0.0014639704,0.00019200091,0.000019684961,0.0018603307,0.00096835924,0.0031493884,0.0026855832,0.94687283,0.0153431995,0.027255464],"study_design_scores_gemma":[0.000009557571,0.000031941927,0.0011912753,0.000059566893,0.000023632329,0.0018169327,0.000500425,0.007454607,0.0012754024,0.94948286,0.0381279,0.000026009944],"about_ca_topic_score_codex":0.003100973,"about_ca_topic_score_gemma":0.004391177,"teacher_disagreement_score":0.010531501,"about_ca_system_score_codex":0.0011242587,"about_ca_system_score_gemma":0.0003979304,"threshold_uncertainty_score":0.03523141},"labels":[],"label_agreement":null},{"id":"W2408260111","doi":"","title":"On L(d, 1)-Labelings of the Cartesian Product of Two Cycles.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Mathematics; Product (mathematics); Cartesian coordinate system; Combinatorics; Geometry","score_opus":0.018703492018346073,"score_gpt":0.2449356037239683,"score_spread":0.22623211170562224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408260111","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40659958,0.002799272,0.35772827,0.005870403,0.0006760402,0.00023657609,0.0040892926,0.0013093795,0.22069116],"genre_scores_gemma":[0.80292124,0.0015168934,0.1443622,0.0017286901,0.00043229805,0.00035793186,0.0034550766,0.0006288841,0.044596884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980438,0.0006794227,0.00013667475,0.00050878496,0.00026649467,0.00036478933],"domain_scores_gemma":[0.9931538,0.004143977,0.00078797224,0.00090679445,0.00045762485,0.00054985075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013211205,0.0007259059,0.00087778305,0.0021602497,0.0030560018,0.0045419144,0.0014442427,0.0019355272,0.014333265],"category_scores_gemma":[0.0072185346,0.0009831355,0.0012374334,0.0027981673,0.0029860127,0.0076811244,0.003728136,0.002817547,0.0025270756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009990861,0.00003526104,0.00066617556,0.00011436241,0.000014118472,0.000094391515,0.00037162047,0.0020134342,0.00085014856,0.9738831,0.007044267,0.014813314],"study_design_scores_gemma":[0.000025146179,0.000014816805,0.00031355437,0.00005209654,0.000013505761,0.00015962658,0.00020832557,0.0053527337,0.0006029629,0.9835623,0.009676612,0.000018418457],"about_ca_topic_score_codex":0.002301128,"about_ca_topic_score_gemma":0.003004267,"teacher_disagreement_score":0.014333265,"about_ca_system_score_codex":0.0026260503,"about_ca_system_score_gemma":0.00092971744,"threshold_uncertainty_score":0.047949612},"labels":[],"label_agreement":null},{"id":"W2408266333","doi":"","title":"Simple 3-designs of PSL(2, 2 n ) with block size 7.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; PSL; Simple (philosophy); Block (permutation group theory); Block size; Arithmetic; Combinatorics; Computer science","score_opus":0.005800393458211768,"score_gpt":0.19325128901077432,"score_spread":0.18745089555256256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408266333","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35755384,0.0011861807,0.420514,0.0013616331,0.0007507428,0.00071563723,0.0019094727,0.002014784,0.21399374],"genre_scores_gemma":[0.8348203,0.00038094685,0.1275356,0.0005702855,0.00012425681,0.00041317742,0.0006030879,0.00017797186,0.03537435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990747,0.00035171647,0.000054297452,0.0001201538,0.0002249155,0.00017422225],"domain_scores_gemma":[0.9987016,0.00035393465,0.00020364784,0.00033277538,0.00027359082,0.00013441058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071727135,0.00070554676,0.00044304525,0.000658298,0.00088716444,0.0013048515,0.00066600187,0.0010232847,0.017309071],"category_scores_gemma":[0.0019216632,0.0003850174,0.00046814865,0.0006114685,0.0008823348,0.0009370043,0.0009109714,0.00066956325,0.004402102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020006376,0.0003338268,0.0016684306,0.00064189127,0.00014468486,0.0008976737,0.00055678084,0.018607734,0.06977704,0.76570755,0.022031995,0.1176319],"study_design_scores_gemma":[0.00073428644,0.0013516211,0.0021322796,0.0003123988,0.00016443801,0.0011771366,0.00030847598,0.07217831,0.061146863,0.7572143,0.103088476,0.00019128992],"about_ca_topic_score_codex":0.00060869375,"about_ca_topic_score_gemma":0.002076545,"teacher_disagreement_score":0.017309071,"about_ca_system_score_codex":0.00075227604,"about_ca_system_score_gemma":0.00092088897,"threshold_uncertainty_score":0.0579046},"labels":[],"label_agreement":null},{"id":"W2408273669","doi":"","title":"Some Theorems On Bernoulli And Euler Numbers.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bernoulli's principle; Euler's formula; Euler number (physics); Bernoulli number; Pure mathematics; Mathematical analysis; Semi-implicit Euler method; Backward Euler method; Euler equations; Physics; Thermodynamics","score_opus":0.022045923189833144,"score_gpt":0.2819477013296972,"score_spread":0.25990177813986404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408273669","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038637966,0.043335292,0.16730718,0.018491015,0.0059844027,0.00006819277,0.0016469103,0.0004010512,0.724128],"genre_scores_gemma":[0.6305015,0.042979464,0.08678546,0.00833559,0.01152035,0.0003267562,0.001880009,0.0005321076,0.21713883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938667,0.00017237476,0.000039524817,0.00009113717,0.00024290824,0.00006729512],"domain_scores_gemma":[0.9983638,0.0009358776,0.00013631808,0.00015293072,0.00026593416,0.00014529596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016279372,0.0009106056,0.0005851812,0.0030040646,0.0015082224,0.002464554,0.00090908626,0.0010199662,0.016425835],"category_scores_gemma":[0.0046931948,0.0004177321,0.000787756,0.002184251,0.0030512896,0.0058843256,0.0019198295,0.0032014742,0.0035867572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050152994,0.000006403914,0.00008386724,0.00003866425,0.0000032897,0.000036096902,0.00006929345,0.00012287321,0.00012212565,0.9875882,0.0068472,0.0050769113],"study_design_scores_gemma":[0.000003587373,0.0000049652417,0.00018602656,0.000024009916,0.000003807586,0.00009545218,0.00002589336,0.00033966673,0.00011638435,0.9817432,0.017452296,0.000004739254],"about_ca_topic_score_codex":0.0010091653,"about_ca_topic_score_gemma":0.0012639842,"teacher_disagreement_score":0.016425835,"about_ca_system_score_codex":0.0014412146,"about_ca_system_score_gemma":0.000687324,"threshold_uncertainty_score":0.05494994},"labels":[],"label_agreement":null},{"id":"W2408302900","doi":"","title":"Some Properties of Macula's matrix and its complement.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Complement (music); Mathematics; Matrix (chemical analysis); Chemistry; Chromatography","score_opus":0.015798140211880057,"score_gpt":0.27668856394073416,"score_spread":0.26089042372885407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408302900","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29694918,0.0076677944,0.2008898,0.0062344405,0.001430658,0.0001188822,0.0015694269,0.00076971157,0.48437008],"genre_scores_gemma":[0.8951298,0.0021133374,0.033660095,0.0013409387,0.0012588506,0.0001445193,0.000775322,0.00031932737,0.06525774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939024,0.0001502973,0.000044942542,0.00012409956,0.00018638115,0.00010408954],"domain_scores_gemma":[0.9970902,0.0014084771,0.0003752242,0.00030380965,0.0004757676,0.0003463578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008900685,0.0006965154,0.00078349584,0.0025245142,0.002166864,0.0041985023,0.0010732061,0.0011440989,0.022082068],"category_scores_gemma":[0.0061861263,0.0003849367,0.0009080591,0.002292955,0.0024547763,0.005086833,0.0017193607,0.0022685241,0.0038398125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016594633,0.000010828364,0.000089778296,0.000020590602,0.000004518568,0.00009199142,0.00013739427,0.00015541098,0.00031520362,0.99320674,0.0023378495,0.0036131672],"study_design_scores_gemma":[0.000009692746,0.000011990228,0.00016974748,0.000013824339,0.000005782694,0.00030514563,0.000064020285,0.001992863,0.00028869096,0.98981315,0.007312909,0.000012187122],"about_ca_topic_score_codex":0.0014605313,"about_ca_topic_score_gemma":0.0012114766,"teacher_disagreement_score":0.022082068,"about_ca_system_score_codex":0.0010697896,"about_ca_system_score_gemma":0.0007421789,"threshold_uncertainty_score":0.07387185},"labels":[],"label_agreement":null},{"id":"W2408325732","doi":"","title":"New Class of Difference Systems of Sets with Three Blocks.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Class (philosophy); Pure mathematics; Computer science; Artificial intelligence","score_opus":0.01285769250195031,"score_gpt":0.19633251520455713,"score_spread":0.18347482270260682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408325732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33966908,0.0017133364,0.40932766,0.0017125998,0.00142628,0.00021799463,0.0013971501,0.0007144252,0.24382147],"genre_scores_gemma":[0.88938725,0.00037640473,0.06648152,0.00068734435,0.00039546998,0.00017859208,0.0008803598,0.00013198139,0.04148114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999263,0.00012917197,0.000047330297,0.00018679621,0.00023391763,0.00013973337],"domain_scores_gemma":[0.9985586,0.00049814483,0.00016164871,0.00027941796,0.00025778826,0.00024433565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004267415,0.00029648043,0.0004764557,0.0016251821,0.0014051669,0.0023408895,0.0010268526,0.0010347521,0.013093244],"category_scores_gemma":[0.0021041788,0.00035796865,0.00057015073,0.00080088753,0.0016839107,0.0028212068,0.0018682514,0.0019580082,0.001486667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027829345,0.000017364693,0.00021157291,0.000022775925,0.000004819758,0.000064780674,0.00007616196,0.0003856593,0.0013401405,0.99195826,0.0014721274,0.0044184597],"study_design_scores_gemma":[0.000045402678,0.00004469059,0.0004719871,0.000022682609,0.000010463061,0.00051272113,0.00010739453,0.010239457,0.0017516033,0.9638976,0.022870557,0.000025416815],"about_ca_topic_score_codex":0.00057283946,"about_ca_topic_score_gemma":0.00078494824,"teacher_disagreement_score":0.013093244,"about_ca_system_score_codex":0.0010975929,"about_ca_system_score_gemma":0.00063202844,"threshold_uncertainty_score":0.043801248},"labels":[],"label_agreement":null},{"id":"W2408343898","doi":"","title":"Restricted total domination in graphs with minimum degree two.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Combinatorics; Physics","score_opus":0.016865700453849705,"score_gpt":0.27530552873986064,"score_spread":0.2584398282860109,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408343898","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78514993,0.0015083201,0.11466201,0.0017081256,0.000088050416,0.000105531704,0.0014493467,0.00055255886,0.09477609],"genre_scores_gemma":[0.9713993,0.00050993485,0.013173065,0.00022646379,0.000062195984,0.00008363624,0.0007370915,0.00010455956,0.013703909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993788,0.00017487313,0.000029555044,0.00014340936,0.00012140447,0.00015196051],"domain_scores_gemma":[0.99590474,0.0024182904,0.0004291266,0.0005464359,0.00029711865,0.00040420255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005287144,0.00034649202,0.00055230677,0.0010156638,0.0009689808,0.0014897387,0.0011186166,0.0005262277,0.0067761927],"category_scores_gemma":[0.0035718682,0.00034179032,0.00052181655,0.0010262189,0.0010555645,0.0026630384,0.0013313846,0.00086616504,0.0006409297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00092917465,0.0001987057,0.008293365,0.00090911536,0.00021855462,0.0012379199,0.0020058625,0.026322009,0.034915764,0.8076188,0.019309588,0.09804111],"study_design_scores_gemma":[0.00014506873,0.0000870422,0.0043179146,0.000113217146,0.00013812858,0.0018951944,0.00067927997,0.05269882,0.009989907,0.9084806,0.021408506,0.000046272486],"about_ca_topic_score_codex":0.0012583714,"about_ca_topic_score_gemma":0.0021106466,"teacher_disagreement_score":0.0067761927,"about_ca_system_score_codex":0.0006305036,"about_ca_system_score_gemma":0.0004460351,"threshold_uncertainty_score":0.0226686},"labels":[],"label_agreement":null},{"id":"W2408378546","doi":"","title":"A Contribution to the characterization of Quasi-groups that are Isotopic to Abelian groups.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Abelian group; Mathematics; Characterization (materials science); Pure mathematics; Nanotechnology; Materials science","score_opus":0.00892940864600261,"score_gpt":0.2285353064254919,"score_spread":0.2196058977794893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408378546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12546593,0.004586497,0.7499912,0.005109522,0.002252411,0.0001598727,0.0012290283,0.0013712632,0.109834276],"genre_scores_gemma":[0.6694539,0.0034956732,0.26154897,0.002499732,0.00400413,0.00020145313,0.0028215477,0.0010073493,0.054967187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986131,0.00034230668,0.00011946567,0.0003141875,0.00045178583,0.00015903034],"domain_scores_gemma":[0.9944892,0.0024051582,0.00038099833,0.001727306,0.00058838533,0.00040891336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011764943,0.0005819985,0.00072923646,0.0017513903,0.0014370292,0.0026076671,0.0012054375,0.0009543184,0.009642332],"category_scores_gemma":[0.007456944,0.0003424581,0.0006395506,0.0022123272,0.002496786,0.007339859,0.0035216978,0.0023058404,0.0025285436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015013745,0.00014628695,0.0017892586,0.00024692863,0.000033503133,0.00015649656,0.00052327436,0.0017042673,0.0050492594,0.898441,0.016547592,0.07521194],"study_design_scores_gemma":[0.000021309073,0.00008810878,0.0009445736,0.000060673334,0.00002735265,0.00063005113,0.00022570282,0.012206998,0.0038221953,0.9154756,0.066463985,0.000033465614],"about_ca_topic_score_codex":0.00050017424,"about_ca_topic_score_gemma":0.0004470554,"teacher_disagreement_score":0.009642332,"about_ca_system_score_codex":0.00067555014,"about_ca_system_score_gemma":0.0007121124,"threshold_uncertainty_score":0.03225684},"labels":[],"label_agreement":null},{"id":"W2408385882","doi":"","title":"Solutions of Some Diophantine Equations Using Generalized Fibonacci and Lucas Sequences.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Mathematics; Lucas sequence; Diophantine equation; Lucas number; Diophantine set; Fibonacci polynomials; Pisano period; Combinatorics; Discrete mathematics; Pure mathematics; Classical orthogonal polynomials; Orthogonal polynomials","score_opus":0.025054963444643967,"score_gpt":0.2798778123028814,"score_spread":0.2548228488582374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408385882","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36949813,0.008033753,0.37785524,0.0046279584,0.0016910151,0.00021213216,0.00094846723,0.00032823038,0.23680498],"genre_scores_gemma":[0.8361139,0.00267761,0.09652917,0.00056396064,0.00056117406,0.00018456893,0.00054182624,0.00018497228,0.06264285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966776,0.00008207247,0.000022494998,0.000040677667,0.00011965093,0.00006734763],"domain_scores_gemma":[0.99956566,0.00021089603,0.000063295665,0.000036789286,0.0000832698,0.000040087936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052753097,0.0006929467,0.0007400132,0.0011913878,0.0014134134,0.001705997,0.0009079947,0.0013263684,0.008561111],"category_scores_gemma":[0.00314596,0.0004761365,0.00092815445,0.0010999999,0.0012445594,0.0023492174,0.0013329821,0.0019209809,0.0012413877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000169566,0.000011615419,0.00011862187,0.000049922506,0.000009039199,0.000104242405,0.00015689373,0.0023681617,0.0007632059,0.9896402,0.002084731,0.004676383],"study_design_scores_gemma":[0.000032317424,0.000013301881,0.0001245049,0.000027467098,0.000008228476,0.00013761541,0.00010899457,0.019472081,0.0004920247,0.97493726,0.0046290588,0.000017162623],"about_ca_topic_score_codex":0.0016356581,"about_ca_topic_score_gemma":0.0032219894,"teacher_disagreement_score":0.008561111,"about_ca_system_score_codex":0.001332878,"about_ca_system_score_gemma":0.0008463568,"threshold_uncertainty_score":0.028639734},"labels":[],"label_agreement":null},{"id":"W2408389204","doi":"","title":"Super-Mixed-Connected Line Digraphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Line (geometry); Combinatorics; Geometry","score_opus":0.023519981849236565,"score_gpt":0.2252027664394718,"score_spread":0.20168278459023523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408389204","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19662164,0.0005244813,0.66891944,0.0008687792,0.00018523536,0.00017724943,0.0019913302,0.0012434389,0.12946847],"genre_scores_gemma":[0.7234976,0.00042216916,0.20822394,0.00045505757,0.00008211038,0.00017379405,0.0026907085,0.00033078025,0.064123794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997099,0.00007523598,0.000017825992,0.00007701046,0.00007775188,0.000042236978],"domain_scores_gemma":[0.99899083,0.00038876425,0.0001151071,0.00017804415,0.00017599924,0.00015112905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002525828,0.0003703822,0.00028836276,0.0013342942,0.00082869484,0.0014717347,0.0010259452,0.00061602966,0.020814886],"category_scores_gemma":[0.0017480503,0.0003519566,0.00042942027,0.0011008993,0.0006455536,0.0023180456,0.0012192009,0.0009638476,0.0024811516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008668038,0.000049200524,0.00081685005,0.00012701459,0.000023605791,0.0002557137,0.00016037203,0.00606738,0.0038752267,0.937979,0.008098342,0.042460546],"study_design_scores_gemma":[0.00004133692,0.000043692024,0.00067867455,0.000065297034,0.000035333716,0.00050822913,0.0002452758,0.06770029,0.004989486,0.88304615,0.042626016,0.000020250236],"about_ca_topic_score_codex":0.0007406556,"about_ca_topic_score_gemma":0.002128266,"teacher_disagreement_score":0.020814886,"about_ca_system_score_codex":0.00066744105,"about_ca_system_score_gemma":0.00032083402,"threshold_uncertainty_score":0.06963277},"labels":[],"label_agreement":null},{"id":"W2408389291","doi":"","title":"Harmonic Bloch And Besov Spaces On The Unit Ball.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematical Analysis and Transform Methods","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Unit sphere; Mathematics; Ball (mathematics); Besov space; Mathematical analysis; Interpolation space","score_opus":0.055753267181511135,"score_gpt":0.3251248035693355,"score_spread":0.26937153638782435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408389291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20618741,0.016586173,0.45460373,0.008089014,0.001698707,0.00008303368,0.0009452398,0.00040203487,0.31140462],"genre_scores_gemma":[0.8524849,0.00494097,0.03291949,0.00081585115,0.001357634,0.00009968476,0.0006110661,0.0002515888,0.106518835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944466,0.00020214764,0.000020687028,0.00008009689,0.0001735548,0.0000787017],"domain_scores_gemma":[0.99886936,0.00040404484,0.00017301907,0.000117384596,0.00019675907,0.00023947279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009624138,0.00087990257,0.00091451127,0.0022323753,0.0012317641,0.002241445,0.0008647479,0.0011873823,0.0098256245],"category_scores_gemma":[0.0035058216,0.00039107222,0.00053950766,0.0011679088,0.0030005535,0.004070115,0.002662125,0.002181969,0.0015432987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008611518,0.000004020854,0.000044780365,0.000015938496,0.0000041865483,0.000012179282,0.0000379111,0.00048844435,0.00015208017,0.99636817,0.0011618688,0.0017017097],"study_design_scores_gemma":[0.0000050578797,0.000009316875,0.00015575495,0.000011876098,0.0000042651327,0.000036442758,0.000054214637,0.0062608826,0.00012890344,0.9897398,0.0035866098,0.0000068054587],"about_ca_topic_score_codex":0.002188694,"about_ca_topic_score_gemma":0.0018718025,"teacher_disagreement_score":0.0098256245,"about_ca_system_score_codex":0.0013018114,"about_ca_system_score_gemma":0.00071134156,"threshold_uncertainty_score":0.032869935},"labels":[],"label_agreement":null},{"id":"W2408391094","doi":"","title":"On The Max-Type Equation.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Type (biology); Geology","score_opus":0.014663195224017043,"score_gpt":0.23500135906474198,"score_spread":0.22033816384072494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408391094","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039059784,0.0053210575,0.42430118,0.016023437,0.0034169136,0.00007548136,0.0015595544,0.0005791339,0.5096635],"genre_scores_gemma":[0.595306,0.005112626,0.12368224,0.00789288,0.0040263645,0.0002718628,0.0019162713,0.00090902945,0.2608827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923205,0.00024470736,0.00004166042,0.00013589824,0.00023140098,0.00011415504],"domain_scores_gemma":[0.99804926,0.0011538293,0.00013096194,0.0002239481,0.00033672675,0.00010529683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012079346,0.00055356923,0.0007973679,0.0008957172,0.0012216804,0.0021446825,0.0013884783,0.0015575984,0.02828997],"category_scores_gemma":[0.0070338817,0.00038323185,0.0008505166,0.0014601453,0.0018712805,0.008755927,0.0022735882,0.00483865,0.0067247027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025492014,0.0000109752655,0.00019156827,0.00004563974,0.000006113551,0.000037450543,0.000053364776,0.00045335732,0.00021445916,0.9764721,0.013734762,0.008754686],"study_design_scores_gemma":[0.000010712517,0.000005605241,0.000113433955,0.00001682675,0.000004788819,0.000077745295,0.000024261946,0.004101639,0.00017711923,0.98737633,0.0080846865,0.000006666788],"about_ca_topic_score_codex":0.0012487789,"about_ca_topic_score_gemma":0.0022453621,"teacher_disagreement_score":0.02828997,"about_ca_system_score_codex":0.0011348601,"about_ca_system_score_gemma":0.0007269502,"threshold_uncertainty_score":0.09463936},"labels":[],"label_agreement":null},{"id":"W2408407322","doi":"","title":"Study of Some Problems of Cordial Graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.015892154410374695,"score_gpt":0.2388266079978831,"score_spread":0.2229344535875084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408407322","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26104003,0.016764108,0.2380628,0.028293362,0.0015828368,0.0002584382,0.0017475868,0.0006405042,0.45161024],"genre_scores_gemma":[0.80384314,0.00818475,0.101521984,0.0024631538,0.0022704818,0.00025040362,0.0020209746,0.00032686177,0.07911822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916315,0.00031772116,0.000031773066,0.00017113342,0.0001780713,0.00013813915],"domain_scores_gemma":[0.99523586,0.003345138,0.0003223813,0.0003874439,0.00028714017,0.00042214038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011673394,0.0008035937,0.00084579206,0.001960022,0.0021845845,0.0029615515,0.0020022257,0.0018104472,0.015319813],"category_scores_gemma":[0.0090199895,0.00051210145,0.0009853458,0.0023998523,0.0024276427,0.00604666,0.0018949269,0.0038331957,0.0010863588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028860362,0.000057271023,0.00042040247,0.00018154443,0.000013650285,0.00006127063,0.00016971515,0.004085823,0.0003063707,0.9720044,0.011310923,0.011359861],"study_design_scores_gemma":[0.000019021823,0.000017979024,0.0003719321,0.000056140554,0.000013914447,0.0001807803,0.00019688658,0.014309557,0.00045952943,0.96797514,0.016388401,0.000010745383],"about_ca_topic_score_codex":0.002493386,"about_ca_topic_score_gemma":0.0027082453,"teacher_disagreement_score":0.015319813,"about_ca_system_score_codex":0.0027409117,"about_ca_system_score_gemma":0.0011918742,"threshold_uncertainty_score":0.05124992},"labels":[],"label_agreement":null},{"id":"W2408410163","doi":"","title":"The extremal primitive digraph with both Lewin index n-2 and girth 2 or 3.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Digraph; Mathematics; Index (typography); Girth (graph theory); Combinatorics; Discrete mathematics; Computer science","score_opus":0.017387574524466425,"score_gpt":0.2572090345658944,"score_spread":0.23982146004142796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408410163","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6636783,0.00066311413,0.024653526,0.0016829341,0.00031175272,0.0000653162,0.001578428,0.00037643054,0.3069902],"genre_scores_gemma":[0.9710136,0.00023921407,0.008324046,0.00027443477,0.00004528241,0.000022562046,0.00062970986,0.000043971628,0.019407213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998839,0.000020958101,0.0000038592043,0.00003022892,0.000021832542,0.000039308507],"domain_scores_gemma":[0.99969125,0.0000877542,0.000041063486,0.00005203937,0.000029222916,0.00009863412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000093453855,0.00023327526,0.00028157464,0.0006064585,0.0010591188,0.0010564352,0.00048023037,0.0007447564,0.008830679],"category_scores_gemma":[0.00069070404,0.00020853902,0.00020552713,0.00043297803,0.0007903343,0.000887358,0.0008406542,0.00091601827,0.0010493706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031522516,0.000053107364,0.0013057461,0.00014813528,0.000022295042,0.0013463626,0.0002632459,0.0026894095,0.008689476,0.9497872,0.012331841,0.023047986],"study_design_scores_gemma":[0.000060527887,0.000056597,0.0032897932,0.00006334792,0.00002863501,0.0014048999,0.00036021712,0.010855894,0.0044514593,0.9561742,0.023218993,0.000035343066],"about_ca_topic_score_codex":0.0011205502,"about_ca_topic_score_gemma":0.0029659476,"teacher_disagreement_score":0.008830679,"about_ca_system_score_codex":0.0005842371,"about_ca_system_score_gemma":0.0004773774,"threshold_uncertainty_score":0.029541552},"labels":[],"label_agreement":null},{"id":"W2408411972","doi":"","title":"L(2, 1)-labeling of flower snark and related graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.006622875648179369,"score_gpt":0.19888039469246988,"score_spread":0.1922575190442905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408411972","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45668384,0.0016613755,0.29777536,0.007238782,0.000589576,0.0002756849,0.0052600238,0.0018495014,0.22866581],"genre_scores_gemma":[0.8078165,0.00070926774,0.14447412,0.0014915138,0.00028034043,0.00023163944,0.0038628308,0.00046714875,0.040666644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919575,0.00026270625,0.000037090274,0.00021504631,0.00011483968,0.00017463531],"domain_scores_gemma":[0.9971077,0.0013653333,0.00037626817,0.0005953736,0.00022498188,0.00033024244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006805491,0.0004950393,0.0007549799,0.001047025,0.0024706468,0.0027852168,0.0016539146,0.0020758573,0.013840511],"category_scores_gemma":[0.003823412,0.00048467625,0.0009071408,0.001570342,0.0016603542,0.004535251,0.0019009265,0.002157001,0.0018296397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020722112,0.00010722292,0.0012101352,0.00019694456,0.000023453422,0.00017334674,0.00027736602,0.008874063,0.0020403543,0.93809146,0.021831302,0.026967123],"study_design_scores_gemma":[0.000042033127,0.000024705736,0.00064640265,0.00003465801,0.000022155797,0.00022616053,0.00021306788,0.023872588,0.0013533322,0.96233714,0.011207509,0.000020411597],"about_ca_topic_score_codex":0.0027518063,"about_ca_topic_score_gemma":0.0045442176,"teacher_disagreement_score":0.013840511,"about_ca_system_score_codex":0.0022904463,"about_ca_system_score_gemma":0.0010347512,"threshold_uncertainty_score":0.046301186},"labels":[],"label_agreement":null},{"id":"W2408419053","doi":"","title":"Extremal polygonal cactus chain concerning k-independent sets","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cactus; Mathematics; Chain (unit); Combinatorics; Horticulture; Biology; Physics","score_opus":0.06709182246813247,"score_gpt":0.28970404573940345,"score_spread":0.22261222327127098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408419053","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82743037,0.00060939323,0.035840828,0.0009699824,0.0003675835,0.000066695065,0.00034095044,0.00018037645,0.13419378],"genre_scores_gemma":[0.9738825,0.00023007482,0.0057380483,0.00012217993,0.00018287114,0.000048761332,0.0002976492,0.000057719495,0.019440277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996013,0.000061219296,0.000016744789,0.00007994894,0.00013886507,0.00010196568],"domain_scores_gemma":[0.9990688,0.00030234037,0.00016693525,0.00008865011,0.00013738072,0.00023584474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027016163,0.0005161173,0.00075792754,0.002457446,0.0029045206,0.0019939372,0.0010950331,0.0014504443,0.008504139],"category_scores_gemma":[0.0016913435,0.00038966813,0.0006597133,0.0013514367,0.001885339,0.0015369181,0.0016406868,0.0018675285,0.00048086207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118137985,0.000032249147,0.0007211517,0.000074056516,0.000019952373,0.00062977645,0.00032054857,0.0046452926,0.0021171002,0.9845858,0.0017809494,0.004954955],"study_design_scores_gemma":[0.000056568664,0.00006925031,0.002233828,0.000050857034,0.000046725283,0.0008199835,0.00032156202,0.049106937,0.0020703438,0.9381182,0.0070623457,0.000043375883],"about_ca_topic_score_codex":0.0018014369,"about_ca_topic_score_gemma":0.0014016851,"teacher_disagreement_score":0.008504139,"about_ca_system_score_codex":0.0012793422,"about_ca_system_score_gemma":0.0003962164,"threshold_uncertainty_score":0.028449237},"labels":[],"label_agreement":null},{"id":"W2408419912","doi":"","title":"A characterization of the set of the planes of PG(4, q) which meet a non-singular quadric in a conic.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Quadric; Conic section; Mathematics; Characterization (materials science); Pure mathematics; Set (abstract data type); Combinatorics; Mathematical analysis; Geometry; Computer science; Physics","score_opus":0.035571239100397306,"score_gpt":0.2969276203768302,"score_spread":0.2613563812764329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408419912","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8415601,0.0010785866,0.06137018,0.0015282817,0.00012027311,0.00008223946,0.0035752454,0.00027609532,0.09040895],"genre_scores_gemma":[0.97344494,0.00042659254,0.012941893,0.00019531109,0.00024748544,0.00007949959,0.0041481107,0.00010521754,0.008410951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901617,0.00016384758,0.0000830051,0.00028410397,0.00026430207,0.00018860522],"domain_scores_gemma":[0.9968413,0.001122331,0.00080063875,0.00023414813,0.0003924814,0.0006089742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079605303,0.0006803553,0.00094830315,0.005092099,0.0024519092,0.0058592604,0.0013747992,0.0010272607,0.008432232],"category_scores_gemma":[0.0032988943,0.0005942389,0.0008041936,0.0031388109,0.003446358,0.004164593,0.002475251,0.0020979603,0.0011037467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003745089,0.00011269337,0.010000361,0.00019345508,0.00007050261,0.0006818545,0.001282934,0.0034496242,0.0075202575,0.9468166,0.0073136436,0.022183575],"study_design_scores_gemma":[0.00009677169,0.00021373905,0.01498833,0.00021931644,0.00008158753,0.0030196058,0.0025336565,0.024803419,0.006870516,0.91975045,0.027304988,0.00011767622],"about_ca_topic_score_codex":0.0016684049,"about_ca_topic_score_gemma":0.0010775077,"teacher_disagreement_score":0.008432232,"about_ca_system_score_codex":0.0012776697,"about_ca_system_score_gemma":0.00052316,"threshold_uncertainty_score":0.028208673},"labels":[],"label_agreement":null},{"id":"W2408426379","doi":"","title":"Linear transformations preserving log-convexity.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Convexity; Mathematics; Applied mathematics","score_opus":0.08703235223288698,"score_gpt":0.33744867054440647,"score_spread":0.2504163183115195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408426379","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05457731,0.0010828781,0.6999237,0.0023418034,0.0007514324,0.00011811869,0.0012631112,0.0014579808,0.2384837],"genre_scores_gemma":[0.80966324,0.0015923353,0.09798167,0.0011794945,0.0006962437,0.0002510343,0.0013977381,0.0012459705,0.08599217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994388,0.00017895525,0.000022407037,0.000104016,0.00017474925,0.00008103386],"domain_scores_gemma":[0.9990281,0.0003993631,0.0000919679,0.0002820847,0.00013023916,0.00006820917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004732052,0.0005913264,0.00044858854,0.00075766066,0.0005398978,0.0014634522,0.0005284648,0.0004183759,0.013346417],"category_scores_gemma":[0.0035643664,0.00021569386,0.00052708265,0.00086400006,0.0014094086,0.0017546294,0.0014654931,0.0027462621,0.0037396993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013703863,0.00009192007,0.00027799315,0.00011644523,0.00002635534,0.00013389222,0.00011400039,0.011552121,0.0055821533,0.87158924,0.023928009,0.08645077],"study_design_scores_gemma":[0.000036862206,0.000072398536,0.00048192398,0.000033796125,0.000020052263,0.00030862493,0.00008642217,0.044498306,0.005490123,0.92102426,0.027927333,0.000019908495],"about_ca_topic_score_codex":0.0008414212,"about_ca_topic_score_gemma":0.0011677998,"teacher_disagreement_score":0.013346417,"about_ca_system_score_codex":0.0006219898,"about_ca_system_score_gemma":0.00070271135,"threshold_uncertainty_score":0.04464817},"labels":[],"label_agreement":null},{"id":"W2408455752","doi":"","title":"Spectral radius of graph with given diameter.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; Graph; Combinatorics; Physics; Eigenvalues and eigenvectors; Quantum mechanics","score_opus":0.03305815472178219,"score_gpt":0.2529730904398955,"score_spread":0.21991493571811332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408455752","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7183241,0.004122687,0.16766587,0.0034414819,0.00051545945,0.0000664132,0.00210792,0.0010357744,0.10272015],"genre_scores_gemma":[0.9754843,0.0012393306,0.015913738,0.00023058648,0.00032929107,0.0000851615,0.00057692186,0.00017767656,0.005962904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915886,0.0002770379,0.00003387337,0.00022865168,0.00015840263,0.00014326679],"domain_scores_gemma":[0.9951382,0.0024745304,0.00069239835,0.00036080854,0.0005243361,0.00080965325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074529316,0.00053539843,0.0009680438,0.002638849,0.0011437365,0.002000942,0.0013633332,0.0011771141,0.005255525],"category_scores_gemma":[0.0075982395,0.00033239063,0.00034923878,0.0013451884,0.0016478577,0.0030905954,0.0016531786,0.00083463045,0.0014430074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000503551,0.00006699098,0.0032991967,0.00043993338,0.000054558623,0.00029152582,0.0008064842,0.01708812,0.012836626,0.92370546,0.01917979,0.021727882],"study_design_scores_gemma":[0.000064115724,0.00012487243,0.0054001412,0.00012252109,0.00007827101,0.0016665178,0.00091088633,0.11262409,0.0071727284,0.8514506,0.020329265,0.000056057448],"about_ca_topic_score_codex":0.0007108444,"about_ca_topic_score_gemma":0.0004483391,"teacher_disagreement_score":0.005255525,"about_ca_system_score_codex":0.0011015361,"about_ca_system_score_gemma":0.00031789648,"threshold_uncertainty_score":0.017581463},"labels":[],"label_agreement":null},{"id":"W2408463549","doi":"","title":"A Motzkin Variation On The Tennis Ball Problem.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Sports Analytics and Performance","field":"Economics, Econometrics and Finance","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Variation (astronomy); Ball (mathematics); Geometry","score_opus":0.01688870578842914,"score_gpt":0.18855233539576724,"score_spread":0.1716636296073381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408463549","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19369864,0.010281525,0.5306855,0.025061732,0.001949607,0.00014291942,0.0021601864,0.00060400506,0.2354159],"genre_scores_gemma":[0.87300056,0.0030755957,0.049198285,0.0022181773,0.0022665597,0.00017838342,0.0016304452,0.0004831792,0.06794889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981098,0.00091927504,0.00006940869,0.00033738976,0.0003316056,0.0002324963],"domain_scores_gemma":[0.99376005,0.00414904,0.00049458514,0.00051980384,0.00043330994,0.0006430914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023108248,0.0010538548,0.0021096144,0.0015013416,0.0015568873,0.0033268647,0.0025955292,0.0021860008,0.019037804],"category_scores_gemma":[0.016573658,0.00045502608,0.0011236345,0.0021213111,0.0034285726,0.0066537517,0.003543064,0.004159373,0.0018275446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089675355,0.000053221414,0.0004226234,0.00006444343,0.00003171075,0.00003969174,0.00005760592,0.006812611,0.00013892543,0.9711481,0.012148208,0.008993088],"study_design_scores_gemma":[0.00003137304,0.000015510932,0.00041681709,0.000022333314,0.000009616061,0.000031537787,0.000038811977,0.028804764,0.000058381655,0.9661017,0.004456256,0.000012881181],"about_ca_topic_score_codex":0.0037645139,"about_ca_topic_score_gemma":0.0031524415,"teacher_disagreement_score":0.019037804,"about_ca_system_score_codex":0.0020731634,"about_ca_system_score_gemma":0.0012533505,"threshold_uncertainty_score":0.0636878},"labels":[],"label_agreement":null},{"id":"W2408477833","doi":"","title":"Further Applications Of Hsu's Summation Formula.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Fuzzy and Soft Set Theory","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Summation by parts; Calculus (dental); Applied mathematics; Pure mathematics; Medicine","score_opus":0.030640879218046185,"score_gpt":0.31393086288698774,"score_spread":0.28328998366894154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408477833","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017623467,0.0077008847,0.5241758,0.013313097,0.0031185576,0.00009841483,0.00042479945,0.00041867144,0.43312627],"genre_scores_gemma":[0.5222372,0.007056339,0.3245553,0.0046212035,0.0033470094,0.00027071283,0.00042559876,0.0003231538,0.13716355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991379,0.00031588104,0.000044873294,0.000101476144,0.0003267715,0.00007305373],"domain_scores_gemma":[0.9982973,0.0009461544,0.00007861532,0.00019496559,0.00040651954,0.00007638932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018497893,0.0007315591,0.00070902176,0.002269434,0.0013075492,0.0013469234,0.001374847,0.00087272964,0.016623972],"category_scores_gemma":[0.0069424766,0.00020500962,0.0009196702,0.0028954411,0.0018685164,0.0041058445,0.0023419634,0.0022101433,0.001963564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011339471,0.000017580192,0.0001367227,0.000060309198,0.000012645209,0.00008158301,0.00012650594,0.0007086815,0.00024807552,0.96238834,0.009178375,0.027029837],"study_design_scores_gemma":[0.0000043839136,0.000006986446,0.00018719654,0.000028283426,0.000009301142,0.0001010096,0.00003578942,0.006648489,0.00027899598,0.9761437,0.016547062,0.00000880853],"about_ca_topic_score_codex":0.002570159,"about_ca_topic_score_gemma":0.004172855,"teacher_disagreement_score":0.016623972,"about_ca_system_score_codex":0.0013968339,"about_ca_system_score_gemma":0.0010367009,"threshold_uncertainty_score":0.055612743},"labels":[],"label_agreement":null},{"id":"W2408485812","doi":"","title":"Upper Domination Number and Domination Number in a Tree.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Domination analysis; Tree (set theory); Combinatorics; Graph","score_opus":0.008080176089906686,"score_gpt":0.28300423481012643,"score_spread":0.27492405872021974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408485812","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3962111,0.006626888,0.2007949,0.0052533206,0.00060811767,0.000121406716,0.002810495,0.0007344428,0.38683936],"genre_scores_gemma":[0.9233935,0.002817202,0.034116697,0.0006675395,0.00053947757,0.0001470068,0.0010470959,0.00018386668,0.03708764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986014,0.00024029284,0.000076087614,0.00028710318,0.00041381872,0.0003813975],"domain_scores_gemma":[0.9922058,0.0053048097,0.00047624006,0.00066125125,0.00062081346,0.00073108583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010251172,0.00047946058,0.0008414512,0.0030746798,0.001731262,0.0037515783,0.0013176554,0.001012385,0.013475088],"category_scores_gemma":[0.0071543297,0.0003906629,0.00050638535,0.0029191775,0.0025221282,0.006370017,0.0020500917,0.0022397267,0.0016718594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015078284,0.00006517366,0.0019522223,0.00017982366,0.000026637097,0.00016998235,0.00048227023,0.004107832,0.004935172,0.9408273,0.008715534,0.038387183],"study_design_scores_gemma":[0.000018313753,0.000026774329,0.0015907539,0.0000629272,0.000038092916,0.0005298802,0.00016851422,0.010436569,0.0027481937,0.96626663,0.018088588,0.00002482818],"about_ca_topic_score_codex":0.0010748698,"about_ca_topic_score_gemma":0.0017987868,"teacher_disagreement_score":0.013475088,"about_ca_system_score_codex":0.0016788506,"about_ca_system_score_gemma":0.0006641659,"threshold_uncertainty_score":0.045078695},"labels":[],"label_agreement":null},{"id":"W2408497445","doi":"","title":"On the Cordiality of D(1, 3) Graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.0068320472596349185,"score_gpt":0.18611630280488478,"score_spread":0.17928425554524985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408497445","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3438178,0.003223736,0.15897633,0.007967771,0.0009565141,0.00011131725,0.0010641443,0.0004908508,0.4833915],"genre_scores_gemma":[0.9402183,0.0016962133,0.021762464,0.0014876298,0.00058590167,0.000091443166,0.00050379435,0.00019307244,0.03346119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917054,0.00026766254,0.00003577687,0.0001800894,0.00015662024,0.00018932787],"domain_scores_gemma":[0.99478036,0.0030443277,0.0006235642,0.0005666641,0.0004700445,0.0005150625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088687794,0.00045406222,0.0005343813,0.0024357163,0.0024474987,0.0030121556,0.00092297216,0.0012666392,0.01595844],"category_scores_gemma":[0.0080944,0.00042856476,0.0005260695,0.0015379955,0.0034152707,0.005267404,0.0024116384,0.0025477805,0.0018304478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028909442,0.000009918449,0.00021919743,0.000026784715,0.0000032899404,0.00005435362,0.00013500382,0.0007210346,0.00029184337,0.9909644,0.0024781774,0.005067158],"study_design_scores_gemma":[0.000009061236,0.000008298612,0.0002065016,0.000025644833,0.0000048171337,0.00013485664,0.000075038195,0.0034490833,0.00024317548,0.99062437,0.005211093,0.000008093381],"about_ca_topic_score_codex":0.0021343578,"about_ca_topic_score_gemma":0.0026005248,"teacher_disagreement_score":0.01595844,"about_ca_system_score_codex":0.0014689406,"about_ca_system_score_gemma":0.00067616015,"threshold_uncertainty_score":0.05338627},"labels":[],"label_agreement":null},{"id":"W2408501675","doi":"","title":"Super-λ Connectivity of Bipartite Graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Combinatorics; Graph","score_opus":0.0109780438492236,"score_gpt":0.22100598085830148,"score_spread":0.21002793700907788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408501675","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47605598,0.001787801,0.30704302,0.0033806518,0.00035573644,0.000084131214,0.0012468977,0.00077555585,0.20927021],"genre_scores_gemma":[0.96190137,0.0010188116,0.01858738,0.0005064444,0.00029231032,0.00010678779,0.0005834362,0.00010910511,0.016894381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993711,0.00017959776,0.000022701952,0.00014071753,0.00016891434,0.00011688376],"domain_scores_gemma":[0.99599504,0.0023785776,0.0005081921,0.00033842496,0.00037022642,0.0004096175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005695419,0.00028029966,0.00037848612,0.0014881372,0.0009815823,0.001341795,0.0008313595,0.00069820613,0.012497459],"category_scores_gemma":[0.0045842705,0.00036643984,0.00040908207,0.0010502472,0.0011804793,0.003277673,0.0011603173,0.0013310506,0.0010524347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006587171,0.000027981461,0.0011041724,0.00012904545,0.000016154507,0.00019755003,0.00018909933,0.005361124,0.0025230672,0.96811956,0.0063902317,0.015876152],"study_design_scores_gemma":[0.000013008004,0.000016652317,0.0010965487,0.000028480865,0.000012906479,0.00035096216,0.00009089356,0.026736908,0.0007335372,0.9643347,0.006575595,0.00000973155],"about_ca_topic_score_codex":0.0008335686,"about_ca_topic_score_gemma":0.0013441695,"teacher_disagreement_score":0.012497459,"about_ca_system_score_codex":0.00079797255,"about_ca_system_score_gemma":0.0003735372,"threshold_uncertainty_score":0.04180813},"labels":[],"label_agreement":null},{"id":"W2408505849","doi":"","title":"Linear Codes over Finite Chain Rings.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chain (unit); Combinatorics; Physics","score_opus":0.008299404830640298,"score_gpt":0.23027268935407647,"score_spread":0.22197328452343618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408505849","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28181309,0.012399575,0.37818834,0.00722601,0.0015293673,0.0002106944,0.0019956129,0.0014435885,0.3151937],"genre_scores_gemma":[0.93248427,0.0035090423,0.02249188,0.00055161386,0.0007142631,0.000089949346,0.0006305103,0.00011729773,0.039411172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987336,0.00036564056,0.000067853434,0.00016756545,0.00039667753,0.0002686267],"domain_scores_gemma":[0.9968334,0.0015447281,0.000409667,0.00059759757,0.00034222042,0.0002725059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009772344,0.00045783323,0.0005163254,0.0013195473,0.0012708397,0.002426353,0.00060524995,0.00086605566,0.008201679],"category_scores_gemma":[0.0038766041,0.00030739824,0.0003774655,0.0015927304,0.0021978156,0.0047433847,0.0022648317,0.0018615908,0.0023934257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058246693,0.000022889686,0.00023350929,0.00007140374,0.0000072098096,0.000065794455,0.00012854881,0.0012925565,0.0010578448,0.9829062,0.003140496,0.01101534],"study_design_scores_gemma":[0.000020539803,0.000041691852,0.00018110806,0.0000723582,0.00001222023,0.00018433346,0.00009148416,0.0068050832,0.0027744225,0.97180474,0.017991748,0.00002021581],"about_ca_topic_score_codex":0.00075249147,"about_ca_topic_score_gemma":0.0007864839,"teacher_disagreement_score":0.008201679,"about_ca_system_score_codex":0.0011202951,"about_ca_system_score_gemma":0.0011470814,"threshold_uncertainty_score":0.027437389},"labels":[],"label_agreement":null},{"id":"W2408511417","doi":"","title":"Unitals, projective planes and other combinatorial structures constructed from the unitary groups U(3, q), q=3, 4, 5, 7","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Unitary state; Projective test; Combinatorics; Pure mathematics","score_opus":0.0064065578484836655,"score_gpt":0.18075602623768952,"score_spread":0.17434946838920584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408511417","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7530317,0.0012631457,0.046358254,0.0016255588,0.00031227205,0.00008250785,0.00038738738,0.00030838288,0.19663084],"genre_scores_gemma":[0.9694017,0.0003298509,0.01191192,0.00023045264,0.0001022961,0.000033686607,0.00019227073,0.00007495756,0.017722882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968696,0.000095842974,0.000013943826,0.000043743024,0.00007822692,0.000081338934],"domain_scores_gemma":[0.99960285,0.000118724995,0.000107954154,0.00006477036,0.00003664376,0.000068979585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024990807,0.0005941641,0.00032363605,0.0021751598,0.0017246207,0.0031056139,0.000626719,0.0008535034,0.009571868],"category_scores_gemma":[0.0010207881,0.00032243345,0.00041743254,0.0016567553,0.0023043589,0.001984721,0.0010358361,0.0013957728,0.00072420813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000313935,0.000017030483,0.00023093136,0.00002077627,0.000005178325,0.00015327448,0.00014086119,0.000885594,0.001110824,0.9908953,0.00082247483,0.0056863315],"study_design_scores_gemma":[0.000033612767,0.000046001514,0.0007831063,0.000029931325,0.000012687036,0.00058181287,0.00042740052,0.005797157,0.00434662,0.97679704,0.01111275,0.000031827596],"about_ca_topic_score_codex":0.0007683892,"about_ca_topic_score_gemma":0.0009954543,"teacher_disagreement_score":0.009571868,"about_ca_system_score_codex":0.00075250474,"about_ca_system_score_gemma":0.00041117592,"threshold_uncertainty_score":0.032021105},"labels":[],"label_agreement":null},{"id":"W2408513405","doi":"","title":"Minimum Degree, Independence Number and (a, b, k)-Critical Graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Independence number; Degree (music); Independence (probability theory); Combinatorics; Discrete mathematics; Statistics; Graph; Physics","score_opus":0.0209072817346366,"score_gpt":0.29422861548338325,"score_spread":0.2733213337487467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408513405","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7702254,0.0023519932,0.07095655,0.004756588,0.00023978959,0.00010787754,0.002592624,0.000332361,0.1484368],"genre_scores_gemma":[0.97780085,0.0007907148,0.011362315,0.00022520739,0.00017737286,0.00006851095,0.0009191808,0.000058818878,0.008596956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965894,0.000092742,0.000015115147,0.000091920374,0.00007538073,0.00006588709],"domain_scores_gemma":[0.99481404,0.0030745782,0.0008462436,0.0002387329,0.0003730109,0.0006534981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050004455,0.00036900697,0.00042119148,0.0017690792,0.0013482145,0.0018603225,0.00075806514,0.00091498106,0.0064487346],"category_scores_gemma":[0.0053231264,0.00045601174,0.00026955162,0.001451941,0.0015650986,0.0023187425,0.000723659,0.0014902495,0.00074503967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040863742,0.00013077358,0.008519169,0.00027970847,0.000048396563,0.00045921342,0.00050607405,0.007825636,0.009803632,0.9248737,0.021976313,0.025168689],"study_design_scores_gemma":[0.000054709937,0.00003245094,0.0051614325,0.000052202795,0.000032019638,0.00078344345,0.00030385816,0.013674702,0.0020317354,0.9699508,0.007902575,0.000019976052],"about_ca_topic_score_codex":0.0012591532,"about_ca_topic_score_gemma":0.001858227,"teacher_disagreement_score":0.0064487346,"about_ca_system_score_codex":0.0010642831,"about_ca_system_score_gemma":0.0005121893,"threshold_uncertainty_score":0.021573186},"labels":[],"label_agreement":null},{"id":"W2408529511","doi":"","title":"A survey of some open questions in reconstruction numbers.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Mathematics education; Statistics","score_opus":0.03189819742781417,"score_gpt":0.3159702688083731,"score_spread":0.2840720713805589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408529511","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018823016,0.47629994,0.18542801,0.03385354,0.0046622823,0.00009040083,0.00087295496,0.0006330984,0.27933678],"genre_scores_gemma":[0.24441764,0.5608939,0.10905397,0.010770142,0.019693619,0.00029291137,0.002544898,0.00066834374,0.051664498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984131,0.00052795146,0.00011576757,0.00029659085,0.0005218075,0.00012478259],"domain_scores_gemma":[0.9943041,0.004496651,0.00019293163,0.00041865234,0.0004079294,0.0001795902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033863378,0.0010640156,0.0015617276,0.005246822,0.0021095392,0.0054001524,0.0019677503,0.0025404864,0.01203277],"category_scores_gemma":[0.008992361,0.0010047015,0.00091346714,0.009091586,0.0046810247,0.017807009,0.0027174696,0.005552802,0.0037511704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031369796,0.000076469216,0.00047726854,0.0008970476,0.00001968313,0.00010133337,0.00022237081,0.0010198376,0.00028713956,0.8927243,0.026274161,0.077869035],"study_design_scores_gemma":[0.000008685614,0.000032295662,0.00047695925,0.0003410619,0.000013760204,0.00042359057,0.00017565757,0.0019745163,0.00025866792,0.8954104,0.100855,0.000029315122],"about_ca_topic_score_codex":0.0011689506,"about_ca_topic_score_gemma":0.0011481051,"teacher_disagreement_score":0.01203277,"about_ca_system_score_codex":0.002253695,"about_ca_system_score_gemma":0.0011723149,"threshold_uncertainty_score":0.04025364},"labels":[],"label_agreement":null},{"id":"W2408539218","doi":"","title":"On the Metric Dimension of Generalized Petersen Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Metric dimension; Dimension (graph theory); Metric (unit); Combinatorics; Graph; Chordal graph; 1-planar graph","score_opus":0.017458354049227087,"score_gpt":0.2315830421515974,"score_spread":0.21412468810237031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408539218","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60248214,0.009616638,0.1870279,0.011504624,0.0008618843,0.00009389896,0.00201635,0.00045620624,0.18594041],"genre_scores_gemma":[0.9604619,0.003082132,0.022394009,0.0006798944,0.0007760656,0.000107699845,0.000789721,0.00013690391,0.011571649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887425,0.00040904924,0.000050075785,0.00021555174,0.00023800906,0.00021298137],"domain_scores_gemma":[0.99475455,0.0032622963,0.00053319935,0.0005372921,0.00034008513,0.0005725893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013206474,0.00065858196,0.00088836893,0.002840395,0.0021295424,0.0031489895,0.0014792623,0.001681117,0.006146327],"category_scores_gemma":[0.007978245,0.0005145712,0.00052779296,0.0027433543,0.0038250922,0.009576285,0.0030570112,0.0026423517,0.00086003524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041452033,0.000023445093,0.00064493873,0.00005949088,0.000013693541,0.00003378915,0.00013542897,0.0029415681,0.00036008348,0.9815671,0.004878664,0.0093004],"study_design_scores_gemma":[0.000008949792,0.000009334773,0.00054530735,0.000020607631,0.000008837917,0.00008211009,0.00012297383,0.009330239,0.00027295089,0.98549044,0.004093863,0.000014344987],"about_ca_topic_score_codex":0.0016606546,"about_ca_topic_score_gemma":0.0017327854,"teacher_disagreement_score":0.006146327,"about_ca_system_score_codex":0.0018291998,"about_ca_system_score_gemma":0.00059776136,"threshold_uncertainty_score":0.020561576},"labels":[],"label_agreement":null},{"id":"W2408557205","doi":"","title":"On antimagic total labeling of some families of graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.007060733959477603,"score_gpt":0.21875937717909333,"score_spread":0.21169864321961573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408557205","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49702924,0.001919007,0.30907577,0.004919737,0.00022318136,0.00015724401,0.0021674691,0.0009407606,0.18356751],"genre_scores_gemma":[0.88047904,0.0013413983,0.08725745,0.00096754223,0.0001979761,0.0002290146,0.002110549,0.00028457708,0.027132463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987412,0.00049365155,0.00006651565,0.00028171603,0.00021220028,0.0002046877],"domain_scores_gemma":[0.9943597,0.0034788938,0.00041567057,0.0008198976,0.00043424297,0.00049167103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014183606,0.00044937799,0.00070251577,0.0018556807,0.0034770672,0.0029944056,0.0012450425,0.0015272588,0.008914008],"category_scores_gemma":[0.006036806,0.00063792855,0.0010397037,0.0024285365,0.0021652675,0.005962629,0.0025454669,0.0018031689,0.0009807686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006757203,0.000033615983,0.0008402204,0.000102502265,0.000015726338,0.00007751672,0.00035430441,0.0025529535,0.0009674715,0.9752373,0.0062151924,0.01353556],"study_design_scores_gemma":[0.00001772459,0.00001945266,0.00063035486,0.00003813229,0.0000250622,0.00023216146,0.00029619547,0.012214772,0.0008027499,0.97685355,0.0088557135,0.000014002597],"about_ca_topic_score_codex":0.002081134,"about_ca_topic_score_gemma":0.0030145939,"teacher_disagreement_score":0.008914008,"about_ca_system_score_codex":0.0024633843,"about_ca_system_score_gemma":0.00089090725,"threshold_uncertainty_score":0.029820263},"labels":[],"label_agreement":null},{"id":"W2408564972","doi":"","title":"The Cubic Mapping Graph of the Residue Classes of Integers.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cubic graph; Residue (chemistry); Combinatorics; Coxeter graph; Graph; Discrete mathematics; Line graph; Voltage graph; Chemistry; Organic chemistry","score_opus":0.008461089982739612,"score_gpt":0.21446173894352819,"score_spread":0.20600064896078857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408564972","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43566996,0.0013533683,0.06305046,0.0046118377,0.0007105322,0.00010252452,0.0017924081,0.00064907025,0.49205986],"genre_scores_gemma":[0.9411803,0.0006593209,0.00975042,0.0005239828,0.00024567128,0.000054523192,0.00076704624,0.00016917281,0.04664953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996972,0.00006123942,0.000008269442,0.000058136622,0.0000834872,0.00009163522],"domain_scores_gemma":[0.9992873,0.00024467538,0.00010973922,0.00012251253,0.00011288902,0.00012285652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022475065,0.0003494496,0.00041764407,0.0017057696,0.0015721096,0.0023614326,0.000641638,0.0006701624,0.017393308],"category_scores_gemma":[0.0020833523,0.00021746561,0.00029606943,0.0011597439,0.0017545526,0.0026586044,0.0012440053,0.0017937707,0.002157423],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043181786,0.0000141586615,0.00024544232,0.000030603805,0.000003502483,0.00007057746,0.000117355085,0.00074655213,0.00064797024,0.9784742,0.005128155,0.014478435],"study_design_scores_gemma":[0.000015612137,0.0000099257595,0.0005664953,0.000015068598,0.0000043832174,0.00011579543,0.00012005848,0.0041650715,0.0005658425,0.9818571,0.01255437,0.00001027741],"about_ca_topic_score_codex":0.005437501,"about_ca_topic_score_gemma":0.00485964,"teacher_disagreement_score":0.017393308,"about_ca_system_score_codex":0.0012386941,"about_ca_system_score_gemma":0.00094061537,"threshold_uncertainty_score":0.05818647},"labels":[],"label_agreement":null},{"id":"W2408577007","doi":"","title":"Spanning Eulerian Subgraphs in Generalized Prisms.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eulerian path; Combinatorics; Geometry; Mathematical analysis; Lagrangian","score_opus":0.01706646239536925,"score_gpt":0.24357836005575406,"score_spread":0.22651189766038482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408577007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27597106,0.0012480994,0.63960433,0.0015075821,0.00020588712,0.00021599823,0.002358137,0.0019089,0.076980054],"genre_scores_gemma":[0.71526766,0.001291788,0.24290527,0.0005095129,0.000086997374,0.00017965349,0.0027620213,0.00034711417,0.03665003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991673,0.00020652013,0.00006704611,0.0002109411,0.00018958637,0.00015850386],"domain_scores_gemma":[0.99808466,0.00075706583,0.0002936831,0.0004568185,0.0001964795,0.00021144545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006354095,0.00037821312,0.00041878966,0.0010886332,0.001074277,0.0017623621,0.00092611474,0.0005923141,0.009499513],"category_scores_gemma":[0.0034647898,0.0005181318,0.00055465515,0.0021217342,0.0010338529,0.0040943488,0.0025686743,0.0010462382,0.0013973895],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010571304,0.00006849794,0.002038091,0.00027498332,0.00005592382,0.0005560808,0.00055821653,0.022391727,0.003969869,0.881322,0.010250454,0.07840841],"study_design_scores_gemma":[0.000027913788,0.000036594553,0.0009463122,0.00008209828,0.00004604172,0.0006781188,0.00045331588,0.04529004,0.003574986,0.9148531,0.033988398,0.00002298816],"about_ca_topic_score_codex":0.002790282,"about_ca_topic_score_gemma":0.005185778,"teacher_disagreement_score":0.009499513,"about_ca_system_score_codex":0.0009182186,"about_ca_system_score_gemma":0.0008939459,"threshold_uncertainty_score":0.03177905},"labels":[],"label_agreement":null},{"id":"W2408589969","doi":"","title":"Structural Form of a Minimal Critical Set for a Latin Square Representing the Elementary Abelian 2-group of Order 8.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Latin square; Abelian group; Set (abstract data type); Order (exchange); Group (periodic table); Square (algebra); Rank of an abelian group; Combinatorics; Elementary abelian group; Generating set of a group; Pure mathematics; Geometry; Computer science; Physics","score_opus":0.034996073666016175,"score_gpt":0.3022947339341963,"score_spread":0.26729866026818017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408589969","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66602945,0.00027071216,0.0755824,0.0008900485,0.0003384222,0.00016958418,0.00095296133,0.0006424035,0.255124],"genre_scores_gemma":[0.959179,0.00006436797,0.021450428,0.00016765844,0.0000608375,0.00011740408,0.00071669364,0.00013639442,0.018107302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998392,0.000023082073,0.000010690701,0.000041090243,0.00003569213,0.000050218132],"domain_scores_gemma":[0.9997267,0.00007271438,0.000053982196,0.000032487893,0.000049158753,0.00006495964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010803401,0.00034749156,0.0003293828,0.0010485362,0.0016612398,0.0017271264,0.00057440606,0.0010123801,0.024070308],"category_scores_gemma":[0.000578178,0.00029030195,0.0004563255,0.0003608347,0.0013951847,0.00089351967,0.0009985546,0.0006759301,0.0028319776],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000167624,0.00003871988,0.0005602059,0.000073803,0.000012113865,0.00096356776,0.0004578479,0.002058453,0.020009894,0.9658409,0.0035399133,0.006276998],"study_design_scores_gemma":[0.000082603015,0.000118756216,0.0013653613,0.00005743579,0.000023865336,0.0010315225,0.0007551452,0.013319721,0.012782592,0.9441951,0.026221892,0.000046000237],"about_ca_topic_score_codex":0.00077513687,"about_ca_topic_score_gemma":0.0014050584,"teacher_disagreement_score":0.024070308,"about_ca_system_score_codex":0.0007593818,"about_ca_system_score_gemma":0.0004950473,"threshold_uncertainty_score":0.08052313},"labels":[],"label_agreement":null},{"id":"W2408593987","doi":"","title":"Hamiltonian Cycles in Directed Toeplitz Graphs - Part 2.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Toeplitz matrix; Mathematics; Combinatorics; Hamiltonian (control theory); Pure mathematics; Mathematical optimization","score_opus":0.03639296529659169,"score_gpt":0.3048787708254272,"score_spread":0.2684858055288355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408593987","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6192863,0.0062775877,0.12885575,0.0017349463,0.00071675825,0.00016502144,0.0007829903,0.0002560557,0.24192469],"genre_scores_gemma":[0.94834375,0.0018828464,0.008565058,0.0003873227,0.0002005701,0.0000761067,0.00034880306,0.00008129734,0.0401142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99984443,0.000034691708,0.000008223502,0.000029829784,0.000041115432,0.000041627194],"domain_scores_gemma":[0.9996055,0.00016788601,0.00006553584,0.000041782518,0.00005239713,0.00006687923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001703142,0.0004096403,0.00022500964,0.0010913018,0.0006649186,0.00147883,0.00044257398,0.0005983322,0.010089839],"category_scores_gemma":[0.0007566196,0.00021372976,0.00035407228,0.001082723,0.0012448854,0.0014488437,0.00075940456,0.0007169221,0.0010478566],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024746752,0.000030822455,0.00039267572,0.000093228904,0.00000897623,0.00016623194,0.0003603522,0.0020863174,0.0023524119,0.97730756,0.0030118679,0.014164679],"study_design_scores_gemma":[0.000008018352,0.000017896218,0.00037702185,0.000021437667,0.000007899807,0.00016419495,0.00015897391,0.0051794774,0.0007464154,0.98711234,0.006196212,0.000010158414],"about_ca_topic_score_codex":0.0012718695,"about_ca_topic_score_gemma":0.0017834243,"teacher_disagreement_score":0.010089839,"about_ca_system_score_codex":0.0005046249,"about_ca_system_score_gemma":0.0003042995,"threshold_uncertainty_score":0.033753872},"labels":[],"label_agreement":null},{"id":"W2408598459","doi":"","title":"Compositions Of Positive Integers n Viewed As Alternating Sequences Of Increasing/Decreasing Partitions.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Block (permutation group theory); Combinatorics; Series (stratigraphy); Discrete mathematics","score_opus":0.03747163234339656,"score_gpt":0.3373236668146878,"score_spread":0.2998520344712912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408598459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37977713,0.0015380428,0.53861946,0.0006904585,0.0005832354,0.00019928301,0.000985457,0.00095942256,0.076647475],"genre_scores_gemma":[0.8641953,0.0010129655,0.11052313,0.00045968697,0.00046539493,0.000403793,0.0009208794,0.00047442107,0.0215444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987835,0.00041955896,0.000088430694,0.00025501882,0.00030294055,0.00015050016],"domain_scores_gemma":[0.99755967,0.0010397872,0.000665486,0.00035234282,0.00022216179,0.00016053484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012606934,0.0006449967,0.00045175463,0.0020026318,0.00093436777,0.002131445,0.00073690136,0.00091425335,0.00845384],"category_scores_gemma":[0.0063618734,0.0004310279,0.0005663281,0.0011521088,0.002333023,0.0033424953,0.000860336,0.0010732552,0.0019055714],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018041747,0.0000339257,0.0014443765,0.000092532704,0.000020196867,0.0003262604,0.00044308027,0.002602871,0.01230677,0.9663096,0.001393053,0.014846851],"study_design_scores_gemma":[0.000031979915,0.00008332779,0.002174519,0.00007952998,0.000028726983,0.0010231918,0.00022342417,0.032948516,0.009473566,0.9400336,0.013851968,0.000047612506],"about_ca_topic_score_codex":0.0003864517,"about_ca_topic_score_gemma":0.000742221,"teacher_disagreement_score":0.00845384,"about_ca_system_score_codex":0.000615564,"about_ca_system_score_gemma":0.00043588123,"threshold_uncertainty_score":0.028280914},"labels":[],"label_agreement":null},{"id":"W2408600575","doi":"","title":"On Zero Magic Sums of Integer Magic Graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"MAGIC (telescope); Mathematics; Zero (linguistics); Integer (computer science); Combinatorics; Discrete mathematics; Physics; Computer science; Quantum mechanics; Linguistics; Philosophy","score_opus":0.021122100248399042,"score_gpt":0.2384093176482177,"score_spread":0.21728721739981866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408600575","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4672118,0.004695956,0.20320763,0.0048799976,0.0009942764,0.00010268914,0.0013043103,0.0007335377,0.3168698],"genre_scores_gemma":[0.9192035,0.0014579252,0.045424208,0.0009828147,0.00049564295,0.00012254379,0.001040041,0.00028642698,0.030986939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989127,0.00033786555,0.0000621103,0.00022633045,0.00022965578,0.00023120108],"domain_scores_gemma":[0.9957521,0.0027721333,0.00038100805,0.00039229004,0.00027854973,0.00042383047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009901098,0.00073082856,0.00088782696,0.0024420342,0.0022996124,0.0039550806,0.001742297,0.0013026834,0.011187839],"category_scores_gemma":[0.0062424275,0.0006445346,0.0007042875,0.0020181101,0.003593338,0.007514279,0.0034341868,0.002869863,0.001554267],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060628383,0.000024830326,0.00032543816,0.000085381645,0.000008694811,0.000045156314,0.00012063293,0.001777311,0.0005260878,0.98240525,0.0040855696,0.010535056],"study_design_scores_gemma":[0.000010962305,0.0000069604675,0.00013055315,0.000024738003,0.0000075220128,0.00007063195,0.000076557226,0.0040370594,0.0003979972,0.9922078,0.003019442,0.000009712453],"about_ca_topic_score_codex":0.0010356255,"about_ca_topic_score_gemma":0.0019207259,"teacher_disagreement_score":0.011187839,"about_ca_system_score_codex":0.0015509563,"about_ca_system_score_gemma":0.00071880064,"threshold_uncertainty_score":0.037427068},"labels":[],"label_agreement":null},{"id":"W2408618519","doi":"","title":"The Mean Integrity of Paths and Cycles.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Statistics","score_opus":0.01737940416127694,"score_gpt":0.2801621557768803,"score_spread":0.2627827516156034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408618519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022512492,0.0012843274,0.924942,0.002688358,0.00048711366,0.00012012851,0.00079527806,0.0009727213,0.046197493],"genre_scores_gemma":[0.6594357,0.002301877,0.30680463,0.0012451509,0.0011047813,0.0005576937,0.0016055627,0.0012836604,0.025660926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98663354,0.004115333,0.0013144828,0.0029601373,0.0038866284,0.0010899107],"domain_scores_gemma":[0.9632572,0.015778074,0.0027180112,0.013237978,0.0042808605,0.0007279048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0080021955,0.0009923948,0.0015406521,0.0029303033,0.0035986188,0.007451408,0.0026974832,0.0026175093,0.009357932],"category_scores_gemma":[0.049606103,0.0014897593,0.0027633589,0.0023905423,0.011872477,0.02545145,0.0059327306,0.0065361746,0.0026338813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058074922,0.00001421661,0.00033821797,0.000100899975,0.000026543641,0.000060234448,0.0002651193,0.0015891116,0.0005351054,0.98311067,0.0016056983,0.012296208],"study_design_scores_gemma":[0.0000074631294,0.000015420976,0.00010372301,0.00004261483,0.000027951966,0.000084211686,0.00006449681,0.0036176138,0.0014568774,0.9881259,0.006439909,0.000013811466],"about_ca_topic_score_codex":0.002127452,"about_ca_topic_score_gemma":0.0018221177,"teacher_disagreement_score":0.009357932,"about_ca_system_score_codex":0.0026513997,"about_ca_system_score_gemma":0.0030833813,"threshold_uncertainty_score":0.042320132},"labels":[],"label_agreement":null},{"id":"W2408639442","doi":"","title":"Extremal Zagreb indices of unicyclic graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Statistics","score_opus":0.021593084862577064,"score_gpt":0.2880633975609883,"score_spread":0.26647031269841126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408639442","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63981414,0.0028897235,0.03462211,0.0011995255,0.0005732792,0.000040303486,0.00064631284,0.00026991937,0.31994468],"genre_scores_gemma":[0.98053956,0.00072630605,0.0055976273,0.00013462361,0.00017217768,0.000027826016,0.00025285126,0.000058467653,0.012490572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964523,0.000074348194,0.000017558083,0.000058540787,0.000104081635,0.00010026755],"domain_scores_gemma":[0.9993048,0.00020230236,0.00017534227,0.00009226452,0.00009021716,0.00013517779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034631352,0.00037024627,0.00053432706,0.0022424818,0.0012217421,0.0022527077,0.0007876408,0.00062456436,0.0063461126],"category_scores_gemma":[0.002405409,0.00027549572,0.00022264954,0.0011638913,0.001333542,0.0018473099,0.0013464188,0.0014291743,0.0008995591],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006455065,0.000015847943,0.0006544392,0.000049896673,0.0000070843757,0.000097239616,0.00014797354,0.0009772159,0.0009709539,0.98284966,0.0023645076,0.011800641],"study_design_scores_gemma":[0.00001797341,0.000016133756,0.0013685904,0.00004286363,0.000015144398,0.00034593715,0.00015943125,0.0061365305,0.0008337749,0.9841122,0.0069389828,0.000012416772],"about_ca_topic_score_codex":0.0009816758,"about_ca_topic_score_gemma":0.0017987817,"teacher_disagreement_score":0.0063461126,"about_ca_system_score_codex":0.00096437533,"about_ca_system_score_gemma":0.00033674823,"threshold_uncertainty_score":0.021229863},"labels":[],"label_agreement":null},{"id":"W2408648542","doi":"","title":"The First Nontrivial Hales-Jewett Number is Four.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.016063517316452166,"score_gpt":0.26055557302704396,"score_spread":0.2444920557105918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408648542","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3290167,0.0011596618,0.023340793,0.01080378,0.003712254,0.000086298256,0.00065403775,0.0013788152,0.62984765],"genre_scores_gemma":[0.8980047,0.0004204941,0.011414844,0.0010261502,0.0005258728,0.00006850918,0.00046015184,0.00023965361,0.08783961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992644,0.0001071126,0.00002814788,0.00014361217,0.00021312208,0.00024361414],"domain_scores_gemma":[0.99873203,0.0004362901,0.000108739136,0.00014462612,0.00018128852,0.0003970452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000545903,0.000819738,0.00083748053,0.0024508575,0.0045134635,0.0032841084,0.0013929205,0.0024417567,0.038293734],"category_scores_gemma":[0.0027746388,0.00038336928,0.00072799425,0.0009275167,0.0047394945,0.0047678314,0.0025607308,0.0028914544,0.0061901878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016534208,0.00005397985,0.0005894939,0.00014554683,0.000016672828,0.00038553606,0.0002962483,0.0001981964,0.0032889273,0.96886617,0.010877044,0.015116878],"study_design_scores_gemma":[0.00003879443,0.000059892045,0.0009002869,0.000048829766,0.000025765661,0.00067884574,0.00032045323,0.0006186147,0.004922699,0.9535684,0.038772877,0.000044456996],"about_ca_topic_score_codex":0.00085083244,"about_ca_topic_score_gemma":0.0015482235,"teacher_disagreement_score":0.038293734,"about_ca_system_score_codex":0.0017815789,"about_ca_system_score_gemma":0.001133102,"threshold_uncertainty_score":0.12810534},"labels":[],"label_agreement":null},{"id":"W2408673867","doi":"","title":"Some properties of the quasi-cross-cut partition and the dimension of bivariate continuous spline space.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bivariate analysis; Partition (number theory); Perfect spline; Dimension (graph theory); Spline (mechanical); Combinatorics; Space (punctuation); Mathematical analysis; Pure mathematics; Statistics; Spline interpolation; Thin plate spline; Computer science","score_opus":0.008315725453616796,"score_gpt":0.2261783820274597,"score_spread":0.2178626565738429,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408673867","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66846085,0.0038070532,0.29821667,0.0009039871,0.00016197568,0.00002973842,0.00046725283,0.00012633388,0.027826123],"genre_scores_gemma":[0.9803489,0.0007750727,0.0152857285,0.00005360486,0.00011606089,0.000026466878,0.00021050233,0.000032575994,0.0031511758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971527,0.000080188525,0.000015318967,0.000062023835,0.00008025149,0.0000468933],"domain_scores_gemma":[0.99789786,0.0010451264,0.00043472133,0.00014737033,0.0002369739,0.000238006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080707466,0.00022705852,0.00032125702,0.0019102404,0.00059741084,0.0013920167,0.00052138226,0.00038232832,0.0036086126],"category_scores_gemma":[0.004972193,0.00023400772,0.00039443347,0.0011427021,0.0014189314,0.0019040338,0.0008574161,0.0011010834,0.00019846993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047507445,0.000015519327,0.0031884587,0.000063438136,0.0000143340185,0.00009721528,0.00029430815,0.006147973,0.0028431274,0.9767988,0.00086931436,0.009619969],"study_design_scores_gemma":[0.000019114925,0.00011310352,0.0085861655,0.00007343688,0.000050075396,0.00066923193,0.00046878494,0.15427801,0.0026998844,0.8251663,0.007821652,0.00005431078],"about_ca_topic_score_codex":0.0010257482,"about_ca_topic_score_gemma":0.0013012673,"teacher_disagreement_score":0.0036086126,"about_ca_system_score_codex":0.00081709697,"about_ca_system_score_gemma":0.00029951552,"threshold_uncertainty_score":0.012072027},"labels":[],"label_agreement":null},{"id":"W2408683892","doi":"","title":"On Kirkman Packing Designs KPD({3, 4*, 5*}, v)s.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Arithmetic","score_opus":0.012045804226535575,"score_gpt":0.21071840586004437,"score_spread":0.1986726016335088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408683892","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41851532,0.0009710788,0.23908147,0.0013723103,0.000327111,0.00020179208,0.00079993345,0.0008528417,0.33787817],"genre_scores_gemma":[0.8454494,0.00083014905,0.09257503,0.00064805994,0.00014072898,0.00025828392,0.0009164212,0.00020639219,0.05897561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920124,0.00025751247,0.000036531255,0.0000837989,0.00022886753,0.00019204382],"domain_scores_gemma":[0.9989592,0.0004824704,0.00013113373,0.00019395656,0.00012931682,0.0001038964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045868332,0.0006505021,0.00044881587,0.0010475348,0.0013021574,0.001525145,0.0006037307,0.00083649467,0.01665073],"category_scores_gemma":[0.0020752382,0.00045125812,0.0003662928,0.0013992605,0.0010074405,0.0018802627,0.0016606277,0.0010296764,0.0029649553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024087129,0.00007409242,0.00048614986,0.00008800439,0.0000150598535,0.00014511518,0.00028013863,0.012174988,0.0038539974,0.9188018,0.01214097,0.051698815],"study_design_scores_gemma":[0.000050935374,0.0001201354,0.00045459293,0.00006860624,0.000014043222,0.00025286275,0.0002313119,0.042365126,0.0029589888,0.93722403,0.016231835,0.00002759196],"about_ca_topic_score_codex":0.001132869,"about_ca_topic_score_gemma":0.0022773186,"teacher_disagreement_score":0.01665073,"about_ca_system_score_codex":0.0009675057,"about_ca_system_score_gemma":0.0007557728,"threshold_uncertainty_score":0.05570227},"labels":[],"label_agreement":null},{"id":"W2408686182","doi":"","title":"Matrix Representation Of The Second Order Recurrence {u kn }.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Mathematics; Sequence (biology); Combinatorics; Order (exchange); Matrix (chemical analysis); Integer (computer science); Representation (politics); Matrix representation; Recurrence relation; Integer matrix; Pure mathematics; Discrete mathematics; Nonnegative matrix; Symmetric matrix; Group (periodic table); Physics; Computer science; Eigenvalues and eigenvectors","score_opus":0.01013965353423908,"score_gpt":0.29690996375540435,"score_spread":0.2867703102211653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408686182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22076447,0.0023084986,0.56239307,0.0020133911,0.0017385192,0.00019475655,0.00107029,0.00067467144,0.20884237],"genre_scores_gemma":[0.8808146,0.0005504109,0.05772445,0.0004032203,0.0004126749,0.00017175669,0.00050235726,0.00016938034,0.05925115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997985,0.000037222882,0.000012508633,0.00003574123,0.00006786045,0.00004823076],"domain_scores_gemma":[0.9998022,0.000048790018,0.000046228237,0.000022562203,0.000055910354,0.00002440419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021606106,0.00047927577,0.00030963542,0.001007201,0.0006695549,0.0010286224,0.0005712972,0.0007860359,0.015909243],"category_scores_gemma":[0.0007961391,0.00016510101,0.00032246756,0.0006087715,0.00048245175,0.0009902447,0.00042905202,0.00062174647,0.0020342418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021919517,0.0000144431915,0.00014978743,0.00005934151,0.000005902529,0.00027519243,0.00012746346,0.0024091073,0.0056633926,0.97391903,0.0041535525,0.01320097],"study_design_scores_gemma":[0.000021677992,0.00006875271,0.000586997,0.000047322003,0.000013501657,0.0010970292,0.00014698513,0.09567573,0.0064918073,0.87091637,0.024875224,0.00005859223],"about_ca_topic_score_codex":0.0008502339,"about_ca_topic_score_gemma":0.0014492818,"teacher_disagreement_score":0.015909243,"about_ca_system_score_codex":0.00049175444,"about_ca_system_score_gemma":0.0004158932,"threshold_uncertainty_score":0.053221762},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Product (mathematics); Geometry; Computer science; Artificial intelligence","score_opus":0.015521136936981239,"score_gpt":0.24501372391963602,"score_spread":0.2294925869826548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408690479","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83137953,0.0006127364,0.10423265,0.0011206497,0.00017071361,0.00006504862,0.00077068014,0.00026137533,0.061386712],"genre_scores_gemma":[0.9829063,0.0002060683,0.011380417,0.00012065232,0.00008232687,0.000049831353,0.0003086229,0.0000701579,0.0048756693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986432,0.00042183526,0.00007416771,0.0003182088,0.00031797186,0.00022457963],"domain_scores_gemma":[0.9900233,0.005310215,0.0012814198,0.0011577352,0.00097035826,0.0012569146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015598676,0.00045171782,0.00082944264,0.002273107,0.0017704437,0.0026777862,0.0013510855,0.0010958591,0.008709121],"category_scores_gemma":[0.008949172,0.00054722105,0.00061629486,0.0014622756,0.002051178,0.004539339,0.0023246051,0.0016532188,0.0007672438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041265733,0.000072734714,0.005268564,0.00018984907,0.00006154798,0.00031437207,0.00035782778,0.008649303,0.005910838,0.95626414,0.003836048,0.018662121],"study_design_scores_gemma":[0.000051033312,0.000106621934,0.003333668,0.000064537504,0.000097157805,0.00080616004,0.00040587547,0.053153977,0.0051627094,0.93021274,0.006556317,0.000049197566],"about_ca_topic_score_codex":0.0005614311,"about_ca_topic_score_gemma":0.00056237023,"teacher_disagreement_score":0.008709121,"about_ca_system_score_codex":0.00091633026,"about_ca_system_score_gemma":0.000478484,"threshold_uncertainty_score":0.02913493},"labels":[],"label_agreement":null},{"id":"W2408708407","doi":"","title":"Eigenpolynomials associated with subspaces in d-bounded distance-regular graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Linear subspace; Bounded function; Combinatorics; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.0638892394760837,"score_gpt":0.2877285192474451,"score_spread":0.22383927977136137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408708407","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7144186,0.0009328519,0.19061936,0.0018574254,0.0004507689,0.00006191202,0.0009056086,0.0005486757,0.09020472],"genre_scores_gemma":[0.967726,0.00030544598,0.015918806,0.00028500985,0.000192263,0.000058465033,0.0004845796,0.00015742442,0.014871833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933285,0.00015314472,0.00004288127,0.00015199295,0.00013708718,0.00018199971],"domain_scores_gemma":[0.9984876,0.00054425566,0.00026838464,0.00021728419,0.0001570931,0.0003252925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047778804,0.00044494114,0.0004982321,0.0018677383,0.001268185,0.0021773363,0.00081683573,0.0008276827,0.00960511],"category_scores_gemma":[0.002155378,0.0003339282,0.0005540285,0.0011845332,0.0020943186,0.0029015336,0.0022118147,0.0016738845,0.0017026422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050474002,0.00002358719,0.00034632033,0.00002641368,0.000006275145,0.000081786326,0.00019064336,0.000840676,0.0012629571,0.9891657,0.0018342502,0.00617089],"study_design_scores_gemma":[0.000012824609,0.000013229295,0.00026208386,0.000011341566,0.000003967695,0.00012246429,0.00012783086,0.005198288,0.00059005216,0.99142843,0.0022183964,0.000011007804],"about_ca_topic_score_codex":0.0004386979,"about_ca_topic_score_gemma":0.00055060844,"teacher_disagreement_score":0.00960511,"about_ca_system_score_codex":0.0007186969,"about_ca_system_score_gemma":0.0003036622,"threshold_uncertainty_score":0.032132268},"labels":[],"label_agreement":null},{"id":"W2408734287","doi":"","title":"The Diameter of Connected Domination Critical Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01786029530915067,"score_gpt":0.30252337271576896,"score_spread":0.2846630774066183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408734287","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7780704,0.0088625,0.06296649,0.0047580353,0.0005517268,0.00009002176,0.0022932014,0.00044620753,0.14196146],"genre_scores_gemma":[0.9846332,0.0024702486,0.005688753,0.0002365524,0.00045472124,0.00008272698,0.0005157153,0.00009482851,0.005823322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958676,0.00009837496,0.00001748834,0.00010662637,0.000096878444,0.00009382835],"domain_scores_gemma":[0.9922347,0.005175837,0.0008019357,0.00026523,0.00046099973,0.0010613526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006579,0.0004944387,0.00064922223,0.0032444855,0.0010773682,0.002408734,0.0010072985,0.0008728166,0.0049421643],"category_scores_gemma":[0.008927849,0.00044082323,0.00026289094,0.0013855294,0.0021914179,0.0033854465,0.001511866,0.0010602014,0.00067395635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044769558,0.00005019816,0.0058892104,0.00034510053,0.00006177695,0.00040457575,0.00092646835,0.010055471,0.008469264,0.92413664,0.021099493,0.028114155],"study_design_scores_gemma":[0.000065812135,0.000052956635,0.0043506324,0.000122041114,0.000059255755,0.001078323,0.0005665224,0.027592054,0.0038033193,0.9437806,0.018498538,0.000029959076],"about_ca_topic_score_codex":0.0008159143,"about_ca_topic_score_gemma":0.00071051397,"teacher_disagreement_score":0.0049421643,"about_ca_system_score_codex":0.001331786,"about_ca_system_score_gemma":0.000390966,"threshold_uncertainty_score":0.016533256},"labels":[],"label_agreement":null},{"id":"W2408735107","doi":"","title":"On Strongly Multiplicative Graphs","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Multiplicative function; Mathematics; Conjecture; Graph; Combinatorics; Discrete mathematics; Mathematical analysis","score_opus":0.08795892038657828,"score_gpt":0.35075363640271323,"score_spread":0.26279471601613497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408735107","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3020138,0.0010314775,0.57924557,0.0021358365,0.00031626195,0.00023319395,0.0006650547,0.00060880044,0.11375],"genre_scores_gemma":[0.90394044,0.0009118509,0.072136685,0.0009895103,0.00063940743,0.0002760194,0.00082175364,0.00017475191,0.02010948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837446,0.0005015449,0.00010976892,0.00040405017,0.00039392698,0.00021622669],"domain_scores_gemma":[0.995974,0.0017623712,0.00059100427,0.0005568017,0.0006921434,0.0004236517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012255891,0.0010296778,0.00052030745,0.0020764256,0.0015813329,0.0016664149,0.00083005655,0.0010070911,0.008351955],"category_scores_gemma":[0.003945182,0.00057986757,0.0012269884,0.0010588509,0.0024100582,0.004723484,0.0029758108,0.0018118592,0.0014607161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027559707,0.00003130378,0.00076516496,0.00008561142,0.000017956032,0.00019123661,0.00029506,0.0012190532,0.0060688835,0.9830641,0.0011463943,0.007087642],"study_design_scores_gemma":[0.000014583181,0.00007595502,0.0008887052,0.000038939026,0.00003424534,0.000529822,0.00018206573,0.00832523,0.003906369,0.97187626,0.014106502,0.000021315107],"about_ca_topic_score_codex":0.00038121687,"about_ca_topic_score_gemma":0.0004692504,"teacher_disagreement_score":0.008351955,"about_ca_system_score_codex":0.00073693716,"about_ca_system_score_gemma":0.00041112906,"threshold_uncertainty_score":0.027940035},"labels":[],"label_agreement":null},{"id":"W2408740683","doi":"","title":"Vertex-magic total labeling of the union of suns.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Suns in alchemy; MAGIC (telescope); Vertex (graph theory); Mathematics; Combinatorics; Horticulture; Physics; Biology; Astronomy; Graph","score_opus":0.010776505039238528,"score_gpt":0.21678719601725238,"score_spread":0.20601069097801386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408740683","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.428834,0.0011884957,0.33689922,0.0022600805,0.00043080802,0.00011958972,0.0038899595,0.0014862006,0.2248917],"genre_scores_gemma":[0.82396287,0.0004951982,0.13408075,0.00052977103,0.00013448442,0.00010246609,0.0033620466,0.00047173523,0.03686066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924433,0.00019303542,0.00004401215,0.00020943827,0.00014465408,0.00016464196],"domain_scores_gemma":[0.99804604,0.0007716656,0.0002087861,0.00046986647,0.00023364947,0.00026991864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060477137,0.00042002133,0.00064579817,0.0010568268,0.0022128504,0.0024620933,0.0012540258,0.0009444021,0.013895641],"category_scores_gemma":[0.0027413473,0.00051289744,0.00077193585,0.0016654317,0.0015163119,0.004079529,0.001998459,0.0015326601,0.0016260876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020805642,0.00004673158,0.0010548353,0.00018018701,0.00002666085,0.00009528879,0.00032553103,0.004473852,0.00298012,0.9492655,0.012973335,0.028369965],"study_design_scores_gemma":[0.000036995636,0.000028894066,0.00089837785,0.000047519923,0.00003950963,0.00021901418,0.00034909698,0.017260257,0.0030816179,0.96100074,0.017017929,0.00002006628],"about_ca_topic_score_codex":0.0023316194,"about_ca_topic_score_gemma":0.004612967,"teacher_disagreement_score":0.013895641,"about_ca_system_score_codex":0.0012670923,"about_ca_system_score_gemma":0.0008540892,"threshold_uncertainty_score":0.046485543},"labels":[],"label_agreement":null},{"id":"W2408748049","doi":"","title":"On a characterization for a graphic sequence to be potentially K r+1 -E(G)-graphic.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Characterization (materials science); Sequence (biology); Mathematics; Combinatorics; Biology; Nanotechnology; Genetics; Materials science","score_opus":0.043149540782141005,"score_gpt":0.28596882953651004,"score_spread":0.24281928875436903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408748049","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19790718,0.0014979709,0.515953,0.003724444,0.0008863144,0.0004120907,0.0043558367,0.0025455148,0.27271768],"genre_scores_gemma":[0.7857876,0.0012404941,0.14344834,0.0020672781,0.00079429173,0.000677343,0.0061634355,0.0010549923,0.05876621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902153,0.0001552578,0.00010984562,0.00029513094,0.00020803905,0.00021025221],"domain_scores_gemma":[0.9966869,0.0017344827,0.0003681116,0.00047535545,0.0003810013,0.00035419434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000827132,0.0012508461,0.00075347343,0.0031697962,0.0021525095,0.0038326199,0.0011069261,0.0017798133,0.028022107],"category_scores_gemma":[0.0060845,0.00050628156,0.0010619401,0.0025469614,0.0025748168,0.0062641026,0.0030743114,0.003309872,0.0059565357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000244526,0.000093728835,0.0010572337,0.00021385313,0.000020133819,0.00042572196,0.0006368278,0.0029980217,0.0058933212,0.9280914,0.017710762,0.04261447],"study_design_scores_gemma":[0.000041262723,0.0001505142,0.0017822267,0.00016467465,0.000042078842,0.0012757897,0.00038561702,0.012796496,0.0036076172,0.9326783,0.04699935,0.000076058306],"about_ca_topic_score_codex":0.0011866095,"about_ca_topic_score_gemma":0.0016565203,"teacher_disagreement_score":0.028022107,"about_ca_system_score_codex":0.0012437504,"about_ca_system_score_gemma":0.00074104604,"threshold_uncertainty_score":0.093743324},"labels":[],"label_agreement":null},{"id":"W2408749790","doi":"","title":"Some Identities On The Generalized Higher-Order Euler And Bernouli Numbers.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Euler's formula; Order (exchange); Euler number (physics); Pure mathematics; Euler equations; Mathematical analysis; Semi-implicit Euler method; Backward Euler method; Business","score_opus":0.06318145100021512,"score_gpt":0.2916045501854173,"score_spread":0.2284230991852022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408749790","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1345477,0.022856504,0.16399264,0.010245382,0.004102376,0.00008670892,0.001065339,0.00034963462,0.66275364],"genre_scores_gemma":[0.78523195,0.012991514,0.057823382,0.0025807468,0.0042234547,0.0001695879,0.00075667293,0.00022524886,0.13599743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994875,0.00013033795,0.000030158842,0.00006006875,0.00021682809,0.00007506618],"domain_scores_gemma":[0.99924505,0.00026143526,0.000102132704,0.000102073005,0.00017120736,0.0001182021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011109128,0.0006862653,0.00056645117,0.00246678,0.0016033868,0.0023559972,0.0008055833,0.00094488903,0.010984042],"category_scores_gemma":[0.0027030127,0.00031646708,0.00070996064,0.0018898345,0.0024865533,0.00453431,0.0018329648,0.0026200102,0.0025757307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034776124,0.000005313655,0.00007199423,0.000016450444,0.0000016064259,0.00003259954,0.00006957056,0.00013362993,0.00013954888,0.9944998,0.0017877391,0.0032381436],"study_design_scores_gemma":[0.0000033467916,0.000003884731,0.0001856915,0.000013947054,0.0000025944014,0.000081834456,0.00002923103,0.00070175587,0.000101773265,0.9900962,0.008773852,0.0000059132803],"about_ca_topic_score_codex":0.0013181462,"about_ca_topic_score_gemma":0.0018901664,"teacher_disagreement_score":0.010984042,"about_ca_system_score_codex":0.0015325565,"about_ca_system_score_gemma":0.00079379865,"threshold_uncertainty_score":0.03674525},"labels":[],"label_agreement":null},{"id":"W2408755481","doi":"","title":"Graceful and Edge-Antimagic Labelings.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Arithmetic; Computer science; Artificial intelligence","score_opus":0.007444644362127632,"score_gpt":0.21950250761011966,"score_spread":0.21205786324799203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408755481","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24809861,0.0034350294,0.38821042,0.008953615,0.0007785316,0.00017502092,0.0034110653,0.0019459866,0.3449918],"genre_scores_gemma":[0.84639037,0.0019434578,0.08223046,0.0012329306,0.0005954534,0.00017565448,0.0022871078,0.0004853025,0.06465921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982774,0.00042077564,0.00011982481,0.00044255127,0.0004063014,0.00033314104],"domain_scores_gemma":[0.994514,0.0025949343,0.0005638378,0.0013036701,0.00037642964,0.00064712553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001304767,0.0007454044,0.00078867533,0.0018262698,0.0029429807,0.004623984,0.0016698265,0.0017372676,0.014810121],"category_scores_gemma":[0.0060087484,0.00060170254,0.0011676925,0.0027676444,0.0032925429,0.00766566,0.0035387368,0.002998272,0.0024832461],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045712222,0.000025099689,0.00025036946,0.000053983473,0.000008977129,0.000042819032,0.00013607678,0.001552195,0.00051015633,0.9812983,0.0057069133,0.010369271],"study_design_scores_gemma":[0.000009848356,0.000008296241,0.00015147675,0.000015945765,0.000010132198,0.00008639746,0.00008275084,0.0035671531,0.0005044369,0.9859744,0.009578681,0.0000105397585],"about_ca_topic_score_codex":0.0020899542,"about_ca_topic_score_gemma":0.002875283,"teacher_disagreement_score":0.014810121,"about_ca_system_score_codex":0.002363858,"about_ca_system_score_gemma":0.0010844556,"threshold_uncertainty_score":0.04954475},"labels":[],"label_agreement":null},{"id":"W24097891","doi":"","title":"Permutations Restricted By Patterns Of Type (2, 1).","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Type (biology); Combinatorics; Biology","score_opus":0.00854896597266616,"score_gpt":0.23052660469578637,"score_spread":0.2219776387231202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W24097891","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38408297,0.00097636314,0.3126883,0.0013418051,0.002303959,0.00046419105,0.0043720417,0.0043605035,0.2894099],"genre_scores_gemma":[0.82319033,0.0004800509,0.07559785,0.0006184923,0.00032311984,0.0003620595,0.0032732785,0.000714732,0.09544016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830735,0.0004337222,0.00016966964,0.00038940276,0.0003278578,0.0003719281],"domain_scores_gemma":[0.997338,0.0007168031,0.00035759358,0.0010131514,0.00031197423,0.00026243168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070161594,0.00055325596,0.00066376093,0.0011167187,0.0018250671,0.0029422124,0.0010385113,0.0012423481,0.024019737],"category_scores_gemma":[0.003964936,0.0004607824,0.0009964905,0.0013011271,0.0013057173,0.003714449,0.0017445051,0.0011007398,0.007223665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010179725,0.00025194592,0.0032052232,0.0002861731,0.00011079369,0.0022288691,0.0009444725,0.0024058088,0.033513382,0.8692783,0.02221842,0.064538665],"study_design_scores_gemma":[0.00011398525,0.00019039557,0.0019072861,0.00010248195,0.00009245423,0.0024114794,0.0007489125,0.0077628773,0.025524609,0.8630934,0.09793697,0.0001151672],"about_ca_topic_score_codex":0.0006701627,"about_ca_topic_score_gemma":0.00112777,"teacher_disagreement_score":0.024019737,"about_ca_system_score_codex":0.00047508808,"about_ca_system_score_gemma":0.00080270105,"threshold_uncertainty_score":0.080354035},"labels":[],"label_agreement":null},{"id":"W24206502","doi":"10.1103/physrevlett.111.175501","title":"A note on the spatiality degree of graphs.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music)","score_opus":0.04942459947340829,"score_gpt":0.2878263316629336,"score_spread":0.2384017321895253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W24206502","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48417765,0.009097354,0.18027954,0.024373205,0.0014576776,0.00013373404,0.0029171114,0.00064378924,0.29691997],"genre_scores_gemma":[0.9596253,0.0030655991,0.025832346,0.0009860925,0.0006682631,0.000069733964,0.0006174856,0.00016419466,0.00897101],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980805,0.00040963574,0.00011522055,0.00060355884,0.00057142385,0.00021963913],"domain_scores_gemma":[0.9896185,0.0063424483,0.000761097,0.0018447186,0.0007587142,0.0006745129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014973632,0.0003676293,0.00053431536,0.0021755374,0.001816977,0.0033984983,0.0007619704,0.0010268296,0.0060410104],"category_scores_gemma":[0.009309357,0.0006211992,0.00048543015,0.0024709017,0.005694956,0.0055343406,0.0027907053,0.0029316912,0.0005492412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048343034,0.000013269053,0.0022627262,0.00011951627,0.000015423993,0.000101322505,0.00045308156,0.002039687,0.0021850073,0.9726721,0.003074267,0.017015312],"study_design_scores_gemma":[0.000014334684,0.0000450293,0.0028471777,0.000047237405,0.000019449782,0.0005556563,0.00015736028,0.00701611,0.002228347,0.9640991,0.022942875,0.000027289576],"about_ca_topic_score_codex":0.00089705986,"about_ca_topic_score_gemma":0.0014515083,"teacher_disagreement_score":0.0060410104,"about_ca_system_score_codex":0.00112721,"about_ca_system_score_gemma":0.00036598145,"threshold_uncertainty_score":0.020209253},"labels":[],"label_agreement":null},{"id":"W242281779","doi":"","title":"Erratum to \"Inducing regularization of graphs, multigraphs and pseudographs\" [Ars Combinatoria 65 (2002), 129-133].","year":2007,"lang":"en","type":"erratum","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Regularization (linguistics); Pure mathematics; Computer science; Artificial intelligence","score_opus":0.015201718010173145,"score_gpt":0.27535159430298567,"score_spread":0.2601498762928125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W242281779","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027179328,0.0028185295,0.0022892477,0.08478924,0.8823788,0.0000662743,0.00180958,0.0006523683,0.024924193],"genre_scores_gemma":[0.013702455,0.020344198,0.01262696,0.15395468,0.24818414,0.00039351563,0.008610842,0.0027020706,0.53948116],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965268,0.0006708742,0.0005379681,0.00047343044,0.001525298,0.00026554536],"domain_scores_gemma":[0.98790234,0.003523317,0.0005238759,0.00092292286,0.006546857,0.00058066554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029129053,0.0030514288,0.0028898984,0.0048703835,0.00689614,0.0045255907,0.0046443273,0.005954475,0.07732743],"category_scores_gemma":[0.028026504,0.0015011173,0.0019327905,0.004417812,0.0031507218,0.0058276462,0.0020719573,0.009010826,0.04566547],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002698102,0.000008250512,0.000021421356,0.00007144948,0.000005324981,0.00005538052,0.000014924212,0.00003373895,0.000027923292,0.0018311687,0.9945251,0.0033782774],"study_design_scores_gemma":[0.000059153204,0.0000495739,0.0007387586,0.00034292875,0.000043831962,0.00039167132,0.00013708042,0.0004276881,0.0003430056,0.009293122,0.9881136,0.000059579925],"about_ca_topic_score_codex":0.021647641,"about_ca_topic_score_gemma":0.029173847,"teacher_disagreement_score":0.07732743,"about_ca_system_score_codex":0.0054283515,"about_ca_system_score_gemma":0.0042193267,"threshold_uncertainty_score":0.258686},"labels":[],"label_agreement":null},{"id":"W24235330","doi":"10.1684/abc.2013.0901","title":"On Some Parameters Related to Uniquely Vertex-Colourable Graphs and Defining Sets.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Discrete mathematics; Graph","score_opus":0.01075096092046544,"score_gpt":0.22581488685195225,"score_spread":0.21506392593148682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W24235330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3785863,0.0053603165,0.5099586,0.006552064,0.0006449422,0.0002842937,0.0041226945,0.0004962437,0.093994595],"genre_scores_gemma":[0.8585761,0.0037132527,0.11416798,0.0010120352,0.00096969836,0.00053368916,0.004022557,0.00031133645,0.016693408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810934,0.0006986439,0.0001192686,0.00047536407,0.0003345162,0.00026293437],"domain_scores_gemma":[0.9851029,0.010394886,0.0017545677,0.0009100398,0.00092587696,0.0009117886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023776612,0.0012221176,0.001212786,0.0046898555,0.002286824,0.0033313278,0.0016862707,0.0021039625,0.009180928],"category_scores_gemma":[0.01239529,0.00060619414,0.0015591877,0.0036089863,0.0036028223,0.005874855,0.0025157041,0.004110698,0.0010402601],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063528525,0.000042858,0.0012437706,0.0001358983,0.000028862434,0.000117197036,0.00026195083,0.007039475,0.0005143012,0.9777605,0.0024077229,0.010384037],"study_design_scores_gemma":[0.000014198462,0.000036849367,0.0009597083,0.000043605487,0.000016173224,0.00023913362,0.00010437135,0.017768579,0.00024160286,0.9759556,0.004595242,0.000024965415],"about_ca_topic_score_codex":0.0012453254,"about_ca_topic_score_gemma":0.0011469219,"teacher_disagreement_score":0.009180928,"about_ca_system_score_codex":0.0028010642,"about_ca_system_score_gemma":0.00080621114,"threshold_uncertainty_score":0.03071326},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"}],"label_agreement":"agree"},{"id":"W24363857","doi":"10.4097/kjae.2013.65.5.480","title":"Antimagic Labelings of Generalized Petersen Graphs That Are Plane.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Plane (geometry); Geometry","score_opus":0.016673438934911928,"score_gpt":0.22365998022897612,"score_spread":0.20698654129406419,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W24363857","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.713756,0.00064601976,0.13823685,0.0018704934,0.00018989503,0.000120356344,0.0017085241,0.00082767964,0.14264421],"genre_scores_gemma":[0.92984927,0.00056491303,0.047305796,0.0003709032,0.00009441985,0.00009409732,0.0017560482,0.00019457201,0.01976992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993098,0.00016866623,0.000043555465,0.00016260386,0.00015549039,0.00015987938],"domain_scores_gemma":[0.9977556,0.0010197901,0.00036956512,0.0004102447,0.00020208141,0.00024276704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040979887,0.00041146865,0.0004997994,0.0013902487,0.0018956835,0.0036269922,0.00081818155,0.0014539029,0.008470421],"category_scores_gemma":[0.0029349462,0.0006129444,0.0006105382,0.001904527,0.0014297107,0.004424984,0.0017294226,0.0016472766,0.001214362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000972568,0.000047069803,0.0007847253,0.00008403978,0.000018058943,0.00018384146,0.00035563626,0.0033809263,0.002873205,0.96985257,0.0055473554,0.01677536],"study_design_scores_gemma":[0.000024013802,0.000020137666,0.00079101406,0.00003454088,0.00002545921,0.00030922928,0.00044033892,0.010899231,0.0027058744,0.97051066,0.014221969,0.000017468396],"about_ca_topic_score_codex":0.0013038608,"about_ca_topic_score_gemma":0.0022937658,"teacher_disagreement_score":0.008470421,"about_ca_system_score_codex":0.0010911459,"about_ca_system_score_gemma":0.0004986497,"threshold_uncertainty_score":0.028336346},"labels":[],"label_agreement":null},{"id":"W24655012","doi":"10.1080/13825585.2014.898735","title":"Weak Exponent of Indecomposability of an Irreducible Boolean Matrix.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Exponent; Discrete mathematics; Pure mathematics; Combinatorics","score_opus":0.015921357154576238,"score_gpt":0.2747183893652214,"score_spread":0.2587970322106452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W24655012","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86007977,0.0010379326,0.110850036,0.00082275976,0.0001772859,0.000072442126,0.0005498798,0.00016541072,0.026244491],"genre_scores_gemma":[0.9850417,0.00038703438,0.009620299,0.00005154684,0.00008075698,0.000022426302,0.0002583765,0.000028116548,0.004509703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995443,0.00007788363,0.000040909006,0.000089283465,0.00015427668,0.0000932595],"domain_scores_gemma":[0.9980369,0.0007748594,0.00056404324,0.00017734163,0.00020234668,0.00024449348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007131005,0.00044032958,0.00034498062,0.00136966,0.00045761134,0.0012688326,0.0002912312,0.00025325897,0.0058361],"category_scores_gemma":[0.004726507,0.00018082367,0.00040926927,0.00048177023,0.0015511033,0.0017312065,0.00094987836,0.0009694966,0.0007843299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006692352,0.00015620705,0.015305395,0.0004337153,0.000072763534,0.001748011,0.0013218143,0.00432295,0.04033799,0.85399467,0.0036199049,0.07801736],"study_design_scores_gemma":[0.00004987337,0.00026871805,0.012580639,0.000051087114,0.000040543404,0.0025355306,0.00039710055,0.03537732,0.015194205,0.9246273,0.008814801,0.00006284523],"about_ca_topic_score_codex":0.0005824249,"about_ca_topic_score_gemma":0.00082622975,"teacher_disagreement_score":0.0058361,"about_ca_system_score_codex":0.0005188215,"about_ca_system_score_gemma":0.00036956198,"threshold_uncertainty_score":0.01952368},"labels":[],"label_agreement":null},{"id":"W24865198","doi":"","title":"On the vertex distinguishing equitable edge-coloring of graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Enhanced Data Rates for GSM Evolution; Edge coloring; Graph coloring; Graph; Computer science; Line graph; Artificial intelligence","score_opus":0.025566698070572356,"score_gpt":0.22635348457898022,"score_spread":0.20078678650840787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W24865198","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36823845,0.003561855,0.41416165,0.010505114,0.00086359726,0.0001931369,0.0019189494,0.0010903513,0.19946697],"genre_scores_gemma":[0.86967224,0.0017671374,0.099034816,0.0013881351,0.000614447,0.00018906176,0.0014446689,0.00034514588,0.025544282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984118,0.0006190237,0.0000710164,0.00027789996,0.00027504584,0.0003451835],"domain_scores_gemma":[0.9900238,0.0069537987,0.0006143234,0.0013108129,0.00047383466,0.00062353275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017835457,0.00070434355,0.0009374155,0.0018052136,0.0024035105,0.0029339155,0.002074241,0.0018923583,0.008600914],"category_scores_gemma":[0.010629766,0.00063215377,0.0006296962,0.0025681292,0.0032123055,0.008173263,0.0031578736,0.0032927792,0.0012402589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014710418,0.00007687618,0.0010870176,0.00013101935,0.000018640516,0.00007886304,0.00021903748,0.0077330656,0.0009461304,0.9537536,0.011658983,0.024149636],"study_design_scores_gemma":[0.000023329976,0.000019360017,0.00042926337,0.000032320357,0.000016740865,0.00012931152,0.00015976325,0.018532716,0.00067061593,0.97411865,0.005853527,0.000014385469],"about_ca_topic_score_codex":0.0020029424,"about_ca_topic_score_gemma":0.0025306793,"teacher_disagreement_score":0.008600914,"about_ca_system_score_codex":0.0020513271,"about_ca_system_score_gemma":0.0009815781,"threshold_uncertainty_score":0.02877295},"labels":[],"label_agreement":null},{"id":"W24923158","doi":"","title":"Fano Quads in Projective Planes.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fano plane; Mathematics; Projective plane; Combinatorics; Projective test; Geometry; Pure mathematics; Correlation","score_opus":0.00976827051311515,"score_gpt":0.23745950386733644,"score_spread":0.22769123335422128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W24923158","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21198162,0.003247975,0.49245948,0.001316258,0.00060476543,0.00014228736,0.0013058423,0.0010537312,0.28788802],"genre_scores_gemma":[0.8358681,0.0011816222,0.1033114,0.00025226347,0.00015554254,0.00007943464,0.0011719046,0.0003949289,0.057584703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997243,0.000065934335,0.000013582749,0.00005267794,0.000091264956,0.000052144922],"domain_scores_gemma":[0.99973077,0.00010020099,0.000033947297,0.000039027815,0.000050541257,0.000045460914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031107696,0.00044421433,0.0003340957,0.0015079115,0.0008879107,0.0013939005,0.00048684623,0.00045431958,0.012550616],"category_scores_gemma":[0.0014159987,0.00031763746,0.00033085915,0.000831829,0.001156116,0.001817849,0.0015024351,0.00091220473,0.0018486407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004135735,0.00001167635,0.0005279802,0.00005952392,0.000008857386,0.00012437858,0.00016797156,0.0042746463,0.0015324771,0.9464465,0.008283987,0.038520783],"study_design_scores_gemma":[0.000030965057,0.00003327875,0.00078288873,0.00006621446,0.0000134492675,0.0005379761,0.00029214047,0.031960413,0.0023305765,0.9091874,0.054746807,0.000017910814],"about_ca_topic_score_codex":0.0012060393,"about_ca_topic_score_gemma":0.0022729286,"teacher_disagreement_score":0.012550616,"about_ca_system_score_codex":0.00060117466,"about_ca_system_score_gemma":0.00021384045,"threshold_uncertainty_score":0.04198599},"labels":[],"label_agreement":null},{"id":"W25053562","doi":"10.1099/vir.0.066423-0","title":"Dimensions for Cographs.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Biotechnology and Biological Sciences Research Council","keywords":"Mathematics","score_opus":0.01702045984928318,"score_gpt":0.28752908839130725,"score_spread":0.27050862854202407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W25053562","genre_codex":"dataset","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030142022,0.003421797,0.1691841,0.0026980047,0.0030821029,0.0006014261,0.30917594,0.2832122,0.22561018],"genre_scores_gemma":[0.036862206,0.0038123012,0.29570383,0.0027637465,0.0008218526,0.0023427613,0.41655588,0.087881505,0.15325594],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997881,0.00025355726,0.0002315677,0.00073583185,0.00061371364,0.00028427196],"domain_scores_gemma":[0.99788445,0.00054137345,0.00015961878,0.00064717716,0.00049624196,0.0002710056],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017871573,0.0032179353,0.0020490356,0.0043955217,0.0020313784,0.0073439977,0.004022333,0.0027307537,0.43737164],"category_scores_gemma":[0.0076603265,0.0019071084,0.0026955404,0.004637774,0.0012886991,0.00690356,0.0064123794,0.0025763763,0.36216757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038954147,0.00006215278,0.0012667358,0.0017014004,0.000105570085,0.0003348505,0.0007790793,0.00065615936,0.0028329494,0.05170619,0.7642373,0.17592804],"study_design_scores_gemma":[0.000053200034,0.000019313842,0.00067038013,0.00023522436,0.000029619257,0.00023185201,0.0001617915,0.0014969341,0.000994384,0.034800258,0.96126723,0.000039803854],"about_ca_topic_score_codex":0.005423766,"about_ca_topic_score_gemma":0.006085359,"teacher_disagreement_score":0.43737164,"about_ca_system_score_codex":0.0014644364,"about_ca_system_score_gemma":0.002196142,"threshold_uncertainty_score":0.80252105},"labels":[],"label_agreement":null},{"id":"W25261710","doi":"10.1016/j.ijpharm.2014.09.035","title":"On the Toughness of the Middle Graph of a Graph.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Institute of Allergy and Infectious Diseases","keywords":"Mathematics; Graph; Toughness; Combinatorics; Composite material; Materials science","score_opus":0.022204926381563184,"score_gpt":0.21556352523421562,"score_spread":0.19335859885265244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W25261710","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15571646,0.018392848,0.055926543,0.0073298677,0.014510711,0.0008334215,0.02761075,0.008979804,0.71069956],"genre_scores_gemma":[0.54379386,0.0062880334,0.02724234,0.0033973954,0.0006688309,0.00081876956,0.013731281,0.0036757083,0.40038386],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901366,0.00007023886,0.000044127602,0.000265019,0.00043459403,0.00017235267],"domain_scores_gemma":[0.9975547,0.00076486723,0.00024020817,0.0001731011,0.0010133154,0.00025381905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005485242,0.0014849359,0.0008977572,0.0028158017,0.0011851161,0.0012938534,0.001305128,0.0013251404,0.2640787],"category_scores_gemma":[0.0032672116,0.0005657034,0.000881198,0.0014051279,0.00082457176,0.0015650614,0.0011166034,0.0022329001,0.06283589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018084103,0.0005069312,0.0069365385,0.0035249111,0.00026055865,0.00118445,0.0007301724,0.0097685335,0.2615843,0.017170085,0.31633922,0.38018578],"study_design_scores_gemma":[0.00008766234,0.0012935239,0.033393435,0.00062368315,0.00031316778,0.0016113227,0.0027945049,0.022368034,0.13819492,0.015108982,0.7839283,0.0002825215],"about_ca_topic_score_codex":0.0030848077,"about_ca_topic_score_gemma":0.0035920336,"teacher_disagreement_score":0.2640787,"about_ca_system_score_codex":0.0006607506,"about_ca_system_score_gemma":0.00052712683,"threshold_uncertainty_score":0.8834313},"labels":[],"label_agreement":null},{"id":"W252754","doi":"","title":"The domatic numbers of factors of graphs.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.008305826801499328,"score_gpt":0.21371586878130647,"score_spread":0.20541004197980714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W252754","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4592778,0.006936964,0.39488667,0.002430914,0.000515845,0.00021590048,0.002596339,0.0004307856,0.13270876],"genre_scores_gemma":[0.8819897,0.0019737673,0.09989187,0.00035613618,0.00036499865,0.00020924938,0.00096433144,0.00012019527,0.01412965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983132,0.00048807298,0.00012962917,0.00045655304,0.00039853348,0.00021402363],"domain_scores_gemma":[0.99548715,0.0024893407,0.0005922163,0.00058504916,0.00034202295,0.00050422014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016574472,0.0007962207,0.000641274,0.0025027941,0.0018442168,0.0032345592,0.0007538911,0.00076393154,0.003914141],"category_scores_gemma":[0.008464536,0.0005615898,0.00078338356,0.0017495696,0.0036246171,0.005257582,0.0019319336,0.001442842,0.0007676752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024379276,0.000022633352,0.0030079465,0.00016181183,0.000025327201,0.00006297183,0.00033358563,0.0049986714,0.0047448985,0.9597473,0.0027508247,0.023900202],"study_design_scores_gemma":[0.000022247266,0.00006808111,0.0017336934,0.000061353545,0.000027546685,0.0005258551,0.00020059811,0.013544952,0.005632788,0.94817054,0.029977439,0.000034869532],"about_ca_topic_score_codex":0.00041532092,"about_ca_topic_score_gemma":0.00069555186,"teacher_disagreement_score":0.003914141,"about_ca_system_score_codex":0.0017622496,"about_ca_system_score_gemma":0.00057137094,"threshold_uncertainty_score":0.013094127},"labels":[],"label_agreement":null},{"id":"W25345293","doi":"","title":"Steiner Triple Systems with Automorphism Type [1, 0, 0, 0, 0, 0, 0, t, 0, ...0, 1, 0, ...0].","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Differential Equations and Dynamical Systems","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Type (biology); Automorphism; Biology","score_opus":0.026661387497821015,"score_gpt":0.27171972462797217,"score_spread":0.24505833713015115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W25345293","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5502987,0.00095485576,0.13865156,0.0014739139,0.000652221,0.00017858451,0.0025833112,0.0011288492,0.304078],"genre_scores_gemma":[0.9450944,0.0004128179,0.023588369,0.00024797732,0.00014093686,0.00009070758,0.002292065,0.00014029532,0.027992373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959034,0.00008763754,0.000041643452,0.00007176634,0.000110603076,0.00009804386],"domain_scores_gemma":[0.999423,0.00009692578,0.00017311645,0.00009195303,0.00010123008,0.00011376883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028307523,0.00044268728,0.00053367985,0.0013836728,0.0013967608,0.0016380871,0.0004889605,0.0009353453,0.014260107],"category_scores_gemma":[0.0008989568,0.0003461142,0.0006308378,0.0010555445,0.0012196307,0.0016855667,0.0017107739,0.0009085239,0.0025891438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014086011,0.000024365208,0.00087342586,0.00006257906,0.000034746754,0.0006129699,0.0003395307,0.0033322324,0.0041420087,0.97200215,0.007084979,0.011350187],"study_design_scores_gemma":[0.000075136166,0.000091921895,0.0013631994,0.00005173566,0.000042883457,0.001028838,0.00067952863,0.011645194,0.0038666697,0.9584162,0.022695322,0.000043313135],"about_ca_topic_score_codex":0.0007337742,"about_ca_topic_score_gemma":0.0014125286,"teacher_disagreement_score":0.014260107,"about_ca_system_score_codex":0.00074354984,"about_ca_system_score_gemma":0.00051901315,"threshold_uncertainty_score":0.047704816},"labels":[],"label_agreement":null},{"id":"W2571641900","doi":"","title":"An upper bound for the crossing number of locally twisted cubes","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Crossing number (knot theory); Upper and lower bounds; Combinatorics; Mathematical analysis; Geography; Intersection (aeronautics)","score_opus":0.02201934155732436,"score_gpt":0.3160696542149621,"score_spread":0.2940503126576377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571641900","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.297799,0.0041783266,0.4999199,0.0031074476,0.0012155637,0.00017326919,0.0011468127,0.0019156091,0.1905441],"genre_scores_gemma":[0.8565213,0.0024881752,0.11045794,0.0006835124,0.0006334142,0.00030288566,0.0011551683,0.00096505776,0.026792383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977392,0.00043916304,0.000127035,0.00044963966,0.00073724263,0.00050778163],"domain_scores_gemma":[0.9878594,0.0076750764,0.0006455383,0.0019293419,0.0006758487,0.0012147198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026139775,0.0016227182,0.0017461153,0.0039458415,0.0022339073,0.0056739366,0.0037997228,0.0022464863,0.021286258],"category_scores_gemma":[0.01487866,0.0009850534,0.0014647007,0.0028688782,0.0038123475,0.008504811,0.0058706123,0.0047701714,0.002646708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027165175,0.00009179248,0.001773383,0.00034371405,0.000057450867,0.00029030358,0.00031724313,0.026586456,0.01045371,0.91873425,0.007347168,0.033732794],"study_design_scores_gemma":[0.000030751984,0.000093440125,0.0009839316,0.00015245806,0.00009064312,0.0006049659,0.00014569558,0.12605424,0.00970423,0.8483839,0.013686737,0.00006895193],"about_ca_topic_score_codex":0.0005570623,"about_ca_topic_score_gemma":0.00083142635,"teacher_disagreement_score":0.021286258,"about_ca_system_score_codex":0.0020037175,"about_ca_system_score_gemma":0.0007515065,"threshold_uncertainty_score":0.07120961},"labels":[],"label_agreement":null},{"id":"W2571680230","doi":"","title":"On implicit degree sum condition for long cycles.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music)","score_opus":0.024488136938004713,"score_gpt":0.2721272971649703,"score_spread":0.24763916022696558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571680230","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35640806,0.002677373,0.29644468,0.008410587,0.0015648868,0.00022034782,0.0015421072,0.00078537624,0.33194658],"genre_scores_gemma":[0.9305745,0.0010302311,0.030463338,0.0011545697,0.00070649857,0.00017233513,0.0008929804,0.00034278884,0.034662735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893886,0.000217634,0.000072028015,0.00021664026,0.0003165098,0.00023824951],"domain_scores_gemma":[0.9936388,0.0040138825,0.00033632352,0.00061158155,0.0008551743,0.0005442684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014135703,0.0004767817,0.000798959,0.0017633314,0.0021226036,0.0031756868,0.0014838928,0.0016114133,0.025790988],"category_scores_gemma":[0.0153579125,0.0003679612,0.00078670954,0.0016341287,0.002954548,0.01125189,0.0030767007,0.0036619545,0.0023819574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006847658,0.000022688182,0.00037789502,0.0000742214,0.000006346764,0.00008981209,0.00013732792,0.0011640642,0.00064032205,0.98797286,0.0026115957,0.0068343296],"study_design_scores_gemma":[0.000014965866,0.000010409885,0.00019026257,0.000022250599,0.000009304294,0.00008881467,0.000068095076,0.0071335644,0.0006271089,0.98830146,0.0035207104,0.000013069629],"about_ca_topic_score_codex":0.0016474914,"about_ca_topic_score_gemma":0.0021048316,"teacher_disagreement_score":0.025790988,"about_ca_system_score_codex":0.0014470753,"about_ca_system_score_gemma":0.0011228358,"threshold_uncertainty_score":0.08627945},"labels":[],"label_agreement":null},{"id":"W2571698871","doi":"","title":"Signed (j, k)-domatic number of graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.009548078273400035,"score_gpt":0.23017928033944288,"score_spread":0.22063120206604284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571698871","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5019108,0.0010667621,0.2188358,0.009934592,0.0013287704,0.00015206078,0.0041523953,0.0011382818,0.2614806],"genre_scores_gemma":[0.9120593,0.00033089914,0.046362247,0.00079835724,0.0003393468,0.00013009689,0.001296957,0.00022787163,0.03845491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886525,0.00031750888,0.00008835,0.00027462043,0.00022960304,0.0002247637],"domain_scores_gemma":[0.9956358,0.0017458774,0.00063859473,0.00068305584,0.0005304759,0.0007662384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010567628,0.00043725377,0.0006125555,0.0017515861,0.0023730292,0.004854466,0.0014577071,0.0014161149,0.018417338],"category_scores_gemma":[0.0066419845,0.00036436645,0.0005755973,0.0015696641,0.0024306583,0.0069473973,0.0019499924,0.0021531507,0.0023704085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020078193,0.00005253698,0.0014991779,0.00010654715,0.000016000762,0.000079774334,0.00016410851,0.0019626908,0.0023288568,0.963741,0.0101182405,0.019730363],"study_design_scores_gemma":[0.000035698366,0.000035779554,0.0012319331,0.000032278353,0.000020150177,0.00031169006,0.0002059908,0.010734025,0.0027433555,0.969942,0.014675382,0.000031779105],"about_ca_topic_score_codex":0.00077071466,"about_ca_topic_score_gemma":0.0014541841,"teacher_disagreement_score":0.018417338,"about_ca_system_score_codex":0.0017395747,"about_ca_system_score_gemma":0.0011400052,"threshold_uncertainty_score":0.06161213},"labels":[],"label_agreement":null},{"id":"W2571724965","doi":"","title":"Paired-domination in claw-free graphs with minimum degree at least four.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Claw; Degree (music); Combinatorics; Biology; Physics","score_opus":0.028184767203854506,"score_gpt":0.2531364262116594,"score_spread":0.22495165900780487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571724965","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86246705,0.00073250907,0.06586576,0.0015770682,0.00011830297,0.00015042894,0.0012059736,0.00048373133,0.067399174],"genre_scores_gemma":[0.9615825,0.00031314453,0.017724426,0.00031149414,0.000058938866,0.000101914375,0.0010925654,0.000092473056,0.018722603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994394,0.000112808695,0.000028033375,0.00013743875,0.00010997638,0.00017238977],"domain_scores_gemma":[0.9965894,0.0017707226,0.00051061163,0.0002869661,0.0002987486,0.00054355216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042288424,0.0004218364,0.00051393517,0.0014100967,0.0018326158,0.001765956,0.0014084124,0.0011100158,0.009796837],"category_scores_gemma":[0.0036777577,0.0005834956,0.0004978924,0.0012231814,0.0012237448,0.0030240242,0.0018561939,0.0012595664,0.0012742068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010573036,0.00048060634,0.0140567785,0.00088177697,0.00022874749,0.0031835726,0.002411864,0.023484074,0.037649464,0.78535444,0.024395596,0.106815696],"study_design_scores_gemma":[0.00019174803,0.00015105419,0.004888435,0.00018546276,0.00015664277,0.0024440365,0.0014597155,0.048859786,0.017429931,0.9022079,0.02195785,0.0000675169],"about_ca_topic_score_codex":0.0018000588,"about_ca_topic_score_gemma":0.0035868695,"teacher_disagreement_score":0.009796837,"about_ca_system_score_codex":0.0007582346,"about_ca_system_score_gemma":0.0007565067,"threshold_uncertainty_score":0.032773674},"labels":[],"label_agreement":null},{"id":"W2571725614","doi":"","title":"On the 2-rainbow bondage number of planar graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Planar; Planar graph; Combinatorics; Rainbow; Graph; Computer graphics (images); Computer science; Optics; Physics","score_opus":0.015961758262073477,"score_gpt":0.27647453151757984,"score_spread":0.26051277325550637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571725614","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63294584,0.0044262903,0.08294675,0.005730048,0.0015578247,0.0001069346,0.0012090544,0.0005627373,0.27051455],"genre_scores_gemma":[0.9672638,0.0017302525,0.01256644,0.00037089156,0.0006300768,0.000114595576,0.00039461735,0.00017060855,0.016758705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922717,0.00018876833,0.000033503155,0.0001737114,0.00021522482,0.00016163003],"domain_scores_gemma":[0.9959209,0.0023426602,0.00065715786,0.0002803649,0.00024706437,0.0005518788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010779939,0.0006574788,0.0008191156,0.0032126354,0.0019292305,0.0025262847,0.0017513251,0.0017888704,0.017526202],"category_scores_gemma":[0.0073683294,0.00047879812,0.0004926191,0.0021528464,0.0030754441,0.00721494,0.0024372172,0.0024581568,0.0020635377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028288286,0.000057046735,0.0013224685,0.00019098252,0.000024560404,0.00011302819,0.00027113457,0.008027116,0.0023465448,0.9570859,0.009171586,0.02110668],"study_design_scores_gemma":[0.00003557808,0.00004451015,0.0011134385,0.000060055903,0.000021131787,0.00015532043,0.00014682335,0.015337408,0.0011309974,0.97627,0.0056492626,0.000035374338],"about_ca_topic_score_codex":0.0009818703,"about_ca_topic_score_gemma":0.0014192638,"teacher_disagreement_score":0.017526202,"about_ca_system_score_codex":0.0014566982,"about_ca_system_score_gemma":0.00056297117,"threshold_uncertainty_score":0.058631003},"labels":[],"label_agreement":null},{"id":"W2571762197","doi":"","title":"The smallest Merrifield-Simmons index of trees with exactly six leaves.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Combinatorics; Tree (set theory); Discrete mathematics; Arithmetic; Computer science","score_opus":0.020273262348202488,"score_gpt":0.25779202593832057,"score_spread":0.2375187635901181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571762197","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6598456,0.003999933,0.06414117,0.0030946678,0.0010466485,0.00008887256,0.0044271233,0.0007649966,0.26259094],"genre_scores_gemma":[0.9543292,0.00087022805,0.021882314,0.0004401773,0.00037359004,0.000059090515,0.0016161677,0.00023295717,0.020196222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996132,0.00006894965,0.000030817962,0.00009283625,0.00009868672,0.000095517826],"domain_scores_gemma":[0.99821633,0.0006949111,0.00028529484,0.00020151831,0.00023372365,0.0003681893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048353212,0.0003934906,0.00074620254,0.0023159876,0.0015185124,0.0026996275,0.0010001004,0.0010262668,0.007943095],"category_scores_gemma":[0.0033566232,0.0002900043,0.00036636333,0.001481139,0.0013801989,0.0035302576,0.0012407794,0.0014938726,0.0023950955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005134062,0.00007000395,0.0027888492,0.00023500627,0.00003600015,0.00036191597,0.00081704726,0.0016889386,0.010093994,0.91462654,0.02022602,0.048542276],"study_design_scores_gemma":[0.000046053035,0.00006057415,0.0019072923,0.0000710323,0.000031913092,0.0007640378,0.00033418028,0.0043540043,0.004223063,0.95666325,0.03150882,0.000035787318],"about_ca_topic_score_codex":0.00067041954,"about_ca_topic_score_gemma":0.0010694233,"teacher_disagreement_score":0.007943095,"about_ca_system_score_codex":0.0009019218,"about_ca_system_score_gemma":0.0006606543,"threshold_uncertainty_score":0.026572287},"labels":[],"label_agreement":null},{"id":"W2571822734","doi":"","title":"Construction quasi-regular semilattices with singular linear spaces.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.008562909992378024,"score_gpt":0.22222144518221248,"score_spread":0.21365853518983446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571822734","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12407642,0.0008773437,0.7431279,0.0016186836,0.0005631229,0.00017130506,0.0006362176,0.0019645102,0.12696454],"genre_scores_gemma":[0.7354096,0.00040016574,0.21253026,0.0004496722,0.00023226747,0.00014301071,0.000745869,0.0004944008,0.049594697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983694,0.00049038546,0.00013137967,0.0002529923,0.0005498876,0.00020601816],"domain_scores_gemma":[0.9983872,0.0004954079,0.00012160587,0.00032546834,0.0002965238,0.00037385157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018211614,0.0004913578,0.00050294684,0.0012904106,0.0017278501,0.0030261786,0.00092875207,0.00057167193,0.008720754],"category_scores_gemma":[0.002272802,0.0007333058,0.001156235,0.000721972,0.0037970718,0.0052177,0.004430426,0.0022704008,0.0020108626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000607818,0.000033436347,0.00020332061,0.000063445,0.000009356039,0.00010449224,0.00040133286,0.0003159415,0.0032283557,0.9874653,0.0015795736,0.0065346374],"study_design_scores_gemma":[0.00004311542,0.000058085185,0.0002707811,0.000027361617,0.000022097758,0.0004886855,0.0005203258,0.0049987994,0.0069264416,0.9691328,0.017484546,0.000026991313],"about_ca_topic_score_codex":0.00055784045,"about_ca_topic_score_gemma":0.001087949,"teacher_disagreement_score":0.008720754,"about_ca_system_score_codex":0.0011157909,"about_ca_system_score_gemma":0.000745761,"threshold_uncertainty_score":0.029173851},"labels":[],"label_agreement":null},{"id":"W2571863560","doi":"","title":"D-Graphs For Graphs With Cyclomatic Number 1.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cyclomatic complexity; Discrete mathematics; Combinatorics; Computer science; Programming language","score_opus":0.005566835813694077,"score_gpt":0.1961091470847512,"score_spread":0.1905423112710571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571863560","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19090515,0.0045664315,0.3654674,0.007970245,0.0017497317,0.00029268514,0.0046290956,0.0013027292,0.42311648],"genre_scores_gemma":[0.87286407,0.0022979856,0.061938696,0.0029195263,0.00055762526,0.00033401564,0.0016740176,0.000248342,0.057165787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995832,0.00011743903,0.000022035665,0.00011511429,0.00007537883,0.0000867476],"domain_scores_gemma":[0.99830925,0.00078313315,0.00029117812,0.00024401413,0.00017620606,0.00019607609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003449377,0.00051033794,0.00029636003,0.0031695839,0.0013001536,0.0021869391,0.000811168,0.0011863868,0.01894113],"category_scores_gemma":[0.0019940578,0.000248981,0.000458508,0.0016122374,0.0014581416,0.0021107441,0.0012877268,0.0015841095,0.0023376378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027472413,0.000016309701,0.0002203818,0.00006231426,0.0000064050073,0.00008466063,0.00007091268,0.00070769765,0.0009143579,0.98418933,0.0057046553,0.007995443],"study_design_scores_gemma":[0.0000101435035,0.0000108811855,0.00035314285,0.000043300184,0.000008466522,0.00027459365,0.00010242592,0.005062324,0.001063671,0.96697235,0.02608493,0.000013854109],"about_ca_topic_score_codex":0.00084868097,"about_ca_topic_score_gemma":0.0014495648,"teacher_disagreement_score":0.01894113,"about_ca_system_score_codex":0.0013402323,"about_ca_system_score_gemma":0.00047022023,"threshold_uncertainty_score":0.06336439},"labels":[],"label_agreement":null},{"id":"W2571906584","doi":"","title":"The Super Vertex-Graceful Labeling Of Graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Graph","score_opus":0.009741109062009853,"score_gpt":0.21467932911614504,"score_spread":0.2049382200541352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571906584","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23544018,0.0039835004,0.47516078,0.008507978,0.00086235465,0.00012551977,0.00191958,0.001640019,0.2723602],"genre_scores_gemma":[0.8671002,0.0020129355,0.08762975,0.0015186032,0.00076541567,0.00017408389,0.0013138029,0.0005313167,0.03895382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989543,0.00033794343,0.000045188477,0.000241395,0.0002352317,0.00018603248],"domain_scores_gemma":[0.99686974,0.0012858395,0.00031485182,0.0009566357,0.0001975945,0.00037542506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010536355,0.0006001167,0.0006672856,0.0014700028,0.0021667753,0.0029142462,0.0015235714,0.001323645,0.009144861],"category_scores_gemma":[0.004632857,0.0005416263,0.0008440659,0.0018649349,0.0034484318,0.005869458,0.0028168461,0.002961215,0.001653543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031164618,0.000012244413,0.00018000999,0.00004634936,0.0000050276954,0.000020027295,0.00009340398,0.0018515033,0.00044929318,0.98373187,0.0046081194,0.008971042],"study_design_scores_gemma":[0.0000061129117,0.000005611695,0.00010370076,0.000012215479,0.0000049310497,0.00003618285,0.00003878016,0.0054225414,0.00032615318,0.9885727,0.005464844,0.0000060698885],"about_ca_topic_score_codex":0.002108626,"about_ca_topic_score_gemma":0.0024552366,"teacher_disagreement_score":0.009144861,"about_ca_system_score_codex":0.0018556259,"about_ca_system_score_gemma":0.0009858068,"threshold_uncertainty_score":0.03059262},"labels":[],"label_agreement":null},{"id":"W2571916084","doi":"","title":"Trees with a given order and matching number that have maximum general sum-connectivity index.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Matching (statistics); Order (exchange); Statistics; Combinatorics; Applied mathematics; Computer science; Economics","score_opus":0.011617981999662798,"score_gpt":0.22587698573966697,"score_spread":0.21425900374000417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571916084","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7589755,0.0012879376,0.15720901,0.0019420597,0.00023392495,0.00030983146,0.010029388,0.0020869416,0.06792549],"genre_scores_gemma":[0.8514018,0.0012126458,0.124825574,0.0002756963,0.00015812217,0.00019688139,0.005830119,0.00047970907,0.015619493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950886,0.00007856029,0.000038241324,0.0001284962,0.00011411318,0.0001317272],"domain_scores_gemma":[0.9973412,0.0010503429,0.00039162417,0.0004964962,0.0003506354,0.00036964758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060370215,0.00057040487,0.0011165359,0.0016224664,0.0013846575,0.002960342,0.0011046581,0.0017247957,0.008570879],"category_scores_gemma":[0.0058315066,0.0004956108,0.0005847332,0.0025592942,0.00063015363,0.003607202,0.00088653655,0.00081911054,0.0018981454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028518538,0.0010737154,0.023411358,0.0025751137,0.0005298032,0.0016447378,0.0015981165,0.0963648,0.11362217,0.5075183,0.04558755,0.20322263],"study_design_scores_gemma":[0.00030258956,0.00057964015,0.0122142965,0.0003525025,0.00055631524,0.003536386,0.0014051131,0.14707544,0.059463136,0.709186,0.065208435,0.000120169476],"about_ca_topic_score_codex":0.00056392705,"about_ca_topic_score_gemma":0.0017567505,"teacher_disagreement_score":0.008570879,"about_ca_system_score_codex":0.0011044514,"about_ca_system_score_gemma":0.0010628403,"threshold_uncertainty_score":0.028672457},"labels":[],"label_agreement":null},{"id":"W2571948696","doi":"","title":"Upper Bounds of Four Types of Graph Labelings.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Graph; Edge-graceful labeling; Discrete mathematics; Line graph; Graph power","score_opus":0.01268965586747951,"score_gpt":0.22074951115332392,"score_spread":0.20805985528584442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571948696","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091953695,0.008876013,0.4162958,0.013119112,0.0014713684,0.0005103837,0.0069493316,0.004607056,0.45621714],"genre_scores_gemma":[0.6254936,0.005336877,0.293917,0.0041991444,0.0020109985,0.0010429556,0.008846389,0.0022076853,0.056945425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99012756,0.002303448,0.0006340856,0.0018878413,0.0028522222,0.002194877],"domain_scores_gemma":[0.92553127,0.05077441,0.0031432814,0.012604857,0.003246476,0.004699717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064023347,0.0029326603,0.0022451805,0.006825784,0.0041622696,0.014327331,0.008083267,0.0050605144,0.03812576],"category_scores_gemma":[0.04701311,0.0017454496,0.003290883,0.008682813,0.006274105,0.017515235,0.009122917,0.0093884785,0.0067894463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047385643,0.00027614326,0.0015443172,0.0005465244,0.000064982654,0.00009877349,0.0002703284,0.008684362,0.0017403675,0.89555496,0.034605015,0.05614031],"study_design_scores_gemma":[0.00009831094,0.0000926904,0.0012130586,0.00027561313,0.00015488343,0.000514383,0.00024014244,0.03512803,0.003706766,0.9277639,0.030724037,0.00008823805],"about_ca_topic_score_codex":0.001837311,"about_ca_topic_score_gemma":0.003088821,"teacher_disagreement_score":0.03812576,"about_ca_system_score_codex":0.006975175,"about_ca_system_score_gemma":0.0028281745,"threshold_uncertainty_score":0.12754333},"labels":[],"label_agreement":null},{"id":"W2572025762","doi":"","title":"A note on acyclic total coloring of plane graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Edge coloring; Plane (geometry); Complete coloring; Geometry; Graph; Line graph","score_opus":0.011595262055539344,"score_gpt":0.22706169778017482,"score_spread":0.21546643572463547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572025762","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02759,0.02461476,0.43357712,0.024283351,0.013448838,0.00014284607,0.0022254512,0.0014091015,0.47270846],"genre_scores_gemma":[0.4146204,0.0530231,0.37029502,0.014639679,0.012981064,0.00034455184,0.0028571477,0.0015595776,0.12967959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992557,0.00022884358,0.000037900307,0.00019019152,0.00019388538,0.00009347035],"domain_scores_gemma":[0.99660146,0.0022898428,0.000118797354,0.0005300767,0.0002504681,0.00020931287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012641948,0.00088652637,0.0007709387,0.0016308826,0.0017021851,0.0024367652,0.0016770046,0.00096632785,0.014391782],"category_scores_gemma":[0.0043190205,0.0005602559,0.00097138266,0.0034894529,0.0024254438,0.005117765,0.0021452908,0.004573083,0.0023420346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006942524,0.00004897858,0.00045893146,0.00034650243,0.000027750519,0.00018106036,0.0001755627,0.003737973,0.001289697,0.85739213,0.08588393,0.050388157],"study_design_scores_gemma":[0.000010180034,0.000023518396,0.00049550686,0.00008473404,0.00003203609,0.00022617778,0.00011609838,0.004256541,0.0007359989,0.8513988,0.14259952,0.000020866271],"about_ca_topic_score_codex":0.0052852132,"about_ca_topic_score_gemma":0.010232493,"teacher_disagreement_score":0.014391782,"about_ca_system_score_codex":0.0016447486,"about_ca_system_score_gemma":0.00093729224,"threshold_uncertainty_score":0.048145294},"labels":[],"label_agreement":null},{"id":"W2572097019","doi":"","title":"A list for vertex-primitive symmetric graphs of order 6p.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Order (exchange); Discrete mathematics; Graph","score_opus":0.028408068193046202,"score_gpt":0.29263988191171486,"score_spread":0.26423181371866866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572097019","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06395476,0.0070490954,0.22241293,0.0043601845,0.0053016506,0.0010694604,0.101062596,0.019960392,0.5748289],"genre_scores_gemma":[0.25759056,0.008025234,0.26970586,0.0026110436,0.0012469969,0.001067108,0.12502597,0.0042245975,0.33050266],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999699,0.000050654635,0.00003120926,0.00006059682,0.000086461456,0.00007206372],"domain_scores_gemma":[0.9987771,0.00031531017,0.000115742645,0.00016091496,0.00046279267,0.00016818402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002736191,0.0013041707,0.0007670255,0.0038112083,0.0026851424,0.0017614085,0.0012741061,0.00085299613,0.10527877],"category_scores_gemma":[0.0015055994,0.0004899533,0.00079626543,0.003576224,0.0005080795,0.0032567438,0.0012624022,0.0015079661,0.048667938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005735023,0.00026711123,0.0015050464,0.0019936152,0.00007585569,0.0012779706,0.00054537196,0.0010106495,0.015633397,0.3382008,0.3688249,0.27009183],"study_design_scores_gemma":[0.000045385477,0.00017071924,0.0015613398,0.00034430105,0.00006616396,0.0014694114,0.0003587631,0.0016144116,0.007501843,0.24336478,0.74341637,0.00008652042],"about_ca_topic_score_codex":0.0010911033,"about_ca_topic_score_gemma":0.0021215614,"teacher_disagreement_score":0.10527877,"about_ca_system_score_codex":0.00078192883,"about_ca_system_score_gemma":0.0012456421,"threshold_uncertainty_score":0.35219252},"labels":[],"label_agreement":null},{"id":"W2572108386","doi":"","title":"On Indidence Energy of Tree.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Tree (set theory); Energy (signal processing); Forestry; Statistics; Combinatorics; Geography","score_opus":0.007500015027557068,"score_gpt":0.20943162718954364,"score_spread":0.20193161216198657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572108386","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.276331,0.009136705,0.3063657,0.012323276,0.0018969681,0.000052228148,0.00088456,0.00037428204,0.3926352],"genre_scores_gemma":[0.9067537,0.0025786688,0.026497941,0.0017966669,0.00084278104,0.00012045629,0.00054361153,0.00047727444,0.060388856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933064,0.00020443657,0.000023617993,0.000117348456,0.00019463748,0.00012940711],"domain_scores_gemma":[0.9972422,0.0016512335,0.00016993872,0.00036301752,0.00030006055,0.0002735649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008744947,0.00048704914,0.0009047739,0.0019578778,0.0017602703,0.0022189894,0.0021052072,0.0023753028,0.022909524],"category_scores_gemma":[0.007401494,0.00037222868,0.00054561405,0.0014813732,0.0023862387,0.007176528,0.0026572188,0.0030472511,0.0025290223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002078659,0.000012816484,0.00023856034,0.000040962517,0.000005987062,0.000040254792,0.00008637875,0.0015004388,0.00034494838,0.9888548,0.0032134473,0.0056405663],"study_design_scores_gemma":[0.0000038897656,0.0000068806607,0.00017994356,0.000019946781,0.0000038140647,0.00007399122,0.0000693473,0.009205337,0.00017722779,0.9872242,0.0030305288,0.0000048514103],"about_ca_topic_score_codex":0.0006166538,"about_ca_topic_score_gemma":0.0008855146,"teacher_disagreement_score":0.022909524,"about_ca_system_score_codex":0.0011526429,"about_ca_system_score_gemma":0.00033933463,"threshold_uncertainty_score":0.07664001},"labels":[],"label_agreement":null},{"id":"W2572121591","doi":"","title":"Neighbor sum distinguishing total choosability of a kind of sparse graph.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dense graph; Combinatorics; Graph; Line graph; Pathwidth","score_opus":0.013701937404662743,"score_gpt":0.22629641737560138,"score_spread":0.21259447997093864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572121591","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7335905,0.00047738935,0.18522117,0.0026921332,0.00021562775,0.00010627583,0.0016637301,0.00054530543,0.075487845],"genre_scores_gemma":[0.9523276,0.0001976896,0.034461576,0.0004584804,0.00014718277,0.00007257276,0.0014687576,0.00017800016,0.010688289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915445,0.00020487243,0.00004569665,0.00023636778,0.00021331762,0.00014525303],"domain_scores_gemma":[0.9939452,0.0038722348,0.00044324002,0.0009979631,0.00027485818,0.00046642718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071851956,0.00036575456,0.0007247833,0.00082643126,0.0012109654,0.002213595,0.0014297428,0.0012428997,0.009171888],"category_scores_gemma":[0.0050454885,0.00046805848,0.0007660383,0.0012606899,0.0015701058,0.00410152,0.0018330225,0.0021634158,0.00052461907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003041386,0.00010473247,0.002393872,0.0002064541,0.000040925286,0.00019698917,0.000344817,0.010619801,0.0060903705,0.94710004,0.008616993,0.023980727],"study_design_scores_gemma":[0.00006809963,0.000055227447,0.0015585336,0.000023842424,0.00004818149,0.0004139689,0.00018228717,0.048248064,0.0032869948,0.9415037,0.0045856875,0.000025529764],"about_ca_topic_score_codex":0.0012196585,"about_ca_topic_score_gemma":0.0021252383,"teacher_disagreement_score":0.009171888,"about_ca_system_score_codex":0.0011009135,"about_ca_system_score_gemma":0.0005381969,"threshold_uncertainty_score":0.030682981},"labels":[],"label_agreement":null},{"id":"W2572140781","doi":"","title":"On group choosability of graphs, I.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Group (periodic table); Combinatorics; Physics","score_opus":0.005379754511129551,"score_gpt":0.18656325268210305,"score_spread":0.1811834981709735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572140781","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23403732,0.008520205,0.40717947,0.009561123,0.0016808136,0.00018269462,0.00091181946,0.0004227853,0.3375038],"genre_scores_gemma":[0.8944763,0.005565875,0.042630553,0.0018560091,0.0017870868,0.00023062453,0.0009067167,0.00024810943,0.05229866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991854,0.00024112638,0.000039369483,0.0001779035,0.00019218148,0.00016406612],"domain_scores_gemma":[0.9965508,0.0023760335,0.00021741955,0.00047467314,0.00017980541,0.00020124674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081750855,0.0005195024,0.00071989786,0.0012889643,0.0011243921,0.001967871,0.0010930841,0.0013996296,0.012547148],"category_scores_gemma":[0.0050901184,0.00039651716,0.00092472875,0.0015447248,0.0035663059,0.005309188,0.001983035,0.0025856749,0.0013364225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004406327,0.000032749664,0.00039680343,0.000110035704,0.0000137942725,0.00008204115,0.00018925052,0.0038022902,0.00093283865,0.97812,0.0057084253,0.0105674835],"study_design_scores_gemma":[0.000011884447,0.000022261422,0.00041751773,0.000030293755,0.000009823104,0.000090311165,0.00012313937,0.009195707,0.00043427685,0.9837482,0.005906793,0.0000096996555],"about_ca_topic_score_codex":0.0014111593,"about_ca_topic_score_gemma":0.0013832394,"teacher_disagreement_score":0.012547148,"about_ca_system_score_codex":0.0015772178,"about_ca_system_score_gemma":0.0006138181,"threshold_uncertainty_score":0.041974366},"labels":[],"label_agreement":null},{"id":"W2572198690","doi":"","title":"Cayley Graphs Isomorphic To The Product Of Two Cayley Graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cayley graph; Mathematics; Combinatorics; Vertex-transitive graph; Cayley's theorem; Graph product; Indifference graph; Chordal graph; Discrete mathematics; 1-planar graph; Graph; Line graph; Voltage graph","score_opus":0.009701600424847185,"score_gpt":0.23588011871223694,"score_spread":0.22617851828738975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572198690","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15407516,0.0011945508,0.69917476,0.0016117081,0.00057834433,0.00031215439,0.0022428718,0.002471863,0.13833861],"genre_scores_gemma":[0.6262183,0.0012229303,0.30004975,0.0010318633,0.00028234304,0.000292313,0.0060965894,0.0006213256,0.06418452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994301,0.00015996545,0.0000309863,0.00018275666,0.00012405044,0.0000720754],"domain_scores_gemma":[0.9979766,0.00092956045,0.00022895052,0.00042447157,0.00026091994,0.00017961091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005030154,0.0005427894,0.00044047923,0.0011294784,0.00096589944,0.0022554486,0.001331417,0.00074002414,0.01985084],"category_scores_gemma":[0.004049889,0.0004317723,0.00076996186,0.0012512369,0.00081379106,0.00332658,0.0011441365,0.001342305,0.0030382844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012032461,0.00011430869,0.00087635155,0.00018952043,0.00007337514,0.000249085,0.00016329599,0.013066445,0.0063925465,0.8932613,0.018201068,0.06729246],"study_design_scores_gemma":[0.000056016663,0.00006437587,0.00067397265,0.00004247359,0.000058942933,0.00037242283,0.00016421561,0.051771887,0.004870332,0.90773463,0.034160413,0.00003032323],"about_ca_topic_score_codex":0.0017244074,"about_ca_topic_score_gemma":0.0035499022,"teacher_disagreement_score":0.01985084,"about_ca_system_score_codex":0.0008140283,"about_ca_system_score_gemma":0.000986238,"threshold_uncertainty_score":0.06640768},"labels":[],"label_agreement":null},{"id":"W2572211324","doi":"","title":"Flag-transitive symmetric (v, k, λ) designs admitting primitive automorphism groups with socle PSL(12, 2).","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"PSL; Socle; Mathematics; Flag (linear algebra); Combinatorics; Transitive relation; Automorphism; Inner automorphism; Automorphism group; Pure mathematics; Algebra over a field; Inversion (geology)","score_opus":0.010808875956459124,"score_gpt":0.1895865507763271,"score_spread":0.17877767481986798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572211324","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7345308,0.00029294044,0.13840453,0.00039087507,0.00025154665,0.00012966157,0.0007819377,0.00095092185,0.124266714],"genre_scores_gemma":[0.97603625,0.00006931912,0.012296909,0.00008986985,0.000027129117,0.00003889222,0.000246533,0.0000659373,0.011129246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928194,0.00014926048,0.00004905724,0.000107151165,0.00018023353,0.00023235324],"domain_scores_gemma":[0.9988581,0.0002531765,0.0002667457,0.0002469094,0.00017781131,0.00019732604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052165246,0.00040654966,0.00032089307,0.00081198115,0.0010589684,0.0021903329,0.00054493634,0.00077066803,0.009093838],"category_scores_gemma":[0.0016770255,0.0003608003,0.00040409665,0.00049806497,0.00110263,0.0015267375,0.0012693022,0.0005889761,0.0015755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033745792,0.000060803544,0.0011067258,0.000074721116,0.000019820134,0.0003899224,0.00031900458,0.0027118868,0.010301656,0.9671829,0.0029763153,0.014518897],"study_design_scores_gemma":[0.00014727647,0.000254224,0.0010084797,0.000070314796,0.000040483694,0.00072462915,0.00036995707,0.02136757,0.015298805,0.9429688,0.017684925,0.00006444066],"about_ca_topic_score_codex":0.00091029244,"about_ca_topic_score_gemma":0.0019724325,"teacher_disagreement_score":0.009093838,"about_ca_system_score_codex":0.0008686512,"about_ca_system_score_gemma":0.00083945674,"threshold_uncertainty_score":0.030421972},"labels":[],"label_agreement":null},{"id":"W2572263450","doi":"","title":"Proper Nearly Perfect Sets in Graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.0118478565487645,"score_gpt":0.22182307653534625,"score_spread":0.20997521998658175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572263450","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4298671,0.007002565,0.3626693,0.011328593,0.00051754166,0.00016455473,0.004692053,0.0010923586,0.18266593],"genre_scores_gemma":[0.9305421,0.0018459377,0.048299138,0.0008847199,0.0002865224,0.00012213174,0.001449885,0.00015215203,0.01641747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985037,0.0005465963,0.000098938006,0.00035511164,0.00028190808,0.00021381657],"domain_scores_gemma":[0.99411833,0.003733294,0.00055810704,0.00090617966,0.0002662383,0.00041785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012245651,0.00045652452,0.00085706037,0.0014390943,0.002010409,0.0037849487,0.0010958993,0.0013914886,0.008828225],"category_scores_gemma":[0.0063301213,0.0007086874,0.0006680119,0.002502212,0.0027138921,0.008375541,0.0024316518,0.002032626,0.0011408948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053880005,0.000022738035,0.0006613978,0.00010854882,0.000013722306,0.00003375924,0.0001669374,0.0027085182,0.00060312514,0.9785718,0.00491343,0.012142147],"study_design_scores_gemma":[0.000011766623,0.000009132074,0.00040258377,0.000028991268,0.000011360173,0.00011313592,0.00014070689,0.0055199126,0.00057167123,0.9876516,0.0055296286,0.000009499713],"about_ca_topic_score_codex":0.0014525944,"about_ca_topic_score_gemma":0.0020982698,"teacher_disagreement_score":0.008828225,"about_ca_system_score_codex":0.0019863208,"about_ca_system_score_gemma":0.00082666083,"threshold_uncertainty_score":0.029533327},"labels":[],"label_agreement":null},{"id":"W2572305786","doi":"","title":"Automorphisms of the alternating group network.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Automorphism; Mathematics; Alternating group; Group (periodic table); Automorphisms of the symmetric and alternating groups; Combinatorics; Physics","score_opus":0.00943424816887263,"score_gpt":0.2137869660394778,"score_spread":0.20435271787060516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572305786","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39851013,0.001344313,0.36389664,0.0017998866,0.000773678,0.00014381952,0.0009481471,0.00078321603,0.23180012],"genre_scores_gemma":[0.93235636,0.0007587343,0.026417017,0.00024096709,0.0002984789,0.00016891838,0.0005432341,0.00012673091,0.039089594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999624,0.00012998395,0.000024262567,0.00008944476,0.00006878627,0.00006343109],"domain_scores_gemma":[0.99890983,0.00044940968,0.00018850673,0.00018156355,0.00012627545,0.00014445625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031871523,0.00031097437,0.00031119265,0.0010109276,0.00072060036,0.0013864653,0.00048873544,0.00070468837,0.009528073],"category_scores_gemma":[0.0021104168,0.00020910529,0.0005587198,0.0004626629,0.0012511415,0.0017859924,0.001043908,0.00072738883,0.0015726637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031798605,0.000010412039,0.00024084146,0.00002212634,0.000007856564,0.000077249584,0.00009180301,0.0037976378,0.0015715188,0.98567516,0.001253793,0.007219813],"study_design_scores_gemma":[0.000014531441,0.00001557048,0.00022071785,0.000011835133,0.0000064143514,0.00013236183,0.000042874864,0.018656433,0.0007514106,0.9729762,0.007162401,0.000009294438],"about_ca_topic_score_codex":0.00076188135,"about_ca_topic_score_gemma":0.0008289266,"teacher_disagreement_score":0.009528073,"about_ca_system_score_codex":0.000645132,"about_ca_system_score_gemma":0.00035666925,"threshold_uncertainty_score":0.031874597},"labels":[],"label_agreement":null},{"id":"W2572325465","doi":"","title":"Differential in Cartesian Product Graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Mathematics; Differential (mechanical device); Product (mathematics); Pure mathematics; Combinatorics; Geometry; Physics","score_opus":0.009419862491526156,"score_gpt":0.21252056685025433,"score_spread":0.20310070435872818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572325465","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38588905,0.0036924784,0.33808023,0.006757566,0.0006255197,0.000085324995,0.0015779029,0.0007892175,0.26250276],"genre_scores_gemma":[0.907426,0.0013327659,0.046626072,0.0007522107,0.00029611666,0.000079652295,0.00093440246,0.00020256997,0.04235026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992798,0.00019034345,0.00003866287,0.0002144142,0.0001515313,0.00012527763],"domain_scores_gemma":[0.9980544,0.0010433735,0.00017619855,0.00029251026,0.0002248929,0.00020865092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007433716,0.00033596117,0.0005788981,0.0012585033,0.0015151182,0.0022073416,0.00080477813,0.000760347,0.0098092705],"category_scores_gemma":[0.0030121899,0.00039266076,0.0005036079,0.0016247907,0.002372975,0.005700861,0.002099774,0.0017804769,0.0011598819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002004762,0.000012037758,0.00035460593,0.000042692704,0.000003772797,0.000032041655,0.00014261197,0.0005873803,0.0003385883,0.9862104,0.0030835695,0.009172335],"study_design_scores_gemma":[0.000007392105,0.0000074092554,0.00027057214,0.00001701851,0.0000069502826,0.0001558156,0.00012413262,0.0034988853,0.0005660267,0.9843311,0.011008698,0.0000060558395],"about_ca_topic_score_codex":0.0014202786,"about_ca_topic_score_gemma":0.0017689216,"teacher_disagreement_score":0.0098092705,"about_ca_system_score_codex":0.0016208012,"about_ca_system_score_gemma":0.0005047654,"threshold_uncertainty_score":0.032815337},"labels":[],"label_agreement":null},{"id":"W2572358194","doi":"","title":"The maximal (signless Laplacian) spectral radius of connected graphs with given matching number.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; Combinatorics; Matching (statistics); Discrete mathematics; Statistics; Physics; Eigenvalues and eigenvectors","score_opus":0.013732656318069084,"score_gpt":0.255352390205756,"score_spread":0.24161973388768693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572358194","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8010826,0.0013817111,0.10974722,0.002206259,0.00028419791,0.000051754236,0.0011338007,0.00084411976,0.08326826],"genre_scores_gemma":[0.9861624,0.0003341433,0.009072311,0.00012550714,0.00013062682,0.00004097518,0.00026611047,0.00008763149,0.003780265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999537,0.00016427904,0.000020538788,0.00011461046,0.00008987286,0.00007386313],"domain_scores_gemma":[0.99712855,0.0013803468,0.00049532496,0.00019779477,0.00027637742,0.0005216906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006464216,0.00047587877,0.0005177739,0.0020539137,0.0007583151,0.0019154031,0.0012039124,0.0010735594,0.0057302658],"category_scores_gemma":[0.0071288096,0.00024944622,0.00021151455,0.0008931651,0.001647169,0.0025242032,0.0012048859,0.0006006406,0.0011947738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036982977,0.000061363135,0.0020138547,0.0002691181,0.00003761255,0.0001877821,0.0003299745,0.012163495,0.012171942,0.9423028,0.009833601,0.020258604],"study_design_scores_gemma":[0.000042680924,0.00005444665,0.0022767782,0.0000633322,0.000036288246,0.00067767024,0.0003600513,0.0818261,0.0059598344,0.9034571,0.005210686,0.00003500867],"about_ca_topic_score_codex":0.0003717705,"about_ca_topic_score_gemma":0.00037986352,"teacher_disagreement_score":0.0057302658,"about_ca_system_score_codex":0.00066306384,"about_ca_system_score_gemma":0.00033370606,"threshold_uncertainty_score":0.019169688},"labels":[],"label_agreement":null},{"id":"W2572372762","doi":"","title":"Some indices of graphs with more than one cut-edge.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Artificial intelligence; Computer science","score_opus":0.022409743689004853,"score_gpt":0.26996969887154476,"score_spread":0.2475599551825399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572372762","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19918844,0.0035603072,0.32974696,0.0030679023,0.0021611063,0.00022191912,0.004971061,0.001554073,0.45552817],"genre_scores_gemma":[0.6993497,0.002544187,0.21561794,0.0020181339,0.0009372939,0.0004596919,0.004794985,0.0012090645,0.073069],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926037,0.00017845877,0.00005844831,0.00018087364,0.00016901921,0.0001528188],"domain_scores_gemma":[0.99749374,0.0007832882,0.00045398032,0.00039593884,0.0005220963,0.00035087572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008471173,0.0009124867,0.00074127805,0.0031566385,0.0023684946,0.003325597,0.0016907759,0.0012154978,0.009811864],"category_scores_gemma":[0.0032195447,0.0005459881,0.0009092383,0.0022254547,0.00198493,0.0043926598,0.001686872,0.0029921276,0.0032249452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066638604,0.000026243797,0.0005480637,0.00007573665,0.000014849892,0.0002009964,0.00024922917,0.00041754774,0.0020251225,0.9754532,0.009495131,0.0114271175],"study_design_scores_gemma":[0.000015921429,0.000017560686,0.00067026255,0.0000633061,0.00002814992,0.00044273754,0.00019693018,0.004849771,0.0016237178,0.9615625,0.03050949,0.000019689254],"about_ca_topic_score_codex":0.0013032808,"about_ca_topic_score_gemma":0.0019186245,"teacher_disagreement_score":0.009811864,"about_ca_system_score_codex":0.0012983313,"about_ca_system_score_gemma":0.0008305835,"threshold_uncertainty_score":0.03282398},"labels":[],"label_agreement":null},{"id":"W2572376896","doi":"","title":"Local restricted edge connectivity and restricted edge connectivity of graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Enhanced Data Rates for GSM Evolution; Mathematics; Combinatorics; Computer science; Artificial intelligence","score_opus":0.013780292265750707,"score_gpt":0.22864974239254776,"score_spread":0.21486945012679706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572376896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41969565,0.004201612,0.42221504,0.0024907868,0.00029391047,0.00012632304,0.0014812986,0.00074894726,0.14874637],"genre_scores_gemma":[0.9679684,0.001307136,0.015688227,0.00030060313,0.0003245345,0.00013714608,0.0008066179,0.00010308745,0.013364167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938214,0.00018984968,0.00003247292,0.00016926952,0.00012729724,0.000098895754],"domain_scores_gemma":[0.9967878,0.0015910167,0.0004884548,0.0005402378,0.00029491988,0.00029757983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040317472,0.00037575923,0.00047848467,0.0013835363,0.00063178217,0.0013103741,0.0009563158,0.0007732854,0.008373775],"category_scores_gemma":[0.0047726263,0.0002705978,0.0003546699,0.0013395924,0.0016740272,0.0038500673,0.0013807465,0.0012087327,0.0009357402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097559205,0.000034823643,0.0014508768,0.00018485663,0.000035071276,0.00041347992,0.00028999607,0.011383404,0.0031181292,0.9510153,0.006561444,0.025415115],"study_design_scores_gemma":[0.000026709604,0.000051947314,0.0017060857,0.000047262543,0.0000442937,0.00087537797,0.00022073684,0.031592567,0.0014978922,0.95168906,0.012226916,0.0000211615],"about_ca_topic_score_codex":0.00064400473,"about_ca_topic_score_gemma":0.0008088755,"teacher_disagreement_score":0.008373775,"about_ca_system_score_codex":0.00041770106,"about_ca_system_score_gemma":0.00022072038,"threshold_uncertainty_score":0.02801305},"labels":[],"label_agreement":null},{"id":"W2572419657","doi":"","title":"On the page number of triple-loop networks with even cardinality.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cardinality (data modeling); Mathematics; Loop (graph theory); Combinatorics; Arithmetic; Computer science; Database","score_opus":0.012553497245683188,"score_gpt":0.2294478018817198,"score_spread":0.2168943046360366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572419657","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57351834,0.0035793155,0.18217999,0.0043653734,0.0011222834,0.000083555664,0.002191634,0.0011972947,0.2317622],"genre_scores_gemma":[0.9556645,0.0013322417,0.01872629,0.00044131264,0.0004953453,0.00012518629,0.00069340284,0.00027108454,0.022250678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993406,0.00019433041,0.000038719987,0.000115295625,0.0001610042,0.00015015845],"domain_scores_gemma":[0.99361914,0.003921324,0.0008115097,0.00055411074,0.00047653247,0.00061740674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006702907,0.0004230302,0.0006201415,0.002148198,0.0011524057,0.0029364298,0.0008614246,0.00089377695,0.014281115],"category_scores_gemma":[0.0076665026,0.0003774531,0.00034292156,0.0011432307,0.0016673394,0.0052465433,0.0012769343,0.00125564,0.002018253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002608925,0.000044827193,0.0012119438,0.00020595864,0.000025397703,0.00023119128,0.00022629839,0.009698375,0.0032903012,0.94567806,0.012283209,0.02684341],"study_design_scores_gemma":[0.00002256854,0.00003383606,0.0007170116,0.00006363895,0.000017424454,0.00032450058,0.00007477719,0.025968727,0.0015545102,0.9634366,0.007763728,0.000022612145],"about_ca_topic_score_codex":0.00035793692,"about_ca_topic_score_gemma":0.0006299282,"teacher_disagreement_score":0.014281115,"about_ca_system_score_codex":0.00076503784,"about_ca_system_score_gemma":0.0004914775,"threshold_uncertainty_score":0.04777509},"labels":[],"label_agreement":null},{"id":"W2572445898","doi":"","title":"On independent domination critical graphs and k-factor critical.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Factor (programming language); Combinatorics; Discrete mathematics; Computer science","score_opus":0.017014493474890476,"score_gpt":0.3097578847512327,"score_spread":0.29274339127634225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572445898","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42823464,0.0076739904,0.17330633,0.005196056,0.0006397853,0.0001464391,0.0009720572,0.00052731123,0.38330334],"genre_scores_gemma":[0.95176667,0.0025643653,0.013501933,0.0006834401,0.0005099239,0.00006870514,0.0005227139,0.00014954779,0.030232782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996164,0.00009198547,0.000014715907,0.0000845854,0.00008211154,0.00011021226],"domain_scores_gemma":[0.9973902,0.0015231126,0.0002652619,0.00020025979,0.00028355097,0.00033758295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004993863,0.00059342105,0.0005317017,0.0029818097,0.0017698574,0.0016016694,0.00075269875,0.0008867486,0.010741084],"category_scores_gemma":[0.003803336,0.00039604795,0.0005170908,0.0019829888,0.0030572265,0.0043146387,0.0015225122,0.0015957381,0.0012598387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047795937,0.00001818338,0.0005764202,0.00008335418,0.000012043126,0.00016789965,0.00032818338,0.0017648502,0.00097063434,0.982797,0.005273643,0.007959934],"study_design_scores_gemma":[0.0000108854865,0.000007372523,0.00032679515,0.000030050978,0.000009973569,0.00019056449,0.0001643328,0.0029080638,0.00034257278,0.990818,0.005183013,0.000008483554],"about_ca_topic_score_codex":0.0020638176,"about_ca_topic_score_gemma":0.0023855395,"teacher_disagreement_score":0.010741084,"about_ca_system_score_codex":0.0015403528,"about_ca_system_score_gemma":0.00049638667,"threshold_uncertainty_score":0.03593248},"labels":[],"label_agreement":null},{"id":"W2572460349","doi":"","title":"Packing and covering λ-fold complete symmetric digraphs with 6-circuits.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fold (higher-order function); Mathematics; Combinatorics; Electronic circuit; Computer science; Engineering; Electrical engineering","score_opus":0.008648952972416793,"score_gpt":0.17544454032885357,"score_spread":0.16679558735643676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572460349","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5716364,0.0016962127,0.2294112,0.0012409491,0.00027259928,0.00010831221,0.001389972,0.00057084794,0.19367349],"genre_scores_gemma":[0.93004954,0.0007897401,0.033436548,0.00031137172,0.00011830663,0.00008967899,0.0011639784,0.00011906341,0.0339218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995048,0.00011953779,0.000027756669,0.00010204698,0.000108025844,0.00013771949],"domain_scores_gemma":[0.99893576,0.0005022202,0.0001493329,0.00020714954,0.00007626174,0.00012935301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024876412,0.00045417587,0.0004584929,0.0008728178,0.0010381532,0.0017705584,0.0006989311,0.00082921574,0.010437686],"category_scores_gemma":[0.0018779929,0.00041866754,0.0005687591,0.0011148067,0.00079525687,0.0023714697,0.0012954454,0.0009457489,0.001418726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012521482,0.000070201786,0.00096451584,0.00014369881,0.00003323522,0.00041404582,0.00035478955,0.014594505,0.0037169699,0.9407837,0.00767657,0.031122621],"study_design_scores_gemma":[0.000029412093,0.00003855884,0.0012016263,0.00005379538,0.000026128215,0.0006067917,0.00027870943,0.044449747,0.003480901,0.934883,0.014932007,0.000019337176],"about_ca_topic_score_codex":0.0013377985,"about_ca_topic_score_gemma":0.0015473062,"teacher_disagreement_score":0.010437686,"about_ca_system_score_codex":0.0009422662,"about_ca_system_score_gemma":0.00042520592,"threshold_uncertainty_score":0.034917593},"labels":[],"label_agreement":null},{"id":"W2572495211","doi":"","title":"On Connected m-K 2 -Residual Graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Residual; Combinatorics; Statistics; Algorithm","score_opus":0.010757773198907937,"score_gpt":0.21862394440773636,"score_spread":0.20786617120882842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572495211","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55978954,0.002277835,0.22362997,0.0060289055,0.00036176498,0.0001737021,0.0040493063,0.0013886663,0.20230033],"genre_scores_gemma":[0.8905574,0.0010112611,0.06604488,0.0009868675,0.00021687595,0.00014611162,0.0033013276,0.00033872877,0.037396524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922657,0.00022931381,0.00004000572,0.00018884728,0.0001161975,0.00019905277],"domain_scores_gemma":[0.9974841,0.0013007626,0.00038231668,0.0003984893,0.00016545545,0.0002689808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062306074,0.0006240814,0.0006564476,0.0013767778,0.0016985008,0.0025221547,0.0016688965,0.0014771038,0.013635123],"category_scores_gemma":[0.0029741093,0.00044683216,0.0006474899,0.0014128657,0.0020095883,0.0043742093,0.0023235418,0.0018512398,0.0026232083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021375739,0.00009133781,0.0013187723,0.0003171355,0.000028389897,0.00015873017,0.00036038604,0.008431261,0.0029761908,0.93991446,0.016837182,0.029352386],"study_design_scores_gemma":[0.000044234373,0.000032986474,0.0009840761,0.0000702562,0.000023847047,0.00028663204,0.000351902,0.020436645,0.001845535,0.9632072,0.012693797,0.000022879174],"about_ca_topic_score_codex":0.0018281848,"about_ca_topic_score_gemma":0.0029639248,"teacher_disagreement_score":0.013635123,"about_ca_system_score_codex":0.0011946304,"about_ca_system_score_gemma":0.00052759534,"threshold_uncertainty_score":0.045614064},"labels":[],"label_agreement":null},{"id":"W2572520128","doi":"","title":"A note on hyper-Wiener index.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Algebraic and Geometric Analysis","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Wiener index; Statistics; Combinatorics; Computer science","score_opus":0.021550603624879847,"score_gpt":0.2760899124293159,"score_spread":0.25453930880443604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572520128","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03606715,0.03737401,0.14043847,0.025061285,0.017216198,0.00004665889,0.00082133437,0.0004970194,0.7424779],"genre_scores_gemma":[0.666207,0.035500012,0.084775835,0.009519422,0.019542368,0.00016327962,0.00073614606,0.0009817288,0.18257423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916565,0.00021046211,0.000049740895,0.00013873719,0.00035491254,0.000080473925],"domain_scores_gemma":[0.9980654,0.0009623726,0.0001584792,0.0003061142,0.00027271186,0.00023490854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013698753,0.00070575054,0.00084233365,0.002664665,0.0014648743,0.0032257224,0.0012188792,0.0010014982,0.0149956485],"category_scores_gemma":[0.005026065,0.00026064526,0.0005807658,0.002129897,0.003398017,0.0075224405,0.0035426333,0.003991435,0.0036840425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010647356,0.000006502431,0.00012742128,0.00004043715,0.0000057838784,0.00006673817,0.00008319231,0.00012775566,0.0003497447,0.9837008,0.0086963745,0.0067845993],"study_design_scores_gemma":[0.0000027956453,0.000008210388,0.00024109648,0.00002201165,0.0000051911816,0.00011073691,0.00004000456,0.00059183536,0.00024041065,0.96708506,0.031643957,0.000008704976],"about_ca_topic_score_codex":0.0008213143,"about_ca_topic_score_gemma":0.001269619,"teacher_disagreement_score":0.0149956485,"about_ca_system_score_codex":0.0009941837,"about_ca_system_score_gemma":0.00055776496,"threshold_uncertainty_score":0.050165415},"labels":[],"label_agreement":null},{"id":"W2572531223","doi":"","title":"A Note On Derivations In Subtraction Algebras.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Subtraction; Arithmetic; Pure mathematics; Algebra over a field","score_opus":0.03137198689954176,"score_gpt":0.3172143618721461,"score_spread":0.28584237497260434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572531223","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010827458,0.05356224,0.13525987,0.051502626,0.03441069,0.00007091671,0.000507962,0.0007501352,0.7131082],"genre_scores_gemma":[0.41119245,0.07782301,0.16310781,0.03864516,0.02980792,0.00018659724,0.00084958033,0.0012930989,0.27709433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919456,0.00029548595,0.000052539926,0.00011369954,0.00026364462,0.000080139194],"domain_scores_gemma":[0.9983229,0.0010425525,0.000054585533,0.0001875411,0.00026691696,0.00012537367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016697429,0.0007468965,0.00075991056,0.001359722,0.0019831897,0.001958983,0.0013624337,0.0013308486,0.01466393],"category_scores_gemma":[0.0039745835,0.0003436445,0.00094059476,0.001588594,0.0036265394,0.007832258,0.002594127,0.0050538853,0.0062173344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024376433,0.000015848575,0.00010798295,0.00012369604,0.00001065032,0.0002291751,0.00021477473,0.0002190672,0.0007648881,0.95134014,0.03309078,0.013858611],"study_design_scores_gemma":[0.0000054068187,0.000014635405,0.0001896293,0.00004304088,0.000007845161,0.00020669142,0.000054980657,0.00029781027,0.0003701854,0.8905047,0.10829257,0.000012457945],"about_ca_topic_score_codex":0.001474739,"about_ca_topic_score_gemma":0.0036364512,"teacher_disagreement_score":0.01466393,"about_ca_system_score_codex":0.0009827493,"about_ca_system_score_gemma":0.0011198343,"threshold_uncertainty_score":0.049055755},"labels":[],"label_agreement":null},{"id":"W2572578888","doi":"","title":"Probability Of Mutually Commuting Two Finite Subsets Of A Finite Group.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Group (periodic table); Finite group; Pure mathematics; Physics","score_opus":0.03775758239761942,"score_gpt":0.28125427524910174,"score_spread":0.24349669285148232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572578888","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7232598,0.0008647056,0.20823827,0.0039360845,0.0003069221,0.000130807,0.00084835966,0.0003501335,0.062064998],"genre_scores_gemma":[0.9856389,0.00027624867,0.0073994636,0.00014097511,0.00024908935,0.00013319982,0.0002495732,0.000045820678,0.005866644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99682534,0.0012660067,0.00017874212,0.0005626476,0.0007035021,0.00046386127],"domain_scores_gemma":[0.9781626,0.014643675,0.002408667,0.002193133,0.0008811769,0.0017107475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035869428,0.00041061145,0.00088709046,0.0023979878,0.0017244288,0.0032314095,0.0014203179,0.0015064325,0.009150594],"category_scores_gemma":[0.019079775,0.0006096866,0.0008354397,0.0011762186,0.0051256134,0.0066861627,0.0030806796,0.0020358728,0.00072050455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009027505,0.000039295654,0.0014597734,0.00006231809,0.000023766403,0.00017329295,0.00032878324,0.0014040692,0.0006184554,0.9910616,0.0011490798,0.0035892343],"study_design_scores_gemma":[0.000036761405,0.000041470466,0.00092322583,0.000036195026,0.000025225801,0.00040078515,0.00021028088,0.01949404,0.0010500738,0.9758364,0.0019185463,0.00002703225],"about_ca_topic_score_codex":0.00055138365,"about_ca_topic_score_gemma":0.0004643064,"teacher_disagreement_score":0.009150594,"about_ca_system_score_codex":0.0009833064,"about_ca_system_score_gemma":0.0005814487,"threshold_uncertainty_score":0.030611813},"labels":[],"label_agreement":null},{"id":"W2572611632","doi":"","title":"Two-parameters generalization of Pell numbers in graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Generalization; Combinatorics; Discrete mathematics; Mathematical analysis","score_opus":0.02380493085105344,"score_gpt":0.2857457099138408,"score_spread":0.26194077906278734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572611632","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09465413,0.0031244238,0.260633,0.004227291,0.0023259514,0.0001313888,0.0007975015,0.0012916784,0.6328145],"genre_scores_gemma":[0.84951437,0.0023907574,0.05682209,0.0012243316,0.0010767725,0.00020543947,0.0005253185,0.0005439139,0.08769695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992964,0.00018376154,0.00003752081,0.00017614261,0.00019612702,0.000110027046],"domain_scores_gemma":[0.9990459,0.0003190121,0.00012291121,0.00021078436,0.00015730497,0.00014403377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005658778,0.00085318147,0.0005561297,0.0022284184,0.0013025898,0.0033903327,0.001096509,0.0013200728,0.016009718],"category_scores_gemma":[0.0036169568,0.00037444296,0.0006793096,0.0017616333,0.0033421174,0.0070282025,0.0026607583,0.0030543385,0.003238028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008438133,0.000004655338,0.00004589609,0.00002051328,0.0000019623972,0.000035981022,0.000057229183,0.0002698026,0.00025272454,0.9931518,0.0015689869,0.004582019],"study_design_scores_gemma":[0.0000045333604,0.0000045224833,0.00005788966,0.0000109806515,0.0000030653782,0.00009853639,0.000033509332,0.0011283018,0.0002925512,0.98889714,0.009460422,0.000008515687],"about_ca_topic_score_codex":0.0010182807,"about_ca_topic_score_gemma":0.000948902,"teacher_disagreement_score":0.016009718,"about_ca_system_score_codex":0.0014546902,"about_ca_system_score_gemma":0.0006425073,"threshold_uncertainty_score":0.053557813},"labels":[],"label_agreement":null},{"id":"W2572626022","doi":"","title":"Critical Hamiltonian Connected Graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hamiltonian (control theory); Combinatorics; Pure mathematics; Mathematical optimization","score_opus":0.016508396975828617,"score_gpt":0.29168138779847747,"score_spread":0.27517299082264884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572626022","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39731675,0.004400895,0.056187894,0.0049896906,0.0009343352,0.00015889855,0.001027175,0.0004093429,0.534575],"genre_scores_gemma":[0.94858015,0.0009651061,0.005994793,0.0007085735,0.0002558061,0.000069541304,0.0005546546,0.000082234656,0.04278921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99986184,0.000033034317,0.0000041568546,0.000029076522,0.00003583305,0.000035994228],"domain_scores_gemma":[0.99928683,0.00024247503,0.00010815679,0.000063106614,0.00010374332,0.0001956538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018947497,0.0003708298,0.00025252285,0.0017471112,0.001005278,0.0009976608,0.00047500027,0.0007456949,0.017078536],"category_scores_gemma":[0.0015771165,0.00022381378,0.0001984476,0.00062942045,0.0010607126,0.0015423797,0.0011117354,0.0008946698,0.0010847067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028584524,0.0000150449405,0.0003560487,0.000067376925,0.000008648122,0.00018882798,0.00014063288,0.0005169468,0.0014024283,0.9807355,0.00955311,0.006986796],"study_design_scores_gemma":[0.000024063242,0.000010616203,0.00064858765,0.00003659722,0.000012639653,0.00036323862,0.00021741682,0.0033981376,0.00090397627,0.97997737,0.014400296,0.0000070870797],"about_ca_topic_score_codex":0.00073911034,"about_ca_topic_score_gemma":0.0014356053,"teacher_disagreement_score":0.017078536,"about_ca_system_score_codex":0.00069569476,"about_ca_system_score_gemma":0.0003091163,"threshold_uncertainty_score":0.057133436},"labels":[],"label_agreement":null},{"id":"W2572704965","doi":"","title":"On the adjacent vertex distinguishing edge chromatic number of graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Vertex (graph theory); Combinatorics; Enhanced Data Rates for GSM Evolution; Brooks' theorem; Graph; 1-planar graph; Chordal graph; Computer science; Artificial intelligence","score_opus":0.01327245613832504,"score_gpt":0.23085625598190704,"score_spread":0.217583799843582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572704965","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6615074,0.0039876592,0.15897684,0.010390202,0.000844361,0.00013705455,0.0019471394,0.00057833985,0.161631],"genre_scores_gemma":[0.95222217,0.0010300566,0.03304471,0.00060743035,0.00055117114,0.00011338594,0.00085142686,0.00019056186,0.011389026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985979,0.0005091544,0.000052269286,0.00033481148,0.00022018768,0.00028558442],"domain_scores_gemma":[0.98607177,0.010523389,0.0009977912,0.00092579424,0.00056349864,0.00091777486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022470655,0.00072425784,0.0008823549,0.003219138,0.0026285944,0.0031358553,0.0026638287,0.002159709,0.010877709],"category_scores_gemma":[0.013438051,0.0006179909,0.00057471276,0.0026721025,0.0045434,0.008117665,0.0023866564,0.003180256,0.0011014185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004520288,0.00013914632,0.004050928,0.00021175113,0.00003760577,0.000092569884,0.00032862875,0.019705754,0.002140141,0.92954016,0.015845928,0.027455376],"study_design_scores_gemma":[0.000059352224,0.000045566987,0.0020934655,0.000062175684,0.00003576751,0.00017093481,0.00028293228,0.06188975,0.0014355201,0.9284708,0.0054154033,0.00003835929],"about_ca_topic_score_codex":0.003066529,"about_ca_topic_score_gemma":0.0032432538,"teacher_disagreement_score":0.010877709,"about_ca_system_score_codex":0.0030688476,"about_ca_system_score_gemma":0.0012376156,"threshold_uncertainty_score":0.03638953},"labels":[],"label_agreement":null},{"id":"W2572723678","doi":"","title":"On Total Edge Irregularity Strength Of Graph.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Graph; Combinatorics; Computer science; Artificial intelligence","score_opus":0.009965319790610648,"score_gpt":0.21762115156549122,"score_spread":0.20765583177488056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572723678","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6783087,0.002660682,0.21435028,0.007134792,0.0005609035,0.00013653372,0.001386433,0.0004365435,0.09502504],"genre_scores_gemma":[0.9656047,0.0011006185,0.022842692,0.00055908255,0.0005177046,0.000119802964,0.0006424625,0.00018355611,0.008429376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99799573,0.00075210875,0.00010049887,0.00042043274,0.00041649825,0.0003146725],"domain_scores_gemma":[0.9765737,0.014346982,0.0022870202,0.0027819953,0.0017226306,0.002287679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029651793,0.0007418098,0.0013949575,0.003673535,0.0022193748,0.002905069,0.002296063,0.0018421138,0.009137338],"category_scores_gemma":[0.019081498,0.00068976305,0.0008076933,0.0022725188,0.0035563803,0.0081209745,0.0032415248,0.0033467682,0.001092101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018893876,0.00009006963,0.004405803,0.0002136604,0.000058573773,0.0001517552,0.000287247,0.011964764,0.0024799816,0.9500286,0.007395859,0.02273479],"study_design_scores_gemma":[0.000030299387,0.00005160051,0.001913646,0.00006183127,0.000047500183,0.0003192351,0.00025921373,0.05065471,0.0013647294,0.94103944,0.0042232974,0.00003438227],"about_ca_topic_score_codex":0.00086290785,"about_ca_topic_score_gemma":0.00078986184,"teacher_disagreement_score":0.009137338,"about_ca_system_score_codex":0.0014658121,"about_ca_system_score_gemma":0.0005622357,"threshold_uncertainty_score":0.030567408},"labels":[],"label_agreement":null},{"id":"W2572745867","doi":"","title":"On total domination number of Cartesian product of directed cycles.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Mathematics; Product (mathematics); Arithmetic; Combinatorics; Geometry","score_opus":0.009828459400459243,"score_gpt":0.2770102242897745,"score_spread":0.2671817648893153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572745867","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83115655,0.0033131503,0.09129469,0.001052775,0.00019039171,0.000089052526,0.0023918955,0.0003307236,0.07018066],"genre_scores_gemma":[0.9791535,0.0011566237,0.012603286,0.00010735656,0.00012956097,0.00010433097,0.0008711324,0.000104576226,0.0057695555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876344,0.000324193,0.00007195248,0.00031561393,0.00030239412,0.0002224948],"domain_scores_gemma":[0.98715186,0.009122368,0.00095353695,0.0009031368,0.00093139807,0.000937726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013401335,0.00051174255,0.00089685176,0.0030714672,0.001244503,0.0026281506,0.0015755667,0.0006854201,0.00986127],"category_scores_gemma":[0.009920051,0.00043840735,0.00054023246,0.0024739231,0.0016321323,0.0042969063,0.001300239,0.0011836721,0.00062198],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009258604,0.00013119714,0.019214036,0.00092627463,0.00022461322,0.0004032154,0.0012348574,0.041940387,0.010902475,0.8305256,0.01688676,0.07668475],"study_design_scores_gemma":[0.00009665617,0.0001820785,0.009088468,0.00017765892,0.00023080932,0.0012968652,0.0006060694,0.11657616,0.0069133956,0.8492071,0.0155528635,0.000071798764],"about_ca_topic_score_codex":0.0013280988,"about_ca_topic_score_gemma":0.0016457142,"teacher_disagreement_score":0.00986127,"about_ca_system_score_codex":0.0015078405,"about_ca_system_score_gemma":0.0007345176,"threshold_uncertainty_score":0.032989204},"labels":[],"label_agreement":null},{"id":"W2572788214","doi":"","title":"Duality in lpγ-spaces.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Banach Space Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Duality (order theory); Pure mathematics","score_opus":0.026837267226905197,"score_gpt":0.31059256140751795,"score_spread":0.28375529418061274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572788214","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12173203,0.012437028,0.43032905,0.0077374424,0.0015564057,0.00006893229,0.00083708944,0.00038630527,0.42491582],"genre_scores_gemma":[0.8460206,0.0051128725,0.06485954,0.0017394038,0.0012628366,0.0001549412,0.0007610249,0.00022043078,0.079868376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884003,0.00048322277,0.000061006227,0.00017043581,0.00033483197,0.0001105013],"domain_scores_gemma":[0.9985511,0.0005913359,0.00015047258,0.00014623745,0.00034618514,0.00021467016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015018607,0.00079710816,0.00064522325,0.002315667,0.0013134179,0.003484108,0.00058656215,0.0009111302,0.0076463115],"category_scores_gemma":[0.003019281,0.00032395122,0.00082666834,0.0015413786,0.002824467,0.00616734,0.003084683,0.0038856333,0.0016598634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012315835,0.000007984026,0.00008536704,0.000024488198,0.000005290734,0.000032242835,0.00009243644,0.0001718653,0.0002185538,0.99558085,0.0011176014,0.0026509564],"study_design_scores_gemma":[0.0000066131693,0.000013559007,0.000120172146,0.000016562568,0.000005727939,0.00008935752,0.00010811745,0.0015011374,0.0002381311,0.9899858,0.007910344,0.000004450305],"about_ca_topic_score_codex":0.0006920162,"about_ca_topic_score_gemma":0.0005864302,"teacher_disagreement_score":0.0076463115,"about_ca_system_score_codex":0.0012927701,"about_ca_system_score_gemma":0.00052545633,"threshold_uncertainty_score":0.025579512},"labels":[],"label_agreement":null},{"id":"W2572795963","doi":"","title":"Total Embedding distributions for two graph families obtained from the dipole D 3 .","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Embedding; Combinatorics; Graph; Dipole; Discrete mathematics; Artificial intelligence; Computer science; Physics; Quantum mechanics","score_opus":0.02090109328123276,"score_gpt":0.2972660110128225,"score_spread":0.2763649177315898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572795963","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7863673,0.0002580327,0.14309967,0.0009712992,0.00011391361,0.000038090475,0.001028156,0.00050589273,0.0676176],"genre_scores_gemma":[0.9685242,0.00016902365,0.014221136,0.00014606978,0.00003956853,0.000052623,0.00085665757,0.00025797938,0.015732786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997416,0.00007225976,0.00000898416,0.000052383875,0.00006332082,0.000061455976],"domain_scores_gemma":[0.99856585,0.0006389738,0.00012322387,0.00018575437,0.00018274618,0.00030357033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051888975,0.00031711825,0.0002503354,0.0016850213,0.001207904,0.0014651618,0.0007692571,0.0009361076,0.011391436],"category_scores_gemma":[0.0022130231,0.00028824017,0.0005184779,0.0006239429,0.0012074325,0.0012307568,0.00097029307,0.00083638873,0.0009581179],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020138666,0.00005575462,0.0014859345,0.00006589284,0.000016060943,0.00025654855,0.00036735236,0.00975569,0.0056643486,0.9648054,0.005876727,0.011448778],"study_design_scores_gemma":[0.000059412858,0.000057209574,0.0030932706,0.00004537755,0.000024988794,0.00058667024,0.0006326312,0.12565745,0.005245727,0.85659355,0.007962073,0.00004165516],"about_ca_topic_score_codex":0.0010461684,"about_ca_topic_score_gemma":0.0017085756,"teacher_disagreement_score":0.011391436,"about_ca_system_score_codex":0.00078692846,"about_ca_system_score_gemma":0.00030173475,"threshold_uncertainty_score":0.03810811},"labels":[],"label_agreement":null},{"id":"W2572870995","doi":"","title":"G-Designs Having a Prescribed Number of Blocks in Common.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arithmetic; Combinatorics","score_opus":0.011482701678432126,"score_gpt":0.22335911755899074,"score_spread":0.2118764158805586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572870995","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18926603,0.00092709175,0.6979651,0.0012469542,0.00056300283,0.00067603675,0.0019566568,0.0019090265,0.10549018],"genre_scores_gemma":[0.7235807,0.00063791,0.24999835,0.00077664293,0.0001704042,0.0008462415,0.00089598715,0.00031524597,0.02277848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99742573,0.0010552122,0.00016013501,0.00050675456,0.00036686045,0.000485253],"domain_scores_gemma":[0.99537814,0.0015924482,0.00047713687,0.0016317954,0.0006133325,0.0003071303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014541453,0.0009870036,0.0008836515,0.001046275,0.0016666616,0.002409549,0.0011675617,0.0016733682,0.011062088],"category_scores_gemma":[0.0061872173,0.00055296015,0.0006311114,0.0011417223,0.0016336878,0.0019325294,0.0015555989,0.0010577147,0.0043890304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010167769,0.000211088,0.001716478,0.0004046793,0.000120465,0.0004325408,0.00026505475,0.0154770445,0.037899267,0.8679874,0.010084002,0.06438523],"study_design_scores_gemma":[0.0004183015,0.0007777098,0.0012089333,0.00030158993,0.00018967675,0.0013638667,0.00040590914,0.0576528,0.042436946,0.81994385,0.075195566,0.00010477903],"about_ca_topic_score_codex":0.00056691514,"about_ca_topic_score_gemma":0.0011856304,"teacher_disagreement_score":0.011062088,"about_ca_system_score_codex":0.0008330636,"about_ca_system_score_gemma":0.0015680597,"threshold_uncertainty_score":0.03700638},"labels":[],"label_agreement":null},{"id":"W2572884732","doi":"","title":"Covering a Unit Hypercube with Hypercubes.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hypercube; Mathematics; Unit (ring theory); Combinatorics; Parallel computing; Computer science; Mathematics education","score_opus":0.01382006134576147,"score_gpt":0.21166670830886972,"score_spread":0.19784664696310825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572884732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31584594,0.005401285,0.51246977,0.00092318334,0.0008454391,0.0002759363,0.0015003992,0.0013993523,0.16133872],"genre_scores_gemma":[0.80221623,0.0028276718,0.1575885,0.00033944895,0.00022747442,0.00031963785,0.0013927018,0.00022336355,0.03486498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995053,0.00018325631,0.00003281684,0.00008050051,0.000097050586,0.00010106371],"domain_scores_gemma":[0.9993187,0.00023872138,0.000087569366,0.00017010348,0.000088614375,0.00009623155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026710666,0.000468343,0.00044968436,0.0010158771,0.0009205425,0.0012903186,0.0007474508,0.00059757626,0.010670638],"category_scores_gemma":[0.0016516258,0.00029616882,0.00044117932,0.0015240946,0.0005543895,0.0016350975,0.0021812422,0.0005616926,0.0019802228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000896176,0.00018358689,0.0033269029,0.0014230995,0.00020118953,0.0014347926,0.0006829386,0.16039285,0.060668424,0.4468682,0.03476601,0.2891559],"study_design_scores_gemma":[0.00010460805,0.00033164996,0.0030174504,0.0002884365,0.000098156925,0.001772449,0.000991478,0.35946468,0.04388416,0.47246653,0.11750615,0.00007431919],"about_ca_topic_score_codex":0.001075323,"about_ca_topic_score_gemma":0.0014725394,"teacher_disagreement_score":0.010670638,"about_ca_system_score_codex":0.0004166587,"about_ca_system_score_gemma":0.00036808065,"threshold_uncertainty_score":0.035696805},"labels":[],"label_agreement":null},{"id":"W2572963284","doi":"","title":"The generalized chaaracteristic polynomial of the subdivision-vertex and subdivision-edge coronae.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Subdivision; Vertex (graph theory); Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Computer science; Geography; Graph; Artificial intelligence","score_opus":0.02037178899986947,"score_gpt":0.27537342908466594,"score_spread":0.2550016400847965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572963284","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5855004,0.0027955002,0.09285215,0.0044307467,0.00095574517,0.00010108417,0.0012230085,0.0003351195,0.31180623],"genre_scores_gemma":[0.9669671,0.000601612,0.006053768,0.00025016855,0.00036113878,0.000025941112,0.00031813723,0.000067282985,0.025354935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995383,0.000082975326,0.000011941492,0.00010755043,0.00013958084,0.000119787386],"domain_scores_gemma":[0.99871135,0.00044954946,0.0001740113,0.00015947096,0.00025862682,0.00024698614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005568253,0.00050436286,0.00063189835,0.0019421412,0.0010279332,0.00222306,0.0009586507,0.00082772056,0.01321491],"category_scores_gemma":[0.004526358,0.00027097628,0.00072673615,0.0013479468,0.0025014433,0.0033412534,0.0014664857,0.0023288392,0.0016405532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011470342,0.000028820417,0.0009024966,0.00007555448,0.000016851027,0.000120557735,0.00019698883,0.0023570799,0.001768493,0.9703888,0.005478742,0.018550865],"study_design_scores_gemma":[0.000036507474,0.00004135261,0.0024104149,0.000033704087,0.000024467663,0.00045007147,0.0001257233,0.017571347,0.0011322632,0.96675295,0.011387135,0.000034131604],"about_ca_topic_score_codex":0.0032863456,"about_ca_topic_score_gemma":0.00359265,"teacher_disagreement_score":0.01321491,"about_ca_system_score_codex":0.0018487851,"about_ca_system_score_gemma":0.000851954,"threshold_uncertainty_score":0.04420829},"labels":[],"label_agreement":null},{"id":"W2572978922","doi":"","title":"On a new class of combinatorial identities.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Class (philosophy); Combinatorics; Algebra over a field; Pure mathematics; Artificial intelligence; Computer science","score_opus":0.026344882518626427,"score_gpt":0.3004359709442244,"score_spread":0.274091088425598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572978922","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050075047,0.0027549104,0.25231725,0.008904978,0.003465347,0.000102335725,0.0007165518,0.00047328492,0.68119025],"genre_scores_gemma":[0.6736216,0.0051845256,0.111145005,0.006947182,0.0059702387,0.0003519729,0.0015980981,0.0007592239,0.19442214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821633,0.00045803722,0.00009940533,0.00034604038,0.0006440455,0.00023619088],"domain_scores_gemma":[0.99701023,0.00094320276,0.00027105212,0.0008596161,0.0005113825,0.0004044321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014601967,0.0006777001,0.00085398345,0.0030923204,0.00414375,0.0055297236,0.0017689604,0.0026612545,0.018142134],"category_scores_gemma":[0.006041766,0.00044051997,0.0011512685,0.0021532306,0.006248465,0.014938325,0.0057093767,0.0057918243,0.0041023013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002605896,0.0000066648113,0.000054147884,0.000007975769,0.0000013449359,0.00003685996,0.00005906129,0.000049834485,0.000064193446,0.9957717,0.0019304281,0.0020151427],"study_design_scores_gemma":[0.0000040001114,0.000004275635,0.00007404376,0.000016334692,0.0000027539493,0.00014146014,0.0000582108,0.0007969733,0.00006648453,0.98657876,0.012251091,0.0000055688897],"about_ca_topic_score_codex":0.00092032546,"about_ca_topic_score_gemma":0.0011632517,"teacher_disagreement_score":0.018142134,"about_ca_system_score_codex":0.0013069168,"about_ca_system_score_gemma":0.000939973,"threshold_uncertainty_score":0.060691476},"labels":[],"label_agreement":null},{"id":"W2573008493","doi":"","title":"Castelnuovo-Mumford Regularity Of Graph Ideals.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Pure mathematics; Combinatorics","score_opus":0.028013186887808492,"score_gpt":0.26771566450126044,"score_spread":0.23970247761345195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573008493","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32976937,0.008283265,0.10602341,0.008544769,0.0006314139,0.0000706613,0.0012070524,0.00037552405,0.54509443],"genre_scores_gemma":[0.947138,0.0015305065,0.011839901,0.00065703905,0.00059299293,0.000053805077,0.0004964749,0.00010846724,0.037582766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994098,0.00016903659,0.000019899651,0.00011454441,0.00016015407,0.00012657841],"domain_scores_gemma":[0.99849284,0.0007097163,0.00016347635,0.00018582174,0.00023595504,0.00021228817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095264585,0.000407079,0.0008626238,0.0018044568,0.0018460046,0.0021876788,0.000948389,0.0008043185,0.008836799],"category_scores_gemma":[0.0035679466,0.00040627725,0.00086308876,0.0010637617,0.0033420508,0.00537131,0.002303243,0.002805008,0.0009090806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024601202,0.000010517715,0.00029404234,0.000027233204,0.0000060947496,0.000024454675,0.000102531114,0.0002934098,0.00020502674,0.9951733,0.0014247096,0.0024141034],"study_design_scores_gemma":[0.000015386795,0.000011387016,0.0007168348,0.000017417791,0.000011964851,0.00009112667,0.0001055761,0.0018628708,0.00028490383,0.9917543,0.0051207314,0.0000075382322],"about_ca_topic_score_codex":0.002968772,"about_ca_topic_score_gemma":0.0039441627,"teacher_disagreement_score":0.008836799,"about_ca_system_score_codex":0.001727383,"about_ca_system_score_gemma":0.0006871845,"threshold_uncertainty_score":0.029562056},"labels":[],"label_agreement":null},{"id":"W2573036527","doi":"","title":"Hyperdomination in Groups.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Philosophy, Sociology, Political Theory","field":"Social Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.026028117040681455,"score_gpt":0.3176601521291964,"score_spread":0.29163203508851493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573036527","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18229385,0.0063288203,0.33944777,0.011830335,0.0014341924,0.00018015878,0.0010859822,0.00059191114,0.45680705],"genre_scores_gemma":[0.89865315,0.0016417352,0.03269068,0.0010613379,0.0008734024,0.0002744879,0.0005512976,0.00016961052,0.06408423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966312,0.0014910459,0.0002851209,0.0006522215,0.0006348317,0.0003056303],"domain_scores_gemma":[0.9910815,0.004665569,0.0009777844,0.0014175837,0.0009822275,0.0008753384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024178547,0.00051083387,0.0009790205,0.0032261529,0.00447649,0.0074704345,0.0009872387,0.0014706488,0.0168535],"category_scores_gemma":[0.0097259125,0.0004411276,0.0009713142,0.002997321,0.007066471,0.012083229,0.00569646,0.0022039812,0.0025756618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012322343,0.0000065297404,0.00025820217,0.00002861549,0.0000044602352,0.000033401593,0.0003140815,0.000103645405,0.000068728514,0.99392915,0.00096344773,0.0042774472],"study_design_scores_gemma":[0.0000139887325,0.000006896394,0.00021236647,0.000022078038,0.0000060013213,0.00011108224,0.00027942215,0.0007772426,0.00010548596,0.9859266,0.012532731,0.000006028781],"about_ca_topic_score_codex":0.0011984616,"about_ca_topic_score_gemma":0.0013701818,"teacher_disagreement_score":0.0168535,"about_ca_system_score_codex":0.001907692,"about_ca_system_score_gemma":0.0009774766,"threshold_uncertainty_score":0.05638063},"labels":[],"label_agreement":null},{"id":"W2573057482","doi":"","title":"On the sum-connectivity spectral radius and sum-connectivity Estrada index of graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Spectral radius; Combinatorics; RADIUS; Eigenvalues and eigenvectors; Computer science; Computer network; World Wide Web; Physics","score_opus":0.020144723359750545,"score_gpt":0.25683203031813007,"score_spread":0.23668730695837953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573057482","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6007552,0.010998201,0.20231868,0.004305027,0.0005894316,0.000077854485,0.0013057428,0.00064993615,0.17899992],"genre_scores_gemma":[0.9738776,0.0023668383,0.015609438,0.0004043059,0.0006154842,0.0000930387,0.00049555354,0.0001788715,0.006358742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907,0.00038921184,0.000042639982,0.0001755485,0.00020460732,0.000117973745],"domain_scores_gemma":[0.9894756,0.007202975,0.0010096702,0.000625842,0.00067329645,0.0010125678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001426821,0.00078623137,0.0011399183,0.0042791716,0.0013836403,0.0023610191,0.0020413266,0.0012259217,0.0069555244],"category_scores_gemma":[0.01592845,0.00037924462,0.0004429002,0.0023043652,0.002843506,0.0068843025,0.002763347,0.0018606314,0.001463804],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017169809,0.00005894759,0.0021082945,0.00015823061,0.0000317001,0.00011677267,0.00031387442,0.009306007,0.0018558042,0.9608649,0.0074651632,0.017548634],"study_design_scores_gemma":[0.000018680214,0.000036031717,0.0016664799,0.000056273846,0.000036171707,0.00041039017,0.0002452768,0.043284073,0.0011580997,0.9483829,0.004677894,0.000027697599],"about_ca_topic_score_codex":0.00058869657,"about_ca_topic_score_gemma":0.0005629253,"teacher_disagreement_score":0.0069555244,"about_ca_system_score_codex":0.0008913437,"about_ca_system_score_gemma":0.00027309294,"threshold_uncertainty_score":0.02326858},"labels":[],"label_agreement":null},{"id":"W2573167916","doi":"","title":"Mobius Functions and Characteristic Polynomials of Subspace Lattices Under the Finite Classical Groups.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Subspace topology; Pure mathematics; Algebra over a field; Mathematical analysis","score_opus":0.03037610449667505,"score_gpt":0.26399833195759986,"score_spread":0.23362222746092481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573167916","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8232922,0.0017361185,0.058105398,0.0028817016,0.00033501457,0.000051541185,0.00035436798,0.000235296,0.1130084],"genre_scores_gemma":[0.9835081,0.00051253545,0.0032003617,0.000118244694,0.0002808315,0.000029904297,0.000115345945,0.000030587835,0.012204118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993274,0.00020378499,0.000024739611,0.00009670711,0.00017030089,0.00017701973],"domain_scores_gemma":[0.99828315,0.00057182554,0.00036483858,0.00012105818,0.0002190561,0.0004400105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011397488,0.0005575787,0.00054737675,0.0020541619,0.0014911417,0.0029481256,0.0007772786,0.0005070739,0.005855096],"category_scores_gemma":[0.004228607,0.0003359647,0.0004976869,0.0009526273,0.0044128066,0.0055806083,0.0019537813,0.0016582018,0.0007887629],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003521984,0.000016252405,0.00039250276,0.0000131469205,0.0000050848566,0.00003316508,0.00019487685,0.00040784085,0.00036645497,0.9951952,0.00040680094,0.0029332843],"study_design_scores_gemma":[0.000025982623,0.000028456972,0.0007766831,0.000011109191,0.000009178505,0.00014029995,0.00025100922,0.002835536,0.0006329628,0.9931155,0.0021578535,0.0000154722],"about_ca_topic_score_codex":0.0015548615,"about_ca_topic_score_gemma":0.0013738459,"teacher_disagreement_score":0.005855096,"about_ca_system_score_codex":0.0014731699,"about_ca_system_score_gemma":0.0010884476,"threshold_uncertainty_score":0.019587219},"labels":[],"label_agreement":null},{"id":"W2573172438","doi":"","title":"Implicit degree condition for hamiltonicity of graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Combinatorics; Discrete mathematics; Physics","score_opus":0.029337958254696428,"score_gpt":0.30411784511476975,"score_spread":0.2747798868600733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573172438","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4949961,0.0010370521,0.19800276,0.0043862415,0.00077712705,0.00019298523,0.0021438042,0.00047524172,0.29798862],"genre_scores_gemma":[0.97044486,0.00039190013,0.010194055,0.0003394927,0.00030510186,0.00009699191,0.00075777934,0.00009138698,0.01737836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930346,0.00013610108,0.0000432786,0.00013921813,0.00022799597,0.00014994624],"domain_scores_gemma":[0.99581015,0.0024014313,0.0003089853,0.0005156,0.0006013474,0.00036249345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005966094,0.00033771145,0.0004833153,0.000987061,0.0012096,0.0017306053,0.0010568086,0.0013728138,0.016089182],"category_scores_gemma":[0.008019569,0.00041745044,0.00044208192,0.0008294948,0.001995834,0.006141045,0.0016634713,0.002529116,0.0015925112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007923616,0.000038846625,0.0006930135,0.000077979144,0.0000071818267,0.00014458704,0.00024487893,0.001026506,0.002688307,0.986891,0.002714523,0.0053939684],"study_design_scores_gemma":[0.00005076443,0.00002526447,0.0007987748,0.00002835951,0.0000125536635,0.0002329845,0.00015188304,0.0073544458,0.0019555555,0.98414314,0.0052277907,0.000018553783],"about_ca_topic_score_codex":0.0013222301,"about_ca_topic_score_gemma":0.0024073161,"teacher_disagreement_score":0.016089182,"about_ca_system_score_codex":0.00093299244,"about_ca_system_score_gemma":0.0007903599,"threshold_uncertainty_score":0.05382365},"labels":[],"label_agreement":null},{"id":"W2573414287","doi":"","title":"A method to compute the number of regular reversible Rosenberg hypergroup.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Calculus (dental); Arithmetic; Applied mathematics; Orthodontics; Medicine","score_opus":0.02781335549837855,"score_gpt":0.3313812574499022,"score_spread":0.30356790195152367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573414287","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08067821,0.0006975165,0.8810321,0.00032443655,0.000385906,0.00029474887,0.0009769207,0.002178618,0.033431537],"genre_scores_gemma":[0.45131558,0.0005217764,0.5272676,0.0001476267,0.00022993678,0.00060927036,0.0015360903,0.00076478784,0.01760731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964726,0.00009720471,0.000021157755,0.00007853761,0.000117525204,0.0000382309],"domain_scores_gemma":[0.999119,0.00027022298,0.00008779778,0.0002227972,0.00018146065,0.000118682015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077898445,0.00065269053,0.0006574224,0.0028820154,0.00089479465,0.0011137368,0.0013941221,0.0007337393,0.0116879195],"category_scores_gemma":[0.0037894032,0.00031992045,0.00069017435,0.0010793816,0.0013310151,0.0020839353,0.0016449647,0.0012699383,0.0029884556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044346243,0.00021164471,0.0030225753,0.0005727223,0.00011319863,0.00019717975,0.0003319939,0.028308718,0.016849507,0.73554194,0.012880852,0.20152617],"study_design_scores_gemma":[0.00011019623,0.0001693831,0.0014033295,0.00007359691,0.00005433397,0.00023989438,0.00014298555,0.24352328,0.012904415,0.7250526,0.016230736,0.00009523284],"about_ca_topic_score_codex":0.0008506653,"about_ca_topic_score_gemma":0.0018756284,"teacher_disagreement_score":0.0116879195,"about_ca_system_score_codex":0.0005525995,"about_ca_system_score_gemma":0.0008058528,"threshold_uncertainty_score":0.03909993},"labels":[],"label_agreement":null},{"id":"W2573432259","doi":"","title":"On the distance and distance Laplacian spectral radius of graphs with cut edges.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; RADIUS; Combinatorics; Laplace operator; Resistance distance; Mathematical analysis; Graph; Eigenvalues and eigenvectors; Physics; Line graph; Computer science","score_opus":0.014132119586703318,"score_gpt":0.23720389303816228,"score_spread":0.22307177345145895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573432259","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5324786,0.015191453,0.32139057,0.008127497,0.0009034984,0.000091130954,0.0010280106,0.00055346615,0.120235786],"genre_scores_gemma":[0.94792295,0.0030629162,0.036630403,0.00071110687,0.0010140333,0.00012537665,0.00049039774,0.00023344698,0.009809424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985013,0.0006538034,0.00006147763,0.00026895947,0.00033773153,0.00017682886],"domain_scores_gemma":[0.98258394,0.012535574,0.0014916497,0.00088530965,0.0010875438,0.0014158803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018301831,0.0008215506,0.001051095,0.0034713089,0.001215891,0.002252068,0.002438967,0.0018928762,0.0058238595],"category_scores_gemma":[0.022154097,0.00050054,0.00050077745,0.0020875758,0.0033792946,0.006204034,0.0030488523,0.0023458013,0.0013215704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017981918,0.00008170859,0.0019856193,0.00018229349,0.00004493126,0.00012654068,0.00045953,0.014006502,0.002420852,0.94904125,0.00868237,0.022788709],"study_design_scores_gemma":[0.000022191241,0.000045504472,0.0016139301,0.000050296956,0.000026172473,0.00030510267,0.00030964974,0.049304295,0.0006810648,0.9433236,0.0042816796,0.00003648647],"about_ca_topic_score_codex":0.0010395675,"about_ca_topic_score_gemma":0.00089117466,"teacher_disagreement_score":0.0058238595,"about_ca_system_score_codex":0.0013994663,"about_ca_system_score_gemma":0.0003974428,"threshold_uncertainty_score":0.019482732},"labels":[],"label_agreement":null},{"id":"W2573503267","doi":"","title":"Total Domination in generalized θ graphs and ladder graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chordal graph; Combinatorics; Indifference graph; Graph","score_opus":0.012360631949996733,"score_gpt":0.2662108344896399,"score_spread":0.25385020253964313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573503267","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72759736,0.0016379909,0.1288928,0.0015881662,0.00011690625,0.00005726705,0.0005728658,0.00038987707,0.13914679],"genre_scores_gemma":[0.97391033,0.0006475768,0.0068582245,0.0002266418,0.000058710186,0.000044573633,0.00023865546,0.000066460394,0.017948778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946517,0.0001609535,0.00002207675,0.00009903733,0.00011440097,0.00013838506],"domain_scores_gemma":[0.9966754,0.0019093415,0.00041142604,0.00034378358,0.0003041919,0.00035590254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006202579,0.00029244152,0.00037306335,0.001239349,0.001122716,0.0020435718,0.0007717424,0.0005129627,0.0075359666],"category_scores_gemma":[0.003590029,0.00033272797,0.00047025565,0.0014195924,0.0014921728,0.0030336226,0.0012147931,0.0008796481,0.0005610676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056858455,0.000018770968,0.0017411741,0.00008815291,0.00002551109,0.00020215924,0.00050330773,0.0027151962,0.001967358,0.9763579,0.0028042444,0.01351943],"study_design_scores_gemma":[0.000022040547,0.000011794846,0.0010725348,0.000031687367,0.000028848732,0.0003515068,0.0003328101,0.010096564,0.00089901633,0.98140955,0.005731716,0.000011869839],"about_ca_topic_score_codex":0.0021507312,"about_ca_topic_score_gemma":0.0034793762,"teacher_disagreement_score":0.0075359666,"about_ca_system_score_codex":0.000960751,"about_ca_system_score_gemma":0.0004972803,"threshold_uncertainty_score":0.025210321},"labels":[],"label_agreement":null},{"id":"W2573525493","doi":"","title":"Upper bound on the diameter of a total domination vertex critical graph.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Upper and lower bounds; Graph; Mathematical analysis","score_opus":0.016297136367318665,"score_gpt":0.28457141688818155,"score_spread":0.2682742805208629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573525493","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35133684,0.017672433,0.29930395,0.009125399,0.0014743911,0.00028497644,0.0059371283,0.0024067096,0.31245822],"genre_scores_gemma":[0.9200442,0.0052174595,0.049664546,0.0011683746,0.001125526,0.0002883448,0.0019632182,0.000523269,0.020005042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909127,0.0001397504,0.000031974498,0.00021827691,0.00025619424,0.00026259935],"domain_scores_gemma":[0.9863063,0.009955593,0.0005380678,0.000840504,0.0009081414,0.0014513704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011838306,0.0013815094,0.0015003628,0.0032499724,0.0018534863,0.0031615666,0.002210504,0.0012699686,0.011644101],"category_scores_gemma":[0.010777356,0.00061956374,0.0008010471,0.0016847445,0.001845937,0.0035573635,0.003045237,0.002559703,0.0017461452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011056159,0.0002385675,0.0059335553,0.0014337276,0.00028191105,0.0008057115,0.0009878592,0.05534196,0.044906292,0.75923806,0.06821394,0.061512746],"study_design_scores_gemma":[0.00011235667,0.00022524962,0.006073973,0.000375883,0.00032117235,0.0018263785,0.00041875037,0.166524,0.01531904,0.75837004,0.05034265,0.00009042079],"about_ca_topic_score_codex":0.00148604,"about_ca_topic_score_gemma":0.0025275382,"teacher_disagreement_score":0.011644101,"about_ca_system_score_codex":0.0022522416,"about_ca_system_score_gemma":0.0008555207,"threshold_uncertainty_score":0.038953364},"labels":[],"label_agreement":null},{"id":"W2573581424","doi":"","title":"Continued fractions and the derangement polynomials of types A and B","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Derangement; Mathematics; Type (biology); Combinatorics","score_opus":0.022960667638078545,"score_gpt":0.2774322181400833,"score_spread":0.25447155050200476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573581424","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6001995,0.0057287873,0.14161594,0.007545931,0.0014969825,0.000088411085,0.0005779084,0.0005408653,0.24220575],"genre_scores_gemma":[0.95500726,0.0014229836,0.012201542,0.00040838798,0.00060399354,0.00006905778,0.00018004226,0.00009272838,0.03001398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907637,0.00024360477,0.00005737611,0.00014117126,0.00024477055,0.00023667252],"domain_scores_gemma":[0.99826103,0.0008022961,0.00031286778,0.00019624358,0.0001941229,0.00023347703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001436497,0.0010395036,0.0007982665,0.0033141735,0.0021974633,0.0053189946,0.000971515,0.001467952,0.0069764],"category_scores_gemma":[0.00509115,0.00050429336,0.0009948385,0.0022492798,0.005531523,0.006140076,0.0025495284,0.0031938856,0.001274248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026335592,0.000004106295,0.00011260286,0.000011355881,0.000002892221,0.000048990805,0.00016901032,0.00015674217,0.00028301714,0.9962723,0.00028199793,0.0026304934],"study_design_scores_gemma":[0.000012929732,0.000011626758,0.00017715193,0.000012504241,0.000006072128,0.00013746123,0.0000891018,0.00087713765,0.0003691491,0.99405956,0.0042341123,0.00001323442],"about_ca_topic_score_codex":0.0025884642,"about_ca_topic_score_gemma":0.0013676096,"teacher_disagreement_score":0.0069764,"about_ca_system_score_codex":0.0024507502,"about_ca_system_score_gemma":0.0010688631,"threshold_uncertainty_score":0.023338377},"labels":[],"label_agreement":null},{"id":"W2573615651","doi":"","title":"Neighbor Sum Distinguishing Total Choosability of Graphs with Larger Maximum Average Degree.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Combinatorics; Statistics; Physics","score_opus":0.013488717033245348,"score_gpt":0.21439274248330797,"score_spread":0.20090402545006264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573615651","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8542049,0.00059998356,0.100475274,0.0017936603,0.00016870967,0.000074692376,0.0011853878,0.000486769,0.041010696],"genre_scores_gemma":[0.9723607,0.0001755744,0.020466235,0.0002759356,0.00011763632,0.000046010144,0.000883629,0.00017489407,0.005499469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877626,0.0003408611,0.00006708785,0.00037224707,0.00022977446,0.0002137579],"domain_scores_gemma":[0.9857545,0.0102530485,0.0009068606,0.0018013264,0.00040403416,0.00088035286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014343925,0.0004897,0.000923397,0.00096785324,0.0013231862,0.002780638,0.0018258786,0.0012119008,0.009454948],"category_scores_gemma":[0.007859889,0.00056385214,0.0008327902,0.0012665349,0.0015326724,0.005095054,0.0018274209,0.0022712012,0.0005585731],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013515401,0.00032742662,0.008671252,0.0004989742,0.00010541199,0.00038110398,0.0006786598,0.044409435,0.018566871,0.85928506,0.012195199,0.053529132],"study_design_scores_gemma":[0.00016303828,0.00014404896,0.004643253,0.000051249895,0.00012017034,0.0007175976,0.0004447215,0.14357015,0.0117638875,0.831949,0.006379978,0.000052923613],"about_ca_topic_score_codex":0.0011084081,"about_ca_topic_score_gemma":0.0019324751,"teacher_disagreement_score":0.009454948,"about_ca_system_score_codex":0.0015985736,"about_ca_system_score_gemma":0.0006815474,"threshold_uncertainty_score":0.03162992},"labels":[],"label_agreement":null},{"id":"W2573651048","doi":"","title":"On irregularity strength of convex polytope graphs with certain pendent edges added.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Regular polygon; Combinatorics; Convex polytope; Polytope; Convex analysis; Geometry; Convex optimization","score_opus":0.01112844391133302,"score_gpt":0.21574202983313312,"score_spread":0.2046135859218001,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573651048","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7826704,0.0009277294,0.13159078,0.00283269,0.00028315219,0.00009183956,0.000794648,0.00032817983,0.08048055],"genre_scores_gemma":[0.9712081,0.00046028002,0.018756576,0.00033395764,0.00016078156,0.00006940353,0.0005616215,0.0001468987,0.008302367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904245,0.00031837396,0.000046680772,0.0001967303,0.00021189416,0.00018390748],"domain_scores_gemma":[0.98832464,0.0070249117,0.0015496337,0.0010343333,0.0007015525,0.0013648564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012779953,0.0006943945,0.0009516616,0.0020902585,0.0018762775,0.00268345,0.001742428,0.0015678521,0.010151702],"category_scores_gemma":[0.010835771,0.00074580905,0.0006652105,0.0013350073,0.0025909338,0.0043865787,0.0022271918,0.0027818535,0.0009294314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024751126,0.000087597975,0.0029748313,0.00017220047,0.000043468648,0.00027048495,0.00029707444,0.026951334,0.0040163496,0.94218177,0.00665254,0.016104875],"study_design_scores_gemma":[0.00005034342,0.00007512989,0.0025708063,0.00006685773,0.00005329662,0.0004303326,0.0004514053,0.11780001,0.0027335219,0.87014854,0.005571225,0.000048463575],"about_ca_topic_score_codex":0.0014679912,"about_ca_topic_score_gemma":0.0014243874,"teacher_disagreement_score":0.010151702,"about_ca_system_score_codex":0.0012335442,"about_ca_system_score_gemma":0.0004386243,"threshold_uncertainty_score":0.03396088},"labels":[],"label_agreement":null},{"id":"W2573653203","doi":"","title":"Reconstruction Number Of Separable Self Complementary Graphs And Others.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Separable space; Combinatorics; Mathematical analysis","score_opus":0.008815491616570912,"score_gpt":0.24589201067754055,"score_spread":0.23707651906096963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573653203","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6308997,0.0016144139,0.18418594,0.0037004305,0.00035308546,0.000069875525,0.0014352885,0.0008511534,0.17689],"genre_scores_gemma":[0.9567752,0.0004543593,0.021212023,0.00022956786,0.00009930969,0.000042908414,0.0005806859,0.0001391972,0.020466762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995577,0.000109289154,0.000017193013,0.000109121065,0.00012168262,0.00008504056],"domain_scores_gemma":[0.996951,0.0016951113,0.00028395772,0.00043243397,0.0002816977,0.00035586843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006272108,0.00035722513,0.00038742903,0.0014372879,0.0009599709,0.001617419,0.0008702973,0.00088367,0.013373282],"category_scores_gemma":[0.004992253,0.00023710795,0.00042308684,0.00079063704,0.0016512815,0.003141747,0.0010633953,0.0013503496,0.0011656726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017369016,0.000038359198,0.0007847918,0.00012301755,0.000016116615,0.000071181756,0.00012641882,0.0077163833,0.0029216895,0.9652042,0.00555493,0.01726933],"study_design_scores_gemma":[0.000032675754,0.000041397674,0.0010917132,0.000035995265,0.000023033212,0.00028792024,0.00013687517,0.06450844,0.007719333,0.91885424,0.0072403066,0.000027991307],"about_ca_topic_score_codex":0.0007686192,"about_ca_topic_score_gemma":0.0012905132,"teacher_disagreement_score":0.013373282,"about_ca_system_score_codex":0.00092660415,"about_ca_system_score_gemma":0.000529205,"threshold_uncertainty_score":0.044738114},"labels":[],"label_agreement":null},{"id":"W2573697211","doi":"","title":"On Row-Cyclic Array Codes Detecting and Correcting CT-Bursts Array Errors.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Algorithm","score_opus":0.010654156326985981,"score_gpt":0.2405789633342636,"score_spread":0.2299248070072776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573697211","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041957792,0.0012499597,0.9414703,0.0007407108,0.00041763662,0.00014100803,0.0004707445,0.0016930203,0.011858755],"genre_scores_gemma":[0.5427983,0.0017992337,0.43385953,0.00095291034,0.0005867002,0.0003501163,0.001157024,0.00030292352,0.018193359],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785966,0.00058721885,0.00014918087,0.00030617925,0.0007902742,0.00030749134],"domain_scores_gemma":[0.99387145,0.0032643538,0.0007054956,0.0010907886,0.0008778369,0.0001900642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015757873,0.0011711908,0.00088913616,0.0015137381,0.0008641157,0.0016119995,0.001169371,0.0010649718,0.003169373],"category_scores_gemma":[0.009143376,0.00038848975,0.0005313425,0.0018265801,0.0020677084,0.0016009932,0.0021854609,0.0010751494,0.0017574038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001606145,0.00015112116,0.0035806268,0.00064451684,0.0002463857,0.0006589946,0.0005971073,0.2482695,0.051242772,0.3060107,0.019006182,0.36798596],"study_design_scores_gemma":[0.000097014476,0.00031297727,0.00082448416,0.00019365027,0.00009116361,0.00073427684,0.00017768313,0.7280616,0.047808267,0.20758744,0.013992818,0.000118596145],"about_ca_topic_score_codex":0.003872419,"about_ca_topic_score_gemma":0.006256014,"teacher_disagreement_score":0.003872419,"about_ca_system_score_codex":0.0010871548,"about_ca_system_score_gemma":0.0026865695,"threshold_uncertainty_score":0.010602653},"labels":[],"label_agreement":null},{"id":"W2573740254","doi":"","title":"Neighbourly regular strength of a graph.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.012490780127481652,"score_gpt":0.2589532010007833,"score_spread":0.24646242087330164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573740254","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55585104,0.00082178164,0.16892958,0.0027840084,0.0008858038,0.00015547637,0.0012782473,0.0006301545,0.26866388],"genre_scores_gemma":[0.9317758,0.000500691,0.028131742,0.00055921846,0.0003539883,0.00009345014,0.00061247806,0.00021119995,0.037761368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990471,0.00023003237,0.000047153753,0.00023356306,0.00030786783,0.00013420946],"domain_scores_gemma":[0.99551857,0.0015856893,0.0006351276,0.0006402567,0.0007126136,0.0009076179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008442545,0.00048587943,0.0007223877,0.0019223783,0.0013378991,0.002110695,0.001238484,0.0012118472,0.015236968],"category_scores_gemma":[0.0055394894,0.0005025151,0.0006707662,0.0009801222,0.0020901442,0.0032677895,0.0021699641,0.0018200835,0.0026521422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012895447,0.00003955092,0.0009177076,0.00013153549,0.000042758704,0.00041816029,0.00026500318,0.0011052599,0.008327832,0.97440547,0.0032671406,0.010950686],"study_design_scores_gemma":[0.000039145398,0.00007559222,0.0012746454,0.000046474917,0.00005605683,0.0011631657,0.00032073533,0.00733689,0.0036168497,0.97315854,0.0128810825,0.00003080585],"about_ca_topic_score_codex":0.00060461543,"about_ca_topic_score_gemma":0.00090894295,"teacher_disagreement_score":0.015236968,"about_ca_system_score_codex":0.0005590959,"about_ca_system_score_gemma":0.0003967204,"threshold_uncertainty_score":0.05097276},"labels":[],"label_agreement":null},{"id":"W2573765489","doi":"","title":"The radio number of standard caterpillars.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Entomological Studies and Ecology","field":"Agricultural and Biological Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.011277038259398756,"score_gpt":0.22506257276468603,"score_spread":0.21378553450528726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573765489","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9825744,0.0005804803,0.0010513457,0.000060406266,0.00006223438,0.000017983994,0.0024634677,0.000053725475,0.013136026],"genre_scores_gemma":[0.98415947,0.00021332067,0.00058541994,0.000084231804,0.000036565827,0.00002552122,0.001797029,0.000016898075,0.013081467],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998134,0.000043609467,0.000012552294,0.000060260547,0.000037640202,0.000032579137],"domain_scores_gemma":[0.9988563,0.00035572523,0.0002680869,0.00013247365,0.00017328844,0.00021421668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023996399,0.00020389145,0.0001009876,0.0011335161,0.00018719245,0.00032878542,0.0002476356,0.00022664282,0.00916967],"category_scores_gemma":[0.0010759787,0.00008510886,0.000094275616,0.00028494277,0.00023307519,0.00026491817,0.00027614526,0.00025960733,0.0018926933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014269793,0.00015898478,0.75441444,0.00023246196,0.00018178583,0.0004309402,0.00085813925,0.0002507396,0.14436942,0.0012245207,0.0030649477,0.093386695],"study_design_scores_gemma":[0.000008002873,0.0003634093,0.9867432,0.000014593988,0.00005069044,0.00067329727,0.0002389507,0.00020821011,0.006911252,0.000090686466,0.004683953,0.000013683685],"about_ca_topic_score_codex":0.001502217,"about_ca_topic_score_gemma":0.0031277537,"teacher_disagreement_score":0.00916967,"about_ca_system_score_codex":0.0001944939,"about_ca_system_score_gemma":0.00007859527,"threshold_uncertainty_score":0.03067559},"labels":[],"label_agreement":null},{"id":"W2573798597","doi":"","title":"Equitable and List Equitable Colorings of Graphs with Bounded Maximum Average Degree.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bounded function; Degree (music); Combinatorics; Discrete mathematics; Mathematical analysis; Physics","score_opus":0.023622399493169022,"score_gpt":0.2620874077055633,"score_spread":0.2384650082123943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573798597","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44404945,0.0010485821,0.45840153,0.003225543,0.0003637991,0.00021030675,0.0026295253,0.0016047338,0.08846639],"genre_scores_gemma":[0.89132434,0.000634085,0.07768168,0.0007254432,0.00026130502,0.00022318888,0.0016931476,0.00071260694,0.026744297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824405,0.00061144773,0.00008865501,0.00031876427,0.0002924618,0.00044463325],"domain_scores_gemma":[0.98457587,0.007935914,0.0015644607,0.0028495605,0.0016389497,0.0014352218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015885034,0.0007792647,0.00074530666,0.001508445,0.0022750867,0.002869435,0.0023893474,0.0012013487,0.01467764],"category_scores_gemma":[0.015107958,0.0008055327,0.0006318047,0.002045067,0.0014705657,0.0058566537,0.002350645,0.0020205826,0.0015207322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007716461,0.00027486656,0.0026693929,0.00036110549,0.00006465231,0.0003632528,0.00084787793,0.053457685,0.007069566,0.85814756,0.018753564,0.057218723],"study_design_scores_gemma":[0.000074605196,0.00006656737,0.00091216865,0.0000624307,0.000046618,0.00030156664,0.0003404262,0.097254515,0.0030544985,0.8881727,0.009681123,0.000032779782],"about_ca_topic_score_codex":0.0021963469,"about_ca_topic_score_gemma":0.004766155,"teacher_disagreement_score":0.01467764,"about_ca_system_score_codex":0.002073051,"about_ca_system_score_gemma":0.0011994359,"threshold_uncertainty_score":0.04910159},"labels":[],"label_agreement":null},{"id":"W2573809857","doi":"","title":"Construction of super edge-connected multigraphs with prescribed degrees.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Computer science; Artificial intelligence","score_opus":0.005646108330770707,"score_gpt":0.16990715226698636,"score_spread":0.16426104393621566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573809857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15388985,0.00028816605,0.7768851,0.00045507087,0.00012581714,0.00012686779,0.00047492085,0.00064708904,0.06710715],"genre_scores_gemma":[0.7056575,0.0003401703,0.276899,0.00024789842,0.00003823377,0.00016528265,0.0005883432,0.00018142571,0.015882134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972063,0.000092528004,0.000013344308,0.000055717213,0.00007145443,0.000046217145],"domain_scores_gemma":[0.99914324,0.00029994466,0.00008658175,0.00022593967,0.00010701161,0.00013732545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030928725,0.00036674825,0.00021982634,0.0010199056,0.0007344987,0.00064742105,0.00062362547,0.00043500913,0.0058562816],"category_scores_gemma":[0.0011646271,0.00037302778,0.00034198226,0.0007475619,0.00056658994,0.0011737635,0.0018331916,0.0009274866,0.00093114306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010151985,0.00006291223,0.0005409909,0.00015288265,0.000016395914,0.00033550776,0.00029984824,0.0082412,0.02572927,0.9290754,0.0037142655,0.03172977],"study_design_scores_gemma":[0.000046698875,0.00007730229,0.0011396707,0.00010530231,0.0000413808,0.00057948864,0.00030925917,0.0965899,0.02656043,0.83821607,0.036304377,0.00003016999],"about_ca_topic_score_codex":0.0003292971,"about_ca_topic_score_gemma":0.0009760267,"teacher_disagreement_score":0.0058562816,"about_ca_system_score_codex":0.00040827444,"about_ca_system_score_gemma":0.00038836736,"threshold_uncertainty_score":0.019591212},"labels":[],"label_agreement":null},{"id":"W2573856633","doi":"","title":"Resistance Distance of Three Classes of Join Graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Join (topology); Mathematics; Combinatorics","score_opus":0.018444873667050863,"score_gpt":0.26835553325632894,"score_spread":0.24991065958927808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573856633","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7936353,0.00075774745,0.07179098,0.0020786144,0.00015367172,0.00011034054,0.001302016,0.000840324,0.12933104],"genre_scores_gemma":[0.973258,0.00031215884,0.011198049,0.00028788863,0.00010809259,0.00007442426,0.0012944511,0.00014989733,0.013317005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985367,0.0002582696,0.000071270166,0.00036195322,0.00046177718,0.0003100299],"domain_scores_gemma":[0.99329245,0.0030800444,0.0011487342,0.0007778616,0.0004541008,0.001246831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010820713,0.00053850893,0.00067361793,0.0027099124,0.0019451132,0.00472222,0.0017292539,0.0022363544,0.015595963],"category_scores_gemma":[0.0071475413,0.00042373122,0.0008030097,0.0014064548,0.002116095,0.0040747155,0.0020099452,0.0022166774,0.0019651272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025219528,0.00009815257,0.0028534594,0.00008968209,0.000033044093,0.00016783368,0.00059390947,0.003160006,0.0038227541,0.96923816,0.004976543,0.014714253],"study_design_scores_gemma":[0.00010831188,0.00017900544,0.005905839,0.00007684733,0.000090464826,0.0012266539,0.0010209271,0.031256925,0.0053611244,0.9338352,0.020865481,0.000073230476],"about_ca_topic_score_codex":0.0009900017,"about_ca_topic_score_gemma":0.00091246545,"teacher_disagreement_score":0.015595963,"about_ca_system_score_codex":0.0015267913,"about_ca_system_score_gemma":0.0005050198,"threshold_uncertainty_score":0.052173734},"labels":[],"label_agreement":null},{"id":"W2573899140","doi":"","title":"Some Results On Super Edge Magic n-Stars.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Stars; MAGIC (telescope); Mathematics; Enhanced Data Rates for GSM Evolution; Astrophysics; Astronomy; Physics; Artificial intelligence; Computer science","score_opus":0.015593983607039738,"score_gpt":0.2264227491608315,"score_spread":0.21082876555379176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573899140","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14351921,0.010850875,0.24460223,0.009815619,0.0017092854,0.00015609292,0.0022500951,0.000840735,0.58625585],"genre_scores_gemma":[0.73340666,0.009750272,0.15993796,0.0060298466,0.0018561522,0.00034256472,0.004194998,0.00060667534,0.08387492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899215,0.00026825894,0.00006125894,0.00021704886,0.0002886511,0.00017266056],"domain_scores_gemma":[0.9959649,0.0022318012,0.00031380946,0.00056566886,0.0003788029,0.00054502045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014594793,0.0008505961,0.0010072988,0.0026908056,0.002341833,0.0029542446,0.0019666727,0.0016319039,0.022444725],"category_scores_gemma":[0.0046473574,0.0007256776,0.0011836985,0.004192458,0.0023521774,0.0066279583,0.0030737869,0.0036950184,0.0037896964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000120868026,0.00008313572,0.0006680847,0.00039036732,0.000027900516,0.00013601925,0.00017429062,0.002853681,0.0010571578,0.9486507,0.020118037,0.025719687],"study_design_scores_gemma":[0.00002385849,0.000019546747,0.00035944086,0.000054984146,0.000019142684,0.00020186788,0.000096987045,0.004024587,0.0005691299,0.97732085,0.017295517,0.000013931899],"about_ca_topic_score_codex":0.001182402,"about_ca_topic_score_gemma":0.002309618,"teacher_disagreement_score":0.022444725,"about_ca_system_score_codex":0.0016388935,"about_ca_system_score_gemma":0.00087487354,"threshold_uncertainty_score":0.0750851},"labels":[],"label_agreement":null},{"id":"W2573967999","doi":"","title":"A sharp upper bound on the spectral radius of generalized weighted digraphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; Upper and lower bounds; RADIUS; Combinatorics; Mathematical analysis; Eigenvalues and eigenvectors; Physics; Quantum mechanics; Computer science","score_opus":0.02471284038092588,"score_gpt":0.26853317870645754,"score_spread":0.24382033832553165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573967999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22150847,0.012678828,0.585747,0.0054375194,0.0011856128,0.00019012927,0.0020464882,0.0017614915,0.16944444],"genre_scores_gemma":[0.88545763,0.005385648,0.08764899,0.0016678518,0.000947045,0.00035395607,0.0010302385,0.0006205509,0.016888175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99805486,0.00059001474,0.00008135746,0.00045123452,0.0004914087,0.0003311285],"domain_scores_gemma":[0.9844396,0.0106659625,0.00093770685,0.0013512936,0.0010848324,0.0015206338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016801633,0.00181191,0.0017972413,0.0032384743,0.0018604128,0.0036250406,0.0028772014,0.0021989546,0.010433953],"category_scores_gemma":[0.021294959,0.0010250991,0.0010756631,0.0024064449,0.0029623965,0.0068646073,0.0044404445,0.0043116286,0.0033722522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019447476,0.000079188154,0.0010264547,0.00044252476,0.00009597396,0.00027238653,0.00045059656,0.014584689,0.007554663,0.9330077,0.0152324485,0.027058868],"study_design_scores_gemma":[0.000029067125,0.00006441546,0.0009369835,0.00013896992,0.0000849651,0.0005805719,0.0002187989,0.05883132,0.0025436352,0.9240899,0.0124263745,0.00005507839],"about_ca_topic_score_codex":0.00091346714,"about_ca_topic_score_gemma":0.0013168305,"teacher_disagreement_score":0.010433953,"about_ca_system_score_codex":0.0016731595,"about_ca_system_score_gemma":0.00055182975,"threshold_uncertainty_score":0.034905016},"labels":[],"label_agreement":null},{"id":"W2573978227","doi":"","title":"Lattices associated with Hamming graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hamming graph; Hamming code; Combinatorics; Statistics; Block code","score_opus":0.011727505345694673,"score_gpt":0.2215056867426426,"score_spread":0.20977818139694793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573978227","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31630906,0.0036341,0.3099725,0.0052386075,0.00216324,0.00017686808,0.002787632,0.0010415547,0.3586765],"genre_scores_gemma":[0.8814087,0.0012517184,0.04237725,0.0007895118,0.0009275684,0.000103365994,0.0010807434,0.00026270768,0.071798414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988856,0.0003235858,0.000067676454,0.00017398622,0.00031408598,0.00023516346],"domain_scores_gemma":[0.99820673,0.00054834806,0.00030018523,0.0002564691,0.0003017858,0.00038645286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007115517,0.0004872309,0.00055095414,0.0023953072,0.0020153315,0.0031786195,0.0008493978,0.00077376975,0.01670284],"category_scores_gemma":[0.0028508746,0.00040647,0.0007160437,0.0014436838,0.002446514,0.0046554855,0.0030588722,0.0020583635,0.002642736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025704081,0.00000940422,0.00012919445,0.000019442392,0.000004032799,0.000044731212,0.000082560495,0.00026536096,0.00032263348,0.99435717,0.0015523633,0.0031875337],"study_design_scores_gemma":[0.000008926162,0.0000074187024,0.00012602734,0.000011907538,0.0000049549694,0.00011179169,0.000080553415,0.0018444065,0.0004068775,0.99131936,0.0060683717,0.000009351459],"about_ca_topic_score_codex":0.0013910249,"about_ca_topic_score_gemma":0.0017203817,"teacher_disagreement_score":0.01670284,"about_ca_system_score_codex":0.0015021346,"about_ca_system_score_gemma":0.0006539318,"threshold_uncertainty_score":0.055876553},"labels":[],"label_agreement":null},{"id":"W2574055986","doi":"","title":"On locating-dominating codes in the infinite king grid.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Grid; Geometry","score_opus":0.012978371822295554,"score_gpt":0.23708129340028522,"score_spread":0.22410292157798967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574055986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40637696,0.0024003258,0.46318135,0.0044888402,0.0004556527,0.00015978092,0.0010231938,0.000667499,0.121246375],"genre_scores_gemma":[0.9330535,0.0012354783,0.040272687,0.0005719407,0.00015714274,0.00015342572,0.0004678216,0.00014731284,0.023940774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988199,0.00040894662,0.000059051432,0.00015305635,0.00024817968,0.0003108916],"domain_scores_gemma":[0.99260545,0.0046485355,0.00055937306,0.0011435766,0.0005381439,0.00050496776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009689808,0.0004579454,0.0009510634,0.0012970052,0.0018725824,0.0025178576,0.0015445543,0.001335755,0.0059462753],"category_scores_gemma":[0.010422243,0.00041000167,0.0004798465,0.0017320894,0.0028706614,0.0049874727,0.003763105,0.0022239115,0.0016548054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012707963,0.000028291877,0.0004956151,0.000066016066,0.000012272372,0.00011710631,0.00027526877,0.021541702,0.00079266325,0.9617208,0.004895464,0.009927691],"study_design_scores_gemma":[0.000035883026,0.000021238306,0.00014910226,0.000032575732,0.000008398562,0.00014437352,0.00017373102,0.049741983,0.0006105402,0.9456337,0.0034314732,0.000016955502],"about_ca_topic_score_codex":0.002176145,"about_ca_topic_score_gemma":0.0025754867,"teacher_disagreement_score":0.0059462753,"about_ca_system_score_codex":0.0017613407,"about_ca_system_score_gemma":0.0013358442,"threshold_uncertainty_score":0.019892275},"labels":[],"label_agreement":null},{"id":"W2574060387","doi":"","title":"Toughness of Kronecker product of graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Kronecker product; Mathematics; Toughness; Product (mathematics); Kronecker delta; Combinatorics; Composite material; Materials science; Geometry; Physics","score_opus":0.011755845899409846,"score_gpt":0.2220867364911712,"score_spread":0.21033089059176135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574060387","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5878595,0.0018022076,0.27981535,0.0039793043,0.000576509,0.000087303655,0.0014626965,0.0005558087,0.12386129],"genre_scores_gemma":[0.9548853,0.0005335947,0.024652878,0.0004282809,0.00031502722,0.00009367268,0.000698157,0.00016145906,0.018231722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821943,0.00055490347,0.00012405113,0.00039191893,0.00044189618,0.0002677502],"domain_scores_gemma":[0.9908098,0.0049093184,0.001107161,0.001095065,0.00085590355,0.001222754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018316287,0.0005907732,0.00071302947,0.0023226563,0.001970104,0.0040333704,0.0015391888,0.0012409621,0.012743833],"category_scores_gemma":[0.0080406,0.00070412207,0.00084070914,0.0015103207,0.0035945622,0.00825152,0.0026263364,0.0026037213,0.0012485179],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049568043,0.000025886919,0.0005512558,0.00004986328,0.0000095818605,0.000053016407,0.00018240935,0.0015212911,0.0005675598,0.9907567,0.002393652,0.0038392544],"study_design_scores_gemma":[0.000009914771,0.000018415822,0.00040278517,0.00002058065,0.000008168433,0.00013423752,0.00011795408,0.009401089,0.00048078105,0.9869119,0.0024777474,0.000016397062],"about_ca_topic_score_codex":0.0012287298,"about_ca_topic_score_gemma":0.0012445558,"teacher_disagreement_score":0.012743833,"about_ca_system_score_codex":0.0013222774,"about_ca_system_score_gemma":0.0005930744,"threshold_uncertainty_score":0.04263234},"labels":[],"label_agreement":null},{"id":"W2574114580","doi":"","title":"On the extremal Merrifield-Simmons index of quasi-unicyclic graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Index (typography); Discrete mathematics; Computer science; World Wide Web","score_opus":0.031197686055073615,"score_gpt":0.2782636524007888,"score_spread":0.2470659663457152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574114580","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7007045,0.0039980942,0.05039536,0.0040115956,0.0008597971,0.000070225506,0.000745379,0.00036941006,0.23884568],"genre_scores_gemma":[0.98392856,0.0010374348,0.005378644,0.00030275638,0.00041069413,0.000045514764,0.00020761383,0.00006596377,0.00862298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995499,0.00013171502,0.000018977122,0.00007685515,0.00012285038,0.00009968776],"domain_scores_gemma":[0.9975721,0.0011747848,0.00041169784,0.0001771524,0.00023070724,0.00043355243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009966774,0.00048945175,0.00070027617,0.0039393306,0.0014440735,0.0024426465,0.0012653255,0.0012274571,0.008326398],"category_scores_gemma":[0.005913877,0.0002998907,0.0002938641,0.0016659818,0.0022957854,0.003751067,0.0016732982,0.0015956849,0.00092043425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010202217,0.000019037061,0.00064217806,0.0000656412,0.000008444689,0.00009612536,0.00017095,0.0014966892,0.0011524621,0.9857701,0.003166973,0.0073092557],"study_design_scores_gemma":[0.00002757955,0.0000277718,0.0009433861,0.000050505572,0.00001340928,0.00028629348,0.00014875435,0.012359979,0.00082270254,0.9811204,0.004177395,0.000021824502],"about_ca_topic_score_codex":0.00078403106,"about_ca_topic_score_gemma":0.0010560533,"teacher_disagreement_score":0.008326398,"about_ca_system_score_codex":0.0015280189,"about_ca_system_score_gemma":0.0004375029,"threshold_uncertainty_score":0.027854621},"labels":[],"label_agreement":null},{"id":"W2574190573","doi":"","title":"Some Identities Of Barnes-Type Genocchi Polynomials.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Type (biology); Pure mathematics; Algebra over a field","score_opus":0.03284828121455303,"score_gpt":0.30102943135551985,"score_spread":0.26818115014096683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574190573","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21892242,0.006800682,0.084730305,0.0058446033,0.002505354,0.00007556842,0.00082223804,0.00040768302,0.6798912],"genre_scores_gemma":[0.8710744,0.0023251341,0.02357504,0.0015452526,0.0015662964,0.000069580674,0.00042238552,0.00018914278,0.099232785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995079,0.0001315576,0.000018087761,0.000058077738,0.00018153181,0.000102782455],"domain_scores_gemma":[0.9992724,0.00024044812,0.00009312695,0.000095596326,0.00017099944,0.00012744954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008202439,0.00056946126,0.0004478895,0.0017608259,0.0016602144,0.002010434,0.00070700265,0.0007442885,0.013077916],"category_scores_gemma":[0.002793533,0.00028031974,0.00050048303,0.0013901303,0.0024341352,0.00255903,0.0020469197,0.0023580717,0.0029523927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014511637,0.000007970505,0.00015873199,0.000024881794,0.0000023930036,0.00007693762,0.00013461274,0.00015450644,0.00031731915,0.990974,0.0031052853,0.0050288574],"study_design_scores_gemma":[0.000012168731,0.000012999459,0.00053183205,0.000023800285,0.0000073061733,0.0002588435,0.0000857917,0.0016815149,0.0004888305,0.98140484,0.015479264,0.000012783016],"about_ca_topic_score_codex":0.0017959841,"about_ca_topic_score_gemma":0.0022992447,"teacher_disagreement_score":0.013077916,"about_ca_system_score_codex":0.0014163029,"about_ca_system_score_gemma":0.00071630714,"threshold_uncertainty_score":0.043749988},"labels":[],"label_agreement":null},{"id":"W2574293375","doi":"","title":"On two Curious Sums of Triple Multiplication of Binomial Coefficients.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Differential Equations and Dynamical Systems","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Binomial coefficient; Multiplication (music); Binomial (polynomial); Arithmetic; Central binomial coefficient; Binomial theorem; Pure mathematics; Statistics; Discrete mathematics; Negative binomial distribution; Combinatorics; Poisson distribution","score_opus":0.023177763865234492,"score_gpt":0.30518804485680523,"score_spread":0.2820102809915707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574293375","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25648373,0.006428303,0.26999915,0.007124021,0.008702981,0.00012931049,0.00051416835,0.00066141295,0.44995692],"genre_scores_gemma":[0.8321372,0.0018660729,0.06214524,0.0019236779,0.0022062692,0.00014706783,0.00030645225,0.00044139015,0.0988266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99893266,0.00028973486,0.000057395606,0.00015020528,0.00035577075,0.00021415502],"domain_scores_gemma":[0.9988341,0.00039436627,0.00010690487,0.00014891369,0.00022496429,0.00029086677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010201401,0.0008239834,0.0010909977,0.002062934,0.0031542957,0.0035212513,0.0012441634,0.0014958725,0.012311572],"category_scores_gemma":[0.0043439367,0.0005590381,0.0009027558,0.0012990964,0.003855058,0.0059806365,0.0036312584,0.0029416347,0.0026473955],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002023785,0.000013130383,0.00009356844,0.00002515199,0.0000055657965,0.00025472674,0.00017427884,0.00022627016,0.00047141846,0.99263906,0.002496007,0.0035805528],"study_design_scores_gemma":[0.000008923653,0.000015105966,0.00012847947,0.000028973831,0.000008666795,0.00046051267,0.0000791576,0.0022564738,0.0005385408,0.98891276,0.0075400793,0.00002226878],"about_ca_topic_score_codex":0.00063952385,"about_ca_topic_score_gemma":0.0012470803,"teacher_disagreement_score":0.012311572,"about_ca_system_score_codex":0.0009791352,"about_ca_system_score_gemma":0.0006723384,"threshold_uncertainty_score":0.041186333},"labels":[],"label_agreement":null},{"id":"W2574321853","doi":"","title":"Self Vertex Switchings Of Trees.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Tree (set theory); Combinatorics; Graph","score_opus":0.00815404646545823,"score_gpt":0.21182066971011518,"score_spread":0.20366662324465695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574321853","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52387774,0.0025445903,0.20162363,0.00096861005,0.0008507782,0.00009205148,0.00077708485,0.0010912598,0.2681742],"genre_scores_gemma":[0.95758826,0.0006657205,0.013244055,0.00024315943,0.00022964443,0.000043557433,0.0004095436,0.00016549963,0.027410619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997081,0.00007033153,0.000018423523,0.000057776386,0.00007598279,0.00006921176],"domain_scores_gemma":[0.9989825,0.00041293097,0.0001472946,0.00017334455,0.0001237206,0.00016020227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002694645,0.00019958062,0.00031950168,0.0013481517,0.00079053506,0.001496498,0.00047416607,0.00056873524,0.008630879],"category_scores_gemma":[0.0018835984,0.00024078609,0.00039938153,0.00068879384,0.000675516,0.0016313974,0.00088914926,0.00080531207,0.00091998925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066658286,0.000040143368,0.00075537915,0.00006971898,0.000020427968,0.00023171809,0.00020160855,0.0053391894,0.0039199353,0.9562686,0.0052192016,0.027867444],"study_design_scores_gemma":[0.00002424342,0.000039420596,0.00082643767,0.000030807958,0.000016718877,0.00040551374,0.00013461178,0.037798397,0.002198719,0.94514257,0.013367776,0.000014786572],"about_ca_topic_score_codex":0.00057488313,"about_ca_topic_score_gemma":0.0010576542,"teacher_disagreement_score":0.008630879,"about_ca_system_score_codex":0.0006101499,"about_ca_system_score_gemma":0.00023606085,"threshold_uncertainty_score":0.028873146},"labels":[],"label_agreement":null},{"id":"W2574323604","doi":"","title":"Minimizing the least eigenvalue of bicyclic graphs with fixed diameter.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Bicyclic molecule; Combinatorics; Chemistry; Medicinal chemistry; Physics","score_opus":0.028359972070274707,"score_gpt":0.2663913660209277,"score_spread":0.238031393950653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574323604","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6990513,0.0014951762,0.23159371,0.0021782317,0.00027976904,0.00008966669,0.00095647614,0.0006484522,0.06370722],"genre_scores_gemma":[0.932185,0.0007791995,0.051071722,0.00024359612,0.00015808002,0.00013667774,0.000525432,0.00031729834,0.014582895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965334,0.00010608442,0.000012032897,0.00008164676,0.000071534436,0.00007534776],"domain_scores_gemma":[0.9978586,0.0012317407,0.00025580206,0.00016663622,0.00020880901,0.00027851836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004265007,0.00075371616,0.000724155,0.00096022745,0.0007413091,0.0012411275,0.0012263398,0.0011327082,0.004803268],"category_scores_gemma":[0.0055357,0.00042405835,0.00024413178,0.00079344545,0.00089706155,0.0015898403,0.0010647998,0.0008623452,0.0009809858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005323824,0.00014345752,0.00221216,0.0007013733,0.000085657986,0.00035579852,0.0005618051,0.11596847,0.035940684,0.7578652,0.029432852,0.056200195],"study_design_scores_gemma":[0.00007519796,0.00008839486,0.0012598814,0.00007583474,0.000036023233,0.00032506156,0.00034955426,0.22393776,0.0064027715,0.76214087,0.0052710697,0.000037600035],"about_ca_topic_score_codex":0.00091672415,"about_ca_topic_score_gemma":0.0017917764,"teacher_disagreement_score":0.004803268,"about_ca_system_score_codex":0.00078539154,"about_ca_system_score_gemma":0.00038179365,"threshold_uncertainty_score":0.016068518},"labels":[],"label_agreement":null},{"id":"W2574325694","doi":"","title":"A note on the intersection graph of subspaces of a vector space.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Linear subspace; Mathematics; Intersection (aeronautics); Vector space; Graph; Combinatorics; Space (punctuation); Pure mathematics; Computer science; Geography; Cartography","score_opus":0.00667989212937458,"score_gpt":0.19173352667101515,"score_spread":0.18505363454164056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574325694","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061511718,0.014562467,0.4625918,0.009308596,0.005562961,0.0001003973,0.0012080997,0.00068288884,0.444471],"genre_scores_gemma":[0.7019011,0.015705261,0.20023617,0.004867082,0.0049832407,0.00022421534,0.0015225749,0.0008276991,0.069732696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890924,0.00040831248,0.000048662794,0.00022962739,0.00028079882,0.00012330645],"domain_scores_gemma":[0.99661773,0.0020774372,0.00020451253,0.00050706335,0.0003264802,0.00026681044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010371899,0.00071390823,0.0008921769,0.0035490335,0.0025520897,0.0034272124,0.001544852,0.0013555669,0.010780957],"category_scores_gemma":[0.0047280574,0.0005572713,0.00096877076,0.0046669072,0.004397185,0.007887916,0.0032493607,0.0043860413,0.0018068607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014624716,0.000010619098,0.00014641625,0.00003647064,0.000008776919,0.00012274542,0.000102256054,0.000618558,0.0003184761,0.98435163,0.0063880607,0.007881513],"study_design_scores_gemma":[0.0000024292867,0.000012431053,0.00022847278,0.000021165823,0.0000075996527,0.00016480763,0.00008409253,0.0028227654,0.00020643002,0.97744626,0.01899145,0.000012095583],"about_ca_topic_score_codex":0.0024769292,"about_ca_topic_score_gemma":0.003259302,"teacher_disagreement_score":0.010780957,"about_ca_system_score_codex":0.0010719642,"about_ca_system_score_gemma":0.00054592587,"threshold_uncertainty_score":0.036065876},"labels":[],"label_agreement":null},{"id":"W2574396504","doi":"","title":"Kings in strong tournaments.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Sports, Gender, and Society","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Mathematical economics; Combinatorics","score_opus":0.02431565168175519,"score_gpt":0.29421722677385004,"score_spread":0.26990157509209484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574396504","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62440014,0.001588105,0.07847989,0.004270434,0.0005630458,0.00011346118,0.0007776522,0.00029258427,0.28951466],"genre_scores_gemma":[0.96621263,0.00025261482,0.0038283602,0.00019813256,0.00011324654,0.00003999814,0.0001944809,0.000036998128,0.029123478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982595,0.0007103581,0.00012344739,0.0003179834,0.00017425948,0.00041452015],"domain_scores_gemma":[0.9940222,0.0025215398,0.0010050876,0.00066202594,0.00042442617,0.0013646769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001510164,0.00037927012,0.0009506131,0.0011427711,0.0030551024,0.004562825,0.00079590816,0.0011564008,0.030824892],"category_scores_gemma":[0.008112564,0.00036552746,0.00088218803,0.0012260105,0.002689443,0.0033760092,0.0028289803,0.0012876416,0.0021945336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023426035,0.00007076422,0.00555116,0.00011054157,0.000067815134,0.00021889823,0.00080622325,0.0025397749,0.00040398465,0.9647929,0.006834046,0.018369686],"study_design_scores_gemma":[0.0001154262,0.000078717734,0.0052275364,0.000048781723,0.00005769161,0.0003219253,0.0012340634,0.009489515,0.00024591846,0.96468437,0.018472627,0.00002343512],"about_ca_topic_score_codex":0.002309985,"about_ca_topic_score_gemma":0.0048078857,"teacher_disagreement_score":0.030824892,"about_ca_system_score_codex":0.0011600566,"about_ca_system_score_gemma":0.0007738464,"threshold_uncertainty_score":0.10311955},"labels":[],"label_agreement":null},{"id":"W2574425802","doi":"","title":"The Relationship between Series · n i=1 i m and the Eulerian Numbers.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Series (stratigraphy); Eulerian path; Pure mathematics; Geology","score_opus":0.01399723442506488,"score_gpt":0.26124522340628653,"score_spread":0.24724798898122166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574425802","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21154001,0.021231545,0.258499,0.01735012,0.006586035,0.000088872046,0.0012116206,0.00073944725,0.48275334],"genre_scores_gemma":[0.88338953,0.008141053,0.042577785,0.0023132279,0.004177252,0.00013527829,0.00042330162,0.00024458385,0.058598038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992518,0.00022266686,0.00005539007,0.00021459804,0.00017220166,0.000083336345],"domain_scores_gemma":[0.9967439,0.0014476102,0.0008290066,0.00033035502,0.0003715624,0.00027748707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011879246,0.0007330299,0.0004855465,0.0027518966,0.0015201067,0.0032198096,0.0010107115,0.0010307953,0.012883083],"category_scores_gemma":[0.010721175,0.0004355905,0.00034854945,0.001797527,0.004331607,0.009022436,0.0023372397,0.0029819969,0.002569247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022632234,0.000009733205,0.00033528838,0.000041191586,0.0000059774065,0.00005115168,0.00011110312,0.00040713695,0.0002834716,0.9879155,0.0028570497,0.007959804],"study_design_scores_gemma":[0.0000052992505,0.000011512208,0.00045304617,0.000029155945,0.0000064027813,0.00021645677,0.00004465407,0.0016195894,0.00024213913,0.9843503,0.013007581,0.000013765162],"about_ca_topic_score_codex":0.0005409257,"about_ca_topic_score_gemma":0.0006719115,"teacher_disagreement_score":0.012883083,"about_ca_system_score_codex":0.0009774351,"about_ca_system_score_gemma":0.0005232687,"threshold_uncertainty_score":0.04309827},"labels":[],"label_agreement":null},{"id":"W2574441828","doi":"","title":"On the Inverse Of General Cyclic Heptadiagonal Matrices.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Inverse; Pure mathematics; Geometry","score_opus":0.01034055379157038,"score_gpt":0.22177727637863034,"score_spread":0.21143672258705998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574441828","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19287437,0.0049369833,0.48788613,0.0025926635,0.0012079211,0.000101444064,0.0006378313,0.0006361786,0.30912638],"genre_scores_gemma":[0.8206302,0.004272799,0.09345657,0.001622842,0.00091861124,0.00011834371,0.0009018322,0.00030535148,0.077773534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946505,0.0001281346,0.000023563976,0.00008822518,0.00017766265,0.00011732038],"domain_scores_gemma":[0.99905866,0.0004403895,0.000096073745,0.00015838916,0.00016488569,0.000081640996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053147523,0.00057425257,0.00047243614,0.0012147351,0.00082097505,0.0014833736,0.00059627503,0.00066084723,0.010268666],"category_scores_gemma":[0.003334434,0.00029170694,0.0003490582,0.0012549919,0.0020851297,0.0028665508,0.001921353,0.0017656065,0.0029978044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007072141,0.000042556676,0.00032818972,0.00008564819,0.000011613729,0.00013805705,0.0002467283,0.0056131333,0.001779631,0.9480827,0.008798456,0.03480251],"study_design_scores_gemma":[0.0000100409425,0.000021473876,0.00018383852,0.000027881906,0.0000047726026,0.00017603952,0.00010404544,0.012915193,0.0011342318,0.97474784,0.01065815,0.000016472666],"about_ca_topic_score_codex":0.001291064,"about_ca_topic_score_gemma":0.0020659785,"teacher_disagreement_score":0.010268666,"about_ca_system_score_codex":0.00048776667,"about_ca_system_score_gemma":0.00046222715,"threshold_uncertainty_score":0.034352064},"labels":[],"label_agreement":null},{"id":"W2574479152","doi":"","title":"Tricyclic graphs with minimum Kirchhoff Index.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Tricyclic; Index (typography); Combinatorics; Computer science; Chemistry; Stereochemistry","score_opus":0.01987593969212487,"score_gpt":0.26699556923841367,"score_spread":0.2471196295462888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574479152","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52969295,0.0015056635,0.06687289,0.002149724,0.0005752122,0.00013852848,0.003422646,0.0007728208,0.3948696],"genre_scores_gemma":[0.95909166,0.00070360047,0.012704378,0.0003163021,0.00010810435,0.000058235226,0.001165289,0.000100708814,0.025751611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997106,0.000050923074,0.000019415602,0.00005392128,0.000087253444,0.000077819815],"domain_scores_gemma":[0.99894994,0.0002829236,0.00022634644,0.00020489027,0.0001747974,0.00016102324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016895616,0.00026322578,0.0005688857,0.0011196812,0.0010493926,0.0018649048,0.0008387151,0.0008033824,0.014082046],"category_scores_gemma":[0.001969013,0.00025236688,0.0002457033,0.0013711264,0.0006634093,0.0017625256,0.0011125872,0.00089165964,0.0021131148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017799932,0.000049059403,0.00064932404,0.00015789669,0.000020115593,0.00029792136,0.0001749091,0.0033572956,0.00699471,0.9479945,0.014175957,0.025950396],"study_design_scores_gemma":[0.00005308648,0.000050810977,0.0013140095,0.000053707943,0.00003446933,0.0008176588,0.00029152047,0.015384475,0.0044877813,0.96170497,0.0157752,0.000032406457],"about_ca_topic_score_codex":0.00093248405,"about_ca_topic_score_gemma":0.0015894035,"teacher_disagreement_score":0.014082046,"about_ca_system_score_codex":0.0006114475,"about_ca_system_score_gemma":0.00047588264,"threshold_uncertainty_score":0.047109127},"labels":[],"label_agreement":null},{"id":"W2574512124","doi":"","title":"Forbidden subgraph conditions for Hamilton cycles in implicit claw-heavy graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Claw; Mathematics; Induced subgraph isomorphism problem; Combinatorics; Biology; Graph; Line graph","score_opus":0.02018336651925866,"score_gpt":0.3056736585531554,"score_spread":0.28549029203389675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574512124","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6653872,0.00058470946,0.18530537,0.0017013306,0.00043164808,0.0006707759,0.0038515823,0.0011650615,0.14090225],"genre_scores_gemma":[0.95851773,0.0002603191,0.026045006,0.00036082734,0.00015045854,0.00026123802,0.0027801737,0.00019507526,0.011429037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991678,0.00015829713,0.00005664166,0.00014399736,0.00025819088,0.00021496609],"domain_scores_gemma":[0.99545985,0.0027064339,0.00047461427,0.00032489243,0.0006060952,0.0004280784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006430372,0.0004790668,0.0005693329,0.0017374486,0.0014112667,0.0018857152,0.0012549476,0.001443369,0.014792035],"category_scores_gemma":[0.006571645,0.000509331,0.000602593,0.0012010038,0.0015494211,0.003239298,0.0014446396,0.0018785488,0.0013497685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047038918,0.00021345784,0.0029766166,0.00035725208,0.000047474332,0.0011874742,0.0007459269,0.009756428,0.013800821,0.93789583,0.010054986,0.022493273],"study_design_scores_gemma":[0.00011830974,0.00005759164,0.0011452072,0.0000630874,0.000035844303,0.00043216432,0.0005491692,0.027180558,0.006449835,0.958459,0.005466968,0.000042245876],"about_ca_topic_score_codex":0.0030327055,"about_ca_topic_score_gemma":0.0058044638,"teacher_disagreement_score":0.014792035,"about_ca_system_score_codex":0.0011453306,"about_ca_system_score_gemma":0.0011571258,"threshold_uncertainty_score":0.049484253},"labels":[],"label_agreement":null},{"id":"W2574536825","doi":"","title":"Some Families of Combination and Permutation Graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Permutation (music); Combinatorics; Art","score_opus":0.005091354909450043,"score_gpt":0.1869745389177904,"score_spread":0.18188318400834036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574536825","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12721984,0.003221746,0.36696836,0.0044504083,0.00053517707,0.00018098083,0.0018634517,0.0008538951,0.49470618],"genre_scores_gemma":[0.82560605,0.0030603143,0.0812812,0.0017576194,0.00074674643,0.00037458423,0.0019167638,0.00036249452,0.08489426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877375,0.00040830852,0.000048653128,0.00028962165,0.00031980267,0.0001597546],"domain_scores_gemma":[0.9963282,0.002022332,0.0003911061,0.0005217842,0.00044308594,0.00029349493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009175508,0.0006699836,0.0004761542,0.002672134,0.0024931321,0.002623822,0.0009849247,0.0011964838,0.018428983],"category_scores_gemma":[0.004568945,0.0005873283,0.0010573318,0.0024165865,0.0019572563,0.0043397113,0.0016413783,0.0022072196,0.0021979492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002400919,0.000016029178,0.00027276578,0.00004602093,0.000013338299,0.00021038605,0.00015342621,0.000952497,0.00039740928,0.9813672,0.005949429,0.010597596],"study_design_scores_gemma":[0.000011208382,0.000012604627,0.00025877808,0.00002454827,0.0000149772595,0.0006016492,0.00011246098,0.0070134415,0.0003559332,0.9705494,0.021033539,0.0000115037865],"about_ca_topic_score_codex":0.00091467996,"about_ca_topic_score_gemma":0.0010012554,"teacher_disagreement_score":0.018428983,"about_ca_system_score_codex":0.0012652713,"about_ca_system_score_gemma":0.00062113174,"threshold_uncertainty_score":0.06165111},"labels":[],"label_agreement":null},{"id":"W2574581444","doi":"","title":"A Note On n-Connected Splitting-Off Matroids.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Matroid; Mathematics; Combinatorics","score_opus":0.009448339707263968,"score_gpt":0.23767376550698882,"score_spread":0.22822542579972485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574581444","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113488145,0.009920066,0.19686882,0.01180679,0.0038379133,0.000105026666,0.0010696622,0.0005109479,0.66239256],"genre_scores_gemma":[0.79544824,0.011796076,0.10948233,0.0046816394,0.0028787155,0.00015397753,0.0012904116,0.00031978454,0.07394881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999549,0.000110676585,0.00003332717,0.00010424903,0.00014879179,0.00005392053],"domain_scores_gemma":[0.9988714,0.0005305478,0.00008249435,0.00020087608,0.00012524912,0.0001893331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007665283,0.0006405636,0.00057152647,0.0013282025,0.0014397195,0.001845395,0.0013649293,0.001046787,0.013119111],"category_scores_gemma":[0.0024326132,0.0003864716,0.0007219032,0.0018142625,0.0023023142,0.0054463116,0.0032111013,0.0034911362,0.0020856606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051963365,0.00003979043,0.00035528568,0.00013075129,0.000013244068,0.000299305,0.00017868243,0.0017084699,0.0013572806,0.96081567,0.011868268,0.023181304],"study_design_scores_gemma":[0.0000059487934,0.000016411086,0.00023597204,0.000031344098,0.000006565151,0.0002564894,0.00005908805,0.002615209,0.0002613881,0.98040384,0.016100261,0.000007531356],"about_ca_topic_score_codex":0.0012339031,"about_ca_topic_score_gemma":0.0021636167,"teacher_disagreement_score":0.013119111,"about_ca_system_score_codex":0.00090345327,"about_ca_system_score_gemma":0.00047027227,"threshold_uncertainty_score":0.043887794},"labels":[],"label_agreement":null},{"id":"W2574613064","doi":"","title":"On the Laplacian coefficients and Laplacian-like energy of unicyclic graphs with fixed diameter.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Laplace operator; Laplacian matrix; Combinatorics; Pure mathematics; Mathematical analysis","score_opus":0.01578594659760281,"score_gpt":0.24070237171787448,"score_spread":0.22491642512027166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574613064","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73039,0.0074503887,0.08625995,0.0061486783,0.0010473897,0.00004832649,0.0007335829,0.00026095772,0.16766076],"genre_scores_gemma":[0.97851735,0.0021953264,0.005248313,0.00034280054,0.00046890636,0.00004360286,0.00025558093,0.00010581544,0.012822213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975437,0.0000785115,0.000007597598,0.000038561087,0.00006748836,0.00005344291],"domain_scores_gemma":[0.99802953,0.001117702,0.00023850187,0.00013092613,0.00019813346,0.00028524038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005150921,0.0005384738,0.0006264192,0.0026484292,0.0008218486,0.0012107458,0.0014175896,0.0010893184,0.0067792446],"category_scores_gemma":[0.005935153,0.00033794637,0.00028595925,0.0013548881,0.001851194,0.0026885378,0.0014612137,0.0014475866,0.00086597155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003987986,0.000026509226,0.00055606273,0.00007760282,0.0000099064055,0.000103190905,0.00014558899,0.0068837353,0.0015046949,0.97921115,0.004960547,0.0064811828],"study_design_scores_gemma":[0.000016460923,0.000013319544,0.0008121047,0.00004418698,0.000009003692,0.00019578866,0.00016444581,0.03134099,0.0004075003,0.96461,0.0023665375,0.000019651585],"about_ca_topic_score_codex":0.00086350704,"about_ca_topic_score_gemma":0.001155516,"teacher_disagreement_score":0.0067792446,"about_ca_system_score_codex":0.0007299039,"about_ca_system_score_gemma":0.00027007022,"threshold_uncertainty_score":0.022678852},"labels":[],"label_agreement":null},{"id":"W2574648035","doi":"","title":"Sufficient Conditions for Burst Error Identification and Correction in LRTJ-Spaces.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"3D Modeling in Geospatial Applications","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Identification (biology); Burst error; Algorithm; Error detection and correction; Biology; Botany","score_opus":0.011969800497051116,"score_gpt":0.2457449328667265,"score_spread":0.23377513236967537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574648035","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02003091,0.00040951287,0.96979886,0.0007606025,0.000261054,0.000117259726,0.0009078018,0.0005782039,0.007135819],"genre_scores_gemma":[0.74497825,0.0011614087,0.23386839,0.0007013298,0.0007238622,0.0007317299,0.0043074023,0.00068379304,0.012843773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942819,0.0015625644,0.0006145583,0.0011303634,0.0015589877,0.0008516948],"domain_scores_gemma":[0.92828757,0.045923684,0.0053054034,0.0044067376,0.0130778495,0.0029987812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059522116,0.0019005247,0.0026497683,0.0025806269,0.0016460912,0.0038895444,0.0033709544,0.0036117227,0.013279479],"category_scores_gemma":[0.07765092,0.0011486264,0.0020338432,0.0017342874,0.003337603,0.0073078303,0.006979516,0.0052256505,0.0032423572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011732877,0.00040500995,0.006749983,0.0009002457,0.00022790165,0.0016152736,0.0010636479,0.22398165,0.013536882,0.6825878,0.015648097,0.052110255],"study_design_scores_gemma":[0.00008321399,0.00016406235,0.001191015,0.0001997971,0.00006271457,0.00051604456,0.0004847852,0.67695105,0.0073321294,0.3083753,0.0045272186,0.00011273056],"about_ca_topic_score_codex":0.0028487148,"about_ca_topic_score_gemma":0.0025914465,"teacher_disagreement_score":0.013279479,"about_ca_system_score_codex":0.0012735613,"about_ca_system_score_gemma":0.0038285423,"threshold_uncertainty_score":0.044424236},"labels":[],"label_agreement":null},{"id":"W2574656611","doi":"","title":"A Note on Roman Bondage Number of Graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.007521313394551624,"score_gpt":0.2396196506465457,"score_spread":0.23209833725199408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574656611","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05625276,0.01720959,0.11569794,0.0136118485,0.01648976,0.00008217269,0.0009563216,0.0007841706,0.7789154],"genre_scores_gemma":[0.80281836,0.011489492,0.07642316,0.004688423,0.0081332885,0.00026221946,0.00081404543,0.0007192412,0.09465177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989711,0.00032090957,0.000058777903,0.00027775246,0.00025917435,0.00011233767],"domain_scores_gemma":[0.99723464,0.0015592077,0.00019082542,0.00036797862,0.00034148456,0.00030590344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012051245,0.0006180109,0.0009529269,0.0025429633,0.0020093236,0.0026261942,0.001396794,0.0012511916,0.022445865],"category_scores_gemma":[0.0066181296,0.00038683412,0.00069323374,0.0020775225,0.003185135,0.0062035993,0.002533536,0.0036865952,0.0049335193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050010578,0.000014402907,0.00017803317,0.00011565101,0.0000067566066,0.00008011714,0.000113143506,0.0005618493,0.00058211386,0.9741033,0.012159029,0.012035717],"study_design_scores_gemma":[0.000007825303,0.000021123446,0.0002610103,0.000038227226,0.000008453661,0.00015323868,0.000045227687,0.0013620761,0.00041189566,0.959291,0.038381334,0.000018686906],"about_ca_topic_score_codex":0.00083821896,"about_ca_topic_score_gemma":0.0009861623,"teacher_disagreement_score":0.022445865,"about_ca_system_score_codex":0.0011219655,"about_ca_system_score_gemma":0.00061946746,"threshold_uncertainty_score":0.07508886},"labels":[],"label_agreement":null},{"id":"W2574657350","doi":"","title":"Modular Multiplicative Graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Multiplicative function; Modular design; Combinatorics; Programming language; Computer science; Mathematical analysis","score_opus":0.006223955484041117,"score_gpt":0.18980167869536704,"score_spread":0.18357772321132593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574657350","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08846225,0.0037202975,0.16882235,0.005114185,0.001632463,0.00011258844,0.0008249698,0.000623641,0.7306873],"genre_scores_gemma":[0.7625451,0.0023366176,0.035426762,0.002268427,0.0017467159,0.00017489801,0.0007903608,0.00027294323,0.19443817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994553,0.00013193964,0.000019909272,0.00011802318,0.00017668663,0.00009820072],"domain_scores_gemma":[0.99913776,0.0002500648,0.00011557703,0.00016767868,0.00019563842,0.00013324013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047089622,0.0007672814,0.0005110942,0.0020687445,0.0013791347,0.0020241654,0.00070110423,0.00080507493,0.022336528],"category_scores_gemma":[0.0019083105,0.00034546424,0.00064215163,0.00092378596,0.0015422866,0.0033099377,0.002091564,0.0018434356,0.0045984336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009690032,0.000010208229,0.00007866743,0.000018097046,0.0000045887728,0.000030818686,0.000057797715,0.00015938217,0.00047754202,0.98937184,0.0037265162,0.0060548387],"study_design_scores_gemma":[0.000008812463,0.0000125971865,0.00021985153,0.000015694011,0.000010342221,0.00019742445,0.00005546125,0.0018930711,0.0008277407,0.9684948,0.028256075,0.000008109484],"about_ca_topic_score_codex":0.0004455965,"about_ca_topic_score_gemma":0.0008188347,"teacher_disagreement_score":0.022336528,"about_ca_system_score_codex":0.000907232,"about_ca_system_score_gemma":0.0004171865,"threshold_uncertainty_score":0.074723065},"labels":[],"label_agreement":null},{"id":"W2574688825","doi":"","title":"The Co-PI index of some compound graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Pi; Combinatorics; Geometry; Computer science; Programming language","score_opus":0.023316806246669375,"score_gpt":0.2892115971260703,"score_spread":0.26589479087940093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574688825","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51056975,0.0014465918,0.10949088,0.002466546,0.0005638509,0.00011551073,0.0019515092,0.00058057223,0.37281474],"genre_scores_gemma":[0.94572383,0.00067561335,0.02518111,0.00038397263,0.00028034602,0.00010955207,0.0008389969,0.00018633586,0.02662026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995939,0.00007819413,0.000019719693,0.000112065194,0.0001042743,0.00009194061],"domain_scores_gemma":[0.9981931,0.0006213883,0.00036456532,0.00023236651,0.00030869403,0.00027995865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046006354,0.00045000896,0.00056841417,0.0033505668,0.002426134,0.002929962,0.0007894818,0.0010073655,0.01073249],"category_scores_gemma":[0.0024445937,0.00028725996,0.00044194245,0.0024329848,0.0019436299,0.0037180365,0.001240428,0.0017682019,0.001742394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007227851,0.000028053726,0.00090511394,0.00005557282,0.000016213568,0.00019385686,0.00020062491,0.0006768925,0.0022712934,0.9814488,0.004024421,0.010106756],"study_design_scores_gemma":[0.000015006973,0.000019306084,0.001312986,0.000026154084,0.000026444293,0.000510022,0.00020521443,0.0076979753,0.0021474797,0.97542566,0.012597027,0.000016737928],"about_ca_topic_score_codex":0.0010661569,"about_ca_topic_score_gemma":0.0016746394,"teacher_disagreement_score":0.01073249,"about_ca_system_score_codex":0.0013847993,"about_ca_system_score_gemma":0.0006830286,"threshold_uncertainty_score":0.03590381},"labels":[],"label_agreement":null},{"id":"W2574697945","doi":"","title":"Entire Chromatic Number of 1-Tree.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Tree (set theory); Chromatic scale; Combinatorics","score_opus":0.00945424832194002,"score_gpt":0.23234166617233848,"score_spread":0.22288741785039845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574697945","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66800207,0.0019845117,0.076175585,0.0062708706,0.00041143087,0.000078433135,0.004650557,0.0006330275,0.24179351],"genre_scores_gemma":[0.94102234,0.00093158183,0.02441679,0.00064065336,0.00021037039,0.00008341369,0.0023302885,0.00025099094,0.0301137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995565,0.00008466717,0.00001516731,0.00014222134,0.00008535083,0.0001161748],"domain_scores_gemma":[0.99807835,0.0010542138,0.00020333374,0.0002282792,0.00019130661,0.00024454747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047304307,0.00035671124,0.0005161766,0.0014392507,0.0018440859,0.0029222907,0.0013227352,0.0010718263,0.017502159],"category_scores_gemma":[0.0027559928,0.00032105923,0.00044986446,0.0014359321,0.0016035524,0.003914595,0.0012196644,0.0017321405,0.0019506253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028898037,0.00007340659,0.0023113745,0.00025806908,0.000025158883,0.000108557564,0.00035894633,0.008094603,0.0063589755,0.9332723,0.024589233,0.024260307],"study_design_scores_gemma":[0.000050180446,0.000032922573,0.0024890911,0.00005462611,0.000041320473,0.00030119467,0.00024946922,0.027548376,0.0033207177,0.947538,0.018347029,0.000027204484],"about_ca_topic_score_codex":0.002897748,"about_ca_topic_score_gemma":0.004188007,"teacher_disagreement_score":0.017502159,"about_ca_system_score_codex":0.0021445937,"about_ca_system_score_gemma":0.000800791,"threshold_uncertainty_score":0.058550537},"labels":[],"label_agreement":null},{"id":"W2574740122","doi":"","title":"Two-Distance-Transitve Graphs Of Valency 7.","year":2016,"lang":"sl","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Valency; Mathematics; Combinatorics; Linguistics; Philosophy","score_opus":0.015891366817252495,"score_gpt":0.28257321282705694,"score_spread":0.26668184600980444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574740122","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59914637,0.0006023704,0.12104473,0.0029298554,0.0003357172,0.00019198588,0.004229135,0.0008481759,0.2706717],"genre_scores_gemma":[0.9051807,0.00032566383,0.037539013,0.0005044675,0.000082401195,0.00009850617,0.0033798283,0.00019247673,0.052696947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939275,0.00011787204,0.000033744538,0.00015846192,0.00016168071,0.00013553708],"domain_scores_gemma":[0.9976399,0.0008386704,0.00029413143,0.00034582306,0.00045188476,0.00042955606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046152336,0.0006127493,0.00048335214,0.0016320569,0.0019408006,0.002578096,0.0013243834,0.001212459,0.017296154],"category_scores_gemma":[0.002568882,0.00046974065,0.0005753603,0.0015419452,0.0016409172,0.003049951,0.0017980728,0.0019705044,0.003186219],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027462997,0.00010690528,0.0013521424,0.00015975059,0.000043386106,0.0005678869,0.0006174798,0.0014604998,0.0066897487,0.96493804,0.007330381,0.016459182],"study_design_scores_gemma":[0.000059106547,0.000054383418,0.0014308031,0.00005838263,0.000046100413,0.00084901444,0.00063428987,0.00499755,0.0047744517,0.95845234,0.02861585,0.000027690323],"about_ca_topic_score_codex":0.0014568508,"about_ca_topic_score_gemma":0.0026605355,"teacher_disagreement_score":0.017296154,"about_ca_system_score_codex":0.0011288443,"about_ca_system_score_gemma":0.0005897369,"threshold_uncertainty_score":0.057861447},"labels":[],"label_agreement":null},{"id":"W2574832458","doi":"","title":"Size multipartite Ramsey numbers for stripes versus stripes.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Multipartite; Mathematics; Ramsey's theorem; Combinatorics; Quantum mechanics; Physics; Quantum","score_opus":0.03920676454714526,"score_gpt":0.32775415815297604,"score_spread":0.28854739360583076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574832458","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37459728,0.004332266,0.28915167,0.008823506,0.0012942599,0.00015990605,0.0015462433,0.00100917,0.31908572],"genre_scores_gemma":[0.9575833,0.000781545,0.024506012,0.0008370142,0.00036826957,0.00014269062,0.0002529699,0.00020063871,0.015327477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990023,0.00033508154,0.00005378409,0.00017897504,0.00026342395,0.00016640771],"domain_scores_gemma":[0.99456406,0.0030815294,0.0004875883,0.0009795668,0.00042507975,0.0004621133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017420275,0.0003677434,0.00058164936,0.0012781937,0.0013223472,0.0031447487,0.0009439551,0.0011271175,0.014759604],"category_scores_gemma":[0.007998021,0.000391596,0.00043396294,0.0009909048,0.0023140404,0.009141899,0.0030151673,0.0020047629,0.0013467842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010612883,0.000015418542,0.00015461163,0.00006436842,0.000007777635,0.00002912862,0.000088273,0.0013827751,0.001120938,0.98714125,0.004206114,0.0056830593],"study_design_scores_gemma":[0.00001945502,0.000017849967,0.00018189523,0.000026805941,0.000008892998,0.0001199231,0.0000693496,0.0069734254,0.0007195945,0.9874537,0.0043990617,0.000009982242],"about_ca_topic_score_codex":0.0002883831,"about_ca_topic_score_gemma":0.0004360905,"teacher_disagreement_score":0.014759604,"about_ca_system_score_codex":0.0009012063,"about_ca_system_score_gemma":0.00048532768,"threshold_uncertainty_score":0.049375772},"labels":[],"label_agreement":null},{"id":"W2574871842","doi":"","title":"On the f-chromatic class of a multi-wheel graph.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Friendship graph; Class (philosophy); Graph; Combinatorics; Computer science; Artificial intelligence; Voltage graph; Line graph","score_opus":0.017505403492978282,"score_gpt":0.227396045620655,"score_spread":0.20989064212767672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574871842","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6984459,0.0018002755,0.12086407,0.0048247273,0.0003710052,0.00009852736,0.002652057,0.0004916568,0.17045173],"genre_scores_gemma":[0.9554898,0.000841193,0.021124536,0.00048452875,0.00026205607,0.0000837021,0.0011411604,0.0001824987,0.020390544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993494,0.00012688618,0.000020485017,0.00017496991,0.0001074059,0.00022078122],"domain_scores_gemma":[0.99734604,0.0015191734,0.0002762759,0.00026016962,0.00017788296,0.0004204216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072991604,0.00050775777,0.0006543348,0.0027974823,0.0027891528,0.0037006189,0.0016510448,0.0017103862,0.016288245],"category_scores_gemma":[0.003573328,0.00047652563,0.00066061306,0.0020795965,0.0026741745,0.0052800067,0.0018654861,0.0023457464,0.0012949149],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014518164,0.000057642083,0.0022456504,0.000084340114,0.00002071293,0.00006716816,0.00028798787,0.007246397,0.0014399586,0.9617177,0.011736287,0.014950877],"study_design_scores_gemma":[0.000043061915,0.000024540666,0.002552315,0.00006958871,0.000028064514,0.000174443,0.00041699124,0.03565914,0.0011226283,0.94841325,0.011460286,0.000035636178],"about_ca_topic_score_codex":0.009245168,"about_ca_topic_score_gemma":0.009226999,"teacher_disagreement_score":0.016288245,"about_ca_system_score_codex":0.0031529313,"about_ca_system_score_gemma":0.00095368846,"threshold_uncertainty_score":0.054489613},"labels":[],"label_agreement":null},{"id":"W2574924263","doi":"","title":"Two infinite families of Archimedean maps of higher genera.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.023232597137612818,"score_gpt":0.29933537237788627,"score_spread":0.27610277524027343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574924263","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64445806,0.0028151358,0.08519937,0.0018677982,0.00037122474,0.00005781634,0.00038542724,0.00043877686,0.2644065],"genre_scores_gemma":[0.967933,0.00036063627,0.007820616,0.00014662578,0.000086456595,0.000051080762,0.0001501297,0.00006436364,0.023387006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933237,0.00016962049,0.000033845794,0.00010155942,0.00020360145,0.00015900229],"domain_scores_gemma":[0.99823976,0.00087395107,0.00016575599,0.00018316084,0.00022061115,0.00031671146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058968464,0.00046870948,0.00042156086,0.0024688765,0.002650986,0.0026950059,0.00073547685,0.0010181245,0.0065683518],"category_scores_gemma":[0.0029821359,0.0004436399,0.00065008906,0.0009503134,0.002632673,0.004059459,0.0025139435,0.0016081341,0.0006592633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004839789,0.00001770854,0.00044974615,0.00002677638,0.0000065980853,0.00033572072,0.00063892134,0.00031076328,0.00090153195,0.99139506,0.0007582688,0.005110464],"study_design_scores_gemma":[0.000023367067,0.000033625158,0.0013057102,0.000062274514,0.000023276458,0.0010938735,0.00062975695,0.0043582222,0.001867897,0.97426707,0.016310409,0.000024475308],"about_ca_topic_score_codex":0.000638271,"about_ca_topic_score_gemma":0.0007791021,"teacher_disagreement_score":0.0065683518,"about_ca_system_score_codex":0.0013822621,"about_ca_system_score_gemma":0.00042049403,"threshold_uncertainty_score":0.021973312},"labels":[],"label_agreement":null},{"id":"W2574983858","doi":"","title":"Split graphs whose completely regular endomorphisms form a monoid.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Endomorphism; Mathematics; Monoid; Combinatorics; Pure mathematics; Discrete mathematics","score_opus":0.012409645097022711,"score_gpt":0.2139522759062076,"score_spread":0.2015426308091849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574983858","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60193986,0.0011660168,0.28936332,0.0012066842,0.00043147276,0.000099435216,0.00095414295,0.0007994882,0.1040396],"genre_scores_gemma":[0.93786657,0.0002791255,0.036965977,0.0003214227,0.00010375633,0.00008668901,0.0006271101,0.0001289811,0.023620214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993574,0.00014048161,0.00005233973,0.00020692968,0.00013229536,0.00011066054],"domain_scores_gemma":[0.99846953,0.00053881493,0.00020593352,0.0003334967,0.00022871738,0.00022340403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000709038,0.00036421712,0.000477036,0.001202685,0.0014920656,0.0023914317,0.0006004119,0.00085237663,0.0065526986],"category_scores_gemma":[0.0018456515,0.00054104044,0.0007243107,0.00074166636,0.0021465528,0.0050988845,0.0021845605,0.0010299718,0.0012237652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006438796,0.000023495213,0.00059333927,0.00003154883,0.00001320049,0.00021987058,0.00042792843,0.00035380185,0.0025878628,0.9879431,0.0013181934,0.0064232345],"study_design_scores_gemma":[0.000017452712,0.000023440194,0.0004249382,0.000018879451,0.000015781066,0.00037146037,0.0002911225,0.002421927,0.0018657265,0.98660856,0.0079278145,0.000012950387],"about_ca_topic_score_codex":0.00040647291,"about_ca_topic_score_gemma":0.00075013953,"teacher_disagreement_score":0.0065526986,"about_ca_system_score_codex":0.00065823586,"about_ca_system_score_gemma":0.0005371425,"threshold_uncertainty_score":0.021920979},"labels":[],"label_agreement":null},{"id":"W2575008982","doi":"","title":"A new version for Co-PI Iindex of a graph.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pi; Graph; Combinatorics; Geometry","score_opus":0.018288781800409767,"score_gpt":0.2950765841365649,"score_spread":0.27678780233615513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575008982","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0111805145,0.0021148063,0.5514654,0.0034787182,0.016300475,0.00038773555,0.007076135,0.00988349,0.3981127],"genre_scores_gemma":[0.17729819,0.0026689714,0.37377903,0.0044368906,0.004100218,0.0011937226,0.013392678,0.009565851,0.41356453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986633,0.0002145099,0.00010871071,0.00050141354,0.00034325724,0.00016881611],"domain_scores_gemma":[0.998642,0.0002518643,0.00007124581,0.00057075435,0.000342671,0.00012155504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086789863,0.001181481,0.000859925,0.0024685652,0.002469224,0.003792122,0.0019055614,0.0013872881,0.071076505],"category_scores_gemma":[0.0027409159,0.0007666631,0.0014420074,0.002651484,0.0019814218,0.008306594,0.0034019528,0.004131154,0.022535916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015871722,0.00007248512,0.0005135058,0.00034820838,0.000044846103,0.0005946928,0.00051668845,0.000610275,0.0030445484,0.78302646,0.1262441,0.08482544],"study_design_scores_gemma":[0.000023106211,0.00003958569,0.00047728862,0.000073508745,0.00003645435,0.0011648067,0.00014029036,0.0023453983,0.0022598235,0.29601902,0.6973741,0.000046591507],"about_ca_topic_score_codex":0.0019530384,"about_ca_topic_score_gemma":0.0026482719,"teacher_disagreement_score":0.071076505,"about_ca_system_score_codex":0.0010648982,"about_ca_system_score_gemma":0.00080057245,"threshold_uncertainty_score":0.23777461},"labels":[],"label_agreement":null},{"id":"W2575020491","doi":"","title":"The N-Fixed Point Property In Posets.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Property (philosophy); Point (geometry); Combinatorics; Pure mathematics; Geometry","score_opus":0.012704410713185989,"score_gpt":0.22548233324146996,"score_spread":0.21277792252828398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575020491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13558334,0.002533095,0.54000545,0.004657153,0.0007695124,0.0001546928,0.0013653956,0.0010804681,0.3138509],"genre_scores_gemma":[0.9086186,0.0013128684,0.048400648,0.0009959289,0.0006332982,0.00023632565,0.0012777606,0.0003030375,0.038221546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998401,0.00039402576,0.00013689561,0.0005183111,0.00033235401,0.00021748219],"domain_scores_gemma":[0.9956116,0.0025613336,0.00029935144,0.0009043191,0.00038804323,0.00023543467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00153745,0.00062718685,0.0009443725,0.0017278419,0.0023809082,0.0042355135,0.001380884,0.0015507732,0.016438952],"category_scores_gemma":[0.007731517,0.00058808783,0.0017111925,0.0019574612,0.005728413,0.01195079,0.0036711486,0.0031216163,0.0024865367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003085567,0.000015013393,0.00029205304,0.00005227451,0.000009849179,0.00009103205,0.00017452045,0.0006509345,0.00040095358,0.98811454,0.0015371792,0.00863087],"study_design_scores_gemma":[0.000009561838,0.00001588451,0.00013887067,0.000017653487,0.000007895301,0.00013615376,0.000057773148,0.0011675195,0.00039617319,0.9939711,0.0040728115,0.000008670787],"about_ca_topic_score_codex":0.0016087819,"about_ca_topic_score_gemma":0.0016500242,"teacher_disagreement_score":0.016438952,"about_ca_system_score_codex":0.0011755499,"about_ca_system_score_gemma":0.00085792114,"threshold_uncertainty_score":0.05499381},"labels":[],"label_agreement":null},{"id":"W2575136444","doi":"","title":"On the metric dimension of rotationally-symmetric graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Metric dimension; Dimension (graph theory); Metric (unit); Combinatorics; Pure mathematics; Graph; Chordal graph; 1-planar graph; Business","score_opus":0.012809019090368749,"score_gpt":0.22003943117314678,"score_spread":0.20723041208277804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575136444","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6237035,0.008575325,0.19541493,0.014948517,0.00090439525,0.00009963928,0.0025407448,0.00052462146,0.15328835],"genre_scores_gemma":[0.9575159,0.0024861982,0.026347937,0.0008772976,0.0008343938,0.000120719,0.0010418639,0.00017054821,0.010605108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872667,0.0005146588,0.00006063096,0.00022666714,0.00023050662,0.00024095224],"domain_scores_gemma":[0.9928438,0.004312303,0.0008018607,0.000775742,0.0004567971,0.00080946065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015043468,0.00068489416,0.0009388796,0.00242588,0.0021130654,0.0032819237,0.0018583986,0.0019439425,0.0069390847],"category_scores_gemma":[0.009164637,0.000504509,0.0005301213,0.0023890394,0.003666108,0.008731039,0.002905801,0.0026944857,0.001088694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006542755,0.000033506665,0.0008825167,0.00007361256,0.000013556663,0.000036576264,0.00015438058,0.0030928832,0.0005681873,0.977454,0.0072107995,0.010414437],"study_design_scores_gemma":[0.000014215187,0.000013992344,0.0006676683,0.000023756154,0.000010627084,0.00009944922,0.00014261552,0.01266467,0.0003454844,0.9817755,0.004224247,0.000017661903],"about_ca_topic_score_codex":0.0016664665,"about_ca_topic_score_gemma":0.0016373314,"teacher_disagreement_score":0.0069390847,"about_ca_system_score_codex":0.0019414176,"about_ca_system_score_gemma":0.00070161116,"threshold_uncertainty_score":0.023213565},"labels":[],"label_agreement":null},{"id":"W2575159521","doi":"","title":"Star coloring of Cartesian product of paths and cycles.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Mathematics; Star (game theory); Cartesian coordinate system; Product (mathematics); Pure mathematics; Combinatorics; Geometry; Mathematical analysis","score_opus":0.014895824934223171,"score_gpt":0.26191021000611775,"score_spread":0.24701438507189458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575159521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36351416,0.0017120154,0.4640074,0.0011133881,0.0007654588,0.00013560585,0.0015515547,0.0014806809,0.16571973],"genre_scores_gemma":[0.81811255,0.0009738145,0.12090087,0.00035070512,0.00021979699,0.00009762022,0.0014526304,0.00048192672,0.057409983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993624,0.00018481468,0.000035224934,0.00018102462,0.00011449257,0.00012205164],"domain_scores_gemma":[0.99815035,0.00065326545,0.00019905086,0.00034680738,0.00040350243,0.0002470139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050284766,0.00044958515,0.0004888936,0.00093858136,0.0011016845,0.0016926732,0.00063000264,0.0005529085,0.01195111],"category_scores_gemma":[0.00217862,0.00055155944,0.0006512617,0.001352919,0.0014323968,0.002743979,0.0016268573,0.0010887297,0.0020113068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013180799,0.000035750265,0.0009693101,0.00013013356,0.000021406539,0.00023709719,0.00040755494,0.0031076118,0.0031586394,0.9623602,0.00891679,0.020523652],"study_design_scores_gemma":[0.00002822403,0.00006767778,0.0007971719,0.000041752573,0.000035510522,0.0006232169,0.00025118262,0.016170867,0.0035858986,0.94497085,0.033404335,0.00002343635],"about_ca_topic_score_codex":0.0022620556,"about_ca_topic_score_gemma":0.0030983593,"teacher_disagreement_score":0.01195111,"about_ca_system_score_codex":0.0007558953,"about_ca_system_score_gemma":0.000775483,"threshold_uncertainty_score":0.03998047},"labels":[],"label_agreement":null},{"id":"W2575176279","doi":"","title":"Graph Decompositions of K(v, λ) into Modified Triangles Using Langford and Skolem Sequences.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Graph","score_opus":0.013257068528164091,"score_gpt":0.22423441705597388,"score_spread":0.2109773485278098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575176279","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23278038,0.00066683267,0.64602536,0.0006104443,0.000376439,0.00014019117,0.0005226782,0.0010242589,0.11785344],"genre_scores_gemma":[0.75506014,0.00045153085,0.19145314,0.00034721068,0.00013889016,0.00015330884,0.00074905436,0.0006676733,0.050979074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996209,0.000097928554,0.00002539687,0.00007391633,0.00010402721,0.00007774956],"domain_scores_gemma":[0.99921453,0.0002591646,0.00010227305,0.00016970224,0.0001543978,0.000099847326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003459217,0.00035086315,0.0002883402,0.0014987899,0.00077961973,0.0012014827,0.0007154636,0.00057356467,0.011484041],"category_scores_gemma":[0.0019422588,0.0003127756,0.0005261999,0.0007765272,0.0007304452,0.0021988333,0.0011451151,0.0012109322,0.0026611444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011310569,0.00004723025,0.00030202421,0.00007419328,0.000012480587,0.00018856731,0.00048834755,0.003747147,0.0080469195,0.9479591,0.0047497107,0.034271095],"study_design_scores_gemma":[0.000028122815,0.00003880786,0.00046654622,0.000048699454,0.000015094042,0.0003113053,0.00022094038,0.026301157,0.005333232,0.944832,0.022377398,0.00002654613],"about_ca_topic_score_codex":0.00089240936,"about_ca_topic_score_gemma":0.0019366256,"teacher_disagreement_score":0.011484041,"about_ca_system_score_codex":0.00065848435,"about_ca_system_score_gemma":0.0003107595,"threshold_uncertainty_score":0.038417876},"labels":[],"label_agreement":null},{"id":"W2575188506","doi":"","title":"On the signed star domination numbers of trees.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Star (game theory); Combinatorics; Mathematical analysis","score_opus":0.014020620469574039,"score_gpt":0.26280127864075636,"score_spread":0.24878065817118233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575188506","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4460817,0.0040321434,0.23295279,0.0039288667,0.0011920091,0.0001002944,0.0011763579,0.00045391085,0.31008193],"genre_scores_gemma":[0.94074804,0.0019242709,0.030410426,0.0005841317,0.00071122183,0.00013124882,0.0005154145,0.00016845501,0.024806766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991466,0.0002585713,0.000054372296,0.00012408457,0.00026899544,0.00014748778],"domain_scores_gemma":[0.99440837,0.0036846427,0.00056242896,0.00031622575,0.0005452559,0.00048300685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011374245,0.00049721065,0.0005423871,0.0029638405,0.0012013665,0.0028072777,0.0008567525,0.0008573034,0.009676018],"category_scores_gemma":[0.009793424,0.0003040571,0.00035521673,0.0021010533,0.0023702222,0.006804157,0.0016761499,0.002027308,0.0014812689],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080750055,0.000021644866,0.00060162833,0.0000652292,0.0000083514,0.000053793443,0.00019567707,0.002648939,0.0010839704,0.97077495,0.0036982272,0.020766838],"study_design_scores_gemma":[0.000012663455,0.000018951016,0.00046335332,0.00003339588,0.00000706681,0.00010431541,0.00009401276,0.0072470084,0.00057549,0.9860341,0.005395302,0.000014422426],"about_ca_topic_score_codex":0.00074421294,"about_ca_topic_score_gemma":0.0011436009,"teacher_disagreement_score":0.009676018,"about_ca_system_score_codex":0.0011682198,"about_ca_system_score_gemma":0.0005821291,"threshold_uncertainty_score":0.032369494},"labels":[],"label_agreement":null},{"id":"W2575197938","doi":"","title":"Extremal cactuses for the Schultz and modified Schultz indices.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Applied mathematics","score_opus":0.023577891500833704,"score_gpt":0.24419312668460322,"score_spread":0.22061523518376952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575197938","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29289445,0.0051829647,0.28671536,0.006015983,0.0016899053,0.00019896099,0.0012497634,0.0014268922,0.4046258],"genre_scores_gemma":[0.8747708,0.0015800032,0.05249036,0.00092163053,0.001310877,0.0003266889,0.00073372497,0.00069012784,0.06717575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986185,0.00032532492,0.000086627515,0.00020195973,0.0005043423,0.00026314904],"domain_scores_gemma":[0.9954991,0.0022644682,0.00052298856,0.0007196757,0.0005307943,0.00046291223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015823955,0.0007266963,0.0009791347,0.0040958486,0.0023547066,0.004406798,0.001701137,0.001538955,0.024928398],"category_scores_gemma":[0.015206147,0.00043380822,0.00073300407,0.002106529,0.0032269335,0.007069624,0.0035613703,0.004106654,0.0040593008],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003319724,0.000017104534,0.00020910369,0.000024053585,0.000005991003,0.000051209452,0.000076319106,0.000549561,0.0001887326,0.98899347,0.0031735084,0.0066777933],"study_design_scores_gemma":[0.00001864763,0.000012036807,0.00025085127,0.000029048668,0.000010010546,0.00016396986,0.00005588357,0.0057568615,0.00045454325,0.9854998,0.0077276886,0.000020748981],"about_ca_topic_score_codex":0.0008028418,"about_ca_topic_score_gemma":0.001149283,"teacher_disagreement_score":0.024928398,"about_ca_system_score_codex":0.0021092964,"about_ca_system_score_gemma":0.0010217879,"threshold_uncertainty_score":0.08339375},"labels":[],"label_agreement":null},{"id":"W2575220639","doi":"","title":"Arc-Transitive Pentavalent Graphs Of Order Four Times A Prime Power.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Transitive relation; Prime power; Arc (geometry); Prime (order theory); Order (exchange); Combinatorics; Discrete mathematics; Geometry; Business","score_opus":0.013361877877724427,"score_gpt":0.2661985043003224,"score_spread":0.25283662642259797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575220639","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50771046,0.0007378359,0.09857639,0.0020969163,0.0010048272,0.00014806367,0.0023148821,0.0013908028,0.38601986],"genre_scores_gemma":[0.9105915,0.0005832791,0.02487365,0.0004025426,0.00015811538,0.000071394374,0.0016020035,0.00025003165,0.06146744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967,0.0000592025,0.00002005462,0.000079245874,0.00008195439,0.00008950196],"domain_scores_gemma":[0.99878377,0.00043526624,0.00023725667,0.0002173528,0.00014011795,0.00018615741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022861586,0.00038207986,0.00046119682,0.00096866133,0.0013446535,0.0016401754,0.00068054104,0.0004810459,0.01578905],"category_scores_gemma":[0.0014213746,0.00041217628,0.00047949003,0.00087883003,0.0011118307,0.0018096975,0.0012149852,0.0013884373,0.0023710919],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018731912,0.0000617677,0.0007217572,0.00010083902,0.00003350277,0.0008238019,0.0004083511,0.0016976509,0.0077023716,0.96202195,0.009114544,0.017126258],"study_design_scores_gemma":[0.0000408795,0.000061029816,0.00092441204,0.000029984216,0.00004412811,0.00069573894,0.0003113166,0.0043208334,0.0042314418,0.9643939,0.02492472,0.000021553407],"about_ca_topic_score_codex":0.00089716155,"about_ca_topic_score_gemma":0.0016837713,"teacher_disagreement_score":0.01578905,"about_ca_system_score_codex":0.0005401308,"about_ca_system_score_gemma":0.00045152236,"threshold_uncertainty_score":0.05281967},"labels":[],"label_agreement":null},{"id":"W2575238872","doi":"","title":"The 2-color Rado number of x 1 +x 2 +...+x n = y 1 +y 2 +...+y k .","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.004983878370192777,"score_gpt":0.20081233706500365,"score_spread":0.19582845869481086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575238872","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58333987,0.001355449,0.058281142,0.004233906,0.0036795759,0.00016372421,0.00473747,0.0007897643,0.34341913],"genre_scores_gemma":[0.8705514,0.00051545847,0.01960181,0.0006329911,0.00034646882,0.00013106613,0.0016631717,0.00023210116,0.1063255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995547,0.000071539114,0.000019836634,0.00011530307,0.00008800367,0.00015064335],"domain_scores_gemma":[0.99941623,0.00017113319,0.00010411587,0.000087473905,0.00008188546,0.00013920382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035045212,0.00063204806,0.0004236777,0.0013406958,0.0015173134,0.0015172911,0.0005902745,0.0008713607,0.027041828],"category_scores_gemma":[0.0014163185,0.00017767175,0.0003244974,0.000722077,0.0012370145,0.0019136921,0.0010469776,0.00087927026,0.004496191],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015830252,0.00035526656,0.0125101255,0.0005695579,0.00010343462,0.0015737715,0.0008213323,0.0042203916,0.05802328,0.75555557,0.055101734,0.109582484],"study_design_scores_gemma":[0.00017201054,0.0003426784,0.025634676,0.00028989284,0.0001499433,0.0039852588,0.0010401182,0.01644983,0.03845049,0.7120715,0.2011535,0.00026011385],"about_ca_topic_score_codex":0.0006585571,"about_ca_topic_score_gemma":0.001405468,"teacher_disagreement_score":0.027041828,"about_ca_system_score_codex":0.00063237763,"about_ca_system_score_gemma":0.0006829616,"threshold_uncertainty_score":0.09046394},"labels":[],"label_agreement":null},{"id":"W2575287504","doi":"","title":"Full Cycle Extendability of Nearly Claw-Free Graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Claw; Mathematics; Combinatorics; Biology","score_opus":0.012734423601708593,"score_gpt":0.23253393877361603,"score_spread":0.21979951517190743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575287504","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78111756,0.00095325575,0.12987298,0.0013515606,0.000086148226,0.00008892746,0.0019147072,0.00080003426,0.08381485],"genre_scores_gemma":[0.97951025,0.00035831414,0.010261738,0.00021651405,0.000053032643,0.000041063508,0.0010418918,0.000105317646,0.008412041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950933,0.00007187183,0.000024929268,0.00013697834,0.00014498693,0.00011196117],"domain_scores_gemma":[0.9969427,0.0014722325,0.00030867217,0.00060649746,0.00026967784,0.00040021617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040611794,0.00036574618,0.0004234421,0.0010014514,0.0007935578,0.0016477737,0.0010393996,0.0006658565,0.008853725],"category_scores_gemma":[0.0039051792,0.00035605044,0.0005380202,0.0012430903,0.0010633554,0.0040545133,0.0020495339,0.0014026666,0.0006924813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021159422,0.000093610404,0.0029968687,0.00023613551,0.000045049677,0.0004964038,0.0007106707,0.013758055,0.00927703,0.92029846,0.0055677653,0.046308286],"study_design_scores_gemma":[0.000016811633,0.000022340551,0.0011908775,0.000025391904,0.000021914297,0.00037407424,0.00013927218,0.015219578,0.0027504256,0.97463655,0.005587168,0.00001554745],"about_ca_topic_score_codex":0.0014586506,"about_ca_topic_score_gemma":0.0015773162,"teacher_disagreement_score":0.008853725,"about_ca_system_score_codex":0.0005324894,"about_ca_system_score_gemma":0.00042091374,"threshold_uncertainty_score":0.02961868},"labels":[],"label_agreement":null},{"id":"W2575390771","doi":"","title":"Some Notes on Combination Graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.00798137006028041,"score_gpt":0.19765791428804752,"score_spread":0.1896765442277671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575390771","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059046643,0.035132136,0.19254404,0.01221133,0.010092099,0.00012898301,0.0013557215,0.0007320104,0.74189895],"genre_scores_gemma":[0.26672503,0.07442128,0.25194624,0.023518974,0.021679876,0.0008794238,0.003946415,0.0017319482,0.35515085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926025,0.00023452657,0.00004151425,0.0001382575,0.0002597166,0.000065726475],"domain_scores_gemma":[0.9988078,0.0007549896,0.000053030188,0.00017120181,0.00013829075,0.0000747526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010280513,0.0013312934,0.0011088236,0.0036708412,0.0016505168,0.0026753296,0.0017683619,0.0014499733,0.032819122],"category_scores_gemma":[0.0024181423,0.0008039668,0.0012363484,0.004763143,0.0032470669,0.0058595915,0.0021059667,0.005381014,0.007810621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017805554,0.000035756028,0.00007532451,0.00021053318,0.000017545008,0.0002601568,0.00015544395,0.00097356987,0.00044418138,0.92376006,0.046454553,0.0275951],"study_design_scores_gemma":[0.0000045027728,0.0000146666025,0.00016726331,0.000050442835,0.000008094888,0.0002535652,0.000059391536,0.00090027956,0.00019632083,0.88004005,0.11829104,0.000014295216],"about_ca_topic_score_codex":0.0019122371,"about_ca_topic_score_gemma":0.0032412969,"teacher_disagreement_score":0.032819122,"about_ca_system_score_codex":0.0017327962,"about_ca_system_score_gemma":0.0005217462,"threshold_uncertainty_score":0.10979092},"labels":[],"label_agreement":null},{"id":"W2575543966","doi":"","title":"A New Characterization of Disk Graphs and its Application.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Characterization (materials science); Mathematics; Nanotechnology; Materials science","score_opus":0.0057976404057718065,"score_gpt":0.20354795934248932,"score_spread":0.19775031893671752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575543966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081245184,0.009492568,0.71099716,0.0071600857,0.0017195385,0.00021438352,0.0025176655,0.0014224526,0.18523106],"genre_scores_gemma":[0.72973895,0.008881212,0.18016396,0.0032201072,0.0036815272,0.00043579016,0.0028515428,0.0011884047,0.06983855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990409,0.00022834033,0.00006145655,0.00030684148,0.00024707496,0.00011534385],"domain_scores_gemma":[0.9959015,0.0016295612,0.00048674885,0.0007012122,0.0006681034,0.000612838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007123506,0.0010869405,0.00091946346,0.005855787,0.0021177742,0.004083479,0.0019468999,0.0017729222,0.010843005],"category_scores_gemma":[0.007096764,0.00051580893,0.00077646424,0.005675505,0.0030348487,0.009687168,0.0033137752,0.003961241,0.003542714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045217967,0.000045881276,0.00091580756,0.00014297162,0.000013149995,0.0001310467,0.00026483447,0.0020413208,0.0023362525,0.94674206,0.016113348,0.03120803],"study_design_scores_gemma":[0.000011512222,0.000039528026,0.0011645582,0.00008820286,0.000026770702,0.0009696307,0.00040153085,0.023857955,0.0015709418,0.905688,0.066147216,0.00003418126],"about_ca_topic_score_codex":0.0015506727,"about_ca_topic_score_gemma":0.0011602731,"teacher_disagreement_score":0.010843005,"about_ca_system_score_codex":0.0016613187,"about_ca_system_score_gemma":0.00053777825,"threshold_uncertainty_score":0.03627348},"labels":[],"label_agreement":null},{"id":"W2575667298","doi":"","title":"Some sharp bounds for the spectral radius and energy of digraphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; RADIUS; Energy (signal processing); Combinatorics; Physics; Quantum mechanics; Eigenvalues and eigenvectors; Statistics; Computer science","score_opus":0.01940909777052949,"score_gpt":0.26244325084206804,"score_spread":0.24303415307153856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575667298","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14147802,0.027892336,0.60086,0.011274563,0.0012868827,0.00016145581,0.0023965538,0.0010849347,0.21356522],"genre_scores_gemma":[0.85168886,0.013324166,0.09992219,0.0029446855,0.002234461,0.00059568667,0.0014905956,0.00074006687,0.027059373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99799985,0.0006210932,0.0001096703,0.00041077466,0.0005645723,0.0002940841],"domain_scores_gemma":[0.97767526,0.016840717,0.0011947118,0.0014491503,0.0012529861,0.0015871307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028873042,0.0022486795,0.001820716,0.0065264404,0.0019440156,0.0043746494,0.0034442178,0.0031577656,0.015027581],"category_scores_gemma":[0.030050414,0.0012972195,0.001700699,0.004153028,0.004960183,0.009495584,0.004740797,0.007060629,0.0029783866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007159184,0.000051623578,0.00065192295,0.00023944669,0.000051994688,0.00013706826,0.00026376944,0.006736681,0.0016072365,0.966685,0.007936058,0.015567727],"study_design_scores_gemma":[0.00001173336,0.000023322402,0.0006143923,0.00008847885,0.000037031932,0.00024824828,0.000114052884,0.017623967,0.000722101,0.9760543,0.0044333907,0.000028961713],"about_ca_topic_score_codex":0.0007870803,"about_ca_topic_score_gemma":0.0011897223,"teacher_disagreement_score":0.015027581,"about_ca_system_score_codex":0.002540416,"about_ca_system_score_gemma":0.00051723595,"threshold_uncertainty_score":0.050272286},"labels":[],"label_agreement":null},{"id":"W2575764447","doi":"","title":"Zagreb Eccentricity Indices Of Cycles Related Graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eccentricity (behavior); Combinatorics; Political science","score_opus":0.019348562338452426,"score_gpt":0.27305533675254573,"score_spread":0.2537067744140933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575764447","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7566614,0.002190294,0.033851553,0.00060126616,0.00028546323,0.000044144414,0.0009114361,0.0002069861,0.20524752],"genre_scores_gemma":[0.9806786,0.0007601645,0.006592908,0.00008430001,0.00009552114,0.000032797023,0.00043403156,0.000071274466,0.011250382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997482,0.000048676917,0.000014723433,0.00006427142,0.000062351595,0.00006178312],"domain_scores_gemma":[0.9992217,0.00020610163,0.0002048952,0.00009204505,0.00015424231,0.0001210521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003359892,0.00035926796,0.00043424705,0.0028288015,0.0009349296,0.0015222628,0.0005952972,0.00048258033,0.0072445585],"category_scores_gemma":[0.0021268518,0.0001928675,0.00016991273,0.0013244565,0.00088880496,0.0017065746,0.0008790361,0.00078313716,0.0012464563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023355262,0.00004041364,0.004711205,0.00013998298,0.000024019215,0.00024412581,0.00046132965,0.0032396133,0.005505945,0.9407493,0.0045887274,0.04006176],"study_design_scores_gemma":[0.000038587525,0.00006048364,0.010207218,0.00011776821,0.00005918145,0.0010983011,0.00048962113,0.01640285,0.004294392,0.9426843,0.024517905,0.000029429395],"about_ca_topic_score_codex":0.0010330555,"about_ca_topic_score_gemma":0.001303106,"teacher_disagreement_score":0.0072445585,"about_ca_system_score_codex":0.00075574475,"about_ca_system_score_gemma":0.0002486854,"threshold_uncertainty_score":0.024235487},"labels":[],"label_agreement":null},{"id":"W2575829591","doi":"","title":"On Holey Schroder Designs of Type 2 n u 1 .","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Type (biology); Geology","score_opus":0.013861276166547809,"score_gpt":0.21018713694037852,"score_spread":0.1963258607738307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575829591","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4307948,0.0011362357,0.24042581,0.0018280928,0.0009626292,0.00019885362,0.0007851167,0.0005781617,0.3232903],"genre_scores_gemma":[0.91681963,0.00059167814,0.038818248,0.0006979542,0.00023783822,0.00015613838,0.00031896733,0.00014780405,0.0422117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912006,0.00033507025,0.00003379242,0.00010199339,0.00021987356,0.0001891716],"domain_scores_gemma":[0.9985744,0.00066346163,0.00020963945,0.00024423632,0.00018177298,0.0001264808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007733484,0.0005572697,0.00044239368,0.0012066443,0.0014440832,0.0014403565,0.000559089,0.00127736,0.013400974],"category_scores_gemma":[0.002872715,0.00039359773,0.00048756588,0.0006842173,0.0014772515,0.0020168014,0.0014765798,0.0011022823,0.0017190728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075569944,0.000018845287,0.00023894793,0.000040005656,0.000006072717,0.00009874036,0.00014397896,0.0016778675,0.0014954142,0.9869632,0.002464286,0.0067770677],"study_design_scores_gemma":[0.000029236759,0.000045922112,0.00022765671,0.00004292074,0.000007340702,0.00017199105,0.00009847693,0.011419462,0.0015494082,0.9805861,0.0057983133,0.000023211795],"about_ca_topic_score_codex":0.00073395914,"about_ca_topic_score_gemma":0.0016878898,"teacher_disagreement_score":0.013400974,"about_ca_system_score_codex":0.00089108216,"about_ca_system_score_gemma":0.000611983,"threshold_uncertainty_score":0.04483074},"labels":[],"label_agreement":null},{"id":"W2575947678","doi":"","title":"The Characteristic Polynomial of a kind of Hexagonal System and its Application.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Differential Equations and Dynamical Systems","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hexagonal crystal system; Polynomial; Pure mathematics; Mathematical analysis; Crystallography","score_opus":0.014732376627046328,"score_gpt":0.26071602936417854,"score_spread":0.2459836527371322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575947678","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42215717,0.0060783694,0.31208697,0.005390095,0.0021372223,0.00013537503,0.00075229653,0.0004096571,0.2508529],"genre_scores_gemma":[0.9703113,0.0012500668,0.015653854,0.0002226092,0.00046519132,0.000035931072,0.000119650475,0.000047398767,0.011893955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997634,0.00006924603,0.0000094314655,0.000042526663,0.000058025867,0.000057356297],"domain_scores_gemma":[0.99929047,0.00024354336,0.0001227933,0.00008289655,0.000111037916,0.00014927641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036010102,0.00028227727,0.00041742934,0.0016567988,0.0008056275,0.001452452,0.0005899587,0.0007814312,0.006716153],"category_scores_gemma":[0.0030384792,0.0001974149,0.00040449036,0.0010178937,0.001954343,0.0019556177,0.0015424876,0.0013370679,0.00077714305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016729824,0.000008871706,0.00022648116,0.000033444765,0.000004070682,0.000069233836,0.00008890301,0.0019377987,0.00060669304,0.9909218,0.0017438607,0.0043421295],"study_design_scores_gemma":[0.000012858549,0.000019815508,0.00034725267,0.000017117636,0.000005124567,0.00030358523,0.00011551711,0.03004535,0.0003983353,0.9623509,0.0063656503,0.000018429266],"about_ca_topic_score_codex":0.0013791373,"about_ca_topic_score_gemma":0.0010915544,"teacher_disagreement_score":0.006716153,"about_ca_system_score_codex":0.0009749435,"about_ca_system_score_gemma":0.00058596674,"threshold_uncertainty_score":0.022467792},"labels":[],"label_agreement":null},{"id":"W2575960886","doi":"","title":"Adjacent vertex distinguishing total colorings of graphs with four distinguishing constraints.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Graph","score_opus":0.01390378561601815,"score_gpt":0.2102359395646604,"score_spread":0.19633215394864226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575960886","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59441644,0.0007727354,0.27175596,0.002312011,0.00033004992,0.00021741974,0.0037275287,0.0012983711,0.12516949],"genre_scores_gemma":[0.88885254,0.0002871783,0.09173769,0.0004950222,0.000119829994,0.00011854479,0.002527486,0.00029229018,0.015569481],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855274,0.00046373653,0.00009405615,0.00030622625,0.00021965736,0.00036357535],"domain_scores_gemma":[0.9919744,0.0049448153,0.0006205607,0.001389175,0.00041384838,0.00065704295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014849076,0.0007367837,0.0007335652,0.0012843205,0.0020456577,0.0034099778,0.0022205368,0.001333615,0.010731132],"category_scores_gemma":[0.005647963,0.0007064029,0.0009699382,0.0019600182,0.0020419718,0.0041444623,0.0023814894,0.0022436248,0.00093657454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003925293,0.00018789037,0.002629266,0.0002668434,0.000056319986,0.00022189118,0.00041639188,0.017663263,0.004858324,0.92104906,0.013125391,0.039132874],"study_design_scores_gemma":[0.000078251986,0.000051443563,0.0012644368,0.000043019532,0.000056730685,0.00027805116,0.0003036773,0.036744766,0.0032717925,0.94830424,0.009565925,0.000037644313],"about_ca_topic_score_codex":0.0023993864,"about_ca_topic_score_gemma":0.0041601616,"teacher_disagreement_score":0.010731132,"about_ca_system_score_codex":0.0018186294,"about_ca_system_score_gemma":0.0012372808,"threshold_uncertainty_score":0.035899222},"labels":[],"label_agreement":null},{"id":"W2575972686","doi":"","title":"Self Vertex Switchings Of Disconnected Unicyclic Graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Graph","score_opus":0.006945811262195019,"score_gpt":0.21604738241472593,"score_spread":0.20910157115253092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575972686","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84199303,0.00079897564,0.053921603,0.0004992072,0.00021969358,0.00006857376,0.000633464,0.0006481795,0.101217374],"genre_scores_gemma":[0.9878128,0.0001909401,0.0042367834,0.000082634935,0.00004210601,0.000031396343,0.00029612976,0.000050286326,0.007256828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973065,0.00006449028,0.000021423872,0.000060310864,0.00005564285,0.00006744635],"domain_scores_gemma":[0.9984907,0.0006697376,0.00025609447,0.00022718354,0.00013729454,0.00021899512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018944862,0.00023390108,0.0003241919,0.0014164384,0.0008450417,0.0014932745,0.00069991825,0.0007175985,0.006308016],"category_scores_gemma":[0.0022468378,0.0002746002,0.00038308228,0.0006529245,0.00086267805,0.0009765588,0.00093342457,0.00070103206,0.00062613125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024382061,0.00013363441,0.0038547467,0.00016743249,0.000045670415,0.0010741868,0.0007425497,0.024522897,0.0118367,0.9084156,0.0067006154,0.042262156],"study_design_scores_gemma":[0.000061530045,0.00008487398,0.0024684807,0.00005939914,0.000044084896,0.0012122013,0.0005276609,0.12495931,0.006454068,0.85406154,0.010027153,0.000039718376],"about_ca_topic_score_codex":0.0012252942,"about_ca_topic_score_gemma":0.0017046551,"teacher_disagreement_score":0.006308016,"about_ca_system_score_codex":0.0006886005,"about_ca_system_score_gemma":0.00025061675,"threshold_uncertainty_score":0.021102428},"labels":[],"label_agreement":null},{"id":"W2576211327","doi":"","title":"A note on the existence of cyclic and 1-rotational kite systems.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Control and Dynamics of Mobile Robots","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Kite; Mathematics; Pure mathematics; Geometry","score_opus":0.007347365203135568,"score_gpt":0.2016063958732483,"score_spread":0.19425903067011274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576211327","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09737242,0.0110896155,0.2915431,0.0055565313,0.0040827906,0.00011250564,0.00089053327,0.00062433275,0.5887282],"genre_scores_gemma":[0.8479348,0.008184605,0.08384671,0.0021331809,0.0016643073,0.00019707174,0.0008351521,0.0003210483,0.054883163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995764,0.00008188367,0.000027042985,0.00011530842,0.00012342507,0.000075952856],"domain_scores_gemma":[0.9985648,0.0008090645,0.00014008228,0.00020798182,0.00014392636,0.00013413328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005205331,0.00052516616,0.0004897037,0.0012186489,0.0012497212,0.0015626351,0.00078452093,0.0009814766,0.015867297],"category_scores_gemma":[0.0036656098,0.0003985883,0.0006839764,0.0007464514,0.0028321568,0.0029266025,0.0035326234,0.0021613499,0.0021816948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017725491,0.0000072333523,0.00013670728,0.000114779345,0.000006304435,0.00014438148,0.00015665496,0.00072064035,0.001223388,0.9829282,0.004664175,0.009879762],"study_design_scores_gemma":[0.000008193639,0.000038368562,0.00040300068,0.000047277204,0.000009932946,0.0004485333,0.00008543294,0.0030644806,0.0008124407,0.9574299,0.03762204,0.00003053008],"about_ca_topic_score_codex":0.00077234826,"about_ca_topic_score_gemma":0.00092268514,"teacher_disagreement_score":0.015867297,"about_ca_system_score_codex":0.00047048094,"about_ca_system_score_gemma":0.00044094658,"threshold_uncertainty_score":0.053081393},"labels":[],"label_agreement":null},{"id":"W2576212255","doi":"","title":"Some Recurrence Relations For q-Bernoulli Numbers And Polynomials.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Recurrence relation; Bernoulli's principle; Bernoulli number; Bernoulli polynomials; Pure mathematics; Combinatorics; Algebra over a field; Discrete mathematics; Orthogonal polynomials; Difference polynomials; Physics","score_opus":0.03452984200485717,"score_gpt":0.3131882864558034,"score_spread":0.27865844445094623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576212255","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15163434,0.040322144,0.32441822,0.013172414,0.0037178125,0.00015255404,0.0017340226,0.00057276146,0.46427566],"genre_scores_gemma":[0.8375552,0.0116947675,0.068908945,0.0020755709,0.0030468153,0.0002561914,0.0008813095,0.0002658183,0.07531536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993755,0.00017697911,0.00004861415,0.00008629626,0.00022777141,0.00008485965],"domain_scores_gemma":[0.9986965,0.00062710885,0.00020464185,0.00010726511,0.00025536382,0.00010907177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014571769,0.00066825893,0.0006126974,0.0025662526,0.001538875,0.0023756418,0.00086949795,0.00094435184,0.009812504],"category_scores_gemma":[0.005877947,0.00041737827,0.00078004925,0.002451564,0.0019970834,0.0036750068,0.0013047595,0.0026392983,0.0028682386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006481389,0.0000063263947,0.000111658774,0.000027998973,0.0000029693012,0.00005637934,0.00012943248,0.0002800868,0.00024171533,0.9912225,0.0028378135,0.0050766245],"study_design_scores_gemma":[0.0000045549177,0.000005673376,0.00015844576,0.000016917167,0.000004537095,0.00011847499,0.0000362655,0.0019739459,0.00012779512,0.99177814,0.0057660313,0.000009187343],"about_ca_topic_score_codex":0.0017223466,"about_ca_topic_score_gemma":0.002407269,"teacher_disagreement_score":0.009812504,"about_ca_system_score_codex":0.0017000086,"about_ca_system_score_gemma":0.00067618943,"threshold_uncertainty_score":0.032826126},"labels":[],"label_agreement":null},{"id":"W2576293399","doi":"","title":"The Randic Indices of Trees, Unicyclic Graphs and Bicyclic Graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.01795614051698622,"score_gpt":0.2702494665088186,"score_spread":0.25229332599183235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576293399","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34142348,0.022030765,0.103195235,0.003687618,0.001623956,0.00008766014,0.0014639732,0.00045540585,0.5260319],"genre_scores_gemma":[0.931118,0.005339332,0.022978673,0.0005776496,0.00068422646,0.00008991723,0.0005146259,0.00014138035,0.038556274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995604,0.00012778584,0.000027450262,0.00008698935,0.000120663266,0.00007673892],"domain_scores_gemma":[0.99871933,0.0004878817,0.00028373557,0.00015797367,0.00017469241,0.00017643653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000493617,0.00054575107,0.00055593066,0.0030808335,0.001031479,0.0024422887,0.00075812225,0.0007423925,0.006716977],"category_scores_gemma":[0.004194031,0.00039419098,0.00026498106,0.0018864213,0.0020428086,0.0031329244,0.001420326,0.001576242,0.0014498382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003471905,0.000008446978,0.00030704934,0.000042284824,0.0000052466485,0.000039262148,0.0001501581,0.00070459256,0.00055801275,0.9810463,0.0036446513,0.013459303],"study_design_scores_gemma":[0.000012870743,0.000015496398,0.00056928315,0.000042628777,0.000009781513,0.00022125401,0.00018217241,0.0031883512,0.0004356316,0.978542,0.01676541,0.000015057919],"about_ca_topic_score_codex":0.0010965478,"about_ca_topic_score_gemma":0.0018012801,"teacher_disagreement_score":0.006716977,"about_ca_system_score_codex":0.00071592804,"about_ca_system_score_gemma":0.0004082937,"threshold_uncertainty_score":0.022470474},"labels":[],"label_agreement":null},{"id":"W2576301321","doi":"","title":"Intersections Of Sets Expressible As Unions Of k Starshaped Sets.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.009149818768164878,"score_gpt":0.22147172630488673,"score_spread":0.21232190753672187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576301321","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34189174,0.0018924294,0.44340608,0.0010057677,0.0003467018,0.00020486565,0.0039039196,0.0018686133,0.2054799],"genre_scores_gemma":[0.87361056,0.00055384956,0.0917624,0.0001814489,0.00015842955,0.00018061603,0.002824281,0.00031919582,0.03040919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99725974,0.00050649606,0.0002792475,0.0006200233,0.0008270289,0.00050742505],"domain_scores_gemma":[0.9960461,0.0019142868,0.00056075613,0.0005887894,0.0006130416,0.0002769392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068863004,0.0004731933,0.0006494608,0.0026353449,0.0027874878,0.0056040413,0.0017653133,0.0011437061,0.016341446],"category_scores_gemma":[0.0054191044,0.0007997783,0.0011259275,0.0033143817,0.0018278288,0.006780664,0.0036892632,0.0017981149,0.0035427255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041944755,0.00008317128,0.0020327892,0.0001721547,0.000061636005,0.0006780269,0.00079587783,0.0062621953,0.005453838,0.95532775,0.004133091,0.02458001],"study_design_scores_gemma":[0.000041385636,0.00005781037,0.001643882,0.00014774929,0.00007521386,0.001698711,0.0013100347,0.031148614,0.014108088,0.91062707,0.039067857,0.000073547664],"about_ca_topic_score_codex":0.0011329203,"about_ca_topic_score_gemma":0.0015129513,"teacher_disagreement_score":0.016341446,"about_ca_system_score_codex":0.0014812237,"about_ca_system_score_gemma":0.0007476427,"threshold_uncertainty_score":0.054667592},"labels":[],"label_agreement":null},{"id":"W2576316065","doi":"","title":"Bicoloured ordered trees, non-nesting partitions and non-crossing partitions.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Nesting (process); Combinatorics","score_opus":0.020219836248142803,"score_gpt":0.28565529809543233,"score_spread":0.2654354618472895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576316065","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46510464,0.0041767317,0.27215523,0.0013567837,0.0007720248,0.00013787652,0.0013329715,0.0011459698,0.2538177],"genre_scores_gemma":[0.87738705,0.0010896729,0.06913868,0.0005502968,0.00025370944,0.00008112831,0.0014340203,0.00038685772,0.049678646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995535,0.000087157314,0.000028385732,0.00010282234,0.00011672184,0.00011141798],"domain_scores_gemma":[0.99859124,0.00044889632,0.0002352137,0.00031538442,0.00017020156,0.00023903835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034247478,0.0003187438,0.00041985678,0.0012468809,0.0016409719,0.0022577539,0.00091794564,0.0008417415,0.010298649],"category_scores_gemma":[0.002250669,0.000479758,0.00045263264,0.0015721127,0.0017097765,0.0030212868,0.0014022285,0.0016076113,0.0019900308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009822279,0.00004224707,0.00075171574,0.00010304739,0.000012742158,0.00037054418,0.00043001055,0.0015750988,0.0033132888,0.9658194,0.0052110613,0.022272633],"study_design_scores_gemma":[0.0000142104755,0.000024650115,0.0009887142,0.00005566157,0.000017915032,0.00066419464,0.00033535156,0.005868363,0.001284085,0.9725873,0.0181412,0.00001828054],"about_ca_topic_score_codex":0.001375777,"about_ca_topic_score_gemma":0.0032458862,"teacher_disagreement_score":0.010298649,"about_ca_system_score_codex":0.0006263416,"about_ca_system_score_gemma":0.00036485938,"threshold_uncertainty_score":0.03445238},"labels":[],"label_agreement":null},{"id":"W2576372907","doi":"","title":"The expected values of Wiener indices in random polygonal chains.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Wiener index; Statistics; Statistical physics; Combinatorics; Physics","score_opus":0.017863348482778093,"score_gpt":0.2776032679613792,"score_spread":0.2597399194786011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576372907","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6286707,0.0018381649,0.33042797,0.0021267945,0.00039973634,0.00013742589,0.0012285073,0.00062622793,0.03454451],"genre_scores_gemma":[0.96854454,0.0010284926,0.019807262,0.00018538299,0.00025336893,0.00019442853,0.0005800674,0.00023474735,0.009171655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984181,0.00051319116,0.00008364838,0.0002846613,0.00040403777,0.00029632263],"domain_scores_gemma":[0.9781934,0.014271603,0.002308503,0.0017855876,0.0014192731,0.0020216685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003787618,0.0009783356,0.0014188071,0.0040113046,0.0010550327,0.0040560253,0.003027557,0.002572479,0.00923587],"category_scores_gemma":[0.037982855,0.0011170715,0.0008806747,0.0017171542,0.004726166,0.008306539,0.0026313434,0.0025311897,0.001297161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016065908,0.00006080538,0.0023288743,0.0001502229,0.0000602913,0.00029253127,0.00016599956,0.023494871,0.0022833105,0.9627828,0.0019145778,0.006305099],"study_design_scores_gemma":[0.000037081485,0.000054059034,0.0016640481,0.00009880911,0.000036488877,0.00032082616,0.00012692642,0.1524771,0.0020309205,0.8418611,0.0012282958,0.00006429908],"about_ca_topic_score_codex":0.0006116999,"about_ca_topic_score_gemma":0.0007549875,"teacher_disagreement_score":0.00923587,"about_ca_system_score_codex":0.0017490658,"about_ca_system_score_gemma":0.0007034959,"threshold_uncertainty_score":0.030897021},"labels":[],"label_agreement":null},{"id":"W2576508672","doi":"","title":"Relationship Among Binomial Coefficients, Bernoulli Numbers And Stirling Numbers.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Stirling numbers of the first kind; Central binomial coefficient; Binomial coefficient; Stirling numbers of the second kind; Stirling number; Bernoulli number; Bernoulli's principle; Binomial (polynomial); Negative binomial distribution; Binomial distribution; Stirling engine; Gaussian binomial coefficient; Statistics; Applied mathematics; Discrete mathematics; Poisson distribution; Thermodynamics; Physics","score_opus":0.009916082234162073,"score_gpt":0.25099274554221374,"score_spread":0.24107666330805166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576508672","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26333222,0.060109157,0.2105712,0.012358377,0.0033645458,0.00011013698,0.0011106167,0.00046706985,0.44857663],"genre_scores_gemma":[0.9045584,0.017973693,0.030715285,0.0012906763,0.003166604,0.00013771205,0.000461714,0.00014089179,0.041555014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990324,0.0003397229,0.000052146814,0.00013778191,0.0003097806,0.00012824267],"domain_scores_gemma":[0.98964465,0.0071412777,0.0014069984,0.0003563884,0.0009514336,0.00049924594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015734185,0.00070587324,0.00088278804,0.0052722334,0.0015533867,0.004049829,0.0009801367,0.0011294564,0.010178705],"category_scores_gemma":[0.01948193,0.00058927224,0.00042922952,0.003997752,0.0037996378,0.006420849,0.0018182565,0.0031585146,0.0017811813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013540289,0.000009499321,0.00031926314,0.000033850254,0.0000047953035,0.000049102317,0.000076819015,0.00037732796,0.00014593797,0.9932915,0.0015367505,0.004141533],"study_design_scores_gemma":[0.000005798061,0.000007711496,0.00031442265,0.000026493017,0.0000071811833,0.00015954541,0.00004419786,0.0023471327,0.000082208986,0.9931138,0.0038784996,0.000012937526],"about_ca_topic_score_codex":0.0013323812,"about_ca_topic_score_gemma":0.0014366385,"teacher_disagreement_score":0.010178705,"about_ca_system_score_codex":0.0011551259,"about_ca_system_score_gemma":0.0008528824,"threshold_uncertainty_score":0.03405118},"labels":[],"label_agreement":null},{"id":"W2576520705","doi":"","title":"Some Results On The Exterior Degree Of Extra-Special Groups.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Geometry","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Pure mathematics; Acoustics","score_opus":0.045591821442282535,"score_gpt":0.2827488907228221,"score_spread":0.2371570692805396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576520705","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27945352,0.012113345,0.086419456,0.0071987547,0.0016386252,0.000051510066,0.00081734045,0.00032708602,0.6119803],"genre_scores_gemma":[0.93832946,0.005476153,0.010050007,0.0010135745,0.0017284739,0.00003503496,0.00061205256,0.00020498845,0.042550273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933165,0.00015886122,0.000039497325,0.00013045651,0.00021893889,0.000120461475],"domain_scores_gemma":[0.99759394,0.00083297206,0.00028101698,0.00033961446,0.00032058088,0.0006317915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014244526,0.0010347422,0.0008718532,0.004002918,0.001352769,0.002219469,0.0012925867,0.00074653537,0.014704809],"category_scores_gemma":[0.0037960368,0.00040020377,0.0007605619,0.0023033263,0.004131062,0.0067219865,0.0034380122,0.0032816664,0.0020519842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046053516,0.0000402909,0.00096441776,0.00013893833,0.000014953071,0.00015575589,0.00031393056,0.00079847086,0.0010699244,0.9848683,0.0025720675,0.009016782],"study_design_scores_gemma":[0.000010890515,0.000022870872,0.0012494483,0.00003518027,0.000019514793,0.0002763503,0.00013052308,0.0018449525,0.0007283059,0.98483616,0.0108329635,0.000012708986],"about_ca_topic_score_codex":0.0004771277,"about_ca_topic_score_gemma":0.00066676806,"teacher_disagreement_score":0.014704809,"about_ca_system_score_codex":0.00085357385,"about_ca_system_score_gemma":0.00037583485,"threshold_uncertainty_score":0.04919243},"labels":[],"label_agreement":null},{"id":"W2576544016","doi":"","title":"Error location technique in RT-spaces.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Statistics; Algorithm","score_opus":0.014294148111065242,"score_gpt":0.24833246340266574,"score_spread":0.2340383152916005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576544016","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037061037,0.00030608266,0.98622406,0.0002360498,0.00024141493,0.000036065816,0.00012358816,0.0022599446,0.0068666707],"genre_scores_gemma":[0.28873837,0.00081758015,0.6692234,0.00049101544,0.00037742898,0.00023540255,0.00066593505,0.001746801,0.037704032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99630094,0.0009901902,0.00032919637,0.00060962763,0.0013774444,0.0003924999],"domain_scores_gemma":[0.99265313,0.0018485878,0.00049041875,0.003695383,0.0010913451,0.00022116966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020846673,0.0010886773,0.0012958896,0.0014575351,0.0012835354,0.0026894035,0.003077935,0.0016441529,0.016593115],"category_scores_gemma":[0.011204234,0.0005261204,0.0010698482,0.0019016104,0.0020867614,0.005754733,0.006328256,0.0032280323,0.00974597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007480075,0.00013708229,0.00079348456,0.000592176,0.00012671681,0.00044910828,0.0005496862,0.048513297,0.01598629,0.65249014,0.020421943,0.25919205],"study_design_scores_gemma":[0.0001013502,0.00027010022,0.00029397567,0.00018234599,0.00009284855,0.00079854147,0.0002405088,0.32797226,0.049754605,0.56051457,0.05967948,0.00009947563],"about_ca_topic_score_codex":0.00096107007,"about_ca_topic_score_gemma":0.0010332144,"teacher_disagreement_score":0.016593115,"about_ca_system_score_codex":0.00089978974,"about_ca_system_score_gemma":0.0013801503,"threshold_uncertainty_score":0.055509567},"labels":[],"label_agreement":null},{"id":"W2576567135","doi":"","title":"On the forcing connected geodetic number and the connected geodetic number of a graph.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Geodetic datum; Mathematics; Graph; Geodesy; Forcing (mathematics); Combinatorics; Geology; Mathematical analysis","score_opus":0.011563575579334354,"score_gpt":0.26113307531360913,"score_spread":0.24956949973427478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576567135","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43313527,0.0057346984,0.18330422,0.013055135,0.001433907,0.00011608866,0.0014829902,0.00042684277,0.36131075],"genre_scores_gemma":[0.9428039,0.0025758098,0.021725068,0.0014949951,0.0015018098,0.00017342914,0.00074079714,0.00015606696,0.028828163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992237,0.00024133625,0.00003747753,0.00018117981,0.00017002114,0.00014622281],"domain_scores_gemma":[0.99332654,0.004526942,0.00055961905,0.000477655,0.0004419744,0.0006673315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010529431,0.0005468899,0.00096183625,0.0033786832,0.0026492747,0.0025178168,0.0012261441,0.0018011722,0.012644407],"category_scores_gemma":[0.0074428045,0.0004587417,0.0007667318,0.0026559934,0.0058533945,0.0076090125,0.0034610117,0.0031085191,0.0013727419],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030697127,0.0000107224,0.00030147997,0.000038122216,0.0000055250534,0.000049232993,0.00012142582,0.0012120202,0.00026873781,0.99198407,0.0023662893,0.0036117681],"study_design_scores_gemma":[0.000010225777,0.000009810344,0.00042266038,0.000020686348,0.0000078297135,0.00008068319,0.00007612975,0.0027953177,0.00014656111,0.9925955,0.0038231374,0.000011375815],"about_ca_topic_score_codex":0.0019237493,"about_ca_topic_score_gemma":0.0022683297,"teacher_disagreement_score":0.012644407,"about_ca_system_score_codex":0.0018962286,"about_ca_system_score_gemma":0.0007255919,"threshold_uncertainty_score":0.042299747},"labels":[],"label_agreement":null},{"id":"W2576592240","doi":"","title":"The least eigenvalues of unicyclic graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Combinatorics; Physics","score_opus":0.026438428088549515,"score_gpt":0.2854146394425249,"score_spread":0.25897621135397536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576592240","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59707564,0.0036359583,0.14876823,0.0047884765,0.0010155867,0.00009327313,0.0016056987,0.0008997191,0.24211748],"genre_scores_gemma":[0.9646391,0.0010970241,0.012035934,0.0003198724,0.00034074113,0.00009112789,0.00037746548,0.00014362323,0.020955095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962544,0.000095837444,0.000016243966,0.00007970452,0.000107663254,0.00007523523],"domain_scores_gemma":[0.99811053,0.00087275024,0.0003360995,0.00015661129,0.00023904977,0.0002849905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002740196,0.00053069816,0.00046614217,0.0023361803,0.0009582133,0.002217282,0.0006589257,0.000939566,0.011825802],"category_scores_gemma":[0.0046872227,0.0003661926,0.00025460243,0.0010143544,0.0016703956,0.0019617071,0.0014102121,0.0013161803,0.0021433136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015267584,0.000040436444,0.00085779035,0.0001994952,0.000020593536,0.00022648278,0.00042137146,0.0030354126,0.0063877837,0.9447316,0.013920856,0.030005591],"study_design_scores_gemma":[0.000030068908,0.000020180916,0.0006767101,0.00005112874,0.000010295801,0.00031794052,0.00028075682,0.008384374,0.0016930132,0.9828237,0.0056947083,0.000017111435],"about_ca_topic_score_codex":0.00051682594,"about_ca_topic_score_gemma":0.00079857465,"teacher_disagreement_score":0.011825802,"about_ca_system_score_codex":0.00059249956,"about_ca_system_score_gemma":0.00030453317,"threshold_uncertainty_score":0.03956127},"labels":[],"label_agreement":null},{"id":"W2576723902","doi":"","title":"Non-commuting graphs of AC-groups are End-regular.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Pure mathematics","score_opus":0.020355608782329206,"score_gpt":0.2541177820364858,"score_spread":0.23376217325415657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576723902","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6011424,0.0006895414,0.17187518,0.0009927143,0.00045964035,0.00012224582,0.0005354748,0.0010442741,0.22313854],"genre_scores_gemma":[0.9690708,0.0002009733,0.010171417,0.00018124419,0.00020488263,0.000053675405,0.00032308482,0.0001367722,0.019657098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881065,0.00027913527,0.00007728963,0.00030635123,0.0002829678,0.00024353301],"domain_scores_gemma":[0.9967001,0.0010134815,0.00056981615,0.00054661784,0.0006088403,0.0005611511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000993431,0.00056196545,0.0006009727,0.001853578,0.0019649803,0.0030442874,0.0009027034,0.0007052775,0.011425775],"category_scores_gemma":[0.0024438761,0.00037875056,0.0007432916,0.0008930247,0.0033153885,0.005395895,0.001975948,0.0014609395,0.0017381469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051419556,0.000030818872,0.0005241604,0.000035027024,0.000010076311,0.00011819434,0.00024587693,0.00020053888,0.0010319771,0.9928987,0.0008289532,0.004024136],"study_design_scores_gemma":[0.000015831343,0.000021304579,0.00052974024,0.000010497843,0.000014825127,0.00022970315,0.0002047149,0.001436109,0.0013380705,0.9924919,0.0036966016,0.000010800198],"about_ca_topic_score_codex":0.00056495896,"about_ca_topic_score_gemma":0.00085505494,"teacher_disagreement_score":0.011425775,"about_ca_system_score_codex":0.0006262186,"about_ca_system_score_gemma":0.0004426894,"threshold_uncertainty_score":0.03822297},"labels":[],"label_agreement":null},{"id":"W2576942642","doi":"","title":"On the powers of the k-Fibonacci numbers.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Mathematics; Arithmetic; Combinatorics; Discrete mathematics","score_opus":0.007151738338645538,"score_gpt":0.2392803938707626,"score_spread":0.23212865553211706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576942642","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06130031,0.026405467,0.16298304,0.006967604,0.0059775584,0.00006149616,0.0005702199,0.00029466333,0.73543954],"genre_scores_gemma":[0.8166753,0.014366733,0.04992632,0.0032839975,0.005944385,0.00018897488,0.00044105484,0.00033234322,0.10884083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999079,0.00028658978,0.000058653215,0.00012092128,0.00030786797,0.00014701202],"domain_scores_gemma":[0.9978029,0.0012557554,0.00017659634,0.00022436412,0.000367964,0.00017227401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012674568,0.0010363439,0.0009003609,0.0029930808,0.0023988935,0.0038960846,0.0009291547,0.001164281,0.013936112],"category_scores_gemma":[0.006318483,0.0005368006,0.0007787658,0.001911894,0.005372861,0.008561977,0.0018074294,0.0031697673,0.004995115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001040696,0.0000038385424,0.000037509122,0.000023112732,0.0000025573763,0.000040254617,0.00007629228,0.00023728139,0.00012737681,0.99306536,0.0025235442,0.0038523995],"study_design_scores_gemma":[0.0000034341801,0.000004281976,0.000049586288,0.000019499943,0.000001928268,0.00006274581,0.000025080077,0.0005915442,0.00006951596,0.9925828,0.0065848595,0.0000048353368],"about_ca_topic_score_codex":0.0011526956,"about_ca_topic_score_gemma":0.0014670045,"teacher_disagreement_score":0.013936112,"about_ca_system_score_codex":0.0012106173,"about_ca_system_score_gemma":0.000664782,"threshold_uncertainty_score":0.046620905},"labels":[],"label_agreement":null},{"id":"W2576978445","doi":"","title":"Some graft transformations and its applications on Q-spectral radius of a graph.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; Graph; Combinatorics; Discrete mathematics; Physics; Eigenvalues and eigenvectors; Quantum mechanics","score_opus":0.018500576086869135,"score_gpt":0.26643793374277375,"score_spread":0.2479373576559046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576978445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24510816,0.0121602295,0.56936085,0.0036077227,0.0012617565,0.0001160496,0.0004543469,0.0008250338,0.16710584],"genre_scores_gemma":[0.897944,0.0056062676,0.06844098,0.00070580404,0.0013414222,0.00015359465,0.00030024233,0.0003346348,0.025172982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994325,0.0002100238,0.000025353489,0.0001470946,0.00011462177,0.00007039318],"domain_scores_gemma":[0.99854904,0.0006642733,0.00018053091,0.00016572137,0.00019937911,0.00024097787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094606285,0.00056904106,0.00068237574,0.0027785404,0.0012172798,0.0014204592,0.0010119085,0.0010862594,0.005842434],"category_scores_gemma":[0.0042426526,0.00026902067,0.0009011088,0.0019431305,0.002486293,0.002799521,0.0019194429,0.0023671102,0.0013860745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035504258,0.000035807912,0.00045439863,0.00007511035,0.000011619819,0.000086062886,0.00026246987,0.0031790943,0.0021941713,0.97224885,0.0028627627,0.01855409],"study_design_scores_gemma":[0.000010603147,0.000046465,0.00059015845,0.00002865775,0.000019887726,0.00022850708,0.00020671515,0.028117262,0.0012011982,0.96043795,0.009085762,0.000026838126],"about_ca_topic_score_codex":0.0010331706,"about_ca_topic_score_gemma":0.0006950526,"teacher_disagreement_score":0.005842434,"about_ca_system_score_codex":0.00096213835,"about_ca_system_score_gemma":0.0003680098,"threshold_uncertainty_score":0.019544959},"labels":[],"label_agreement":null},{"id":"W2576980341","doi":"","title":"The weight distributions of some binary cyclic codes.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Binary number; Arithmetic","score_opus":0.007962786466257624,"score_gpt":0.220176913721359,"score_spread":0.2122141272551014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576980341","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78749686,0.0013135665,0.13055085,0.0032773523,0.0002269346,0.000101544574,0.0017335737,0.00028058983,0.075018734],"genre_scores_gemma":[0.9786592,0.00080594514,0.006790989,0.00025447892,0.00029660546,0.00012769672,0.00055842,0.00010262227,0.012403927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988788,0.0003272724,0.00004107576,0.00013132679,0.0003624942,0.00025910966],"domain_scores_gemma":[0.99462104,0.003009466,0.00074085116,0.0004991971,0.00063688733,0.0004926482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013328817,0.0006403603,0.00041995465,0.0029000083,0.00088754785,0.0021111348,0.0011164485,0.0010516649,0.006990116],"category_scores_gemma":[0.011462987,0.00044662796,0.00041741127,0.0020697794,0.002173126,0.0027499148,0.0016260783,0.0015871389,0.0010088221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008102225,0.000022848166,0.00061758043,0.000034161432,0.000009440216,0.000070985654,0.0001508894,0.0039461832,0.0015074292,0.98448724,0.001823385,0.007248817],"study_design_scores_gemma":[0.00003477331,0.000025798336,0.0008808595,0.00003938048,0.000009777453,0.00018196434,0.000077397184,0.037272207,0.0013237298,0.9569847,0.0031390542,0.000030394156],"about_ca_topic_score_codex":0.00096905004,"about_ca_topic_score_gemma":0.000669323,"teacher_disagreement_score":0.006990116,"about_ca_system_score_codex":0.0014677249,"about_ca_system_score_gemma":0.00083099987,"threshold_uncertainty_score":0.023384213},"labels":[],"label_agreement":null},{"id":"W2577201559","doi":"","title":"On some results for the L(2, 1)-labeling on Cartesian sum graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cartesian product; Combinatorics; Cartesian coordinate system; Geometry","score_opus":0.017062799840080124,"score_gpt":0.2378321075969568,"score_spread":0.22076930775687667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577201559","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082299665,0.011316987,0.3630613,0.023976026,0.0025010877,0.0002849436,0.0027649135,0.0018546905,0.5119403],"genre_scores_gemma":[0.5813949,0.017180279,0.24959762,0.016040577,0.0051913704,0.0011242137,0.0052538523,0.0019527969,0.12226433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980038,0.00058833184,0.00011958262,0.000417933,0.00045040963,0.00041991202],"domain_scores_gemma":[0.99196726,0.005335029,0.00051300036,0.00095063285,0.0005547761,0.00067930535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030032136,0.0016071345,0.0020264469,0.0045088334,0.0049333367,0.005964395,0.003791677,0.003999575,0.025615254],"category_scores_gemma":[0.010889244,0.0013418269,0.0023892508,0.0070184553,0.0055600237,0.014279624,0.0061682872,0.009544423,0.0058884467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008281148,0.00010183393,0.00041737454,0.00029595976,0.000021638667,0.00011514507,0.00034116697,0.0022240698,0.0008239656,0.95657116,0.021135574,0.017869232],"study_design_scores_gemma":[0.000017939428,0.000020899359,0.0003265271,0.00007279576,0.000025969544,0.00013077991,0.00013108109,0.0038080935,0.00046387667,0.98207444,0.012905861,0.0000217484],"about_ca_topic_score_codex":0.0035742295,"about_ca_topic_score_gemma":0.0040787384,"teacher_disagreement_score":0.025615254,"about_ca_system_score_codex":0.0036002432,"about_ca_system_score_gemma":0.0017399688,"threshold_uncertainty_score":0.08569151},"labels":[],"label_agreement":null},{"id":"W2577225865","doi":"","title":"Some New Finite Sums Involving Generalized Fibonacci And Lucas Numbers.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Lucas number; Mathematics; Lucas sequence; Fibonacci polynomials; Pisano period; Combinatorics; Discrete mathematics; Classical orthogonal polynomials; Orthogonal polynomials","score_opus":0.012363694871278648,"score_gpt":0.257145658567716,"score_spread":0.24478196369643734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577225865","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3521042,0.015017881,0.20508663,0.0032143788,0.0042511863,0.00021963529,0.0009272223,0.0008240384,0.41835484],"genre_scores_gemma":[0.784802,0.0037456893,0.10171944,0.0012211386,0.0022124492,0.00029352275,0.00062410656,0.00041163014,0.10497008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994326,0.00012508045,0.00004870445,0.00008220284,0.00021871661,0.00009262166],"domain_scores_gemma":[0.99909484,0.00037108496,0.00012953831,0.00009736377,0.00017373497,0.00013333495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075024855,0.0009598159,0.000807554,0.003650582,0.0025657867,0.0036149533,0.0012099204,0.0013448584,0.010384413],"category_scores_gemma":[0.0033616885,0.00058916333,0.001066421,0.0021488848,0.0024552878,0.0045713857,0.002090588,0.0019434608,0.0020263493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002260578,0.000015813303,0.00014495355,0.00008554324,0.0000089959985,0.0003432312,0.00016319776,0.000493891,0.0010528492,0.9868558,0.0023196065,0.008493495],"study_design_scores_gemma":[0.0000081493645,0.000014120643,0.0001877755,0.000037393347,0.000015319996,0.00077910017,0.00008837295,0.00275652,0.0008670107,0.98089933,0.0143234655,0.00002336448],"about_ca_topic_score_codex":0.00036826666,"about_ca_topic_score_gemma":0.001083084,"teacher_disagreement_score":0.010384413,"about_ca_system_score_codex":0.001146398,"about_ca_system_score_gemma":0.0006320667,"threshold_uncertainty_score":0.034739316},"labels":[],"label_agreement":null},{"id":"W2577240032","doi":"","title":"On the weight distributions of some q-ary cyclic codes.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.00941256638059285,"score_gpt":0.21472464694898438,"score_spread":0.20531208056839154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577240032","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.785374,0.0015690873,0.15617113,0.0039343173,0.0002142712,0.000089913294,0.0011408002,0.0002439551,0.051262524],"genre_scores_gemma":[0.9815965,0.00110483,0.0073944777,0.00031895118,0.0003563113,0.00014339025,0.0004315084,0.000097453725,0.008556469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986772,0.00043684343,0.000044058757,0.00015079875,0.0003659084,0.00032511176],"domain_scores_gemma":[0.9911623,0.0058099814,0.0009886948,0.00066001806,0.00071127526,0.0006677144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021097248,0.0007687679,0.000694186,0.0029965704,0.0013030147,0.0023832675,0.0014472578,0.0011625455,0.005767693],"category_scores_gemma":[0.014734843,0.00057166023,0.00048619305,0.0022661854,0.0034397969,0.0040454064,0.0023138092,0.0023193704,0.0009369668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008728351,0.00002635657,0.0007013945,0.000032245167,0.000009388318,0.000069200796,0.00018463949,0.004758905,0.0011715393,0.98573446,0.001639713,0.0055848123],"study_design_scores_gemma":[0.000035529345,0.000025102749,0.0006205159,0.0000439683,0.000008074643,0.00015024035,0.00009659922,0.03566026,0.00072757434,0.9609297,0.0016744179,0.000027963735],"about_ca_topic_score_codex":0.001129472,"about_ca_topic_score_gemma":0.0007904898,"teacher_disagreement_score":0.005767693,"about_ca_system_score_codex":0.0015571172,"about_ca_system_score_gemma":0.0009904847,"threshold_uncertainty_score":0.019294918},"labels":[],"label_agreement":null},{"id":"W2577346904","doi":"","title":"p-Factor-Criticality of Vertex-Transitive Graphs with Large Girth.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Girth (graph theory); Transitive relation; Vertex (graph theory); Odd graph; Criticality; Discrete mathematics; Chordal graph; Graph; 1-planar graph; Physics","score_opus":0.01251476753406263,"score_gpt":0.2697306604009778,"score_spread":0.2572158928669152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577346904","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7774879,0.0013385921,0.106200546,0.0020331459,0.00022700631,0.00014180217,0.0012593236,0.000976645,0.11033516],"genre_scores_gemma":[0.98699236,0.00034987522,0.006714453,0.00017357078,0.000110291265,0.00004646765,0.00043681735,0.000116060095,0.005060187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945265,0.000111837435,0.000023516272,0.00014310215,0.00011365876,0.00015521406],"domain_scores_gemma":[0.99475276,0.0026234195,0.0007367736,0.00055162905,0.0004872889,0.0008481325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005651356,0.00056878076,0.0006721036,0.001947454,0.0015018514,0.0025408997,0.00096944947,0.0010015654,0.009444021],"category_scores_gemma":[0.007334056,0.00047911907,0.0005748062,0.0009651392,0.0026014564,0.0030579315,0.0016975881,0.0015960969,0.0011138555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029855254,0.00006585429,0.003087552,0.00019398193,0.00004378115,0.00067471043,0.0005651221,0.0064653954,0.005953518,0.95874494,0.009183818,0.014722779],"study_design_scores_gemma":[0.000040723713,0.000027205953,0.00071241066,0.000034304936,0.000021847634,0.0004809469,0.00021627633,0.013013722,0.0018842713,0.9802831,0.0032707353,0.000014294753],"about_ca_topic_score_codex":0.0015331986,"about_ca_topic_score_gemma":0.0014573281,"teacher_disagreement_score":0.009444021,"about_ca_system_score_codex":0.0010272958,"about_ca_system_score_gemma":0.0006634605,"threshold_uncertainty_score":0.031593442},"labels":[],"label_agreement":null},{"id":"W2577370094","doi":"","title":"The extremal unicyclic graphs with perfect matching with respect to Hosoya index and Merrifield-Simmons index.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Combinatorics; Matching (statistics); Discrete mathematics; Statistics; Computer science","score_opus":0.015420698856087477,"score_gpt":0.2593853055955942,"score_spread":0.2439646067395067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577370094","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7755178,0.0016602215,0.038968146,0.0013390821,0.0002054677,0.000078646764,0.0010159921,0.00036694086,0.18084772],"genre_scores_gemma":[0.9893528,0.0003187702,0.004324829,0.000095086514,0.00007952394,0.000024424427,0.00024833877,0.00002305135,0.005533108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995983,0.00009002309,0.000019739009,0.00007876478,0.00010577159,0.000107322354],"domain_scores_gemma":[0.99879336,0.00036473363,0.00028804786,0.00017171966,0.00015738838,0.0002247756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039237173,0.00027317784,0.00046528445,0.0019949735,0.0013606973,0.0017819428,0.00077003776,0.0009094948,0.006501885],"category_scores_gemma":[0.0033751687,0.00026193098,0.0002641585,0.0013353111,0.0011593308,0.0021544562,0.0012098138,0.0009014794,0.0005934414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001934531,0.000026823654,0.0012512119,0.00007817471,0.000017231716,0.00023779756,0.00023650413,0.002714316,0.0022459128,0.9720025,0.0040841885,0.016911993],"study_design_scores_gemma":[0.00005529849,0.000048086516,0.0026796462,0.000050252467,0.00003308495,0.0007413523,0.00035348092,0.016395304,0.0023642418,0.9685883,0.0086560855,0.000034888628],"about_ca_topic_score_codex":0.0011252756,"about_ca_topic_score_gemma":0.0015092511,"teacher_disagreement_score":0.006501885,"about_ca_system_score_codex":0.00077462586,"about_ca_system_score_gemma":0.00050445687,"threshold_uncertainty_score":0.021750987},"labels":[],"label_agreement":null},{"id":"W2577373033","doi":"","title":"Total-Kernel in Oriented Circular Ladder and Mobius Ladder.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Kernel (algebra); Pure mathematics","score_opus":0.008527677432932096,"score_gpt":0.23090681403188262,"score_spread":0.22237913659895053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577373033","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4892157,0.00107693,0.341379,0.00075294805,0.00031553817,0.00006564909,0.0003813721,0.000997731,0.16581525],"genre_scores_gemma":[0.91829425,0.00036997267,0.032347653,0.00018361407,0.00009788921,0.00004853161,0.00018986728,0.0002818377,0.048186418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997595,0.000044798904,0.000011132308,0.00003441566,0.00006942369,0.00008066756],"domain_scores_gemma":[0.99953794,0.00008800194,0.000060885817,0.000081063845,0.00009129547,0.00014079579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002827241,0.00026816843,0.00045132654,0.0011273683,0.00096462015,0.001440222,0.0006686224,0.00054228364,0.010872878],"category_scores_gemma":[0.0011940474,0.00020242123,0.0004553159,0.00059530686,0.0012065454,0.0020259097,0.0013579897,0.00081355416,0.001665549],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032765096,0.000018753482,0.00021905972,0.000028927288,0.0000049159576,0.00006596776,0.00007533245,0.0014430674,0.0009078746,0.98944026,0.0015604157,0.006202668],"study_design_scores_gemma":[0.00001857707,0.000028303235,0.00037107538,0.000019354899,0.00000987081,0.00021355106,0.00010620605,0.02734436,0.0011355081,0.96421224,0.0065287356,0.000012262439],"about_ca_topic_score_codex":0.0011445922,"about_ca_topic_score_gemma":0.0016109976,"teacher_disagreement_score":0.010872878,"about_ca_system_score_codex":0.00076798437,"about_ca_system_score_gemma":0.00046917124,"threshold_uncertainty_score":0.036373377},"labels":[],"label_agreement":null},{"id":"W2577380394","doi":"","title":"Hamiltonicity of L 1 -Graphs with Bounded Dilworth Numbers.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bounded function; Combinatorics; Discrete mathematics","score_opus":0.004813174688535074,"score_gpt":0.17729504520789352,"score_spread":0.17248187051935845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577380394","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6780896,0.00079070975,0.11998535,0.0019482797,0.00018082315,0.00010613605,0.0008262491,0.00042660595,0.19764629],"genre_scores_gemma":[0.971545,0.00019304623,0.0068316604,0.00027542844,0.000051907416,0.00006104324,0.00024586075,0.000045606055,0.020750457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996878,0.00009853928,0.000012885713,0.000049205948,0.00006232774,0.00008924383],"domain_scores_gemma":[0.9983102,0.00090174144,0.000312351,0.00012674241,0.00016545973,0.00018351647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027028171,0.0002997872,0.00024599396,0.0014012975,0.0009033228,0.0015135169,0.00061343913,0.00071186846,0.010156736],"category_scores_gemma":[0.0022340075,0.00027125934,0.00023307718,0.00063895754,0.0011516107,0.0014332347,0.001008406,0.0007657533,0.0010643501],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059701946,0.000022200215,0.00050123775,0.00004142123,0.000006521463,0.0001538865,0.00019447382,0.0023376988,0.0028739655,0.98440427,0.0027216063,0.0066829603],"study_design_scores_gemma":[0.000028758144,0.000023689101,0.0006377277,0.000022946013,0.0000075029043,0.00014042605,0.00018450826,0.014529427,0.0016580179,0.978381,0.004370879,0.000015245859],"about_ca_topic_score_codex":0.001697038,"about_ca_topic_score_gemma":0.0028357059,"teacher_disagreement_score":0.010156736,"about_ca_system_score_codex":0.0010643034,"about_ca_system_score_gemma":0.0004650736,"threshold_uncertainty_score":0.033977628},"labels":[],"label_agreement":null},{"id":"W2577389189","doi":"","title":"Enumeration of the degree sequences of 3-connected graphs and cactus graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Enumeration; Mathematics; Cactus; Degree (music); Combinatorics; Biology; Botany; Physics","score_opus":0.026795077744073213,"score_gpt":0.2623174185012079,"score_spread":0.23552234075713466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577389189","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67415524,0.0013207822,0.14125283,0.0016574522,0.00035816315,0.00019169887,0.005180262,0.0010243434,0.17485929],"genre_scores_gemma":[0.8652818,0.0008152818,0.09719385,0.00038749105,0.00011477012,0.00018016706,0.0056478605,0.00026268134,0.030116027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996019,0.00010015569,0.000026112526,0.00007756618,0.000118044205,0.00007624575],"domain_scores_gemma":[0.9983713,0.00079043966,0.00017337354,0.00020332827,0.00027421935,0.0001872887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002640122,0.00042877154,0.00034744633,0.0021543321,0.0009847502,0.0013809043,0.0008064455,0.00080805353,0.011510244],"category_scores_gemma":[0.0031639799,0.0003073965,0.00037919852,0.002192299,0.0007330872,0.0018796417,0.00085162,0.001118329,0.0015470432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031697896,0.00015391447,0.0045413417,0.00033372274,0.00003423779,0.0003716963,0.0008674182,0.012079459,0.01120602,0.81959605,0.019351926,0.13114733],"study_design_scores_gemma":[0.00003327681,0.00005316792,0.0033846796,0.00013472559,0.000026099147,0.00062570255,0.00044647293,0.041918557,0.007566396,0.91014934,0.035626788,0.00003478319],"about_ca_topic_score_codex":0.0018319408,"about_ca_topic_score_gemma":0.0032260704,"teacher_disagreement_score":0.011510244,"about_ca_system_score_codex":0.00082123955,"about_ca_system_score_gemma":0.0006351392,"threshold_uncertainty_score":0.038505614},"labels":[],"label_agreement":null},{"id":"W2577405957","doi":"","title":"Rainbow vertex connection number of dense and sparse graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Connection (principal bundle); Mathematics; Vertex (graph theory); Rainbow; Combinatorics; Dense graph; Graph; Chordal graph; 1-planar graph; Geometry; Physics; Optics","score_opus":0.015736897010209912,"score_gpt":0.2748202763442786,"score_spread":0.25908337933406866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577405957","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87853646,0.001243648,0.03416906,0.0014441147,0.00025717245,0.000041585008,0.0023239711,0.00045292944,0.08153096],"genre_scores_gemma":[0.9894684,0.0003149815,0.004955929,0.000071367474,0.00008131733,0.000027272492,0.00061952206,0.000054353455,0.004406936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996037,0.00008362393,0.000017910215,0.00010725969,0.00009421632,0.00009333515],"domain_scores_gemma":[0.996588,0.0019027487,0.0004711392,0.0002642167,0.00024213284,0.00053170533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005349855,0.0003181982,0.000386878,0.0024821043,0.0009584512,0.0015603,0.0009954191,0.000728538,0.011467083],"category_scores_gemma":[0.005002441,0.00030779294,0.0002713791,0.0015293836,0.0011833631,0.0029049625,0.0010742724,0.0009206013,0.00078741525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006849961,0.00010862959,0.009765416,0.00030212058,0.000057116988,0.00027901167,0.00045721966,0.012874876,0.007738519,0.90225434,0.022223933,0.04325385],"study_design_scores_gemma":[0.000074681186,0.00007620085,0.008880066,0.00007024994,0.0000732486,0.00068460725,0.00035617716,0.056844953,0.0037123556,0.9204974,0.0086850375,0.000045019642],"about_ca_topic_score_codex":0.0009510833,"about_ca_topic_score_gemma":0.0014529846,"teacher_disagreement_score":0.011467083,"about_ca_system_score_codex":0.0009128142,"about_ca_system_score_gemma":0.0004426362,"threshold_uncertainty_score":0.03836119},"labels":[],"label_agreement":null},{"id":"W2577482927","doi":"","title":"On a vertex-degree-based graph invariant and the multiplicatively weighted Harary index.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Invariant (physics); Combinatorics; Graph; Degree (music); Discrete mathematics","score_opus":0.027440102128969506,"score_gpt":0.25850233515611726,"score_spread":0.23106223302714776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577482927","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5023936,0.0018566434,0.26366812,0.0019278364,0.001170891,0.00007841795,0.0005988216,0.00045250639,0.22785312],"genre_scores_gemma":[0.95551974,0.000731417,0.017870134,0.00043267853,0.00079126033,0.000060041115,0.00027600164,0.00019965453,0.024118947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924964,0.00017357373,0.000034451492,0.00018189,0.00022282547,0.00013757696],"domain_scores_gemma":[0.9979735,0.0006018222,0.00045973057,0.0003389524,0.00027101766,0.00035497794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072812155,0.0004236111,0.0005755454,0.0026242377,0.0013860606,0.0017997529,0.0013234572,0.0008170459,0.008498058],"category_scores_gemma":[0.003329522,0.00020906143,0.0005650648,0.0013654754,0.0023576017,0.004867094,0.001974199,0.0016708068,0.0012704664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002173711,0.000016821983,0.00017096828,0.000016862301,0.0000055309574,0.00003539413,0.00006561754,0.00086051173,0.0012530263,0.9909496,0.0011360034,0.0054680505],"study_design_scores_gemma":[0.000007716028,0.000025506486,0.00045868984,0.000011212001,0.000009250991,0.000110290785,0.000047398305,0.006744224,0.0006244705,0.9884179,0.0035291049,0.000014256384],"about_ca_topic_score_codex":0.00063058623,"about_ca_topic_score_gemma":0.0007491901,"teacher_disagreement_score":0.008498058,"about_ca_system_score_codex":0.00075354206,"about_ca_system_score_gemma":0.00031732116,"threshold_uncertainty_score":0.028428793},"labels":[],"label_agreement":null},{"id":"W2577524466","doi":"","title":"The Number of 1-Factors and Edge-Colorings of Mobius Ladder Graphs and Triangular Embeddings of K 12m+7 .","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Artificial intelligence; Computer science","score_opus":0.009000792358095562,"score_gpt":0.22869143161383748,"score_spread":0.21969063925574192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577524466","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91809285,0.00061479554,0.023602549,0.0019448779,0.00016361356,0.000031455413,0.0011998585,0.00022195047,0.05412807],"genre_scores_gemma":[0.97627664,0.00023811588,0.008256256,0.00017168812,0.00008136297,0.0000404693,0.0006525305,0.00009095247,0.014192058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926025,0.0001732934,0.000048304013,0.00017010634,0.00014446462,0.00020349106],"domain_scores_gemma":[0.9965397,0.0015112394,0.0007144508,0.00036227016,0.00026396263,0.00060838833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000710319,0.0005130055,0.0004689137,0.0014330852,0.001743968,0.0034296676,0.0013958339,0.0012875262,0.0152368415],"category_scores_gemma":[0.003605485,0.00043980582,0.00057882,0.0010189683,0.002459971,0.003348351,0.0013393965,0.0011667719,0.0013871362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008577905,0.000132424,0.0072097005,0.00025163114,0.000049415703,0.00022515793,0.0008348306,0.0068745236,0.011875768,0.9326938,0.0118374005,0.027157502],"study_design_scores_gemma":[0.000066498695,0.00007232987,0.005030953,0.000072275885,0.00005388619,0.0004611718,0.0006187068,0.020115139,0.006544183,0.9576015,0.0093068145,0.000056535613],"about_ca_topic_score_codex":0.0014277622,"about_ca_topic_score_gemma":0.002635771,"teacher_disagreement_score":0.0152368415,"about_ca_system_score_codex":0.0014737387,"about_ca_system_score_gemma":0.0007112761,"threshold_uncertainty_score":0.050972342},"labels":[],"label_agreement":null},{"id":"W2577529735","doi":"","title":"A new class of 2-fold perfect 4-splitting authentication codes.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Fold (higher-order function); Class (philosophy); Authentication (law); Discrete mathematics; Combinatorics; Computer science; Computer security; Programming language; Artificial intelligence","score_opus":0.010592016452183836,"score_gpt":0.22818995684599572,"score_spread":0.2175979403938119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577529735","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5356807,0.001778348,0.2545354,0.0022113714,0.0009086301,0.00036474894,0.0018258914,0.0018950575,0.20079976],"genre_scores_gemma":[0.94390017,0.00050820474,0.026522446,0.00049878977,0.00021419961,0.00017471297,0.0008225414,0.00013747148,0.02722134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992428,0.00012400482,0.00005040181,0.0001420901,0.00024054605,0.00020023741],"domain_scores_gemma":[0.998362,0.0004349281,0.00027271174,0.00050872116,0.00018130346,0.00024046445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005255791,0.0005482704,0.0005049302,0.0013580932,0.001396981,0.0018152713,0.000674534,0.0012212784,0.011622422],"category_scores_gemma":[0.0021463986,0.00032146994,0.0006645819,0.0010677761,0.0016578039,0.002618798,0.0023098665,0.0015307086,0.002487185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026328067,0.00005913737,0.001017489,0.00010999249,0.000020318239,0.00044200255,0.0003280852,0.0044033146,0.009276747,0.9345045,0.0076817023,0.041893344],"study_design_scores_gemma":[0.00007805723,0.00012179043,0.0010208072,0.00006858825,0.000025707843,0.001547267,0.00015401187,0.02631228,0.0070724864,0.92781156,0.03571906,0.00006840325],"about_ca_topic_score_codex":0.0004796197,"about_ca_topic_score_gemma":0.00046560413,"teacher_disagreement_score":0.011622422,"about_ca_system_score_codex":0.00069174945,"about_ca_system_score_gemma":0.0010401714,"threshold_uncertainty_score":0.038880885},"labels":[],"label_agreement":null},{"id":"W2577532128","doi":"","title":"Permutation Tableaux, Restricted Set Partitions and Labeled Dyck Paths.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Permutation (music); Combinatorics; Mathematics; Set (abstract data type); Computer science; Physics; Programming language","score_opus":0.03514428821858141,"score_gpt":0.30224586356293986,"score_spread":0.26710157534435847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577532128","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2126091,0.0043621818,0.30837473,0.0029191438,0.0011073727,0.00014306833,0.0027239167,0.0009483239,0.46681216],"genre_scores_gemma":[0.8416115,0.001793999,0.058833364,0.00070170674,0.00025363686,0.000156104,0.0014634988,0.00031003298,0.09487612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957925,0.00012062952,0.000022059843,0.00009241034,0.000105872205,0.00007983654],"domain_scores_gemma":[0.999332,0.00035111626,0.000078679695,0.000101477664,0.00006351752,0.00007328831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043068168,0.00045599218,0.00047935755,0.0009270939,0.0012256526,0.002507107,0.00076222746,0.0008434834,0.013654312],"category_scores_gemma":[0.0018590956,0.00040073003,0.0004660913,0.0013446439,0.0018792758,0.003736334,0.0015420516,0.0019997994,0.0023394558],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023183386,0.0000074069935,0.000054694116,0.000017972057,0.0000025580775,0.000045136185,0.000052229127,0.0005930327,0.00032930463,0.99261236,0.0017359904,0.0045260717],"study_design_scores_gemma":[0.000010102153,0.000007923739,0.00009239116,0.000012520501,0.000004623092,0.00008167032,0.000041803756,0.0020546757,0.0003672038,0.9898325,0.0074868184,0.000007815397],"about_ca_topic_score_codex":0.0015415208,"about_ca_topic_score_gemma":0.003075633,"teacher_disagreement_score":0.013654312,"about_ca_system_score_codex":0.0012578233,"about_ca_system_score_gemma":0.0005554064,"threshold_uncertainty_score":0.045678258},"labels":[],"label_agreement":null},{"id":"W2577568408","doi":"","title":"Regular sparse anti-magic squares with maximum density.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Magic square; MAGIC (telescope); Combinatorics; Astrophysics; Physics","score_opus":0.009486961630083644,"score_gpt":0.201786901499796,"score_spread":0.19229993986971236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577568408","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28376892,0.0016203735,0.5758057,0.004197221,0.00042975397,0.00017016342,0.0025602982,0.0011550039,0.13029258],"genre_scores_gemma":[0.76975393,0.0006185841,0.19772878,0.001017321,0.00026389916,0.0002264146,0.0015220194,0.00037189704,0.02849721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908996,0.00032849115,0.000039310424,0.00019049432,0.00023582947,0.00011598312],"domain_scores_gemma":[0.99555725,0.0028120908,0.0003738999,0.00060505705,0.00038307506,0.00026865356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076298724,0.0005300026,0.00086758245,0.0008219151,0.0009417349,0.0016803137,0.0014785103,0.0013627763,0.009261649],"category_scores_gemma":[0.007906132,0.0006776445,0.00049113727,0.0012190917,0.0015691157,0.0027893267,0.0019413022,0.001690483,0.0016689411],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029580778,0.00007761155,0.00082903926,0.00030694326,0.000043440992,0.00015674524,0.00020085493,0.022426646,0.0049425107,0.90904796,0.021489661,0.04018286],"study_design_scores_gemma":[0.000075530814,0.000034787423,0.00041920066,0.000040716608,0.000017967193,0.00028455598,0.00011996071,0.08652311,0.0021736284,0.90261424,0.007675443,0.000020851454],"about_ca_topic_score_codex":0.0010074889,"about_ca_topic_score_gemma":0.0019577127,"teacher_disagreement_score":0.009261649,"about_ca_system_score_codex":0.0006700314,"about_ca_system_score_gemma":0.0006796965,"threshold_uncertainty_score":0.03098327},"labels":[],"label_agreement":null},{"id":"W2577597520","doi":"","title":"Stirling numbers and some partial sums of powers and products.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Stirling numbers of the first kind; Stirling numbers of the second kind; Stirling engine; Stirling number; Arithmetic; Pure mathematics; Thermodynamics","score_opus":0.02339746354596504,"score_gpt":0.28788136559110294,"score_spread":0.2644839020451379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577597520","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2166375,0.021160936,0.1357567,0.0057799025,0.0023647808,0.000074410804,0.00078894413,0.00035818564,0.6170786],"genre_scores_gemma":[0.84787583,0.0077409265,0.04238143,0.0010664522,0.002536631,0.00012421233,0.00051579846,0.00017535433,0.09758334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993094,0.00015786651,0.000052244563,0.000094923955,0.0002758284,0.00010970053],"domain_scores_gemma":[0.99862134,0.0006324832,0.00020713094,0.00012913976,0.00022708027,0.0001827729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001305376,0.00092812,0.0007832346,0.0035615766,0.0020178305,0.0045137354,0.0008348118,0.00080737623,0.009034001],"category_scores_gemma":[0.0047262805,0.00055518455,0.0009565495,0.0029137488,0.0037301322,0.0067939498,0.0019063833,0.0027196321,0.0021176129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000949734,0.000004716803,0.00005970624,0.000019023222,0.0000031657394,0.000030104264,0.00007006698,0.0001283734,0.00013328457,0.99587554,0.0008562485,0.0028102146],"study_design_scores_gemma":[0.0000037611055,0.000008891367,0.00011884043,0.000013162762,0.0000063208104,0.00011270906,0.00004598863,0.0008044157,0.00018509748,0.9930448,0.0056475233,0.000008449778],"about_ca_topic_score_codex":0.00088188803,"about_ca_topic_score_gemma":0.0015185326,"teacher_disagreement_score":0.009034001,"about_ca_system_score_codex":0.0012129061,"about_ca_system_score_gemma":0.0007681344,"threshold_uncertainty_score":0.03022176},"labels":[],"label_agreement":null},{"id":"W2577800761","doi":"","title":"On the Q-index and index of triangle-free quasi-tree graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Combinatorics; Tree (set theory); Discrete mathematics; Computer science","score_opus":0.0168470497386582,"score_gpt":0.25894127368911746,"score_spread":0.24209422395045926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577800761","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47640088,0.0050543393,0.23728886,0.004818039,0.0012925462,0.00012025344,0.0014084859,0.00061745575,0.27299902],"genre_scores_gemma":[0.93669087,0.0022656515,0.030569538,0.00089018245,0.0008813315,0.00010947306,0.000773606,0.00037913406,0.027440222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993387,0.00016720821,0.000037784823,0.00011348876,0.00020214528,0.00014064857],"domain_scores_gemma":[0.9949468,0.0027958746,0.0006439226,0.0004875292,0.0005387573,0.0005871588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010897326,0.000421057,0.00074886496,0.002592989,0.0017508226,0.0030462733,0.001533999,0.0012171941,0.010377755],"category_scores_gemma":[0.006791598,0.00042373146,0.00051323563,0.002303916,0.002799557,0.0076864613,0.002015649,0.0021027124,0.0019436085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000764946,0.000026832653,0.0005414471,0.000046580444,0.000005897269,0.00007892988,0.00023911531,0.0009368205,0.0010985011,0.98430806,0.0033968987,0.009244262],"study_design_scores_gemma":[0.000012271469,0.000012707264,0.00036514646,0.000020110041,0.0000067622677,0.00012956404,0.00009965779,0.0046149376,0.00037130225,0.9910772,0.0032801658,0.000010065684],"about_ca_topic_score_codex":0.0017747588,"about_ca_topic_score_gemma":0.0019016195,"teacher_disagreement_score":0.010377755,"about_ca_system_score_codex":0.0013793934,"about_ca_system_score_gemma":0.0006937158,"threshold_uncertainty_score":0.034717083},"labels":[],"label_agreement":null},{"id":"W2577826848","doi":"","title":"A Note on the Adjacent Vertex Distinguishing Total Chromatic Number of Some Cubic Graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics; Vertex (graph theory); Foster graph; Discrete mathematics; Graph; Line graph; Graph power","score_opus":0.011676787735977972,"score_gpt":0.2346533021200371,"score_spread":0.22297651438405913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577826848","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36143512,0.0088954065,0.20226184,0.017344788,0.005229851,0.00016339878,0.0023172756,0.0011546976,0.4011976],"genre_scores_gemma":[0.9074154,0.0024702768,0.06773093,0.0017976103,0.0013711555,0.00009833333,0.00079935323,0.00024633872,0.018070558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991473,0.00016028037,0.000036828074,0.00032532928,0.00021187477,0.00011840387],"domain_scores_gemma":[0.99620926,0.0024781292,0.0002130902,0.00054022606,0.00026263038,0.00029670203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010244313,0.0004781243,0.00060450507,0.0017340513,0.0021070433,0.0020787832,0.0021053567,0.0011091897,0.007878969],"category_scores_gemma":[0.0058831316,0.00036185008,0.0006859897,0.0027190102,0.0029020426,0.003476955,0.001980578,0.0044594947,0.00064894755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023345921,0.000075142125,0.0021133625,0.0003549732,0.000028784038,0.00024988802,0.00038057705,0.0068897936,0.005597779,0.92527133,0.025997642,0.03280725],"study_design_scores_gemma":[0.000029555094,0.00005170989,0.0022196951,0.000042033345,0.000044460634,0.00040517346,0.00019731782,0.020834284,0.002963155,0.9435524,0.029602366,0.00005781929],"about_ca_topic_score_codex":0.0044180993,"about_ca_topic_score_gemma":0.006108504,"teacher_disagreement_score":0.007878969,"about_ca_system_score_codex":0.0026312862,"about_ca_system_score_gemma":0.0011565215,"threshold_uncertainty_score":0.02635777},"labels":[],"label_agreement":null},{"id":"W2578013412","doi":"","title":"The number of maximal independent sets in trees and forests.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Forestry; Geography","score_opus":0.014894386235573483,"score_gpt":0.27956692447406134,"score_spread":0.26467253823848785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578013412","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4685513,0.015473723,0.24088731,0.012350109,0.0011835939,0.000138189,0.0050005666,0.0007184541,0.25569677],"genre_scores_gemma":[0.9470117,0.0035669613,0.029615749,0.00053530064,0.0010479328,0.00024116343,0.0011875415,0.00015390819,0.01663973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975337,0.0007185382,0.00020608435,0.0005647683,0.00067513523,0.00030183635],"domain_scores_gemma":[0.97706443,0.01721114,0.0017632231,0.0013263333,0.0010211016,0.0016138244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031330243,0.0006986614,0.0012310012,0.004929906,0.0022457372,0.0058869286,0.002693726,0.0017604328,0.008372353],"category_scores_gemma":[0.024329213,0.0009755679,0.0008950027,0.0030130679,0.0057841004,0.014081186,0.002873741,0.0027355028,0.0012549972],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094292714,0.000030447485,0.0013588469,0.00014312296,0.000034680048,0.000062770276,0.0002400734,0.0018806962,0.00069107313,0.98042107,0.0037855464,0.011257263],"study_design_scores_gemma":[0.000011054885,0.000010068986,0.00058514596,0.00003663276,0.00002206828,0.00027878903,0.00008018907,0.004006383,0.00048282,0.9908597,0.003615967,0.00001126613],"about_ca_topic_score_codex":0.0006350493,"about_ca_topic_score_gemma":0.0007210122,"teacher_disagreement_score":0.008372353,"about_ca_system_score_codex":0.001936022,"about_ca_system_score_gemma":0.00081512757,"threshold_uncertainty_score":0.028008342},"labels":[],"label_agreement":null},{"id":"W2578061732","doi":"","title":"Relationships between distance two labellings and circular distance two labellings by group path covering.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Path (computing); Group (periodic table); Computer science; Computer network; Physics","score_opus":0.01444856507265261,"score_gpt":0.22663817205344708,"score_spread":0.21218960698079448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578061732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27984074,0.002041014,0.59083265,0.0033652827,0.0005074681,0.00021973153,0.0015308678,0.0015521189,0.12011013],"genre_scores_gemma":[0.8198833,0.0010458246,0.15394105,0.00092511886,0.00043124676,0.00022502417,0.0018394643,0.0005763927,0.021132642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99634486,0.0011186932,0.00027743602,0.00088105944,0.00079105946,0.00058689027],"domain_scores_gemma":[0.9599974,0.02864842,0.003335475,0.0043245982,0.0018744263,0.0018196892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022578945,0.00057730795,0.00083624094,0.0026256396,0.0028778706,0.0045066983,0.0018658132,0.0020760086,0.011345438],"category_scores_gemma":[0.02900423,0.0010166614,0.0011528839,0.0043928996,0.0044172606,0.010048355,0.0045695007,0.0034449906,0.0018051044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019343881,0.000069408496,0.00264354,0.00012413706,0.000039007336,0.00033083934,0.0007059185,0.003739972,0.0010127758,0.9579827,0.006691238,0.02646694],"study_design_scores_gemma":[0.000027570453,0.000040557607,0.00094309024,0.000040898398,0.00005585352,0.00057785056,0.0002962272,0.01370826,0.0010176471,0.96930176,0.013956651,0.000033611832],"about_ca_topic_score_codex":0.0019497678,"about_ca_topic_score_gemma":0.001808951,"teacher_disagreement_score":0.011345438,"about_ca_system_score_codex":0.002016293,"about_ca_system_score_gemma":0.001226785,"threshold_uncertainty_score":0.03795427},"labels":[],"label_agreement":null},{"id":"W2578077624","doi":"","title":"Enumeration of a class of rooted planar unicyclic maps.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Enumeration; Mathematics; Class (philosophy); Planar; Combinatorics; Artificial intelligence; Computer science; Computer graphics (images)","score_opus":0.026077667357059433,"score_gpt":0.2860291379651442,"score_spread":0.25995147060808477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578077624","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64520204,0.0016683515,0.082318336,0.0010599828,0.0002647309,0.00012305658,0.002173995,0.0005803864,0.2666091],"genre_scores_gemma":[0.9474989,0.00085029926,0.016835807,0.00018667689,0.00012612135,0.000071365546,0.002064868,0.000090156704,0.032275695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967575,0.000039643368,0.00001823467,0.000072561255,0.00010230816,0.00009151439],"domain_scores_gemma":[0.9992644,0.0003088374,0.00009585263,0.00010355901,0.00011478526,0.00011251112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013865967,0.00034007983,0.0004052627,0.0013115904,0.0011385194,0.0022190255,0.00075729075,0.0007272145,0.0093749175],"category_scores_gemma":[0.0018961295,0.00024476243,0.000272724,0.0018108712,0.00063823635,0.001420125,0.0012472365,0.0011174099,0.0011168496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014152526,0.000088122695,0.0019028124,0.00022885883,0.000021765123,0.00044525365,0.0004783521,0.0034571073,0.004791648,0.90584826,0.011421922,0.07117434],"study_design_scores_gemma":[0.00005030731,0.00008684021,0.0034104616,0.00012789482,0.000051066843,0.0024023715,0.00057130336,0.025349408,0.0056083845,0.90279573,0.05950719,0.00003910956],"about_ca_topic_score_codex":0.0010067251,"about_ca_topic_score_gemma":0.0010768273,"teacher_disagreement_score":0.0093749175,"about_ca_system_score_codex":0.00072318333,"about_ca_system_score_gemma":0.00045119727,"threshold_uncertainty_score":0.031362236},"labels":[],"label_agreement":null},{"id":"W2578103029","doi":"","title":"Tournaments whose indecomposability graph admits a vertex cover of size 2.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Graph; Vertex (graph theory); Vertex cover; Cover (algebra); Discrete mathematics","score_opus":0.014072295542171206,"score_gpt":0.2799166196258348,"score_spread":0.2658443240836636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578103029","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92163974,0.00028575648,0.01814358,0.0013374418,0.00012292413,0.000055698158,0.0019845788,0.0003931234,0.056037195],"genre_scores_gemma":[0.9845024,0.00012128086,0.0053263395,0.00015766123,0.000063800966,0.000033605716,0.0015048274,0.000047735663,0.008242283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995859,0.00007677089,0.000020003501,0.00010676853,0.000065085726,0.00014546522],"domain_scores_gemma":[0.99831885,0.00080272416,0.0002709398,0.00021026349,0.00009487546,0.00030232957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002577308,0.00047149402,0.0004997567,0.00056835456,0.0017233924,0.0025443644,0.00078688905,0.0011359617,0.013575859],"category_scores_gemma":[0.0019031669,0.0004049483,0.00057464186,0.00073365745,0.0006425471,0.0014444834,0.000804348,0.001010802,0.0007054974],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003464723,0.00078358984,0.02729116,0.00071025384,0.00044121407,0.0076911394,0.0016193293,0.023031846,0.07791676,0.7245506,0.05951145,0.072988],"study_design_scores_gemma":[0.0006432064,0.00048267675,0.024635045,0.000098535995,0.00028291313,0.005994154,0.0011827641,0.081673436,0.02110788,0.81532085,0.048478052,0.000100458165],"about_ca_topic_score_codex":0.0015342926,"about_ca_topic_score_gemma":0.002360416,"teacher_disagreement_score":0.013575859,"about_ca_system_score_codex":0.0006468666,"about_ca_system_score_gemma":0.0003535114,"threshold_uncertainty_score":0.04541576},"labels":[],"label_agreement":null},{"id":"W2578137639","doi":"","title":"A Construction of Multi-receiver Authentication Codes with Dynamic Sender from Linear Codes.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Communication source; Mathematics; Authentication (law); Computer science; Computer security; Statistics","score_opus":0.00990950214851381,"score_gpt":0.24099058594119024,"score_spread":0.23108108379267644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578137639","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0365545,0.00031057,0.9379991,0.00056401745,0.00029948112,0.00019794532,0.00033387588,0.0017357542,0.022004683],"genre_scores_gemma":[0.5977409,0.0004833712,0.37347487,0.00041798275,0.00022195297,0.0004948359,0.0006924844,0.00049109536,0.025982454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869496,0.00034722802,0.00009440513,0.00022779177,0.00040725162,0.000228349],"domain_scores_gemma":[0.99731296,0.0009496838,0.00028984304,0.00084773323,0.00028915115,0.00031064765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012143158,0.00084423687,0.00082469196,0.0010448437,0.00143556,0.0015326886,0.001203655,0.0011413052,0.0054989383],"category_scores_gemma":[0.003735486,0.0006506351,0.001075194,0.0011577681,0.0018449303,0.0019150113,0.004876764,0.0018958785,0.003226354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048558126,0.0001599213,0.0005850319,0.0003012759,0.00005537257,0.0005496097,0.00053502317,0.018011749,0.024596976,0.86781293,0.008282157,0.07862427],"study_design_scores_gemma":[0.00024385624,0.0004454061,0.0005275258,0.00018937392,0.00010372799,0.0013175793,0.00014805644,0.16051392,0.04895972,0.7458875,0.041435603,0.00022776012],"about_ca_topic_score_codex":0.00046331718,"about_ca_topic_score_gemma":0.0005811199,"teacher_disagreement_score":0.0054989383,"about_ca_system_score_codex":0.0008946246,"about_ca_system_score_gemma":0.0017371882,"threshold_uncertainty_score":0.018395782},"labels":[],"label_agreement":null},{"id":"W2578247564","doi":"","title":"Bases of primitive nonpowerful zero-symmetric sign pattern matrices without nonzero diagonal entry.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Diagonal; Sign (mathematics); Zero (linguistics); Combinatorics; Pure mathematics; Diagonal matrix; Mathematical analysis; Geometry","score_opus":0.0064924286063905426,"score_gpt":0.19799549467200644,"score_spread":0.1915030660656159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578247564","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34999672,0.0013605093,0.35714275,0.001246059,0.0013073689,0.00018424833,0.0018422874,0.00092220807,0.2859978],"genre_scores_gemma":[0.9148305,0.00058649876,0.037266336,0.00036489207,0.00032058347,0.0001274415,0.0010325311,0.00018204906,0.045289073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994791,0.000107986605,0.0000268963,0.00008511866,0.00015722345,0.00014355416],"domain_scores_gemma":[0.9991085,0.0002030072,0.00014464173,0.00020062411,0.00020175113,0.00014148986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004376132,0.00063752197,0.00042742482,0.0013888249,0.0008334439,0.001981553,0.0010053163,0.00061955577,0.019414287],"category_scores_gemma":[0.0016934122,0.00030417248,0.00032142765,0.0009243023,0.0013324656,0.0017383388,0.0012259498,0.0013558568,0.0045594345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009374893,0.000043429733,0.00011506258,0.000049458595,0.000006067794,0.00012767801,0.00011086247,0.0009154934,0.0047325757,0.97836655,0.002800722,0.0126383705],"study_design_scores_gemma":[0.000037687903,0.000050181163,0.00020098555,0.0000359105,0.0000062398813,0.00020246844,0.000117108684,0.0069391783,0.003969343,0.9790278,0.009391694,0.00002138967],"about_ca_topic_score_codex":0.00038934618,"about_ca_topic_score_gemma":0.00063425844,"teacher_disagreement_score":0.019414287,"about_ca_system_score_codex":0.00041689433,"about_ca_system_score_gemma":0.0005981056,"threshold_uncertainty_score":0.06494725},"labels":[],"label_agreement":null},{"id":"W2578367249","doi":"","title":"The fifth coefficient of adjoint polynomial and a new invariant.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Differential Equations and Dynamical Systems","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Invariant (physics); Polynomial; Pure mathematics; Mathematical analysis; Mathematical physics","score_opus":0.028306743937358922,"score_gpt":0.273460664847402,"score_spread":0.24515392091004307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578367249","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3446928,0.0023321041,0.31286216,0.0055006044,0.0051479186,0.000078348625,0.0005065563,0.0005843041,0.32829517],"genre_scores_gemma":[0.9213388,0.0005630169,0.025351172,0.00070169894,0.00096204947,0.000025795936,0.0001819653,0.00015917588,0.05071644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996123,0.00005498189,0.000014864427,0.0000745953,0.00014553386,0.000097727774],"domain_scores_gemma":[0.99946517,0.0000808862,0.00008143334,0.000080573314,0.00011726357,0.0001747297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004540596,0.00040008134,0.0004516532,0.0017624317,0.0009146381,0.0016287016,0.0006855253,0.0007450574,0.007978765],"category_scores_gemma":[0.001492511,0.00018447315,0.00061502826,0.0008359975,0.0026786216,0.0027595323,0.0016054369,0.0020669636,0.0012919311],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014469003,0.000014391002,0.00008624167,0.000013430786,0.0000022112717,0.000101957856,0.00006960584,0.00018487342,0.0012357496,0.9933611,0.00132324,0.0035926541],"study_design_scores_gemma":[0.000014598421,0.000033950793,0.00043774635,0.000018264951,0.000008685126,0.0004806598,0.00010198317,0.0048541594,0.0016034001,0.9772037,0.015222143,0.000020659707],"about_ca_topic_score_codex":0.00062966614,"about_ca_topic_score_gemma":0.0007828011,"teacher_disagreement_score":0.007978765,"about_ca_system_score_codex":0.0008291431,"about_ca_system_score_gemma":0.00066284335,"threshold_uncertainty_score":0.026691616},"labels":[],"label_agreement":null},{"id":"W2578417250","doi":"","title":"On Pell numbers and (k 1 , A 1 , k 2 , A 2 , k 3 , A 3 )-edge colouring in graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Computer science; Artificial intelligence","score_opus":0.008831258257989206,"score_gpt":0.2144585523735491,"score_spread":0.2056272941155599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578417250","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5137537,0.0069425465,0.17510396,0.018813236,0.0011000193,0.0001306568,0.0015044488,0.00056679494,0.2820846],"genre_scores_gemma":[0.92924577,0.0033667856,0.033879995,0.0012202238,0.0007343574,0.00015973876,0.00081138907,0.00023130409,0.030350368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869835,0.0005195049,0.00007726458,0.00021752209,0.00019939733,0.00028792268],"domain_scores_gemma":[0.9911975,0.0061787846,0.0009905315,0.0005907392,0.00036884318,0.000673512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013174528,0.0008794528,0.00083256804,0.0019830405,0.0023977023,0.0044225124,0.0015130477,0.0025642982,0.011882014],"category_scores_gemma":[0.011737861,0.0007307787,0.00078526395,0.0030859562,0.005845162,0.011353753,0.0035282704,0.0035868476,0.0016020569],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006179876,0.000020785432,0.0005616074,0.000049249415,0.000006322788,0.000051961175,0.00020266321,0.0028156985,0.00032081135,0.98389524,0.0042109913,0.007802879],"study_design_scores_gemma":[0.000009841252,0.000006204705,0.00027592725,0.000020381925,0.0000051051848,0.00006123328,0.000109783396,0.0033524092,0.0001841702,0.993236,0.0027272028,0.000011772306],"about_ca_topic_score_codex":0.0028911778,"about_ca_topic_score_gemma":0.0032094808,"teacher_disagreement_score":0.011882014,"about_ca_system_score_codex":0.0026198106,"about_ca_system_score_gemma":0.001084839,"threshold_uncertainty_score":0.039749265},"labels":[],"label_agreement":null},{"id":"W2578488700","doi":"","title":"Hessenberg Matrices On Fibonacci And Tribonacci Numbers.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Mathematics; Pisano period; Combinatorics; Fibonacci polynomials; Orthogonal polynomials","score_opus":0.007304743501540345,"score_gpt":0.2543817821887103,"score_spread":0.24707703868717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578488700","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111956865,0.0089657055,0.36038652,0.0037959437,0.004054235,0.00020542638,0.0014835587,0.0007557931,0.50839597],"genre_scores_gemma":[0.755628,0.003810298,0.09409034,0.002169753,0.0025904442,0.00036182386,0.0010544199,0.00041343458,0.1398815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930704,0.00015430081,0.00004522677,0.00011186456,0.0002615515,0.000119922195],"domain_scores_gemma":[0.9987835,0.00047425673,0.00018737906,0.00012743384,0.000289429,0.00013796925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006483958,0.00095516606,0.0006225043,0.003660768,0.0016213199,0.0037897485,0.00081034173,0.0012210959,0.022706576],"category_scores_gemma":[0.0038696555,0.00046709756,0.0005115414,0.002230733,0.0022874137,0.004310511,0.001485317,0.0019385203,0.0052784816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001028743,0.000004496848,0.00004959601,0.00001824899,0.0000025127047,0.000049276077,0.000071045775,0.0003826964,0.00037294813,0.9901686,0.0031650173,0.005705304],"study_design_scores_gemma":[0.0000043345244,0.00000812339,0.00010180745,0.000013306177,0.0000021202006,0.00011659287,0.000040305946,0.0022290626,0.00029554128,0.98825294,0.008924127,0.0000117174],"about_ca_topic_score_codex":0.0009812481,"about_ca_topic_score_gemma":0.0016211964,"teacher_disagreement_score":0.022706576,"about_ca_system_score_codex":0.001065733,"about_ca_system_score_gemma":0.0006004491,"threshold_uncertainty_score":0.07596105},"labels":[],"label_agreement":null},{"id":"W2578493379","doi":"","title":"On full friendly index sets of twisted product of Mobius ladders.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Product (mathematics); Index (typography); Pure mathematics; Geometry; Computer science; World Wide Web","score_opus":0.010071749396784959,"score_gpt":0.22651815595973812,"score_spread":0.21644640656295316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578493379","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.724224,0.0006656466,0.14033197,0.0007461041,0.0002493338,0.00007269834,0.00079237204,0.00068245304,0.13223542],"genre_scores_gemma":[0.9486305,0.00036339893,0.025632074,0.00030090706,0.00013689775,0.00009522832,0.0006826215,0.00027235836,0.023885991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989654,0.00023360702,0.000060585215,0.00016280785,0.0002724348,0.00030514767],"domain_scores_gemma":[0.99776196,0.00096033135,0.00029813073,0.0003586457,0.00019842257,0.00042243482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008566803,0.000525966,0.00083685515,0.0026197832,0.0027906136,0.0041743335,0.0014009319,0.0011730224,0.012917803],"category_scores_gemma":[0.0031657605,0.0007107354,0.0008254168,0.00188247,0.0020593558,0.006153663,0.0032105702,0.0015389932,0.0019376111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005468068,0.0000232594,0.0003901976,0.00003143841,0.0000057491825,0.00010649778,0.00024713538,0.0009879613,0.000996749,0.99121463,0.0014690997,0.0044725495],"study_design_scores_gemma":[0.000018337621,0.000017871487,0.0003576096,0.000028167458,0.000011492892,0.00015958317,0.00017743431,0.007211557,0.001034377,0.98708504,0.0038824007,0.000016126984],"about_ca_topic_score_codex":0.00095134706,"about_ca_topic_score_gemma":0.0013423125,"teacher_disagreement_score":0.012917803,"about_ca_system_score_codex":0.0014079658,"about_ca_system_score_gemma":0.00046016046,"threshold_uncertainty_score":0.04321438},"labels":[],"label_agreement":null},{"id":"W2578701660","doi":"","title":"On metric dimension of convex polytopes with pendant edges.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Polytope; Dimension (graph theory); Regular polygon; Convex polytope; Metric (unit); Combinatorics; Convex analysis; Pure mathematics; Geometry; Convex optimization","score_opus":0.010988998384004611,"score_gpt":0.21409428389935142,"score_spread":0.20310528551534682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578701660","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.548299,0.007049152,0.3263846,0.008233874,0.0006417864,0.00014788026,0.004003984,0.0005339299,0.104705766],"genre_scores_gemma":[0.92140615,0.0025509603,0.05618207,0.0006890992,0.00069605286,0.0002189983,0.0022446886,0.00028648152,0.015725456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867684,0.0004678385,0.0000659618,0.00028043697,0.0002660934,0.000242782],"domain_scores_gemma":[0.9924631,0.0049013905,0.0008004772,0.0005432269,0.00044173954,0.00084998447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012837889,0.000994457,0.0013452985,0.0025716813,0.00181871,0.0041414797,0.0022145715,0.0018195672,0.008590012],"category_scores_gemma":[0.009690761,0.0008055096,0.000800804,0.002555724,0.0028491928,0.0071156486,0.0032357646,0.0031780484,0.0009784997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015662855,0.00008924528,0.0026103714,0.00022798363,0.000048668542,0.00010606633,0.00029489238,0.020460289,0.0011013844,0.9375671,0.015810004,0.021527363],"study_design_scores_gemma":[0.000031992044,0.00004254894,0.0021160238,0.00006932175,0.000027248154,0.00024365542,0.00036996184,0.07168117,0.00073531544,0.9158331,0.008808744,0.000040895273],"about_ca_topic_score_codex":0.002720817,"about_ca_topic_score_gemma":0.0024782573,"teacher_disagreement_score":0.008590012,"about_ca_system_score_codex":0.0025088463,"about_ca_system_score_gemma":0.00068009074,"threshold_uncertainty_score":0.028736472},"labels":[],"label_agreement":null},{"id":"W2578737464","doi":"","title":"The Rainbow Connection Problem: Mathematical Formulations.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Rainbow; Connection (principal bundle); Mathematics; Calculus (dental); Mathematical optimization; Geometry; Physics; Medicine; Optics","score_opus":0.02506789175033619,"score_gpt":0.28385561505290524,"score_spread":0.25878772330256905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578737464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07175632,0.010208121,0.562755,0.022177286,0.0016424306,0.00016689322,0.0012345649,0.0003812323,0.3296782],"genre_scores_gemma":[0.73963964,0.011369853,0.13125378,0.002769814,0.002647954,0.0004948712,0.001305829,0.00038522744,0.11013305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992693,0.00026246888,0.00003697659,0.00015358356,0.00018727328,0.00009040136],"domain_scores_gemma":[0.9980433,0.0011050912,0.00024698622,0.00020560097,0.00020395835,0.00019510923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001417817,0.00079170463,0.00078010134,0.0017332812,0.0020593002,0.0036012237,0.0021022963,0.0034078946,0.019466428],"category_scores_gemma":[0.006349301,0.00059778616,0.00086794334,0.002663004,0.003182075,0.011630033,0.0035072563,0.005318223,0.002765403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006399745,0.000012487182,0.00005365518,0.0000366478,0.000004792881,0.00002734872,0.000038189028,0.00080621394,0.00007049902,0.9910944,0.004465476,0.0033839173],"study_design_scores_gemma":[0.000004679942,0.0000027137914,0.000033997156,0.000012502777,0.000003490384,0.00004908035,0.000042486725,0.003291035,0.000034730798,0.9933159,0.003205768,0.0000037254574],"about_ca_topic_score_codex":0.0010812351,"about_ca_topic_score_gemma":0.0014403398,"teacher_disagreement_score":0.019466428,"about_ca_system_score_codex":0.0017241135,"about_ca_system_score_gemma":0.0011138571,"threshold_uncertainty_score":0.06512171},"labels":[],"label_agreement":null},{"id":"W2578744964","doi":"","title":"Arc-connectivity of regular digraphs with two orbits.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arc (geometry); Mathematics; Combinatorics; Pure mathematics; Geometry","score_opus":0.008724780505388278,"score_gpt":0.21577670511047853,"score_spread":0.20705192460509025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578744964","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79245615,0.00091856957,0.10311027,0.001034049,0.00011718086,0.0000968001,0.0024038255,0.0004762989,0.09938694],"genre_scores_gemma":[0.9794306,0.00038883588,0.010495496,0.000083156716,0.000039982257,0.00004427093,0.0009300272,0.000040208048,0.0085474225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976665,0.000053366453,0.000020812999,0.000059128317,0.000049660295,0.00005027132],"domain_scores_gemma":[0.99850875,0.00079503685,0.00026175784,0.00011206402,0.00012952728,0.00019292772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020817883,0.0002501567,0.00027350202,0.0010545006,0.0006440833,0.0013423957,0.00054254377,0.00063605997,0.009380379],"category_scores_gemma":[0.0020332239,0.00026443266,0.00028566635,0.00096571865,0.0007035623,0.0018822736,0.0007038188,0.00059825357,0.0006286468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002739999,0.000086412416,0.0038056346,0.00030549968,0.000059528913,0.0011398615,0.0006252539,0.017325806,0.0056564356,0.92513764,0.007892477,0.037691347],"study_design_scores_gemma":[0.00007218975,0.00008105357,0.0032219614,0.000088733446,0.0000633638,0.0012710377,0.00046860825,0.06746637,0.0026362096,0.91073835,0.01386379,0.000028357072],"about_ca_topic_score_codex":0.0012244484,"about_ca_topic_score_gemma":0.0016154904,"teacher_disagreement_score":0.009380379,"about_ca_system_score_codex":0.0005866297,"about_ca_system_score_gemma":0.00030472715,"threshold_uncertainty_score":0.031380475},"labels":[],"label_agreement":null},{"id":"W2578758224","doi":"","title":"On The Detour Monophonic Number of a Graph.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.015210940631470826,"score_gpt":0.27634517660121527,"score_spread":0.26113423596974444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578758224","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6577411,0.0020311521,0.094910376,0.0076961843,0.001627196,0.000079177255,0.0008226386,0.00044915764,0.23464294],"genre_scores_gemma":[0.9649798,0.0007489287,0.012651938,0.00052712817,0.0007802847,0.00010198254,0.0002825213,0.00015295704,0.01977441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992976,0.00022703735,0.000027514954,0.0001341992,0.00016943867,0.00014415637],"domain_scores_gemma":[0.99534863,0.002774949,0.0005195713,0.00034141506,0.0003278561,0.00068759976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008568697,0.00057234603,0.0006608914,0.003135791,0.0020231516,0.0021880725,0.0012287871,0.0014729629,0.010599463],"category_scores_gemma":[0.0068647107,0.0003273046,0.00037476793,0.0013249688,0.003239652,0.0046528834,0.0019434053,0.002436071,0.0014328859],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011050281,0.000024891591,0.00048826484,0.000062626765,0.000007685242,0.0000975636,0.00019418423,0.001502467,0.0013800989,0.98301065,0.0037939872,0.009327047],"study_design_scores_gemma":[0.000021029782,0.00002865688,0.0006375485,0.000034191722,0.000009508434,0.00017073409,0.000106081796,0.0083133085,0.00066783355,0.9848969,0.0050944737,0.000019744952],"about_ca_topic_score_codex":0.0009565495,"about_ca_topic_score_gemma":0.0015218453,"teacher_disagreement_score":0.010599463,"about_ca_system_score_codex":0.001237378,"about_ca_system_score_gemma":0.000501565,"threshold_uncertainty_score":0.035458744},"labels":[],"label_agreement":null},{"id":"W2578818765","doi":"","title":"On matrices over roots of unity with vanishing permanent.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics; Root of unity","score_opus":0.007425058175573334,"score_gpt":0.2230876220072842,"score_spread":0.21566256383171084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578818765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17169476,0.00600944,0.6458885,0.0054840883,0.0012578933,0.0001169961,0.0010048324,0.0015862155,0.1669574],"genre_scores_gemma":[0.8316933,0.0041706446,0.09756495,0.001096435,0.0014991394,0.0001593912,0.0011538863,0.0005663895,0.062095895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990102,0.00026934096,0.000053127296,0.00018111589,0.00024863047,0.00023755115],"domain_scores_gemma":[0.99680126,0.0018441797,0.00035114744,0.0004793103,0.00028694086,0.00023710345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009086832,0.000894141,0.0008017527,0.0020115785,0.0014724252,0.0025612814,0.0010359939,0.0008897697,0.010545373],"category_scores_gemma":[0.0075254035,0.00048770203,0.0004898753,0.0020777807,0.003011566,0.006227539,0.0028749683,0.0026756767,0.0042859586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083264014,0.00004650566,0.0003317424,0.000110681816,0.000014133372,0.0001437377,0.00028400094,0.005805698,0.001173458,0.948912,0.010347689,0.032747075],"study_design_scores_gemma":[0.000010890912,0.000017077919,0.000092828865,0.00002582282,0.0000044819485,0.00009329293,0.00006953138,0.008410991,0.00048196613,0.98612773,0.004654933,0.000010343969],"about_ca_topic_score_codex":0.0010522607,"about_ca_topic_score_gemma":0.0016917717,"teacher_disagreement_score":0.010545373,"about_ca_system_score_codex":0.0009874156,"about_ca_system_score_gemma":0.0007836568,"threshold_uncertainty_score":0.035277784},"labels":[],"label_agreement":null},{"id":"W2578871007","doi":"","title":"Optimum Seating Arrangements and Tuscan Squares.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Least-squares function approximation; Statistics","score_opus":0.008008780175602014,"score_gpt":0.20846587747965073,"score_spread":0.2004570973040487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578871007","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3029341,0.0026506635,0.32034048,0.0017865219,0.00052008574,0.00018637655,0.0021185337,0.00068799057,0.3687752],"genre_scores_gemma":[0.7633843,0.0014493014,0.083708964,0.00019994608,0.0001296417,0.00016667593,0.001600041,0.00021161277,0.14914945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971825,0.00010047571,0.000007787932,0.000045586592,0.00005252292,0.000075358104],"domain_scores_gemma":[0.9997212,0.00012723943,0.000044586806,0.000026623035,0.00003165407,0.00004858285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027210687,0.00067829323,0.0006770829,0.0008742336,0.0007244915,0.0009995493,0.00076611753,0.0010292615,0.046286017],"category_scores_gemma":[0.002361518,0.0004214449,0.00039390588,0.0013042861,0.00086588366,0.0012131401,0.0012092342,0.0010287194,0.0029465982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006997635,0.00012701265,0.0014701121,0.00031069547,0.000045573015,0.00019703628,0.00017753463,0.2597021,0.0029508285,0.5733264,0.036370542,0.12462247],"study_design_scores_gemma":[0.00016486572,0.0002344417,0.0036014332,0.00013102865,0.00004207816,0.0003123142,0.00033428433,0.4067103,0.0023931123,0.5394778,0.046554744,0.000043603945],"about_ca_topic_score_codex":0.0049271304,"about_ca_topic_score_gemma":0.0083641475,"teacher_disagreement_score":0.046286017,"about_ca_system_score_codex":0.0011058721,"about_ca_system_score_gemma":0.00070098834,"threshold_uncertainty_score":0.15484214},"labels":[],"label_agreement":null},{"id":"W2578879722","doi":"","title":"The eccentric distance sum, the Harary index and the degree powers of graphs with given diameter.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Index (typography); Combinatorics; Physics; Computer science","score_opus":0.018055641405798177,"score_gpt":0.23797838800744714,"score_spread":0.21992274660164896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578879722","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74117714,0.0051010745,0.11549073,0.0031411885,0.0005184632,0.000036956164,0.0007937697,0.00024217302,0.13349856],"genre_scores_gemma":[0.97960585,0.0010987539,0.009108733,0.00013414085,0.0003703228,0.0000277072,0.00019940434,0.00010547247,0.009349554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936646,0.00019145798,0.000035824723,0.0001481924,0.00016258856,0.00009541096],"domain_scores_gemma":[0.99515027,0.002773392,0.0007430442,0.00042296763,0.0002871401,0.00062337087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010199089,0.0005138911,0.0007505693,0.0021728086,0.0012210115,0.0027276091,0.0012891613,0.0009827927,0.004426766],"category_scores_gemma":[0.010350734,0.00035352755,0.0003078076,0.0015908063,0.0021899275,0.005761907,0.0017731391,0.0013553817,0.00080900086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022837151,0.00004046642,0.0030076639,0.00011451526,0.000031362997,0.00018405163,0.00035854153,0.012046688,0.0030975018,0.9558898,0.0053652315,0.019635806],"study_design_scores_gemma":[0.000018234396,0.000031376916,0.0018621597,0.00004414334,0.00003394932,0.0005015373,0.00020639678,0.028817728,0.0017203745,0.96090966,0.0058310824,0.000023371442],"about_ca_topic_score_codex":0.0004640772,"about_ca_topic_score_gemma":0.0005977084,"teacher_disagreement_score":0.004426766,"about_ca_system_score_codex":0.0011203084,"about_ca_system_score_gemma":0.0002812859,"threshold_uncertainty_score":0.014809072},"labels":[],"label_agreement":null},{"id":"W2578899218","doi":"","title":"General vertex-distinguishing total coloring of complete bipartite graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Combinatorics; Vertex (graph theory); Complete coloring; Edge coloring; Complete bipartite graph; List coloring; Discrete mathematics; Graph; Line graph; Graph power","score_opus":0.019740437863475704,"score_gpt":0.2283816406556256,"score_spread":0.2086412027921499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578899218","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55173904,0.0011769225,0.3271009,0.0032431378,0.00031744663,0.00017366113,0.0036828439,0.0010557201,0.11151035],"genre_scores_gemma":[0.9175972,0.0005272931,0.060980394,0.0006460474,0.00016020292,0.000106667794,0.0025705935,0.00027964968,0.017131947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876934,0.00035601092,0.00005902834,0.0003420708,0.00021081284,0.00026260564],"domain_scores_gemma":[0.99394625,0.0034891772,0.00054044626,0.0011228656,0.0003395671,0.00056167995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014010458,0.0007518772,0.0008044599,0.0010711484,0.0016147008,0.0032530387,0.00193365,0.0014904077,0.008315055],"category_scores_gemma":[0.006000307,0.00065850094,0.0007971901,0.0018010272,0.0020049498,0.0045092064,0.001972149,0.0021116664,0.00070153066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022684208,0.00010774643,0.0016297372,0.00022704921,0.000031542404,0.000098682736,0.00021130058,0.018866425,0.0024662206,0.94729394,0.012666228,0.016174255],"study_design_scores_gemma":[0.000041198553,0.000019525289,0.0005584492,0.00002705188,0.000023700364,0.00016669321,0.00011953802,0.044891737,0.0013203367,0.94772375,0.0050932434,0.000014836048],"about_ca_topic_score_codex":0.0016704465,"about_ca_topic_score_gemma":0.002827716,"teacher_disagreement_score":0.008315055,"about_ca_system_score_codex":0.0021903182,"about_ca_system_score_gemma":0.0012608075,"threshold_uncertainty_score":0.027816653},"labels":[],"label_agreement":null},{"id":"W2578989106","doi":"","title":"A characterization of the graphs with high degree sum that are not covered by three cycles.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Characterization (materials science); Combinatorics; Discrete mathematics; Materials science; Nanotechnology","score_opus":0.0214172698619869,"score_gpt":0.23372365351360555,"score_spread":0.21230638365161864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578989106","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8800684,0.0010327839,0.06195778,0.001248401,0.00014714326,0.0000972399,0.0022964536,0.00051294506,0.052638832],"genre_scores_gemma":[0.97778225,0.0003666492,0.014326076,0.00025337996,0.00011092663,0.00007140111,0.002169481,0.00015716313,0.0047626193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948174,0.00007802736,0.000029384004,0.00016573006,0.00011336242,0.00013173782],"domain_scores_gemma":[0.9969023,0.0012208575,0.00059655413,0.00038380412,0.00030922182,0.0005871671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035450797,0.0006583372,0.00063027703,0.00249147,0.001600546,0.0023845353,0.0010600222,0.00091764826,0.0056546186],"category_scores_gemma":[0.0034431217,0.0003967915,0.0005871805,0.002220466,0.0013867043,0.002547183,0.0016269363,0.001336975,0.0009850224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010715895,0.00032498696,0.019641755,0.0006798912,0.00013848783,0.002150596,0.0020183874,0.013024148,0.06430574,0.79256743,0.019588364,0.08448869],"study_design_scores_gemma":[0.00008663951,0.00021762507,0.02331428,0.00023428592,0.00022070121,0.007142748,0.002115235,0.061751146,0.022877006,0.8367294,0.045195688,0.00011524926],"about_ca_topic_score_codex":0.0008512504,"about_ca_topic_score_gemma":0.00087163644,"teacher_disagreement_score":0.0056546186,"about_ca_system_score_codex":0.0006530925,"about_ca_system_score_gemma":0.00047941052,"threshold_uncertainty_score":0.018916607},"labels":[],"label_agreement":null},{"id":"W2579039377","doi":"","title":"On The Super Edge-Magic Deficiency Of 2-Regular Graphs With Two Components.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; MAGIC (telescope); Enhanced Data Rates for GSM Evolution; Combinatorics; Astrophysics; Computer science; Artificial intelligence; Physics","score_opus":0.01259334651858203,"score_gpt":0.20895596112473427,"score_spread":0.19636261460615223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579039377","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71779794,0.0024592644,0.11772868,0.0059130373,0.0004472814,0.000091487665,0.0014105553,0.00047717406,0.1536746],"genre_scores_gemma":[0.9528558,0.00091453944,0.032391284,0.0007811296,0.00023474262,0.000073050105,0.0008106382,0.00013704016,0.011801744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993349,0.00023575843,0.00003141441,0.00012394438,0.00014244266,0.00013150534],"domain_scores_gemma":[0.99651754,0.0022753174,0.0002986137,0.00034917257,0.00021971115,0.00033955713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010203345,0.00047849974,0.00079201174,0.0014953242,0.0014439162,0.0021970083,0.0012065569,0.0014274361,0.008338112],"category_scores_gemma":[0.0051255594,0.0005033802,0.00048591,0.0012654057,0.0023247933,0.005230283,0.0018596196,0.0020201893,0.0010503052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017731338,0.000047670987,0.0011927349,0.00014215459,0.000013529984,0.00012632547,0.00025128666,0.0039562797,0.0015748509,0.9702501,0.007972964,0.014294874],"study_design_scores_gemma":[0.000039072063,0.000021984913,0.00052795635,0.000035788984,0.000013016962,0.00024317461,0.00017845785,0.0124949375,0.00064467744,0.9811343,0.0046515726,0.00001500833],"about_ca_topic_score_codex":0.0013465617,"about_ca_topic_score_gemma":0.0014434885,"teacher_disagreement_score":0.008338112,"about_ca_system_score_codex":0.0010722445,"about_ca_system_score_gemma":0.0006453376,"threshold_uncertainty_score":0.027893782},"labels":[],"label_agreement":null},{"id":"W2579153743","doi":"","title":"Turan-type problem for a cycle of length 6 in bipartite Eulerian digraph.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Digraph; Mathematics; Bipartite graph; Eulerian path; Type (biology); Combinatorics; Pure mathematics; Graph; Biology","score_opus":0.007220281594415526,"score_gpt":0.20223398233574424,"score_spread":0.19501370074132873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579153743","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.658342,0.0015755501,0.18262331,0.009724932,0.00069193955,0.00064023613,0.0048304703,0.0010363327,0.14053519],"genre_scores_gemma":[0.90018,0.0005676218,0.05275596,0.00097294035,0.00020094129,0.00028096585,0.002591157,0.00018919435,0.042261194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937963,0.00023588662,0.000030366487,0.00013006302,0.00006252036,0.00016142637],"domain_scores_gemma":[0.9972963,0.0017767233,0.00022483246,0.00022061316,0.00016414931,0.00031735378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066153443,0.00066505646,0.0009671744,0.00092892995,0.0016849827,0.002121182,0.00179592,0.0025805542,0.021105058],"category_scores_gemma":[0.0045568924,0.0004285476,0.00076719915,0.00098232,0.0009761085,0.0033301422,0.0014963634,0.0018586188,0.0012842414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079329265,0.00055540324,0.0028915214,0.0010320924,0.00020812494,0.0007432801,0.0006985211,0.1083053,0.004447627,0.73954624,0.07426874,0.06650981],"study_design_scores_gemma":[0.0001825949,0.00017265363,0.0015909199,0.00012635272,0.000096032265,0.00049330253,0.0007543078,0.26708132,0.0038305265,0.70917356,0.016437616,0.000060771028],"about_ca_topic_score_codex":0.0036087688,"about_ca_topic_score_gemma":0.005526219,"teacher_disagreement_score":0.021105058,"about_ca_system_score_codex":0.0017015825,"about_ca_system_score_gemma":0.0016761706,"threshold_uncertainty_score":0.07060343},"labels":[],"label_agreement":null},{"id":"W2579231286","doi":"","title":"Domination numbers of m-cactus chains","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cactus; Mathematics; Equidistant; Combinatorics; Domination analysis; Graph; Invariant (physics); Upper and lower bounds; Discrete mathematics; Geometry; Botany; Biology; Mathematical analysis","score_opus":0.013307967540432569,"score_gpt":0.274592659922865,"score_spread":0.26128469238243246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579231286","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8547777,0.00085295475,0.09061037,0.00029245994,0.000048338614,0.000055972687,0.0005301888,0.00015471881,0.052677307],"genre_scores_gemma":[0.970698,0.00027905553,0.023834113,0.00004726618,0.000029098252,0.00007238339,0.0002957677,0.000041459076,0.0047029834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996278,0.00003779792,0.000025743022,0.00010252125,0.000113454604,0.00009266511],"domain_scores_gemma":[0.9987457,0.00064918026,0.00018930875,0.000091618575,0.0001741079,0.00015013479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029926322,0.0003328149,0.00029496272,0.0018344887,0.00095044606,0.0011096352,0.0008248393,0.00048435736,0.0066236584],"category_scores_gemma":[0.0025219843,0.00020915513,0.00025289872,0.0011843279,0.000681779,0.0016034296,0.0007147756,0.0006019599,0.00027569753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053488015,0.00011710291,0.019011473,0.0005911782,0.000076489,0.00089362677,0.0011290642,0.072110504,0.060825817,0.7356073,0.0041067046,0.104995854],"study_design_scores_gemma":[0.000055254077,0.00014053597,0.011917369,0.00018669962,0.00006335684,0.0014700805,0.0007290406,0.3638324,0.041178677,0.5610618,0.019280734,0.00008411319],"about_ca_topic_score_codex":0.00084507477,"about_ca_topic_score_gemma":0.0015456473,"teacher_disagreement_score":0.0066236584,"about_ca_system_score_codex":0.0011578663,"about_ca_system_score_gemma":0.00024062129,"threshold_uncertainty_score":0.022158325},"labels":[],"label_agreement":null},{"id":"W2579248681","doi":"","title":"Antimagic labelings of cycle powers.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Arithmetic","score_opus":0.00785213682064568,"score_gpt":0.2189866468630564,"score_spread":0.21113451004241074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579248681","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25767308,0.002047033,0.34784603,0.004382925,0.00049695006,0.0001815578,0.0022986368,0.0010385682,0.38403514],"genre_scores_gemma":[0.8510118,0.0011958532,0.08055104,0.0009166735,0.0003378661,0.00017763182,0.0018585286,0.00040208627,0.06354853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987614,0.00040829997,0.000085178006,0.00028457487,0.0002647311,0.00019589886],"domain_scores_gemma":[0.99596465,0.0021583452,0.00035437322,0.00074060535,0.0003784069,0.00040360264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085850584,0.00047599745,0.00063013623,0.0019059542,0.002190513,0.003714804,0.0012478122,0.0013353722,0.017695978],"category_scores_gemma":[0.005592688,0.00054642203,0.00079089106,0.0024394477,0.0022213303,0.0064743967,0.0026506232,0.0021454734,0.0027442232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003368425,0.000017755669,0.00020320674,0.000052807613,0.0000058290734,0.000042684394,0.00014669048,0.0008046339,0.00062317087,0.9828631,0.0039693248,0.011237114],"study_design_scores_gemma":[0.000010340787,0.0000067631563,0.00011716066,0.000022132224,0.0000071533036,0.000086198095,0.000106643856,0.0031856531,0.0007128356,0.9855349,0.010203256,0.0000068522554],"about_ca_topic_score_codex":0.0012681705,"about_ca_topic_score_gemma":0.0020128915,"teacher_disagreement_score":0.017695978,"about_ca_system_score_codex":0.0017796753,"about_ca_system_score_gemma":0.0006508984,"threshold_uncertainty_score":0.059198976},"labels":[],"label_agreement":null},{"id":"W2579257756","doi":"","title":"The goodness of path or cycle with respect to multiple copies of complete graphs of order three.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Path (computing); Goodness of fit; Order (exchange); Combinatorics; Discrete mathematics; Statistics; Computer science; Computer network; Business","score_opus":0.011488446934773185,"score_gpt":0.2046277397163393,"score_spread":0.1931392927815661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579257756","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93183255,0.00045342866,0.030140163,0.00097086385,0.00012430469,0.0000277921,0.00078140065,0.00023001086,0.03543951],"genre_scores_gemma":[0.9941399,0.0001344985,0.003100813,0.000059368907,0.000065519765,0.000017382863,0.00029915504,0.00005088917,0.002132428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981744,0.00066146086,0.00011012656,0.00032944666,0.00045162826,0.00027305292],"domain_scores_gemma":[0.97849727,0.0124152,0.0030923185,0.0023187168,0.0013031116,0.0023733429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021300612,0.0005545938,0.00092481193,0.0034655835,0.0013269394,0.003726002,0.0012542731,0.0014987927,0.006923321],"category_scores_gemma":[0.018132387,0.0004412342,0.0006780283,0.0019506225,0.0043293084,0.0042658173,0.0020458146,0.00168141,0.00058209494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090205,0.00007195868,0.016925162,0.00019915136,0.00015259696,0.00058741245,0.00078679394,0.045078475,0.0052592633,0.90330315,0.0041357684,0.0225982],"study_design_scores_gemma":[0.000065685526,0.0002718021,0.013207636,0.00009267376,0.00011436187,0.0012403858,0.0009226507,0.08028762,0.0038181,0.89533186,0.004547392,0.00009969019],"about_ca_topic_score_codex":0.0020324849,"about_ca_topic_score_gemma":0.0020663037,"teacher_disagreement_score":0.006923321,"about_ca_system_score_codex":0.0016321043,"about_ca_system_score_gemma":0.00084665883,"threshold_uncertainty_score":0.023160815},"labels":[],"label_agreement":null},{"id":"W2579368783","doi":"","title":"Rooted HIST property on planar triangulations.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Property (philosophy); Planar; Mathematics; Combinatorics; Computer science; Computer graphics (images); Epistemology; Philosophy","score_opus":0.017959132266211007,"score_gpt":0.23434312803629878,"score_spread":0.21638399577008777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579368783","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058167305,0.00065724575,0.841255,0.0006767642,0.00022759373,0.00009158283,0.0011860252,0.0010690909,0.096669376],"genre_scores_gemma":[0.72108984,0.001344027,0.21816511,0.0006327168,0.00026500743,0.00019657277,0.0030835934,0.0010925205,0.05413071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992835,0.00009684702,0.000048274276,0.00016171964,0.00032407825,0.00008563184],"domain_scores_gemma":[0.99730957,0.0009727473,0.00030308717,0.0008516738,0.00040380593,0.00015913023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005503217,0.00031817515,0.00045935472,0.0011949132,0.00078656035,0.0020399506,0.0010351528,0.00064991746,0.015032529],"category_scores_gemma":[0.0049997647,0.0003545129,0.0005384912,0.0014519984,0.0014285349,0.002873278,0.002483192,0.0015070969,0.003147626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049941456,0.000021174514,0.00087879534,0.00014194769,0.00001407573,0.00018373497,0.0002090633,0.0052898107,0.003109223,0.9157233,0.0076380954,0.06674085],"study_design_scores_gemma":[0.000027733675,0.000053754724,0.0010405317,0.000076536286,0.000031446398,0.00089910044,0.00031181364,0.03230131,0.0064191255,0.90713584,0.051681846,0.000021031128],"about_ca_topic_score_codex":0.0011019764,"about_ca_topic_score_gemma":0.0018306499,"teacher_disagreement_score":0.015032529,"about_ca_system_score_codex":0.00065095176,"about_ca_system_score_gemma":0.00041950372,"threshold_uncertainty_score":0.050288796},"labels":[],"label_agreement":null},{"id":"W2579377738","doi":"","title":"On the {4, -k}-hypomorphy for digraphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Arithmetic","score_opus":0.022155598587601417,"score_gpt":0.273440382427533,"score_spread":0.2512847838399316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579377738","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25102893,0.0037492595,0.28398904,0.009361465,0.0018146657,0.00022306053,0.0029802395,0.0011922703,0.44566107],"genre_scores_gemma":[0.8519487,0.002021445,0.07032398,0.002997792,0.00078569015,0.0002091266,0.001810653,0.00061014935,0.06929252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906105,0.00027098457,0.000081254526,0.00023602268,0.00016745455,0.00018323252],"domain_scores_gemma":[0.9987476,0.0005375261,0.00014828012,0.0002122245,0.00016644242,0.00018793874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091973774,0.00067074195,0.00073261646,0.0018982891,0.003195185,0.0041157594,0.0010892926,0.0018764096,0.013312003],"category_scores_gemma":[0.0025488858,0.0007830111,0.001092228,0.0018693543,0.003301705,0.01014413,0.003686464,0.0041267974,0.0024115443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025190184,0.000019449506,0.00017787218,0.00004200148,0.000006906673,0.000102804224,0.00022623973,0.0002868893,0.00047375145,0.98911333,0.0032503405,0.0062752054],"study_design_scores_gemma":[0.000013111751,0.000014285801,0.00022901794,0.00002651783,0.000007937987,0.00019349446,0.00012823241,0.0009841541,0.00023653598,0.990042,0.008112499,0.000012190579],"about_ca_topic_score_codex":0.001989009,"about_ca_topic_score_gemma":0.0029601776,"teacher_disagreement_score":0.013312003,"about_ca_system_score_codex":0.0020585556,"about_ca_system_score_gemma":0.0009349087,"threshold_uncertainty_score":0.044533134},"labels":[],"label_agreement":null},{"id":"W2579393861","doi":"","title":"A Combinatorial Identity And Its Related Conjecture.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Conjecture; Identity (music); Combinatorics; Pure mathematics; Aesthetics","score_opus":0.007059196975863847,"score_gpt":0.20324724939189034,"score_spread":0.1961880524160265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579393861","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12299412,0.003663916,0.20472008,0.031365205,0.004216667,0.000115733346,0.0010807733,0.0005816639,0.63126177],"genre_scores_gemma":[0.8935182,0.002058306,0.02601732,0.005868668,0.00271402,0.00015574034,0.000989826,0.000239647,0.06843821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859625,0.0003649342,0.000061627885,0.00036825726,0.00039587138,0.0002131222],"domain_scores_gemma":[0.9942432,0.0032578825,0.0004143023,0.0010174636,0.0006506928,0.00041633658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012303776,0.00042987117,0.00073272607,0.0013122226,0.0026876556,0.003450564,0.0015345,0.0025201112,0.02340601],"category_scores_gemma":[0.009626989,0.00038723793,0.00080775254,0.0016897115,0.004558976,0.009006735,0.0034228424,0.0037627658,0.003484873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017448972,0.000022921153,0.00018438534,0.00003055925,0.0000027781307,0.000054452717,0.00011211856,0.00026775486,0.000120642275,0.9881314,0.0073032267,0.003752253],"study_design_scores_gemma":[0.00000805555,0.000009145194,0.00013387777,0.000016235857,0.0000039404704,0.0001300081,0.00009096315,0.0015874857,0.00012742291,0.9902362,0.0076510357,0.000005737431],"about_ca_topic_score_codex":0.0012353596,"about_ca_topic_score_gemma":0.00083679246,"teacher_disagreement_score":0.02340601,"about_ca_system_score_codex":0.0012420198,"about_ca_system_score_gemma":0.00084316236,"threshold_uncertainty_score":0.07830089},"labels":[],"label_agreement":null},{"id":"W2579568859","doi":"","title":"Some new results on k-cordial labeling.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.016619732643166935,"score_gpt":0.23325387578560505,"score_spread":0.21663414314243812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579568859","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05823668,0.009106541,0.39112467,0.014436893,0.0026852065,0.00018484589,0.002927889,0.0025598633,0.5187374],"genre_scores_gemma":[0.5648724,0.011860562,0.26353204,0.011618621,0.004799098,0.00052957085,0.0056287134,0.0019065568,0.1352525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99862635,0.0003064668,0.00010335086,0.0003627877,0.00037905364,0.00022198021],"domain_scores_gemma":[0.9953768,0.0024228597,0.00033285865,0.00092615804,0.0004467657,0.0004945995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015328629,0.00114307,0.0009405902,0.002761404,0.0025056598,0.005139594,0.0023662073,0.001992482,0.027926158],"category_scores_gemma":[0.006527467,0.000702862,0.0012502213,0.005249498,0.003438728,0.012734136,0.003907161,0.006092911,0.00543846],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053892712,0.0000622456,0.0003376921,0.00026931535,0.000013408843,0.00008466935,0.00020688369,0.0014269789,0.0008687266,0.9456556,0.020996565,0.030024013],"study_design_scores_gemma":[0.00001519933,0.000017082777,0.00027871743,0.000057825022,0.000017679318,0.00019468172,0.00010869151,0.003996574,0.0007884031,0.9567473,0.037760958,0.00001686435],"about_ca_topic_score_codex":0.0020670865,"about_ca_topic_score_gemma":0.0030671137,"teacher_disagreement_score":0.027926158,"about_ca_system_score_codex":0.0031172822,"about_ca_system_score_gemma":0.0011344748,"threshold_uncertainty_score":0.09342229},"labels":[],"label_agreement":null},{"id":"W2579588715","doi":"","title":"Edge Friendly Labelings of Graph - I.","year":2016,"lang":"it","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Enhanced Data Rates for GSM Evolution; Combinatorics; Edge-graceful labeling; Line graph; Discrete mathematics; Artificial intelligence; Computer science; Graph power","score_opus":0.012442636603090038,"score_gpt":0.22711236371561294,"score_spread":0.2146697271125229,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579588715","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15886612,0.0013253794,0.5110995,0.0042149285,0.0006833604,0.00019160645,0.0035994751,0.0025115414,0.3175081],"genre_scores_gemma":[0.7263992,0.0010755117,0.20767109,0.001938743,0.00046206894,0.00027946976,0.0041777166,0.0011093108,0.056886915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99854565,0.0004279049,0.00008772747,0.00034120108,0.00029883446,0.00029881994],"domain_scores_gemma":[0.99600947,0.0018247071,0.00037934605,0.00097580766,0.0003543246,0.00045636413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010102523,0.00071143475,0.0006293335,0.0013855242,0.002014994,0.0042693084,0.0014807965,0.0013383095,0.015929464],"category_scores_gemma":[0.0049405093,0.0005936852,0.0009999665,0.0020878143,0.0016716397,0.0051932787,0.0031430018,0.0030805904,0.003356387],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000665572,0.000044880377,0.00038769623,0.00006933551,0.000008547707,0.000048454334,0.00017133902,0.0017413651,0.0011324857,0.9717082,0.010684885,0.013936402],"study_design_scores_gemma":[0.000014403938,0.000019568255,0.0002787951,0.000028310245,0.000013653328,0.00013022799,0.00011635584,0.0074963523,0.0013756872,0.9732026,0.01730963,0.000014333122],"about_ca_topic_score_codex":0.0011668286,"about_ca_topic_score_gemma":0.0016262517,"teacher_disagreement_score":0.015929464,"about_ca_system_score_codex":0.0015774439,"about_ca_system_score_gemma":0.0007647903,"threshold_uncertainty_score":0.053289354},"labels":[],"label_agreement":null},{"id":"W2579647206","doi":"","title":"On incidence coloring for some graphs of maximum degree 4.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Brooks' theorem; Complete coloring; Edge coloring; Graph coloring; Combinatorics; 1-planar graph; Chordal graph; Graph; Physics; Graph power; Line graph","score_opus":0.025518699968569106,"score_gpt":0.2441269282610874,"score_spread":0.2186082282925183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579647206","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54686385,0.003007801,0.21291818,0.014686446,0.0007477558,0.00019829575,0.0027785092,0.0008966478,0.21790253],"genre_scores_gemma":[0.87246954,0.002237137,0.07877458,0.002058216,0.00070039625,0.0002065195,0.002348663,0.0003800022,0.040824935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992384,0.00023010868,0.00003450924,0.00015397285,0.00011428517,0.0002287785],"domain_scores_gemma":[0.99498594,0.0033637295,0.0004562322,0.00045251692,0.00030503087,0.00043655714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097010913,0.0006126977,0.0006562512,0.0015824361,0.0021791882,0.0030101284,0.0012861982,0.0015358302,0.011045257],"category_scores_gemma":[0.005091976,0.0006151948,0.0008159773,0.0020732789,0.002075097,0.0051497295,0.0018030986,0.0027117739,0.0011832267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016474149,0.000115666735,0.0018215033,0.0001643912,0.000027196984,0.00017908015,0.00047173037,0.008740698,0.0018643434,0.9482711,0.020681897,0.017497726],"study_design_scores_gemma":[0.000031085616,0.000017047294,0.0008793324,0.000035523477,0.000019618135,0.00019461039,0.00032439255,0.018910626,0.0007566358,0.9707419,0.008070327,0.000018824576],"about_ca_topic_score_codex":0.00323941,"about_ca_topic_score_gemma":0.0056209345,"teacher_disagreement_score":0.011045257,"about_ca_system_score_codex":0.0025088512,"about_ca_system_score_gemma":0.0010242634,"threshold_uncertainty_score":0.03695005},"labels":[],"label_agreement":null},{"id":"W2579740192","doi":"","title":"Weakly convex and convex domination numbers of some products of graphs","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Convex set; Convex polytope; Subderivative; Dominating set; Convex analysis; Regular polygon; Discrete mathematics; Graph; Vertex (graph theory); Convex optimization; Geometry","score_opus":0.01142241835444885,"score_gpt":0.2557556759484341,"score_spread":0.24433325759398528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579740192","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89548665,0.00058417505,0.07992296,0.00041669398,0.000030681294,0.000058019774,0.00095147337,0.00009047565,0.02245893],"genre_scores_gemma":[0.9724187,0.00041173436,0.021704856,0.00005677793,0.00008264174,0.000090937734,0.00063611317,0.000034459597,0.004563832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900913,0.0002036323,0.00006463633,0.0002855367,0.00029294315,0.00014401446],"domain_scores_gemma":[0.9962282,0.0020006625,0.00057430693,0.00023857506,0.00039820932,0.00055999815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086496794,0.00054409343,0.00051858986,0.002112986,0.0010988624,0.002030298,0.000500608,0.0003787742,0.0022342901],"category_scores_gemma":[0.0036609734,0.0002823343,0.00051530474,0.0012948674,0.0021665555,0.0027337994,0.0008729126,0.0007413925,0.00016383608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003540681,0.0000691888,0.012542824,0.00019651157,0.00009218071,0.00036889728,0.001268494,0.02302252,0.012014292,0.91952705,0.002702958,0.027841078],"study_design_scores_gemma":[0.00004599746,0.00017959358,0.013836868,0.000053745516,0.000094624455,0.0012576807,0.0006397102,0.15884718,0.008029173,0.79839176,0.018559387,0.0000642561],"about_ca_topic_score_codex":0.0011761507,"about_ca_topic_score_gemma":0.0012468434,"teacher_disagreement_score":0.0022342901,"about_ca_system_score_codex":0.0014367499,"about_ca_system_score_gemma":0.0004398291,"threshold_uncertainty_score":0.010424435},"labels":[],"label_agreement":null},{"id":"W2579747194","doi":"","title":"On The Sequential Number And Super Edge-Magic Deficiency Of Graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; MAGIC (telescope); Combinatorics; Computer science; Artificial intelligence; Astronomy; Physics","score_opus":0.013027618242226431,"score_gpt":0.22437219906192907,"score_spread":0.21134458081970264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579747194","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6281603,0.0035868061,0.2044501,0.010895045,0.000550287,0.000096827425,0.0016844581,0.00051766756,0.1500585],"genre_scores_gemma":[0.9397992,0.0012066494,0.043845408,0.0007347378,0.0003467949,0.00008772095,0.0007320247,0.0001374466,0.013110051],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990652,0.00031095432,0.00004991075,0.0001991615,0.0002011388,0.0001736248],"domain_scores_gemma":[0.9915896,0.0057983208,0.00062140706,0.00094978255,0.00046575515,0.0005751212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016382165,0.0004955138,0.00087610947,0.0018064531,0.0015126056,0.0023919428,0.0015278086,0.0013784472,0.008692134],"category_scores_gemma":[0.010846847,0.0005255681,0.0005319983,0.0018442948,0.0030762865,0.008462219,0.0019533592,0.0022170118,0.00094956305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001572223,0.00004693023,0.0015279093,0.00010709519,0.000013291243,0.000066941044,0.00016632023,0.0045692576,0.0010422865,0.96913147,0.0070545087,0.016116884],"study_design_scores_gemma":[0.000025045674,0.00001728449,0.00047282153,0.000022836684,0.000010146482,0.00015377623,0.000099958714,0.012030198,0.0005087421,0.9833265,0.0033221322,0.000010630858],"about_ca_topic_score_codex":0.0015004684,"about_ca_topic_score_gemma":0.0016693273,"teacher_disagreement_score":0.008692134,"about_ca_system_score_codex":0.0014521139,"about_ca_system_score_gemma":0.00094292406,"threshold_uncertainty_score":0.029078126},"labels":[],"label_agreement":null},{"id":"W2579755476","doi":"","title":"On the Hosoya index and the Merrifield-Simmons index of bicyclic graphs with given matching number.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Index (typography); Matching (statistics); Discrete mathematics; Statistics; Computer science","score_opus":0.012962276215817291,"score_gpt":0.2520460377340407,"score_spread":0.23908376151822341,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579755476","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6799352,0.0056872284,0.059206486,0.0030798116,0.00058226415,0.000073135714,0.0010196605,0.00028124597,0.250135],"genre_scores_gemma":[0.98286545,0.0015393422,0.0065128775,0.00023845812,0.00038457397,0.000044413056,0.00029422154,0.00005726412,0.008063447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942386,0.00015689932,0.000026782014,0.000095083604,0.00015619182,0.00014113488],"domain_scores_gemma":[0.9969627,0.001560577,0.00049337104,0.00022528345,0.0003193169,0.0004387744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009917666,0.00052768056,0.00084710104,0.0038668646,0.0013593542,0.0021446378,0.0012313483,0.0010504833,0.007931298],"category_scores_gemma":[0.006990321,0.00025845403,0.0003193911,0.002818761,0.0023096686,0.0047906977,0.0016896358,0.001552552,0.0009283778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016255437,0.000028385653,0.0013159616,0.00006596413,0.000013217914,0.00007324496,0.00028833555,0.0034743045,0.0010928438,0.97602004,0.0037757808,0.013689312],"study_design_scores_gemma":[0.000027721073,0.00003506545,0.001605177,0.000051421655,0.000018524122,0.00020255859,0.00023570441,0.013272391,0.00079298124,0.978323,0.0054051387,0.000030268842],"about_ca_topic_score_codex":0.001825957,"about_ca_topic_score_gemma":0.0023385098,"teacher_disagreement_score":0.007931298,"about_ca_system_score_codex":0.0015546017,"about_ca_system_score_gemma":0.000604207,"threshold_uncertainty_score":0.026532829},"labels":[],"label_agreement":null},{"id":"W2579796062","doi":"","title":"Matchings in 4-total restrained domination vertex critical graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Graph","score_opus":0.012588696912176423,"score_gpt":0.28900393182183975,"score_spread":0.27641523490966335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579796062","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8305109,0.0005854258,0.06254486,0.0007980297,0.00012804625,0.00018202774,0.0008693603,0.0005021467,0.10387917],"genre_scores_gemma":[0.95768183,0.0002509797,0.0173598,0.00021003645,0.00003863683,0.000078367615,0.0007293364,0.000101032565,0.023549953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966836,0.000056014356,0.00001714694,0.000069257,0.000086735134,0.00010247331],"domain_scores_gemma":[0.9988356,0.00041756354,0.00021288684,0.00013553943,0.00018675336,0.00021166449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002802198,0.0003672512,0.00043510244,0.0015378278,0.0015344189,0.0013286518,0.00088037504,0.00076624274,0.011390668],"category_scores_gemma":[0.002143549,0.00038670746,0.0003930293,0.0010784777,0.00091313856,0.00177742,0.0012182299,0.0008047743,0.0011246926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046355254,0.00011798429,0.0035350188,0.0003324929,0.00006947047,0.001413024,0.0010725236,0.00988954,0.01711923,0.91414297,0.009343461,0.042500775],"study_design_scores_gemma":[0.00012129924,0.00007835104,0.002601475,0.00010666671,0.00008938238,0.0012218877,0.0008265704,0.033651203,0.009760826,0.925885,0.02562313,0.000034302757],"about_ca_topic_score_codex":0.002241847,"about_ca_topic_score_gemma":0.00360621,"teacher_disagreement_score":0.011390668,"about_ca_system_score_codex":0.0009369713,"about_ca_system_score_gemma":0.00054146245,"threshold_uncertainty_score":0.038105547},"labels":[],"label_agreement":null},{"id":"W2579879218","doi":"","title":"Unique basis graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Basis (linear algebra); Geometry","score_opus":0.010930514856325233,"score_gpt":0.21687160193659177,"score_spread":0.20594108708026654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579879218","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08344003,0.0034206116,0.28609657,0.0047071013,0.0015490202,0.00015350123,0.0040759128,0.0016600647,0.6148972],"genre_scores_gemma":[0.66783065,0.0026215273,0.15362297,0.0019437146,0.00076108286,0.00033795703,0.006258529,0.0011780302,0.16544557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991941,0.00019398384,0.000032133146,0.00023671509,0.00018287354,0.00016021465],"domain_scores_gemma":[0.9987024,0.00039062198,0.00011909685,0.00035511798,0.00023779162,0.00019501924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062456937,0.0006985802,0.0008705109,0.0019749824,0.002154855,0.0029208031,0.0013597226,0.0013209677,0.033337303],"category_scores_gemma":[0.0026283618,0.000535015,0.0008415715,0.0017944564,0.0013962514,0.0043978575,0.0030769242,0.0033959232,0.008258317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024733059,0.000024983186,0.00018796253,0.000061363666,0.0000075957173,0.0000277621,0.00007004563,0.0004025245,0.00054328755,0.9610715,0.014624153,0.022954024],"study_design_scores_gemma":[0.000007619056,0.000006387353,0.00016134196,0.000027752463,0.000009424119,0.00013014609,0.00008088101,0.0021334898,0.00077704067,0.9703298,0.026327465,0.000008645666],"about_ca_topic_score_codex":0.0007091701,"about_ca_topic_score_gemma":0.0015803033,"teacher_disagreement_score":0.033337303,"about_ca_system_score_codex":0.0011117762,"about_ca_system_score_gemma":0.00070746464,"threshold_uncertainty_score":0.11152434},"labels":[],"label_agreement":null},{"id":"W2591604206","doi":"","title":"On the complexity of recognizing tenacious graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.07314943444469264,"score_gpt":0.31333394933723807,"score_spread":0.24018451489254544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591604206","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44681907,0.007149053,0.35581616,0.034054335,0.0013481388,0.0005462525,0.009056445,0.0032626688,0.14194788],"genre_scores_gemma":[0.85640234,0.0028236879,0.10038238,0.0024545062,0.0009846553,0.0003592483,0.011791252,0.00087009056,0.023931846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99588263,0.0010984476,0.00033829064,0.0010335338,0.0010233884,0.0006237398],"domain_scores_gemma":[0.9527164,0.03887897,0.0017697931,0.0038560438,0.0015965382,0.0011823351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020910287,0.0009730648,0.00161246,0.0018526794,0.0030805245,0.0071041165,0.003531457,0.0030862554,0.018639967],"category_scores_gemma":[0.0326358,0.0009770069,0.0020063587,0.0034261944,0.0036703409,0.021404825,0.0057424987,0.0060886764,0.0030272563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007728317,0.00044564417,0.0069621815,0.0011146249,0.00021362177,0.00074136915,0.0017019971,0.04440171,0.0037329027,0.7579363,0.06860338,0.11337349],"study_design_scores_gemma":[0.000029608535,0.000022699789,0.00069002784,0.000042645563,0.000037402788,0.00027998054,0.00035164529,0.04399325,0.0009731309,0.9473974,0.0061532687,0.000029031258],"about_ca_topic_score_codex":0.005132969,"about_ca_topic_score_gemma":0.0064022345,"teacher_disagreement_score":0.018639967,"about_ca_system_score_codex":0.003007238,"about_ca_system_score_gemma":0.0019383794,"threshold_uncertainty_score":0.06235683},"labels":[],"label_agreement":null},{"id":"W25916205","doi":"10.1007/s13277-015-3292-7","title":"The Linear 2-Arboricity of Outerplanar Graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arboricity; Mathematics; Dense graph; Outerplanar graph; Pathwidth; 1-planar graph; Combinatorics; Chordal graph; Graph; Planar graph; Line graph","score_opus":0.013677726103518254,"score_gpt":0.27601834291488475,"score_spread":0.2623406168113665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W25916205","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73239076,0.0026835673,0.17230558,0.0015181877,0.00020270998,0.00012066043,0.0023947544,0.00038639735,0.08799742],"genre_scores_gemma":[0.96755713,0.0017289236,0.018738296,0.00022358076,0.00017458614,0.00008440163,0.0011791214,0.00008007143,0.010233862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997161,0.00007057094,0.000016271799,0.000081146674,0.00006560456,0.000050298604],"domain_scores_gemma":[0.9984932,0.0007081551,0.00045053745,0.000118387994,0.000093373026,0.00013645412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023786582,0.00037958822,0.00023904008,0.001143462,0.0004972142,0.0009856955,0.0003898134,0.00041799978,0.004275861],"category_scores_gemma":[0.0018580261,0.00021868742,0.0003888276,0.00092390267,0.0009740091,0.0014383127,0.0008441616,0.00058557733,0.00057920086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037495687,0.00007019629,0.0056339256,0.00076823874,0.00010065651,0.0015065718,0.0009413722,0.031123644,0.030015005,0.8391196,0.008718833,0.08162704],"study_design_scores_gemma":[0.00004668736,0.00014625612,0.006687111,0.000056328274,0.000057990655,0.0022903979,0.00025571772,0.045533627,0.0050168186,0.90903485,0.030834349,0.00003975291],"about_ca_topic_score_codex":0.00075620797,"about_ca_topic_score_gemma":0.0014226239,"teacher_disagreement_score":0.004275861,"about_ca_system_score_codex":0.0004357076,"about_ca_system_score_gemma":0.00019548579,"threshold_uncertainty_score":0.014304161},"labels":[],"label_agreement":null},{"id":"W2591672105","doi":"","title":"Combinatorial Identities For l-Regular Overpartitions.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.018939446268640373,"score_gpt":0.2734173562780941,"score_spread":0.25447791000945374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591672105","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12750147,0.0018834763,0.28074303,0.0044179102,0.0010121993,0.00013504925,0.0019238343,0.0009540557,0.5814289],"genre_scores_gemma":[0.8978465,0.0008107832,0.03330846,0.0013854722,0.0008279003,0.00015085132,0.0012174356,0.00041943605,0.06403303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997979,0.00058198516,0.00014488275,0.0003617269,0.00060360396,0.00032879435],"domain_scores_gemma":[0.99726844,0.0009577021,0.00030785534,0.0005840447,0.00047577097,0.00040622067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014821205,0.0005922904,0.00067482045,0.0020757536,0.002879836,0.005863548,0.0012188728,0.0011998266,0.020346634],"category_scores_gemma":[0.004650912,0.0005092133,0.001167743,0.0016473683,0.0038465813,0.0086887665,0.0036333927,0.0031728516,0.0051301136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007288069,0.000010385121,0.00008107791,0.000014434589,0.0000022923434,0.00003179572,0.00009308492,0.00012305634,0.00015122409,0.99591655,0.0017024087,0.0018664504],"study_design_scores_gemma":[0.000004924375,0.0000030945355,0.00008067561,0.000009526515,0.000003611439,0.000082413404,0.00004688534,0.0011623548,0.0002121216,0.9936273,0.004759856,0.000007236188],"about_ca_topic_score_codex":0.0010029142,"about_ca_topic_score_gemma":0.0012470708,"teacher_disagreement_score":0.020346634,"about_ca_system_score_codex":0.002002548,"about_ca_system_score_gemma":0.00078345515,"threshold_uncertainty_score":0.0680663},"labels":[],"label_agreement":null},{"id":"W2591798008","doi":"","title":"Firefighting on Geometric Graphs with Density Bounds.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.012368162314488852,"score_gpt":0.2283409469996578,"score_spread":0.21597278468516895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591798008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.107275106,0.0021677248,0.80883473,0.0025909871,0.0003435323,0.00024979925,0.0006702441,0.0016896157,0.07617819],"genre_scores_gemma":[0.7819553,0.0017352214,0.17727073,0.0007324896,0.00041464562,0.00028769264,0.00097000616,0.0005366568,0.036097318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842656,0.00046391148,0.000041588344,0.00036723976,0.00033641473,0.0003644653],"domain_scores_gemma":[0.9928941,0.00425768,0.0005115229,0.0011545722,0.000497326,0.00068468397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018044035,0.0012082187,0.001232486,0.0014690078,0.0017934922,0.002408795,0.0034622224,0.0018212169,0.013591347],"category_scores_gemma":[0.016164115,0.0006692608,0.0009494039,0.0015539563,0.0019501157,0.006452081,0.0033108378,0.0027957004,0.002325874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040310647,0.00028887045,0.0016774669,0.00031668716,0.0000910361,0.0001515655,0.00044904015,0.16778973,0.0038623044,0.7064401,0.030960066,0.087570086],"study_design_scores_gemma":[0.00005456384,0.000083624225,0.0005515595,0.000070651535,0.000044361608,0.0001637442,0.00015099834,0.4653029,0.002242917,0.5234369,0.007871916,0.000025832329],"about_ca_topic_score_codex":0.004693445,"about_ca_topic_score_gemma":0.004024976,"teacher_disagreement_score":0.013591347,"about_ca_system_score_codex":0.0026499096,"about_ca_system_score_gemma":0.0012293889,"threshold_uncertainty_score":0.045467615},"labels":[],"label_agreement":null},{"id":"W2591800080","doi":"","title":"On the upper broadcast domination number.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.020878372076711466,"score_gpt":0.3067115787654745,"score_spread":0.28583320668876305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591800080","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18134521,0.009417451,0.1893226,0.021817636,0.0020808906,0.00019363403,0.0037228575,0.0012123706,0.5908874],"genre_scores_gemma":[0.9017963,0.0051677236,0.031810395,0.0026741808,0.002038688,0.00052521477,0.0015838845,0.00057688996,0.053826798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99765706,0.0006014894,0.00008275055,0.00043121245,0.0006464419,0.0005810976],"domain_scores_gemma":[0.9758513,0.019165235,0.0010146815,0.0015153919,0.0011256952,0.0013276935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024840059,0.00080311607,0.001427523,0.0029384745,0.0028444377,0.004486506,0.0026290945,0.0019201848,0.026237959],"category_scores_gemma":[0.022505041,0.0005971259,0.0006747687,0.0028474377,0.003530806,0.009109229,0.0033967819,0.005386445,0.004207463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023309811,0.0000546534,0.00083212834,0.00022866852,0.000021519565,0.00008163643,0.00027284902,0.005829304,0.0015003472,0.941175,0.026995204,0.02277564],"study_design_scores_gemma":[0.000048030965,0.0000234325,0.0005902388,0.00009086278,0.000027870843,0.00019465569,0.00008782098,0.017173816,0.0010892138,0.96721655,0.013430825,0.000026843316],"about_ca_topic_score_codex":0.0018757052,"about_ca_topic_score_gemma":0.0023630161,"teacher_disagreement_score":0.026237959,"about_ca_system_score_codex":0.0034791545,"about_ca_system_score_gemma":0.0016121976,"threshold_uncertainty_score":0.08777475},"labels":[],"label_agreement":null},{"id":"W2591820200","doi":"","title":"On Some Regular Polyhedrons In The Taxicab 3-Space.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematics and Applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Polyhedron; Mathematics; Space (punctuation); Combinatorics; Computer science","score_opus":0.04109061620424486,"score_gpt":0.32192820763947183,"score_spread":0.28083759143522696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591820200","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5112426,0.0024298555,0.17525674,0.0027927847,0.0005434384,0.00015596664,0.00293927,0.00043387825,0.30420536],"genre_scores_gemma":[0.8898966,0.0010979688,0.04053843,0.0004421707,0.00021537744,0.00014551099,0.0024270297,0.00027523426,0.06496181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995394,0.00010040965,0.00002169861,0.00006903127,0.00014843362,0.0001210257],"domain_scores_gemma":[0.99943584,0.00018046892,0.00008990911,0.00005939185,0.00009866545,0.00013564456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002730669,0.0006350027,0.00067713583,0.0016242254,0.0022827531,0.0030360722,0.0008928202,0.0010553775,0.014446732],"category_scores_gemma":[0.0014799902,0.00041736252,0.0008126968,0.0012551831,0.002533019,0.0023426733,0.0021985602,0.002732852,0.002675449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006900756,0.000020828476,0.00026146608,0.000050458613,0.000010681727,0.00015396412,0.00019134211,0.0026371225,0.00056498864,0.9864811,0.0032178643,0.0063412497],"study_design_scores_gemma":[0.000033350112,0.000027205502,0.00051442225,0.000039031453,0.0000072930047,0.00024808684,0.0003451274,0.01066705,0.00043149112,0.9768494,0.010817144,0.00002040906],"about_ca_topic_score_codex":0.005188573,"about_ca_topic_score_gemma":0.0053437757,"teacher_disagreement_score":0.014446732,"about_ca_system_score_codex":0.0013437663,"about_ca_system_score_gemma":0.0006028354,"threshold_uncertainty_score":0.048329115},"labels":[],"label_agreement":null},{"id":"W2591835446","doi":"","title":"The Maximum Size of C 4 -Free Planar Graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Planar; Combinatorics; Planar graph; Graph; Computer science; Computer graphics (images)","score_opus":0.017474622676120894,"score_gpt":0.27933435601917594,"score_spread":0.26185973334305507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591835446","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7983769,0.0024994917,0.040862508,0.008188174,0.00028872787,0.00012958958,0.014526583,0.0008627309,0.13426517],"genre_scores_gemma":[0.9730055,0.0008977129,0.011715912,0.00043622273,0.00022876673,0.00015749664,0.003261274,0.0002653012,0.01003197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991357,0.00017116561,0.000040234663,0.00019508337,0.00020750877,0.00025038765],"domain_scores_gemma":[0.9890742,0.007844639,0.00095814845,0.00063479156,0.00057879795,0.00090950425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079878554,0.000634328,0.00067376526,0.0021891387,0.0011656304,0.0033720073,0.0020438158,0.0017151396,0.014928407],"category_scores_gemma":[0.009604638,0.0005617207,0.0005701657,0.0018248875,0.0015636896,0.004863744,0.0017665043,0.0014833453,0.0015568341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024503253,0.00016730741,0.0089710755,0.0012758881,0.00020039092,0.00047359915,0.0008814145,0.035169378,0.032586046,0.77956784,0.058193527,0.080063336],"study_design_scores_gemma":[0.00017209105,0.00013658647,0.0063739284,0.00016333236,0.00013647802,0.0008318134,0.0004953708,0.048098635,0.015420796,0.90754324,0.020557396,0.000070359136],"about_ca_topic_score_codex":0.0019113036,"about_ca_topic_score_gemma":0.0023161992,"teacher_disagreement_score":0.014928407,"about_ca_system_score_codex":0.0014816858,"about_ca_system_score_gemma":0.0012630792,"threshold_uncertainty_score":0.049940467},"labels":[],"label_agreement":null},{"id":"W2591848420","doi":"","title":"On Harmonic Indices of Trees, Unicyclic graphs and Bicyclic graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.03238055584523256,"score_gpt":0.30340022209151707,"score_spread":0.2710196662462845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591848420","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3290364,0.018862942,0.14617375,0.005123962,0.0023854764,0.00011981248,0.0010992227,0.0003480986,0.49685037],"genre_scores_gemma":[0.89026564,0.009602364,0.0287743,0.0011616806,0.0018879364,0.00016371661,0.0009518225,0.000279736,0.0669128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957544,0.00010515635,0.000020898553,0.000077043136,0.00012887787,0.00009257582],"domain_scores_gemma":[0.9983405,0.0008367735,0.00024725706,0.00014157187,0.00019627211,0.00023762816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005182958,0.0006322972,0.0008111348,0.0032521808,0.0014147473,0.0025049888,0.0012373857,0.0011151832,0.00907255],"category_scores_gemma":[0.004079988,0.00042723052,0.000377637,0.0027085247,0.0024114982,0.00448582,0.0022673674,0.0023078772,0.0017990094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021066195,0.000017400398,0.0002853864,0.000052640906,0.0000054861557,0.000050418726,0.00021636311,0.00093820685,0.00046448217,0.9810085,0.0046186172,0.012321335],"study_design_scores_gemma":[0.000006577433,0.0000099697,0.00035185518,0.000035669178,0.000005860426,0.00010677425,0.00016602039,0.0037750264,0.00015515601,0.9881826,0.0071948664,0.000009586725],"about_ca_topic_score_codex":0.0016181136,"about_ca_topic_score_gemma":0.0024746952,"teacher_disagreement_score":0.00907255,"about_ca_system_score_codex":0.0012343962,"about_ca_system_score_gemma":0.00046750205,"threshold_uncertainty_score":0.030350685},"labels":[],"label_agreement":null},{"id":"W2591852761","doi":"","title":"Panconnectedness of K-trees with Sufficiently Large Toughness.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Toughness; Tree (set theory); Combinatorics; Composite material; Materials science","score_opus":0.017093275294003507,"score_gpt":0.2818853324690745,"score_spread":0.264792057175071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591852761","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80977434,0.0009486551,0.108887486,0.0027794105,0.0001984665,0.00007800255,0.0016624483,0.0005082511,0.07516288],"genre_scores_gemma":[0.9740071,0.00039489532,0.01611415,0.00036952161,0.00014504662,0.00007494325,0.000751492,0.00014086075,0.00800199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993191,0.00015162748,0.000037814647,0.00017441632,0.00016255297,0.00015456865],"domain_scores_gemma":[0.98849773,0.0070608268,0.0011750286,0.0008595098,0.00089372194,0.0015132019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007821513,0.00047480068,0.0006206193,0.001702639,0.0015584558,0.0025238874,0.0012015913,0.0012320745,0.011927558],"category_scores_gemma":[0.010358879,0.00073577475,0.0006068635,0.0013130421,0.0020481749,0.0051866416,0.0021380181,0.0020423117,0.0011273146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030167607,0.00008104818,0.003292373,0.00031396013,0.00006381865,0.0006786434,0.0008493076,0.009717337,0.008981249,0.95044464,0.010605058,0.014670851],"study_design_scores_gemma":[0.000038201193,0.000036212237,0.0020206415,0.0000508812,0.000039327355,0.0006774792,0.00029139488,0.02962517,0.0015133661,0.96140987,0.004274157,0.000023290557],"about_ca_topic_score_codex":0.0011579738,"about_ca_topic_score_gemma":0.0018027399,"teacher_disagreement_score":0.011927558,"about_ca_system_score_codex":0.000794989,"about_ca_system_score_gemma":0.00040221808,"threshold_uncertainty_score":0.039901614},"labels":[],"label_agreement":null},{"id":"W2591863098","doi":"","title":"P m U P k -equipackable paths and cycles.","year":2017,"lang":"ca","type":"article","venue":"Ars Combinatoria","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01918080020038879,"score_gpt":0.2706396959340914,"score_spread":0.25145889573370256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591863098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16787438,0.0039101955,0.6506415,0.0039014274,0.00092123746,0.00032997466,0.005569181,0.0035928062,0.16325933],"genre_scores_gemma":[0.71148556,0.0019966238,0.22184148,0.0010369126,0.00037089307,0.0004993212,0.0058701215,0.000833284,0.056065805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988543,0.00024563572,0.000103379476,0.00028041968,0.00028378956,0.0002325284],"domain_scores_gemma":[0.99603695,0.0015520648,0.00035988755,0.0014117876,0.0004114308,0.00022785617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055692194,0.0007125312,0.000637745,0.0018991785,0.0015126128,0.0026684136,0.0011862308,0.0011261597,0.01818504],"category_scores_gemma":[0.0085761435,0.000439024,0.00058051234,0.0028935033,0.0013520084,0.0046304544,0.0030699188,0.0019826433,0.003923686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065520784,0.00015935175,0.0016337456,0.00032388,0.000055027656,0.00057627144,0.00033682433,0.0112902,0.004560524,0.71497303,0.038047817,0.22738811],"study_design_scores_gemma":[0.000028068736,0.000060810235,0.00065660034,0.00010254876,0.000027914999,0.0005805994,0.00020825212,0.024513494,0.005568011,0.9314413,0.036786098,0.000026263959],"about_ca_topic_score_codex":0.0011389658,"about_ca_topic_score_gemma":0.0015710151,"teacher_disagreement_score":0.01818504,"about_ca_system_score_codex":0.00081746606,"about_ca_system_score_gemma":0.0010219329,"threshold_uncertainty_score":0.060835063},"labels":[],"label_agreement":null},{"id":"W2591882334","doi":"","title":"Parallel Packing and Covering of an Isosceles Right Triangle with Sequences of Squares.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematics and Applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Isosceles triangle; Mathematics; Combinatorics; Geometry","score_opus":0.03914414137037892,"score_gpt":0.3120414431182071,"score_spread":0.27289730174782817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591882334","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6425792,0.0008964451,0.20609228,0.0005499479,0.00059046084,0.00009733303,0.00052727724,0.0004991111,0.14816794],"genre_scores_gemma":[0.89911777,0.00044267406,0.07002756,0.00012042336,0.000112483525,0.000074935466,0.00065692613,0.00019368595,0.029253548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995459,0.00009163848,0.000027416218,0.00010000072,0.00013169351,0.00010342333],"domain_scores_gemma":[0.99942195,0.0001629834,0.00007719126,0.00019261197,0.00004921773,0.00009610474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016368712,0.00046010167,0.0005450397,0.0006003916,0.0011359341,0.0010336358,0.0007171534,0.000785624,0.009538487],"category_scores_gemma":[0.001349426,0.00044674208,0.0006609481,0.000630363,0.0009541766,0.0013068969,0.0022309304,0.0009284026,0.001569836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008162346,0.00019330833,0.0020417937,0.00033011206,0.00006511808,0.0031976847,0.00089467294,0.037714407,0.046466112,0.8227445,0.009109991,0.076426126],"study_design_scores_gemma":[0.000115456016,0.00025352274,0.0024578536,0.00007726427,0.000056687764,0.0032887147,0.0005666552,0.16431773,0.027152948,0.7671611,0.034498457,0.00005367647],"about_ca_topic_score_codex":0.0017729063,"about_ca_topic_score_gemma":0.0013205084,"teacher_disagreement_score":0.009538487,"about_ca_system_score_codex":0.00034347517,"about_ca_system_score_gemma":0.0002628075,"threshold_uncertainty_score":0.031909466},"labels":[],"label_agreement":null},{"id":"W2591927635","doi":"","title":"A Fan-type result on fractional ID-k-factor-critical graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Type (biology); Factor (programming language); Combinatorics; Computer science; Geology; Programming language","score_opus":0.03812353792731751,"score_gpt":0.35103290513582835,"score_spread":0.3129093672085108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591927635","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22455297,0.0033365537,0.17943497,0.004261575,0.00119576,0.000115072624,0.0011654809,0.0010021476,0.5849355],"genre_scores_gemma":[0.9188386,0.0013553954,0.02690517,0.0012293676,0.0004571034,0.00007195887,0.0008235225,0.00026091677,0.050057918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996966,0.000052678894,0.000010322739,0.000089281224,0.0000788098,0.00007231276],"domain_scores_gemma":[0.9985045,0.0006985234,0.00013529322,0.0001710252,0.00025559295,0.00023501615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004726568,0.0005769837,0.00050934654,0.001888573,0.0019926727,0.0018812141,0.00088528683,0.0010085636,0.01425567],"category_scores_gemma":[0.0034842782,0.00036936702,0.00049489964,0.0012460401,0.0018753052,0.0032182934,0.00145736,0.0017788191,0.001586715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092065835,0.000030170371,0.0007460794,0.00014722408,0.000013049844,0.00018619833,0.0002614119,0.0017558686,0.0019214813,0.97396934,0.0106080165,0.010269007],"study_design_scores_gemma":[0.000024742105,0.0000187802,0.00049759867,0.00006584405,0.000029951112,0.00042005634,0.00020121645,0.006104014,0.0016100181,0.9710023,0.020010546,0.000015041949],"about_ca_topic_score_codex":0.0016615617,"about_ca_topic_score_gemma":0.0021068538,"teacher_disagreement_score":0.01425567,"about_ca_system_score_codex":0.001295984,"about_ca_system_score_gemma":0.000485237,"threshold_uncertainty_score":0.047689974},"labels":[],"label_agreement":null},{"id":"W2591932609","doi":"","title":"The Ramsey Numbers R(C ≤n , K m ).","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Ramsey's theorem; Combinatorics","score_opus":0.015981630131488737,"score_gpt":0.26200048235395673,"score_spread":0.246018852222468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591932609","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26648015,0.00676766,0.18394041,0.008716781,0.00148279,0.00018679221,0.0048811845,0.0019053369,0.5256389],"genre_scores_gemma":[0.8953682,0.0016039147,0.040590674,0.00062668783,0.00037609538,0.00020479156,0.001123693,0.00024166063,0.059864324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889696,0.0002767496,0.000069277,0.00031258198,0.00025284901,0.00019158843],"domain_scores_gemma":[0.9972498,0.0010874699,0.00036099306,0.0005305098,0.00042011772,0.0003510831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011516041,0.0004891507,0.0004294358,0.00217165,0.0020099059,0.0040145866,0.00086619385,0.0010475203,0.016967444],"category_scores_gemma":[0.00639408,0.000351278,0.00050046033,0.0010346526,0.002565368,0.006228673,0.002399842,0.0019317386,0.003790555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012221845,0.000022297274,0.0006354384,0.00011551552,0.000014215394,0.000073321375,0.00023903779,0.00075866934,0.0013628817,0.96858853,0.010362456,0.017705455],"study_design_scores_gemma":[0.000018492594,0.00002409629,0.0013186255,0.00008607596,0.000019848798,0.0005014577,0.00025504243,0.004085034,0.0021942789,0.9475838,0.04387491,0.000038342838],"about_ca_topic_score_codex":0.0013673955,"about_ca_topic_score_gemma":0.0016900164,"teacher_disagreement_score":0.016967444,"about_ca_system_score_codex":0.0017645295,"about_ca_system_score_gemma":0.001146426,"threshold_uncertainty_score":0.05676174},"labels":[],"label_agreement":null},{"id":"W2592020534","doi":"","title":"The signed cycle domatic number of a graph","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.014183076852899861,"score_gpt":0.30502034391492233,"score_spread":0.29083726706202245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592020534","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6864145,0.0007103568,0.15631168,0.0021986018,0.0011053409,0.00014309541,0.0013902921,0.00054984546,0.15117638],"genre_scores_gemma":[0.93218875,0.00047273084,0.033214632,0.0003637022,0.00033932665,0.00016905997,0.0007340676,0.00013116299,0.03238641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937266,0.00016686216,0.000050015227,0.00014269062,0.00016946271,0.00009832746],"domain_scores_gemma":[0.99818736,0.0006449549,0.000290088,0.00013896015,0.00033279127,0.0004057842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054589706,0.00046771622,0.00048618705,0.0037250058,0.0015185486,0.0035229044,0.00077165314,0.0010450438,0.009227304],"category_scores_gemma":[0.0030971179,0.00026818836,0.00031270107,0.0019834447,0.0019546184,0.0036552434,0.0012696952,0.0011029163,0.0011861104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015295533,0.000028378447,0.0011577865,0.000074848715,0.00001016322,0.000093168506,0.00021815118,0.0014175124,0.0036790518,0.9641154,0.003156261,0.025896253],"study_design_scores_gemma":[0.000030274245,0.00007146671,0.0011038269,0.00004645968,0.000018661278,0.00037030593,0.00017631525,0.0102664605,0.0036032838,0.9661373,0.01813367,0.000041879222],"about_ca_topic_score_codex":0.00047045585,"about_ca_topic_score_gemma":0.00074608834,"teacher_disagreement_score":0.009227304,"about_ca_system_score_codex":0.0009834536,"about_ca_system_score_gemma":0.0007429998,"threshold_uncertainty_score":0.030868411},"labels":[],"label_agreement":null},{"id":"W2592036444","doi":"","title":"On The Extended Lee Weights Modulo 2e Of Linear Codes Over Z 2s .","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Modulo; Mathematics; Arithmetic; Combinatorics; Discrete mathematics","score_opus":0.01572812407434099,"score_gpt":0.2523891981314223,"score_spread":0.2366610740570813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592036444","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78188837,0.0020359266,0.068415344,0.0021332258,0.00078858266,0.00007431055,0.0005491875,0.0002175023,0.1438977],"genre_scores_gemma":[0.96502686,0.0011491205,0.0080069285,0.00036549964,0.00050789956,0.00006404042,0.0003044172,0.00011343964,0.024461811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993748,0.00014013403,0.000028362421,0.00006883585,0.00018480058,0.00020316824],"domain_scores_gemma":[0.9987602,0.00042935042,0.00029744842,0.00017027777,0.00012927984,0.00021349634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007338525,0.0008743006,0.0006216078,0.0027989047,0.0014561496,0.002053722,0.0007640925,0.0009245886,0.0077583333],"category_scores_gemma":[0.0029740625,0.00039980284,0.0004900432,0.001697585,0.0028886427,0.004098763,0.0024717988,0.0020722738,0.0015350225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011030616,0.000039097733,0.00059851207,0.00005589495,0.000010791705,0.00020257743,0.00024825515,0.0023036383,0.0016779883,0.98171806,0.0017658742,0.011269102],"study_design_scores_gemma":[0.000024189363,0.000031135143,0.0005357323,0.00004528098,0.000007096951,0.00019115416,0.000106684114,0.006040889,0.0010078883,0.9885582,0.0034276794,0.000024078152],"about_ca_topic_score_codex":0.00086933933,"about_ca_topic_score_gemma":0.0011557466,"teacher_disagreement_score":0.0077583333,"about_ca_system_score_codex":0.00085740915,"about_ca_system_score_gemma":0.00061738334,"threshold_uncertainty_score":0.025954187},"labels":[],"label_agreement":null},{"id":"W2592063071","doi":"","title":"L(d, 1)-labelings of the edge-multiplicity-path-replacements.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Multiplicity (mathematics); Enhanced Data Rates for GSM Evolution; Path (computing); Combinatorics; Geometry; Computer science; Telecommunications; Computer network","score_opus":0.01509829393060794,"score_gpt":0.24517396271623143,"score_spread":0.2300756687856235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592063071","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36416593,0.0017146289,0.41626227,0.005892146,0.0007763589,0.00029987888,0.0074723475,0.0025674463,0.20084901],"genre_scores_gemma":[0.7893775,0.0007148143,0.16595134,0.0013686535,0.00026149326,0.00030922532,0.003987454,0.00066955166,0.03735995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823964,0.0005430194,0.00012867691,0.0004327574,0.00027632574,0.00037962155],"domain_scores_gemma":[0.9939825,0.0030197813,0.0005715919,0.0013624344,0.0005760213,0.00048771888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013278169,0.0006157949,0.0007021691,0.0015538387,0.0024009573,0.0035691082,0.001833928,0.0017418823,0.016969394],"category_scores_gemma":[0.008763156,0.0006024925,0.0010571379,0.0019182175,0.0019405466,0.004245341,0.0022471093,0.0026609013,0.002930217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028825944,0.000116651645,0.0017929093,0.00023709316,0.00002986605,0.00018356903,0.00034541867,0.004657532,0.003387732,0.92726594,0.021537751,0.0401572],"study_design_scores_gemma":[0.000042803924,0.00003383448,0.00068930665,0.00005791967,0.000033202567,0.00043829583,0.00021816295,0.015548351,0.0029140483,0.95768106,0.022312397,0.00003076586],"about_ca_topic_score_codex":0.001476743,"about_ca_topic_score_gemma":0.0021205996,"teacher_disagreement_score":0.016969394,"about_ca_system_score_codex":0.002312194,"about_ca_system_score_gemma":0.0012613938,"threshold_uncertainty_score":0.05676824},"labels":[],"label_agreement":null},{"id":"W2592163388","doi":"","title":"A characterization of the degree sequence of the graph with cyclomatic number k.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cyclomatic complexity; Characterization (materials science); Sequence (biology); Graph; Degree (music); Discrete mathematics; Combinatorics; Computer science; Programming language","score_opus":0.01655548113204055,"score_gpt":0.20695108802463355,"score_spread":0.190395606892593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592163388","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7491233,0.0011512727,0.1409759,0.0023590513,0.00044265168,0.00012520423,0.0034837958,0.000535341,0.10180353],"genre_scores_gemma":[0.9748693,0.0005658893,0.0129622575,0.00033131187,0.00020124365,0.00008127334,0.0011611244,0.00011289219,0.009714621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964166,0.000059795755,0.000016270771,0.0001180471,0.00008379148,0.00008043597],"domain_scores_gemma":[0.99748504,0.001146505,0.00045807697,0.00023636925,0.00029895807,0.00037504948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028740676,0.000380634,0.00025918693,0.0022796083,0.00078860245,0.0015249809,0.0005886116,0.0006497038,0.0059864786],"category_scores_gemma":[0.0036139542,0.00022975521,0.00025194735,0.0012170307,0.0012837816,0.0016048003,0.00067425636,0.0012273255,0.0012180847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031485784,0.000097391916,0.0037340848,0.00019139887,0.000013608909,0.00043019815,0.0005879394,0.0076548187,0.027811619,0.92081237,0.009379967,0.028971754],"study_design_scores_gemma":[0.000053916232,0.00015859577,0.0077169603,0.00015919964,0.000027336893,0.0016917358,0.0005506585,0.06778592,0.013555645,0.8802034,0.02801538,0.00008128028],"about_ca_topic_score_codex":0.0010250546,"about_ca_topic_score_gemma":0.0010525285,"teacher_disagreement_score":0.0059864786,"about_ca_system_score_codex":0.000977308,"about_ca_system_score_gemma":0.0005603312,"threshold_uncertainty_score":0.020026803},"labels":[],"label_agreement":null},{"id":"W2592352392","doi":"","title":"Explicit Constructions of Cyclic Packing and Their Related OOCs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Law, logistics, and international trade","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.024792743209964323,"score_gpt":0.23737363737864525,"score_spread":0.21258089416868092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592352392","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075968355,0.0018667205,0.55031043,0.0021642859,0.00078698026,0.00019609713,0.0010811929,0.00096463953,0.3666612],"genre_scores_gemma":[0.7129135,0.0018577514,0.20429009,0.0010247157,0.00054035045,0.00043882572,0.0015250815,0.0007515829,0.07665814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874276,0.00035005956,0.00009792962,0.00015640426,0.0004249806,0.00022793218],"domain_scores_gemma":[0.99737537,0.001286696,0.00023085275,0.00059074356,0.00031349447,0.00020275557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000863076,0.00066158175,0.0006157379,0.0018290501,0.002281979,0.004050618,0.0013100386,0.0014525218,0.019929651],"category_scores_gemma":[0.0060245665,0.0006377152,0.00095316884,0.0034173117,0.002811574,0.006312647,0.0043002227,0.0030966029,0.0027124367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007758813,0.000010125085,0.000052370116,0.000024034227,0.0000016933017,0.000043002918,0.00008889455,0.0004936785,0.00013808679,0.9937118,0.0012315162,0.0041970517],"study_design_scores_gemma":[0.0000071584573,0.000007721639,0.00007048293,0.000032082833,0.0000062782888,0.0001352086,0.000097434844,0.0039858874,0.0004830851,0.97916085,0.01600209,0.000011812142],"about_ca_topic_score_codex":0.0014889289,"about_ca_topic_score_gemma":0.0021597317,"teacher_disagreement_score":0.019929651,"about_ca_system_score_codex":0.0017219745,"about_ca_system_score_gemma":0.00094666064,"threshold_uncertainty_score":0.06667131},"labels":[],"label_agreement":null},{"id":"W2592374713","doi":"","title":"Computing Wiener Index of C 12n Fullerenes.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Index (typography); Fullerene; Mathematics; Wiener index; Computer science; Combinatorics; Physics; World Wide Web; Quantum mechanics","score_opus":0.036914196792453835,"score_gpt":0.31519262087534294,"score_spread":0.2782784240828891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592374713","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7982673,0.0011859527,0.06820782,0.00056271936,0.00025874906,0.00003824266,0.0017445328,0.00047375463,0.12926088],"genre_scores_gemma":[0.9618806,0.00047982007,0.020672774,0.00012236852,0.00006418514,0.00003321375,0.001251303,0.0002620246,0.015233615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997365,0.000024108078,0.000013186837,0.000057930807,0.00010161715,0.00006658543],"domain_scores_gemma":[0.99964917,0.00010266159,0.000052152987,0.00006657536,0.0000681138,0.00006126884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028730102,0.00042653404,0.00054225215,0.0022547569,0.0009271177,0.0018104409,0.0005405966,0.00055626384,0.013755511],"category_scores_gemma":[0.0015560426,0.00019805555,0.00030480503,0.0013610467,0.00083056884,0.0030929542,0.0012568628,0.0008281525,0.0020481201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034364706,0.00009454278,0.0029315655,0.0002703786,0.00003998539,0.0002698163,0.00052166963,0.009945541,0.01727604,0.88131654,0.010995673,0.07599462],"study_design_scores_gemma":[0.00002108649,0.000058683116,0.0026285243,0.0000704317,0.000019248158,0.00021028121,0.00031415376,0.0318576,0.011343546,0.9378646,0.015568182,0.0000435563],"about_ca_topic_score_codex":0.00092078856,"about_ca_topic_score_gemma":0.0025550104,"teacher_disagreement_score":0.013755511,"about_ca_system_score_codex":0.0007560415,"about_ca_system_score_gemma":0.00032902154,"threshold_uncertainty_score":0.046016753},"labels":[],"label_agreement":null},{"id":"W2592463444","doi":"","title":"Extremal polyomino chains with respect to general sum-connectivity index.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Supramolecular Self-Assembly in Materials","field":"Materials Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Polyomino; Mathematics; Index (typography); Combinatorics; Mathematical economics; Statistical physics; Discrete mathematics; Geometry; Computer science; Physics; World Wide Web","score_opus":0.0182171372735444,"score_gpt":0.2731124663285614,"score_spread":0.254895329055017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592463444","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7764696,0.0013993755,0.040551376,0.0011193327,0.00021862981,0.000062640276,0.000666323,0.00031588043,0.17919688],"genre_scores_gemma":[0.98241824,0.0004191696,0.006877955,0.00015926127,0.00011276419,0.000075793556,0.00032760823,0.000081849124,0.0095274495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997569,0.000047507892,0.000012498681,0.000039525174,0.00007538978,0.00006815232],"domain_scores_gemma":[0.9988611,0.00047228992,0.00018946482,0.00012825213,0.00010222206,0.0002468223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038831422,0.00040564607,0.000434897,0.0018075936,0.0011237449,0.0021239766,0.000611333,0.0008982893,0.0107491175],"category_scores_gemma":[0.0023959877,0.00022190312,0.00021276843,0.0007928356,0.0012876875,0.0019672278,0.0011212827,0.0009372807,0.00065256644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007128785,0.000025280284,0.00039812757,0.000045685265,0.000007441262,0.00010157879,0.000052105395,0.003369806,0.0019462826,0.9869704,0.0018636566,0.005148335],"study_design_scores_gemma":[0.000025296373,0.00002636791,0.0008320597,0.000036465564,0.000007782173,0.00019386683,0.00007060633,0.044386495,0.0009628296,0.94951975,0.003919517,0.000019039824],"about_ca_topic_score_codex":0.00042054977,"about_ca_topic_score_gemma":0.0012602379,"teacher_disagreement_score":0.0107491175,"about_ca_system_score_codex":0.00077945704,"about_ca_system_score_gemma":0.0003644318,"threshold_uncertainty_score":0.035959423},"labels":[],"label_agreement":null},{"id":"W2592494687","doi":"","title":"On (s, t)-relaxed L(2, 1)-labelings of the hexagonal lattice.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hexagonal crystal system; Combinatorics; Lattice (music); Hexagonal lattice; Crystallography; Condensed matter physics; Physics; Chemistry","score_opus":0.016875481841668774,"score_gpt":0.2675578239069637,"score_spread":0.25068234206529494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592494687","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46823516,0.0012662528,0.3572376,0.002125315,0.0006592278,0.00021308544,0.0031440435,0.0014314492,0.16568789],"genre_scores_gemma":[0.8144952,0.0006542374,0.1452213,0.00075856864,0.00018751,0.00024564093,0.0029791668,0.0005194439,0.034938976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989447,0.00038453692,0.00006644335,0.00013002502,0.00021372648,0.00026055757],"domain_scores_gemma":[0.99830496,0.0006429219,0.00021456426,0.00040439016,0.0002055586,0.00022765437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064884,0.0004679421,0.00062168844,0.0009504207,0.0016524319,0.0025029916,0.001207437,0.0009987378,0.0123702735],"category_scores_gemma":[0.00322819,0.00042004793,0.0006387724,0.0012395704,0.0014583139,0.0023857187,0.0017277901,0.0017509201,0.0021782315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030473326,0.000057796202,0.0005040776,0.00013692088,0.000017625736,0.00016994767,0.00024982714,0.015644977,0.002989167,0.9436327,0.011238417,0.025053643],"study_design_scores_gemma":[0.0000598192,0.00004466565,0.00026464264,0.00004230109,0.000009359322,0.00013656236,0.00023884384,0.047039993,0.0017788394,0.9415012,0.008855493,0.000028246995],"about_ca_topic_score_codex":0.0033126525,"about_ca_topic_score_gemma":0.005543634,"teacher_disagreement_score":0.0123702735,"about_ca_system_score_codex":0.0011489969,"about_ca_system_score_gemma":0.000854357,"threshold_uncertainty_score":0.04138261},"labels":[],"label_agreement":null},{"id":"W2592511555","doi":"","title":"Implicit degree sum condition for hamiltonian cycles.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Hamiltonian (control theory); Pure mathematics; Mathematical optimization; Physics","score_opus":0.035781182272787766,"score_gpt":0.2972854757814991,"score_spread":0.26150429350871135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592511555","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3014907,0.001339681,0.26644695,0.0051480583,0.0010299309,0.00018382874,0.0018380616,0.00058225036,0.42194057],"genre_scores_gemma":[0.9444602,0.00047114008,0.020848025,0.0005416504,0.00035532194,0.00011238696,0.0008473189,0.00016937329,0.032194555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928397,0.00014541698,0.000046940746,0.00013820398,0.0002286561,0.00015684821],"domain_scores_gemma":[0.9971107,0.0016825848,0.00017117127,0.00033470365,0.00042972455,0.00027106988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000742203,0.00034619865,0.00051673973,0.0011390125,0.0016033296,0.0027050634,0.0011376922,0.0011144902,0.027364392],"category_scores_gemma":[0.00808358,0.00033491338,0.0005326089,0.0011161813,0.0019439928,0.0074460357,0.0020004904,0.0025392093,0.0021787828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030862,0.00001677509,0.00018817344,0.000048698956,0.0000045884735,0.000052628562,0.00009299266,0.0007855772,0.0005194483,0.991405,0.0019309262,0.00492444],"study_design_scores_gemma":[0.000013332959,0.0000066265998,0.00014195088,0.000014049063,0.0000063871157,0.000072614406,0.0000567322,0.005437749,0.0006365219,0.98959816,0.004007817,0.000008004182],"about_ca_topic_score_codex":0.0011112991,"about_ca_topic_score_gemma":0.0019263009,"teacher_disagreement_score":0.027364392,"about_ca_system_score_codex":0.0010166193,"about_ca_system_score_gemma":0.00083088584,"threshold_uncertainty_score":0.09154302},"labels":[],"label_agreement":null},{"id":"W2592557224","doi":"","title":"The Laplacian spectral radius for bicyclic graphs with given independence number.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Independence number; Spectral radius; Independence (probability theory); Laplace operator; Combinatorics; RADIUS; Statistics; Graph; Mathematical analysis; Physics; Eigenvalues and eigenvectors; Computer science; Quantum mechanics; Computer security","score_opus":0.02427209226619297,"score_gpt":0.30515635858914275,"score_spread":0.28088426632294977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592557224","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77283776,0.0025042985,0.10169592,0.0030364827,0.00029702473,0.000060559047,0.0014495178,0.0007508261,0.11736769],"genre_scores_gemma":[0.98911333,0.0005977268,0.00539168,0.00015023617,0.0001444577,0.00004910311,0.00029414953,0.00008718177,0.004172181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949205,0.00017379194,0.000018106044,0.000092897164,0.00012253718,0.00010060665],"domain_scores_gemma":[0.99619687,0.0021523912,0.00052523846,0.0002429001,0.0003352837,0.0005473953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005776511,0.00045510632,0.00055019924,0.0024368358,0.00090378907,0.0017628563,0.0010346072,0.000937028,0.005833024],"category_scores_gemma":[0.0074042054,0.00028617884,0.00021661138,0.0012966408,0.0015654885,0.0019494708,0.0012429997,0.00096047967,0.0010972589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029479584,0.000069122274,0.0018800066,0.00018460525,0.000035769208,0.0002088668,0.0004339835,0.021651426,0.006660595,0.9329467,0.01580161,0.019832497],"study_design_scores_gemma":[0.000037670074,0.00003791747,0.0023163923,0.000061164625,0.000027300406,0.00044811712,0.00036636705,0.121942006,0.0026879462,0.86696684,0.0050634267,0.000044922766],"about_ca_topic_score_codex":0.0010567226,"about_ca_topic_score_gemma":0.0010596763,"teacher_disagreement_score":0.005833024,"about_ca_system_score_codex":0.0010571964,"about_ca_system_score_gemma":0.00036720466,"threshold_uncertainty_score":0.019513428},"labels":[],"label_agreement":null},{"id":"W2592627363","doi":"","title":"Spectral determination of a class of tricyclic graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tricyclic; Mathematics; Class (philosophy); Combinatorics; Chemistry; Stereochemistry; Computer science; Artificial intelligence","score_opus":0.03159058847447061,"score_gpt":0.31093711473108354,"score_spread":0.27934652625661294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592627363","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5953723,0.0017010865,0.14446202,0.0020925975,0.0005804653,0.00013714816,0.0012241955,0.00062903686,0.25380108],"genre_scores_gemma":[0.9651509,0.00057537877,0.014478552,0.0002635001,0.00022579919,0.00004114357,0.0008381373,0.00010152382,0.018325005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955744,0.00007612589,0.000018036602,0.00013668896,0.00013284126,0.00007886604],"domain_scores_gemma":[0.99880207,0.00036410338,0.00022129483,0.0001955298,0.00022349825,0.00019348804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022558146,0.0003094241,0.0003679768,0.0015841224,0.001318565,0.001760981,0.000752227,0.00078001583,0.007135553],"category_scores_gemma":[0.0027151068,0.0002848173,0.0003321733,0.0011814366,0.0012614598,0.0012850618,0.0011208816,0.0011386279,0.0012292765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004117283,0.000034051995,0.00093689404,0.00008965587,0.000010946482,0.00020752824,0.00039932632,0.0016333512,0.0026509962,0.96457535,0.008525576,0.020895131],"study_design_scores_gemma":[0.00002748748,0.000037600286,0.0017261206,0.00006699218,0.000025216472,0.0013992055,0.00062231463,0.019557448,0.0034849297,0.94885695,0.024163691,0.000032130512],"about_ca_topic_score_codex":0.0010196888,"about_ca_topic_score_gemma":0.0010837988,"teacher_disagreement_score":0.007135553,"about_ca_system_score_codex":0.00055634574,"about_ca_system_score_gemma":0.00049144705,"threshold_uncertainty_score":0.023870766},"labels":[],"label_agreement":null},{"id":"W2592736199","doi":"","title":"b-coloring of Cartesian product of odd graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Mathematics; Product (mathematics); Combinatorics; Cartesian coordinate system; Geometry","score_opus":0.017924297168434855,"score_gpt":0.2442690939839433,"score_spread":0.22634479681550845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592736199","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5645368,0.001506915,0.29152498,0.0023163967,0.0005261762,0.00011717479,0.001994006,0.0011474751,0.13633001],"genre_scores_gemma":[0.8564455,0.00064432214,0.108626224,0.00051713525,0.00013222081,0.00010577251,0.0017235647,0.00039194158,0.031413287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993767,0.00019894374,0.00003440442,0.00016315423,0.00008337515,0.0001433601],"domain_scores_gemma":[0.99736387,0.0011792108,0.00030814068,0.000449645,0.0002719389,0.0004271682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006714967,0.00048674303,0.00049362006,0.0010062439,0.0016244078,0.0021460096,0.00092454767,0.00074983976,0.01104347],"category_scores_gemma":[0.002354495,0.00054656214,0.0005331038,0.0011710704,0.0015118056,0.0031821523,0.0017843175,0.0013802358,0.0015466117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002598168,0.00008065153,0.0024502578,0.00018031186,0.000022568289,0.00018192478,0.0003622842,0.00405772,0.0047215363,0.9469204,0.015720354,0.025042135],"study_design_scores_gemma":[0.000042173473,0.00004305965,0.0013670762,0.000047612935,0.00002449287,0.0004370211,0.00035360028,0.019448271,0.0033232674,0.9527717,0.02212017,0.000021602702],"about_ca_topic_score_codex":0.002581313,"about_ca_topic_score_gemma":0.003145858,"teacher_disagreement_score":0.01104347,"about_ca_system_score_codex":0.0009672269,"about_ca_system_score_gemma":0.00065022294,"threshold_uncertainty_score":0.03694403},"labels":[],"label_agreement":null},{"id":"W2592752528","doi":"","title":"Implicit degree sum condition for long cycles.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Statistics","score_opus":0.03692570248741664,"score_gpt":0.3007960487532083,"score_spread":0.26387034626579164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592752528","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31233406,0.0019253505,0.28706905,0.0069952914,0.0013055981,0.00021969715,0.0021197658,0.0009652162,0.38706607],"genre_scores_gemma":[0.9253587,0.0007065183,0.025704037,0.0007924017,0.0005284548,0.00015749513,0.000996303,0.00033212395,0.0454239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989278,0.00019014796,0.00008348207,0.00022494614,0.00033929365,0.00023431754],"domain_scores_gemma":[0.9939312,0.003538165,0.000385401,0.00071192114,0.00091915263,0.0005142504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011547238,0.00043494883,0.00064863346,0.0014442523,0.0020329927,0.0036338367,0.0014153543,0.0014108509,0.029838895],"category_scores_gemma":[0.014417494,0.00042248695,0.00068931415,0.001518383,0.0024000541,0.011296805,0.0028740144,0.0031113012,0.003002948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005857892,0.000019759444,0.00033015016,0.00007179676,0.0000060940065,0.00008624851,0.00012710944,0.0008544424,0.00067984563,0.98869914,0.0022898577,0.006776865],"study_design_scores_gemma":[0.000017404323,0.000009321986,0.00018248388,0.000022710257,0.000010164233,0.00012355064,0.000073199095,0.005180213,0.0010028932,0.9865942,0.0067710876,0.000012723273],"about_ca_topic_score_codex":0.0013532586,"about_ca_topic_score_gemma":0.0020938634,"teacher_disagreement_score":0.029838895,"about_ca_system_score_codex":0.001290488,"about_ca_system_score_gemma":0.001137599,"threshold_uncertainty_score":0.09982103},"labels":[],"label_agreement":null},{"id":"W2592946907","doi":"","title":"Planar, Outerplanar And Ring Graph Cozero-Divisor Graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Outerplanar graph; Combinatorics; Planar graph; Divisor (algebraic geometry); Book embedding; Planar; 1-planar graph; Pathwidth; Graph; Discrete mathematics; Chordal graph; Line graph; Computer science","score_opus":0.02961995847102479,"score_gpt":0.27381439766375276,"score_spread":0.24419443919272799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592946907","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71410143,0.0028355932,0.06472353,0.0025644924,0.00022178808,0.000063601125,0.0009091026,0.00038056303,0.21419995],"genre_scores_gemma":[0.97381467,0.0008995419,0.005233054,0.00020824316,0.00014019318,0.000017923176,0.00033795723,0.000041629297,0.019306652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997491,0.00005402914,0.000010651212,0.00006443916,0.000049292383,0.00007244979],"domain_scores_gemma":[0.9987563,0.0004808042,0.00030444964,0.00011125037,0.00011448262,0.00023264223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003613464,0.0003933912,0.0003987401,0.0013697618,0.0012293836,0.0020423876,0.0007197734,0.0005117379,0.0093659675],"category_scores_gemma":[0.0020055072,0.00028539682,0.0003032575,0.0011254477,0.002052956,0.003939946,0.0017665572,0.0010222499,0.00094760413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000452097,0.000018639596,0.00071554893,0.000038655413,0.00000899287,0.000113019996,0.00020116621,0.0009475348,0.00051139755,0.9891382,0.0021540942,0.006107616],"study_design_scores_gemma":[0.000023895267,0.000017356462,0.0011544466,0.000015252478,0.000029437235,0.0003143876,0.0004355934,0.0022624792,0.0006126044,0.9862183,0.008903623,0.000012520456],"about_ca_topic_score_codex":0.0016218633,"about_ca_topic_score_gemma":0.002091532,"teacher_disagreement_score":0.0093659675,"about_ca_system_score_codex":0.00071873155,"about_ca_system_score_gemma":0.00036451448,"threshold_uncertainty_score":0.031332314},"labels":[],"label_agreement":null},{"id":"W2592983026","doi":"","title":"The Wiener index of cacti given matching number.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Wiener index; Matching (statistics); Index (typography); Statistics; Combinatorics; Computer science; World Wide Web","score_opus":0.02607460745190234,"score_gpt":0.3159737583519705,"score_spread":0.2898991509000682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592983026","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49097636,0.0043288153,0.08740962,0.0030346485,0.0022415116,0.00007517903,0.0009686931,0.00054530054,0.4104199],"genre_scores_gemma":[0.93932784,0.001504054,0.010558697,0.00030238988,0.0010490852,0.00007511691,0.0003592548,0.0001841826,0.046639394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993772,0.00008476944,0.000030040354,0.00014847933,0.00020580999,0.0001536627],"domain_scores_gemma":[0.9987172,0.00036953023,0.00024615726,0.00013153728,0.00021151874,0.00032400765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006381761,0.00056371343,0.0008403559,0.0049237506,0.0015889057,0.0030922072,0.0010831702,0.001163265,0.0115848025],"category_scores_gemma":[0.004307369,0.00030418957,0.00045099002,0.0021485987,0.0022573597,0.0052586617,0.001914233,0.0016482853,0.0020819907],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038246326,0.000012145649,0.0004114221,0.00004665388,0.0000091039,0.00006979627,0.00018358447,0.000585683,0.0013329575,0.9877495,0.002035265,0.00752561],"study_design_scores_gemma":[0.000008087435,0.000026758331,0.0011597916,0.000038267666,0.000014660217,0.00028283932,0.00013003606,0.0063953674,0.0015233662,0.9796244,0.010770124,0.00002633258],"about_ca_topic_score_codex":0.000982781,"about_ca_topic_score_gemma":0.0010019977,"teacher_disagreement_score":0.0115848025,"about_ca_system_score_codex":0.0018717643,"about_ca_system_score_gemma":0.00060299976,"threshold_uncertainty_score":0.038755},"labels":[],"label_agreement":null},{"id":"W2593022588","doi":"","title":"On Harary spectral radius with given parameters.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; RADIUS; Physics; Quantum mechanics; Computer science; Eigenvalues and eigenvectors; Computer security","score_opus":0.011960099672384678,"score_gpt":0.23129027841698077,"score_spread":0.2193301787445961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593022588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20329696,0.008304562,0.55043644,0.006247792,0.0010447274,0.00013948974,0.0012823408,0.0018337994,0.22741385],"genre_scores_gemma":[0.90054846,0.0027594185,0.06618289,0.0014266508,0.0010377022,0.00026929876,0.0007738025,0.0008872121,0.026114516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970054,0.001399901,0.000119210796,0.00047810088,0.00056605146,0.0004313502],"domain_scores_gemma":[0.98527944,0.009317598,0.0011244525,0.0017960166,0.0011679627,0.0013144725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031168717,0.0012105025,0.0015777707,0.0034800791,0.0018903149,0.0035084428,0.002902215,0.0025047292,0.014118942],"category_scores_gemma":[0.026641048,0.00060435303,0.0005495452,0.0022423645,0.004455047,0.008618571,0.0057466547,0.0038842882,0.005328236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015572646,0.000039337,0.00060528616,0.000115626135,0.000022839009,0.00006559703,0.00024270058,0.006757756,0.0012125092,0.9691065,0.009616202,0.012059906],"study_design_scores_gemma":[0.000017516035,0.000022590411,0.0003774461,0.00005249223,0.000015291065,0.00013541507,0.0001302161,0.02847839,0.0007957143,0.96515423,0.004795816,0.000024957992],"about_ca_topic_score_codex":0.0009595882,"about_ca_topic_score_gemma":0.000898464,"teacher_disagreement_score":0.014118942,"about_ca_system_score_codex":0.0017369211,"about_ca_system_score_gemma":0.0007409041,"threshold_uncertainty_score":0.04723257},"labels":[],"label_agreement":null},{"id":"W2593046873","doi":"","title":"On the signless Laplacian spetral radius of bicyclic graphs with fixed diameter.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; RADIUS; Discrete mathematics; Computer network; Computer science","score_opus":0.03426526987705362,"score_gpt":0.2847459502372293,"score_spread":0.2504806803601757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593046873","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72460973,0.010121297,0.11253573,0.004720562,0.0007228913,0.00010336347,0.0011504978,0.0008517915,0.14518417],"genre_scores_gemma":[0.98103297,0.002109706,0.009085279,0.00034956675,0.0003550574,0.00008627451,0.0002699311,0.00017051835,0.006540661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993616,0.00023735045,0.000024762292,0.00012029357,0.00012680743,0.00012931204],"domain_scores_gemma":[0.99443746,0.0032789668,0.0007792928,0.0003637566,0.00037638258,0.0007641041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089904026,0.0007186329,0.0010026996,0.0027863507,0.0011755292,0.0019357493,0.002155131,0.0014696339,0.006061531],"category_scores_gemma":[0.010906035,0.00048396763,0.0003414651,0.0012952283,0.0026483776,0.0035822303,0.0020480051,0.0016744495,0.0011989212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025497348,0.000047217014,0.0011300863,0.0002598623,0.000026888618,0.00019934845,0.00036347166,0.019523969,0.0052304165,0.9453069,0.012484757,0.015172119],"study_design_scores_gemma":[0.000067846464,0.000088436995,0.0016038059,0.000116671516,0.000040678242,0.00050357694,0.00035497948,0.081489645,0.0019176872,0.90724564,0.0064994167,0.000071714145],"about_ca_topic_score_codex":0.0011534535,"about_ca_topic_score_gemma":0.0010970603,"teacher_disagreement_score":0.006061531,"about_ca_system_score_codex":0.0013462546,"about_ca_system_score_gemma":0.00042535106,"threshold_uncertainty_score":0.020277798},"labels":[],"label_agreement":null},{"id":"W2593139637","doi":"","title":"Distance labelings and (total-)neighbor-distinguishing colorings of the edge-multiplicity-paths-replacements.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Multiplicity (mathematics); Combinatorics; Enhanced Data Rates for GSM Evolution; Geometry; Computer science; Artificial intelligence","score_opus":0.013429165889767324,"score_gpt":0.23930015890970527,"score_spread":0.22587099301993793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593139637","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49870625,0.0017198899,0.38729694,0.0035770726,0.0004243735,0.0001350381,0.0017353275,0.00086578744,0.10553931],"genre_scores_gemma":[0.8888888,0.0006388811,0.090367615,0.000511876,0.00020434447,0.0001194613,0.0011631206,0.00022783753,0.017878126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986895,0.00044470996,0.00007825402,0.00028946795,0.00024593127,0.0002521863],"domain_scores_gemma":[0.99360824,0.003543591,0.000702744,0.0011002859,0.00047905586,0.00056614244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013141199,0.00054318924,0.0006118264,0.0012097049,0.0017114222,0.0025106107,0.0017964826,0.0012898165,0.007656232],"category_scores_gemma":[0.0075656213,0.0005379728,0.00081862166,0.0018907575,0.0021343702,0.004353227,0.0022171575,0.0023814156,0.0009640749],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108622706,0.000043816864,0.0008641587,0.000081402846,0.000013620565,0.000062126834,0.00021002951,0.0055010184,0.0010612009,0.97107464,0.004717082,0.016262213],"study_design_scores_gemma":[0.00003116362,0.000026194468,0.00042648832,0.000023318515,0.000020416835,0.0002296973,0.0001481786,0.020365566,0.0010965046,0.97087145,0.00674294,0.00001803662],"about_ca_topic_score_codex":0.0014893487,"about_ca_topic_score_gemma":0.0019124537,"teacher_disagreement_score":0.007656232,"about_ca_system_score_codex":0.0018147228,"about_ca_system_score_gemma":0.0008231453,"threshold_uncertainty_score":0.025612712},"labels":[],"label_agreement":null},{"id":"W2593299067","doi":"","title":"On the Bounds for Sizes of Least Common Multiples of Several pairs of graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Multiple; Combinatorics; Arithmetic","score_opus":0.02349092314072028,"score_gpt":0.2534424320612935,"score_spread":0.22995150892057326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593299067","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28376636,0.016095415,0.42500514,0.042246107,0.0023486873,0.0007658518,0.014728466,0.0046998346,0.21034406],"genre_scores_gemma":[0.7992262,0.0062038093,0.15761833,0.004001355,0.0037748413,0.0011493878,0.007064886,0.0026200216,0.018341163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9861436,0.004063705,0.0008458926,0.0034804067,0.0028141025,0.00265226],"domain_scores_gemma":[0.7038658,0.2567985,0.008576545,0.01661293,0.0057505616,0.0083956495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012071474,0.0035503863,0.0048708,0.007990682,0.004644398,0.013666826,0.01102663,0.00559474,0.023875946],"category_scores_gemma":[0.12466527,0.0031401152,0.0035637806,0.008277295,0.00892301,0.037418492,0.009633175,0.012255289,0.0049976422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027415352,0.0007002301,0.010204601,0.0015939648,0.0005074175,0.00053193484,0.0015018414,0.044678207,0.0072466913,0.8039906,0.060646772,0.06565627],"study_design_scores_gemma":[0.0001840083,0.00014827095,0.0024230646,0.0002845826,0.00028014573,0.00089301815,0.0004656629,0.070056655,0.0039632637,0.90977955,0.011384396,0.00013740624],"about_ca_topic_score_codex":0.0029714028,"about_ca_topic_score_gemma":0.003694529,"teacher_disagreement_score":0.023875946,"about_ca_system_score_codex":0.007770486,"about_ca_system_score_gemma":0.0041526216,"threshold_uncertainty_score":0.079873025},"labels":[],"label_agreement":null},{"id":"W2593347699","doi":"","title":"Multiplicity of Stars in Complete Graphs and Complete r-partite Graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Multiplicity (mathematics); Stars; Combinatorics; Discrete mathematics; Astronomy; Geometry; Physics","score_opus":0.029073186607363587,"score_gpt":0.25195236785808844,"score_spread":0.22287918125072487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593347699","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.726181,0.0033170532,0.1382135,0.005049347,0.00044273035,0.00008947906,0.0029627243,0.0005952715,0.12314896],"genre_scores_gemma":[0.96457416,0.0008923169,0.020404397,0.0002870399,0.0003238771,0.00008972179,0.0008093967,0.00013914445,0.012479932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834657,0.00055061176,0.00010670473,0.00042758667,0.00027876912,0.00028980602],"domain_scores_gemma":[0.9893366,0.0064152637,0.001527297,0.0009216873,0.0005637009,0.0012353662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014975136,0.0005752282,0.0010162073,0.0028901678,0.0022862137,0.004787377,0.0020081056,0.0018112581,0.010553068],"category_scores_gemma":[0.010350319,0.0009450232,0.00082408235,0.0026129333,0.0029472625,0.007012669,0.0026697677,0.0017574898,0.0014340961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022863378,0.000057583842,0.0038566964,0.00018327354,0.000035983463,0.00013864324,0.00042918907,0.0064500873,0.002072465,0.96247745,0.008998029,0.015071991],"study_design_scores_gemma":[0.000049950777,0.000036184272,0.002372854,0.000060792256,0.000044353732,0.00051178184,0.00040516636,0.018812394,0.0017252652,0.9690815,0.0068625323,0.000037163903],"about_ca_topic_score_codex":0.0009888056,"about_ca_topic_score_gemma":0.0012995383,"teacher_disagreement_score":0.010553068,"about_ca_system_score_codex":0.0017329347,"about_ca_system_score_gemma":0.00065835414,"threshold_uncertainty_score":0.035303533},"labels":[],"label_agreement":null},{"id":"W2593543367","doi":"","title":"Covering finite groups by subset products.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.02073209783085663,"score_gpt":0.27983381248092654,"score_spread":0.2591017146500699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593543367","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42809504,0.002955773,0.33928764,0.0016874443,0.00045466528,0.0001087688,0.0008372278,0.0010851615,0.22548833],"genre_scores_gemma":[0.9211696,0.0013434603,0.044366844,0.00030490238,0.00034289336,0.000091214606,0.0008496515,0.0002740145,0.031257357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993773,0.00018482731,0.000039831633,0.00014793492,0.00015603656,0.000094113355],"domain_scores_gemma":[0.998611,0.00063007156,0.0001523205,0.0003492996,0.00010392211,0.00015332029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050822337,0.00046348988,0.0005317727,0.0011115125,0.0009000435,0.0018241059,0.00055143173,0.0005002398,0.007358598],"category_scores_gemma":[0.0019132083,0.00039207074,0.00084539247,0.0010502542,0.0014219155,0.0044849133,0.0024569775,0.0012115061,0.0015491083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000599882,0.00003075605,0.0007996231,0.00007853892,0.00002523579,0.0001744707,0.0006088915,0.0013194323,0.002506535,0.96678,0.0033648168,0.024251694],"study_design_scores_gemma":[0.000013510627,0.000037946567,0.0005316601,0.00002781395,0.000026269081,0.00054486166,0.0002461585,0.004276654,0.0024434275,0.9758065,0.016034761,0.00001049678],"about_ca_topic_score_codex":0.00039989222,"about_ca_topic_score_gemma":0.0005428934,"teacher_disagreement_score":0.007358598,"about_ca_system_score_codex":0.0005243894,"about_ca_system_score_gemma":0.00026600753,"threshold_uncertainty_score":0.024617016},"labels":[],"label_agreement":null},{"id":"W2593589874","doi":"","title":"Roman domination edge critical graphs having precisely two cycles.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Computer science; Artificial intelligence","score_opus":0.026605463062883215,"score_gpt":0.34238888851757715,"score_spread":0.31578342545469396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593589874","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41546488,0.0010674061,0.06803786,0.0013979042,0.0003544925,0.0001424395,0.0013003899,0.0006416099,0.5115929],"genre_scores_gemma":[0.92925006,0.00049194973,0.017341802,0.00042951095,0.00009133246,0.000079158584,0.0010260636,0.000158844,0.05113126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996537,0.00008091404,0.000014599007,0.000077009136,0.00007056337,0.000103179314],"domain_scores_gemma":[0.9989981,0.0003784238,0.00014150594,0.00013963824,0.0001816922,0.0001606402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025858489,0.00046230358,0.0003762399,0.0011726271,0.001464329,0.0016231879,0.0005632454,0.0007667223,0.017660497],"category_scores_gemma":[0.0018710803,0.0003452185,0.00030907328,0.00071447657,0.0011584288,0.0018886594,0.0011849548,0.0009926865,0.0020350446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002220393,0.00003963527,0.0009963375,0.00015239377,0.000021995544,0.0005706301,0.000279936,0.0014264842,0.009208524,0.96287054,0.00893556,0.015276038],"study_design_scores_gemma":[0.00009994373,0.00006240901,0.0022265962,0.00011996942,0.000060063157,0.0017673178,0.00063677406,0.009721945,0.014346703,0.9014126,0.069501564,0.000044092678],"about_ca_topic_score_codex":0.00094109,"about_ca_topic_score_gemma":0.001741729,"teacher_disagreement_score":0.017660497,"about_ca_system_score_codex":0.00066254806,"about_ca_system_score_gemma":0.00045628217,"threshold_uncertainty_score":0.059080243},"labels":[],"label_agreement":null},{"id":"W2593696988","doi":"","title":"Edge Even Graceful Labeling of Some Path and Cycle Related Graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Path (computing); Combinatorics; Computer science; Computer network; Telecommunications","score_opus":0.0106857448164046,"score_gpt":0.23138345278929637,"score_spread":0.22069770797289176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593696988","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6283947,0.0012058459,0.22049546,0.004106371,0.0002990326,0.00015704644,0.002878385,0.0014058106,0.14105737],"genre_scores_gemma":[0.8942335,0.0005994774,0.0745423,0.0006701955,0.0001565061,0.00011190747,0.0021570227,0.00034446354,0.027184673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994873,0.00014141586,0.000024509372,0.00014222316,0.000083616666,0.00012081206],"domain_scores_gemma":[0.9978399,0.00091360236,0.0002947043,0.00051156845,0.00016564301,0.00027441655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005089064,0.0004654535,0.00046058922,0.0009991137,0.001822116,0.0017383405,0.0010138714,0.0008444175,0.008294163],"category_scores_gemma":[0.0025760063,0.00032587576,0.0006074804,0.001212018,0.0012266483,0.0029361828,0.001382411,0.0016915527,0.00097087654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019936329,0.00009124366,0.001178502,0.00015055879,0.000021389711,0.00020195122,0.00040953374,0.00814591,0.0052192425,0.9434156,0.012504072,0.028462717],"study_design_scores_gemma":[0.000027128594,0.00003237169,0.00085615634,0.000027612234,0.00003261519,0.00023001496,0.00023222326,0.023696173,0.0029935234,0.9576965,0.014155421,0.000020229845],"about_ca_topic_score_codex":0.0023219471,"about_ca_topic_score_gemma":0.0027868515,"teacher_disagreement_score":0.008294163,"about_ca_system_score_codex":0.0013315476,"about_ca_system_score_gemma":0.00077249,"threshold_uncertainty_score":0.027746737},"labels":[],"label_agreement":null},{"id":"W2593880467","doi":"","title":"Classifying Pentavalent Symmetric Graphs Of Order 40p.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Order (exchange); Business","score_opus":0.025520373489121864,"score_gpt":0.26233813217348106,"score_spread":0.2368177586843592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593880467","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.835092,0.00047938598,0.044006463,0.0027184954,0.00022552554,0.000072601106,0.0016438714,0.0005193909,0.11524222],"genre_scores_gemma":[0.9626974,0.00028950616,0.015273641,0.00040936,0.00013270912,0.000057451896,0.002116452,0.00018836225,0.018835116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994435,0.000120146804,0.000026867063,0.00013502003,0.00012449571,0.0001498969],"domain_scores_gemma":[0.9979068,0.00095044676,0.00037486025,0.00033209796,0.00017488003,0.00026095097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046816425,0.00046065115,0.00055303395,0.0015230255,0.001855029,0.0033001755,0.0008773985,0.0013328482,0.00882201],"category_scores_gemma":[0.0021400943,0.0004240347,0.0005327914,0.0013530377,0.0019798034,0.00308505,0.0013903896,0.0018276464,0.0011969336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014804614,0.000095177886,0.0025806485,0.00009807945,0.000018461495,0.0001907524,0.00040796542,0.0028296062,0.0046159686,0.9591214,0.011510102,0.018383862],"study_design_scores_gemma":[0.000027048613,0.000021433363,0.0016386238,0.000028756327,0.0000142027875,0.0002456929,0.00034556957,0.011395877,0.0018597733,0.9771993,0.007208422,0.000015280952],"about_ca_topic_score_codex":0.0021445204,"about_ca_topic_score_gemma":0.0032636668,"teacher_disagreement_score":0.00882201,"about_ca_system_score_codex":0.0015655585,"about_ca_system_score_gemma":0.00079506746,"threshold_uncertainty_score":0.029512584},"labels":[],"label_agreement":null},{"id":"W2593910134","doi":"","title":"Gromov Hyperbolicity of Regular Graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.03411865966423241,"score_gpt":0.2952394456813125,"score_spread":0.2611207860170801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593910134","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5726719,0.0028054162,0.05148477,0.004672411,0.00048207337,0.00005483746,0.0007673613,0.0002650965,0.36679608],"genre_scores_gemma":[0.9729786,0.0006309956,0.0035742777,0.0004179021,0.00019917285,0.000020959338,0.00032642845,0.00006749955,0.021784166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996482,0.00008499743,0.00001366317,0.0000862011,0.00010547488,0.00006145634],"domain_scores_gemma":[0.9991161,0.00031892533,0.00017307783,0.00013245278,0.00011022278,0.00014924168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031574682,0.0003666577,0.0003465721,0.001253978,0.0008507416,0.0020207681,0.00061910594,0.00064681855,0.008427565],"category_scores_gemma":[0.0020277328,0.00028306336,0.0003328355,0.00063523726,0.0027474235,0.0030465298,0.0020375766,0.0018438444,0.0011806845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021511032,0.00000798618,0.00039266533,0.000032079293,0.0000069206376,0.00006563332,0.00020110149,0.0004533303,0.00083134463,0.9927942,0.0016220835,0.0035711543],"study_design_scores_gemma":[0.000011042176,0.000009752849,0.0007143609,0.000012059941,0.000007753619,0.00019313415,0.0001975229,0.0015246364,0.00040523135,0.9917747,0.0051430804,0.0000067633364],"about_ca_topic_score_codex":0.001038913,"about_ca_topic_score_gemma":0.0012162733,"teacher_disagreement_score":0.008427565,"about_ca_system_score_codex":0.00076373573,"about_ca_system_score_gemma":0.00029648238,"threshold_uncertainty_score":0.028192997},"labels":[],"label_agreement":null},{"id":"W2593977626","doi":"","title":"A generalization of Stirling, Lah and harmonic numbers with some computational applications.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematical Inequalities and Applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Stirling engine; Mathematics; Generalization; Stirling numbers of the first kind; Harmonic; Stirling numbers of the second kind; Stirling number; Arithmetic; Applied mathematics; Algebra over a field; Pure mathematics; Mathematical analysis; Thermodynamics; Physics; Acoustics","score_opus":0.04559626980702937,"score_gpt":0.32613498241821515,"score_spread":0.2805387126111858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593977626","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05061632,0.024975948,0.65495086,0.006960461,0.0042643687,0.000117104624,0.00084905257,0.0004821469,0.25678366],"genre_scores_gemma":[0.62819207,0.016747672,0.2588087,0.002403288,0.007359909,0.00032450687,0.0009014208,0.00029910228,0.08496335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943227,0.00017687645,0.00003415327,0.00013215572,0.00015334763,0.0000710917],"domain_scores_gemma":[0.99852234,0.0008012764,0.00014000326,0.00020761926,0.00019717,0.00013171797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011798065,0.00084664754,0.0009346308,0.003006952,0.0012898177,0.0028128428,0.0014787975,0.0009789277,0.012003878],"category_scores_gemma":[0.006582459,0.00036068357,0.0013268181,0.0031944914,0.0030592096,0.0052193333,0.002711806,0.003785393,0.0024166752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011148011,0.000012574657,0.00011895579,0.000052124586,0.0000059713248,0.00003800047,0.00007114856,0.0012884613,0.00021414085,0.9797869,0.003034268,0.015366323],"study_design_scores_gemma":[0.0000048461225,0.000014112836,0.00013462729,0.000017376407,0.000006315323,0.00009416488,0.000042380336,0.007535281,0.00012261521,0.97957844,0.012437288,0.0000126495415],"about_ca_topic_score_codex":0.0012521197,"about_ca_topic_score_gemma":0.0013772734,"teacher_disagreement_score":0.012003878,"about_ca_system_score_codex":0.0011295462,"about_ca_system_score_gemma":0.000921665,"threshold_uncertainty_score":0.04015696},"labels":[],"label_agreement":null},{"id":"W2594112171","doi":"","title":"Vertices of Degree 9 in Contraction Critical 8-Connected Graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Contraction (grammar); Combinatorics; Physics","score_opus":0.04019856368834564,"score_gpt":0.3374120237219961,"score_spread":0.29721346003365046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594112171","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9313405,0.00026993905,0.016590472,0.00066078233,0.00011663324,0.00005165071,0.00028552796,0.00013527834,0.050549086],"genre_scores_gemma":[0.9821869,0.00014423241,0.006659848,0.00013579133,0.000028773453,0.000048733833,0.00036404788,0.000053143394,0.010378517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977976,0.000045245146,0.000008726475,0.000042147825,0.000043067284,0.00008111075],"domain_scores_gemma":[0.998933,0.00043358695,0.00017617193,0.00007535107,0.00012773037,0.00025418063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002219006,0.00036391898,0.0003554627,0.0010367952,0.0014042432,0.0009978204,0.00059786305,0.0007515681,0.010064804],"category_scores_gemma":[0.0015323843,0.00036091107,0.0002804753,0.0005835015,0.0011622444,0.0011569744,0.0011463942,0.00088547374,0.0010954186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012917796,0.00015939935,0.007977379,0.00039528566,0.00005691364,0.0035731285,0.002258525,0.009715642,0.041818913,0.8845393,0.012647875,0.03556583],"study_design_scores_gemma":[0.000215247,0.00013434123,0.008705022,0.00020124509,0.00010032756,0.0021871475,0.0027054506,0.027541738,0.022454105,0.90694624,0.028760899,0.000048132966],"about_ca_topic_score_codex":0.0010690291,"about_ca_topic_score_gemma":0.0024156568,"teacher_disagreement_score":0.010064804,"about_ca_system_score_codex":0.0004762988,"about_ca_system_score_gemma":0.0004304227,"threshold_uncertainty_score":0.033670127},"labels":[],"label_agreement":null},{"id":"W2594154281","doi":"","title":"Counting rooted nonseparable unicursal planar maps.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Planar; Combinatorics; Computer graphics (images); Computer science","score_opus":0.01683502484614639,"score_gpt":0.25220071106849634,"score_spread":0.23536568622234996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594154281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31582996,0.002401849,0.5496509,0.003007627,0.00033742323,0.00026516386,0.0021598537,0.0020219327,0.12432524],"genre_scores_gemma":[0.8225294,0.0010388056,0.1374573,0.0003701267,0.00022236031,0.00020208133,0.0018774065,0.00041703339,0.035885457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792284,0.0004162653,0.0001751058,0.00036385693,0.0007318553,0.0003901068],"domain_scores_gemma":[0.99184704,0.0043083965,0.00074589264,0.0013541098,0.0011794345,0.0005651909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001098335,0.0006119886,0.0008854475,0.0031540645,0.002003564,0.004745932,0.0021343234,0.0013581411,0.01147865],"category_scores_gemma":[0.0145477485,0.0005386524,0.00057041115,0.0040181438,0.001841502,0.008348717,0.004906642,0.0017852555,0.0023198922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013834766,0.000056985045,0.0014728332,0.000264204,0.000032782013,0.00016407427,0.0003835152,0.004652366,0.0023268685,0.9217561,0.007998017,0.06075393],"study_design_scores_gemma":[0.000017321432,0.000029426223,0.00053534936,0.00006491442,0.000042741383,0.00038726494,0.0002839331,0.029678052,0.004204725,0.94808567,0.016647227,0.000023487024],"about_ca_topic_score_codex":0.0015295999,"about_ca_topic_score_gemma":0.0024662109,"teacher_disagreement_score":0.01147865,"about_ca_system_score_codex":0.001908197,"about_ca_system_score_gemma":0.00086419145,"threshold_uncertainty_score":0.038399935},"labels":[],"label_agreement":null},{"id":"W2594198481","doi":"","title":"Existence of equitable h-edge-colorings of type s = 2, 3 of K t .","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Type (biology); Enhanced Data Rates for GSM Evolution; Combinatorics; Artificial intelligence; Computer science; Geology","score_opus":0.024925810736014468,"score_gpt":0.25022292411926217,"score_spread":0.2252971133832477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594198481","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.875197,0.00025146807,0.051320527,0.0009947154,0.00016876555,0.00007646849,0.0015890105,0.0004071095,0.06999488],"genre_scores_gemma":[0.9724531,0.00011109892,0.014493584,0.0002077118,0.000030498932,0.000055659522,0.0009692425,0.00013864775,0.011540474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936277,0.00013994843,0.000043179833,0.000119368735,0.000103326805,0.00023155664],"domain_scores_gemma":[0.9964353,0.0015688725,0.00053163356,0.0005647914,0.00044623617,0.00045312423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003998688,0.00038822612,0.00043322804,0.0010484384,0.0022160332,0.0024233332,0.0007427563,0.0010018393,0.013436521],"category_scores_gemma":[0.003579884,0.0006227048,0.0005917109,0.0009708252,0.0011989361,0.0016810234,0.0013670393,0.0012902976,0.001512653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001650879,0.0003868344,0.015038193,0.00046368624,0.000100380894,0.0015522712,0.0028700263,0.010181009,0.05087288,0.85241914,0.022897918,0.04156679],"study_design_scores_gemma":[0.00018852233,0.00018298438,0.012272087,0.0001355023,0.000099444864,0.0020309063,0.0026061141,0.03734294,0.02682064,0.89842165,0.019805526,0.00009359021],"about_ca_topic_score_codex":0.0013382323,"about_ca_topic_score_gemma":0.0020965592,"teacher_disagreement_score":0.013436521,"about_ca_system_score_codex":0.0009268602,"about_ca_system_score_gemma":0.00071893114,"threshold_uncertainty_score":0.04494965},"labels":[],"label_agreement":null},{"id":"W2594200469","doi":"","title":"Rainbow connection numbers of ladders and Mobius ladders.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Connection (principal bundle); Mathematics; Rainbow; Combinatorics; Topology (electrical circuits); Geometry; Physics; Quantum mechanics","score_opus":0.018724114707772615,"score_gpt":0.29011712497642955,"score_spread":0.2713930102686569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594200469","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57185143,0.0019619053,0.10405461,0.0018058026,0.0008203768,0.00007466887,0.0006087235,0.0006638525,0.3181587],"genre_scores_gemma":[0.9476803,0.00075885694,0.016317677,0.00021950748,0.00020200659,0.00005194701,0.00022567376,0.0001271915,0.034416918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995696,0.00008465164,0.000025931,0.00008187343,0.0001319414,0.00010594673],"domain_scores_gemma":[0.99870396,0.00044157045,0.00023349465,0.00013269669,0.00016644405,0.00032187218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049739407,0.0003764681,0.00036150598,0.003036514,0.0014173877,0.0020947063,0.0007537952,0.0008419332,0.014939175],"category_scores_gemma":[0.003118524,0.000356247,0.0003532858,0.001542686,0.0017577166,0.0040371246,0.0015736852,0.0013277644,0.0018923132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041261563,0.000014444913,0.00036297354,0.00003079501,0.000004639439,0.000044919514,0.00012325491,0.0004546499,0.00096864044,0.9885562,0.0017648742,0.007633427],"study_design_scores_gemma":[0.000016226657,0.000019764166,0.000691234,0.00002910477,0.000009690498,0.000170845,0.00011750988,0.002962271,0.000867663,0.9882576,0.006842871,0.000015234508],"about_ca_topic_score_codex":0.0007407488,"about_ca_topic_score_gemma":0.0012091271,"teacher_disagreement_score":0.014939175,"about_ca_system_score_codex":0.0009530104,"about_ca_system_score_gemma":0.00048142043,"threshold_uncertainty_score":0.049976587},"labels":[],"label_agreement":null},{"id":"W2594214392","doi":"","title":"Exact Wirelength of Embedding Circulant Networks into Necklace and Windmill Graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Necklace; Windmill; Circulant matrix; Mathematics; Embedding; Discrete mathematics; Combinatorics; Computer science; Electrical engineering; Engineering; Artificial intelligence","score_opus":0.010970867736856661,"score_gpt":0.2497539726946023,"score_spread":0.23878310495774566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594214392","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57011336,0.0026933444,0.3045384,0.0012322593,0.00047056284,0.0000797277,0.0017210996,0.0008829817,0.118268274],"genre_scores_gemma":[0.9317705,0.00092654047,0.046453994,0.00013885522,0.000120936355,0.00008772627,0.0006580581,0.0003279353,0.01951534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974054,0.000048334234,0.000011506035,0.00005129367,0.000096003176,0.00005218034],"domain_scores_gemma":[0.9988218,0.00057998445,0.00015096231,0.00016455901,0.00016650416,0.00011616494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033673013,0.00048548685,0.00040822173,0.0009660937,0.00058665266,0.001282678,0.0010032702,0.0008029232,0.010845752],"category_scores_gemma":[0.0038531902,0.00042066962,0.00026656047,0.0008351886,0.00076086744,0.0029696939,0.0008879619,0.0010300536,0.0015519387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028188276,0.00008067747,0.0011393054,0.00031972709,0.000046060926,0.00024208194,0.0003048894,0.105155334,0.009078601,0.80112123,0.015453816,0.066776335],"study_design_scores_gemma":[0.000026917849,0.000064081534,0.00084046746,0.00005477339,0.00002277705,0.00014002383,0.00011585522,0.18148877,0.0032844294,0.8074305,0.006507237,0.000024114555],"about_ca_topic_score_codex":0.0011978168,"about_ca_topic_score_gemma":0.0028039827,"teacher_disagreement_score":0.010845752,"about_ca_system_score_codex":0.0010060186,"about_ca_system_score_gemma":0.00048395008,"threshold_uncertainty_score":0.03628266},"labels":[],"label_agreement":null},{"id":"W2594251114","doi":"","title":"Partition theoretic interpretations of the A 2 Rogers-Ramanujan identities.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Ramanujan's sum; Mathematics; Partition (number theory); Pure mathematics; Combinatorics","score_opus":0.03768417813625448,"score_gpt":0.3427589918044839,"score_spread":0.3050748136682294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594251114","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11476471,0.0054124612,0.10352446,0.0042413077,0.0014841759,0.000043733067,0.00036077856,0.0001809723,0.7699874],"genre_scores_gemma":[0.91401243,0.0021511803,0.016837576,0.0007013996,0.0011195588,0.0000844147,0.00024594876,0.000108718894,0.064738706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993351,0.00023819813,0.000024396977,0.00007468302,0.0002296552,0.00009783317],"domain_scores_gemma":[0.99925,0.00032189128,0.00009213776,0.00011119597,0.00013565323,0.00008913554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008181585,0.00071985606,0.00053493475,0.0022382864,0.0019145246,0.0036917464,0.0010504188,0.0010758896,0.01216853],"category_scores_gemma":[0.002634409,0.00033893454,0.0006415026,0.0011839302,0.0030033134,0.004913792,0.0019053773,0.0022144576,0.0019076039],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031002164,0.0000030483063,0.000017500688,0.0000052797855,8.2489765e-7,0.000011062679,0.000041121384,0.00009472122,0.00006564326,0.99861777,0.00042367424,0.00071615435],"study_design_scores_gemma":[0.000003875495,0.0000030644185,0.000061857834,0.0000069494436,0.0000018139168,0.00004581972,0.000042477634,0.0007390501,0.00007443037,0.9960931,0.0029238013,0.0000037732839],"about_ca_topic_score_codex":0.0008084317,"about_ca_topic_score_gemma":0.00081256055,"teacher_disagreement_score":0.01216853,"about_ca_system_score_codex":0.0012078166,"about_ca_system_score_gemma":0.0005949484,"threshold_uncertainty_score":0.040707767},"labels":[],"label_agreement":null},{"id":"W2594273812","doi":"","title":"Residual Closeness Of Splitting Networks.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Closeness; Residual; Mathematics; Algorithm; Mathematical analysis","score_opus":0.01802815789864529,"score_gpt":0.2576778004659188,"score_spread":0.23964964256727353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594273812","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36767998,0.0012687122,0.45883662,0.0014807915,0.00020989144,0.00010196328,0.0010205599,0.00049154763,0.16890997],"genre_scores_gemma":[0.93519694,0.0009237828,0.029957334,0.00030484743,0.00014710633,0.000086581844,0.0010599619,0.00018270772,0.03214064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993086,0.00020909408,0.000032042477,0.00014664585,0.00020608044,0.000097547636],"domain_scores_gemma":[0.9961725,0.0019832086,0.00046593687,0.0004572932,0.0005637487,0.000357283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000748409,0.00034316568,0.0005325779,0.0015038492,0.0008756542,0.0017058613,0.0008486624,0.0007104706,0.015504252],"category_scores_gemma":[0.007590319,0.00027645504,0.00038684517,0.0010245914,0.0013066317,0.0032275887,0.0020206163,0.0014954738,0.0017677643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010741346,0.0000230694,0.0008759599,0.00011256179,0.000026852496,0.000103249375,0.00035545815,0.014692851,0.0018079765,0.9548571,0.0040204967,0.023017008],"study_design_scores_gemma":[0.00002001263,0.00005097889,0.0006674997,0.00003653927,0.000019411931,0.00020962987,0.00027613412,0.039010618,0.0014637086,0.9470719,0.011161233,0.000012254236],"about_ca_topic_score_codex":0.0010868214,"about_ca_topic_score_gemma":0.0009838768,"teacher_disagreement_score":0.015504252,"about_ca_system_score_codex":0.0007758843,"about_ca_system_score_gemma":0.0003933627,"threshold_uncertainty_score":0.05186683},"labels":[],"label_agreement":null},{"id":"W2594391380","doi":"","title":"Spanning 3-ended trees in k-connected claw-free graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Claw; Mathematics; Combinatorics; Spanning tree; Structural engineering","score_opus":0.025766973302576705,"score_gpt":0.2983453865105893,"score_spread":0.27257841320801257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594391380","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80982244,0.0010608607,0.11799466,0.0009341675,0.00014972358,0.00011413769,0.0013834885,0.0007474116,0.067793146],"genre_scores_gemma":[0.94644386,0.00051619817,0.031196304,0.00025740257,0.000042118594,0.00007351591,0.0014056405,0.00013764844,0.019927341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996444,0.000058560003,0.000030290064,0.00008566072,0.000085627886,0.00009537871],"domain_scores_gemma":[0.9984281,0.0006574653,0.00027279978,0.00015646536,0.00019522391,0.00028998757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002573502,0.00035779394,0.0004201965,0.0013437823,0.001389184,0.00172818,0.0009339529,0.0013469703,0.008867364],"category_scores_gemma":[0.0022515107,0.00051619456,0.00044760038,0.0014323648,0.0009808859,0.002729222,0.0019328595,0.0011309372,0.0026314973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032786562,0.00016119138,0.0039947885,0.0004864595,0.00007329854,0.0020312213,0.0019869127,0.010247771,0.021886958,0.88351387,0.010004369,0.06528535],"study_design_scores_gemma":[0.000041574545,0.000049769034,0.0024815365,0.0001315256,0.00005433275,0.0015351976,0.0008806663,0.018732822,0.007472454,0.95228285,0.016296625,0.000040757397],"about_ca_topic_score_codex":0.0009791114,"about_ca_topic_score_gemma":0.0022248556,"teacher_disagreement_score":0.008867364,"about_ca_system_score_codex":0.000493505,"about_ca_system_score_gemma":0.0003345515,"threshold_uncertainty_score":0.029664278},"labels":[],"label_agreement":null},{"id":"W2594426165","doi":"","title":"New error-correcting pooling designs with singular linear space.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Simulation Techniques and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pooling; Space (punctuation); Applied mathematics; Statistics; Artificial intelligence; Computer science","score_opus":0.13149103362305323,"score_gpt":0.40561183316433363,"score_spread":0.27412079954128044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594426165","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005623424,0.0003746503,0.991039,0.00017788124,0.000064448526,0.000065137436,0.00013169611,0.00035630897,0.0021673976],"genre_scores_gemma":[0.25753102,0.000769875,0.72806835,0.00051980186,0.00032392226,0.00070801954,0.00061325775,0.0002439322,0.01122185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9921745,0.0040342277,0.0004870237,0.0012439818,0.0014624123,0.0005978324],"domain_scores_gemma":[0.9842226,0.009321853,0.001174014,0.0030115296,0.0015327062,0.00073736295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01114868,0.002061095,0.0027938294,0.0015365147,0.0011758903,0.0027169627,0.0039765113,0.002391697,0.007200527],"category_scores_gemma":[0.029892819,0.0013116135,0.0018051381,0.002210204,0.0031528191,0.0049168523,0.0048474013,0.002479855,0.0022430527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009832013,0.00030839827,0.001383072,0.000471384,0.00039840906,0.00027524185,0.00028301333,0.18888983,0.0065442855,0.57473403,0.007343164,0.21838604],"study_design_scores_gemma":[0.00011499852,0.00035031931,0.00023728989,0.00008607522,0.00013570646,0.00018683092,0.00003505999,0.68610114,0.006397669,0.30115125,0.0051286374,0.000075142474],"about_ca_topic_score_codex":0.0016578103,"about_ca_topic_score_gemma":0.0026649323,"teacher_disagreement_score":0.01114868,"about_ca_system_score_codex":0.0014484036,"about_ca_system_score_gemma":0.0033897867,"threshold_uncertainty_score":0.058960557},"labels":[],"label_agreement":null},{"id":"W2594435072","doi":"","title":"Extremal Laplacian Estrada Index of Threshold Graphs with Given Size.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Laplace operator; Combinatorics; Statistics; Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.02679138242446925,"score_gpt":0.28186781658815707,"score_spread":0.2550764341636878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594435072","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8955274,0.0009837174,0.038979236,0.0013541164,0.00015688284,0.000027949112,0.0009393959,0.00046132554,0.061569914],"genre_scores_gemma":[0.9921022,0.00024882378,0.0033448467,0.00008933419,0.000078686324,0.000023188955,0.00024289319,0.000061624574,0.003808442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975115,0.000052662228,0.000008929491,0.00005666441,0.00006366444,0.00006695089],"domain_scores_gemma":[0.997962,0.001074401,0.00025712664,0.00015851327,0.00019214985,0.0003559315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044900333,0.00031206373,0.00056370755,0.0020979345,0.0008086374,0.0017257507,0.0010030336,0.0007721625,0.00563105],"category_scores_gemma":[0.0045608543,0.00021290156,0.00025365144,0.00074931147,0.00094775675,0.0018159247,0.0009384311,0.00086596404,0.0005215965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046600762,0.00010227247,0.0048843906,0.00023204485,0.000047912523,0.00042222795,0.00043938856,0.017531462,0.015467067,0.92907447,0.012839053,0.018493818],"study_design_scores_gemma":[0.00006021378,0.00006384759,0.006046485,0.00006188639,0.00005810928,0.00085052836,0.0004706015,0.15261227,0.0053918776,0.8299042,0.004439482,0.000040529078],"about_ca_topic_score_codex":0.0006499339,"about_ca_topic_score_gemma":0.0009712744,"teacher_disagreement_score":0.00563105,"about_ca_system_score_codex":0.0009485372,"about_ca_system_score_gemma":0.000341745,"threshold_uncertainty_score":0.01883775},"labels":[],"label_agreement":null},{"id":"W2594442541","doi":"","title":"Some Tree-book Ramsey Numbers.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Tree (set theory); Combinatorics","score_opus":0.017052469056271932,"score_gpt":0.2581234310388054,"score_spread":0.24107096198253347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594442541","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07559379,0.0073765237,0.115079455,0.011700437,0.001290244,0.000060284605,0.002000373,0.0007704942,0.7861284],"genre_scores_gemma":[0.73595667,0.0034767573,0.047010627,0.0022882046,0.00086347293,0.00014725736,0.00099012,0.00031112222,0.20895572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968517,0.00008317816,0.000016559654,0.000076553384,0.00008862159,0.000049899445],"domain_scores_gemma":[0.9986749,0.00075985637,0.00009278785,0.00014781908,0.00019119709,0.0001334024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000520455,0.00033924697,0.00042716903,0.0011982488,0.0016932606,0.002868117,0.0005456749,0.00070051017,0.029608125],"category_scores_gemma":[0.0035105823,0.0003099597,0.00045389018,0.0014425967,0.0014143129,0.0057910834,0.001260254,0.0021599024,0.0046802163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019478064,0.0000072449375,0.000076419004,0.000036123023,0.0000045380743,0.000032138716,0.00007460293,0.00024407133,0.00016187996,0.982144,0.010692973,0.0065063783],"study_design_scores_gemma":[0.0000083860505,0.0000057419716,0.00014108824,0.000020701886,0.0000058563833,0.000112259775,0.000052192205,0.0011697386,0.00022127692,0.97435015,0.02390673,0.000005982105],"about_ca_topic_score_codex":0.0010378363,"about_ca_topic_score_gemma":0.002022596,"teacher_disagreement_score":0.029608125,"about_ca_system_score_codex":0.001255802,"about_ca_system_score_gemma":0.00053567614,"threshold_uncertainty_score":0.09904909},"labels":[],"label_agreement":null},{"id":"W2594531834","doi":"","title":"On the Crossing Numbers of the Joint Graphs of a Path or a Cycle.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Path (computing); Joint (building); Combinatorics; Computer science; Structural engineering; Computer network","score_opus":0.024364662796007457,"score_gpt":0.2615145343248359,"score_spread":0.23714987152882844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594531834","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48989064,0.0017590731,0.36415988,0.0014199137,0.00057549874,0.00010865691,0.0010945572,0.0005987757,0.14039305],"genre_scores_gemma":[0.9154615,0.00092700706,0.06691193,0.00020409226,0.0002306233,0.00011963322,0.0007012398,0.00033167718,0.01511236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992675,0.00022129432,0.000040507723,0.0001592381,0.0001854339,0.00012596267],"domain_scores_gemma":[0.9933437,0.0044112746,0.00076852844,0.0004970143,0.0004288376,0.00055072637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012442298,0.00060353044,0.00054932415,0.003635097,0.0010530384,0.002396766,0.0011887046,0.0011028223,0.013148059],"category_scores_gemma":[0.012828433,0.00045065163,0.0004877569,0.0016693202,0.002126281,0.0046527595,0.0016340005,0.00197313,0.0013060246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015312582,0.000048202848,0.0021207698,0.000105291525,0.000020239835,0.00013170694,0.00027455846,0.015959144,0.0022258959,0.9394307,0.005582895,0.033947513],"study_design_scores_gemma":[0.000019888088,0.000040045594,0.0015273746,0.00006541633,0.000024649387,0.00024732144,0.0002220354,0.054021865,0.0018537977,0.93569386,0.006260262,0.000023522023],"about_ca_topic_score_codex":0.0007950368,"about_ca_topic_score_gemma":0.0012420346,"teacher_disagreement_score":0.013148059,"about_ca_system_score_codex":0.0009035927,"about_ca_system_score_gemma":0.00041541716,"threshold_uncertainty_score":0.04398465},"labels":[],"label_agreement":null},{"id":"W2594681606","doi":"","title":"Decomposition of λK v into kites and 4-cycles.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Genomic variations and chromosomal abnormalities","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Decomposition; Mathematics; Chemistry","score_opus":0.006464864004927661,"score_gpt":0.25190714349806936,"score_spread":0.2454422794931417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594681606","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.524024,0.0011495809,0.25619778,0.0007321457,0.00075569376,0.00032448236,0.002672774,0.0015556158,0.21258782],"genre_scores_gemma":[0.8065676,0.00063547835,0.058240343,0.00045949488,0.00023703465,0.00032454924,0.0029486853,0.00087059214,0.12971628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946135,0.000077426026,0.00004478802,0.00013967168,0.00012065603,0.0001560055],"domain_scores_gemma":[0.99940205,0.0001017051,0.00013110731,0.00009011303,0.00013551701,0.00013966925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026374654,0.0007816412,0.00046539758,0.002272695,0.00092044903,0.002237655,0.00089664414,0.0005489468,0.01898587],"category_scores_gemma":[0.00091619015,0.00040247507,0.0008840371,0.0008296007,0.0013548873,0.0017516196,0.0014687729,0.0009692135,0.00552236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027650618,0.000058091875,0.0017813628,0.00021074717,0.0000674473,0.00072325376,0.00050053094,0.0040059187,0.020190328,0.91357386,0.007571478,0.051040504],"study_design_scores_gemma":[0.00003105784,0.00006613898,0.0020926509,0.000066525994,0.00003437006,0.0006918068,0.00036498948,0.0075377864,0.0062495214,0.94076717,0.042044133,0.00005379379],"about_ca_topic_score_codex":0.0011116903,"about_ca_topic_score_gemma":0.0013718023,"teacher_disagreement_score":0.01898587,"about_ca_system_score_codex":0.000738933,"about_ca_system_score_gemma":0.000516044,"threshold_uncertainty_score":0.063514054},"labels":[],"label_agreement":null},{"id":"W2594725618","doi":"","title":"The Expected Values of the Wiener Indices in the Random phenylene and spiro chains.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"History and advancements in chemistry","field":"Chemistry","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Wiener index; Phenylene; Poly(p-phenylene); Statistics; Combinatorics; Polymer; Materials science; Composite material","score_opus":0.011576017449119867,"score_gpt":0.2536758839420124,"score_spread":0.24209986649289253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594725618","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6243549,0.0024742237,0.30102238,0.003811483,0.00074584904,0.00018825027,0.0024866827,0.0010103784,0.06390587],"genre_scores_gemma":[0.9468484,0.0012596092,0.026842996,0.00037813402,0.00036497758,0.00029275997,0.0009513526,0.0003414443,0.022720397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856937,0.0004285364,0.00008141057,0.0002981012,0.00031941413,0.00030320595],"domain_scores_gemma":[0.98898214,0.006427185,0.0011008056,0.0013125,0.00088500103,0.0012922995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003706251,0.00095139514,0.0011793497,0.003029004,0.0010619123,0.0034031752,0.0022751258,0.0022125167,0.014040372],"category_scores_gemma":[0.019761546,0.00079578755,0.00083897565,0.0011712611,0.0042326464,0.0063137636,0.0022866074,0.0023986218,0.0020890327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016375,0.00006466406,0.0013118497,0.00015798467,0.000044583474,0.00021258836,0.00011961849,0.014964388,0.0037744788,0.96931386,0.0026817275,0.007190404],"study_design_scores_gemma":[0.00004934549,0.00007387882,0.0025054908,0.00014564655,0.000037989066,0.0002753628,0.00011200728,0.14946662,0.0039602015,0.84035486,0.0028713488,0.00014731984],"about_ca_topic_score_codex":0.000572201,"about_ca_topic_score_gemma":0.0008798941,"teacher_disagreement_score":0.014040372,"about_ca_system_score_codex":0.0015099548,"about_ca_system_score_gemma":0.0012776544,"threshold_uncertainty_score":0.04696977},"labels":[],"label_agreement":null},{"id":"W2594883028","doi":"","title":"External Difference Families from Gauss Sums.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Gauss; Pure mathematics; Physics; Quantum mechanics","score_opus":0.058132202438989436,"score_gpt":0.34430999924367195,"score_spread":0.2861777968046825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594883028","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19805089,0.004358697,0.2281,0.0033408918,0.0013435179,0.000053133106,0.0004860452,0.00040356882,0.5638633],"genre_scores_gemma":[0.9062314,0.001955753,0.02335157,0.0006763725,0.0010118383,0.000053938875,0.00052541035,0.00024184702,0.065951996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939275,0.00018295596,0.000028517148,0.000094547875,0.00023422885,0.000067089764],"domain_scores_gemma":[0.99880517,0.00049458817,0.00012719948,0.0001597185,0.00023218326,0.0001811338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087521295,0.00055615936,0.00050963357,0.0023614976,0.0013027671,0.0026101328,0.00059257774,0.0006101758,0.010388481],"category_scores_gemma":[0.0031701473,0.0003087078,0.00052078924,0.0009912703,0.0024306711,0.0051674247,0.003025189,0.0023638008,0.0018806771],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008176165,0.000005635872,0.00011728139,0.000016893055,0.0000027932176,0.000025915047,0.00007689807,0.000116658826,0.00019385047,0.9952377,0.00084158004,0.0033565508],"study_design_scores_gemma":[0.000004948582,0.00000650312,0.00016548492,0.000013788338,0.0000042098723,0.00018305828,0.00005941621,0.0010290005,0.0003199756,0.9916147,0.006593782,0.0000051411103],"about_ca_topic_score_codex":0.00026656248,"about_ca_topic_score_gemma":0.00030231813,"teacher_disagreement_score":0.010388481,"about_ca_system_score_codex":0.0008519718,"about_ca_system_score_gemma":0.00030132566,"threshold_uncertainty_score":0.034752965},"labels":[],"label_agreement":null},{"id":"W2594885100","doi":"","title":"Subgraphs And Similarity Of Vertices.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Similarity (geometry); Artificial intelligence; Computer science","score_opus":0.023551922607211114,"score_gpt":0.300733246410696,"score_spread":0.27718132380348487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594885100","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7079305,0.0035416693,0.21698049,0.0025947238,0.00026149114,0.00013344482,0.0018608076,0.00056619116,0.06613064],"genre_scores_gemma":[0.9608344,0.0009171182,0.026927527,0.00029766574,0.00027410124,0.000086403976,0.0016706447,0.000111686946,0.008880431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998558,0.00048427965,0.00009162337,0.00044141413,0.00029146046,0.00013331427],"domain_scores_gemma":[0.99206346,0.0036673925,0.0017641011,0.0012236737,0.0006624502,0.0006189625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077600044,0.0003049585,0.0008298892,0.0039014735,0.0011891916,0.0026996173,0.0011782544,0.0011491287,0.006790511],"category_scores_gemma":[0.01202805,0.00036030432,0.0006094946,0.003440925,0.0020262925,0.005294974,0.0021120852,0.00095546286,0.0010516619],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017958053,0.00008416818,0.009896406,0.00020030522,0.000096009295,0.00029734054,0.0008131285,0.0050854953,0.0032784692,0.92748517,0.0050690374,0.047514956],"study_design_scores_gemma":[0.000020357593,0.000037867158,0.005986341,0.000041298128,0.000056339206,0.0006803717,0.00038783942,0.01491414,0.0012212874,0.968493,0.008144355,0.00001673687],"about_ca_topic_score_codex":0.0010055184,"about_ca_topic_score_gemma":0.0013623734,"teacher_disagreement_score":0.006790511,"about_ca_system_score_codex":0.0009579326,"about_ca_system_score_gemma":0.00035615143,"threshold_uncertainty_score":0.022716522},"labels":[],"label_agreement":null},{"id":"W2600807309","doi":"","title":"On Short Zero-Sum Subsequences.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Subsequence; Mathematics; Combinatorics; Longest increasing subsequence; Zero (linguistics); Sequence (biology); Rank (graph theory); Exponent; Abelian group; Integer (computer science); Longest common subsequence problem; Discrete mathematics; Mathematical analysis","score_opus":0.008764179171844001,"score_gpt":0.20620182779831142,"score_spread":0.19743764862646743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2600807309","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8646707,0.0022171142,0.10259117,0.00051531853,0.00023361806,0.000058376838,0.00022624625,0.0002474882,0.029240035],"genre_scores_gemma":[0.9754961,0.00064646377,0.01748445,0.000116195966,0.00026499334,0.000051090567,0.00026892906,0.00005306502,0.005618661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994704,0.00009771101,0.0000432294,0.00012697396,0.00014295576,0.00011872874],"domain_scores_gemma":[0.9972397,0.0008939661,0.00092754944,0.0002937489,0.00024740642,0.00039762267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074865983,0.00055225805,0.0005191428,0.0029311976,0.0013149199,0.0012436812,0.0005725954,0.0007496968,0.0036703774],"category_scores_gemma":[0.004302792,0.00028908122,0.00045567632,0.001397772,0.0023443766,0.003845133,0.0013979565,0.00080591696,0.0006436608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030411384,0.00006953389,0.0054604304,0.00020967421,0.000030295927,0.00076387665,0.001175414,0.0043468503,0.022843707,0.929287,0.0008922919,0.034616802],"study_design_scores_gemma":[0.000029515679,0.0002520947,0.0044023576,0.00010550091,0.00003780034,0.0011753658,0.0007266253,0.021651385,0.01732898,0.94398504,0.01025275,0.000052608502],"about_ca_topic_score_codex":0.00029744473,"about_ca_topic_score_gemma":0.00033632666,"teacher_disagreement_score":0.0036703774,"about_ca_system_score_codex":0.00079779926,"about_ca_system_score_gemma":0.0003457514,"threshold_uncertainty_score":0.012278616},"labels":[],"label_agreement":null},{"id":"W2605957025","doi":"","title":"K-dominating sets of $P_(2k+2)\\times P_n$ and $P_m\\times P_n$","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Animal science; Biology","score_opus":0.014342453309719075,"score_gpt":0.2858869884345875,"score_spread":0.2715445351248684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605957025","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.933383,0.0014231567,0.031799283,0.000884778,0.00010764491,0.00016382456,0.0031211383,0.00019618886,0.028920934],"genre_scores_gemma":[0.9350335,0.0012175315,0.047495678,0.0002407901,0.000115018745,0.00026279836,0.003888858,0.00017405713,0.011571844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908984,0.00016221155,0.00005099912,0.00026810152,0.0001872993,0.00024155165],"domain_scores_gemma":[0.99399287,0.0041037113,0.0006522336,0.00037702298,0.00033373662,0.0005404422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073094346,0.0008855758,0.0007120465,0.0012623667,0.0023435983,0.002175589,0.0012745375,0.0007714314,0.0063495054],"category_scores_gemma":[0.0047441144,0.000651209,0.0007885649,0.0011525172,0.0010037826,0.003088291,0.0013519782,0.0010415581,0.0009018346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005902324,0.0008612033,0.058177985,0.0029791156,0.00083948945,0.0034072618,0.0038254643,0.18416184,0.18024191,0.34265387,0.035972986,0.18097652],"study_design_scores_gemma":[0.00046102365,0.00063296006,0.06404864,0.00032757866,0.0006168693,0.012381593,0.0023294694,0.32417747,0.14117838,0.36395416,0.08958659,0.0003053557],"about_ca_topic_score_codex":0.0010761885,"about_ca_topic_score_gemma":0.002214072,"teacher_disagreement_score":0.0063495054,"about_ca_system_score_codex":0.0018421288,"about_ca_system_score_gemma":0.0007149063,"threshold_uncertainty_score":0.021241188},"labels":[],"label_agreement":null},{"id":"W2612041959","doi":"","title":"Periodicity of A Partition Function Related to Making Change Modulo Prime Powers.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Modulo; Mathematics; Partition (number theory); Prime (order theory); Arithmetic; Combinatorics","score_opus":0.08285873117284184,"score_gpt":0.364268232017429,"score_spread":0.28140950084458716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612041959","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7810271,0.0012385674,0.09097685,0.0013532303,0.0009931755,0.000061137696,0.00025422033,0.00030273912,0.123793036],"genre_scores_gemma":[0.9823188,0.00026671292,0.0069186864,0.000118640404,0.00030327513,0.000032716125,0.00010220899,0.00010321921,0.009835541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996458,0.00008212132,0.0000137773395,0.00006396792,0.0000977565,0.00009649136],"domain_scores_gemma":[0.9990476,0.00032745258,0.00021556634,0.00016422992,0.00008184589,0.00016329894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063952233,0.00035256916,0.0005036435,0.0014764266,0.001364672,0.001585128,0.0007020824,0.0007910177,0.0067763655],"category_scores_gemma":[0.002832589,0.0002375424,0.0005988129,0.00066363,0.0026046056,0.0021611021,0.00093408115,0.0012962408,0.00074141717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057799778,0.00001971981,0.00037603662,0.000028812556,0.0000057458396,0.00016865486,0.0001522852,0.0009641155,0.0019415463,0.9908311,0.001044354,0.0044097723],"study_design_scores_gemma":[0.00002440897,0.000029787572,0.00090323493,0.000016050442,0.000008631334,0.00030896597,0.00008169922,0.010473753,0.0010383473,0.98499596,0.002105335,0.000013829196],"about_ca_topic_score_codex":0.00045630633,"about_ca_topic_score_gemma":0.00039294484,"teacher_disagreement_score":0.0067763655,"about_ca_system_score_codex":0.0006863065,"about_ca_system_score_gemma":0.00046261327,"threshold_uncertainty_score":0.022669196},"labels":[],"label_agreement":null},{"id":"W2612145187","doi":"","title":"Recounting the number of peaks and valleys in compositions of integers.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Integer (computer science); Combinatorics; Set (abstract data type); Discrete mathematics; Computer science","score_opus":0.03600574116603807,"score_gpt":0.3414195245162259,"score_spread":0.3054137833501879,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612145187","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07249143,0.004755146,0.8319854,0.002210957,0.001428707,0.00010817181,0.00088881794,0.00073520886,0.08539608],"genre_scores_gemma":[0.60984385,0.0028540974,0.36484006,0.0011586108,0.0011824694,0.00022937845,0.0008615522,0.00085515983,0.018174885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978333,0.00038525058,0.00012749317,0.00056939706,0.0008436148,0.00024095079],"domain_scores_gemma":[0.9947208,0.0026806446,0.000733998,0.0008950646,0.00063944055,0.00033003622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018457368,0.00095176685,0.00081823097,0.0027853027,0.00239309,0.0029938167,0.0019608382,0.0010411474,0.008790951],"category_scores_gemma":[0.0122970035,0.0007756304,0.0010676322,0.0024632823,0.0036266567,0.008653442,0.003090332,0.0035138284,0.0012609119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011814679,0.000033573586,0.0020394388,0.0002108224,0.00003324776,0.00018282938,0.00037273063,0.0040895366,0.0067777093,0.95068085,0.004507644,0.030953562],"study_design_scores_gemma":[0.000015372474,0.000046782658,0.0012129275,0.000090963134,0.000051790994,0.0007475441,0.00021014578,0.023302848,0.0069783414,0.9440342,0.023263846,0.000045032513],"about_ca_topic_score_codex":0.00067479344,"about_ca_topic_score_gemma":0.0012184103,"teacher_disagreement_score":0.008790951,"about_ca_system_score_codex":0.0014104681,"about_ca_system_score_gemma":0.0007557559,"threshold_uncertainty_score":0.029408634},"labels":[],"label_agreement":null},{"id":"W2612176865","doi":"","title":"Some Operations on Fuzzy Hypergraphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Fuzzy logic; Artificial intelligence; Computer science","score_opus":0.13257204763143965,"score_gpt":0.4130417413109911,"score_spread":0.28046969367955144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612176865","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033455778,0.005913134,0.84957314,0.0035715096,0.0005338244,0.00021270713,0.0014141641,0.0002585279,0.10506731],"genre_scores_gemma":[0.46320584,0.00678691,0.48308802,0.0010112433,0.0011748759,0.00074950635,0.0012249441,0.00018770585,0.042570863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976076,0.0011662651,0.00021108717,0.00034062171,0.0005348138,0.00013965987],"domain_scores_gemma":[0.9946896,0.003746905,0.0003858378,0.00042322162,0.0004888143,0.0002656956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033283937,0.00096447545,0.00094650325,0.0034330706,0.0013385364,0.004515664,0.0010570135,0.0011338524,0.012847348],"category_scores_gemma":[0.008374717,0.0005435013,0.0016294073,0.0048186393,0.0029405262,0.0070984517,0.0018722089,0.0029951122,0.0018421393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020845842,0.000021179307,0.000106579304,0.00010469456,0.00002560654,0.00005549426,0.00013332303,0.0052408893,0.00022926503,0.9693383,0.0030250505,0.02169883],"study_design_scores_gemma":[0.000009242001,0.000016345628,0.00012042267,0.000059879287,0.000014541096,0.00007435366,0.00006172423,0.017913308,0.00019725006,0.9744485,0.007071491,0.0000129324035],"about_ca_topic_score_codex":0.0015312947,"about_ca_topic_score_gemma":0.001839975,"teacher_disagreement_score":0.012847348,"about_ca_system_score_codex":0.0028146626,"about_ca_system_score_gemma":0.0010640951,"threshold_uncertainty_score":0.042978585},"labels":[],"label_agreement":null},{"id":"W2612340482","doi":"","title":"The upper vertex detour monophonic number of a graph.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Vertex (graph theory); Mathematics; Combinatorics; Graph","score_opus":0.015572685197471878,"score_gpt":0.30079238006768977,"score_spread":0.28521969487021787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612340482","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62682796,0.00080597465,0.06478722,0.0027010369,0.0011406677,0.00008392172,0.0020541137,0.0007547058,0.30084443],"genre_scores_gemma":[0.9470132,0.0004526449,0.013225063,0.00034934297,0.00030544103,0.00009287837,0.0007490158,0.00018858585,0.037623722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939966,0.000119957906,0.000027369993,0.000120279685,0.00015551681,0.00017726059],"domain_scores_gemma":[0.9980136,0.0008215356,0.00022816232,0.00024547256,0.0002301958,0.00046092825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004432495,0.000552082,0.00054545805,0.002668388,0.0018854844,0.0025370582,0.0010210567,0.0011539327,0.019215679],"category_scores_gemma":[0.0029761798,0.00022940083,0.0003540107,0.0012059525,0.0019082525,0.0024327554,0.0014812124,0.0015276537,0.0032426696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003348709,0.00006498892,0.0012706394,0.00016112534,0.000020645117,0.0003154353,0.0004065877,0.001911172,0.010718031,0.94424254,0.009265264,0.031288914],"study_design_scores_gemma":[0.000039597977,0.0000895951,0.0028400922,0.00010019698,0.0000372308,0.00072823424,0.0003124815,0.011395569,0.0074479077,0.94654953,0.030403119,0.000056447836],"about_ca_topic_score_codex":0.0009137927,"about_ca_topic_score_gemma":0.0013821088,"teacher_disagreement_score":0.019215679,"about_ca_system_score_codex":0.0008407367,"about_ca_system_score_gemma":0.00052993314,"threshold_uncertainty_score":0.064282835},"labels":[],"label_agreement":null},{"id":"W2612440810","doi":"","title":"The Adjacent Vertex Distinguishing Total Chromatic Number of Some Families of Snarks.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Vertex (graph theory); Combinatorics; Graph","score_opus":0.011504315404877936,"score_gpt":0.25035150257348376,"score_spread":0.23884718716860584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612440810","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88859427,0.000526738,0.032820962,0.0015152913,0.00016984373,0.00004742455,0.0012475393,0.0002427124,0.0748353],"genre_scores_gemma":[0.98371416,0.00019388006,0.009205566,0.00017737255,0.00006964509,0.000047466252,0.0006261755,0.00006755508,0.005898078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933076,0.00016805,0.000028669116,0.00020703193,0.00010427847,0.00016120773],"domain_scores_gemma":[0.99583364,0.002501785,0.0004779731,0.0003859528,0.00027746166,0.000523209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094508583,0.00039562667,0.00045921135,0.0017179855,0.0027453366,0.0025002963,0.0014942104,0.0011456988,0.010321419],"category_scores_gemma":[0.0046386085,0.0004675818,0.0006095376,0.0012472639,0.002104298,0.0034214098,0.0013123057,0.0015289051,0.0005211517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046857342,0.00008381389,0.005687103,0.00015618569,0.000044712586,0.000203284,0.00043344902,0.009351408,0.0054934127,0.95452935,0.009582592,0.01396597],"study_design_scores_gemma":[0.00009201011,0.00007425824,0.005025551,0.000053995023,0.000094307754,0.00062396453,0.0006280043,0.052873336,0.0041472074,0.9266141,0.009720514,0.00005272019],"about_ca_topic_score_codex":0.002272283,"about_ca_topic_score_gemma":0.0030775473,"teacher_disagreement_score":0.010321419,"about_ca_system_score_codex":0.0024236366,"about_ca_system_score_gemma":0.0008400461,"threshold_uncertainty_score":0.034528553},"labels":[],"label_agreement":null},{"id":"W2612538177","doi":"","title":"On the signless Laplacian spectral radius of tricyclic graphs with n vertices and diameter d.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Spectral radius; Tricyclic; RADIUS; Physics; Chemistry; Stereochemistry; Computer science; Computer network; Quantum mechanics","score_opus":0.02715207151651852,"score_gpt":0.2767585404666356,"score_spread":0.2496064689501171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612538177","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7606628,0.013198905,0.09562863,0.007013185,0.00079217786,0.00008426724,0.0011994216,0.0006524866,0.12076825],"genre_scores_gemma":[0.98548996,0.0023961759,0.0067382525,0.00040469633,0.0004891216,0.00006809356,0.00028269686,0.00012812944,0.0040029385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914455,0.00039150816,0.000034803972,0.00014129338,0.00015195763,0.00013585732],"domain_scores_gemma":[0.9908789,0.0061884397,0.001075181,0.0003981808,0.0005176921,0.0009416274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012414319,0.00070414454,0.0009096941,0.003421865,0.0008561421,0.0018349967,0.0018008642,0.0012778918,0.0045573986],"category_scores_gemma":[0.014532949,0.00044369887,0.00028830228,0.0015424569,0.0027979119,0.00303526,0.0020437068,0.0013283981,0.001150048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005682544,0.00012085146,0.003573274,0.0004951872,0.000068741836,0.00036948078,0.0006733774,0.038928747,0.007858777,0.88650286,0.028788416,0.032051988],"study_design_scores_gemma":[0.00009466768,0.000115792536,0.0034932254,0.00016966467,0.000054990465,0.0006595901,0.00064082,0.14419197,0.0021885443,0.8409904,0.00731009,0.000090268804],"about_ca_topic_score_codex":0.0011430853,"about_ca_topic_score_gemma":0.000848683,"teacher_disagreement_score":0.0045573986,"about_ca_system_score_codex":0.001297581,"about_ca_system_score_gemma":0.00040141444,"threshold_uncertainty_score":0.015246034},"labels":[],"label_agreement":null},{"id":"W2612569969","doi":"","title":"On the Laplacian Estrada index of graphs with given chromatic number.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Chromatic scale; Combinatorics; Laplace operator; Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.022238575197236626,"score_gpt":0.281020372039026,"score_spread":0.25878179684178937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612569969","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73812413,0.0029563562,0.07926695,0.0031321782,0.0005902948,0.000041293642,0.0009870382,0.00045636724,0.1744453],"genre_scores_gemma":[0.97867775,0.00088490173,0.0077869534,0.00022624368,0.0003318296,0.000041380263,0.00038406643,0.00012262075,0.011544289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965703,0.00009831745,0.000011246793,0.00007506101,0.00008439385,0.00007405073],"domain_scores_gemma":[0.99747366,0.0014200346,0.00032547116,0.00014479613,0.00025721683,0.000378818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006168522,0.00049687165,0.00061697833,0.003737561,0.0009952427,0.001847886,0.0011695949,0.0008216125,0.007453013],"category_scores_gemma":[0.00479801,0.00020902912,0.0002738172,0.0017064989,0.0016961463,0.0028163267,0.001256615,0.0013193998,0.00095623743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020685705,0.000067006506,0.0031624145,0.00011612319,0.000024400264,0.00014661746,0.00039036403,0.01079195,0.003994424,0.95331603,0.0102802655,0.017503489],"study_design_scores_gemma":[0.00003123513,0.000039401697,0.0027686148,0.00006191277,0.000026241032,0.0002945339,0.0003808329,0.06193715,0.0014013221,0.92727673,0.0057455897,0.000036422476],"about_ca_topic_score_codex":0.001722481,"about_ca_topic_score_gemma":0.0022387283,"teacher_disagreement_score":0.007453013,"about_ca_system_score_codex":0.0015238705,"about_ca_system_score_gemma":0.00038515343,"threshold_uncertainty_score":0.024932861},"labels":[],"label_agreement":null},{"id":"W2612680057","doi":"","title":"On the monophonic sets of the strong product graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Product (mathematics); Combinatorics; Geometry","score_opus":0.025582562171351,"score_gpt":0.29246198838400117,"score_spread":0.26687942621265015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612680057","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47509927,0.0023745594,0.2718774,0.0037025842,0.00074895355,0.00011153376,0.0010315304,0.00045465425,0.2445996],"genre_scores_gemma":[0.9270181,0.0010818373,0.03462935,0.0009480973,0.0006800424,0.00015087794,0.0007233752,0.00024973144,0.03451855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989077,0.0003604594,0.000054205862,0.00021708205,0.00026611786,0.00019443863],"domain_scores_gemma":[0.99667656,0.001918448,0.00035520122,0.0003844984,0.000264925,0.00040025456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009315654,0.00062241347,0.00081199396,0.0024513295,0.002589006,0.002591338,0.0013059872,0.0014101805,0.012665384],"category_scores_gemma":[0.004027389,0.00075628795,0.0010583608,0.0014299728,0.003362123,0.0059498027,0.0032934507,0.0025040063,0.0017017679],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033530512,0.00001481913,0.0001307767,0.000031156917,0.000006260242,0.000059364324,0.00014831906,0.0005249058,0.0005624203,0.9929877,0.0012448662,0.004255846],"study_design_scores_gemma":[0.000008460779,0.000010816807,0.00016903816,0.00001694689,0.000006279092,0.0000915108,0.000059006787,0.00239578,0.00026590138,0.9947778,0.0021900965,0.000008341866],"about_ca_topic_score_codex":0.000836374,"about_ca_topic_score_gemma":0.0011597443,"teacher_disagreement_score":0.012665384,"about_ca_system_score_codex":0.0010760111,"about_ca_system_score_gemma":0.00045360168,"threshold_uncertainty_score":0.04236996},"labels":[],"label_agreement":null},{"id":"W2612745781","doi":"","title":"On The Generalized Gaussian Fibonacci Numbers.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Mathematics; Gaussian; Combinatorics; Statistical physics; Physics; Quantum mechanics","score_opus":0.015161852958968491,"score_gpt":0.2856246893013278,"score_spread":0.2704628363423593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612745781","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13706861,0.024033995,0.28416058,0.008915833,0.005815345,0.00010908937,0.00082465884,0.00048810424,0.5385838],"genre_scores_gemma":[0.84769315,0.010104674,0.05492002,0.0041150153,0.0035098372,0.00020604883,0.00046917613,0.00025354233,0.078728534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993222,0.00020919148,0.00003148824,0.00008294244,0.00022510192,0.00012913774],"domain_scores_gemma":[0.99879044,0.0005518919,0.00011157079,0.00014183736,0.00026238887,0.00014182329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010648384,0.0008281797,0.0007303468,0.0025979942,0.0018868048,0.002669867,0.00081970164,0.0014413497,0.008325638],"category_scores_gemma":[0.0041046767,0.0003788036,0.00071699894,0.0016074902,0.004346266,0.0046989587,0.0019166662,0.002224174,0.0022653327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004775979,0.000002090871,0.000030929536,0.000011741275,0.0000016289963,0.000022850812,0.00003617233,0.00023986316,0.00011518334,0.9959472,0.0014677679,0.002119885],"study_design_scores_gemma":[0.0000033542674,0.000004740789,0.000080000515,0.00001506042,0.000002097558,0.00006408249,0.000023492064,0.0014311055,0.00007028439,0.99364305,0.0046562,0.0000065339023],"about_ca_topic_score_codex":0.0017999395,"about_ca_topic_score_gemma":0.0018977552,"teacher_disagreement_score":0.008325638,"about_ca_system_score_codex":0.0013325727,"about_ca_system_score_gemma":0.0008375332,"threshold_uncertainty_score":0.027851999},"labels":[],"label_agreement":null},{"id":"W2612751452","doi":"","title":"NBB bases of some lattices of pattern avoiding permutations.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.019426898417844934,"score_gpt":0.2651149689424482,"score_spread":0.24568807052460326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612751452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3244552,0.0017284644,0.33767354,0.0018621853,0.0009271787,0.00017678287,0.0029968012,0.0010123927,0.3291674],"genre_scores_gemma":[0.8533087,0.0004553629,0.08788924,0.00039961186,0.00023309844,0.00026002916,0.0020379846,0.00022275969,0.05519319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933416,0.00015938896,0.00004681627,0.000113580274,0.00020595152,0.0001400069],"domain_scores_gemma":[0.99884975,0.00028548512,0.0001507023,0.0001960171,0.00025975972,0.0002582136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000501537,0.00039276766,0.0005408255,0.0013047588,0.0018882207,0.0022479412,0.00077819277,0.00057826063,0.015278179],"category_scores_gemma":[0.0018206458,0.0004065669,0.00057835627,0.0008429671,0.0015952612,0.0020760698,0.0014626775,0.0014162186,0.0037993183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001139482,0.000043245367,0.00028329928,0.0000672186,0.000010723361,0.0002383218,0.000245728,0.0009312767,0.0038129543,0.98043174,0.0028402132,0.01098136],"study_design_scores_gemma":[0.000030543182,0.00002416547,0.00031650838,0.000037121543,0.000009717056,0.0003203868,0.00022950444,0.0043313378,0.0028690095,0.97325224,0.018560171,0.000019282237],"about_ca_topic_score_codex":0.0012126686,"about_ca_topic_score_gemma":0.0014773167,"teacher_disagreement_score":0.015278179,"about_ca_system_score_codex":0.00077288353,"about_ca_system_score_gemma":0.0006729785,"threshold_uncertainty_score":0.051110625},"labels":[],"label_agreement":null},{"id":"W2612873602","doi":"","title":"Riordan arrays and hyperharmonic numbers.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.042047836091915945,"score_gpt":0.31918124528391717,"score_spread":0.27713340919200125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612873602","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090464205,0.008984589,0.054170705,0.0033271178,0.0014391028,0.000028598339,0.00024860568,0.00016752629,0.84116954],"genre_scores_gemma":[0.82607275,0.0046051657,0.016953472,0.0012734601,0.0013185837,0.000068677415,0.0002938028,0.00011419561,0.14929985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997168,0.00006609929,0.000008461242,0.000051738934,0.00010582772,0.000051056],"domain_scores_gemma":[0.9996426,0.00013870667,0.00006068263,0.000041803964,0.00006178796,0.00005438497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027422345,0.00033304785,0.00032297985,0.0012794768,0.00079355476,0.0015074657,0.000496434,0.0005063419,0.01429702],"category_scores_gemma":[0.0015873014,0.00018526212,0.00022137523,0.0007380965,0.0014986806,0.0022811433,0.0013612905,0.0016980028,0.002244878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010352842,0.0000055007763,0.00006585755,0.000021700975,0.0000022847871,0.00002987996,0.0000724172,0.0003442004,0.00047322302,0.9871902,0.002393028,0.009391344],"study_design_scores_gemma":[0.0000060772763,0.000009413972,0.00026076395,0.000016641761,0.0000031726208,0.00014525234,0.000114583985,0.0016317561,0.00043664995,0.9684581,0.028910084,0.000007459546],"about_ca_topic_score_codex":0.00047831258,"about_ca_topic_score_gemma":0.00096628466,"teacher_disagreement_score":0.01429702,"about_ca_system_score_codex":0.00069491053,"about_ca_system_score_gemma":0.00024782712,"threshold_uncertainty_score":0.047828257},"labels":[],"label_agreement":null},{"id":"W2612936850","doi":"","title":"Every Tree is a subtree of Graceful Tree, Graceful Graph and Alpha-labeled Graph.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics; Tree (set theory); Alpha (finance); Discrete mathematics; Statistics","score_opus":0.015738610779799014,"score_gpt":0.24053841068903511,"score_spread":0.2247997999092361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612936850","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39398244,0.0015754619,0.46652898,0.0034205369,0.00047052588,0.00014681208,0.0032554558,0.001437139,0.12918259],"genre_scores_gemma":[0.85726297,0.0011012581,0.108856715,0.0007681516,0.00031481902,0.00014603935,0.0024651194,0.00029152117,0.028793428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948066,0.000085170126,0.000035350527,0.00018889547,0.000087575296,0.00012234836],"domain_scores_gemma":[0.99804926,0.00067850476,0.0003182131,0.00041534446,0.00022402884,0.0003146336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045992061,0.00037275546,0.00041024564,0.0012288316,0.0014661681,0.002299177,0.00082774943,0.0008125849,0.006793892],"category_scores_gemma":[0.0018382471,0.00035119362,0.00062775734,0.0019284097,0.0018665405,0.004345554,0.0013521011,0.0013219216,0.0011800072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007530537,0.000025528823,0.00077600474,0.00008828262,0.000013484819,0.00013872297,0.00029145586,0.0011745151,0.003323145,0.973883,0.006401374,0.01380927],"study_design_scores_gemma":[0.000008835853,0.000017264325,0.0006359791,0.00002499032,0.000019823568,0.0003607924,0.0002411638,0.0053901114,0.0017291119,0.97049224,0.021064438,0.000015196939],"about_ca_topic_score_codex":0.0014271057,"about_ca_topic_score_gemma":0.0020258692,"teacher_disagreement_score":0.006793892,"about_ca_system_score_codex":0.0010668117,"about_ca_system_score_gemma":0.0005707211,"threshold_uncertainty_score":0.022727787},"labels":[],"label_agreement":null},{"id":"W2612952466","doi":"","title":"Some results on specific graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.02507550706600073,"score_gpt":0.24814020557703628,"score_spread":0.22306469851103555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612952466","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052537646,0.019053217,0.2995517,0.014233884,0.0019921216,0.00018870662,0.004171684,0.0018598629,0.6064112],"genre_scores_gemma":[0.6104542,0.035969768,0.18864231,0.0144944,0.00579117,0.0009224991,0.012044756,0.0021697436,0.12951122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845755,0.00043691832,0.00008254515,0.0004257294,0.0003770806,0.00022009751],"domain_scores_gemma":[0.99316,0.004248535,0.00046942392,0.0010951359,0.0005162629,0.0005105956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017960302,0.0015253666,0.0015911737,0.0039060386,0.0024252061,0.0041147647,0.0026906098,0.0023516717,0.025609192],"category_scores_gemma":[0.00789055,0.0009553399,0.0019932787,0.006695597,0.002915527,0.010095851,0.0036084703,0.0065923696,0.005458322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042563337,0.0000933278,0.00064456795,0.00062939845,0.000046604597,0.00016053404,0.00019406845,0.0027164915,0.0007909694,0.9315256,0.03711942,0.02603645],"study_design_scores_gemma":[0.00001581283,0.000016470223,0.0006129684,0.000090470545,0.000049230264,0.00032068626,0.000117452444,0.0046571163,0.0006486288,0.9506966,0.042755026,0.000019651574],"about_ca_topic_score_codex":0.0020035163,"about_ca_topic_score_gemma":0.0032528022,"teacher_disagreement_score":0.025609192,"about_ca_system_score_codex":0.002715174,"about_ca_system_score_gemma":0.000896988,"threshold_uncertainty_score":0.085671306},"labels":[],"label_agreement":null},{"id":"W2612960494","doi":"","title":"Locating and differentiating-total dominating sets in unicyclic graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dominating set; Combinatorics; Graph","score_opus":0.018250348461669817,"score_gpt":0.2988495086141311,"score_spread":0.2805991601524613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612960494","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6467774,0.0022431698,0.2719614,0.0018692949,0.00022531266,0.0002785948,0.0015776968,0.00087815314,0.07418907],"genre_scores_gemma":[0.8987313,0.0011101081,0.07093378,0.00030036573,0.00008822227,0.00012387901,0.0012053949,0.00015372786,0.02735331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990934,0.00018715482,0.000063377054,0.00026656184,0.00021761953,0.0001719453],"domain_scores_gemma":[0.99288815,0.0036060128,0.000924164,0.0011522421,0.00074223126,0.0006871719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007569762,0.0006105222,0.00086660916,0.0016261595,0.0016831036,0.0024154957,0.0020121788,0.0011996101,0.0049684932],"category_scores_gemma":[0.009891262,0.000776013,0.0005843889,0.0022312128,0.0018068461,0.0033256444,0.002763849,0.0012986653,0.001166434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005429833,0.00016625844,0.0065550273,0.000841669,0.000085607564,0.001250344,0.0018117386,0.03056709,0.015028093,0.830631,0.011722886,0.100797415],"study_design_scores_gemma":[0.000099951736,0.0001492571,0.0020979797,0.00019747064,0.0001319378,0.0029984238,0.0013900315,0.050432418,0.015967645,0.905906,0.02057212,0.000056815057],"about_ca_topic_score_codex":0.001323807,"about_ca_topic_score_gemma":0.0024915424,"teacher_disagreement_score":0.0049684932,"about_ca_system_score_codex":0.0012830342,"about_ca_system_score_gemma":0.00074385985,"threshold_uncertainty_score":0.016621292},"labels":[],"label_agreement":null},{"id":"W2613125546","doi":"","title":"Exact Wirelength of Circulant Networks into Cycle-of-ladders.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Circulant matrix; Mathematics; Discrete mathematics","score_opus":0.012483639966617308,"score_gpt":0.2460324485260892,"score_spread":0.23354880855947188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613125546","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39121112,0.0032546434,0.3911471,0.0010055768,0.00047905146,0.00008215763,0.0010972125,0.0010751545,0.21064803],"genre_scores_gemma":[0.9306403,0.0012144105,0.04025369,0.00023019771,0.00020391199,0.00009273434,0.0004479602,0.00045522352,0.026461544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996985,0.00006225064,0.000014321758,0.000051184696,0.00011402387,0.000059669554],"domain_scores_gemma":[0.9989881,0.0004489439,0.00014225181,0.00015315469,0.0001502086,0.00011728038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036602488,0.00051075354,0.00043866842,0.0013764879,0.00068119384,0.0016790535,0.0010145019,0.00076748437,0.011597046],"category_scores_gemma":[0.003471675,0.00043727795,0.00035443838,0.0009131521,0.0009686148,0.003193582,0.0008796033,0.0012146635,0.0018464819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049201535,0.000028710441,0.00029719787,0.00010080385,0.000012048572,0.00007319878,0.00010468505,0.01222025,0.0024931508,0.96190387,0.003832415,0.01888454],"study_design_scores_gemma":[0.000008977926,0.000016674156,0.00022638917,0.000026702866,0.0000074225327,0.00007300287,0.000032334854,0.038776256,0.0009734997,0.955973,0.003876096,0.000009613775],"about_ca_topic_score_codex":0.00089339074,"about_ca_topic_score_gemma":0.0020872331,"teacher_disagreement_score":0.011597046,"about_ca_system_score_codex":0.0010355051,"about_ca_system_score_gemma":0.0005202593,"threshold_uncertainty_score":0.038795948},"labels":[],"label_agreement":null},{"id":"W2613146741","doi":"","title":"Laplacian and signless Laplacian characteristic polynomial of generalized subdivision corona vertex graph.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Subdivision; Vertex (graph theory); Graph; Laplace operator; Discrete mathematics; Mathematical analysis; Geography","score_opus":0.030175763734057587,"score_gpt":0.2993318505597598,"score_spread":0.26915608682570225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613146741","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8229417,0.00073885336,0.0749138,0.0021230704,0.0003274786,0.000035347184,0.0005526135,0.00026149684,0.09810553],"genre_scores_gemma":[0.98353094,0.00024625173,0.003180845,0.00012668398,0.00012295927,0.000014065812,0.00020316454,0.000044389246,0.012530835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998448,0.000026744663,0.0000030374465,0.000033115764,0.00004779178,0.000044558947],"domain_scores_gemma":[0.9994399,0.00015845474,0.0000952992,0.000059102345,0.00011961053,0.0001275968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016468625,0.00022763685,0.00030296214,0.0011834792,0.0005311422,0.00093286217,0.00064617867,0.00048304815,0.007724434],"category_scores_gemma":[0.0016731523,0.000121120174,0.0002726712,0.0006615414,0.0009517777,0.0015894013,0.00061749574,0.00091522647,0.00068880164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008872659,0.000048459202,0.0017282187,0.0000642958,0.0000117714535,0.00023602706,0.00027781283,0.0045084143,0.0049299276,0.9592353,0.008378862,0.020492215],"study_design_scores_gemma":[0.000027314014,0.000036590573,0.0028800913,0.000018521816,0.000014087376,0.00050467195,0.00026123598,0.05107301,0.0014855317,0.93626434,0.007409109,0.000025499723],"about_ca_topic_score_codex":0.0015433817,"about_ca_topic_score_gemma":0.0017810456,"teacher_disagreement_score":0.007724434,"about_ca_system_score_codex":0.0007945142,"about_ca_system_score_gemma":0.0003762711,"threshold_uncertainty_score":0.025840819},"labels":[],"label_agreement":null},{"id":"W2613172277","doi":"","title":"The (distance) signless Laplacian spectral radii of digraphs with given dichromatic number.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.016350410814244598,"score_gpt":0.2814519750782307,"score_spread":0.2651015642639861,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613172277","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7244739,0.0008723721,0.1544448,0.0013765158,0.00020569799,0.000068893234,0.0010217087,0.00058466586,0.11695139],"genre_scores_gemma":[0.96909744,0.00037781984,0.017960684,0.0002199684,0.00008971681,0.000072101444,0.00034173322,0.0001085178,0.011731923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940753,0.0001862584,0.000034093715,0.00013538935,0.00014092222,0.000095812706],"domain_scores_gemma":[0.99714726,0.001159357,0.00048453998,0.0002875956,0.00040191275,0.0005194014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059059926,0.0005133318,0.00045660068,0.0021430391,0.0010653554,0.002751538,0.0011227834,0.0009448387,0.007976244],"category_scores_gemma":[0.0060089477,0.00033401768,0.00028123177,0.000928257,0.0016754575,0.0030704117,0.0013656197,0.00080680253,0.0015474675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001620098,0.00004054059,0.0011894794,0.00011171573,0.000018380146,0.000115109935,0.00031066555,0.0038645314,0.0069124047,0.96896166,0.0035708211,0.014742554],"study_design_scores_gemma":[0.00004329696,0.000055438846,0.0017349079,0.000055976274,0.00002960127,0.00074791466,0.00049555715,0.03246114,0.0051236926,0.9507913,0.008419592,0.00004157317],"about_ca_topic_score_codex":0.0005192242,"about_ca_topic_score_gemma":0.0006255461,"teacher_disagreement_score":0.007976244,"about_ca_system_score_codex":0.0010775949,"about_ca_system_score_gemma":0.00039166582,"threshold_uncertainty_score":0.026683152},"labels":[],"label_agreement":null},{"id":"W2613284777","doi":"","title":"The minimum matching energy of tricyclic graphs and given girth and without K 4 -subdivision.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Subdivision; Mathematics; Girth (graph theory); Combinatorics; Tricyclic; Matching (statistics); Discrete mathematics; Statistics; Chemistry; Geography; Stereochemistry","score_opus":0.019603087367869424,"score_gpt":0.28533731674830326,"score_spread":0.26573422938043384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613284777","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90985465,0.0012832527,0.023733763,0.0013681308,0.00014421306,0.000026082811,0.0010245688,0.00016399557,0.06240131],"genre_scores_gemma":[0.98585016,0.00032267487,0.0050874553,0.000110770125,0.000053179014,0.000025203517,0.00042176928,0.00007978054,0.008048997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976367,0.000055064524,0.000010334898,0.000052685242,0.000052546446,0.000065637476],"domain_scores_gemma":[0.9989874,0.0005076857,0.00018229926,0.00010953829,0.00008558524,0.00012744722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030469405,0.00037059764,0.0005336544,0.0011483058,0.0006466148,0.0015262397,0.0012493148,0.0013808432,0.010491338],"category_scores_gemma":[0.0032888332,0.00029889194,0.00033332294,0.0010396661,0.0010486236,0.0018487769,0.0011553031,0.0007869791,0.0010147856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005725066,0.00010418476,0.004281798,0.00043654823,0.00007900284,0.0003983803,0.00040054723,0.048212856,0.009965776,0.88048375,0.013516833,0.041547872],"study_design_scores_gemma":[0.0000482427,0.000058370224,0.004318981,0.00008060269,0.0000445332,0.0005265478,0.00047310413,0.08699839,0.003190835,0.8989747,0.005256074,0.000029580924],"about_ca_topic_score_codex":0.0006305129,"about_ca_topic_score_gemma":0.00094953366,"teacher_disagreement_score":0.010491338,"about_ca_system_score_codex":0.00063025695,"about_ca_system_score_gemma":0.00028899274,"threshold_uncertainty_score":0.035097063},"labels":[],"label_agreement":null},{"id":"W2613310142","doi":"","title":"The number of boundary H-points of H-triangles.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Boundary (topology); Combinatorics; Geometry; Mathematical analysis","score_opus":0.014422553944203838,"score_gpt":0.2768681387994706,"score_spread":0.26244558485526676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613310142","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41516387,0.001923318,0.3899107,0.002270102,0.001107968,0.0003372867,0.008127196,0.0017657869,0.17939377],"genre_scores_gemma":[0.8169239,0.000741399,0.12683435,0.00026549128,0.0002041625,0.00021313666,0.0031301035,0.0006176172,0.051069815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998882,0.00019882194,0.000079728525,0.00022649796,0.00038553408,0.00022736103],"domain_scores_gemma":[0.995956,0.0017540068,0.0003161946,0.00075248093,0.00074503175,0.00047633128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008506504,0.00038532325,0.0007160686,0.0013044128,0.001163562,0.0024254138,0.0015429512,0.0010847072,0.025260177],"category_scores_gemma":[0.0077488758,0.0002867682,0.00045185903,0.0007345001,0.0015732895,0.0025340915,0.0021961941,0.0012624195,0.004831835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014833182,0.00023540069,0.016558748,0.0007885559,0.0001274283,0.00068906805,0.0008219821,0.020088334,0.03952996,0.55281097,0.037550364,0.32931587],"study_design_scores_gemma":[0.00016801848,0.00029592426,0.014413941,0.00033899196,0.00013822115,0.0026775454,0.0014454066,0.09891265,0.06385946,0.7172934,0.100353085,0.00010339509],"about_ca_topic_score_codex":0.0006658991,"about_ca_topic_score_gemma":0.00101285,"teacher_disagreement_score":0.025260177,"about_ca_system_score_codex":0.0004759582,"about_ca_system_score_gemma":0.0004703227,"threshold_uncertainty_score":0.08450371},"labels":[],"label_agreement":null},{"id":"W2613355329","doi":"","title":"Some Posets Of Unicyclic Graphs Based On Signless Laplacian Coefficients.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.030004486733901027,"score_gpt":0.30609367687779043,"score_spread":0.2760891901438894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613355329","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55740637,0.0018763646,0.08456575,0.0034650865,0.0010529145,0.00023420081,0.0016785995,0.0006623679,0.34905833],"genre_scores_gemma":[0.9471476,0.0009787338,0.010606081,0.0005054414,0.0004999918,0.0001588909,0.0009528724,0.0001579164,0.038992517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993925,0.00016501237,0.000033868433,0.00011553904,0.00014612303,0.00014693856],"domain_scores_gemma":[0.99839455,0.0006627431,0.0003145219,0.000111671,0.00017126618,0.00034515417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040963327,0.00088539266,0.00056233,0.0024068854,0.0020272087,0.003466091,0.00094788685,0.0009635927,0.019798618],"category_scores_gemma":[0.0024620725,0.000579192,0.00072432787,0.0015681164,0.0022990394,0.0030214435,0.0023190624,0.00222477,0.002118515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049172286,0.000033839962,0.00022927715,0.000059721886,0.0000081784065,0.00031544676,0.00036562272,0.0010718768,0.001090566,0.98770046,0.00399941,0.0050765756],"study_design_scores_gemma":[0.000030912975,0.000030264106,0.0002986049,0.00003255844,0.000014212395,0.00043066242,0.00034396935,0.00441463,0.00077507924,0.98739815,0.0062092175,0.000021640584],"about_ca_topic_score_codex":0.00071941817,"about_ca_topic_score_gemma":0.0010592605,"teacher_disagreement_score":0.019798618,"about_ca_system_score_codex":0.00084257656,"about_ca_system_score_gemma":0.0004871264,"threshold_uncertainty_score":0.06623292},"labels":[],"label_agreement":null},{"id":"W2613674630","doi":"","title":"Toughness and [a, b]-factors with prescribed properties.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Toughness; Mathematics; Composite material; Materials science","score_opus":0.013168848004242013,"score_gpt":0.1890914299761257,"score_spread":0.1759225819718837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613674630","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40058455,0.0015942777,0.32579753,0.0028311808,0.0006030792,0.00012385438,0.0009230416,0.0008536479,0.26668885],"genre_scores_gemma":[0.9515829,0.00041036887,0.022562765,0.00039960406,0.0002480498,0.00010626044,0.00037470457,0.00016394275,0.024151301],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852544,0.0003612994,0.000076583536,0.0003753975,0.00033441288,0.00032693206],"domain_scores_gemma":[0.99469614,0.0026131067,0.00066320994,0.00065110164,0.0005938528,0.00078258966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009171291,0.0005706898,0.0006013239,0.0019867981,0.0024617831,0.0027365412,0.0007264342,0.0010689909,0.014059343],"category_scores_gemma":[0.00713046,0.0004939307,0.0007058504,0.0012835682,0.0035712726,0.004506217,0.0020045855,0.0018569502,0.0015290631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004198283,0.000014826282,0.00027074388,0.00002461924,0.000006892087,0.00006767357,0.00016304564,0.00057474576,0.0007429381,0.993664,0.001373007,0.0030555497],"study_design_scores_gemma":[0.000015068369,0.000013714713,0.0002741742,0.000019900644,0.00000786524,0.00013813996,0.0001243782,0.0033820404,0.00051364786,0.99051255,0.004985561,0.000013003107],"about_ca_topic_score_codex":0.0020042763,"about_ca_topic_score_gemma":0.0019240426,"teacher_disagreement_score":0.014059343,"about_ca_system_score_codex":0.0010568757,"about_ca_system_score_gemma":0.000711109,"threshold_uncertainty_score":0.04703319},"labels":[],"label_agreement":null},{"id":"W2613721126","doi":"","title":"The orientable genus of the generalized Petersen graph P(km, m).","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Genus; Combinatorics; Petersen graph; Graph; Botany; Line graph; Biology; Voltage graph","score_opus":0.01885727857213785,"score_gpt":0.2842798774385462,"score_spread":0.26542259886640834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613721126","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7962793,0.0010038624,0.020827847,0.0015566166,0.00036123022,0.000039099832,0.0005601046,0.00031576108,0.17905621],"genre_scores_gemma":[0.987186,0.0004189752,0.0028528757,0.000117531,0.000088523346,0.000020532761,0.00018987554,0.00007651776,0.009049131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998398,0.000029487745,0.0000046350424,0.000040130108,0.000041384552,0.000044526314],"domain_scores_gemma":[0.9997023,0.0000864342,0.00008226023,0.000031220614,0.000027852877,0.00006991182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012894267,0.0005506129,0.00031904114,0.0015414107,0.0011490099,0.001719824,0.0005598942,0.0008104611,0.00862693],"category_scores_gemma":[0.001040481,0.00031148858,0.0002748545,0.0006992252,0.0017521023,0.0017637535,0.0015861501,0.001169008,0.0011055561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000120203295,0.000024157593,0.0022222525,0.000114845345,0.00002207806,0.0006226286,0.00057799683,0.004644559,0.0054273424,0.9584102,0.0059022116,0.021911513],"study_design_scores_gemma":[0.000023844977,0.000035145542,0.00556187,0.0000792073,0.000035150708,0.00094240624,0.000656666,0.013202193,0.002418028,0.96207523,0.014940875,0.000029459588],"about_ca_topic_score_codex":0.0011053502,"about_ca_topic_score_gemma":0.0012270409,"teacher_disagreement_score":0.00862693,"about_ca_system_score_codex":0.0006097935,"about_ca_system_score_gemma":0.0003019261,"threshold_uncertainty_score":0.028859973},"labels":[],"label_agreement":null},{"id":"W2613824215","doi":"","title":"Proof of a conjecture on intersection graph of finite abelian groups.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Abelian group; Conjecture; Intersection (aeronautics); Combinatorics; Graph; Discrete mathematics; Pure mathematics","score_opus":0.008138186142182813,"score_gpt":0.20859995858999603,"score_spread":0.2004617724478132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613824215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22204484,0.0045078048,0.37296855,0.06024303,0.006377475,0.0003148627,0.0029363816,0.0021911284,0.3284159],"genre_scores_gemma":[0.90513027,0.0021425346,0.05560174,0.005639963,0.0024131958,0.0002650808,0.0019614028,0.00038707984,0.026458744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868697,0.0003404554,0.000057837384,0.0002791625,0.00041204575,0.00022346375],"domain_scores_gemma":[0.98965454,0.0067813084,0.0005801998,0.0012245642,0.0010193525,0.00074001576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021016912,0.0011327567,0.0011687067,0.0021216979,0.0018383451,0.002654613,0.0020324509,0.0019389404,0.02334041],"category_scores_gemma":[0.011329692,0.00067319244,0.001664475,0.0018818572,0.00460983,0.0077310633,0.005841755,0.0052387747,0.0022351714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012460312,0.00013529552,0.00080305216,0.00029213107,0.00005506849,0.00034673858,0.00058303116,0.001963505,0.0016794468,0.9586392,0.025731426,0.009646547],"study_design_scores_gemma":[0.00004651944,0.000041146744,0.00070175336,0.00005399495,0.000029388058,0.0003128711,0.00019229161,0.0052936836,0.0007450589,0.9819255,0.010636851,0.00002088085],"about_ca_topic_score_codex":0.001895698,"about_ca_topic_score_gemma":0.0018374028,"teacher_disagreement_score":0.02334041,"about_ca_system_score_codex":0.0017026714,"about_ca_system_score_gemma":0.0009439407,"threshold_uncertainty_score":0.07808143},"labels":[],"label_agreement":null},{"id":"W2613842477","doi":"","title":"A stronger relation between coloring number and the modification of Randic index.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Relation (database); Computer science","score_opus":0.02387442292441819,"score_gpt":0.26434538633733534,"score_spread":0.24047096341291715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613842477","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3232538,0.0054103397,0.36494088,0.008792361,0.0022568647,0.00018894703,0.0015230104,0.0017423241,0.29189143],"genre_scores_gemma":[0.9282019,0.0009609636,0.050495736,0.0017086649,0.001205084,0.0001410816,0.000482352,0.0004015022,0.016402721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965988,0.0009523419,0.0001792901,0.0012260517,0.0006412896,0.0004022713],"domain_scores_gemma":[0.97309387,0.014184507,0.0037540551,0.0054999045,0.0014513877,0.0020163208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028594597,0.00079578673,0.0012888808,0.002850762,0.0020781632,0.0048841885,0.0030326378,0.002206405,0.014139327],"category_scores_gemma":[0.02655322,0.00066044653,0.00075565185,0.0025923366,0.0043331333,0.012062493,0.0034417456,0.004783292,0.0017849836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019559624,0.00010260897,0.0031133965,0.00014569091,0.000033369008,0.00009626661,0.00017315189,0.0037940994,0.0031873228,0.96581495,0.007717051,0.015626553],"study_design_scores_gemma":[0.00005604811,0.000115500516,0.0039295703,0.00007586969,0.00006648227,0.0007393961,0.00014627824,0.036067974,0.003239224,0.9396236,0.015840882,0.000099109515],"about_ca_topic_score_codex":0.001058876,"about_ca_topic_score_gemma":0.001332308,"teacher_disagreement_score":0.014139327,"about_ca_system_score_codex":0.001949804,"about_ca_system_score_gemma":0.0010558738,"threshold_uncertainty_score":0.047300756},"labels":[],"label_agreement":null},{"id":"W2613851664","doi":"","title":"On 3-term arithmetic progressions in product sets over finite rings via spectra of graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Term (time); Product (mathematics); Arithmetic; Discrete mathematics; Pure mathematics; Combinatorics; Geometry","score_opus":0.02603744304832309,"score_gpt":0.3188185857684699,"score_spread":0.29278114272014677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613851664","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41619834,0.00478789,0.29146877,0.0036189375,0.0012376589,0.00016065272,0.0007172067,0.00084568874,0.28096485],"genre_scores_gemma":[0.929303,0.0020133755,0.03629678,0.0007590943,0.0007772873,0.00013573136,0.00035505666,0.00030242593,0.030057298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990664,0.00028945407,0.000052243464,0.0001754038,0.00021593396,0.0002005422],"domain_scores_gemma":[0.99835,0.0007912475,0.00024213546,0.00016332707,0.00018355319,0.00026965883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011163955,0.00090132345,0.00078683207,0.0031039182,0.0026752467,0.00411219,0.0013028341,0.0014411344,0.010967592],"category_scores_gemma":[0.003368943,0.0007097749,0.0013502314,0.0019526269,0.004382553,0.01064817,0.003903978,0.0031963321,0.0020036001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002544013,0.00001989364,0.0001183993,0.000032568474,0.000005189457,0.00010873399,0.0003407132,0.0008114361,0.00041705556,0.99400324,0.00079061586,0.0033266305],"study_design_scores_gemma":[0.0000085111415,0.000013459293,0.00013680253,0.000026253312,0.000007380136,0.000103959996,0.00014111388,0.0022748967,0.00021519823,0.9947901,0.0022695186,0.000012862939],"about_ca_topic_score_codex":0.0012486184,"about_ca_topic_score_gemma":0.0014200285,"teacher_disagreement_score":0.010967592,"about_ca_system_score_codex":0.0015841209,"about_ca_system_score_gemma":0.0006225837,"threshold_uncertainty_score":0.036690235},"labels":[],"label_agreement":null},{"id":"W2613885237","doi":"","title":"Supereulerian graphs and Chvatal-Erdos type conditions.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Type (biology); Combinatorics; Biology","score_opus":0.038189690206849175,"score_gpt":0.32936641154605517,"score_spread":0.291176721339206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613885237","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37184134,0.0016783027,0.05942498,0.005452573,0.00070936204,0.00009477677,0.0012544297,0.0003691229,0.5591751],"genre_scores_gemma":[0.9615267,0.00072087604,0.007742878,0.0006298029,0.0002216941,0.000054814194,0.00042119023,0.00007089885,0.028611282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944526,0.00013963894,0.000026795542,0.00009528271,0.00014949717,0.00014352535],"domain_scores_gemma":[0.998628,0.000547606,0.00020811525,0.00014952756,0.0002283862,0.00023846811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075265317,0.0003631557,0.0004849443,0.0015943289,0.0015623017,0.0021169009,0.00066337356,0.0010048796,0.015659407],"category_scores_gemma":[0.0033826018,0.00025685137,0.0004110897,0.0010617302,0.0020194587,0.004310666,0.0021182469,0.001819504,0.0014200622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026129117,0.000007915562,0.00019392981,0.000014287457,0.0000031274378,0.00006157081,0.000049727932,0.00022354416,0.00023868884,0.99599826,0.001360669,0.0018220617],"study_design_scores_gemma":[0.000020123698,0.000006191631,0.00023427431,0.000010399801,0.000005239362,0.0000980508,0.00010145747,0.001170634,0.0002689003,0.9950917,0.0029864477,0.0000065568083],"about_ca_topic_score_codex":0.0014810778,"about_ca_topic_score_gemma":0.0019231591,"teacher_disagreement_score":0.015659407,"about_ca_system_score_codex":0.0012821448,"about_ca_system_score_gemma":0.00068886176,"threshold_uncertainty_score":0.052385986},"labels":[],"label_agreement":null},{"id":"W2613999143","doi":"","title":"Gaussian Fibonacci And Gaussian Lucas p-Numbers.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Mathematics; Lucas number; Gaussian; Lucas sequence; Pisano period; Fibonacci polynomials; Combinatorics; Orthogonal polynomials; Physics; Quantum mechanics","score_opus":0.011276530425984803,"score_gpt":0.28384345267275,"score_spread":0.2725669222467652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613999143","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19701268,0.011643545,0.19995642,0.0094939135,0.0024941324,0.000094409224,0.00083164906,0.0006307213,0.5778424],"genre_scores_gemma":[0.8813032,0.0032850301,0.031172767,0.0018041331,0.0013997841,0.00011041648,0.00031226897,0.00012980397,0.080482565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994796,0.000115965515,0.000020309375,0.00008331736,0.00018044583,0.0001205493],"domain_scores_gemma":[0.9989152,0.00042275168,0.0001445346,0.000115095085,0.00024843687,0.00015400499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006590183,0.0007435105,0.0005244521,0.002007307,0.0018052566,0.002856101,0.00067232206,0.001263936,0.0103312535],"category_scores_gemma":[0.0037973407,0.00033689692,0.00061991456,0.0012683244,0.0037105072,0.004138535,0.0016900034,0.0021147935,0.0023465704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057931,0.0000025079116,0.000037210822,0.0000072574085,0.0000010632785,0.000026087992,0.00003684815,0.0001170843,0.00009840061,0.9970469,0.0012175643,0.0014033732],"study_design_scores_gemma":[0.000005083263,0.000004750597,0.00010435189,0.0000084197145,0.0000024056997,0.00007810148,0.000040806644,0.001261271,0.000117124975,0.99276793,0.0056032194,0.0000066062457],"about_ca_topic_score_codex":0.0018034893,"about_ca_topic_score_gemma":0.0020225141,"teacher_disagreement_score":0.0103312535,"about_ca_system_score_codex":0.0015094545,"about_ca_system_score_gemma":0.00091652066,"threshold_uncertainty_score":0.034561455},"labels":[],"label_agreement":null},{"id":"W2614067757","doi":"","title":"On (a, b;n)-graceful labeling of path Pn.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Path (computing); Arithmetic; Computer science; Computer network","score_opus":0.015365037558496041,"score_gpt":0.24806922529115652,"score_spread":0.23270418773266047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2614067757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28566927,0.001583894,0.50599325,0.0052306233,0.00055960636,0.00024180343,0.003841455,0.003423754,0.19345625],"genre_scores_gemma":[0.78827786,0.0011681982,0.15016444,0.0016272492,0.00038066908,0.00030719343,0.0035072844,0.0010006814,0.053566385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850607,0.00040356847,0.00007651313,0.0003857407,0.00026743865,0.00036060394],"domain_scores_gemma":[0.996014,0.001938822,0.00040414822,0.0010151872,0.00023176993,0.00039613005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001269636,0.0007709849,0.0008123484,0.0013320956,0.0023137168,0.0029712317,0.0016058711,0.0012884671,0.013385373],"category_scores_gemma":[0.004825241,0.0005258329,0.0009928042,0.0020314183,0.002740474,0.0060609938,0.0035783416,0.0025471589,0.0024990377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017365892,0.00006165871,0.00058855925,0.00013345199,0.000018511308,0.00009193836,0.0003263065,0.009229978,0.0017978852,0.9498554,0.012610051,0.0251125],"study_design_scores_gemma":[0.000021756994,0.00001811358,0.00028004812,0.000028063721,0.000015024221,0.000085778396,0.00011831674,0.013066293,0.0009654168,0.97639126,0.008993118,0.000016662634],"about_ca_topic_score_codex":0.0039376263,"about_ca_topic_score_gemma":0.005056399,"teacher_disagreement_score":0.013385373,"about_ca_system_score_codex":0.0027504875,"about_ca_system_score_gemma":0.0014035753,"threshold_uncertainty_score":0.044778585},"labels":[],"label_agreement":null},{"id":"W2614091911","doi":"","title":"The majorization theorem and signless Dirichlet spectral radius of connected graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Majorization; Spectral radius; Combinatorics; Dirichlet distribution; Eigenvalues and eigenvectors; Physics; Mathematical analysis","score_opus":0.019707779136475794,"score_gpt":0.27927326883956,"score_spread":0.2595654897030842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2614091911","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45096266,0.004150506,0.24675705,0.007671256,0.0009610644,0.00006862548,0.000641365,0.00076038786,0.2880272],"genre_scores_gemma":[0.9705903,0.00091845787,0.011757377,0.0005299707,0.0006497642,0.000076353776,0.00021746293,0.00018299856,0.015077353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915075,0.00028336557,0.000027983133,0.00016811318,0.00023543798,0.00013431314],"domain_scores_gemma":[0.99645376,0.001743337,0.0004085506,0.000405138,0.00042233904,0.00056700106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092290406,0.00063084444,0.0008700561,0.0024820475,0.0012296495,0.0025670521,0.0014062894,0.0013060083,0.0077805878],"category_scores_gemma":[0.008669041,0.00042187222,0.00053865544,0.0011189635,0.0037165761,0.0044012386,0.0023962075,0.0022273085,0.0016162536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023763207,0.000009050274,0.00012981555,0.000027724042,0.000005047888,0.000026254153,0.000069421076,0.0005981632,0.00071843143,0.9931924,0.0019416166,0.003258341],"study_design_scores_gemma":[0.0000096297335,0.0000065256168,0.00023548411,0.000008595826,0.000004096819,0.000087708875,0.000035492685,0.0043763546,0.00037802564,0.99336785,0.0014832597,0.000006967861],"about_ca_topic_score_codex":0.0004795744,"about_ca_topic_score_gemma":0.0004042373,"teacher_disagreement_score":0.0077805878,"about_ca_system_score_codex":0.0009698777,"about_ca_system_score_gemma":0.00038501612,"threshold_uncertainty_score":0.026028633},"labels":[],"label_agreement":null},{"id":"W2614100071","doi":"","title":"Graham's pebbling conjecture on the middle graphs of even cycles.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Conjecture; Mathematics; Combinatorics; Discrete mathematics","score_opus":0.05865490777786407,"score_gpt":0.294526556268843,"score_spread":0.2358716484909789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2614100071","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3272538,0.0051929173,0.09854771,0.020605199,0.0011705774,0.00007459396,0.0010425857,0.0008495223,0.54526305],"genre_scores_gemma":[0.9410462,0.0014395532,0.014333538,0.001957823,0.00044043732,0.00008155018,0.00044098936,0.00016459612,0.040095307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993587,0.00016327908,0.000022021266,0.00015578506,0.00013550404,0.00016471453],"domain_scores_gemma":[0.9972,0.0014992236,0.0002157177,0.0003880897,0.00031497926,0.0003818704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009343895,0.0004619199,0.0007514635,0.0014193375,0.0025264265,0.003425141,0.0012511243,0.002250623,0.013622701],"category_scores_gemma":[0.0072170473,0.0004914578,0.0005658601,0.0015703944,0.0038078881,0.009093485,0.0026492078,0.0026288393,0.0020731222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024572264,0.000009062003,0.00020381197,0.00002264679,0.0000032414189,0.000052611445,0.00012318115,0.00042727464,0.00014153623,0.9908434,0.004581291,0.0035673385],"study_design_scores_gemma":[0.000005008473,0.0000023698049,0.000076554985,0.000010587963,0.0000028179031,0.00003098427,0.00006369151,0.0007471327,0.00009413479,0.99565566,0.0033076233,0.0000034851255],"about_ca_topic_score_codex":0.004165259,"about_ca_topic_score_gemma":0.004242087,"teacher_disagreement_score":0.013622701,"about_ca_system_score_codex":0.0015669223,"about_ca_system_score_gemma":0.0010257253,"threshold_uncertainty_score":0.04557246},"labels":[],"label_agreement":null},{"id":"W26510543","doi":"10.1111/apt.13420","title":"Every abelian group of odd order has a narcissistic terrace","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Institute of Diabetes and Digestive and Kidney Diseases; National Institute of Nursing Research","keywords":"Mathematics; Abelian group; Terrace (agriculture); Order (exchange); Group (periodic table); Pure mathematics; Combinatorics; Geography; Archaeology; Chemistry","score_opus":0.009076126765505716,"score_gpt":0.19793842368096626,"score_spread":0.18886229691546055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W26510543","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7667579,0.00067782163,0.07453041,0.0012564828,0.0002804864,0.000106979634,0.00023362043,0.00030429484,0.15585212],"genre_scores_gemma":[0.9287826,0.00036612208,0.0371942,0.0001997535,0.000074925854,0.00007687844,0.0003038398,0.000041744777,0.032960016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997253,0.000036912057,0.000020613697,0.00007093007,0.00008517967,0.00006105523],"domain_scores_gemma":[0.99926955,0.00022829066,0.00009888263,0.00014400708,0.000121611,0.00013768747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026027154,0.0004376545,0.00040206395,0.00073093065,0.0018369657,0.0013672411,0.00035101973,0.00053742283,0.0070169307],"category_scores_gemma":[0.0006549709,0.00022860168,0.0005191915,0.00050285243,0.002687837,0.0018326036,0.0013258095,0.0011851111,0.0012401338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012248989,0.000031988428,0.0013672289,0.00008847936,0.00002407933,0.0008921329,0.0008484769,0.0006253649,0.016446147,0.96106404,0.0011538481,0.017335739],"study_design_scores_gemma":[0.00005450435,0.00024491537,0.0021305785,0.000034304037,0.000028055792,0.0020056376,0.0012694318,0.0029164467,0.014790106,0.9322246,0.044255853,0.00004557289],"about_ca_topic_score_codex":0.0006502573,"about_ca_topic_score_gemma":0.0011358081,"teacher_disagreement_score":0.0070169307,"about_ca_system_score_codex":0.0003651269,"about_ca_system_score_gemma":0.0003776829,"threshold_uncertainty_score":0.023473978},"labels":[],"label_agreement":null},{"id":"W26699983","doi":"10.1016/j.juro.2015.11.006","title":"Square-celled animal reconstruction problems.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Anatomy and Medical Technology","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Square (algebra); Geometry","score_opus":0.005372740063321642,"score_gpt":0.19101696777745794,"score_spread":0.1856442277141363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W26699983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061171554,0.0018445511,0.8819914,0.0022075132,0.00025803022,0.00007636143,0.0010237568,0.00032482913,0.05110197],"genre_scores_gemma":[0.5906743,0.0018689025,0.32432532,0.0005361217,0.00025019702,0.00018533615,0.0025937692,0.00038344352,0.07918267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997656,0.00006906441,0.000011487684,0.00006193185,0.00005879885,0.00003322889],"domain_scores_gemma":[0.9983909,0.0011419522,0.00008205085,0.0001292869,0.000121699144,0.00013411285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006677385,0.0004739386,0.00062113465,0.0004555803,0.00045168443,0.0011281392,0.0011006733,0.0015587481,0.012168703],"category_scores_gemma":[0.0039420617,0.00034358632,0.0004752061,0.00049639,0.0010436489,0.0017915862,0.001542238,0.0017286687,0.0012691087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015385699,0.00007476491,0.0010434345,0.00041595544,0.00006860173,0.000327483,0.0002102342,0.2247011,0.0024220909,0.6514269,0.030546214,0.088609315],"study_design_scores_gemma":[0.000053566855,0.00005744786,0.00034205633,0.000053689295,0.000016643036,0.00034956372,0.00014472612,0.40804937,0.001483754,0.5693203,0.02011107,0.000017847302],"about_ca_topic_score_codex":0.0017441887,"about_ca_topic_score_gemma":0.002500613,"teacher_disagreement_score":0.012168703,"about_ca_system_score_codex":0.00058259984,"about_ca_system_score_gemma":0.0005805201,"threshold_uncertainty_score":0.040708363},"labels":[],"label_agreement":null},{"id":"W26810115","doi":"","title":"Panpositionable Hamiltonian Graphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.009376700706981624,"score_gpt":0.24881460989277235,"score_spread":0.23943790918579072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W26810115","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19359437,0.002440203,0.2113901,0.0029261387,0.0010646879,0.00016479335,0.0030254025,0.0013050217,0.5840893],"genre_scores_gemma":[0.79539686,0.0013458184,0.03657446,0.00072978047,0.00019547535,0.00008256309,0.0022221797,0.00028532508,0.16316739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997613,0.000045436682,0.000010025753,0.00006584289,0.000057977395,0.000059529666],"domain_scores_gemma":[0.9994286,0.00020274597,0.00007104209,0.00014839001,0.000070229835,0.00007912036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018504728,0.00043057906,0.00027223144,0.00053232163,0.0010232326,0.0011704492,0.0008389601,0.0007470834,0.053433664],"category_scores_gemma":[0.0011539405,0.00027944637,0.00030504545,0.0006833207,0.00083929114,0.0024741879,0.0016541468,0.0013953947,0.005364105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013335735,0.00007898132,0.00074078754,0.00019512192,0.000029169963,0.0008329462,0.000402297,0.0015213721,0.00908578,0.89097834,0.01950978,0.07649205],"study_design_scores_gemma":[0.000038690134,0.0000428028,0.0008398315,0.000053586275,0.000027132051,0.00078365754,0.00031048158,0.004119873,0.0058301506,0.9194952,0.068441555,0.000017173605],"about_ca_topic_score_codex":0.00060496246,"about_ca_topic_score_gemma":0.001716466,"teacher_disagreement_score":0.053433664,"about_ca_system_score_codex":0.00057265325,"about_ca_system_score_gemma":0.00031904448,"threshold_uncertainty_score":0.17875338},"labels":[],"label_agreement":null},{"id":"W26881231","doi":"10.1155/2016/9053578","title":"Cycles of length four through a given arc in almost regular multipartite tournaments.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Multipartite; Mathematics; Arc (geometry); Combinatorics; Geometry; Physics","score_opus":0.014096283718020746,"score_gpt":0.21736989073968446,"score_spread":0.20327360702166372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W26881231","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6477382,0.00066529773,0.23559946,0.0026594782,0.0008369601,0.0015184557,0.0039133816,0.0012806032,0.10578827],"genre_scores_gemma":[0.8280583,0.00039743568,0.11446541,0.0005570297,0.00012114747,0.0011614191,0.0026793557,0.00036058776,0.05219936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982456,0.000597039,0.0001372539,0.0004056618,0.00016933391,0.0004451777],"domain_scores_gemma":[0.99442554,0.002493354,0.0007374492,0.00095175346,0.00047872507,0.00091313623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016904563,0.0007719377,0.0010533831,0.001195208,0.0033804304,0.0024263277,0.0017391011,0.0013344898,0.039700385],"category_scores_gemma":[0.008032173,0.00048403585,0.0014772866,0.0016527033,0.001281792,0.0021690435,0.001777228,0.0013662032,0.003925295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0035122696,0.0018611125,0.02410672,0.0013748829,0.0008919978,0.002144475,0.0022933003,0.11774165,0.019589625,0.48694542,0.064904846,0.2746337],"study_design_scores_gemma":[0.0007065407,0.0017169709,0.009640193,0.00023133704,0.00030350618,0.0017685303,0.001657934,0.2264829,0.0059576356,0.6382742,0.113091774,0.00016839536],"about_ca_topic_score_codex":0.0020443986,"about_ca_topic_score_gemma":0.005095661,"teacher_disagreement_score":0.039700385,"about_ca_system_score_codex":0.0011166992,"about_ca_system_score_gemma":0.0011384576,"threshold_uncertainty_score":0.13281101},"labels":[],"label_agreement":null},{"id":"W26989905","doi":"","title":"On (g, f, n)-critical graphs","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.012069397914073562,"score_gpt":0.286034205727043,"score_spread":0.27396480781296945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W26989905","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7477624,0.0013627161,0.08371233,0.0027741448,0.00036697215,0.00022451475,0.0007404453,0.00038879784,0.16266759],"genre_scores_gemma":[0.945225,0.0009157306,0.0187717,0.0005573469,0.00020991317,0.00014141951,0.00077588926,0.00016624038,0.03323676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942917,0.00015734714,0.000021273692,0.00012170725,0.00010164231,0.00016880546],"domain_scores_gemma":[0.99739754,0.0012897019,0.00037522425,0.00015705006,0.00021615071,0.00056428317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066726643,0.0011924403,0.0009918871,0.0043810657,0.0036086473,0.0031280168,0.001221015,0.0016505623,0.010599548],"category_scores_gemma":[0.0030510023,0.000853196,0.00071850006,0.0020597088,0.0026592175,0.0042419718,0.0029912302,0.0017642792,0.00090744253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017335352,0.000037414426,0.00090797024,0.0001157943,0.00001584287,0.0004613349,0.00048595853,0.0031300709,0.0023423238,0.9799559,0.0047165877,0.007657533],"study_design_scores_gemma":[0.00004203017,0.000021021971,0.00053605,0.000055768083,0.000016451091,0.00029178144,0.0002862457,0.0066095004,0.0009237392,0.98660266,0.004599907,0.000014780144],"about_ca_topic_score_codex":0.0030006974,"about_ca_topic_score_gemma":0.005301812,"teacher_disagreement_score":0.010599548,"about_ca_system_score_codex":0.002498978,"about_ca_system_score_gemma":0.0007059594,"threshold_uncertainty_score":0.03545904},"labels":[],"label_agreement":null},{"id":"W27126087","doi":"","title":"A Decomposition Theorem for Simply Connected Orthogonal Polygons.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Decomposition theorem; Combinatorics; Decomposition; Pure mathematics","score_opus":0.011417905056272713,"score_gpt":0.2628185534848519,"score_spread":0.2514006484285792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W27126087","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03439356,0.0014130042,0.83045894,0.000702912,0.0005071526,0.00007982834,0.00064033223,0.0006764508,0.13112773],"genre_scores_gemma":[0.53443635,0.003193306,0.3772042,0.0010454104,0.00070785935,0.00033578248,0.0027007307,0.0010658279,0.079310544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961877,0.00004770703,0.00002168364,0.0000743049,0.00017581771,0.000061680876],"domain_scores_gemma":[0.99928504,0.0002941036,0.000058030633,0.00012827241,0.00014618468,0.00008843823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044699083,0.0005721901,0.00040890797,0.001520761,0.0008434324,0.0022376592,0.00068468176,0.0006260504,0.011667579],"category_scores_gemma":[0.0023147739,0.00042746394,0.0008021478,0.0010684925,0.0011727365,0.0027411154,0.002588936,0.002115806,0.0030323565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029151599,0.000023151997,0.00022723703,0.00008159722,0.000010745424,0.00008711405,0.00013906255,0.0018983405,0.002205571,0.93524575,0.0121252,0.047927074],"study_design_scores_gemma":[0.000024834359,0.00002788668,0.00036054006,0.00007154843,0.0000252322,0.00053806807,0.00014713373,0.024236927,0.0027885006,0.9247082,0.047055915,0.000015126196],"about_ca_topic_score_codex":0.0008867896,"about_ca_topic_score_gemma":0.0011167837,"teacher_disagreement_score":0.011667579,"about_ca_system_score_codex":0.00058923825,"about_ca_system_score_gemma":0.00036377608,"threshold_uncertainty_score":0.039031923},"labels":[],"label_agreement":null},{"id":"W2750192925","doi":"","title":"Simple Permutations, Alternating Permutations, and the Superpatterns that Contain Them","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Simple (philosophy); Mathematics; Combinatorics; Parity of a permutation; Symmetric group; Cyclic permutation","score_opus":0.009569688153377116,"score_gpt":0.20606062333873582,"score_spread":0.1964909351853587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2750192925","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21238601,0.0016926373,0.64304644,0.0018411117,0.0007996581,0.00018293127,0.0010435208,0.00086172414,0.13814588],"genre_scores_gemma":[0.7696957,0.0016374688,0.18005869,0.0012841895,0.00066872407,0.00038895596,0.00088709395,0.00041272154,0.04496649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850595,0.0004401148,0.00012131428,0.0003585522,0.00037346515,0.00020054959],"domain_scores_gemma":[0.99603564,0.0016192186,0.0006158596,0.0011264065,0.0003550341,0.00024790197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009608114,0.000677079,0.0007179459,0.0019973,0.0014771087,0.0028756533,0.0008113246,0.0014392307,0.010029333],"category_scores_gemma":[0.0048668166,0.0006155672,0.0007038842,0.0023956422,0.0030968012,0.005500993,0.0016307381,0.0016297782,0.0019149164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043255783,0.000025707071,0.00042217932,0.000051834417,0.000012125537,0.00016458308,0.00015216846,0.0008669066,0.0022116753,0.97308177,0.0014769604,0.021490842],"study_design_scores_gemma":[0.0000062925837,0.000012921619,0.00022315435,0.000017084996,0.000009355628,0.00019782505,0.000065653316,0.0027305274,0.0006990157,0.98930806,0.006719141,0.000011046082],"about_ca_topic_score_codex":0.00061522145,"about_ca_topic_score_gemma":0.0010174419,"teacher_disagreement_score":0.010029333,"about_ca_system_score_codex":0.0005083111,"about_ca_system_score_gemma":0.0007779333,"threshold_uncertainty_score":0.033551514},"labels":[],"label_agreement":null},{"id":"W2756505774","doi":"","title":"On Bi-Periodic Fibonacci And Lucas Numbers by Matrix Method.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Lucas number; Mathematics; Lucas sequence; Pisano period; Fibonacci polynomials; Combinatorics; Arithmetic","score_opus":0.008926138536508246,"score_gpt":0.3210268394270249,"score_spread":0.31210070089051667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756505774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07460614,0.007558085,0.71587944,0.0020978241,0.0022677134,0.00015436839,0.00047515312,0.0005418742,0.19641931],"genre_scores_gemma":[0.5487174,0.0052464535,0.3391896,0.0009364739,0.0016709758,0.0004280122,0.0006091663,0.0007067537,0.10249522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996815,0.0001108955,0.000012674614,0.000037180285,0.000118284515,0.000039492163],"domain_scores_gemma":[0.999532,0.00018574337,0.000048783953,0.000056966866,0.0001196987,0.000056790846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005672611,0.00086016394,0.000750736,0.003012876,0.0012101429,0.0018131273,0.001094899,0.0010490437,0.013426424],"category_scores_gemma":[0.0026528994,0.00038727265,0.00076827867,0.0013650125,0.0016899253,0.0028830597,0.001526122,0.0016999478,0.0035051538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001346736,0.000012660745,0.00006704378,0.00005344024,0.0000065612894,0.00005626973,0.00010801054,0.002004575,0.0006750128,0.9842918,0.0034085962,0.009302481],"study_design_scores_gemma":[0.000013365161,0.000015021611,0.000116323194,0.000040278122,0.0000070201186,0.0001320393,0.000060470735,0.032055695,0.00036082565,0.9568013,0.010380423,0.000017170049],"about_ca_topic_score_codex":0.0014393316,"about_ca_topic_score_gemma":0.0032125055,"teacher_disagreement_score":0.013426424,"about_ca_system_score_codex":0.0008654188,"about_ca_system_score_gemma":0.000681561,"threshold_uncertainty_score":0.044915855},"labels":[],"label_agreement":null},{"id":"W2756549319","doi":"","title":"On the incidence energy of graphs under three graph decorations.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.020944007805663526,"score_gpt":0.24314225332933953,"score_spread":0.222198245523676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756549319","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7330327,0.0014305613,0.110832065,0.0044892174,0.00046359623,0.00004409785,0.00077591464,0.0002678809,0.14866403],"genre_scores_gemma":[0.9713458,0.0005290771,0.011558464,0.00037400742,0.00018235012,0.00007118304,0.00041180305,0.00015623016,0.015371091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994516,0.00015922856,0.00002512461,0.00008862995,0.00012943275,0.00014605462],"domain_scores_gemma":[0.9979292,0.0012157717,0.00021955746,0.000279831,0.00013711388,0.00021841699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008230983,0.00038713717,0.0005685439,0.0016201263,0.001474885,0.0024199674,0.0011801987,0.0018064401,0.011429977],"category_scores_gemma":[0.0037912144,0.0003741277,0.0004771636,0.0012873006,0.0022379989,0.003615376,0.001767661,0.0016254089,0.0009933766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005077782,0.00003155565,0.0007229955,0.000040800307,0.000008707025,0.000053434847,0.00011704371,0.0054861153,0.0013073393,0.98174953,0.003111198,0.0073204837],"study_design_scores_gemma":[0.000011106386,0.000010952158,0.0008998542,0.000020825608,0.0000070589886,0.00012349506,0.00018394798,0.023519034,0.00077813823,0.9724221,0.002010338,0.000013200988],"about_ca_topic_score_codex":0.00077790656,"about_ca_topic_score_gemma":0.0010801943,"teacher_disagreement_score":0.011429977,"about_ca_system_score_codex":0.0009967644,"about_ca_system_score_gemma":0.00035677213,"threshold_uncertainty_score":0.038237035},"labels":[],"label_agreement":null},{"id":"W2756635846","doi":"","title":"Paired domination number of generalized Petersen graphs P(n, 2).","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Domination analysis; Discrete mathematics; Graph","score_opus":0.02345321183381491,"score_gpt":0.31202324743164106,"score_spread":0.2885700355978261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756635846","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8823421,0.0004713412,0.018017452,0.0008010217,0.000092847906,0.000041730862,0.0009941724,0.00018793339,0.09705142],"genre_scores_gemma":[0.9908832,0.00013628215,0.0033189761,0.00006346006,0.000035247624,0.000034323122,0.00029972996,0.00002317825,0.005205609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996308,0.000086559834,0.000012816313,0.00008799367,0.00008758862,0.00009420925],"domain_scores_gemma":[0.9984736,0.0008897361,0.00022016089,0.000113050824,0.00009799271,0.00020540341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035321558,0.00031144405,0.00030905852,0.0014206059,0.001302694,0.0020239796,0.0006793377,0.00072679255,0.011176019],"category_scores_gemma":[0.0023147848,0.0002566893,0.00021446403,0.0010264223,0.000935725,0.002167461,0.00090916164,0.0007835175,0.00070686155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006999022,0.00016347057,0.0071616345,0.00033818147,0.0001008247,0.00064657134,0.0007042623,0.018254349,0.011778129,0.8892694,0.016069962,0.054813273],"study_design_scores_gemma":[0.00010653905,0.0001216343,0.0073154196,0.00007711112,0.00009509502,0.001114801,0.0006429624,0.048459396,0.008943039,0.9169601,0.016117347,0.000046414523],"about_ca_topic_score_codex":0.00050811947,"about_ca_topic_score_gemma":0.0009793343,"teacher_disagreement_score":0.011176019,"about_ca_system_score_codex":0.0006682959,"about_ca_system_score_gemma":0.0005195309,"threshold_uncertainty_score":0.03738749},"labels":[],"label_agreement":null},{"id":"W2756820758","doi":"","title":"Dynamical 2-domination in Graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.016735094177169986,"score_gpt":0.3040113863474141,"score_spread":0.2872762921702441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756820758","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43414533,0.0034056539,0.20553033,0.0041584363,0.0008469617,0.00012447315,0.00084085483,0.00063988444,0.35030806],"genre_scores_gemma":[0.9528861,0.0007383608,0.013131969,0.0005981299,0.0002971659,0.0000867318,0.00035646907,0.00013308549,0.03177192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949944,0.00015464905,0.000020404128,0.00009734674,0.00012897601,0.00009920635],"domain_scores_gemma":[0.99873143,0.000587994,0.00015825711,0.0001565971,0.00015999317,0.00020567386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044426005,0.00031702546,0.00032629046,0.001247694,0.0011032568,0.0017128037,0.0006916711,0.0008462052,0.009676881],"category_scores_gemma":[0.0023623158,0.00026970584,0.0005792955,0.00067276886,0.0016094109,0.0028162743,0.0014459458,0.0012059738,0.0010480323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020833286,0.000014945499,0.00034486124,0.000040869105,0.0000093832805,0.0001108846,0.00021753673,0.0011452824,0.001394653,0.9879396,0.002841056,0.005920041],"study_design_scores_gemma":[0.000014561823,0.000008430598,0.0003433118,0.000013336543,0.0000046930954,0.00024570053,0.0000837991,0.007265264,0.00049216516,0.985756,0.0057633463,0.000009379932],"about_ca_topic_score_codex":0.0008781701,"about_ca_topic_score_gemma":0.0015451588,"teacher_disagreement_score":0.009676881,"about_ca_system_score_codex":0.0009620283,"about_ca_system_score_gemma":0.00034818923,"threshold_uncertainty_score":0.032372355},"labels":[],"label_agreement":null},{"id":"W2756842156","doi":"","title":"The Extremal Function for Three Disjoint Theta Graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Disjoint sets; Mathematics; Combinatorics; Function (biology); Discrete mathematics; Evolutionary biology; Biology","score_opus":0.02437847912830196,"score_gpt":0.24443164969916023,"score_spread":0.22005317057085827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756842156","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7514565,0.001035522,0.083440274,0.003903339,0.0002968627,0.00004337849,0.00070205773,0.0003672545,0.15875478],"genre_scores_gemma":[0.97711474,0.0003260554,0.011583317,0.00021001308,0.00009319798,0.00004169582,0.00033553498,0.00011404751,0.010181491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995796,0.00012738214,0.00001591813,0.0000679067,0.000082382496,0.00012678756],"domain_scores_gemma":[0.998543,0.0007714982,0.00018130675,0.0001477742,0.000105112784,0.00025127054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007512297,0.00052574044,0.00053333817,0.0021924295,0.0018796308,0.0028961655,0.0012303946,0.0016380918,0.009593319],"category_scores_gemma":[0.003380747,0.00032329437,0.0005908557,0.0011722981,0.0026045637,0.0033693449,0.001998541,0.002011345,0.0011939228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008231508,0.000022690052,0.0005487394,0.000042542026,0.0000086672035,0.00007340977,0.00013602481,0.0020272287,0.0009190042,0.98440033,0.003260857,0.008478237],"study_design_scores_gemma":[0.000022655482,0.000012355325,0.0007255824,0.000025687259,0.000012237309,0.00020482921,0.00021088263,0.0120015,0.0010100015,0.9817379,0.0040194206,0.00001683964],"about_ca_topic_score_codex":0.0008794344,"about_ca_topic_score_gemma":0.0009692,"teacher_disagreement_score":0.009593319,"about_ca_system_score_codex":0.0014611586,"about_ca_system_score_gemma":0.0005019861,"threshold_uncertainty_score":0.03209281},"labels":[],"label_agreement":null},{"id":"W2756845570","doi":"","title":"Decompositions of λK n into LOE and OLE Graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.005701048686951299,"score_gpt":0.21503629699640786,"score_spread":0.20933524830945657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756845570","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25866914,0.0007482055,0.3992651,0.0016887914,0.00034248547,0.00029651469,0.0020422894,0.001111789,0.33583567],"genre_scores_gemma":[0.74700737,0.00071783614,0.110141404,0.00084393146,0.00012208038,0.00028644837,0.0024065846,0.0005650789,0.13790934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996637,0.00006710412,0.000015218522,0.000077579934,0.000068156565,0.000108201086],"domain_scores_gemma":[0.99914145,0.00022800511,0.000118254444,0.00017060322,0.0001599008,0.00018178101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002770667,0.000388124,0.0002825368,0.0017084081,0.0013063854,0.0017329578,0.000602295,0.00056530803,0.018778205],"category_scores_gemma":[0.0011924634,0.00028225142,0.00051366875,0.00068160193,0.0010318102,0.0020687743,0.0014257188,0.001099928,0.0028203789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012299816,0.00008384826,0.00077705947,0.00009564409,0.000018136674,0.00024743826,0.00045344653,0.0028411432,0.004553081,0.95681244,0.0079796845,0.026015144],"study_design_scores_gemma":[0.000020134534,0.000016604568,0.0010765063,0.000062322186,0.000016122167,0.00026919137,0.0004171712,0.01294464,0.0019477317,0.9592451,0.023968732,0.000015801563],"about_ca_topic_score_codex":0.001712749,"about_ca_topic_score_gemma":0.0036116724,"teacher_disagreement_score":0.018778205,"about_ca_system_score_codex":0.0009743473,"about_ca_system_score_gemma":0.0005255109,"threshold_uncertainty_score":0.06281936},"labels":[],"label_agreement":null},{"id":"W2756969445","doi":"","title":"Upper bound on the primitive exponents of a class of three-colored digraphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Colored; Mathematics; Class (philosophy); Combinatorics; Upper and lower bounds; Mathematical analysis; Computer science; Artificial intelligence","score_opus":0.025171185437890913,"score_gpt":0.24406306707872613,"score_spread":0.21889188164083523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756969445","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62974155,0.0027242035,0.10926869,0.004732739,0.0006657897,0.0001467153,0.0028113062,0.0009188563,0.24899012],"genre_scores_gemma":[0.9637127,0.00077781634,0.020743849,0.00035894336,0.00031715241,0.00007435383,0.00086831127,0.00014999675,0.012996919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934167,0.00011004441,0.00003196001,0.000146616,0.00014632868,0.00022346829],"domain_scores_gemma":[0.9933323,0.0045727217,0.00040922762,0.00052952586,0.00033868407,0.00081756705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081274414,0.00085356727,0.0010480473,0.0015635899,0.0021229158,0.0036523894,0.001332819,0.000980018,0.013645613],"category_scores_gemma":[0.0057703243,0.0004618096,0.00071361987,0.0011353105,0.0021756308,0.003513613,0.002472662,0.0034662555,0.0017133525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022728418,0.00007794973,0.0017879903,0.00019460791,0.000023863708,0.00021714099,0.00024598776,0.003822201,0.0036267263,0.96350235,0.009816383,0.016457396],"study_design_scores_gemma":[0.00007250139,0.000051415987,0.0014650958,0.00007659396,0.000038491355,0.00043387522,0.00014668566,0.018589018,0.0023039128,0.9624278,0.014362384,0.00003218206],"about_ca_topic_score_codex":0.000772012,"about_ca_topic_score_gemma":0.0012510427,"teacher_disagreement_score":0.013645613,"about_ca_system_score_codex":0.0015785829,"about_ca_system_score_gemma":0.00079244206,"threshold_uncertainty_score":0.04564917},"labels":[],"label_agreement":null},{"id":"W2757174746","doi":"","title":"Yang Hui type magic squares with t-powered sum.","year":2017,"lang":"id","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Magic square; Mathematics; MAGIC (telescope); Type (biology); Combinatorics; Astrophysics; Physics; Biology; Ecology","score_opus":0.01977247855486697,"score_gpt":0.25166264595459675,"score_spread":0.23189016739972979,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757174746","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21084417,0.0017159064,0.39772618,0.0038046343,0.0020096067,0.00017732916,0.0013912355,0.0012335005,0.38109747],"genre_scores_gemma":[0.7410023,0.00071661425,0.1458802,0.0015704558,0.00046432042,0.000261317,0.0009154611,0.00056213536,0.10862715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994424,0.0001440258,0.000028417977,0.00012643125,0.0001480322,0.00011064357],"domain_scores_gemma":[0.9992459,0.00028696234,0.00008184387,0.00015179707,0.000106894084,0.00012669482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005586953,0.0005364034,0.0007508097,0.0010656528,0.0016748314,0.002038012,0.0012523142,0.0012784074,0.02200821],"category_scores_gemma":[0.0023837574,0.00047436453,0.0007582303,0.0012655038,0.0016721499,0.003887801,0.0028073767,0.0023026043,0.003436286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005723904,0.000019822903,0.00015357675,0.00006644969,0.000011741087,0.00009085082,0.0000903235,0.0011819928,0.0012461843,0.97827727,0.0070133014,0.0117913205],"study_design_scores_gemma":[0.000019968287,0.000013325541,0.000097074386,0.00001261573,0.000008031429,0.00012522348,0.000059490707,0.0053901165,0.0009624747,0.9872006,0.0060980357,0.000013062406],"about_ca_topic_score_codex":0.0005840701,"about_ca_topic_score_gemma":0.0012382086,"teacher_disagreement_score":0.02200821,"about_ca_system_score_codex":0.0006803793,"about_ca_system_score_gemma":0.0006846821,"threshold_uncertainty_score":0.07362479},"labels":[],"label_agreement":null},{"id":"W2757265658","doi":"","title":"On edge contractible graphs.","year":2017,"lang":"ceb","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Contractible space; Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Computer science; Artificial intelligence","score_opus":0.02807968809315036,"score_gpt":0.3185918459763213,"score_spread":0.2905121578831709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757265658","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23845938,0.0029742804,0.35284582,0.004957552,0.0008413805,0.00018816907,0.0018469443,0.00087508705,0.39701143],"genre_scores_gemma":[0.79692304,0.0034263332,0.08402787,0.0014128706,0.0007098684,0.00021241062,0.0027033072,0.00054972264,0.11003461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989422,0.0002613837,0.00005234618,0.0002110022,0.00033583815,0.00019720984],"domain_scores_gemma":[0.99699175,0.0014673125,0.00032607457,0.0005328499,0.0002996618,0.00038228597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009001315,0.0006619883,0.00064208306,0.0021231247,0.0021614374,0.0022557955,0.0013122613,0.0011447814,0.016248457],"category_scores_gemma":[0.004012475,0.00046796078,0.0008656028,0.0025090266,0.0027567046,0.0071440884,0.0032074312,0.0030892058,0.0022126662],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002736211,0.00002321922,0.00025079367,0.00006381698,0.0000074221443,0.00008573504,0.00018689624,0.0012675036,0.0004810889,0.98281753,0.0038977885,0.01089074],"study_design_scores_gemma":[0.000007090647,0.000008459026,0.00024664873,0.000030891297,0.0000073329957,0.00014392012,0.00010603254,0.0036010772,0.00032246497,0.9849636,0.01055511,0.0000073301007],"about_ca_topic_score_codex":0.0021820373,"about_ca_topic_score_gemma":0.0029503074,"teacher_disagreement_score":0.016248457,"about_ca_system_score_codex":0.0012829632,"about_ca_system_score_gemma":0.0006438264,"threshold_uncertainty_score":0.054356515},"labels":[],"label_agreement":null},{"id":"W2757399776","doi":"","title":"On Lower Orientable Strong Diameter And Strong Radius Of Some Graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; RADIUS; Combinatorics; Computer science; Computer network","score_opus":0.014186388954428798,"score_gpt":0.23955809925915889,"score_spread":0.22537171030473008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757399776","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5947278,0.01042565,0.22327334,0.010520313,0.000595434,0.00012458308,0.0018661185,0.0010568098,0.15740994],"genre_scores_gemma":[0.9381181,0.0027111876,0.04183642,0.0012014197,0.0008781848,0.00021827148,0.0009270494,0.000454205,0.013655037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979513,0.00062380516,0.000098265176,0.0006125879,0.0003229494,0.00039103237],"domain_scores_gemma":[0.9801993,0.014403701,0.0015839002,0.0012847872,0.00072436716,0.0018040772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024641813,0.0012255459,0.0018187948,0.0026223739,0.0023015244,0.0045579374,0.0028934497,0.0021235552,0.009945833],"category_scores_gemma":[0.016688067,0.0009607107,0.001123245,0.0022530206,0.003721836,0.010698985,0.0034317088,0.0041893115,0.0016973392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033558215,0.00012051988,0.002683851,0.00034870656,0.000052261632,0.00014846155,0.0006333297,0.008680026,0.0036798278,0.9541932,0.011656233,0.017467964],"study_design_scores_gemma":[0.000056273482,0.000083442654,0.0027506107,0.000089047644,0.000087369546,0.0003871593,0.00041857606,0.033707872,0.0023346546,0.9498839,0.010149781,0.00005133688],"about_ca_topic_score_codex":0.0013200232,"about_ca_topic_score_gemma":0.0014778423,"teacher_disagreement_score":0.009945833,"about_ca_system_score_codex":0.002674298,"about_ca_system_score_gemma":0.000708069,"threshold_uncertainty_score":0.033272147},"labels":[],"label_agreement":null},{"id":"W2757539395","doi":"","title":"List vertex arboricity of graphs without forbidden minors.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arboricity; Mathematics; Vertex (graph theory); Combinatorics; Dense graph; Graph; 1-planar graph; Chordal graph; Planar graph","score_opus":0.023466917598065268,"score_gpt":0.3038951707554761,"score_spread":0.2804282531574108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757539395","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.782601,0.00049906224,0.122786544,0.0010486298,0.00012807538,0.00013283371,0.0038315495,0.0013175292,0.08765475],"genre_scores_gemma":[0.9545044,0.00027637673,0.021793874,0.00021245377,0.000094253584,0.00009036616,0.0036571485,0.00019735073,0.01917385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965453,0.00008116753,0.00003187521,0.000080990925,0.000075057884,0.00007643651],"domain_scores_gemma":[0.9967277,0.0017878965,0.00058682525,0.00032378314,0.0003247833,0.00024897535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024908193,0.0003244569,0.00034403044,0.0011198471,0.0010585417,0.001951279,0.0007317589,0.00061952235,0.009650053],"category_scores_gemma":[0.0028033801,0.0003572961,0.00042495833,0.0011837392,0.00065854174,0.0019722793,0.00081209926,0.00085070916,0.0016089964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009669839,0.00024291653,0.009415008,0.00055134454,0.00009860292,0.0018650893,0.0014225969,0.008236619,0.03545057,0.85993415,0.018486986,0.06332898],"study_design_scores_gemma":[0.00010656898,0.0001878053,0.00451095,0.00009252518,0.00011846256,0.0021431036,0.0007136389,0.029341318,0.015251079,0.92260337,0.02488828,0.00004282495],"about_ca_topic_score_codex":0.00086522347,"about_ca_topic_score_gemma":0.001433963,"teacher_disagreement_score":0.009650053,"about_ca_system_score_codex":0.0005226648,"about_ca_system_score_gemma":0.00040025797,"threshold_uncertainty_score":0.03228265},"labels":[],"label_agreement":null},{"id":"W2757565","doi":"10.1007/bf00456661","title":"New results on the eccentric digraphs of the digraphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Digraph; Combinatorics; Vertex (graph theory); Mathematics; Eccentric; Eccentricity (behavior); Discrete mathematics; Graph; Physics","score_opus":0.033007409058571746,"score_gpt":0.25848545363596986,"score_spread":0.22547804457739812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757565","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15273511,0.0067952783,0.65003103,0.0031866238,0.0012629571,0.0002120496,0.003404079,0.00094559597,0.18142734],"genre_scores_gemma":[0.76328826,0.007278368,0.1595116,0.0015078922,0.002048244,0.0002927354,0.0042763227,0.00060318876,0.06119352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991879,0.0001653377,0.000066396045,0.00028701578,0.00020847711,0.00008490726],"domain_scores_gemma":[0.99664813,0.0014797456,0.0004946639,0.00052369386,0.00046154574,0.00039219978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060759106,0.0007094307,0.0006899616,0.004023273,0.0015433619,0.002803328,0.00094402255,0.0007788133,0.011499029],"category_scores_gemma":[0.005110201,0.00050886365,0.00078170275,0.0034138511,0.0018538437,0.0038546969,0.0018543943,0.0018562089,0.0020552042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007029731,0.000045868925,0.0014599708,0.00037262536,0.00004343532,0.00050044,0.00050583325,0.0029947432,0.003050335,0.9277849,0.008763669,0.05440783],"study_design_scores_gemma":[0.000023624467,0.00004680389,0.0024370612,0.0000645366,0.00005123883,0.0013969896,0.00018111667,0.013970423,0.0012293215,0.92231673,0.058243204,0.00003891192],"about_ca_topic_score_codex":0.001047974,"about_ca_topic_score_gemma":0.0016495733,"teacher_disagreement_score":0.011499029,"about_ca_system_score_codex":0.0010304227,"about_ca_system_score_gemma":0.0003454221,"threshold_uncertainty_score":0.038468063},"labels":[],"label_agreement":null},{"id":"W2757613779","doi":"","title":"Z-Cyclic Generalized Ordered Whist Tournaments.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Corporate Insolvency and Governance","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.024109923801169844,"score_gpt":0.24146453187171713,"score_spread":0.2173546080705473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757613779","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4690037,0.00076241203,0.14409135,0.00206493,0.0007379082,0.00028526335,0.0031447518,0.0008782671,0.37903142],"genre_scores_gemma":[0.9132692,0.00032798672,0.018655613,0.0006504839,0.00016555503,0.00013973741,0.0016003009,0.00014710815,0.06504391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992488,0.00017954786,0.00004035497,0.00013834507,0.00016277825,0.00023002177],"domain_scores_gemma":[0.9983967,0.00053631415,0.00020920155,0.00026258852,0.00023715816,0.00035791067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062945345,0.0005371133,0.00071647036,0.0010230151,0.0014537085,0.0028524501,0.0009711222,0.0007821244,0.0235437],"category_scores_gemma":[0.0024390079,0.00023427763,0.00073588133,0.0013338177,0.001255026,0.0018224431,0.0015516327,0.0012960668,0.0018922276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016186062,0.000054816483,0.0006647147,0.00008994032,0.000044020497,0.00021767229,0.00012946156,0.003253708,0.0015958427,0.9617292,0.011093635,0.020965036],"study_design_scores_gemma":[0.00010751416,0.00007996452,0.0011776132,0.00003635255,0.000037600304,0.00026628948,0.00017820399,0.015622467,0.00091951224,0.95363635,0.02790825,0.000029951854],"about_ca_topic_score_codex":0.002238785,"about_ca_topic_score_gemma":0.0044386256,"teacher_disagreement_score":0.0235437,"about_ca_system_score_codex":0.0011198502,"about_ca_system_score_gemma":0.00083913526,"threshold_uncertainty_score":0.07876146},"labels":[],"label_agreement":null},{"id":"W2757630574","doi":"","title":"Note on the distance spectral gap of graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral gap; Mathematical analysis","score_opus":0.0379458027025027,"score_gpt":0.30739166708374466,"score_spread":0.26944586438124196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757630574","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08663192,0.042665888,0.19792873,0.08419465,0.018885693,0.00008435278,0.001445511,0.0009745919,0.5671887],"genre_scores_gemma":[0.84053046,0.019595824,0.064306684,0.017607655,0.01639924,0.00022340834,0.0008017402,0.000655025,0.03987995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851185,0.0004091095,0.00005586845,0.00035942803,0.00050347927,0.0001602212],"domain_scores_gemma":[0.98913354,0.007914527,0.00042651515,0.0009992922,0.0006773218,0.0008488733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020558878,0.0011686406,0.0014060657,0.0034380858,0.0019405753,0.0027543604,0.0026071155,0.002251857,0.01763739],"category_scores_gemma":[0.013685814,0.0003566745,0.0008692953,0.0031558916,0.0059697214,0.00992437,0.0056576896,0.0066210795,0.0022169636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048736085,0.000026783933,0.00022710329,0.00012642829,0.000011639886,0.0001097671,0.00014976122,0.00070243736,0.0005916628,0.97675836,0.012848713,0.008398557],"study_design_scores_gemma":[0.0000076149045,0.000019024186,0.00024784298,0.000029099023,0.000008288816,0.00014404368,0.000075888165,0.0014796571,0.00021875821,0.985843,0.011916079,0.000010682781],"about_ca_topic_score_codex":0.0011494122,"about_ca_topic_score_gemma":0.0008353692,"teacher_disagreement_score":0.01763739,"about_ca_system_score_codex":0.0014237034,"about_ca_system_score_gemma":0.0006230682,"threshold_uncertainty_score":0.059002995},"labels":[],"label_agreement":null},{"id":"W2757656343","doi":"","title":"On the half of a Riordan array.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.045143181261608406,"score_gpt":0.3180248581384679,"score_spread":0.2728816768768595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757656343","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12224381,0.0025001625,0.0682463,0.0040908456,0.0027113953,0.00005615875,0.0006429132,0.00063385844,0.79887456],"genre_scores_gemma":[0.7915639,0.0011345772,0.02998146,0.002671803,0.00065890054,0.000082638304,0.00056659355,0.0003805228,0.1729596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996779,0.0000773018,0.000010147528,0.00006919416,0.00008420957,0.00008121232],"domain_scores_gemma":[0.9997216,0.00007425502,0.000031082836,0.000056926565,0.00005980601,0.000056330355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019368369,0.00038595413,0.0004355444,0.00067987986,0.0018140847,0.0018915208,0.00070214696,0.0009646938,0.03168812],"category_scores_gemma":[0.0013953687,0.00028117493,0.0003676744,0.00053867034,0.0016284488,0.0027077985,0.0018080935,0.0015857652,0.005734794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017338687,0.000018308247,0.00022177216,0.00006179676,0.0000151283275,0.00032061865,0.00026294313,0.0015769841,0.0030215008,0.95995367,0.014053509,0.020320287],"study_design_scores_gemma":[0.000035400706,0.00005246035,0.00039786738,0.00006458816,0.000017786848,0.00064415985,0.00063831976,0.006904858,0.0026567162,0.90939325,0.07916251,0.000032052743],"about_ca_topic_score_codex":0.0008605497,"about_ca_topic_score_gemma":0.001498346,"teacher_disagreement_score":0.03168812,"about_ca_system_score_codex":0.000424501,"about_ca_system_score_gemma":0.00034657298,"threshold_uncertainty_score":0.10600734},"labels":[],"label_agreement":null},{"id":"W2757702714","doi":"","title":"Distance spectral radius of quasi-trees.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; RADIUS; Spectral radius; Physics; Computer science","score_opus":0.027186262916313597,"score_gpt":0.30104481777193776,"score_spread":0.27385855485562416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757702714","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.629469,0.0052289516,0.2185155,0.004038822,0.0005467025,0.000053555825,0.0012660136,0.00047340099,0.1404081],"genre_scores_gemma":[0.96403205,0.0012853097,0.021458212,0.00039287345,0.00035640266,0.00006836348,0.00053102645,0.00014019037,0.011735562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913245,0.00026655773,0.000042218297,0.00017929461,0.00025167002,0.00012793936],"domain_scores_gemma":[0.9944496,0.0030489555,0.0006567154,0.00040239363,0.0006212426,0.0008211214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092307816,0.00040568266,0.00073154486,0.002602137,0.0012383538,0.002515302,0.001218834,0.0009963271,0.0073207435],"category_scores_gemma":[0.008105254,0.00029863333,0.00034259429,0.0015130047,0.0017987576,0.0041930294,0.0020412225,0.001392195,0.0016673323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007639181,0.000021772306,0.00083292066,0.00008276672,0.000013166312,0.0000485744,0.00021440904,0.0018691049,0.0016878397,0.98297775,0.0034903546,0.008684924],"study_design_scores_gemma":[0.000016246526,0.00002880841,0.0013644088,0.000030461484,0.000015584623,0.00030665533,0.00026306123,0.018592203,0.0010555934,0.97117114,0.007142118,0.000013706491],"about_ca_topic_score_codex":0.00077901926,"about_ca_topic_score_gemma":0.0007041788,"teacher_disagreement_score":0.0073207435,"about_ca_system_score_codex":0.0012311765,"about_ca_system_score_gemma":0.00035411364,"threshold_uncertainty_score":0.024490297},"labels":[],"label_agreement":null},{"id":"W2757767771","doi":"","title":"Genus embeddings of two types of graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Genus; Combinatorics; Zoology; Biology","score_opus":0.01544491280564171,"score_gpt":0.2648138469072235,"score_spread":0.24936893410158179,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757767771","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.596602,0.0016285756,0.14955372,0.0061717397,0.0006721626,0.00010764499,0.0019147109,0.0010128956,0.2423365],"genre_scores_gemma":[0.9280729,0.00077758654,0.03969053,0.00067964295,0.0002132621,0.00010039157,0.0014636302,0.00029279248,0.02870925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989735,0.00025934854,0.00006646136,0.00023689066,0.00022200974,0.00024183352],"domain_scores_gemma":[0.9963044,0.0017887444,0.00048028617,0.0006593479,0.00023417761,0.00053296215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061373186,0.0006457745,0.00058566243,0.0022353022,0.0020812906,0.0046829516,0.0015223621,0.002169598,0.013138997],"category_scores_gemma":[0.005139911,0.000689082,0.00093436457,0.0021212122,0.0026604205,0.0071205255,0.0033632866,0.0025987383,0.001315602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008454402,0.000036825237,0.0011097022,0.00006593086,0.000008813295,0.00013386692,0.00042673762,0.0011574896,0.00093428465,0.980412,0.0049496605,0.01068022],"study_design_scores_gemma":[0.000026871474,0.000021545431,0.0013124787,0.000068807116,0.000027122785,0.00047570132,0.00072271953,0.007759656,0.0013447428,0.9740335,0.014181795,0.00002506544],"about_ca_topic_score_codex":0.0010856878,"about_ca_topic_score_gemma":0.0015056524,"teacher_disagreement_score":0.013138997,"about_ca_system_score_codex":0.0016395343,"about_ca_system_score_gemma":0.0004197297,"threshold_uncertainty_score":0.043954372},"labels":[],"label_agreement":null},{"id":"W2757834785","doi":"","title":"The characterization of graph by positive inertia index.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Inertia; Characterization (materials science); Index (typography); Graph; Statistics; Combinatorics; Computer science; Materials science; Nanotechnology; Physics","score_opus":0.005404067485400714,"score_gpt":0.23892051744157888,"score_spread":0.23351644995617818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757834785","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27110028,0.0034196214,0.57080704,0.0037610545,0.0008385131,0.00013521961,0.0014692425,0.00065729115,0.14781173],"genre_scores_gemma":[0.9429547,0.0017649764,0.0329817,0.0005728053,0.0012229959,0.00014758162,0.0008340171,0.00023701125,0.019284232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999172,0.00021656601,0.000047972066,0.00025009675,0.00020646692,0.0001069603],"domain_scores_gemma":[0.99413955,0.002603297,0.0012192369,0.0007037665,0.0005730534,0.0007611472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009542597,0.0006236765,0.0007390917,0.0040057246,0.0009117824,0.002963574,0.00099106,0.00092969264,0.008513718],"category_scores_gemma":[0.008937798,0.00035345764,0.000552663,0.0017865085,0.003254972,0.0067349086,0.0017609583,0.0018114848,0.0014552244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023320603,0.000016687985,0.00070220674,0.00006682979,0.000009811484,0.0000783744,0.00013424817,0.001436599,0.0013562568,0.9843038,0.0030990615,0.008772823],"study_design_scores_gemma":[0.000008462437,0.00001722893,0.0011741488,0.000033436914,0.000016412921,0.00026393644,0.00008457972,0.023190081,0.00054802035,0.9673081,0.0073337043,0.000021860458],"about_ca_topic_score_codex":0.0007285581,"about_ca_topic_score_gemma":0.00071038055,"teacher_disagreement_score":0.008513718,"about_ca_system_score_codex":0.00089590455,"about_ca_system_score_gemma":0.00040850978,"threshold_uncertainty_score":0.028481245},"labels":[],"label_agreement":null},{"id":"W2757888206","doi":"","title":"An Incomparable Upper Bound For The Largest Laplacian Graph Eigenvalue.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Upper and lower bounds; Laplace operator; Laplacian matrix; Combinatorics; Graph; Algebraic connectivity; Mathematical analysis; Physics","score_opus":0.04642426429592865,"score_gpt":0.34140376138068157,"score_spread":0.2949794970847529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757888206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07110881,0.013581713,0.5438109,0.026395844,0.005335739,0.0002110708,0.0036518262,0.002833441,0.33307067],"genre_scores_gemma":[0.72876984,0.008707051,0.18102145,0.007403969,0.0070577716,0.0010695047,0.0034880708,0.0024719941,0.06001034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951504,0.0010133692,0.00016072484,0.0011384966,0.0015892828,0.0009477184],"domain_scores_gemma":[0.9612833,0.030992659,0.000915123,0.0033348855,0.0016251972,0.0018487817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003995588,0.0030532528,0.0023784789,0.003257047,0.0033690212,0.0061384146,0.006176249,0.004092001,0.032919355],"category_scores_gemma":[0.042335868,0.001157321,0.0016193984,0.00324183,0.004312642,0.011783583,0.0070270873,0.012352983,0.00879603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054902193,0.0003246274,0.0010694591,0.00073160144,0.000100529025,0.00043083593,0.00042403123,0.013119862,0.00879535,0.86857384,0.063121386,0.042759463],"study_design_scores_gemma":[0.000039131246,0.000049056496,0.0005607391,0.00011420583,0.000057995825,0.0003176197,0.00010520955,0.049633507,0.0022010067,0.93318665,0.013686181,0.000048722388],"about_ca_topic_score_codex":0.0012327841,"about_ca_topic_score_gemma":0.002327129,"teacher_disagreement_score":0.032919355,"about_ca_system_score_codex":0.0027617721,"about_ca_system_score_gemma":0.0017827606,"threshold_uncertainty_score":0.1101262},"labels":[],"label_agreement":null},{"id":"W2757968219","doi":"","title":"A class of degree-magic join graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Join (topology); Degree (music); MAGIC (telescope); Class (philosophy); Combinatorics; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.02861543545232307,"score_gpt":0.25266846482022015,"score_spread":0.2240530293678971,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757968219","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41374967,0.0016474153,0.27054346,0.004225292,0.00049900066,0.0002977584,0.0053088767,0.002094924,0.30163357],"genre_scores_gemma":[0.8859088,0.0007859962,0.067218944,0.0009170195,0.00037035442,0.00017356401,0.0046831616,0.00028230742,0.039659884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999345,0.000083227445,0.000030308498,0.00023423016,0.00017606182,0.00013115912],"domain_scores_gemma":[0.9978319,0.0008371284,0.00035069554,0.0004287577,0.00020277701,0.00034876209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050238246,0.00041507636,0.00054926606,0.0014892536,0.0020477546,0.0033525722,0.0012719944,0.0009689064,0.013769154],"category_scores_gemma":[0.0026475417,0.0003772414,0.0006319851,0.0017433829,0.0013056352,0.003623164,0.0016899093,0.0019073688,0.001462759],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010497142,0.00006237635,0.0010668642,0.00008340368,0.000016984673,0.00013511957,0.0001656205,0.0016760977,0.002092219,0.96261275,0.010606724,0.021376891],"study_design_scores_gemma":[0.00004587515,0.000028701255,0.0011214252,0.000032042386,0.000023948296,0.00049453933,0.00023194548,0.010763767,0.0017391342,0.94972444,0.035774287,0.000019944053],"about_ca_topic_score_codex":0.0011257469,"about_ca_topic_score_gemma":0.0015617158,"teacher_disagreement_score":0.013769154,"about_ca_system_score_codex":0.0009908684,"about_ca_system_score_gemma":0.0007567786,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2757993765","doi":"","title":"The truncated determinants of combinatorial rectangular arrays.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.009150823117338606,"score_gpt":0.2228268114721719,"score_spread":0.21367598835483329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757993765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28169513,0.0026826903,0.39218852,0.0021418482,0.001340707,0.00008882693,0.00060037285,0.00062737527,0.31863454],"genre_scores_gemma":[0.9296887,0.00096394605,0.02643278,0.0005831193,0.0004201535,0.000070571805,0.0002733174,0.0002041319,0.04136326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940574,0.00018951914,0.000021746479,0.00008906716,0.00018522817,0.000108625034],"domain_scores_gemma":[0.99852556,0.00062051817,0.00018042822,0.00023983618,0.00025467324,0.00017894593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004170644,0.000534778,0.0005083518,0.0015540835,0.0005606445,0.0017523133,0.0007296945,0.0008502594,0.013789359],"category_scores_gemma":[0.0043096226,0.0003506904,0.00033749564,0.00091748656,0.0016872574,0.0022685532,0.001109355,0.0013304726,0.0024767395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023712922,0.000015974885,0.00018430247,0.000029598134,0.0000043292894,0.00007040489,0.00006038998,0.0030191045,0.0014116946,0.98409283,0.0028619017,0.008225771],"study_design_scores_gemma":[0.000012818437,0.000028157336,0.0003473336,0.000031852323,0.0000065884437,0.0003064478,0.000092390146,0.03801325,0.0013064306,0.95170796,0.008124048,0.000022675495],"about_ca_topic_score_codex":0.0006202979,"about_ca_topic_score_gemma":0.0009156971,"teacher_disagreement_score":0.013789359,"about_ca_system_score_codex":0.00065947225,"about_ca_system_score_gemma":0.00053855946,"threshold_uncertainty_score":0.04613},"labels":[],"label_agreement":null},{"id":"W2758018033","doi":"","title":"A note on non-existence of cubic semisymmetric graphs of order 8p or 8p 2 .","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Order (exchange); Business","score_opus":0.06759250978687292,"score_gpt":0.36689487124474496,"score_spread":0.29930236145787203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2758018033","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4437294,0.008133094,0.06422951,0.024771512,0.006165802,0.00008985976,0.00080661813,0.0007257476,0.4513485],"genre_scores_gemma":[0.94025254,0.003259677,0.027143653,0.0024074374,0.0014140317,0.000042659598,0.0005735347,0.00013586509,0.024770567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995758,0.000088599896,0.000020354142,0.000102551014,0.00012885506,0.00008382816],"domain_scores_gemma":[0.99734676,0.0015539436,0.00020362389,0.00042390238,0.00021221545,0.00025943812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053863437,0.00032691227,0.0003889259,0.0008308827,0.002008941,0.00171362,0.0010348364,0.0013490514,0.008264228],"category_scores_gemma":[0.0038146153,0.00025282276,0.0004945528,0.0007700367,0.0023098532,0.0027588566,0.0018564697,0.0024250792,0.00069952814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019178465,0.000050605566,0.0027223246,0.000394122,0.000025501222,0.0035751741,0.00077218714,0.0013195323,0.008669513,0.93825096,0.024885256,0.019143028],"study_design_scores_gemma":[0.00002760617,0.00005612678,0.0022494593,0.000072822106,0.000027343367,0.00395406,0.00060625013,0.0037378871,0.003722473,0.9346676,0.05082585,0.000052462703],"about_ca_topic_score_codex":0.00086336385,"about_ca_topic_score_gemma":0.0019441461,"teacher_disagreement_score":0.008264228,"about_ca_system_score_codex":0.0005969384,"about_ca_system_score_gemma":0.0006056888,"threshold_uncertainty_score":0.027646542},"labels":[],"label_agreement":null},{"id":"W2758081241","doi":"","title":"On the planarity of the regular digraph of ideals of commutative rings","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Digraph; Planarity testing; Mathematics; Commutative property; Commutative ring; Combinatorics; Pure mathematics","score_opus":0.03463960831577524,"score_gpt":0.28561661244052355,"score_spread":0.2509770041247483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2758081241","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7857688,0.0021949962,0.10029535,0.0030190686,0.00018513341,0.00008091082,0.000765395,0.00035036172,0.10733999],"genre_scores_gemma":[0.9775367,0.001163919,0.009376075,0.00021574876,0.00022307424,0.00003562893,0.00034464672,0.00006771101,0.011036559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992236,0.00021875306,0.00005091497,0.00020595898,0.00012515188,0.00017568721],"domain_scores_gemma":[0.99523586,0.0026811683,0.0007494125,0.00033685958,0.00036438732,0.0006322819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011103865,0.0004968998,0.001209565,0.0026893534,0.0030073726,0.0056700483,0.0014389635,0.0009882795,0.0064688292],"category_scores_gemma":[0.0051702615,0.00086791156,0.0009370472,0.0023662872,0.0048731626,0.008718634,0.0028146224,0.0021608511,0.00065142807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006147023,0.000020305442,0.00046939755,0.000048729133,0.0000102952745,0.00006159088,0.0003209612,0.0011841926,0.00034354848,0.9933164,0.00055711385,0.003605991],"study_design_scores_gemma":[0.000023096329,0.000022129021,0.00041623795,0.000017470875,0.000025291109,0.00009950034,0.00030148108,0.0028258155,0.00043110302,0.9931331,0.0026845946,0.00002023368],"about_ca_topic_score_codex":0.002001318,"about_ca_topic_score_gemma":0.0019047916,"teacher_disagreement_score":0.0064688292,"about_ca_system_score_codex":0.0017133876,"about_ca_system_score_gemma":0.0008488844,"threshold_uncertainty_score":0.02164042},"labels":[],"label_agreement":null},{"id":"W2758173474","doi":"","title":"The chromatic number of the square of a Halin graph with maximum degree five is six.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Square (algebra); Graph; Degree (music); Discrete mathematics; Geometry","score_opus":0.015988689265407304,"score_gpt":0.24314686155322127,"score_spread":0.22715817228781396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2758173474","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8927196,0.00046986385,0.015134271,0.0033466031,0.0002268665,0.000029514998,0.0010914044,0.00025104693,0.086730726],"genre_scores_gemma":[0.981023,0.00019689031,0.0071964287,0.00018517948,0.00004161287,0.00001570785,0.00059827487,0.000045702098,0.010697185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997484,0.000042266813,0.000009909691,0.00006615455,0.000045980894,0.00008728045],"domain_scores_gemma":[0.99877614,0.0005991168,0.00017703566,0.0001015697,0.0000862654,0.00025980698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023172399,0.00031894716,0.0002572646,0.0006641016,0.0015591749,0.0017939371,0.00061502215,0.0008413338,0.012030282],"category_scores_gemma":[0.0009817975,0.00024171558,0.00034212557,0.00060996297,0.0016619327,0.0014306144,0.000765165,0.0009340152,0.0011261163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018568297,0.00020744075,0.0125518255,0.00067466334,0.00008854266,0.0008203635,0.0011284981,0.019026058,0.05115037,0.82432765,0.029783882,0.058383882],"study_design_scores_gemma":[0.00017530177,0.00022998173,0.018439772,0.000110903275,0.00009164746,0.0013465441,0.0017249865,0.038758915,0.040966425,0.8401204,0.057901736,0.00013349146],"about_ca_topic_score_codex":0.0030864635,"about_ca_topic_score_gemma":0.005673851,"teacher_disagreement_score":0.012030282,"about_ca_system_score_codex":0.0010831181,"about_ca_system_score_gemma":0.00061531056,"threshold_uncertainty_score":0.040245295},"labels":[],"label_agreement":null},{"id":"W2758256579","doi":"","title":"Some results and remarks on harmonic mean and mean cordial labelings.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Harmonic mean; Combinatorics; Harmonic; Statistics; Acoustics; Physics","score_opus":0.01741133330315237,"score_gpt":0.24534224075566044,"score_spread":0.22793090745250807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2758256579","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09837237,0.012626013,0.39520746,0.02601489,0.0030304699,0.00015097161,0.0025169172,0.0012861864,0.46079466],"genre_scores_gemma":[0.7046244,0.013486697,0.15221804,0.011382199,0.006003531,0.0005592343,0.0033108438,0.0011772501,0.1072378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859935,0.00044147452,0.00007521593,0.00030644418,0.000374522,0.00020299974],"domain_scores_gemma":[0.9936953,0.0040365253,0.00039633378,0.00075921713,0.000598109,0.0005145092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002130794,0.0008352872,0.0010201602,0.0026538318,0.0026311257,0.0042699454,0.002364416,0.0024646043,0.024375891],"category_scores_gemma":[0.011195764,0.0006173086,0.0011728331,0.0044515356,0.003843232,0.009342116,0.003432056,0.0053642094,0.00314844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025296484,0.000025007566,0.00023393695,0.00010466599,0.0000071784116,0.000044213375,0.00013556583,0.00071726704,0.00032648953,0.9804081,0.009384024,0.008588236],"study_design_scores_gemma":[0.0000066701955,0.000011888302,0.0002861056,0.000025391211,0.000008918425,0.00009250415,0.0000965396,0.002325082,0.00024014743,0.98559433,0.011299909,0.00001263317],"about_ca_topic_score_codex":0.002400751,"about_ca_topic_score_gemma":0.0030124537,"teacher_disagreement_score":0.024375891,"about_ca_system_score_codex":0.002762639,"about_ca_system_score_gemma":0.0009110299,"threshold_uncertainty_score":0.08154547},"labels":[],"label_agreement":null},{"id":"W2758261578","doi":"","title":"List vertex arboricity of planar graphs with 5-cycles not adjacent to 3-cycles and 4-cycles.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arboricity; Mathematics; Vertex (graph theory); Combinatorics; Planar graph; Planar; Dense graph; 1-planar graph; Graph; Chordal graph; Computer science","score_opus":0.02108818712877475,"score_gpt":0.28472312712576175,"score_spread":0.263634939996987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2758261578","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86203974,0.0005640278,0.023554701,0.00055455463,0.00010936117,0.000116167925,0.00951271,0.00095434015,0.10259438],"genre_scores_gemma":[0.96494037,0.00033326665,0.012806224,0.000119430886,0.000050131333,0.000083569,0.009484793,0.0001141214,0.012067955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998416,0.000024730823,0.000016620377,0.00003194058,0.000038466307,0.00004666744],"domain_scores_gemma":[0.9986927,0.0005917503,0.0002852688,0.00009079854,0.0002192392,0.00012020113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010182394,0.0002710918,0.00025220573,0.0015752113,0.00092746806,0.0011547359,0.00049482886,0.00044844556,0.016717006],"category_scores_gemma":[0.001276733,0.00020658769,0.0002652108,0.0016099334,0.0003493242,0.0009954547,0.0005230393,0.00044682875,0.0019081716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029576046,0.00039812818,0.054693215,0.0020323163,0.00027623083,0.0051784585,0.0020339394,0.029153902,0.11521511,0.5011657,0.06747266,0.21942268],"study_design_scores_gemma":[0.0003025068,0.0008438656,0.046649933,0.0003996235,0.00041481832,0.0057184277,0.0034250594,0.0877111,0.08266931,0.6334591,0.13827077,0.00013551489],"about_ca_topic_score_codex":0.0013782136,"about_ca_topic_score_gemma":0.002309607,"teacher_disagreement_score":0.016717006,"about_ca_system_score_codex":0.000435868,"about_ca_system_score_gemma":0.00032091507,"threshold_uncertainty_score":0.055924},"labels":[],"label_agreement":null},{"id":"W2758506936","doi":"","title":"Limited packing vs tuple domination in graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Tuple; Combinatorics; Discrete mathematics","score_opus":0.023760716884239745,"score_gpt":0.3022128325809602,"score_spread":0.27845211569672046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2758506936","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43476176,0.0072109983,0.38674533,0.0058504418,0.0006696954,0.00015093754,0.0012323958,0.0010869456,0.16229145],"genre_scores_gemma":[0.9281173,0.002755329,0.04564319,0.0010817534,0.0005230818,0.00011702283,0.00071540393,0.0004041248,0.020642849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979492,0.0007294661,0.00010015338,0.00039071208,0.0004383436,0.0003921545],"domain_scores_gemma":[0.98670954,0.008177456,0.0010630796,0.0026051388,0.00052456517,0.00092014804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017791011,0.00051855476,0.0010728422,0.0012421133,0.0018309592,0.0036234153,0.0021061832,0.0016076074,0.013699545],"category_scores_gemma":[0.011376942,0.00061686867,0.00084441184,0.0025543813,0.0032065532,0.011522836,0.0032923878,0.0025556048,0.001599676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032659332,0.00012878932,0.0017981488,0.00028666182,0.00004470532,0.0002595448,0.00056463666,0.013389164,0.0026463196,0.9171093,0.008175348,0.055270784],"study_design_scores_gemma":[0.00003341719,0.000079993675,0.0007132159,0.00010871329,0.00005719922,0.0006256626,0.00034470583,0.03470058,0.0023477033,0.950456,0.010509812,0.000022898035],"about_ca_topic_score_codex":0.00091568794,"about_ca_topic_score_gemma":0.0012322529,"teacher_disagreement_score":0.013699545,"about_ca_system_score_codex":0.0012116082,"about_ca_system_score_gemma":0.0007002819,"threshold_uncertainty_score":0.045829475},"labels":[],"label_agreement":null},{"id":"W2758744141","doi":"","title":"A study on degree characterization for hamiltonian-connected graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Characterization (materials science); Combinatorics; Physics; Nanotechnology; Materials science","score_opus":0.09181590200353909,"score_gpt":0.3404378760293594,"score_spread":0.24862197402582029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2758744141","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6563847,0.007611886,0.23302184,0.0029323776,0.00051857956,0.00014658223,0.0011669977,0.00028382908,0.09793316],"genre_scores_gemma":[0.97086614,0.0027921288,0.015831897,0.00035506772,0.0004970842,0.000045290046,0.0005669601,0.00014514351,0.008900179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941874,0.00013980019,0.000025360876,0.00019314811,0.00013288567,0.00009010517],"domain_scores_gemma":[0.9965759,0.0020261586,0.00037719516,0.0002969732,0.00035601418,0.0003676878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006801433,0.00055428833,0.00048780948,0.0032929953,0.0010906877,0.0020041391,0.0010806796,0.0006612322,0.005317837],"category_scores_gemma":[0.006329113,0.00030067598,0.0006398963,0.0033389884,0.0018766142,0.0049952264,0.0011963369,0.0016151997,0.00052904966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000774357,0.00007648021,0.004898278,0.0002749141,0.000028552226,0.00023995705,0.0009912838,0.004237021,0.0073756254,0.9476717,0.004563651,0.029565051],"study_design_scores_gemma":[0.000020789485,0.00012339061,0.008266376,0.00018271341,0.00010998424,0.0014356632,0.0013952564,0.055365875,0.00632013,0.9022081,0.024515243,0.000056456574],"about_ca_topic_score_codex":0.0008380173,"about_ca_topic_score_gemma":0.00083987764,"teacher_disagreement_score":0.005317837,"about_ca_system_score_codex":0.0010874372,"about_ca_system_score_gemma":0.0003759726,"threshold_uncertainty_score":0.01778996},"labels":[],"label_agreement":null},{"id":"W2758767216","doi":"","title":"More on domination polynomial and domination root.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Root (linguistics); Polynomial; Mathematical analysis; Linguistics; Philosophy","score_opus":0.015441702672047083,"score_gpt":0.3030483105918106,"score_spread":0.2876066079197635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2758767216","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006228895,0.1013584,0.095957644,0.112592064,0.026669627,0.000084405714,0.0039296653,0.001133295,0.652046],"genre_scores_gemma":[0.13688259,0.08839719,0.06635392,0.07551568,0.037659567,0.00023082484,0.0070518446,0.0025620472,0.58534634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901474,0.00020755312,0.000043842367,0.00021554054,0.00037321707,0.00014510757],"domain_scores_gemma":[0.99771714,0.0012140003,0.00010506161,0.0004454496,0.00038948646,0.00012892664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012588786,0.001217259,0.0016054407,0.0030417107,0.0015953045,0.0023387603,0.0022675714,0.0024651063,0.08363988],"category_scores_gemma":[0.004149537,0.0006811357,0.0016821217,0.0052585197,0.0035297242,0.016759854,0.0020079634,0.0054150913,0.018517554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006231214,0.0001496425,0.0005901206,0.0007246006,0.00006370544,0.00022856129,0.0004377981,0.001255392,0.0010587451,0.534763,0.39310706,0.06755917],"study_design_scores_gemma":[0.000017500097,0.000024638362,0.00086325547,0.00015622932,0.000022943717,0.00022128937,0.00012973163,0.0004860385,0.00052384817,0.5443745,0.45314363,0.000036307585],"about_ca_topic_score_codex":0.006318884,"about_ca_topic_score_gemma":0.010427835,"teacher_disagreement_score":0.08363988,"about_ca_system_score_codex":0.002265461,"about_ca_system_score_gemma":0.00068967626,"threshold_uncertainty_score":0.27980334},"labels":[],"label_agreement":null},{"id":"W2759011610","doi":"","title":"A Square Time Algorithm for Cyclic Edge Connectivity of Planar Graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Square (algebra); Enhanced Data Rates for GSM Evolution; Planar; Combinatorics; Planar graph; Algorithm; Discrete mathematics; Graph; Geometry; Computer science; Artificial intelligence; Computer graphics (images)","score_opus":0.015807182949412888,"score_gpt":0.25185257081406776,"score_spread":0.23604538786465487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759011610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10720911,0.0009382597,0.8447714,0.0014411036,0.00028610474,0.00047784753,0.0012678434,0.0069975746,0.03661074],"genre_scores_gemma":[0.43220016,0.0003610015,0.54676765,0.0004011388,0.00012114105,0.0004202209,0.0027008904,0.00067180576,0.016356025],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994381,0.00010714328,0.000035914283,0.00015428057,0.00014872108,0.00011595783],"domain_scores_gemma":[0.9980095,0.0010338359,0.00013472015,0.00042414767,0.00026491325,0.00013286342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000416055,0.00067592174,0.00054937834,0.0009363345,0.00074379286,0.0013418474,0.0017607588,0.0010381172,0.015063379],"category_scores_gemma":[0.004422951,0.00034527673,0.00049458107,0.0019296814,0.00069779035,0.0024741713,0.0017179046,0.000980416,0.0025942347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001255776,0.00048451129,0.0017870548,0.00055697944,0.000100468395,0.0002727628,0.00043594683,0.11621167,0.02373586,0.06628383,0.055806544,0.7330685],"study_design_scores_gemma":[0.00060629135,0.00047469776,0.0010804787,0.00004537637,0.00009638571,0.00034687459,0.00031779788,0.83720136,0.012148891,0.12670971,0.020919902,0.000052099538],"about_ca_topic_score_codex":0.006459672,"about_ca_topic_score_gemma":0.010734337,"teacher_disagreement_score":0.015063379,"about_ca_system_score_codex":0.0010600125,"about_ca_system_score_gemma":0.0021723092,"threshold_uncertainty_score":0.05039203},"labels":[],"label_agreement":null},{"id":"W2759073790","doi":"","title":"A relationship between Minors and Linkages.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Education and experiences of immigrants and refugees","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.05018651983261534,"score_gpt":0.3633175898603601,"score_spread":0.31313107002774476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759073790","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98405,0.0004993496,0.00013483282,0.0022633427,0.000034709265,0.0000106642465,0.000105163745,0.0000055558926,0.012896316],"genre_scores_gemma":[0.99808854,0.00023189833,0.000036310925,0.00008290856,0.000008849477,0.000005107895,0.000024058332,0.0000027899996,0.0015196832],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868006,0.0005164751,0.000077909855,0.00011750234,0.00012374604,0.00048437857],"domain_scores_gemma":[0.9937391,0.0012353412,0.0022242654,0.00024996462,0.00038753884,0.0021638507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085559406,0.00015933979,0.00019830934,0.0012227293,0.0032508236,0.0021012053,0.00053252967,0.00055033906,0.02139736],"category_scores_gemma":[0.009330719,0.00023133236,0.00019302222,0.0014530421,0.0018244124,0.0017850837,0.0046335366,0.0011528553,0.00043641427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017507053,0.00023436346,0.8734328,0.00012578988,0.00004896589,0.0020155483,0.07695369,0.000045319484,0.0003829839,0.015055871,0.0025504993,0.028979091],"study_design_scores_gemma":[0.00001977941,0.0001699983,0.60113764,0.00043911615,0.00004454427,0.0032906167,0.3697481,0.000091814145,0.00016256582,0.00383587,0.021028968,0.000030915795],"about_ca_topic_score_codex":0.016096778,"about_ca_topic_score_gemma":0.028992945,"teacher_disagreement_score":0.02139736,"about_ca_system_score_codex":0.000811446,"about_ca_system_score_gemma":0.0023212435,"threshold_uncertainty_score":0.071581244},"labels":[],"label_agreement":null},{"id":"W2759187772","doi":"","title":"On the Semisymmetric Graphs of Order 2p 3 : faithful and primitive case.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Order (exchange)","score_opus":0.00921065686169387,"score_gpt":0.2061890913905993,"score_spread":0.19697843452890543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759187772","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5788799,0.0011272897,0.15099658,0.0028497782,0.00042978383,0.000092740396,0.0005410454,0.00033831754,0.26474458],"genre_scores_gemma":[0.9738748,0.00045747758,0.010530005,0.00034415047,0.00021671604,0.000030862117,0.00019922442,0.000068848145,0.014277809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945694,0.00017252141,0.000019203611,0.000078496596,0.00013615705,0.0001366988],"domain_scores_gemma":[0.9978963,0.0009984245,0.00033037193,0.0003045172,0.0002055893,0.00026481095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065268995,0.0005272884,0.00046883887,0.0017397245,0.0014050143,0.0019959707,0.0007287359,0.0011073785,0.009415168],"category_scores_gemma":[0.0025939508,0.00034632112,0.00053459476,0.00089260197,0.0028205402,0.0034872552,0.0012222781,0.0016658248,0.00082075835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017239512,0.0000100239695,0.00010055762,0.000014366973,0.000001924009,0.000093859795,0.000090836365,0.00083331775,0.0004608773,0.99557436,0.00085343205,0.0019493438],"study_design_scores_gemma":[0.000008038387,0.000006840971,0.00015537937,0.000009854738,0.0000024282497,0.00012752072,0.000067262496,0.0053539057,0.00023866988,0.9927055,0.0013183858,0.000006174287],"about_ca_topic_score_codex":0.0015924954,"about_ca_topic_score_gemma":0.0024197558,"teacher_disagreement_score":0.009415168,"about_ca_system_score_codex":0.0010551709,"about_ca_system_score_gemma":0.000605666,"threshold_uncertainty_score":0.031496942},"labels":[],"label_agreement":null},{"id":"W2759293601","doi":"","title":"A note on broom number and maximum edge-cut of graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Broom; Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Computer science; Geography; Artificial intelligence","score_opus":0.013546369645555768,"score_gpt":0.25286546818805405,"score_spread":0.23931909854249828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759293601","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0398005,0.054000136,0.26381978,0.041393388,0.018204676,0.00020659172,0.0027834917,0.0011997824,0.5785917],"genre_scores_gemma":[0.5500892,0.04376605,0.26009506,0.014005263,0.023025718,0.00047804305,0.0025887287,0.0013304973,0.10462141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997766,0.00059646886,0.00013915832,0.00065635674,0.0006282813,0.00021375278],"domain_scores_gemma":[0.98928016,0.008063871,0.000377696,0.0010892707,0.0006787052,0.0005102272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025186578,0.0013119983,0.0017811371,0.0048024654,0.0027143168,0.0046968297,0.0036918463,0.0029952812,0.017980652],"category_scores_gemma":[0.015050924,0.0009730064,0.0016310991,0.0055108806,0.005371865,0.012366213,0.0038146714,0.009044813,0.002797332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019834914,0.0000697567,0.00090157025,0.0004828899,0.000043005453,0.0002536068,0.00019487459,0.0029897715,0.0015854914,0.8935865,0.060553994,0.039140094],"study_design_scores_gemma":[0.000015972573,0.00002565231,0.00088549696,0.00010335161,0.000029508294,0.0002768424,0.0001005565,0.0044096876,0.00077834865,0.949407,0.043930274,0.000037239133],"about_ca_topic_score_codex":0.0036710787,"about_ca_topic_score_gemma":0.004925765,"teacher_disagreement_score":0.017980652,"about_ca_system_score_codex":0.0031175308,"about_ca_system_score_gemma":0.001029161,"threshold_uncertainty_score":0.06015134},"labels":[],"label_agreement":null},{"id":"W2759310240","doi":"","title":"Bounds of the Sum-connectivity Energy of Graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.013258359672121217,"score_gpt":0.23163354727692634,"score_spread":0.21837518760480512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759310240","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15914638,0.021351729,0.4309673,0.009789233,0.0016421231,0.000081227445,0.0026148723,0.0011451504,0.37326193],"genre_scores_gemma":[0.91562015,0.0063462835,0.034897313,0.0012209419,0.0010293208,0.00027062127,0.001241525,0.0006754015,0.038698453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988097,0.00029038682,0.000048725462,0.00022345883,0.0004212593,0.00020647692],"domain_scores_gemma":[0.99210316,0.0058073606,0.00034461182,0.00075034157,0.0005867226,0.00040784123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011795722,0.0015812191,0.00096520764,0.003193626,0.0011590708,0.003006016,0.0027529474,0.0018730272,0.02111544],"category_scores_gemma":[0.012093239,0.000512233,0.00074259704,0.0024436368,0.0018297039,0.0057466086,0.0030500004,0.0034576058,0.002859116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014412779,0.000084672385,0.0010145188,0.00047534582,0.0001114831,0.00021008984,0.00019289558,0.045669835,0.003958451,0.8912375,0.017301327,0.03959983],"study_design_scores_gemma":[0.000008985626,0.000028363176,0.0008859539,0.00011408145,0.000044249602,0.00026992022,0.00008434958,0.0902769,0.0021742044,0.8985838,0.007507085,0.000022143344],"about_ca_topic_score_codex":0.00056927186,"about_ca_topic_score_gemma":0.0011405515,"teacher_disagreement_score":0.02111544,"about_ca_system_score_codex":0.0013725784,"about_ca_system_score_gemma":0.00038754227,"threshold_uncertainty_score":0.07063824},"labels":[],"label_agreement":null},{"id":"W2759311282","doi":"","title":"Two Kinds Of m-Stirling Numbers.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Stirling engine; Stirling numbers of the second kind; Stirling number; Stirling numbers of the first kind; Combinatorics; Pure mathematics; Thermodynamics; Physics","score_opus":0.013860533354503064,"score_gpt":0.30784007077866976,"score_spread":0.2939795374241667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759311282","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09238764,0.0044138897,0.1641042,0.0042945663,0.0054107863,0.00012944816,0.0008024186,0.00082393567,0.7276331],"genre_scores_gemma":[0.798877,0.0021852965,0.070554934,0.0031087834,0.00201065,0.0003054891,0.0006388001,0.0002936101,0.122025415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887174,0.000216095,0.000087172164,0.00024251813,0.0003529446,0.00022954805],"domain_scores_gemma":[0.9982033,0.00057270314,0.00021408233,0.00041274936,0.00026957886,0.0003276017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090502814,0.00071280665,0.00048088335,0.0030613001,0.0015760687,0.0041422606,0.0010676053,0.0020935845,0.02072872],"category_scores_gemma":[0.0058678943,0.00044796063,0.0010045872,0.0013536382,0.0035416097,0.005564326,0.0032311173,0.0028378803,0.004402963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029304418,0.0000064964834,0.00009183444,0.000029003755,0.0000025531715,0.00006923808,0.00008148722,0.000072650764,0.00036090196,0.9922289,0.0018126795,0.0052149687],"study_design_scores_gemma":[0.000018948833,0.00002037208,0.00021266025,0.000047196194,0.000007589996,0.00048510003,0.00010400353,0.0008157272,0.0010318949,0.9725477,0.024680687,0.000028116605],"about_ca_topic_score_codex":0.000314396,"about_ca_topic_score_gemma":0.00051936554,"teacher_disagreement_score":0.02072872,"about_ca_system_score_codex":0.0011565099,"about_ca_system_score_gemma":0.00079635193,"threshold_uncertainty_score":0.06934446},"labels":[],"label_agreement":null},{"id":"W2759330492","doi":"","title":"Semisymmetric Cubic Graphs Of Order 10p n .","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cubic graph; Order (exchange); Combinatorics; Graph; Line graph; Business","score_opus":0.013466573888961155,"score_gpt":0.24626373044304853,"score_spread":0.23279715655408736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759330492","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56437075,0.00067278655,0.06688859,0.0032626796,0.0005278939,0.00018893299,0.00486678,0.0008255556,0.35839602],"genre_scores_gemma":[0.9470121,0.0003323898,0.012687929,0.00043615216,0.00008944052,0.000059616323,0.0015420894,0.00010218024,0.037738077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996358,0.00006951168,0.0000119001825,0.00005148628,0.00012088142,0.000110453155],"domain_scores_gemma":[0.99900717,0.00026571777,0.00021879142,0.00019249697,0.00017326753,0.00014262728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024265515,0.0003219874,0.0003439119,0.0006249796,0.0009556645,0.0010569355,0.00053407904,0.0005471444,0.013766959],"category_scores_gemma":[0.0012823329,0.0002240104,0.00026388915,0.0006970107,0.000864378,0.0010890865,0.0010295425,0.0011164949,0.0015936209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042670427,0.00008359776,0.00093660736,0.00019283191,0.000016893131,0.00060969277,0.00025207916,0.004885822,0.009043786,0.9352664,0.022156196,0.026129436],"study_design_scores_gemma":[0.000117988544,0.00008075809,0.002276375,0.000056837536,0.000017538568,0.00074050284,0.00030762088,0.019621167,0.0052616736,0.93419814,0.037279528,0.000041984098],"about_ca_topic_score_codex":0.0042095515,"about_ca_topic_score_gemma":0.010104576,"teacher_disagreement_score":0.013766959,"about_ca_system_score_codex":0.0012359646,"about_ca_system_score_gemma":0.0016959776,"threshold_uncertainty_score":0.046055138},"labels":[],"label_agreement":null},{"id":"W2759503368","doi":"","title":"Degree Associated Reconstruction Number of Graphs with Regular Pruned Graph.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Degree (music); Graph","score_opus":0.018788404857681094,"score_gpt":0.2594117058226955,"score_spread":0.24062330096501441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759503368","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8067508,0.00067809416,0.1502795,0.0015833228,0.00019784238,0.00007418963,0.001582731,0.0007382189,0.03811531],"genre_scores_gemma":[0.95892614,0.00031640378,0.032123644,0.00012652151,0.000052666564,0.00004651883,0.0010463978,0.00013052602,0.0072312155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995321,0.000100885474,0.00001773946,0.00012764374,0.00012667384,0.000095031704],"domain_scores_gemma":[0.99698824,0.0016433581,0.00031605506,0.00047262316,0.00029026644,0.00028957464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004380671,0.000332192,0.00037135393,0.0010382145,0.0008055215,0.0011971599,0.00092270435,0.00076109625,0.0085839275],"category_scores_gemma":[0.0053000897,0.0002535182,0.00030323752,0.0007177038,0.00080100546,0.0013879958,0.000736465,0.00082031736,0.0007647379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014859561,0.00031310375,0.014444346,0.0008223884,0.00014983577,0.0009595842,0.0009963929,0.13174509,0.048432503,0.6387643,0.031380598,0.13050596],"study_design_scores_gemma":[0.00011320482,0.00023565152,0.011724188,0.000120951256,0.00015482566,0.0018626526,0.0007218718,0.45723823,0.029514825,0.48131654,0.01692257,0.00007443238],"about_ca_topic_score_codex":0.0011460782,"about_ca_topic_score_gemma":0.0019464466,"teacher_disagreement_score":0.0085839275,"about_ca_system_score_codex":0.0007501417,"about_ca_system_score_gemma":0.0005415569,"threshold_uncertainty_score":0.028716087},"labels":[],"label_agreement":null},{"id":"W2759569093","doi":"","title":"Equitable coloring of Cartesian product of some graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Mathematics; Product (mathematics); Combinatorics; Geometry","score_opus":0.02055803068596021,"score_gpt":0.25059924738974604,"score_spread":0.23004121670378583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759569093","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49477592,0.00095852936,0.34671822,0.0026676827,0.00034889183,0.00011894029,0.0016376179,0.0009197793,0.15185447],"genre_scores_gemma":[0.859707,0.0004888396,0.10444124,0.0005100324,0.00015346846,0.00012310152,0.0016687171,0.00036646155,0.03254126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851817,0.0005034339,0.000087875196,0.00042324772,0.00020529683,0.00026197286],"domain_scores_gemma":[0.9949486,0.0024101576,0.00046409908,0.0010906844,0.0005574678,0.0005289437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010747653,0.00052094663,0.0005981996,0.0011100131,0.0023012706,0.0026736734,0.0011171832,0.0008947111,0.011731038],"category_scores_gemma":[0.0041474015,0.000627825,0.00070753717,0.001632412,0.0019242868,0.004697576,0.0024166796,0.0019228469,0.0013797922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118185424,0.000063206186,0.0011802487,0.00009797449,0.000017883058,0.0001716622,0.00043640457,0.0030104045,0.0020346032,0.9715386,0.00653243,0.014798448],"study_design_scores_gemma":[0.0000280967,0.000033205608,0.0008406954,0.000034208373,0.000032423006,0.00048741425,0.00036771243,0.012780007,0.0030486612,0.963569,0.018757926,0.000020744967],"about_ca_topic_score_codex":0.0018635269,"about_ca_topic_score_gemma":0.002637459,"teacher_disagreement_score":0.011731038,"about_ca_system_score_codex":0.0013974926,"about_ca_system_score_gemma":0.000705648,"threshold_uncertainty_score":0.039244175},"labels":[],"label_agreement":null},{"id":"W2759598964","doi":"","title":"On the domination number of digraphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01990610623612386,"score_gpt":0.3113467483938648,"score_spread":0.2914406421577409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759598964","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5234935,0.0057961303,0.14966705,0.008432412,0.0006393947,0.00013804466,0.0031286033,0.00061927055,0.3080856],"genre_scores_gemma":[0.95917153,0.002165093,0.018102013,0.00051098655,0.0005928356,0.0001540727,0.0009567727,0.00018741572,0.01815929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830294,0.0005329387,0.0000930146,0.00033680495,0.00041123418,0.00032291657],"domain_scores_gemma":[0.9749767,0.0200188,0.0013691911,0.0011240848,0.0009148429,0.0015964396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019170566,0.0007192283,0.0011033961,0.0049342285,0.0019948892,0.0039622267,0.0018830227,0.0014150013,0.013927058],"category_scores_gemma":[0.016904926,0.0006436491,0.0006246033,0.003473066,0.003208947,0.00992408,0.0023423221,0.0028261864,0.0012310587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001756789,0.000054031407,0.0025759088,0.000201791,0.000041173193,0.00011847721,0.0004004791,0.008505569,0.0014258621,0.9523865,0.009419301,0.024695132],"study_design_scores_gemma":[0.000035524125,0.000027569056,0.0014611372,0.00007898,0.00003653843,0.0002917817,0.00014340109,0.025510514,0.00086217746,0.9643025,0.007223617,0.000026339587],"about_ca_topic_score_codex":0.0015355801,"about_ca_topic_score_gemma":0.0020860268,"teacher_disagreement_score":0.013927058,"about_ca_system_score_codex":0.002715014,"about_ca_system_score_gemma":0.00080091355,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2759760320","doi":"","title":"Pentacyclic Graphs with Maximal Estrada Index.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Combinatorics; Discrete mathematics; Computer science; World Wide Web","score_opus":0.027798339497881807,"score_gpt":0.2915498129243886,"score_spread":0.2637514734265068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759760320","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23328003,0.001095111,0.062493447,0.0019867711,0.0004979812,0.00011024498,0.0029420792,0.0006306432,0.6969636],"genre_scores_gemma":[0.8938825,0.0009122587,0.022536436,0.0006669714,0.00018148644,0.00008308516,0.0025884109,0.00019549952,0.07895337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997203,0.000046016845,0.000014547636,0.00007820014,0.00006728761,0.000073569914],"domain_scores_gemma":[0.99928635,0.00027144895,0.000108601074,0.000109930814,0.000087539316,0.00013614872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017316034,0.0003640819,0.0006189004,0.0010365053,0.0013217856,0.0025535088,0.00056136213,0.00068859133,0.025015865],"category_scores_gemma":[0.0011078955,0.0003446361,0.00034574926,0.0010705894,0.0009823298,0.0019055089,0.0013420646,0.0016540769,0.003612974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013728837,0.00006527154,0.0005680062,0.000115817726,0.000019377636,0.00047996413,0.00023213669,0.001271602,0.0041769682,0.9655696,0.011899302,0.01546461],"study_design_scores_gemma":[0.000050421913,0.000033750228,0.0011332264,0.000052198848,0.000036039968,0.0005401839,0.00042601977,0.0037693998,0.0023824577,0.9591798,0.03237786,0.000018586159],"about_ca_topic_score_codex":0.00089303456,"about_ca_topic_score_gemma":0.0022134748,"teacher_disagreement_score":0.025015865,"about_ca_system_score_codex":0.00061249564,"about_ca_system_score_gemma":0.0004220009,"threshold_uncertainty_score":0.08368641},"labels":[],"label_agreement":null},{"id":"W2759885580","doi":"","title":"Four-way combinatorial interpretations of some Rogers-Ramanujan type identities.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Ramanujan's sum; Type (biology); Combinatorics; Pure mathematics; Biology; Paleontology","score_opus":0.05239297243019262,"score_gpt":0.3361411058628289,"score_spread":0.2837481334326363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759885580","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12195508,0.0022839324,0.12306021,0.003135275,0.0016259389,0.00007299757,0.00042324557,0.0003681878,0.74707514],"genre_scores_gemma":[0.83536196,0.0012573274,0.03997694,0.0009104485,0.000737998,0.000106416075,0.00027461417,0.00018269484,0.12119162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917513,0.0002414548,0.00004934411,0.000088239634,0.00030309372,0.00014272582],"domain_scores_gemma":[0.9992513,0.00021558335,0.00009992568,0.00013381828,0.00018843834,0.00011085179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001070127,0.0008087075,0.0005562882,0.0023207413,0.0023691605,0.0037510346,0.0013564386,0.0011216541,0.015464686],"category_scores_gemma":[0.0020543602,0.0003926428,0.0010243942,0.0012922684,0.0032005233,0.004844338,0.0022095942,0.0024807635,0.0031213076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005020317,0.0000054969387,0.000027084503,0.000007477682,0.0000013351919,0.00003722422,0.00006490967,0.000055278106,0.00013099189,0.998052,0.0005071262,0.0011060995],"study_design_scores_gemma":[0.0000073247534,0.0000065066733,0.00007192446,0.000010808272,0.0000052081195,0.00016523588,0.00008848404,0.0007477681,0.00027603985,0.99080443,0.0078063747,0.000009923622],"about_ca_topic_score_codex":0.00077264605,"about_ca_topic_score_gemma":0.0008666484,"teacher_disagreement_score":0.015464686,"about_ca_system_score_codex":0.0011446052,"about_ca_system_score_gemma":0.0006362825,"threshold_uncertainty_score":0.051734567},"labels":[],"label_agreement":null},{"id":"W2759894817","doi":"","title":"Generalized characteristic polynomial of generalized R-vertex corona.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Corona (planetary geology); Vertex (graph theory); Polynomial; Combinatorics; Mathematical analysis; Graph; Physics; Astrobiology","score_opus":0.039452995323459646,"score_gpt":0.31202343979528646,"score_spread":0.2725704444718268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759894817","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73091763,0.0018132827,0.069696166,0.0028275538,0.00056640967,0.00005264812,0.0011495147,0.00041178052,0.192565],"genre_scores_gemma":[0.9829091,0.0004537372,0.0034468719,0.0001756722,0.0002297637,0.000018223875,0.00028035764,0.000054505166,0.012431794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997317,0.00003889331,0.0000064527235,0.00007084454,0.00006793996,0.00008413928],"domain_scores_gemma":[0.9994649,0.00014866085,0.00009685417,0.00006728447,0.00010740908,0.00011494151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020838379,0.00032436472,0.00056843314,0.0012185455,0.00070711516,0.0014771677,0.0007009041,0.0005572739,0.008804885],"category_scores_gemma":[0.0014326485,0.0001775038,0.0004658334,0.0010154383,0.0012511188,0.0027563048,0.0010730635,0.0011389073,0.0012116244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009705847,0.000028667893,0.0011919369,0.000120541845,0.000018491015,0.00026862443,0.00023604122,0.0026980068,0.0032988314,0.96783787,0.006972374,0.017231572],"study_design_scores_gemma":[0.00003888043,0.000033991702,0.0019643935,0.000027574457,0.000022977049,0.0005729884,0.00017563642,0.016435616,0.0011303802,0.96772075,0.011851916,0.00002485459],"about_ca_topic_score_codex":0.0014411254,"about_ca_topic_score_gemma":0.0012936046,"teacher_disagreement_score":0.008804885,"about_ca_system_score_codex":0.0012038712,"about_ca_system_score_gemma":0.0004723249,"threshold_uncertainty_score":0.029455304},"labels":[],"label_agreement":null},{"id":"W2759937049","doi":"","title":"Bicyclic graphs with the second up to seventh largest Wiener indices.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Wiener index; Bicyclic molecule; Combinatorics; Statistics; Graph; Medicinal chemistry; Chemistry","score_opus":0.023780826423362766,"score_gpt":0.2909774739884292,"score_spread":0.26719664756506645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759937049","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5172252,0.003142444,0.09547734,0.0019145692,0.00070172385,0.00009890576,0.0018583392,0.00070805295,0.37887347],"genre_scores_gemma":[0.9398599,0.0010837448,0.016429968,0.0005562261,0.00014067357,0.000072920644,0.0007838206,0.00014868322,0.040923994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996803,0.00005433808,0.00001629942,0.000052824424,0.000092816794,0.00010346367],"domain_scores_gemma":[0.99924076,0.00020047279,0.00012879343,0.00014289143,0.00014527983,0.00014183055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002095204,0.00038578402,0.00046371925,0.0013064314,0.0010200843,0.0016057235,0.00050435856,0.00074317044,0.0080911545],"category_scores_gemma":[0.0017603852,0.00035658,0.00026807742,0.0010354606,0.000933048,0.0015015161,0.0015398155,0.0012528714,0.0020521288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001123715,0.000020890553,0.00055813836,0.000079089914,0.000012159326,0.00022344693,0.00020530961,0.001385972,0.0064715827,0.9656979,0.006435762,0.018797502],"study_design_scores_gemma":[0.000025579295,0.000037565904,0.0015107525,0.00007824674,0.000028960078,0.00071112404,0.00026199265,0.0069339797,0.0068008574,0.9595573,0.02401472,0.000039004397],"about_ca_topic_score_codex":0.0009099256,"about_ca_topic_score_gemma":0.0020064942,"teacher_disagreement_score":0.0080911545,"about_ca_system_score_codex":0.00051296735,"about_ca_system_score_gemma":0.0004718182,"threshold_uncertainty_score":0.027067602},"labels":[],"label_agreement":null},{"id":"W2760251569","doi":"","title":"On the rainbow connection number of graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Connection (principal bundle); Rainbow; Combinatorics; Geometry; Physics","score_opus":0.023847869553828203,"score_gpt":0.3087465662367306,"score_spread":0.28489869668290235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760251569","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48600137,0.009417348,0.14062709,0.010266768,0.0027479155,0.00011769563,0.0014269204,0.0009491331,0.3484458],"genre_scores_gemma":[0.95282984,0.003634412,0.020121872,0.0007033116,0.0013949862,0.00015822859,0.0005930837,0.00035160937,0.020212786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989629,0.00032844403,0.000048840222,0.00023972143,0.00023680142,0.0001833381],"domain_scores_gemma":[0.99168944,0.0054020076,0.00087800465,0.0005991904,0.0005300322,0.00090140285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015340217,0.00078920997,0.00095844985,0.005452762,0.0020010837,0.0026166306,0.0019216312,0.0017555793,0.01626261],"category_scores_gemma":[0.013132113,0.0005409293,0.00052765664,0.003413775,0.003748117,0.010474027,0.0029498881,0.0031552147,0.0021538546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014447975,0.00004062081,0.0010914472,0.0001719056,0.000019937472,0.0000721718,0.00019379177,0.003608895,0.0010641556,0.96664566,0.009087517,0.017859425],"study_design_scores_gemma":[0.000019529478,0.000024812813,0.0008143529,0.00006065244,0.000019179086,0.0001324454,0.0000890207,0.009813471,0.0005194778,0.98349,0.0049932185,0.000023728022],"about_ca_topic_score_codex":0.00093420834,"about_ca_topic_score_gemma":0.0011227647,"teacher_disagreement_score":0.01626261,"about_ca_system_score_codex":0.0017688974,"about_ca_system_score_gemma":0.00058858295,"threshold_uncertainty_score":0.0544039},"labels":[],"label_agreement":null},{"id":"W2760258650","doi":"","title":"Skew-quasi-cyclic codes over Ml(F q )[X, θ].","year":2017,"lang":"nl","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Skew; Mathematics; Combinatorics; Computer science; Telecommunications","score_opus":0.01811014444861419,"score_gpt":0.26818527129966757,"score_spread":0.2500751268510534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760258650","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70876235,0.0017323894,0.18403001,0.0032450364,0.0005660785,0.00016645853,0.0023275206,0.0012652688,0.097904846],"genre_scores_gemma":[0.97242844,0.00045785145,0.01137182,0.00040209165,0.00025238557,0.00005788858,0.0005262992,0.00008544973,0.014417732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999137,0.0002117944,0.000041094216,0.000098921664,0.00024957265,0.00026167688],"domain_scores_gemma":[0.99794954,0.0006758693,0.000471435,0.00035703686,0.0003480509,0.00019802371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079956837,0.00038278606,0.0003511387,0.0008312838,0.0007618665,0.00137523,0.00037826758,0.00055970025,0.007011181],"category_scores_gemma":[0.0035121976,0.00018623979,0.0002532136,0.0008989564,0.0010102985,0.0018967134,0.0014052084,0.0009645913,0.0013731028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006389188,0.0000721877,0.002060787,0.00011422151,0.000021661495,0.00037912928,0.0004649115,0.004669874,0.0099417595,0.92109984,0.008306504,0.052230254],"study_design_scores_gemma":[0.00011041628,0.00021592597,0.0030411019,0.00010684229,0.000028996485,0.0009330676,0.00030114403,0.021610022,0.011604885,0.93174684,0.030222427,0.000078436766],"about_ca_topic_score_codex":0.000908443,"about_ca_topic_score_gemma":0.0006876984,"teacher_disagreement_score":0.007011181,"about_ca_system_score_codex":0.0007041973,"about_ca_system_score_gemma":0.0010276022,"threshold_uncertainty_score":0.023454726},"labels":[],"label_agreement":null},{"id":"W2760485458","doi":"","title":"On the vertex-distinguishing proper total colorings of complete p-partite graphs with equipotent parts.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.02871722934859999,"score_gpt":0.2302532340082373,"score_spread":0.2015360046596373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760485458","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67202985,0.0013380981,0.20229863,0.0026456825,0.00029046598,0.00013067653,0.0016385157,0.0005912173,0.11903681],"genre_scores_gemma":[0.9450018,0.0006090521,0.039201293,0.0005092282,0.00019261088,0.00010833401,0.0011539853,0.00020382875,0.013019853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989268,0.00039612892,0.000051494535,0.00022008906,0.00017971662,0.00022576754],"domain_scores_gemma":[0.9936924,0.0042350837,0.0005804805,0.00064003497,0.00028601213,0.00056608696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012178435,0.0006751119,0.00068457995,0.0015474085,0.0020771052,0.0032200757,0.0013679744,0.0014371716,0.006957682],"category_scores_gemma":[0.0059343874,0.0008661395,0.00095519616,0.0016875797,0.0029951318,0.004446528,0.0021319361,0.002339331,0.0007412989],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015465454,0.000056904326,0.0013423448,0.00012009033,0.000021792686,0.00009897692,0.00038215253,0.00907251,0.0018971828,0.9698169,0.006130857,0.010905643],"study_design_scores_gemma":[0.000037144953,0.000028391076,0.0008910462,0.000036759393,0.000022802364,0.0001694742,0.00018563056,0.024090495,0.00084120425,0.97008497,0.0035933657,0.000018633567],"about_ca_topic_score_codex":0.0018328078,"about_ca_topic_score_gemma":0.0025668521,"teacher_disagreement_score":0.006957682,"about_ca_system_score_codex":0.0016670711,"about_ca_system_score_gemma":0.00076475245,"threshold_uncertainty_score":0.023275733},"labels":[],"label_agreement":null},{"id":"W2760517598","doi":"","title":"The Fibonacci Polynomials in Rings.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Mathematics; Fibonacci polynomials; Combinatorics; Orthogonal polynomials; Classical orthogonal polynomials","score_opus":0.011402268071611049,"score_gpt":0.289683571423056,"score_spread":0.27828130335144496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760517598","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08732759,0.037261005,0.24519424,0.007501064,0.0058339285,0.00011647951,0.0013831499,0.0006037956,0.6147788],"genre_scores_gemma":[0.8184277,0.012453202,0.07049849,0.0019510994,0.0036758566,0.0001640425,0.0005949864,0.00019807355,0.09203658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927884,0.00019710007,0.000044197994,0.00010734107,0.000263303,0.00010924116],"domain_scores_gemma":[0.9988226,0.0005633021,0.00012884199,0.00014563915,0.00022830351,0.00011134192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011491544,0.00077758456,0.0007263335,0.0028397283,0.0023239506,0.0037407242,0.00071128464,0.0011116709,0.0108334],"category_scores_gemma":[0.004362999,0.00052668736,0.000795457,0.0017992553,0.0037244626,0.005590007,0.0014393047,0.0024150054,0.0036734145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000948738,0.000002918101,0.000045715613,0.000028302053,0.0000027010426,0.000028684157,0.00006468915,0.00021952935,0.00014968589,0.99193984,0.0024940784,0.005014354],"study_design_scores_gemma":[0.000006301152,0.000009408578,0.00013446067,0.00002216574,0.0000045943657,0.00012670441,0.000038823622,0.0009943091,0.00019279291,0.9840761,0.014384785,0.000009634838],"about_ca_topic_score_codex":0.0015702134,"about_ca_topic_score_gemma":0.0017071961,"teacher_disagreement_score":0.0108334,"about_ca_system_score_codex":0.0015097591,"about_ca_system_score_gemma":0.0009318459,"threshold_uncertainty_score":0.036241353},"labels":[],"label_agreement":null},{"id":"W2760683564","doi":"","title":"Recursive Formulae for the Chromatic Polynomials of Complete r-uniform Mixed Interval Hypergraphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Interval (graph theory); Combinatorics; Discrete mathematics","score_opus":0.02427013532681572,"score_gpt":0.2654784851176603,"score_spread":0.2412083497908446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760683564","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1388163,0.0012438714,0.74018747,0.0012361022,0.00024481863,0.00015466189,0.0016067951,0.0009667208,0.11554334],"genre_scores_gemma":[0.83190763,0.0007498543,0.13637416,0.00045054653,0.00034703265,0.0002241575,0.0009119076,0.00043936656,0.02859539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992945,0.00016109509,0.00003445094,0.00015876626,0.00022624148,0.00012489475],"domain_scores_gemma":[0.9970095,0.0018730089,0.000263412,0.00026691586,0.00043446277,0.00015274016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010109859,0.0005194905,0.00047239423,0.0019843604,0.0010349941,0.0036031373,0.0018325112,0.00090533134,0.013723611],"category_scores_gemma":[0.007097773,0.0004507762,0.0007805839,0.0021101125,0.0017487853,0.0046668723,0.0012804894,0.0027788973,0.002124954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025347326,0.000020553569,0.0002322044,0.000050737817,0.000007420987,0.00003502995,0.00018642763,0.0013553026,0.0011664374,0.9827618,0.002304166,0.011854696],"study_design_scores_gemma":[0.00001905359,0.00001446495,0.00046248172,0.000032763604,0.000019000023,0.000110718356,0.0000956733,0.021726603,0.0012778416,0.971038,0.005176572,0.000026914184],"about_ca_topic_score_codex":0.002267265,"about_ca_topic_score_gemma":0.0038842387,"teacher_disagreement_score":0.013723611,"about_ca_system_score_codex":0.002423972,"about_ca_system_score_gemma":0.0006863706,"threshold_uncertainty_score":0.04591006},"labels":[],"label_agreement":null},{"id":"W2760792438","doi":"","title":"On the minimum spectral radius of trees with given matching number.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Matching (statistics); Spectral radius; RADIUS; Combinatorics; Statistics; Computer science; Physics; Computer security; Eigenvalues and eigenvectors; Quantum mechanics","score_opus":0.023870554136700285,"score_gpt":0.2862473691199902,"score_spread":0.2623768149832899,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760792438","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5642426,0.009102509,0.32690158,0.0045414213,0.00054414244,0.00010277848,0.0017224425,0.00078840175,0.09205406],"genre_scores_gemma":[0.9304091,0.002935669,0.056723535,0.00045457386,0.0006878103,0.00015540532,0.00076560176,0.0003970691,0.007471288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986975,0.00057960354,0.000057238838,0.00027107928,0.00021125675,0.00018328521],"domain_scores_gemma":[0.9877966,0.008831738,0.0011591836,0.00063136633,0.0006336906,0.00094744295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018035724,0.00071281404,0.0015045524,0.0027258082,0.0012590429,0.0025745695,0.00242489,0.0019252389,0.0068097627],"category_scores_gemma":[0.019571131,0.0005332459,0.00047809645,0.0019031197,0.0022618875,0.005630126,0.002214206,0.0017617792,0.0017529774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005992095,0.00011096959,0.0026774255,0.00051328994,0.00007722377,0.00018221718,0.00052062457,0.043858927,0.0077237254,0.89268005,0.016007558,0.03504889],"study_design_scores_gemma":[0.000045562185,0.000076570555,0.0018049199,0.000097622105,0.000048328013,0.0004836174,0.00036075155,0.12038406,0.0020877204,0.8685226,0.006048857,0.00003937769],"about_ca_topic_score_codex":0.00071458693,"about_ca_topic_score_gemma":0.00070673623,"teacher_disagreement_score":0.0068097627,"about_ca_system_score_codex":0.0014687043,"about_ca_system_score_gemma":0.00047906153,"threshold_uncertainty_score":0.022780955},"labels":[],"label_agreement":null},{"id":"W2764594488","doi":"","title":"Full Friendly Index Sets Of Spiders.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Statistics; Computer science; World Wide Web","score_opus":0.011241549441008367,"score_gpt":0.21298683117891287,"score_spread":0.2017452817379045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2764594488","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.226473,0.0010679351,0.30956963,0.0010158729,0.00060472556,0.00023429998,0.0031871316,0.0016334803,0.45621392],"genre_scores_gemma":[0.84451026,0.0008108402,0.05509217,0.0006272557,0.00032077337,0.00026912751,0.0023613523,0.0005326898,0.09547562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987445,0.00018874284,0.00010185068,0.00023680767,0.0004449915,0.00028314098],"domain_scores_gemma":[0.99735606,0.0007577844,0.00026238238,0.000657077,0.0005219368,0.00044472184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062033953,0.00065407826,0.0008459335,0.0029198464,0.0027371112,0.004993158,0.0010468333,0.00118687,0.028675478],"category_scores_gemma":[0.0039349007,0.00055963255,0.00081248616,0.0018904436,0.0012788263,0.0050803,0.003085255,0.0014034222,0.007044024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009552596,0.000051958614,0.00055904256,0.00009472943,0.000020741438,0.00021492134,0.00033353048,0.000953689,0.0034533788,0.9643574,0.008169561,0.021695523],"study_design_scores_gemma":[0.00002135927,0.000031209987,0.0006236078,0.000046603705,0.000025217125,0.0005907655,0.00022153085,0.0061220876,0.0032940612,0.95363975,0.035356354,0.000027392021],"about_ca_topic_score_codex":0.00069215836,"about_ca_topic_score_gemma":0.0008796728,"teacher_disagreement_score":0.028675478,"about_ca_system_score_codex":0.0010151515,"about_ca_system_score_gemma":0.00055080507,"threshold_uncertainty_score":0.09592897},"labels":[],"label_agreement":null},{"id":"W2767222312","doi":"","title":"Embedding of Hypercubes into Generalized Books.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Embedding; Hypercube; Mathematics; Combinatorics; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.0164701443658232,"score_gpt":0.2746886332142789,"score_spread":0.25821848884845566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767222312","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070901535,0.00131786,0.7625277,0.0009766484,0.00040980277,0.00013388404,0.0013863939,0.0021307298,0.16021533],"genre_scores_gemma":[0.56582135,0.0014795774,0.29237157,0.00034124297,0.00018836174,0.0002716131,0.0025065963,0.0009921645,0.13602746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999273,0.00023069695,0.000048350532,0.00020178994,0.00017234907,0.00007379357],"domain_scores_gemma":[0.9988753,0.00030355228,0.00012510481,0.00038880363,0.00019475652,0.000112366324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003473448,0.0005234473,0.0003962451,0.0012312774,0.0011076017,0.0030451803,0.0010730303,0.00060260535,0.019972932],"category_scores_gemma":[0.0025436215,0.00048801777,0.0007794533,0.0019016522,0.0016789576,0.004519187,0.0027790836,0.0013139015,0.0044970177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005268639,0.000029004323,0.000244995,0.00008548095,0.000015769496,0.00012489251,0.0003735738,0.005755552,0.0012460443,0.95443887,0.004642013,0.032991055],"study_design_scores_gemma":[0.000018132836,0.000024691317,0.00028472283,0.000060777173,0.0000190192,0.0001903863,0.00037274582,0.020115381,0.0022198411,0.90584165,0.070836484,0.000016141494],"about_ca_topic_score_codex":0.0020069985,"about_ca_topic_score_gemma":0.003208053,"teacher_disagreement_score":0.019972932,"about_ca_system_score_codex":0.0010494346,"about_ca_system_score_gemma":0.0005470364,"threshold_uncertainty_score":0.06681609},"labels":[],"label_agreement":null},{"id":"W2767238088","doi":"","title":"The Rainbow Vertex Connectivities Of Small Cubic Graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Rainbow; Vertex (graph theory); Combinatorics; Cubic graph; Graph; Line graph; Physics; Optics","score_opus":0.01837995889030375,"score_gpt":0.23173794839624468,"score_spread":0.21335798950594093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767238088","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77357656,0.0014663048,0.059444435,0.0030043526,0.00020666707,0.000076586075,0.0014513767,0.00040703703,0.1603666],"genre_scores_gemma":[0.9740969,0.00055597874,0.012622675,0.00024807127,0.00011355905,0.00007700009,0.00054850295,0.00010505773,0.011632263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994479,0.00014851874,0.000021209145,0.00014716477,0.00012343921,0.00011183167],"domain_scores_gemma":[0.9955422,0.0027247916,0.00057849626,0.00041837565,0.00027809854,0.0004579511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006215154,0.00038125357,0.0004109412,0.0023557956,0.0019117139,0.0024531086,0.0012820142,0.001211397,0.012761662],"category_scores_gemma":[0.0070881676,0.00057834055,0.00044168683,0.0018154968,0.0021954828,0.0039226334,0.0019039841,0.0019684087,0.0008633959],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015440652,0.000033497305,0.0018512032,0.00013814827,0.000015244437,0.0001010012,0.00029841336,0.006444042,0.0018766936,0.96868926,0.006146717,0.014251266],"study_design_scores_gemma":[0.00003951982,0.000017672535,0.0015688717,0.000052572548,0.000026158923,0.00020793699,0.0002733116,0.023506513,0.0015202618,0.96648717,0.0062790546,0.000021064014],"about_ca_topic_score_codex":0.002779841,"about_ca_topic_score_gemma":0.004724807,"teacher_disagreement_score":0.012761662,"about_ca_system_score_codex":0.0014440357,"about_ca_system_score_gemma":0.00073196326,"threshold_uncertainty_score":0.042692006},"labels":[],"label_agreement":null},{"id":"W2767242928","doi":"","title":"On the path edge-connectivity of graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Path (computing); Combinatorics; Computer science; Artificial intelligence; Computer network","score_opus":0.01736953347971534,"score_gpt":0.23910480072919002,"score_spread":0.22173526724947468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767242928","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23670132,0.019518431,0.47180215,0.010637391,0.0018125735,0.00015081548,0.0024083266,0.0005623244,0.25640672],"genre_scores_gemma":[0.8775147,0.014749731,0.06828592,0.001887373,0.00218308,0.00027240877,0.0019040944,0.00033793796,0.03286478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993506,0.00027012586,0.000034224682,0.00013116935,0.00012006131,0.00009386004],"domain_scores_gemma":[0.994925,0.0038012853,0.00032468658,0.00032758788,0.00034060417,0.0002807376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089903944,0.00067086145,0.000668479,0.002293445,0.0009780406,0.0015497472,0.0011168609,0.0015564797,0.013201077],"category_scores_gemma":[0.008511263,0.0004154769,0.0004720618,0.0022708888,0.0026407875,0.0075087617,0.0016121684,0.002612885,0.0016911888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006559243,0.000029463215,0.00083629705,0.00022265394,0.00002926849,0.00016251414,0.00021170627,0.0070401356,0.0006750454,0.95033187,0.013658986,0.026736405],"study_design_scores_gemma":[0.000011222601,0.000024943038,0.0003949898,0.000042564618,0.0000137299985,0.0001440647,0.000078863515,0.00987661,0.00016859616,0.9826873,0.0065491833,0.00000780297],"about_ca_topic_score_codex":0.0009758845,"about_ca_topic_score_gemma":0.0012801217,"teacher_disagreement_score":0.013201077,"about_ca_system_score_codex":0.0007501903,"about_ca_system_score_gemma":0.0003533131,"threshold_uncertainty_score":0.044162035},"labels":[],"label_agreement":null},{"id":"W2767327808","doi":"","title":"Diagonal transformations in pentangulations on the sphere.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Theoretical and Applied Studies in Material Sciences and Geometry","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Diagonal; Mathematics; Pure mathematics; Combinatorics; Geometry","score_opus":0.009967740773574157,"score_gpt":0.2368325361961421,"score_spread":0.22686479542256796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767327808","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37512854,0.001329884,0.15906943,0.002188905,0.0012347584,0.00011320298,0.0007932256,0.0010186016,0.45912346],"genre_scores_gemma":[0.9162294,0.0007653451,0.020403141,0.0007180693,0.00038911382,0.00007234144,0.0005121116,0.00040825998,0.060502112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995202,0.00010812161,0.000022748902,0.000082766914,0.00015274501,0.00011345699],"domain_scores_gemma":[0.9995876,0.000076417404,0.00006915875,0.00007064503,0.00006849372,0.0001276837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023875514,0.00056925183,0.00038954016,0.0013070039,0.0010203341,0.0022970112,0.00045395445,0.0005801169,0.015864303],"category_scores_gemma":[0.0010472045,0.00023598051,0.000443811,0.00063702976,0.0018234148,0.0021112442,0.001848865,0.0015159509,0.0033897301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019819994,0.000012683537,0.000076377655,0.000011383119,0.000002958158,0.00004328449,0.000074586744,0.0004088617,0.00065578875,0.9916182,0.0019074032,0.0051687625],"study_design_scores_gemma":[0.000013708485,0.0000206488,0.00020702483,0.0000104647725,0.0000034287627,0.00013713447,0.00013563677,0.004603771,0.00071719696,0.9873454,0.006795231,0.000010417662],"about_ca_topic_score_codex":0.0012427333,"about_ca_topic_score_gemma":0.0016196396,"teacher_disagreement_score":0.015864303,"about_ca_system_score_codex":0.0006194707,"about_ca_system_score_gemma":0.00044376444,"threshold_uncertainty_score":0.05307144},"labels":[],"label_agreement":null},{"id":"W2767352756","doi":"","title":"The Inverse-conjugate Compositions With Odd Parts.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Conjugate; Inverse; Pure mathematics; Geometry; Mathematical analysis","score_opus":0.014436374738355129,"score_gpt":0.24244550119245462,"score_spread":0.2280091264540995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767352756","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08290145,0.002247148,0.40053007,0.0021352833,0.00354413,0.00015982203,0.00052248826,0.0011008427,0.5068588],"genre_scores_gemma":[0.64327735,0.0016602707,0.14532636,0.0023448754,0.0011879017,0.00026056293,0.0006642974,0.0014244126,0.20385394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984187,0.00038765793,0.00011347256,0.00039247223,0.0004224614,0.00026532813],"domain_scores_gemma":[0.9987936,0.00026345762,0.00012752961,0.00039156587,0.0002774937,0.0001462455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014005483,0.00086562254,0.00061133766,0.0015461544,0.0026146711,0.0037327346,0.0009008195,0.0012436446,0.019034073],"category_scores_gemma":[0.004384108,0.0006492015,0.0011772946,0.0009140261,0.004551006,0.007790172,0.00372688,0.0032782946,0.007709033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051051244,0.000019744048,0.00015133228,0.000036507583,0.0000074327413,0.00013195648,0.00021901917,0.000107906795,0.0015167536,0.98469585,0.0024452272,0.01061737],"study_design_scores_gemma":[0.000011953499,0.000016027217,0.00011558377,0.00002954206,0.000013258096,0.00041261053,0.00012214134,0.0009591781,0.0046102325,0.96220213,0.031489074,0.000018278644],"about_ca_topic_score_codex":0.00052494224,"about_ca_topic_score_gemma":0.00081975554,"teacher_disagreement_score":0.019034073,"about_ca_system_score_codex":0.0008670007,"about_ca_system_score_gemma":0.0008872337,"threshold_uncertainty_score":0.063675284},"labels":[],"label_agreement":null},{"id":"W2767379641","doi":"","title":"Oriented Bicyclic Graphs with the First Five Large Skew Energies.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Skew; Mathematics; Combinatorics; Computer science; Telecommunications","score_opus":0.015444592651207314,"score_gpt":0.27054560026365354,"score_spread":0.25510100761244625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767379641","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6856664,0.0018371365,0.055193074,0.0012598927,0.0006079836,0.00007335864,0.0007196868,0.00040117907,0.25424132],"genre_scores_gemma":[0.9771494,0.00041748895,0.0069516553,0.00026093842,0.00006315204,0.000029233737,0.00023548724,0.00006211956,0.014830559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998418,0.00002642685,0.000005872115,0.000021797465,0.000049300008,0.00005476183],"domain_scores_gemma":[0.9995921,0.000103625585,0.000077595985,0.00006641613,0.00006692574,0.00009327178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015485917,0.0003691083,0.00030488553,0.00083775586,0.0008142111,0.0011363232,0.00039702552,0.00067973183,0.009012725],"category_scores_gemma":[0.0010287478,0.0002465789,0.00015352257,0.0006837613,0.00078816747,0.0010167233,0.001035323,0.00078860886,0.001112086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012100187,0.00003301215,0.0009191201,0.000090245005,0.000010872765,0.0003579673,0.00014823664,0.0030630543,0.006149666,0.96125996,0.0055453987,0.022301458],"study_design_scores_gemma":[0.000034831777,0.000044051314,0.0022780607,0.00007175488,0.000025155134,0.0009347327,0.00035631034,0.011352877,0.006771714,0.95893204,0.019162165,0.000036370715],"about_ca_topic_score_codex":0.00047970153,"about_ca_topic_score_gemma":0.0013754352,"teacher_disagreement_score":0.009012725,"about_ca_system_score_codex":0.00039182452,"about_ca_system_score_gemma":0.0003489735,"threshold_uncertainty_score":0.030150592},"labels":[],"label_agreement":null},{"id":"W2767387720","doi":"","title":"On Some Variants of Gracefulness of Cycle Graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.013452013949164846,"score_gpt":0.24331315950473253,"score_spread":0.2298611455555677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767387720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19862817,0.0033940538,0.4748298,0.007246526,0.00088164397,0.00029353108,0.0017861848,0.0016049952,0.31133518],"genre_scores_gemma":[0.84443605,0.0026697088,0.09454637,0.0026029975,0.0012038198,0.00037646576,0.0017651673,0.0009873911,0.051412072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985832,0.00042875367,0.00007457275,0.000375411,0.0002706845,0.00026749627],"domain_scores_gemma":[0.9945852,0.0029441824,0.00043889278,0.0011336934,0.00037745383,0.0005204548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017002433,0.0008112785,0.000875295,0.0023260876,0.0025360798,0.0036209372,0.0022236935,0.0016838657,0.015364071],"category_scores_gemma":[0.008174232,0.00074579543,0.0016541863,0.0031156112,0.0046310546,0.007809428,0.003797366,0.004166092,0.0015229862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029221406,0.00002090496,0.00022366094,0.00004418377,0.00000775781,0.00004626142,0.00015547067,0.0015573621,0.00039957426,0.9877259,0.003872557,0.0059170304],"study_design_scores_gemma":[0.000010536903,0.000009095965,0.0001717301,0.000018782519,0.000009792349,0.00007802761,0.00006934005,0.004301683,0.00028562715,0.9893377,0.0056968885,0.000010798758],"about_ca_topic_score_codex":0.0034561977,"about_ca_topic_score_gemma":0.0035663145,"teacher_disagreement_score":0.015364071,"about_ca_system_score_codex":0.0021385937,"about_ca_system_score_gemma":0.0011281279,"threshold_uncertainty_score":0.05139798},"labels":[],"label_agreement":null},{"id":"W2767398938","doi":"","title":"The Combinatorial Representation of Jacobsthal and Jacobsthal Lucas Matrix Sequences.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Representation (politics); Combinatorics; Matrix representation; Algebra over a field; Pure mathematics; Chemistry","score_opus":0.015480658638875957,"score_gpt":0.3199842809953339,"score_spread":0.30450362235645795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767398938","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30595595,0.0038009505,0.22134069,0.0038163017,0.0014266457,0.00015387325,0.0014935101,0.0006712737,0.4613408],"genre_scores_gemma":[0.86437213,0.0013220849,0.040240876,0.0007923406,0.00074930856,0.00014556575,0.0008768613,0.00028158305,0.09121919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961996,0.00008352263,0.00002013529,0.00006161892,0.00012996903,0.000084716805],"domain_scores_gemma":[0.99924314,0.00016457646,0.00014117207,0.00008405583,0.00021202912,0.0001550435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036503817,0.0006499658,0.00041577686,0.0028428247,0.0012583662,0.002954989,0.0008988621,0.00088807696,0.016318813],"category_scores_gemma":[0.0025110058,0.00033031075,0.00043611776,0.001510912,0.0016933073,0.0029787123,0.0014810517,0.0016647887,0.0038657186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019431835,0.000009408619,0.0000870192,0.000016697857,0.000002033775,0.000046410943,0.0001173575,0.00035146516,0.0006417985,0.98943675,0.0019977856,0.00727383],"study_design_scores_gemma":[0.0000120781615,0.0000179786,0.00025777298,0.00002012523,0.0000051848633,0.00017976793,0.00011897151,0.0045126616,0.0005074697,0.9812368,0.013114854,0.000016272546],"about_ca_topic_score_codex":0.0015692373,"about_ca_topic_score_gemma":0.0019485274,"teacher_disagreement_score":0.016318813,"about_ca_system_score_codex":0.0011594623,"about_ca_system_score_gemma":0.00074284367,"threshold_uncertainty_score":0.054591894},"labels":[],"label_agreement":null},{"id":"W2767409815","doi":"","title":"Harmonic index of graphs with more than one cut-vertex.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Index (typography); Combinatorics; Discrete mathematics; Graph; Computer science","score_opus":0.032786357015468164,"score_gpt":0.2902333492639153,"score_spread":0.25744699224844714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767409815","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5504515,0.002024994,0.12909007,0.0016506568,0.00089079974,0.00008384789,0.0015543884,0.00041062967,0.3138431],"genre_scores_gemma":[0.95312107,0.0007964953,0.013747355,0.00027559194,0.00039982155,0.00006845368,0.0009913219,0.00020907109,0.0303909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996728,0.000046805122,0.000013183721,0.00007034299,0.0000998913,0.00009699254],"domain_scores_gemma":[0.99878234,0.00049313257,0.00017478326,0.00014168101,0.00016424253,0.00024382843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036081098,0.00040160678,0.00059893104,0.0026620734,0.0011062887,0.0023927095,0.0012375059,0.0009540951,0.011173973],"category_scores_gemma":[0.0025965984,0.0002786129,0.0003327711,0.0012877831,0.001348379,0.0028110219,0.0016947204,0.0012287082,0.0017821209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007945457,0.000026451524,0.0009062205,0.00006589434,0.000016007543,0.00013284365,0.0001770569,0.0014769566,0.0029799058,0.9717272,0.005424502,0.01698753],"study_design_scores_gemma":[0.000016746077,0.000023094779,0.0016064754,0.00002750612,0.000025579735,0.00037072896,0.00023188964,0.015731763,0.0019791708,0.96935844,0.010607322,0.000021261427],"about_ca_topic_score_codex":0.0010350326,"about_ca_topic_score_gemma":0.0011136741,"teacher_disagreement_score":0.011173973,"about_ca_system_score_codex":0.0009893572,"about_ca_system_score_gemma":0.00038584817,"threshold_uncertainty_score":0.037380636},"labels":[],"label_agreement":null},{"id":"W2767421384","doi":"","title":"Measuring the vulnerability in networks: a heuristic approach.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Heuristic; Vulnerability (computing); Mathematics; Mathematical optimization; Computer science; Computer security","score_opus":0.02830404512825634,"score_gpt":0.24218658244928362,"score_spread":0.21388253732102727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767421384","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1348527,0.0012899006,0.84889996,0.00073170906,0.00009440774,0.00048016864,0.0007651123,0.00078490144,0.012101091],"genre_scores_gemma":[0.6870751,0.00044862577,0.3096545,0.00011459033,0.000056255147,0.00030490904,0.00065403746,0.0000835897,0.001608342],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740523,0.0013988899,0.00011570122,0.00036595485,0.00048845826,0.00022578661],"domain_scores_gemma":[0.9884779,0.00915423,0.00069048174,0.0009001389,0.00048582337,0.00029139908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031598464,0.0012430158,0.0016231965,0.007778682,0.0009698198,0.0025780026,0.001892705,0.0017033841,0.0029630486],"category_scores_gemma":[0.017689291,0.00062829995,0.0015683882,0.003359676,0.0022051183,0.0029851142,0.0014470408,0.0010373524,0.00040592867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020102692,0.0003614305,0.017315164,0.00043693528,0.00050153193,0.00020052852,0.00016248527,0.7625068,0.0031041335,0.095015116,0.00335043,0.11684448],"study_design_scores_gemma":[0.00002566085,0.00011837404,0.0015695404,0.00004307235,0.00009191835,0.00016982824,0.000112012094,0.9152946,0.00120714,0.08046158,0.00087728054,0.000029028955],"about_ca_topic_score_codex":0.002580806,"about_ca_topic_score_gemma":0.0039822925,"teacher_disagreement_score":0.007778682,"about_ca_system_score_codex":0.001998869,"about_ca_system_score_gemma":0.0022243126,"threshold_uncertainty_score":0.016711116},"labels":[],"label_agreement":null},{"id":"W2767445968","doi":"","title":"All good (bad) words consisting of four blocks.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arithmetic","score_opus":0.02432879216988814,"score_gpt":0.271579906478491,"score_spread":0.24725111430860286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767445968","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36968926,0.0062008607,0.26335052,0.004993101,0.0054120263,0.0005369055,0.008560297,0.005319117,0.33593798],"genre_scores_gemma":[0.7545125,0.0016651546,0.08067882,0.0015829615,0.00067587045,0.0007225959,0.0049017128,0.0017888788,0.15347157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821115,0.00046342032,0.00021246298,0.00032850032,0.00033800452,0.00044662022],"domain_scores_gemma":[0.9981528,0.0005547725,0.0002147938,0.0005135661,0.0003878712,0.00017620901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073884666,0.0014624922,0.0010783924,0.0016958024,0.0031371939,0.003431968,0.0011583418,0.001702588,0.02627329],"category_scores_gemma":[0.00347251,0.00061934884,0.0009966547,0.0014383298,0.0029317872,0.0052935476,0.0027433112,0.0013534881,0.013298648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008184829,0.00009117897,0.0017264314,0.0007478362,0.0001662764,0.0013451381,0.00095206586,0.0015062828,0.01978487,0.8636161,0.029373106,0.07987219],"study_design_scores_gemma":[0.000037650447,0.000084627434,0.0006677496,0.00014561968,0.00010690638,0.00070029695,0.00052143965,0.0020811001,0.012325591,0.86866146,0.114583224,0.00008439757],"about_ca_topic_score_codex":0.00061935035,"about_ca_topic_score_gemma":0.0009803809,"teacher_disagreement_score":0.02627329,"about_ca_system_score_codex":0.0007794047,"about_ca_system_score_gemma":0.00087181333,"threshold_uncertainty_score":0.08789289},"labels":[],"label_agreement":null},{"id":"W2767482913","doi":"","title":"Metric Dimension of the Mobius Ladder.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dimension (graph theory); Metric (unit); Pure mathematics; Combinatorics; Business","score_opus":0.00836152179824795,"score_gpt":0.24427196183288385,"score_spread":0.2359104400346359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767482913","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55474055,0.002720276,0.112450205,0.0038929046,0.001043321,0.000064315675,0.0006623825,0.00055557885,0.32387048],"genre_scores_gemma":[0.956548,0.00083153683,0.011533973,0.00036291298,0.00032347994,0.00004955269,0.00023697462,0.00016478733,0.029948805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957854,0.00009651745,0.000018029365,0.000052533807,0.00016775329,0.000086682194],"domain_scores_gemma":[0.99915266,0.00014381128,0.00013401029,0.00008469748,0.00020150085,0.00028326345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005874296,0.00051450665,0.00046191047,0.0032669262,0.0011500118,0.0020066947,0.0007065736,0.0007761879,0.00965774],"category_scores_gemma":[0.0025991646,0.00023737937,0.00030384728,0.0007394531,0.001423681,0.002637573,0.0017101438,0.001128496,0.0015915752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019339312,0.0000091533475,0.00020935813,0.000020921292,0.0000036563858,0.0000282339,0.000050845018,0.00047419287,0.0006558944,0.99432844,0.0010932778,0.0031067128],"study_design_scores_gemma":[0.000010132289,0.00001723064,0.00057616486,0.000021276799,0.000004991044,0.0001357147,0.00006534393,0.009766577,0.00051755336,0.9841616,0.0047118673,0.000011504449],"about_ca_topic_score_codex":0.0011933492,"about_ca_topic_score_gemma":0.0013623124,"teacher_disagreement_score":0.00965774,"about_ca_system_score_codex":0.0011550274,"about_ca_system_score_gemma":0.00069869397,"threshold_uncertainty_score":0.03230834},"labels":[],"label_agreement":null},{"id":"W2767485624","doi":"","title":"Strong Z 4p -Magic labeling.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"MAGIC (telescope); Mathematics; Astrophysics; Physics","score_opus":0.020997253277007407,"score_gpt":0.2595718912591848,"score_spread":0.23857463798217737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767485624","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20080182,0.0013323282,0.33616474,0.008642751,0.0007666127,0.00020374494,0.0053050765,0.002143544,0.4446394],"genre_scores_gemma":[0.79830277,0.0009317784,0.1228687,0.0020147413,0.0002943553,0.00021982286,0.004605089,0.0006325331,0.070130184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990922,0.0001957049,0.000046923866,0.00024026564,0.00020918064,0.00021578246],"domain_scores_gemma":[0.99806637,0.00081980467,0.00019472522,0.00043178818,0.00024030155,0.0002469613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007636764,0.00067450025,0.00058164995,0.0011053997,0.002131722,0.00322552,0.0013904228,0.0013494908,0.024318235],"category_scores_gemma":[0.002874762,0.0005355837,0.00086766883,0.001481637,0.0020193905,0.0054924563,0.003314758,0.0030665363,0.003930823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000120443336,0.00003665077,0.00039365317,0.00012215502,0.000013101328,0.00006501813,0.000098867655,0.0011445843,0.0018187711,0.9664356,0.012453249,0.017297918],"study_design_scores_gemma":[0.000031111624,0.000015367275,0.00033918614,0.000026895814,0.000017359778,0.00013758233,0.00010960403,0.004437421,0.0019384868,0.9753519,0.017581105,0.0000139303365],"about_ca_topic_score_codex":0.0016254784,"about_ca_topic_score_gemma":0.0027578361,"teacher_disagreement_score":0.024318235,"about_ca_system_score_codex":0.0014180811,"about_ca_system_score_gemma":0.0011503367,"threshold_uncertainty_score":0.08135265},"labels":[],"label_agreement":null},{"id":"W2767549563","doi":"","title":"A refinement of Guo's theorem concerning divisibility properties of binomial coeffi cients.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Divisibility rule; Binomial (polynomial); Binomial theorem; Pure mathematics; Applied mathematics; Statistics; Discrete mathematics","score_opus":0.09202414065968427,"score_gpt":0.3553592494910651,"score_spread":0.26333510883138084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767549563","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0600622,0.0026974254,0.6214445,0.009518778,0.0034827709,0.00018310436,0.0014117219,0.0007504451,0.30044904],"genre_scores_gemma":[0.7451965,0.0035432323,0.15740293,0.004787882,0.003599991,0.0002356842,0.0013022093,0.0008072111,0.08312432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978788,0.00044173904,0.000108545886,0.00050878315,0.0008513643,0.0002108576],"domain_scores_gemma":[0.99316376,0.0032492238,0.00040277594,0.0013778852,0.0014195979,0.00038677553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035386528,0.0010227906,0.0011460454,0.0023147296,0.0013568172,0.0027818205,0.0020187872,0.0010357265,0.013564204],"category_scores_gemma":[0.020366807,0.0005431015,0.0014932844,0.0024023422,0.004036586,0.009580656,0.0051150634,0.0063296836,0.0028821141],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054588672,0.000034239845,0.00079726236,0.000115982904,0.00002285196,0.00017419683,0.0002797456,0.0008845221,0.0023508093,0.9658333,0.009400939,0.0200516],"study_design_scores_gemma":[0.000028313472,0.000048612485,0.0010293957,0.000059209557,0.000037663714,0.0005037187,0.00008641493,0.009376184,0.0023237825,0.9570574,0.029413642,0.000035703117],"about_ca_topic_score_codex":0.0020631528,"about_ca_topic_score_gemma":0.0017160069,"teacher_disagreement_score":0.013564204,"about_ca_system_score_codex":0.0012863912,"about_ca_system_score_gemma":0.0010687552,"threshold_uncertainty_score":0.045376778},"labels":[],"label_agreement":null},{"id":"W2767596174","doi":"","title":"Molecular graphs with extremal first geometric-arithmetic index.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Arithmetic; Discrete mathematics; Computer science","score_opus":0.022571108241076356,"score_gpt":0.27306227359960106,"score_spread":0.2504911653585247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767596174","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.491118,0.0020168496,0.09439217,0.0041378764,0.00091205776,0.00008362559,0.0015286494,0.00095045887,0.4048603],"genre_scores_gemma":[0.9602397,0.0006686265,0.014009342,0.000538116,0.00031848825,0.00006324163,0.0005185897,0.00015976612,0.023484271],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996119,0.000073195326,0.0000132800815,0.00007812323,0.00012557709,0.000097943084],"domain_scores_gemma":[0.99904126,0.00029640694,0.00020540967,0.00016395704,0.00012537978,0.00016750347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035017726,0.0004569512,0.0005278121,0.0020986693,0.0013394004,0.0027291065,0.0009683785,0.0013277947,0.014489015],"category_scores_gemma":[0.0021823964,0.0002989957,0.0003313481,0.00094489276,0.0018645391,0.0034789597,0.0018226018,0.0018117902,0.0022951313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003331706,0.000016178348,0.00018057162,0.000039366263,0.0000045420898,0.00006463993,0.00006303749,0.00060192484,0.0012283466,0.9898936,0.0025906707,0.0052837683],"study_design_scores_gemma":[0.000008817935,0.000014126892,0.00037908004,0.00001687916,0.0000072857215,0.00018614228,0.000077034245,0.0030367207,0.0010085017,0.9903656,0.0048872684,0.000012389908],"about_ca_topic_score_codex":0.00040217183,"about_ca_topic_score_gemma":0.0007364166,"teacher_disagreement_score":0.014489015,"about_ca_system_score_codex":0.00093379366,"about_ca_system_score_gemma":0.000462535,"threshold_uncertainty_score":0.048470616},"labels":[],"label_agreement":null},{"id":"W2767625825","doi":"","title":"Some q-Dixon-like summation formula.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Summation by parts; Pure mathematics","score_opus":0.04859811476879995,"score_gpt":0.33369662222248314,"score_spread":0.2850985074536832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767625825","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06510199,0.0032683585,0.14073248,0.00685868,0.0035575507,0.000052995267,0.0008078745,0.00041106535,0.779209],"genre_scores_gemma":[0.71084565,0.0023041447,0.05658043,0.0034403417,0.001448804,0.00010483897,0.0006239506,0.00034487972,0.22430699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955124,0.000093322946,0.000021823324,0.00007721266,0.00018016489,0.00007617909],"domain_scores_gemma":[0.99954873,0.00011462765,0.00004041693,0.00006295938,0.00015920593,0.000074099575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008469905,0.0006110158,0.00046419777,0.0013415624,0.001806718,0.0022635886,0.00093687087,0.0008723322,0.015626837],"category_scores_gemma":[0.0021058687,0.0002560704,0.0005778593,0.0010896235,0.0017507193,0.004572093,0.0019716609,0.0024773967,0.0042559667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069288762,0.0000065759127,0.000056158515,0.000016506527,0.000002305775,0.000039156646,0.000051087187,0.000049580893,0.00029535813,0.9927095,0.0036534227,0.0031133133],"study_design_scores_gemma":[0.000007355928,0.000007360111,0.00017557769,0.000015325984,0.0000054135344,0.00018256772,0.000043628697,0.0011688457,0.00045936383,0.98358387,0.014342306,0.00000843589],"about_ca_topic_score_codex":0.0011894947,"about_ca_topic_score_gemma":0.0016186144,"teacher_disagreement_score":0.015626837,"about_ca_system_score_codex":0.001053916,"about_ca_system_score_gemma":0.0006550299,"threshold_uncertainty_score":0.05227703},"labels":[],"label_agreement":null},{"id":"W2767669220","doi":"","title":"On edge irregularity strength of products of certain families of graphs with path P 2 .","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Path (computing); Combinatorics; Telecommunications; Computer network; Computer science","score_opus":0.012602205499643753,"score_gpt":0.22493721961468327,"score_spread":0.21233501411503952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767669220","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9429934,0.0003957037,0.032290205,0.0008371525,0.00005783515,0.000027905999,0.0003391237,0.00014341487,0.022915436],"genre_scores_gemma":[0.9898867,0.00022208117,0.0066553513,0.000102982965,0.00007312189,0.00003688572,0.00028531646,0.000060045837,0.00267755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990243,0.0003339424,0.00005131566,0.00021581327,0.00021082422,0.00016385672],"domain_scores_gemma":[0.9839131,0.009620955,0.0025638733,0.0011700229,0.00087065756,0.0018613809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019640902,0.0004619655,0.0007393482,0.0024896907,0.0017990839,0.0023450057,0.0012015862,0.0012284091,0.006169109],"category_scores_gemma":[0.010755109,0.0007016677,0.00060974126,0.0013176767,0.0023055233,0.0041966424,0.0017767543,0.0015366641,0.00047102798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000381438,0.00010190657,0.012654648,0.00015531784,0.00006287677,0.00047509174,0.00079678127,0.009485529,0.0052864905,0.9521594,0.0041446895,0.014295791],"study_design_scores_gemma":[0.00006496366,0.00012407279,0.008373816,0.000071640505,0.00009190047,0.0012142302,0.0008150118,0.06948887,0.0031831027,0.91098386,0.005528772,0.000059900085],"about_ca_topic_score_codex":0.00068413385,"about_ca_topic_score_gemma":0.000727774,"teacher_disagreement_score":0.006169109,"about_ca_system_score_codex":0.0008984935,"about_ca_system_score_gemma":0.00040304908,"threshold_uncertainty_score":0.02063775},"labels":[],"label_agreement":null},{"id":"W2767693939","doi":"","title":"The correlation between the f -chromatic class of the g c -chromatic class of a simple graph.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Class (philosophy); Friendship graph; Combinatorics; Graph; Correlation; Simple (philosophy); Simple graph; Artificial intelligence; Computer science; Line graph; Geometry; Graph power","score_opus":0.015727609554272347,"score_gpt":0.24319274975857044,"score_spread":0.2274651402042981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767693939","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9090296,0.0013515564,0.04400907,0.0017131529,0.00016192843,0.000045088454,0.002109163,0.0003883446,0.041192204],"genre_scores_gemma":[0.9936247,0.00022295209,0.0033335525,0.00010830446,0.00010150557,0.00003105562,0.00044150624,0.00005643034,0.0020799118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875903,0.0002691998,0.000037200993,0.00045722566,0.00019796993,0.0002794162],"domain_scores_gemma":[0.9772406,0.014050772,0.0032131786,0.002059272,0.0014709539,0.0019651481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014214132,0.0003628778,0.00058998994,0.0036851102,0.0015994359,0.0034218666,0.001386371,0.0014224158,0.008925688],"category_scores_gemma":[0.017900296,0.00044889507,0.00038834146,0.0022019772,0.0030205946,0.0035606236,0.001252428,0.0018404232,0.0007163764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006530773,0.00015775191,0.05410082,0.00019413701,0.0000897698,0.00017857368,0.00050618243,0.015780631,0.00800198,0.87292886,0.0149599435,0.03244828],"study_design_scores_gemma":[0.00008688025,0.00013156576,0.07456804,0.00011837853,0.00009660061,0.00068599946,0.00049427187,0.11019854,0.006072685,0.7987406,0.0086634485,0.00014286819],"about_ca_topic_score_codex":0.004173737,"about_ca_topic_score_gemma":0.004395046,"teacher_disagreement_score":0.008925688,"about_ca_system_score_codex":0.0022490679,"about_ca_system_score_gemma":0.0011128432,"threshold_uncertainty_score":0.029859364},"labels":[],"label_agreement":null},{"id":"W2767695300","doi":"","title":"Some Properties of k-Order Gaussian Fibonacci And Lucas Numbers.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Mathematics; Lucas number; Lucas sequence; Pisano period; Fibonacci polynomials; Order (exchange); Combinatorics; Gaussian; Computational chemistry; Chemistry; Orthogonal polynomials","score_opus":0.014571413673154142,"score_gpt":0.26660497904327185,"score_spread":0.25203356537011773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767695300","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47742096,0.007090708,0.107414536,0.0039587244,0.0010215305,0.00011838015,0.001202545,0.0005335165,0.4012391],"genre_scores_gemma":[0.94965225,0.0016626248,0.017461983,0.000512563,0.00051277323,0.00008934071,0.00035731174,0.00009911247,0.029651904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961674,0.00007229347,0.000025988471,0.000057939003,0.00013687645,0.00009007371],"domain_scores_gemma":[0.99832815,0.0007306163,0.00027660784,0.0001391734,0.0003504432,0.00017504032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061884435,0.000486905,0.00049257284,0.002327654,0.0016032677,0.0030764767,0.00063161144,0.0009342653,0.009097344],"category_scores_gemma":[0.0047464115,0.00038206382,0.00056121603,0.0019189863,0.002467821,0.0029933485,0.0010289801,0.0012504405,0.0019017897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016549404,0.0000067887795,0.00020574403,0.000024740513,0.000002894389,0.00008207505,0.00016258613,0.00032289152,0.00045647178,0.9933509,0.0015825013,0.0037859504],"study_design_scores_gemma":[0.000011507951,0.000012849611,0.00050547835,0.000017168526,0.000005547126,0.00028621635,0.00011624593,0.0024482238,0.00039912658,0.9887518,0.00742812,0.000017763286],"about_ca_topic_score_codex":0.0017863716,"about_ca_topic_score_gemma":0.0018475289,"teacher_disagreement_score":0.009097344,"about_ca_system_score_codex":0.0015101575,"about_ca_system_score_gemma":0.0007898189,"threshold_uncertainty_score":0.030433655},"labels":[],"label_agreement":null},{"id":"W2767821037","doi":"","title":"Edge coloring of 1-planar graphs without intersecting triangles and chordal 5-cycles.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chordal graph; Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Edge coloring; Planar graph; Outerplanar graph; Planar; Pathwidth; Computer science; Graph; Telecommunications; Computer graphics (images); Line graph","score_opus":0.029177778095805466,"score_gpt":0.3063361373083527,"score_spread":0.2771583592125472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767821037","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6742799,0.0017066797,0.1382373,0.0012153361,0.00043860305,0.00015102523,0.0022076117,0.0011601632,0.18060322],"genre_scores_gemma":[0.91038424,0.00073026336,0.057626817,0.00035998938,0.00007592035,0.00006444726,0.0021799265,0.0002607243,0.028317673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996964,0.00006976935,0.000014855699,0.00006140663,0.000053263357,0.00010427445],"domain_scores_gemma":[0.9991109,0.0003627635,0.00014977902,0.00014362599,0.00012629581,0.000106672305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019168244,0.00038497004,0.0003344944,0.0006233063,0.00095497456,0.0013250741,0.00088140793,0.0007110254,0.010711448],"category_scores_gemma":[0.0015654467,0.0003730637,0.0003911011,0.0009110985,0.00063233904,0.0012274121,0.0008716244,0.00078285293,0.0015557115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086641783,0.000231616,0.005372202,0.0006583675,0.00007455932,0.0011524507,0.00073326845,0.030556621,0.027506093,0.7755991,0.03366707,0.12358218],"study_design_scores_gemma":[0.00013439807,0.00014215465,0.005115486,0.00012933716,0.00008529218,0.0013856062,0.0007155795,0.052230444,0.012451122,0.88630664,0.041251272,0.000052759795],"about_ca_topic_score_codex":0.0029615401,"about_ca_topic_score_gemma":0.004997286,"teacher_disagreement_score":0.010711448,"about_ca_system_score_codex":0.0006539626,"about_ca_system_score_gemma":0.0004802597,"threshold_uncertainty_score":0.03583342},"labels":[],"label_agreement":null},{"id":"W2767821434","doi":"","title":"Toughness for the existence of k-Hamiltonian [a, b]-factors.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Toughness; Pure mathematics; Combinatorics; Composite material; Materials science","score_opus":0.0199986193085299,"score_gpt":0.23854463028299733,"score_spread":0.21854601097446744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767821434","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5510592,0.0018041662,0.24300765,0.0055081975,0.0008772902,0.00015599847,0.0012419836,0.00054903084,0.19579642],"genre_scores_gemma":[0.9748496,0.00037039554,0.0120027345,0.0004700522,0.0002992188,0.00011021509,0.00029638727,0.00009791615,0.011503553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986891,0.00028582275,0.00007731531,0.0003399451,0.00027308846,0.00033475648],"domain_scores_gemma":[0.99048257,0.005447869,0.0011064355,0.00082410616,0.0007651534,0.0013738429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010951145,0.00048114336,0.00060194754,0.0021548644,0.0028611843,0.002856185,0.0009998935,0.0016017259,0.020745937],"category_scores_gemma":[0.010538634,0.00066061434,0.00080430775,0.0009709053,0.0039225235,0.005447166,0.0028803868,0.0027545122,0.0015852895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086713466,0.000026706432,0.00068610825,0.000063520965,0.000014810301,0.00011444563,0.00029944847,0.00091248757,0.0013901313,0.9902604,0.0028385003,0.003306753],"study_design_scores_gemma":[0.000021425958,0.000019293379,0.0006210769,0.000029737408,0.000010693701,0.00023217799,0.00017699442,0.005610219,0.0005364953,0.9900653,0.0026555937,0.000021125848],"about_ca_topic_score_codex":0.0013701381,"about_ca_topic_score_gemma":0.0011831175,"teacher_disagreement_score":0.020745937,"about_ca_system_score_codex":0.000929842,"about_ca_system_score_gemma":0.00068612664,"threshold_uncertainty_score":0.06940204},"labels":[],"label_agreement":null},{"id":"W2767886354","doi":"","title":"Rainbow connection of the join of two paths.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Join (topology); Connection (principal bundle); Rainbow; Mathematics; Combinatorics; Geometry; Optics; Physics","score_opus":0.0095216467594191,"score_gpt":0.21525377051835906,"score_spread":0.20573212375893996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767886354","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18962869,0.0008815377,0.5542721,0.0012221436,0.001413258,0.00022520407,0.001260197,0.001282505,0.24981442],"genre_scores_gemma":[0.80450636,0.0006996257,0.111029066,0.00037501854,0.00023936712,0.00017030488,0.00091494387,0.0003596856,0.08170557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999062,0.00017715574,0.00004468132,0.00030896158,0.00018550896,0.00022163654],"domain_scores_gemma":[0.99813014,0.0006328839,0.00027134366,0.00038520238,0.0002908753,0.00028957883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005448457,0.000456307,0.00046681068,0.0018519008,0.0025497454,0.002083757,0.00088915654,0.0014171773,0.030267335],"category_scores_gemma":[0.0040643103,0.00051569537,0.0006237568,0.001461927,0.0015576518,0.004496326,0.0038241092,0.0021026353,0.004557011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016185222,0.000036366648,0.0006383361,0.000099058925,0.00002722827,0.00066307746,0.00038599363,0.0012861321,0.005137468,0.9668114,0.004656625,0.020096505],"study_design_scores_gemma":[0.00003660744,0.00009326193,0.0008707559,0.000098128905,0.00004837512,0.0011768513,0.00055477343,0.010184391,0.0065817335,0.9328126,0.047494974,0.000047603018],"about_ca_topic_score_codex":0.0009898692,"about_ca_topic_score_gemma":0.0015918964,"teacher_disagreement_score":0.030267335,"about_ca_system_score_codex":0.00085411075,"about_ca_system_score_gemma":0.00086094043,"threshold_uncertainty_score":0.101254284},"labels":[],"label_agreement":null},{"id":"W2767932262","doi":"","title":"Every 1-planar graph without 4-cycles or adjacent 5-vertices is 5-colorable.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Wheel graph; Planar graph; Planar; Graph; Graph power; Computer science; Line graph; Computer graphics (images)","score_opus":0.034848686404975196,"score_gpt":0.3167078772517278,"score_spread":0.2818591908467526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767932262","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6016638,0.0011349432,0.09906428,0.003737062,0.00077169185,0.00025661988,0.006964763,0.0022566018,0.2841503],"genre_scores_gemma":[0.89667624,0.0011496614,0.04051598,0.0011041701,0.00012950835,0.00017790677,0.007143129,0.00037961444,0.052723743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952626,0.000048311522,0.000019018125,0.00015346608,0.00009163834,0.00016128787],"domain_scores_gemma":[0.9987576,0.0003678932,0.00030716282,0.00020195474,0.00017816853,0.00018728059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002430467,0.000931347,0.0007025004,0.00078769337,0.0016411251,0.0023060038,0.0013504119,0.0012616003,0.026129093],"category_scores_gemma":[0.0012441742,0.000673713,0.0010363829,0.0011574803,0.0015943842,0.0022275343,0.0014924457,0.0016892554,0.0037162546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001550243,0.000549284,0.0056224014,0.0020713052,0.00040364158,0.0022242535,0.00088469207,0.014045821,0.06261277,0.67249715,0.058973297,0.17856506],"study_design_scores_gemma":[0.00025671563,0.00034156116,0.010066214,0.00022005869,0.00038282995,0.0024336532,0.0006902663,0.008663855,0.03445115,0.82731396,0.11504451,0.00013521346],"about_ca_topic_score_codex":0.0020210517,"about_ca_topic_score_gemma":0.0032827302,"teacher_disagreement_score":0.026129093,"about_ca_system_score_codex":0.00082974456,"about_ca_system_score_gemma":0.00070902717,"threshold_uncertainty_score":0.08741051},"labels":[],"label_agreement":null},{"id":"W2767949670","doi":"","title":"Constructions of pairs of Tutte-equivalent graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.010910265649889409,"score_gpt":0.21733527907669373,"score_spread":0.2064250134268043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767949670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1216164,0.00035949063,0.60360336,0.00087998935,0.00067250844,0.00032565446,0.0011822053,0.001352325,0.2700081],"genre_scores_gemma":[0.78395694,0.00033209653,0.16777265,0.00052120606,0.00009072004,0.00036681854,0.0018137917,0.00056261546,0.04458312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852234,0.00054743805,0.00007532929,0.00025640076,0.0003047995,0.00029361606],"domain_scores_gemma":[0.9981675,0.0006495623,0.00015526362,0.00044595383,0.00035991403,0.00022173628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000658399,0.0005955583,0.0004054721,0.0015456157,0.002161715,0.0030292904,0.0011509949,0.0011823869,0.020858977],"category_scores_gemma":[0.004825562,0.00068412506,0.00088624936,0.0012523434,0.0013321273,0.0032083292,0.003765603,0.0021282113,0.0034328832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051738476,0.000038517952,0.00020386823,0.000046134963,0.000010250566,0.00021750393,0.00031877265,0.00074063306,0.0019093318,0.9857034,0.002790209,0.007969629],"study_design_scores_gemma":[0.000022523624,0.000043625594,0.00035522485,0.00007690413,0.00003695743,0.00059778185,0.00049612403,0.0077786255,0.006045169,0.95303625,0.031483468,0.000027376593],"about_ca_topic_score_codex":0.0007401659,"about_ca_topic_score_gemma":0.001408448,"teacher_disagreement_score":0.020858977,"about_ca_system_score_codex":0.000845442,"about_ca_system_score_gemma":0.0006740768,"threshold_uncertainty_score":0.06978023},"labels":[],"label_agreement":null},{"id":"W2767964017","doi":"","title":"Proof of a conjecture on the Catalan-Larcombe-French numbers.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Conjecture; Catalan; Catalan number; Combinatorics; Discrete mathematics; Humanities; Philosophy","score_opus":0.04024328046126173,"score_gpt":0.31781695488702627,"score_spread":0.2775736744257645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767964017","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.080315545,0.0066666016,0.1565035,0.06781567,0.008939208,0.00018954412,0.0020001444,0.001087035,0.6764828],"genre_scores_gemma":[0.8136865,0.0030785452,0.06804184,0.0077240323,0.002849764,0.00026443184,0.0014688667,0.0003528558,0.10253321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989231,0.00025187802,0.000042256495,0.00019783352,0.0004060221,0.00017884723],"domain_scores_gemma":[0.9965384,0.0018376918,0.00020757243,0.0003793702,0.0007351289,0.00030186493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019778484,0.001116405,0.00088780955,0.001677249,0.0019865553,0.0024793467,0.0014741794,0.0019001738,0.024960147],"category_scores_gemma":[0.008079422,0.000500226,0.0014315977,0.0012608104,0.004036446,0.005189147,0.0044272975,0.0047025816,0.003709344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049732273,0.00003901212,0.0002916849,0.00010892278,0.000021536982,0.00018615121,0.00038053477,0.0004668532,0.000636367,0.9650145,0.024444917,0.008359731],"study_design_scores_gemma":[0.000056389654,0.00003532569,0.0009396711,0.000071671406,0.000024720597,0.00038686284,0.00016581129,0.0019567662,0.00075134885,0.94273937,0.052845847,0.00002628073],"about_ca_topic_score_codex":0.0061574583,"about_ca_topic_score_gemma":0.005566297,"teacher_disagreement_score":0.024960147,"about_ca_system_score_codex":0.0023571094,"about_ca_system_score_gemma":0.0013964962,"threshold_uncertainty_score":0.08350003},"labels":[],"label_agreement":null},{"id":"W2768031719","doi":"","title":"The chromatic equivalence class of graph ψ n 3 (n-3, 1).","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Friendship graph; Class (philosophy); Combinatorics; Graph; Equivalence class (music); Equivalence (formal languages); Discrete mathematics; Line graph; Computer science; Voltage graph; Artificial intelligence","score_opus":0.010283100021472258,"score_gpt":0.2216079274647311,"score_spread":0.21132482744325884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768031719","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64117014,0.00030310234,0.029249223,0.0017052784,0.00032997696,0.00008326105,0.0014467417,0.00034416196,0.32536814],"genre_scores_gemma":[0.9700824,0.00017598682,0.004147586,0.00030686706,0.000085641295,0.00004252153,0.00094864244,0.00015614559,0.024054188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963415,0.000058046808,0.000009281406,0.000095680196,0.000070170296,0.00013265561],"domain_scores_gemma":[0.99911565,0.00031850752,0.0001464117,0.00011436293,0.0001172807,0.00018780782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035160378,0.0003261437,0.0002577979,0.0019180138,0.002287369,0.002800678,0.00070782716,0.00086289755,0.021670986],"category_scores_gemma":[0.0012633867,0.00017065801,0.0002895871,0.0008542357,0.0016522652,0.0016693933,0.0010276306,0.0013357832,0.0015797083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022572168,0.000071001356,0.0018809361,0.000047179743,0.0000102864005,0.00018421338,0.00041287858,0.001241351,0.0051722312,0.96409565,0.010241791,0.016416622],"study_design_scores_gemma":[0.00004564066,0.000050520855,0.00650797,0.000073673174,0.000018795556,0.00040873492,0.00071301195,0.01397241,0.0057921982,0.9357019,0.03667945,0.000035764642],"about_ca_topic_score_codex":0.0048012715,"about_ca_topic_score_gemma":0.0041384837,"teacher_disagreement_score":0.021670986,"about_ca_system_score_codex":0.0018245991,"about_ca_system_score_gemma":0.00075792,"threshold_uncertainty_score":0.07249671},"labels":[],"label_agreement":null},{"id":"W2789261530","doi":"","title":"Super Edge-Magicness of Stars Like Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Stars; Mathematics; Enhanced Data Rates for GSM Evolution; Astrophysics; Combinatorics; Computer science; Artificial intelligence; Physics","score_opus":0.011839178988571586,"score_gpt":0.22878261921499665,"score_spread":0.21694344022642506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789261530","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5776848,0.002245824,0.20736343,0.00601175,0.00042280825,0.00009732327,0.0016520146,0.00051335944,0.20400862],"genre_scores_gemma":[0.9455504,0.0007085255,0.03737891,0.00076017284,0.00024941075,0.00006803349,0.00095277803,0.00012314659,0.014208605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904877,0.00030982852,0.00005178796,0.00022587716,0.00022156048,0.00014216918],"domain_scores_gemma":[0.99464333,0.0031786247,0.00051904423,0.0006514832,0.00042582126,0.00058162276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010342761,0.00037270554,0.0006084449,0.0013910335,0.0016238141,0.0026071589,0.0012453751,0.0012693584,0.011140967],"category_scores_gemma":[0.0057500205,0.00055377505,0.00063638436,0.0014606947,0.0025454392,0.0056526083,0.0020025612,0.0022986708,0.00096176256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007911875,0.000029796623,0.0008649408,0.0000932839,0.000011051563,0.00006354291,0.00018630865,0.0016277732,0.0011881861,0.9825965,0.00463516,0.008624472],"study_design_scores_gemma":[0.000016872931,0.000011784676,0.0004772783,0.00002029732,0.000010278219,0.00014136886,0.00012418767,0.006568253,0.0006899306,0.9884775,0.0034535336,0.000008638882],"about_ca_topic_score_codex":0.0009785406,"about_ca_topic_score_gemma":0.0015083848,"teacher_disagreement_score":0.011140967,"about_ca_system_score_codex":0.00094828696,"about_ca_system_score_gemma":0.00058715197,"threshold_uncertainty_score":0.037270248},"labels":[],"label_agreement":null},{"id":"W2789389310","doi":"","title":"The 4-cube as a D-levels locally homogeneous graph.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Homogeneous; Cube (algebra); Graph; Combinatorics; Discrete mathematics","score_opus":0.006913546405824411,"score_gpt":0.20342517438081786,"score_spread":0.19651162797499344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789389310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30868587,0.0012725516,0.3635388,0.0024106458,0.00058313884,0.0001712273,0.0018406704,0.0008273235,0.32066974],"genre_scores_gemma":[0.8220384,0.0007643282,0.08070914,0.0008076673,0.00017244807,0.00016229732,0.0011245402,0.00023794633,0.09398319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973446,0.00007033452,0.0000111686095,0.00005498992,0.00006631463,0.000062715895],"domain_scores_gemma":[0.9996117,0.000113731396,0.000048545386,0.000064190746,0.00008551777,0.000076319455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016604512,0.0003225684,0.00035894854,0.00094958977,0.00099618,0.0017760188,0.00083810074,0.0006532522,0.017085085],"category_scores_gemma":[0.000714256,0.00026838688,0.00034364613,0.0008569664,0.0009609497,0.0016759479,0.0012655647,0.0009485508,0.0027863295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006581455,0.00002320293,0.000260724,0.000057603822,0.000013673406,0.00023140581,0.00013063746,0.0054504434,0.0037870014,0.9722812,0.0063900747,0.011308093],"study_design_scores_gemma":[0.000028754721,0.00003068687,0.000527762,0.000035471905,0.000018960232,0.00039536296,0.00032825788,0.046310946,0.0030701305,0.9211961,0.028033534,0.0000241155],"about_ca_topic_score_codex":0.0028496722,"about_ca_topic_score_gemma":0.003539433,"teacher_disagreement_score":0.017085085,"about_ca_system_score_codex":0.0008504409,"about_ca_system_score_gemma":0.0005023111,"threshold_uncertainty_score":0.05715525},"labels":[],"label_agreement":null},{"id":"W2789462440","doi":"","title":"Computing 3-total edge product cordial labeling of generalized Petersen graphs P(n, m).","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Product (mathematics); Computer science; Geometry; Telecommunications","score_opus":0.01425831397257204,"score_gpt":0.24097752672918335,"score_spread":0.2267192127566113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789462440","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7356045,0.00054810155,0.21409877,0.0012083531,0.00014273792,0.00011031677,0.0037653334,0.002300492,0.042221386],"genre_scores_gemma":[0.84593546,0.00023198652,0.13742451,0.0002513207,0.00005822396,0.000077245735,0.0045273155,0.00038646394,0.011107532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996438,0.00007615541,0.000019870478,0.000114381706,0.00006754154,0.000078129306],"domain_scores_gemma":[0.9987921,0.00046700734,0.00013510148,0.00034885172,0.00013442188,0.00012250766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038681016,0.00057373143,0.0005723122,0.0007547724,0.0008947716,0.0019992408,0.0009604686,0.0008707511,0.010661446],"category_scores_gemma":[0.0029166471,0.00031896785,0.0005832432,0.0012186511,0.00079644413,0.003019311,0.0011967409,0.00088318135,0.0016041868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011773005,0.00038462097,0.011784756,0.0010042432,0.00013771199,0.00048511292,0.001033722,0.12021559,0.018928694,0.50350845,0.04355351,0.2977864],"study_design_scores_gemma":[0.00007387883,0.00013825358,0.0030643968,0.00006036253,0.00006699139,0.00030886562,0.0004827639,0.24559191,0.0104718935,0.7236455,0.016058872,0.000036288617],"about_ca_topic_score_codex":0.002076627,"about_ca_topic_score_gemma":0.0058092177,"teacher_disagreement_score":0.010661446,"about_ca_system_score_codex":0.0012178128,"about_ca_system_score_gemma":0.0008783436,"threshold_uncertainty_score":0.035666108},"labels":[],"label_agreement":null},{"id":"W2789478589","doi":"","title":"A divided difference approach to Abel and Hagen-Rothe identities.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.04389888769077452,"score_gpt":0.3059893555830684,"score_spread":0.26209046789229384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789478589","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0459815,0.0063853576,0.33467153,0.009213242,0.002723211,0.000063746666,0.0004152617,0.00025036832,0.60029584],"genre_scores_gemma":[0.7222747,0.0024302455,0.11340373,0.0021693835,0.0016313897,0.00012586628,0.0003428593,0.00035915725,0.1572626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991015,0.00030073267,0.0000341035,0.00012425956,0.00032095393,0.00011849018],"domain_scores_gemma":[0.9991935,0.00026100452,0.00005822443,0.00015304629,0.00023786727,0.0000963068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001474583,0.00044175246,0.0006718993,0.0016094866,0.0019865108,0.0024116337,0.0015293995,0.0012120312,0.015485078],"category_scores_gemma":[0.004011421,0.000302584,0.000760389,0.0010733078,0.0029043688,0.008166918,0.0026601825,0.003620715,0.002593846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003690979,0.000004165299,0.000019129448,0.000004469063,0.0000011507161,0.000009337914,0.00004332042,0.0000635487,0.0000596641,0.9974807,0.0008637341,0.0014471178],"study_design_scores_gemma":[0.0000044070916,0.000004715169,0.00003867465,0.0000062731256,0.0000019808908,0.00003294113,0.00002896708,0.0010404764,0.00010034245,0.99345726,0.0052804947,0.0000034256734],"about_ca_topic_score_codex":0.0013651431,"about_ca_topic_score_gemma":0.0017469982,"teacher_disagreement_score":0.015485078,"about_ca_system_score_codex":0.0016323443,"about_ca_system_score_gemma":0.00089477503,"threshold_uncertainty_score":0.051802754},"labels":[],"label_agreement":null},{"id":"W2789570525","doi":"","title":"Simple 3-(q+1, 5, 3) designs admitting an automorphism group PSL(2, q) with q ≅ 1 (mod 4).","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mod; Mathematics; PSL; Simple (philosophy); Automorphism; Simple group; Automorphism group; Combinatorics; p-group; Discrete mathematics","score_opus":0.013461414608947434,"score_gpt":0.2171061277718867,"score_spread":0.20364471316293928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789570525","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7257142,0.00057747506,0.16824228,0.0007267634,0.00042641987,0.00022561224,0.00055863324,0.00083140115,0.10269723],"genre_scores_gemma":[0.94460404,0.00014091478,0.041983265,0.0002090619,0.00005349736,0.00007786612,0.0002128797,0.000060999602,0.012657489],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993197,0.00019957028,0.000056182726,0.00011831074,0.00017461865,0.00013156995],"domain_scores_gemma":[0.999102,0.00021721004,0.00020749486,0.00018560418,0.00016115377,0.0001265777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051002693,0.0004781263,0.0003570193,0.0007031163,0.0011135462,0.0017798819,0.0005077631,0.0011551473,0.009775786],"category_scores_gemma":[0.0014062171,0.0003792336,0.0005639876,0.0005695234,0.0011118498,0.0011710866,0.0009380401,0.0005384512,0.0021309573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084223493,0.00013405862,0.0028955697,0.0002627618,0.000084177525,0.0013892002,0.0005224611,0.005401715,0.047200046,0.9013122,0.0039060283,0.036049526],"study_design_scores_gemma":[0.00044577863,0.0007539601,0.0026787189,0.00016539112,0.0001471402,0.0024389375,0.0004984301,0.029730976,0.03872436,0.870848,0.05342861,0.0001395441],"about_ca_topic_score_codex":0.0004849348,"about_ca_topic_score_gemma":0.0011638929,"teacher_disagreement_score":0.009775786,"about_ca_system_score_codex":0.0005996476,"about_ca_system_score_gemma":0.00065263733,"threshold_uncertainty_score":0.03270328},"labels":[],"label_agreement":null},{"id":"W2789770672","doi":"","title":"Counting Rooted Non-separable Nearly Cubic Planar Maps.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Planar; Separable space; Combinatorics; Pure mathematics; Mathematical analysis; Computer graphics (images); Computer science","score_opus":0.010639028018055953,"score_gpt":0.2313903681729526,"score_spread":0.22075134015489667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789770672","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37690365,0.002015823,0.46355736,0.0037831503,0.0004463864,0.0002742102,0.0040650615,0.0024967387,0.14645773],"genre_scores_gemma":[0.8283859,0.00086930685,0.12599757,0.00042609466,0.0002140041,0.00017643532,0.0031088116,0.00056845223,0.040253483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984042,0.00022570882,0.000097347234,0.00026653474,0.00065790996,0.00034825294],"domain_scores_gemma":[0.9942674,0.0028281526,0.0005043256,0.0011058593,0.0008362654,0.00045796283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006887187,0.00062111096,0.0008693545,0.0016163222,0.0014587208,0.0036539028,0.0021759847,0.0013652717,0.014225193],"category_scores_gemma":[0.011839015,0.00048147162,0.0005556213,0.003110636,0.001319722,0.00687201,0.004341162,0.00215279,0.002525224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000266291,0.00009257452,0.0019186708,0.00050308544,0.000049520862,0.00021085872,0.0004356151,0.011235867,0.0043491777,0.87562424,0.018436207,0.08687791],"study_design_scores_gemma":[0.000030953815,0.000034051864,0.00077271566,0.00005328205,0.000038550428,0.0003504733,0.00027052016,0.046805345,0.0040134476,0.93222916,0.015376911,0.000024641493],"about_ca_topic_score_codex":0.0028506836,"about_ca_topic_score_gemma":0.004876845,"teacher_disagreement_score":0.014225193,"about_ca_system_score_codex":0.0018052377,"about_ca_system_score_gemma":0.0010670089,"threshold_uncertainty_score":0.04758799},"labels":[],"label_agreement":null},{"id":"W2789855541","doi":"","title":"New Results on Graceful Unicyclic Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.015875917161532,"score_gpt":0.24449616297779397,"score_spread":0.22862024581626197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789855541","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12178197,0.0105078025,0.303936,0.010749548,0.0021156531,0.00018857003,0.003302464,0.002662483,0.54475546],"genre_scores_gemma":[0.8140378,0.010436066,0.08348628,0.004565806,0.00271338,0.0003604608,0.003499447,0.001138094,0.07976279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987643,0.00024314762,0.00006486975,0.00033546818,0.00036879265,0.00022352625],"domain_scores_gemma":[0.9941262,0.0028763576,0.00063658325,0.0012161339,0.00041675035,0.00072787295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009444683,0.0012475329,0.00087171444,0.0031931188,0.0020795036,0.0037537783,0.0021062724,0.0012774805,0.01963445],"category_scores_gemma":[0.006036551,0.0006516361,0.00095248217,0.004367285,0.0031918548,0.008084876,0.0039709383,0.004278379,0.0030684785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053084852,0.000046579476,0.00043498474,0.00022850017,0.000014543765,0.00009184828,0.00019183925,0.0031845614,0.0012084914,0.9595721,0.015791822,0.01918167],"study_design_scores_gemma":[0.00001646508,0.000017890512,0.00033830013,0.00005280999,0.000021001457,0.00022083713,0.000121088415,0.0058507593,0.0008809433,0.96302885,0.02943192,0.000019085079],"about_ca_topic_score_codex":0.0016611852,"about_ca_topic_score_gemma":0.0026577485,"teacher_disagreement_score":0.01963445,"about_ca_system_score_codex":0.0022403095,"about_ca_system_score_gemma":0.00083987764,"threshold_uncertainty_score":0.06568378},"labels":[],"label_agreement":null},{"id":"W2789905876","doi":"","title":"Supereulerian Graphs with Few Independent Edges.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.047188162075298926,"score_gpt":0.3041342679701334,"score_spread":0.25694610589483446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789905876","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4407412,0.0011755765,0.20638677,0.0033401025,0.0004613884,0.00008298915,0.0008797627,0.000648269,0.34628403],"genre_scores_gemma":[0.9255296,0.0005081453,0.035106808,0.0007666849,0.00019554333,0.000082002836,0.0006636142,0.0001357682,0.037011877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993988,0.00018912404,0.00002711813,0.00014602783,0.00012412571,0.00011476852],"domain_scores_gemma":[0.997914,0.0009383303,0.00029941255,0.00035797586,0.00022265247,0.00026759045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059120386,0.00047383463,0.00058531924,0.0014948494,0.0015053828,0.0014864921,0.0010696306,0.0007931424,0.012500849],"category_scores_gemma":[0.002663621,0.00034501005,0.0005219342,0.0008548077,0.0019974636,0.0042888923,0.0020326318,0.001759256,0.0015000692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052183153,0.000022434151,0.00030980023,0.000043074946,0.000010990759,0.00013125926,0.00009319169,0.00072014844,0.001303131,0.9905874,0.0014823078,0.005244041],"study_design_scores_gemma":[0.000016104315,0.000011116794,0.00028106372,0.000018494176,0.000013309884,0.00017205201,0.00009633211,0.0037152232,0.0008530332,0.98900163,0.0058138845,0.000007834378],"about_ca_topic_score_codex":0.00059656217,"about_ca_topic_score_gemma":0.0014887176,"teacher_disagreement_score":0.012500849,"about_ca_system_score_codex":0.00076581317,"about_ca_system_score_gemma":0.0004074659,"threshold_uncertainty_score":0.041819513},"labels":[],"label_agreement":null},{"id":"W2789910199","doi":"","title":"Some New Upper Bounds on the Wiener and Edge Wiener Index of k-Connected Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Wiener index; Index (typography); Enhanced Data Rates for GSM Evolution; Combinatorics; Upper and lower bounds; Discrete mathematics; Graph; Mathematical analysis; Telecommunications; Computer science","score_opus":0.023855923244972863,"score_gpt":0.2704288971248488,"score_spread":0.24657297387987592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789910199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14122975,0.026665147,0.53963214,0.004261233,0.002213862,0.00015326704,0.0026030177,0.0016039681,0.28163767],"genre_scores_gemma":[0.78764874,0.015322137,0.14834757,0.002030946,0.004063586,0.00050503993,0.0022472553,0.0014317483,0.03840284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847597,0.00026045466,0.0001168096,0.00031478974,0.0005416324,0.00029043434],"domain_scores_gemma":[0.9877517,0.008059153,0.000871069,0.0010975655,0.0009607215,0.0012597081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026475377,0.002080729,0.0015710008,0.007753057,0.0017737858,0.005002182,0.0031067613,0.0021145632,0.013422154],"category_scores_gemma":[0.018640608,0.0010484168,0.0015541391,0.0051064785,0.0034573216,0.012734633,0.0050457637,0.0071653253,0.0037512095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015617028,0.00010182614,0.0013733322,0.0003765037,0.00006485952,0.00020141168,0.0005201944,0.0064903456,0.0052319397,0.94079554,0.0102985725,0.034389324],"study_design_scores_gemma":[0.000011992519,0.000029447861,0.0011454703,0.00011535255,0.000057550587,0.00023687592,0.00011900867,0.022556063,0.0024515153,0.96296614,0.010256803,0.000053757558],"about_ca_topic_score_codex":0.0006339399,"about_ca_topic_score_gemma":0.0013701258,"teacher_disagreement_score":0.013422154,"about_ca_system_score_codex":0.002260432,"about_ca_system_score_gemma":0.00058456714,"threshold_uncertainty_score":0.04490161},"labels":[],"label_agreement":null},{"id":"W2790008489","doi":"","title":"On the harmonic index of quasi-tree graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Tree (set theory); Harmonic; Combinatorics; Discrete mathematics; Acoustics; Computer science; Physics; World Wide Web","score_opus":0.02961291843188532,"score_gpt":0.2841706048881804,"score_spread":0.25455768645629506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790008489","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49728954,0.005916287,0.18472901,0.0054215263,0.0015499712,0.000074791365,0.00094455347,0.00031677936,0.30375767],"genre_scores_gemma":[0.9408734,0.0028372363,0.019457895,0.0007720072,0.0011667222,0.00008401853,0.0005174127,0.00026078426,0.03403056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954885,0.00011200126,0.000019678075,0.0000833066,0.00013649707,0.00009955597],"domain_scores_gemma":[0.99749655,0.0013355068,0.0003192168,0.0002147525,0.00026202272,0.00037175685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007540236,0.00040096545,0.0006245117,0.0030622433,0.001345358,0.0025896623,0.0012238899,0.0012251175,0.010541462],"category_scores_gemma":[0.0051918086,0.00029015035,0.00034090402,0.0017162896,0.0023380693,0.006286541,0.0020284487,0.0020278022,0.0017167332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022068583,0.0000117134305,0.00027871845,0.00002970746,0.000004032314,0.00002796651,0.00012595838,0.00073601,0.0006115681,0.9897759,0.0020415364,0.0063347877],"study_design_scores_gemma":[0.0000062782583,0.00000947487,0.0004243786,0.000019916313,0.0000057101693,0.000082146136,0.000113726266,0.0064872666,0.0002873596,0.98893654,0.003618607,0.0000086423015],"about_ca_topic_score_codex":0.001146834,"about_ca_topic_score_gemma":0.001292186,"teacher_disagreement_score":0.010541462,"about_ca_system_score_codex":0.0014061888,"about_ca_system_score_gemma":0.00039438138,"threshold_uncertainty_score":0.03526473},"labels":[],"label_agreement":null},{"id":"W2790066520","doi":"","title":"Some properties of bivariate Gaussian fibonacci and lucas P-Polynomials","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Fibonacci number; Bivariate analysis; Fibonacci polynomials; Lucas number; Orthogonal polynomials; Combinatorics; Classical orthogonal polynomials; Statistics","score_opus":0.014308584756118231,"score_gpt":0.256762550405782,"score_spread":0.24245396564966376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790066520","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6874743,0.003330739,0.15993078,0.0032367946,0.00042642016,0.00009185351,0.00079642376,0.0004185323,0.14429419],"genre_scores_gemma":[0.9697981,0.0013522689,0.012526406,0.00033253184,0.000533771,0.00006932307,0.000289301,0.00009783012,0.015000547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926895,0.00016148873,0.000045354147,0.00012498783,0.00022692197,0.00017226752],"domain_scores_gemma":[0.99660504,0.0018017748,0.00053380063,0.00021188216,0.00048041987,0.0003671145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015076301,0.0007840056,0.0009676693,0.0039288574,0.0024188776,0.0044143656,0.0010429939,0.0011909594,0.007343807],"category_scores_gemma":[0.008290152,0.00068001624,0.001011577,0.004179669,0.0038937146,0.0035806836,0.0016300482,0.0020771003,0.0010788902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024007446,0.000008814495,0.00030674337,0.000024222198,0.0000042658353,0.00009188191,0.00020470437,0.0006636331,0.00048534243,0.9941023,0.00079023367,0.0032939045],"study_design_scores_gemma":[0.000016100497,0.00001786754,0.0005868674,0.000017065953,0.000014857065,0.00030969523,0.0001642893,0.006372871,0.000432971,0.98828644,0.0037507182,0.000030145684],"about_ca_topic_score_codex":0.002581243,"about_ca_topic_score_gemma":0.0018641939,"teacher_disagreement_score":0.007343807,"about_ca_system_score_codex":0.0023578114,"about_ca_system_score_gemma":0.0013939788,"threshold_uncertainty_score":0.024567425},"labels":[],"label_agreement":null},{"id":"W2790192008","doi":"","title":"The characteristic polynomial of a graph operation and its applications.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Polynomial; Discrete mathematics; Mathematical analysis","score_opus":0.008158187389801013,"score_gpt":0.22947226256763553,"score_spread":0.22131407517783452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790192008","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2017748,0.040483348,0.3379451,0.013927559,0.0030857117,0.00010660994,0.0014453311,0.000954598,0.40027687],"genre_scores_gemma":[0.92926127,0.012033907,0.028986135,0.0005954759,0.0023569865,0.00007283093,0.00034916136,0.0001614696,0.026182665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993963,0.00013813727,0.00003416338,0.00014923031,0.00017501517,0.00010706444],"domain_scores_gemma":[0.9975739,0.001532197,0.0002418365,0.00020667547,0.00022658953,0.00021874417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087207626,0.00060781516,0.00078901777,0.0041662185,0.0010184097,0.0026671968,0.00078248564,0.00088955817,0.00753417],"category_scores_gemma":[0.00814868,0.00035956572,0.0005707363,0.005276642,0.0038656744,0.006187434,0.0022357341,0.00361058,0.0020358427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040867715,0.000022142158,0.0003671884,0.00008661345,0.000008087931,0.00007850362,0.00015640145,0.0018541375,0.0004222602,0.969409,0.0043997983,0.023155097],"study_design_scores_gemma":[0.000008992157,0.00001403712,0.00028543393,0.00002889105,0.000008791464,0.00023305883,0.00006769282,0.006318389,0.00034299583,0.9810924,0.011583862,0.000015452382],"about_ca_topic_score_codex":0.001851819,"about_ca_topic_score_gemma":0.0014947462,"teacher_disagreement_score":0.00753417,"about_ca_system_score_codex":0.0024026872,"about_ca_system_score_gemma":0.00095565536,"threshold_uncertainty_score":0.0252043},"labels":[],"label_agreement":null},{"id":"W2790338194","doi":"","title":"Combinatorics and n-color perfect partitions.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Algebraic combinatorics; Discrete mathematics","score_opus":0.032935125584033706,"score_gpt":0.31789617609413556,"score_spread":0.28496105051010184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790338194","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17608988,0.0072834175,0.117515706,0.0061853896,0.001397519,0.00006570237,0.0007818688,0.0003988843,0.6902816],"genre_scores_gemma":[0.9210465,0.0021124652,0.020686574,0.00093131035,0.0004999533,0.0000633984,0.0004245991,0.00012807966,0.05410716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931157,0.00022743472,0.000029310295,0.00011653689,0.00018827834,0.00012695172],"domain_scores_gemma":[0.9991097,0.00037208784,0.00011092544,0.00018678769,0.00011452717,0.000105975385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000684458,0.0005516473,0.00043781975,0.0013867485,0.0018846224,0.0027679894,0.0007027391,0.00082330965,0.010951734],"category_scores_gemma":[0.0021474885,0.0003680103,0.00065498246,0.0011442058,0.004420764,0.0053351726,0.002214939,0.0017845749,0.0015494033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007597461,0.00000414402,0.00005782895,0.000012622629,0.000002109638,0.000018466171,0.000054629458,0.00018558762,0.00010008703,0.9968906,0.0010839497,0.0015825216],"study_design_scores_gemma":[0.0000039254955,0.0000026952225,0.00009887333,0.000007972052,0.0000030523895,0.000052052223,0.000047069057,0.000474764,0.00007543071,0.9942983,0.0049328,0.0000030653594],"about_ca_topic_score_codex":0.0018914659,"about_ca_topic_score_gemma":0.00261444,"teacher_disagreement_score":0.010951734,"about_ca_system_score_codex":0.0015100195,"about_ca_system_score_gemma":0.0006816832,"threshold_uncertainty_score":0.036637187},"labels":[],"label_agreement":null},{"id":"W2790565012","doi":"","title":"Rank of the Hermitian-adjacency matrix of a mixed graph in terms of matching number.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hermitian matrix; Adjacency matrix; Rank (graph theory); Combinatorics; Matching (statistics); Graph; Matrix (chemical analysis); Discrete mathematics; Pure mathematics; Statistics","score_opus":0.01640992588016643,"score_gpt":0.29863082022717624,"score_spread":0.2822208943470098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790565012","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6547411,0.0019429764,0.26636428,0.0024029515,0.00048377283,0.000089377165,0.002072683,0.00083729276,0.07106557],"genre_scores_gemma":[0.96514535,0.00042963895,0.02123755,0.0002103829,0.0002856924,0.000075855605,0.00048364003,0.00014636757,0.011985571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993136,0.00023633036,0.000033220902,0.00013766043,0.0001671012,0.000112094895],"domain_scores_gemma":[0.9950728,0.0021873943,0.00091325666,0.00047790457,0.00066176,0.0006868951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093030545,0.0006573128,0.00053362444,0.0027339037,0.0006319474,0.0020091964,0.00114607,0.0008130749,0.011714084],"category_scores_gemma":[0.005337805,0.0003169916,0.0003188766,0.0010312309,0.0016225693,0.003257191,0.0010504053,0.0010328148,0.0015064634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019057798,0.00008853618,0.001908225,0.00013969337,0.000044658223,0.0002107272,0.00021070751,0.0072371163,0.0079035675,0.96064633,0.0064546973,0.014965231],"study_design_scores_gemma":[0.000023250057,0.000064431726,0.0024015987,0.000049861872,0.000026395335,0.0005183994,0.00016940534,0.09061428,0.003142553,0.89859384,0.0043327464,0.00006335614],"about_ca_topic_score_codex":0.00045731154,"about_ca_topic_score_gemma":0.000954498,"teacher_disagreement_score":0.011714084,"about_ca_system_score_codex":0.00056951446,"about_ca_system_score_gemma":0.0005270279,"threshold_uncertainty_score":0.03918749},"labels":[],"label_agreement":null},{"id":"W2790670964","doi":"","title":"P m ∪ P k -equicoverable paths and cycles.","year":2018,"lang":"es","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.006491125323273392,"score_gpt":0.20939201099883772,"score_spread":0.20290088567556433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790670964","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19358586,0.002101262,0.38746586,0.0024073827,0.0005684792,0.00030142433,0.0028109092,0.0010617952,0.409697],"genre_scores_gemma":[0.7878567,0.001276979,0.09179065,0.0007831641,0.00019649688,0.00027876004,0.0023242799,0.00026546651,0.11522753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999226,0.00013440104,0.00005095541,0.000244641,0.00014913872,0.00019483696],"domain_scores_gemma":[0.9984016,0.00055545534,0.00026088025,0.00028652418,0.00029342968,0.00020216135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003299806,0.0006516373,0.00044177735,0.0016191115,0.0017986319,0.0029279846,0.0011015439,0.0011483671,0.026194016],"category_scores_gemma":[0.00277858,0.00037496662,0.0004974519,0.00157461,0.0012153966,0.0035673091,0.0024685466,0.0015060173,0.0031506708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012798267,0.000063419306,0.00087266567,0.0001655101,0.00002615787,0.0004733454,0.00021300999,0.0021297191,0.0025493668,0.9439129,0.008291055,0.04117478],"study_design_scores_gemma":[0.000018150049,0.00003336962,0.0008722341,0.000073870826,0.000021699183,0.00085019483,0.000292813,0.0058303312,0.0033014242,0.9422156,0.046469536,0.000020872916],"about_ca_topic_score_codex":0.0016785733,"about_ca_topic_score_gemma":0.0026393146,"teacher_disagreement_score":0.026194016,"about_ca_system_score_codex":0.0010801696,"about_ca_system_score_gemma":0.0008567387,"threshold_uncertainty_score":0.08762771},"labels":[],"label_agreement":null},{"id":"W2790789623","doi":"","title":"Hereditary hemimorphy of {5, -4}-hemimorphic arc connected digraphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arc (geometry); Mathematics; Combinatorics; Geometry","score_opus":0.009607700113445904,"score_gpt":0.21796445153209554,"score_spread":0.20835675141864962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790789623","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8605686,0.00030969814,0.026124697,0.00039245398,0.0000634181,0.000038812355,0.0011143723,0.00024720456,0.11114085],"genre_scores_gemma":[0.9832999,0.00009521909,0.004814804,0.00007813492,0.000020611495,0.000020878992,0.00063927507,0.00002169362,0.011009568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997694,0.000047971367,0.0000148077015,0.00006501925,0.000038985945,0.0000639068],"domain_scores_gemma":[0.99923337,0.00036166437,0.00014267454,0.000087115106,0.0000637822,0.000111429574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012776941,0.00021454401,0.00022281348,0.0007647492,0.0011885546,0.0013319898,0.00038988158,0.00044568934,0.009917203],"category_scores_gemma":[0.00069730333,0.00028323912,0.00029617926,0.00068729743,0.00081889087,0.00088991894,0.000655359,0.0005188551,0.0006861587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000173036,0.000053528034,0.00243181,0.00012341888,0.000036464953,0.0010742476,0.00058174855,0.0034166113,0.0075399177,0.96508384,0.0038071007,0.01567836],"study_design_scores_gemma":[0.000082409824,0.0000807209,0.006189627,0.00006380666,0.000088471286,0.0016383595,0.0008852016,0.015612367,0.0078024245,0.9462303,0.021286337,0.000039818533],"about_ca_topic_score_codex":0.0013228215,"about_ca_topic_score_gemma":0.0024830406,"teacher_disagreement_score":0.009917203,"about_ca_system_score_codex":0.00065581914,"about_ca_system_score_gemma":0.00036991164,"threshold_uncertainty_score":0.033176363},"labels":[],"label_agreement":null},{"id":"W2791062024","doi":"","title":"Digraph Isomorpshism Using Subdigraph Equivalent Vertices And Degree Pair Association.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Digraph; Association (psychology); Mathematics; Degree (music); Combinatorics; Psychology; Physics; Acoustics","score_opus":0.04405361338829382,"score_gpt":0.2994501956152897,"score_spread":0.25539658222699585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791062024","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19971558,0.00045678893,0.625079,0.0014270144,0.00065345503,0.00030892476,0.0010791782,0.0018948396,0.16938531],"genre_scores_gemma":[0.69865865,0.0005330492,0.24023652,0.0007930769,0.0002916407,0.00029181235,0.0019144266,0.00043159243,0.05684916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994462,0.00011939885,0.000029144094,0.00019799489,0.00010963523,0.00009763935],"domain_scores_gemma":[0.9991179,0.00028220096,0.000067708206,0.0003053017,0.00010605269,0.0001208974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000375009,0.00043850412,0.0006894837,0.0009446132,0.0014049634,0.0017633161,0.0011872527,0.00081935845,0.012085727],"category_scores_gemma":[0.0018449788,0.0003983376,0.00083766883,0.0010143312,0.0010211237,0.0021901776,0.0027314865,0.0021071616,0.0022387188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016816467,0.00019907886,0.0007780001,0.0001698436,0.000039168666,0.00041768933,0.00037544692,0.0045092897,0.005653619,0.8996427,0.011016357,0.07703052],"study_design_scores_gemma":[0.000058610876,0.00006900644,0.0006448719,0.000046174046,0.0000752888,0.00052480993,0.0002267436,0.028165849,0.0039577633,0.940911,0.025296664,0.000023208735],"about_ca_topic_score_codex":0.00092072587,"about_ca_topic_score_gemma":0.0017913184,"teacher_disagreement_score":0.012085727,"about_ca_system_score_codex":0.00066130655,"about_ca_system_score_gemma":0.0007243159,"threshold_uncertainty_score":0.040430844},"labels":[],"label_agreement":null},{"id":"W2791098685","doi":"","title":"A Note On The Annihilating-Ideal Graph Of Commutative Rings.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Commutative property; Ideal (ethics); Commutative ring; Graph; Pure mathematics; Discrete mathematics; Combinatorics; Law; Political science","score_opus":0.030836028118404895,"score_gpt":0.2930012475301528,"score_spread":0.26216521941174786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791098685","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063499086,0.03254176,0.22259769,0.017505594,0.010420674,0.00008937614,0.0010801367,0.0011491287,0.6511165],"genre_scores_gemma":[0.72904474,0.02673437,0.14030315,0.008290384,0.00868828,0.00012778644,0.0009333729,0.00076355174,0.085114405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994609,0.0001913618,0.000029759593,0.00011507365,0.0001367626,0.000066163964],"domain_scores_gemma":[0.99830544,0.001030811,0.00011916832,0.000183954,0.00017369307,0.00018694978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011295371,0.0007394792,0.0008477386,0.0023195182,0.0022036016,0.0026337889,0.0013192627,0.0008954872,0.010511704],"category_scores_gemma":[0.002533366,0.00051374245,0.0009220858,0.0023207797,0.004563141,0.007946665,0.0021849368,0.0035817828,0.0018751445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014975912,0.000013200224,0.00015107519,0.00006633606,0.000007740321,0.000117646145,0.0001915906,0.00024268174,0.0004889599,0.98343277,0.008995708,0.0062772557],"study_design_scores_gemma":[0.0000036254685,0.000013404177,0.00034923747,0.000016843385,0.000008723021,0.00015684415,0.00008310474,0.0006154811,0.00024029709,0.97453475,0.023965714,0.000012133744],"about_ca_topic_score_codex":0.0017984761,"about_ca_topic_score_gemma":0.003564739,"teacher_disagreement_score":0.010511704,"about_ca_system_score_codex":0.00093672186,"about_ca_system_score_gemma":0.0004920067,"threshold_uncertainty_score":0.03516513},"labels":[],"label_agreement":null},{"id":"W2791203798","doi":"","title":"On k-Ramsey Numbers of Unicyclic-Star Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Star (game theory); Ramsey's theorem; Graph; Mathematical analysis","score_opus":0.019254972252138867,"score_gpt":0.2860173511421951,"score_spread":0.2667623788900563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791203798","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6419961,0.0038566056,0.08437265,0.0037405568,0.0004415815,0.000082622646,0.0007972594,0.00040868425,0.2643039],"genre_scores_gemma":[0.9776589,0.0013166787,0.009117398,0.0003249958,0.00022495791,0.00009907616,0.0002254033,0.00006806834,0.010964567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990595,0.00029207612,0.000059251608,0.00018149156,0.00022512751,0.00018259676],"domain_scores_gemma":[0.9936488,0.0038979014,0.0008308613,0.00033078343,0.0005312897,0.0007603511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011929702,0.00053968275,0.0007307561,0.0036367208,0.0020183837,0.0032095264,0.0013097179,0.001001878,0.0074105794],"category_scores_gemma":[0.008400647,0.0005067828,0.00048130157,0.00220047,0.0037391966,0.008399086,0.0027639554,0.0019666746,0.0010934961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039721534,0.000019695733,0.00036863863,0.000061169085,0.000005831372,0.000046966834,0.00030011122,0.0010609333,0.0003932837,0.9913283,0.0016124061,0.0047629443],"study_design_scores_gemma":[0.000009182077,0.000009670121,0.00029865783,0.000034972345,0.000006323858,0.000107775726,0.000160469,0.0038693878,0.00028254604,0.9929733,0.0022358822,0.000011859248],"about_ca_topic_score_codex":0.0013518429,"about_ca_topic_score_gemma":0.0017468003,"teacher_disagreement_score":0.0074105794,"about_ca_system_score_codex":0.0018906441,"about_ca_system_score_gemma":0.0006612697,"threshold_uncertainty_score":0.024790883},"labels":[],"label_agreement":null},{"id":"W2791220835","doi":"","title":"Sums Of Products Of Euler Numbers.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Euler's formula; Mathematical analysis","score_opus":0.03673438472784665,"score_gpt":0.3143565988776163,"score_spread":0.2776222141497696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791220835","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12321606,0.0076799775,0.35150552,0.001985098,0.0036418498,0.00008678312,0.0012551699,0.00075555866,0.50987405],"genre_scores_gemma":[0.74171406,0.0045273956,0.09434967,0.0009287615,0.0020909754,0.0001556192,0.0011910837,0.0007310575,0.1543114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998664,0.00027859223,0.00010963062,0.0002922176,0.0004933618,0.00016220553],"domain_scores_gemma":[0.99838984,0.00053342164,0.00020940791,0.00025176682,0.0004221801,0.00019350948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010674024,0.0010156671,0.00089424534,0.0031383962,0.0017605074,0.0043987385,0.0009885507,0.0006565452,0.014853382],"category_scores_gemma":[0.004326249,0.00058024214,0.0008370362,0.001561483,0.0025858078,0.00816711,0.0039699464,0.0024076228,0.005226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019842419,0.000010748435,0.00021547524,0.000050628576,0.0000115073935,0.00006856863,0.00013661414,0.00020390304,0.00059778796,0.9859168,0.002569267,0.01019894],"study_design_scores_gemma":[0.0000052197033,0.00001282141,0.00026900778,0.000035626545,0.00001621927,0.00032635298,0.00007946405,0.0011631094,0.0008042176,0.97337455,0.02389982,0.000013585261],"about_ca_topic_score_codex":0.0003328942,"about_ca_topic_score_gemma":0.00066561415,"teacher_disagreement_score":0.014853382,"about_ca_system_score_codex":0.0008023691,"about_ca_system_score_gemma":0.0005523862,"threshold_uncertainty_score":0.04968953},"labels":[],"label_agreement":null},{"id":"W2791423452","doi":"","title":"On the Linear 2-Arboricity of Planar Graphs without Intersecting 3-Cycles or Intersecting 4-Cycles.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arboricity; Mathematics; Planar; Planar graph; Combinatorics; Graph; Computer science","score_opus":0.03236417449053471,"score_gpt":0.3100225160815461,"score_spread":0.2776583415910114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791423452","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67901903,0.002983135,0.070655786,0.0034260459,0.00038138212,0.000105690124,0.0014626363,0.0003596485,0.24160655],"genre_scores_gemma":[0.95927525,0.0025090163,0.014489021,0.00076906156,0.0005050309,0.00008305302,0.0014673059,0.00015523628,0.020746952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968445,0.00008691588,0.000018865821,0.0000660848,0.000065868226,0.00007779581],"domain_scores_gemma":[0.99782157,0.0013849144,0.0003458892,0.0001386046,0.00015811822,0.00015098759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034816551,0.00045481816,0.000398405,0.0012470845,0.00078923814,0.0014210206,0.00083778345,0.0008838127,0.011128837],"category_scores_gemma":[0.0029695074,0.00040517692,0.00049330137,0.0013864738,0.0016714361,0.003135554,0.0013160245,0.0015345322,0.0016931639],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044738554,0.00014593515,0.0041807555,0.00049629377,0.000061572886,0.0008285498,0.00083145004,0.017217135,0.006993647,0.901568,0.016358778,0.0508705],"study_design_scores_gemma":[0.00004800349,0.000081354636,0.0017860483,0.000072806986,0.000035259105,0.00043563984,0.00034857335,0.02063283,0.0015687619,0.96779424,0.007170322,0.000026280977],"about_ca_topic_score_codex":0.0015302765,"about_ca_topic_score_gemma":0.0022171028,"teacher_disagreement_score":0.011128837,"about_ca_system_score_codex":0.0006212205,"about_ca_system_score_gemma":0.0003196397,"threshold_uncertainty_score":0.037229717},"labels":[],"label_agreement":null},{"id":"W2791605040","doi":"","title":"Changing and unchanging the diameter of a Mycielski graph.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Business Strategy and Innovation","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.015208723872727297,"score_gpt":0.21478418413774272,"score_spread":0.19957546026501544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791605040","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6708669,0.0024328858,0.21070434,0.0034310743,0.0006244906,0.00007554679,0.0015021317,0.00090555614,0.109457105],"genre_scores_gemma":[0.9600996,0.000625478,0.029475646,0.0003091941,0.00013965953,0.000052521675,0.00039938558,0.00027727772,0.00862126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993267,0.00022366003,0.000027413054,0.00016915573,0.000115524934,0.00013758586],"domain_scores_gemma":[0.9900894,0.006529724,0.00071334024,0.00095422077,0.00061973714,0.0010934343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001243802,0.000373961,0.0006108886,0.0020223323,0.0014879417,0.0024324153,0.0013036248,0.0010937309,0.008252777],"category_scores_gemma":[0.015620258,0.00049868773,0.0005740758,0.0011486833,0.0020792168,0.005192481,0.0017148147,0.0014157372,0.00075457856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032093946,0.00006127077,0.0019554326,0.00011541883,0.000031969143,0.00011526801,0.00031628425,0.022197647,0.00482226,0.94623864,0.0077491086,0.016075717],"study_design_scores_gemma":[0.00006805875,0.000060444327,0.0023435135,0.000046120116,0.000057081677,0.0002590925,0.0003859372,0.0680602,0.0018466027,0.9147204,0.012113649,0.000038922164],"about_ca_topic_score_codex":0.0026867571,"about_ca_topic_score_gemma":0.0037934268,"teacher_disagreement_score":0.008252777,"about_ca_system_score_codex":0.0017559396,"about_ca_system_score_gemma":0.000614532,"threshold_uncertainty_score":0.027608275},"labels":[],"label_agreement":null},{"id":"W2791620683","doi":"","title":"Two-dimensional projective linear group and flag-transitive 4-(v, k, 2) Designs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Flag (linear algebra); Mathematics; Projective test; Transitive relation; Projective linear group; Combinatorics; Group (periodic table); Classical group; General linear group; Pure mathematics; Discrete mathematics; Projective space; Collineation; Algebra over a field; Symmetric group; Lie group; Physics","score_opus":0.010761320979537196,"score_gpt":0.2217054107169741,"score_spread":0.21094408973743692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791620683","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63942313,0.00080251385,0.1483655,0.0016199,0.0004286082,0.00011125529,0.0006538225,0.0005511642,0.20804416],"genre_scores_gemma":[0.96339095,0.00016974437,0.014633388,0.00015961054,0.000060499056,0.000047942565,0.00020678811,0.000037010916,0.021293994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993893,0.00020629373,0.000031793537,0.00007557134,0.0001278327,0.00016918487],"domain_scores_gemma":[0.9991211,0.00024756277,0.00022359566,0.00016421726,0.000117016454,0.00012653098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004542373,0.00041283885,0.0002652189,0.00097255455,0.00097286695,0.0016391963,0.00052275445,0.0007197669,0.008475352],"category_scores_gemma":[0.0015047358,0.00026524597,0.00034384767,0.0006499463,0.0012251011,0.0015598848,0.0012154527,0.0006850359,0.0013246218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009131215,0.000026965703,0.00038651205,0.000036072328,0.000010282398,0.0002149343,0.00018366975,0.0021757658,0.0020588464,0.98492277,0.0020780684,0.007814641],"study_design_scores_gemma":[0.000051696006,0.00009333454,0.00059179653,0.00003700386,0.000016987842,0.000450593,0.00021960653,0.013997393,0.0030704048,0.9670456,0.014388968,0.00003655016],"about_ca_topic_score_codex":0.001086762,"about_ca_topic_score_gemma":0.0017405107,"teacher_disagreement_score":0.008475352,"about_ca_system_score_codex":0.00075865415,"about_ca_system_score_gemma":0.0006463052,"threshold_uncertainty_score":0.028352916},"labels":[],"label_agreement":null},{"id":"W2791699563","doi":"","title":"The lower bound of second-order nonlinearity of cubic functions.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Order (exchange); Nonlinear system; Mathematical analysis; Applied mathematics; Physics; Quantum mechanics","score_opus":0.022019048358897904,"score_gpt":0.27219874373091046,"score_spread":0.25017969537201257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791699563","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25383753,0.010266386,0.15541612,0.019722305,0.0020139366,0.00006768152,0.0013311786,0.001035867,0.55630904],"genre_scores_gemma":[0.9350565,0.0022340305,0.01111673,0.0014075827,0.0012001536,0.00009832237,0.00046898285,0.0002871463,0.048130512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982779,0.0003270016,0.000049145172,0.00025726613,0.0006123634,0.00047629027],"domain_scores_gemma":[0.98968506,0.0067058606,0.0005049684,0.0012039675,0.00097634905,0.0009238295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018273062,0.00089894346,0.0012664077,0.0027451473,0.0027487013,0.0041802386,0.0022074287,0.0023206319,0.021678124],"category_scores_gemma":[0.015397522,0.0005197414,0.0008975921,0.001661886,0.0046949596,0.012306105,0.0046936604,0.0067192586,0.004225614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086649685,0.000025170559,0.00053791574,0.00011884453,0.000011954082,0.00008812786,0.00012895482,0.0013874173,0.0007933539,0.9853011,0.004984926,0.006535724],"study_design_scores_gemma":[0.000012674005,0.000022394952,0.0005319186,0.00004840369,0.000016960468,0.00021208302,0.000053901647,0.01071969,0.0011694027,0.98070097,0.0064849053,0.00002664399],"about_ca_topic_score_codex":0.0019991419,"about_ca_topic_score_gemma":0.0026925707,"teacher_disagreement_score":0.021678124,"about_ca_system_score_codex":0.0025524464,"about_ca_system_score_gemma":0.0016308755,"threshold_uncertainty_score":0.072520554},"labels":[],"label_agreement":null},{"id":"W2791741897","doi":"","title":"A Note on Harmonic Index and Coloring Number of a Graph.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Edge coloring; Index (typography); Graph coloring; Fractional coloring; Graph; Combinatorics; Discrete mathematics; Graph power; Line graph; Computer science","score_opus":0.013715713843865659,"score_gpt":0.2534742253731617,"score_spread":0.23975851152929606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791741897","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063587286,0.03161,0.21356484,0.025931442,0.025773833,0.00013661449,0.0023808023,0.0011512808,0.63586384],"genre_scores_gemma":[0.714481,0.0209188,0.1412292,0.0067315777,0.018527161,0.00029292496,0.0017313862,0.001220075,0.09486784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987606,0.00025754204,0.00007896205,0.00039788478,0.00038028942,0.00012472522],"domain_scores_gemma":[0.9945555,0.0036494567,0.00027271133,0.00070729933,0.00041350664,0.0004015545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011244018,0.00092811463,0.0012042021,0.003381369,0.0017936195,0.0032105427,0.0024705187,0.0017183569,0.015909033],"category_scores_gemma":[0.009587196,0.00059315865,0.0007436075,0.0036524346,0.0037056631,0.008759081,0.003289363,0.0061601317,0.002966406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013061933,0.00005544654,0.00091610564,0.0002744977,0.000024576933,0.00019709785,0.00022655774,0.0022505342,0.0022539,0.90521395,0.049451206,0.039005395],"study_design_scores_gemma":[0.0000091462225,0.000029341607,0.0010374798,0.00005556023,0.000022142864,0.00024427043,0.00010791638,0.005062787,0.0008404524,0.94597006,0.046585646,0.00003532297],"about_ca_topic_score_codex":0.002579633,"about_ca_topic_score_gemma":0.003781969,"teacher_disagreement_score":0.015909033,"about_ca_system_score_codex":0.0022566197,"about_ca_system_score_gemma":0.0008160006,"threshold_uncertainty_score":0.053221047},"labels":[],"label_agreement":null},{"id":"W2791992292","doi":"","title":"Changhee-Genocchi Numbers And Their Applications.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.007936620081632872,"score_gpt":0.2523812774833989,"score_spread":0.24444465740176602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791992292","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045219902,0.093539275,0.09848325,0.022749519,0.008164626,0.000056244575,0.0006224306,0.0003712774,0.7307935],"genre_scores_gemma":[0.75124484,0.026617777,0.065387666,0.0054148454,0.007123164,0.00020267518,0.00043882988,0.000233401,0.14333685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942243,0.00020487382,0.000026076757,0.00009208549,0.00017458998,0.0000799511],"domain_scores_gemma":[0.99851125,0.0007925796,0.00012298234,0.00014379271,0.00026348844,0.00016586372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011258963,0.0006933536,0.0007467029,0.00410033,0.0018691559,0.0020916078,0.0007381039,0.0013113156,0.013872851],"category_scores_gemma":[0.005510923,0.0002772562,0.00048743805,0.0029717928,0.0035025247,0.00395348,0.0023300457,0.0036947343,0.002492582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065911536,0.000004416347,0.00008531112,0.000024025296,0.0000027145088,0.000020010617,0.000057970883,0.00016270744,0.00005299154,0.98876333,0.005086228,0.0057337373],"study_design_scores_gemma":[0.000004074458,0.000004943117,0.00019971636,0.000027042955,0.0000033666336,0.00008165035,0.00003955808,0.0010997733,0.00007100884,0.9738563,0.024606101,0.000006535651],"about_ca_topic_score_codex":0.0020643785,"about_ca_topic_score_gemma":0.0026285232,"teacher_disagreement_score":0.013872851,"about_ca_system_score_codex":0.0019458911,"about_ca_system_score_gemma":0.00074745255,"threshold_uncertainty_score":0.04640937},"labels":[],"label_agreement":null},{"id":"W2792086409","doi":"","title":"The Lights Out Game on Subdivided Caterpillars.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Mathematical economics","score_opus":0.014639330624352824,"score_gpt":0.2523799178152956,"score_spread":0.2377405871909428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792086409","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22942361,0.0019152161,0.47696784,0.00403387,0.0010333917,0.00019568604,0.0010509966,0.002625519,0.28275394],"genre_scores_gemma":[0.79142946,0.0006808777,0.11805597,0.0006895222,0.00019948663,0.00012249553,0.0008340009,0.0005089401,0.08747927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996196,0.00010299658,0.000014427867,0.00006657287,0.00010136776,0.00009499772],"domain_scores_gemma":[0.9990909,0.00051604793,0.00004045725,0.00016564298,0.000057778725,0.00012909924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003810448,0.00057253515,0.00068734825,0.000530395,0.0012731174,0.0017416651,0.0013348496,0.0012514527,0.020424822],"category_scores_gemma":[0.0030100986,0.000305346,0.00048044673,0.0006761157,0.0014512886,0.0033438492,0.002799308,0.0013331097,0.0026319658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013738134,0.0001430531,0.00092775485,0.0001839908,0.00006308233,0.00063672813,0.00045216948,0.04980679,0.0088392645,0.7671123,0.055334847,0.11512624],"study_design_scores_gemma":[0.00013565988,0.00018236692,0.0007805161,0.000100375815,0.00002849232,0.0003098851,0.00045927754,0.1885235,0.0057732975,0.75566334,0.04799518,0.000048222482],"about_ca_topic_score_codex":0.0025587257,"about_ca_topic_score_gemma":0.004293882,"teacher_disagreement_score":0.020424822,"about_ca_system_score_codex":0.0008339408,"about_ca_system_score_gemma":0.0004741001,"threshold_uncertainty_score":0.068327785},"labels":[],"label_agreement":null},{"id":"W2792110981","doi":"","title":"Cayley graphs of a group of order 6n.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cayley graph; Mathematics; Order (exchange); Group (periodic table); Combinatorics; Pure mathematics; Graph; Chemistry; Business","score_opus":0.005739330684666146,"score_gpt":0.19573053425136738,"score_spread":0.18999120356670124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792110981","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56443655,0.0011992609,0.1349527,0.0022024205,0.0008663487,0.00017419475,0.0015087933,0.0005572494,0.2941025],"genre_scores_gemma":[0.9042345,0.0005648587,0.027586501,0.00048540026,0.00023760417,0.00008181598,0.00096065784,0.000081544276,0.06576704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974066,0.00006165323,0.000011352634,0.00005642724,0.00007245007,0.00005743277],"domain_scores_gemma":[0.9991744,0.00024325094,0.00017194498,0.00010496902,0.00014913258,0.00015619036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019386053,0.00035274634,0.0002568029,0.001087978,0.000961681,0.0012481182,0.0005282754,0.00051671534,0.014151408],"category_scores_gemma":[0.0012271187,0.00020247452,0.0003008899,0.00059143576,0.0007996514,0.0012449536,0.0007899578,0.0007851237,0.0014034162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007148138,0.000033776167,0.00050376594,0.000051620224,0.000013303652,0.00034029732,0.00022002595,0.0023369722,0.0038921202,0.9751209,0.00422839,0.013187339],"study_design_scores_gemma":[0.000024374993,0.00004369456,0.0009482064,0.000028412314,0.000011914935,0.00037315048,0.00020228219,0.011456467,0.0026400534,0.9628756,0.021373942,0.000021852999],"about_ca_topic_score_codex":0.0018660714,"about_ca_topic_score_gemma":0.003631367,"teacher_disagreement_score":0.014151408,"about_ca_system_score_codex":0.0007749972,"about_ca_system_score_gemma":0.00070823095,"threshold_uncertainty_score":0.04734111},"labels":[],"label_agreement":null},{"id":"W2792164456","doi":"","title":"New Families Of Generating Functions For q-Fibonacci And The Related Polynomials.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Mathematics; Fibonacci polynomials; Combinatorics; Discrete mathematics; Pure mathematics; Difference polynomials; Orthogonal polynomials","score_opus":0.024947340502014942,"score_gpt":0.29301137791783627,"score_spread":0.2680640374158213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792164456","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21103406,0.004807922,0.42719424,0.0039110873,0.002047018,0.00023087137,0.0010270108,0.0007823644,0.34896547],"genre_scores_gemma":[0.84911627,0.0025363404,0.072210535,0.0011128711,0.0013248366,0.0004426231,0.0007131999,0.00034727974,0.07219611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993574,0.00017682357,0.000028802215,0.00007689225,0.0002387716,0.00012135256],"domain_scores_gemma":[0.9984394,0.0007228449,0.00017187075,0.0001600857,0.00030962858,0.00019628707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013408375,0.00071760156,0.0005129229,0.0035255286,0.0019004571,0.002599983,0.0010877148,0.0013150733,0.010899854],"category_scores_gemma":[0.0059124986,0.00048852514,0.0009799569,0.001523827,0.0019037692,0.0032130843,0.0015500202,0.0020832433,0.002438894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066766047,0.0000068991667,0.00008827355,0.000013193858,0.0000017258069,0.0000532531,0.00008834395,0.0002196346,0.0002166111,0.9939394,0.0015759207,0.003790213],"study_design_scores_gemma":[0.000011989483,0.000009428278,0.00018193225,0.00002101388,0.0000054337575,0.00039417454,0.00007481109,0.0057963342,0.00034860137,0.98393077,0.009209047,0.000016461769],"about_ca_topic_score_codex":0.00068785244,"about_ca_topic_score_gemma":0.00088915264,"teacher_disagreement_score":0.010899854,"about_ca_system_score_codex":0.0011017412,"about_ca_system_score_gemma":0.00070659345,"threshold_uncertainty_score":0.03646362},"labels":[],"label_agreement":null},{"id":"W2792222475","doi":"","title":"Sporadic simple groups and block-transitive symmetric designs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Transitive relation; Mathematics; Simple (philosophy); Block (permutation group theory); Combinatorics; Pure mathematics; Epistemology","score_opus":0.009348833800893632,"score_gpt":0.20148729052887798,"score_spread":0.19213845672798435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792222475","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3196812,0.00203428,0.38837957,0.0017654126,0.0007361567,0.00015279022,0.0005158426,0.00043637186,0.2862984],"genre_scores_gemma":[0.9255323,0.0006378466,0.024965845,0.00027281986,0.0002715381,0.00010148012,0.0002352231,0.000046095465,0.047937006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947697,0.0001616097,0.00003225727,0.000094187926,0.00014414443,0.00009074912],"domain_scores_gemma":[0.9989648,0.00033344037,0.00025473424,0.00017776927,0.00015120396,0.00011804719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042180845,0.00037046958,0.00031625322,0.0010437344,0.0009101393,0.0014557615,0.00036406264,0.00053748896,0.0094456],"category_scores_gemma":[0.001741181,0.00022395104,0.00036905814,0.000649432,0.0014642355,0.001756538,0.0009566512,0.0006488007,0.0012384652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018235836,0.000011595848,0.00014338754,0.000021797858,0.0000052513196,0.000058515452,0.00008034864,0.0008226551,0.00080928986,0.99290234,0.00090848666,0.004218134],"study_design_scores_gemma":[0.000014873298,0.000035083314,0.00018269251,0.000017310485,0.000008106162,0.00018276308,0.000095330055,0.006308087,0.00089163653,0.98058254,0.011672322,0.0000093915],"about_ca_topic_score_codex":0.00070024515,"about_ca_topic_score_gemma":0.0012612519,"teacher_disagreement_score":0.0094456,"about_ca_system_score_codex":0.00076005363,"about_ca_system_score_gemma":0.00066135573,"threshold_uncertainty_score":0.031598687},"labels":[],"label_agreement":null},{"id":"W2792309580","doi":"","title":"Decompositions Of λK v Into Multigraphs With Four Vertices And Five Edges.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.006156090117232502,"score_gpt":0.19920060403076142,"score_spread":0.19304451391352892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792309580","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30410108,0.0010874483,0.4144507,0.0016579108,0.0006082901,0.000585089,0.0063515925,0.0021682375,0.26898968],"genre_scores_gemma":[0.7138084,0.0006633704,0.19290106,0.00061461277,0.00007878053,0.00038725935,0.0054258117,0.00052444125,0.085596226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996426,0.0000640428,0.000021937878,0.000091031325,0.00006657721,0.000113784605],"domain_scores_gemma":[0.99919134,0.00019702232,0.00012765986,0.00016063203,0.00014375802,0.00017952418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025712702,0.0005951322,0.0003033503,0.0016423388,0.0010868934,0.0014404155,0.0008454553,0.0006230512,0.024344502],"category_scores_gemma":[0.0011719447,0.00046397196,0.0006571728,0.0009062639,0.00057507795,0.0012512078,0.0012178852,0.0010942406,0.004555145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007044104,0.00033814294,0.0028742452,0.00062350376,0.00015529207,0.0016429416,0.0010350579,0.021590108,0.041864235,0.7782275,0.043017454,0.10792707],"study_design_scores_gemma":[0.00013460456,0.00012602082,0.0057341415,0.00035031885,0.000121952566,0.0015069266,0.001654158,0.053695824,0.015917253,0.8329215,0.087768406,0.000068879286],"about_ca_topic_score_codex":0.0020220561,"about_ca_topic_score_gemma":0.0035582243,"teacher_disagreement_score":0.024344502,"about_ca_system_score_codex":0.00090244494,"about_ca_system_score_gemma":0.00062077865,"threshold_uncertainty_score":0.08144051},"labels":[],"label_agreement":null},{"id":"W2792580356","doi":"","title":"On super (a, d)-edge-antimagic total labeling of a subdivided stars.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Stars; Enhanced Data Rates for GSM Evolution; Combinatorics; Astrophysics; Computer science; Artificial intelligence; Physics","score_opus":0.012920420431939897,"score_gpt":0.23520957320522748,"score_spread":0.2222891527732876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792580356","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49904695,0.0016995026,0.34932047,0.0027248932,0.00031408243,0.00017928239,0.0023426444,0.00083775236,0.14353453],"genre_scores_gemma":[0.7866288,0.001111326,0.18071078,0.0010624141,0.00017116996,0.00017032793,0.002585552,0.0002829637,0.02727665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934953,0.00019878587,0.00004198221,0.00015775063,0.000119509765,0.00013250229],"domain_scores_gemma":[0.99794286,0.0010426979,0.00017897665,0.00039113127,0.0001906785,0.00025370214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075875537,0.0004491463,0.0006909806,0.0011406004,0.0018511605,0.0022341562,0.0010721516,0.0013175518,0.008543886],"category_scores_gemma":[0.0027956567,0.00041914373,0.00071426283,0.0018825989,0.0014418454,0.0038476174,0.002559669,0.0015610274,0.0013743443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021880516,0.00006834298,0.0011882414,0.00026426537,0.000030793133,0.000118388496,0.00041734954,0.008441879,0.00465336,0.94373876,0.010909897,0.02994997],"study_design_scores_gemma":[0.000040914234,0.000048018144,0.0008074304,0.00005410592,0.000041288877,0.00023729405,0.0003171063,0.023077214,0.0020507954,0.9605742,0.0127318995,0.000019832358],"about_ca_topic_score_codex":0.0019464626,"about_ca_topic_score_gemma":0.0029798085,"teacher_disagreement_score":0.008543886,"about_ca_system_score_codex":0.0015304536,"about_ca_system_score_gemma":0.0007496057,"threshold_uncertainty_score":0.028582096},"labels":[],"label_agreement":null},{"id":"W2792587586","doi":"","title":"The L(j, k)-Edge-Labeling Problem on Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Computer science; Artificial intelligence","score_opus":0.012760595017237782,"score_gpt":0.2338949424083237,"score_spread":0.22113434739108592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792587586","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33738908,0.005411354,0.415182,0.03293447,0.0011869778,0.00030081085,0.011290675,0.0022950687,0.19400957],"genre_scores_gemma":[0.8079472,0.0021420198,0.14760417,0.002316131,0.000781288,0.00027170376,0.005794808,0.0006039526,0.032538705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983865,0.00056573167,0.000095142386,0.00041153267,0.00019901272,0.00034213244],"domain_scores_gemma":[0.9924418,0.004595388,0.00060669024,0.0012306309,0.00039394028,0.0007315161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015471302,0.00076233095,0.0012522062,0.0012402737,0.0028226397,0.0050439877,0.0025499626,0.0032664712,0.013167847],"category_scores_gemma":[0.010463501,0.0006876915,0.0009378729,0.0026181964,0.0024337184,0.009543601,0.0028497388,0.0032825244,0.002270353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004466639,0.0002543236,0.0024460405,0.00055501505,0.00006946841,0.00016875201,0.000507381,0.02032992,0.002626889,0.82547903,0.07628046,0.07083605],"study_design_scores_gemma":[0.00006290678,0.000033033946,0.00081379205,0.000070213864,0.00003440255,0.000263483,0.00040952634,0.032942522,0.00140158,0.95011157,0.013827804,0.00002920511],"about_ca_topic_score_codex":0.0027482938,"about_ca_topic_score_gemma":0.0033770313,"teacher_disagreement_score":0.013167847,"about_ca_system_score_codex":0.002596365,"about_ca_system_score_gemma":0.0017264673,"threshold_uncertainty_score":0.044050872},"labels":[],"label_agreement":null},{"id":"W2792621615","doi":"","title":"The strong product of graphs and crossing numbers","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Crossing number (knot theory); Product (mathematics); Combinatorics; Geometry; Transport engineering; Engineering","score_opus":0.015905146918008584,"score_gpt":0.2706131690197365,"score_spread":0.2547080221017279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792621615","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.380538,0.0015738744,0.5197671,0.0017326525,0.0004651352,0.00006283732,0.00033791127,0.0005066419,0.095015846],"genre_scores_gemma":[0.9186968,0.0009081775,0.054973193,0.0003143943,0.0003684837,0.00007458011,0.00028512802,0.00030640836,0.02407271],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988018,0.00034448487,0.00006214774,0.0003024395,0.0003484847,0.00014057019],"domain_scores_gemma":[0.99578047,0.002036729,0.0006613931,0.00047691178,0.00044565552,0.0005988532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014835006,0.00081703655,0.00073573797,0.0032360982,0.0014100329,0.004446963,0.001457426,0.0012131163,0.009849832],"category_scores_gemma":[0.006257825,0.0008174867,0.00089612824,0.0019996292,0.004282627,0.0071119606,0.0032503973,0.0024697692,0.00091684336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017449991,0.0000087261815,0.00024745177,0.000024953208,0.0000049597434,0.00003632721,0.00009245195,0.0012396653,0.0004808325,0.99256504,0.0006812274,0.0046009393],"study_design_scores_gemma":[0.0000061490286,0.000015920417,0.00020892029,0.000013640149,0.000008049537,0.00013398775,0.00005927203,0.0072614206,0.00063011947,0.98895943,0.0026921425,0.000010900979],"about_ca_topic_score_codex":0.0004717946,"about_ca_topic_score_gemma":0.0005599177,"teacher_disagreement_score":0.009849832,"about_ca_system_score_codex":0.000991531,"about_ca_system_score_gemma":0.00047598223,"threshold_uncertainty_score":0.032950997},"labels":[],"label_agreement":null},{"id":"W2792621676","doi":"","title":"Formulas for various domination numbers of products of paths and cycles.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Arithmetic","score_opus":0.014255761740252596,"score_gpt":0.28473081464186345,"score_spread":0.27047505290161084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792621676","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26341408,0.004682619,0.364282,0.0048789238,0.00088448543,0.00025025904,0.004331429,0.0013146946,0.35596144],"genre_scores_gemma":[0.8941495,0.0012867157,0.0793681,0.00068416086,0.00046209892,0.00022167056,0.0013211601,0.00030536935,0.022201272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987155,0.00027756224,0.000119909164,0.0002046276,0.00047241995,0.00020995241],"domain_scores_gemma":[0.9933976,0.0047237007,0.0004503444,0.0003573004,0.0008042741,0.00026667523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017959123,0.0008646375,0.0006765005,0.0036421332,0.0015661549,0.0046822,0.0023565367,0.001299039,0.017218545],"category_scores_gemma":[0.010886835,0.00060219254,0.0011828622,0.003147626,0.0020777865,0.0090110935,0.0014700328,0.003210529,0.0016165983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055590048,0.00003088212,0.000564921,0.000113737384,0.00001701233,0.00013448039,0.0002545014,0.0012284552,0.00068175956,0.981316,0.004086214,0.011516401],"study_design_scores_gemma":[0.000015304493,0.000011010763,0.00030576723,0.000056741046,0.000028237328,0.00026248055,0.00012785195,0.0076754238,0.0010166737,0.9855751,0.004905321,0.000020033598],"about_ca_topic_score_codex":0.0013438008,"about_ca_topic_score_gemma":0.0025752848,"teacher_disagreement_score":0.017218545,"about_ca_system_score_codex":0.0029595008,"about_ca_system_score_gemma":0.00075717276,"threshold_uncertainty_score":0.05760181},"labels":[],"label_agreement":null},{"id":"W2792677171","doi":"","title":"Face labelings of type (1, 1, 1) for generalized prism.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Prism; Type (biology); Face (sociological concept); Combinatorics; Optics; Linguistics; Physics; Geology","score_opus":0.011717024611629483,"score_gpt":0.22818175632110635,"score_spread":0.21646473170947686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792677171","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15782088,0.0006270355,0.51726943,0.0022018075,0.0013782165,0.00025148882,0.0036071655,0.0035423236,0.31330162],"genre_scores_gemma":[0.6643408,0.0004840647,0.2520602,0.0011425562,0.00021573734,0.00032063757,0.0030469794,0.00083227275,0.07755674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916506,0.00018944497,0.000043508557,0.0002163975,0.00020151527,0.00018414068],"domain_scores_gemma":[0.9985487,0.0004707976,0.00015721198,0.00041290597,0.00022248068,0.0001878232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000591177,0.00046064783,0.0004300593,0.0011026033,0.0021733276,0.002330415,0.0012261752,0.0012413007,0.026427323],"category_scores_gemma":[0.0025397385,0.00046112033,0.0007265516,0.0012736256,0.0012740793,0.0031519155,0.0018328242,0.0021954295,0.0039469213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095171476,0.000044887616,0.00036447728,0.00010184627,0.000015051854,0.000257075,0.00020680821,0.002619177,0.0029932216,0.9563788,0.016522875,0.020400552],"study_design_scores_gemma":[0.00002622153,0.0000342924,0.00044126713,0.000057573074,0.000022366774,0.00043469277,0.00032636942,0.014216199,0.0032904588,0.938331,0.042788506,0.000030993135],"about_ca_topic_score_codex":0.0019568102,"about_ca_topic_score_gemma":0.0032294497,"teacher_disagreement_score":0.026427323,"about_ca_system_score_codex":0.0012410969,"about_ca_system_score_gemma":0.0010415,"threshold_uncertainty_score":0.08840823},"labels":[],"label_agreement":null},{"id":"W2792756847","doi":"","title":"Subgraph Component Polynomials Of Some Compound Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Component (thermodynamics); Combinatorics; Physics","score_opus":0.03024248674765808,"score_gpt":0.29254198734618153,"score_spread":0.26229950059852347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792756847","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54925424,0.0010389057,0.25198063,0.0021805607,0.00042550632,0.0001450766,0.0017445192,0.00049467816,0.1927359],"genre_scores_gemma":[0.9459135,0.00061472354,0.023888614,0.00022310103,0.00023270874,0.00006438903,0.00069808,0.000160833,0.028204028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997124,0.000058841495,0.000007902338,0.00007054027,0.00008593108,0.00006442457],"domain_scores_gemma":[0.99921477,0.00031154382,0.00012015128,0.00009286386,0.00015353608,0.000107048465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000298522,0.0003970367,0.0003983253,0.0014064695,0.0007966164,0.0012076676,0.00057208893,0.00043261956,0.012225096],"category_scores_gemma":[0.0017353739,0.00020321042,0.0004462962,0.0014768731,0.0012464694,0.001804578,0.0008164179,0.0014917423,0.0015531124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049693506,0.000023961056,0.0005095769,0.000073263924,0.000012134583,0.00017726752,0.00019658175,0.001974339,0.0023678613,0.9752632,0.005284353,0.014067782],"study_design_scores_gemma":[0.00002147665,0.000031022202,0.0013637551,0.000019999643,0.000025934409,0.00044299377,0.0001727783,0.020516299,0.0021146985,0.96054536,0.014726218,0.000019430145],"about_ca_topic_score_codex":0.0019826102,"about_ca_topic_score_gemma":0.0032254248,"teacher_disagreement_score":0.012225096,"about_ca_system_score_codex":0.0011511161,"about_ca_system_score_gemma":0.0005804725,"threshold_uncertainty_score":0.04089701},"labels":[],"label_agreement":null},{"id":"W2792994061","doi":"","title":"Strongly Spanning Trailable Graphs with Short Longest Paths.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.015316116922232373,"score_gpt":0.2302556098121114,"score_spread":0.21493949288987904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792994061","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2986905,0.0012471975,0.60672164,0.002560814,0.0003760362,0.00043069615,0.006384899,0.0024093736,0.08117887],"genre_scores_gemma":[0.7624068,0.0011465389,0.1798739,0.00054724555,0.00021451442,0.00028546917,0.0060881916,0.00037864177,0.04905875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920386,0.00019529942,0.00009303891,0.0001644382,0.00016914397,0.00017423778],"domain_scores_gemma":[0.9939486,0.00267951,0.0009943736,0.0010788996,0.0005839631,0.000714795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079442374,0.00045458344,0.00043306517,0.001149543,0.0012417441,0.0022098152,0.00092816015,0.00075672957,0.011724063],"category_scores_gemma":[0.0068615805,0.00046657422,0.00050854805,0.0023145194,0.0008545634,0.0047523933,0.0021551382,0.001176431,0.002373028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052674004,0.0002757049,0.0033826898,0.00053352886,0.00009098665,0.0009557634,0.00073710084,0.020795535,0.010925039,0.80604035,0.030115401,0.12562124],"study_design_scores_gemma":[0.000058757632,0.00009952179,0.00082399725,0.0000731526,0.000051374933,0.0006965677,0.00034180062,0.03297423,0.0040637953,0.93069714,0.030097058,0.000022584942],"about_ca_topic_score_codex":0.0011732595,"about_ca_topic_score_gemma":0.0018975324,"teacher_disagreement_score":0.011724063,"about_ca_system_score_codex":0.00078923587,"about_ca_system_score_gemma":0.0012672318,"threshold_uncertainty_score":0.03922087},"labels":[],"label_agreement":null},{"id":"W2793210096","doi":"","title":"The Local Diagnosability of k-Ary n-Cube.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cube (algebra); Combinatorics; Arithmetic","score_opus":0.010660461349014237,"score_gpt":0.2593311247027864,"score_spread":0.24867066335377216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793210096","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4110738,0.0020530033,0.50948507,0.0020739178,0.0002770307,0.0001266011,0.0016679994,0.0011684976,0.07207416],"genre_scores_gemma":[0.9694157,0.0003713117,0.021606112,0.00019224508,0.000095492964,0.0000902382,0.00069226156,0.00007635373,0.007460353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990557,0.00017644378,0.0000754957,0.00024629332,0.00027972212,0.00016630905],"domain_scores_gemma":[0.99673426,0.0018127002,0.00034548275,0.0005317109,0.00031340262,0.0002624087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007051935,0.0003802079,0.00065654895,0.0006856482,0.0007694003,0.002300616,0.00107693,0.00067008194,0.0073217424],"category_scores_gemma":[0.0051090154,0.00025658996,0.0007310264,0.0006963216,0.0021312372,0.0033219163,0.0022718844,0.0016007699,0.0007426458],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042918025,0.000054564098,0.002021412,0.00039040932,0.00007954914,0.00062479853,0.0005338291,0.04243115,0.008670354,0.9008326,0.0050089965,0.03892315],"study_design_scores_gemma":[0.00004421275,0.000067734756,0.00081519055,0.000044449334,0.000039191775,0.0004159383,0.00019884823,0.0678968,0.0045737624,0.9220128,0.0038615346,0.000029640607],"about_ca_topic_score_codex":0.001608808,"about_ca_topic_score_gemma":0.001496248,"teacher_disagreement_score":0.0073217424,"about_ca_system_score_codex":0.0013189581,"about_ca_system_score_gemma":0.00084797613,"threshold_uncertainty_score":0.024493694},"labels":[],"label_agreement":null},{"id":"W2793769875","doi":"","title":"Disjoint cycles in directed graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Disjoint sets; Combinatorics","score_opus":0.01647823941276952,"score_gpt":0.28604266281789886,"score_spread":0.2695644234051293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793769875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22323391,0.015682172,0.48462576,0.0057443334,0.0014224217,0.00041848104,0.0033100408,0.0010042774,0.26455867],"genre_scores_gemma":[0.7492533,0.009504238,0.14839923,0.0018709833,0.0009837815,0.0006216324,0.0036644689,0.00047910807,0.08522334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855095,0.00047016557,0.00012683054,0.00039336065,0.00029957108,0.00015908036],"domain_scores_gemma":[0.9949261,0.0030104995,0.0006176481,0.00046745915,0.0005319062,0.00044625855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074563845,0.0007303196,0.0006985735,0.0034813758,0.0019584126,0.0034142307,0.0011665252,0.0014843344,0.011024795],"category_scores_gemma":[0.007455638,0.00075927435,0.00087083696,0.0034935141,0.0019155227,0.0061379024,0.0025935327,0.0018755328,0.0025115232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043699587,0.00003061133,0.0006148482,0.00022277811,0.00003211805,0.0002256857,0.00044332823,0.0016000224,0.00081907824,0.9564305,0.006386908,0.03315054],"study_design_scores_gemma":[0.00001256311,0.000010502309,0.00021270341,0.00007775164,0.00002561775,0.0003113413,0.00017808852,0.0037584007,0.00061540736,0.9694103,0.02537524,0.000012094795],"about_ca_topic_score_codex":0.0017642371,"about_ca_topic_score_gemma":0.0026391025,"teacher_disagreement_score":0.011024795,"about_ca_system_score_codex":0.0014409964,"about_ca_system_score_gemma":0.00090348424,"threshold_uncertainty_score":0.036881626},"labels":[],"label_agreement":null},{"id":"W2793905135","doi":"","title":"The Ramsey Number of Wheels versus a Fan of Order Five.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"History and Theory of Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Order (exchange); Ramsey's theorem; Combinatorics; Economics; Finance","score_opus":0.029440449821595195,"score_gpt":0.30848122298658104,"score_spread":0.2790407731649858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793905135","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28128025,0.011972766,0.033503704,0.008620631,0.001246576,0.00003182645,0.0008327563,0.00027333284,0.6622382],"genre_scores_gemma":[0.9684125,0.0014274468,0.0037235934,0.00041054914,0.00030415176,0.000019816624,0.00015656019,0.000047068002,0.025498226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953175,0.0001302206,0.000021748518,0.000104586,0.00010578412,0.00010587758],"domain_scores_gemma":[0.9985292,0.00080015865,0.00014941454,0.00013934089,0.00015926102,0.00022260622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000732568,0.0002964937,0.00046882342,0.0015424619,0.0019879427,0.0029086873,0.0006311436,0.00079248624,0.011375986],"category_scores_gemma":[0.0031752354,0.00026756647,0.00035295408,0.0009499513,0.0034209043,0.0070123067,0.0014519728,0.0016015009,0.0008898837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032158718,0.0000056075082,0.0001511512,0.00002131243,0.000002846469,0.00001811338,0.00007426287,0.00024355431,0.00011182998,0.9945569,0.0019953556,0.0027869036],"study_design_scores_gemma":[0.000012209027,0.000009845338,0.00046726194,0.000029653214,0.000008876329,0.000107126725,0.0001357616,0.0013464775,0.0002968472,0.9818941,0.01568225,0.000009631701],"about_ca_topic_score_codex":0.0031359103,"about_ca_topic_score_gemma":0.0034270738,"teacher_disagreement_score":0.011375986,"about_ca_system_score_codex":0.001775073,"about_ca_system_score_gemma":0.00072480744,"threshold_uncertainty_score":0.038056493},"labels":[],"label_agreement":null},{"id":"W2793906705","doi":"","title":"On the total signed domination number of P m [square] C n .","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Square (algebra); Combinatorics; Geometry","score_opus":0.014231687359934055,"score_gpt":0.2905970341272533,"score_spread":0.2763653467673192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793906705","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6995863,0.00082964957,0.06469628,0.0027362271,0.00044046104,0.00007354864,0.0015175465,0.00042170752,0.22969836],"genre_scores_gemma":[0.9690058,0.00044063712,0.010072125,0.00032470239,0.00020135213,0.000104164756,0.00067824626,0.00015207165,0.019020813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936134,0.0001427177,0.00003235687,0.0001308524,0.00017641563,0.00015630692],"domain_scores_gemma":[0.9960253,0.00234033,0.0004684105,0.00030514604,0.00041023004,0.0004505433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074639026,0.00048248903,0.00037759202,0.0021198883,0.0014298285,0.0022950908,0.0010448726,0.000777226,0.013309572],"category_scores_gemma":[0.005906117,0.00024022015,0.00025994668,0.0013947623,0.00172462,0.003093969,0.0015087561,0.0012152924,0.0012881076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039782972,0.00006970256,0.0037014906,0.00021078765,0.000035950707,0.00019857778,0.0005573223,0.0094101615,0.006145601,0.9101253,0.0171527,0.051994592],"study_design_scores_gemma":[0.00003570629,0.000057011704,0.0026034976,0.000068821464,0.000031438292,0.0003701675,0.00026725806,0.027412899,0.0039461586,0.9522841,0.012881286,0.000041605974],"about_ca_topic_score_codex":0.0011113368,"about_ca_topic_score_gemma":0.00214441,"teacher_disagreement_score":0.013309572,"about_ca_system_score_codex":0.0011861303,"about_ca_system_score_gemma":0.0007141134,"threshold_uncertainty_score":0.044524968},"labels":[],"label_agreement":null},{"id":"W2794018658","doi":"","title":"The higher Balaban index on weighted matrix.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Matrix (chemical analysis); Computer science; Composite material; World Wide Web","score_opus":0.008168347400594788,"score_gpt":0.24365536849622052,"score_spread":0.23548702109562572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794018658","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26809725,0.0049043396,0.38816804,0.0045914254,0.0026375465,0.00009338139,0.0007385224,0.0006896165,0.33007985],"genre_scores_gemma":[0.88009226,0.0019948077,0.049683753,0.0016093614,0.0014336328,0.0001433751,0.00041059696,0.00037684964,0.06425527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986142,0.00036620264,0.00007408659,0.00022130218,0.00048192445,0.00024235781],"domain_scores_gemma":[0.9966163,0.0011101586,0.00041773546,0.000618585,0.0006654212,0.0005718592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015580502,0.00068167894,0.0009658787,0.0036934898,0.0017729831,0.0038924094,0.0013204684,0.0013285594,0.013279647],"category_scores_gemma":[0.0072443453,0.0003553292,0.00058626616,0.002311645,0.0030496423,0.0074926945,0.0030666469,0.0027516626,0.0032624882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002294785,0.000012983168,0.00014081722,0.000026448179,0.00000425434,0.000030433655,0.00006119637,0.00039382404,0.0006204221,0.9916003,0.0017032566,0.0053832037],"study_design_scores_gemma":[0.000006003255,0.000014219728,0.00012794265,0.000018017246,0.000003886075,0.00008313978,0.000030992403,0.0051031783,0.000579519,0.99007976,0.0039392696,0.000014132838],"about_ca_topic_score_codex":0.0007742414,"about_ca_topic_score_gemma":0.0010259032,"teacher_disagreement_score":0.013279647,"about_ca_system_score_codex":0.0014071882,"about_ca_system_score_gemma":0.00073734566,"threshold_uncertainty_score":0.044424832},"labels":[],"label_agreement":null},{"id":"W2794051019","doi":"","title":"Finite 2-Geodesic-Transitive Cayley Graphs Of Dihedral Groups.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cayley graph; Mathematics; Dihedral group; Transitive relation; Geodesic; Combinatorics; Pure mathematics; Group (periodic table); Geometry; Graph; Physics","score_opus":0.011529566572576458,"score_gpt":0.2370022466951633,"score_spread":0.22547268012258684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794051019","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42437702,0.00086206925,0.3587541,0.0009542792,0.00048667102,0.0002107024,0.0015110256,0.0009283643,0.21191569],"genre_scores_gemma":[0.8904752,0.00036407216,0.05657534,0.0002845007,0.00010872727,0.00011352978,0.0016696192,0.00023244931,0.050176628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963224,0.00008043806,0.000026032136,0.00008260593,0.0001173907,0.00006133375],"domain_scores_gemma":[0.9991974,0.00025352204,0.00013670113,0.0001629704,0.000116829804,0.00013252712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023976387,0.0004953959,0.00036730475,0.0011359352,0.0008482893,0.0015340494,0.0010303908,0.0006729894,0.012732798],"category_scores_gemma":[0.0015487847,0.00030519816,0.00049749936,0.00064984127,0.00096287695,0.0017669466,0.0013448059,0.0008915773,0.0019053983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004259157,0.000024640804,0.000425213,0.00005041972,0.000010100373,0.00014550815,0.0001897138,0.003712801,0.002592252,0.9740528,0.0035377422,0.015216156],"study_design_scores_gemma":[0.000022570008,0.000026994867,0.00038718714,0.00002584022,0.000010359006,0.00021185918,0.00018862149,0.016545834,0.0027528934,0.96277463,0.017037885,0.000015401409],"about_ca_topic_score_codex":0.0010974858,"about_ca_topic_score_gemma":0.0022386166,"teacher_disagreement_score":0.012732798,"about_ca_system_score_codex":0.00068287406,"about_ca_system_score_gemma":0.00036218952,"threshold_uncertainty_score":0.042595446},"labels":[],"label_agreement":null},{"id":"W2794133300","doi":"","title":"Bipartite graphs with every k-matching in a Hamiltonian cycle.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Hamiltonian path; Combinatorics; Matching (statistics); Hamiltonian (control theory); Complete bipartite graph; Pancyclic graph; Discrete mathematics; Chordal graph; Graph; 1-planar graph; Statistics; Mathematical optimization","score_opus":0.017341850816953778,"score_gpt":0.27518320199856194,"score_spread":0.25784135118160817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794133300","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45998842,0.001438045,0.24074277,0.004158907,0.00097547635,0.00037698736,0.005294658,0.0011685303,0.28585622],"genre_scores_gemma":[0.87231207,0.00070276397,0.064960055,0.00137388,0.00028951635,0.00033198387,0.0033107363,0.00028281318,0.05643616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992545,0.0001679204,0.00004999195,0.00023032074,0.0001042379,0.00019292015],"domain_scores_gemma":[0.99843305,0.0004671185,0.0003060614,0.0002971265,0.00021400586,0.00028262247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042214515,0.0005464887,0.0007418455,0.0009842812,0.002361799,0.0020263707,0.0013846832,0.0020984195,0.025624875],"category_scores_gemma":[0.0030374108,0.0006709088,0.00083588756,0.0015560596,0.0013556082,0.0038292063,0.0022644354,0.0017134954,0.00463529],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003303288,0.00016679024,0.0011766274,0.00039641457,0.000087773755,0.00077563076,0.00048762196,0.0022845154,0.008416519,0.9418359,0.01772741,0.02631448],"study_design_scores_gemma":[0.000063565494,0.000041946292,0.00097133924,0.000073965675,0.000064284,0.000789813,0.0003934823,0.00722564,0.0024210562,0.9695431,0.018387133,0.00002455675],"about_ca_topic_score_codex":0.0012262475,"about_ca_topic_score_gemma":0.0016245169,"teacher_disagreement_score":0.025624875,"about_ca_system_score_codex":0.00066453475,"about_ca_system_score_gemma":0.0008443346,"threshold_uncertainty_score":0.08572376},"labels":[],"label_agreement":null},{"id":"W2794138679","doi":"","title":"Parity results for 15-core partitions.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Core (optical fiber); Parity (physics); Computer science; Telecommunications; Physics; Atomic physics","score_opus":0.08133507716327208,"score_gpt":0.35814539654542565,"score_spread":0.27681031938215356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794138679","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25770605,0.0013043708,0.096044995,0.003155381,0.0013458774,0.000099747784,0.0013469149,0.00056448375,0.63843215],"genre_scores_gemma":[0.9225476,0.000553091,0.016258227,0.0011871376,0.00048019981,0.00012329247,0.0011134017,0.0004986635,0.057238452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987471,0.00023674393,0.00005645154,0.00017823429,0.0004133095,0.00036814643],"domain_scores_gemma":[0.9975062,0.00086554803,0.00025201222,0.0004951299,0.00049403135,0.00038711014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012817577,0.00066079025,0.0007628956,0.0016772824,0.0023057086,0.0027111033,0.0013411664,0.0011345921,0.02895269],"category_scores_gemma":[0.005253334,0.00041242267,0.00085494376,0.0010109844,0.002775518,0.0066517917,0.0038873025,0.00284273,0.006470346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009291976,0.000027866306,0.0003106404,0.000056748948,0.0000060232533,0.000068941095,0.00014128901,0.00030967523,0.00076550397,0.9885526,0.004545199,0.0051226914],"study_design_scores_gemma":[0.000022099475,0.000017537732,0.0003241745,0.000024856232,0.000009378859,0.000103404505,0.00008185447,0.0015197884,0.0006186645,0.99222434,0.0050434037,0.000010579717],"about_ca_topic_score_codex":0.0009955709,"about_ca_topic_score_gemma":0.0011878969,"teacher_disagreement_score":0.02895269,"about_ca_system_score_codex":0.0010999705,"about_ca_system_score_gemma":0.000955228,"threshold_uncertainty_score":0.096856415},"labels":[],"label_agreement":null},{"id":"W2794154631","doi":"","title":"On the Spectral Moment of Quasi-trees and Quasi-unicyclic Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Moment (physics); Combinatorics; Physics; Quantum mechanics","score_opus":0.024544570364443134,"score_gpt":0.28228721636879345,"score_spread":0.2577426460043503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794154631","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54775256,0.009411524,0.2681266,0.009516795,0.0016983539,0.00006294481,0.0009343629,0.000510634,0.16198623],"genre_scores_gemma":[0.9723302,0.002117417,0.011401717,0.0006207753,0.0012495202,0.000064407104,0.00027753893,0.00015293542,0.011785463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993919,0.00020863922,0.000023306473,0.000107315755,0.00012924582,0.00013947044],"domain_scores_gemma":[0.99440575,0.003439892,0.0006753051,0.0003452514,0.00043385162,0.0006998796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011864462,0.000497552,0.0009116378,0.002956795,0.0013519851,0.0023604038,0.0013496277,0.0013899633,0.009579452],"category_scores_gemma":[0.008649279,0.00043559796,0.0005842714,0.0017815442,0.0032993192,0.0053543244,0.0018504902,0.0021741404,0.0011703299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031432344,0.0000134323545,0.00019254847,0.00003436827,0.0000051548936,0.000038496953,0.00011672899,0.001268269,0.0005182968,0.9932668,0.0018739385,0.0026404827],"study_design_scores_gemma":[0.00000810965,0.000011794228,0.0003090197,0.000021866257,0.0000062606778,0.00010550306,0.000090055844,0.010925146,0.00022039405,0.9865305,0.0017594295,0.000012027743],"about_ca_topic_score_codex":0.00091044547,"about_ca_topic_score_gemma":0.0010863448,"teacher_disagreement_score":0.009579452,"about_ca_system_score_codex":0.0013594112,"about_ca_system_score_gemma":0.0004557584,"threshold_uncertainty_score":0.032046437},"labels":[],"label_agreement":null},{"id":"W2794213857","doi":"","title":"On the largest real root of independence polynomials of trees.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Root (linguistics); Independence (probability theory); Statistics; Linguistics","score_opus":0.028252631643615227,"score_gpt":0.2964323801444416,"score_spread":0.2681797485008264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794213857","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38337043,0.0066713654,0.3451693,0.008958901,0.0010170537,0.00006938022,0.0014146217,0.000517303,0.25281176],"genre_scores_gemma":[0.9536252,0.0020007757,0.022892071,0.00056654593,0.0011734129,0.000046320212,0.0005397779,0.00016780478,0.018988172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925905,0.00023727903,0.000022246522,0.0001495707,0.0001730034,0.00015884134],"domain_scores_gemma":[0.99300694,0.0051257415,0.0005632391,0.00037246707,0.00041156827,0.0005200661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001017218,0.00053794176,0.0007006056,0.0018609875,0.0012076367,0.0018589522,0.000907385,0.000908975,0.009135162],"category_scores_gemma":[0.010051638,0.0004830661,0.0005651914,0.0016814243,0.0035270099,0.0043695723,0.0017306941,0.0041615106,0.0018912347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008046193,0.000034484216,0.00052936544,0.00012865444,0.000012658709,0.00010425365,0.00029868045,0.002164565,0.001295753,0.97210884,0.0065295105,0.016712796],"study_design_scores_gemma":[0.000013557436,0.000012106617,0.00053370616,0.00002042009,0.000010072505,0.00013799049,0.00007029069,0.0052933064,0.00036792058,0.99012417,0.00340542,0.0000110422125],"about_ca_topic_score_codex":0.0014839966,"about_ca_topic_score_gemma":0.0019891567,"teacher_disagreement_score":0.009135162,"about_ca_system_score_codex":0.0010077644,"about_ca_system_score_gemma":0.000574356,"threshold_uncertainty_score":0.030560136},"labels":[],"label_agreement":null},{"id":"W2794278008","doi":"","title":"A Generalization of (2, w;d)-Cover Free Families.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cover (algebra); Generalization; Combinatorics; Mathematical analysis; Engineering","score_opus":0.01744284886968742,"score_gpt":0.26828093437085315,"score_spread":0.2508380855011657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794278008","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26875725,0.0020059266,0.19330947,0.0025285664,0.00075007667,0.00012676638,0.0017333453,0.0010063814,0.5297822],"genre_scores_gemma":[0.89819145,0.00090545433,0.027379824,0.0007207894,0.00028140433,0.00013906352,0.0009004577,0.00026603165,0.07121546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993345,0.00013233827,0.000035485624,0.00018474415,0.00017700443,0.00013584427],"domain_scores_gemma":[0.9989666,0.00034426217,0.000105288826,0.00022877322,0.00014393048,0.00021113436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069856487,0.0004277668,0.0004942017,0.0023801404,0.0025518201,0.0023991787,0.00088041794,0.0011016924,0.015120131],"category_scores_gemma":[0.00256584,0.0004387686,0.0007058501,0.0017332284,0.0018269331,0.0057653286,0.0032604793,0.001530732,0.0017627741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028210414,0.00001749636,0.0003585589,0.000034141896,0.0000069799844,0.00019411203,0.0002639269,0.00054258294,0.00064806745,0.9860387,0.0039076908,0.0079595465],"study_design_scores_gemma":[0.00001592869,0.000017003238,0.0004991864,0.000032433345,0.000012746038,0.00069253694,0.00022157958,0.004055756,0.0007475223,0.9625691,0.031118495,0.000017660212],"about_ca_topic_score_codex":0.0018475498,"about_ca_topic_score_gemma":0.0013311653,"teacher_disagreement_score":0.015120131,"about_ca_system_score_codex":0.0012247366,"about_ca_system_score_gemma":0.00045765648,"threshold_uncertainty_score":0.050581813},"labels":[],"label_agreement":null},{"id":"W2794409369","doi":"","title":"On the sum of the squares of all distances in bipartite graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Combinatorics; Explained sum of squares; Cograph; Discrete mathematics; Statistics; Chordal graph; 1-planar graph; Graph","score_opus":0.029112963078660386,"score_gpt":0.29037175031374907,"score_spread":0.26125878723508866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794409369","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17804268,0.0061303736,0.7343517,0.0057892227,0.0013283073,0.00009537754,0.0016988693,0.00066410773,0.07189941],"genre_scores_gemma":[0.74361384,0.0046699937,0.204555,0.0018787483,0.0028032085,0.00034827786,0.0021089579,0.0012812072,0.038740847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760973,0.0011095328,0.0001100777,0.00044769832,0.00051625725,0.0002066476],"domain_scores_gemma":[0.9868896,0.010112712,0.00076052354,0.00089341326,0.0007052974,0.00063857035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024802338,0.0012824349,0.001515966,0.0026222763,0.0011268525,0.0022867783,0.0029290523,0.0018742791,0.009183643],"category_scores_gemma":[0.019264478,0.0007603521,0.00085046317,0.0025083679,0.0033911092,0.0083228955,0.0032302209,0.0036147782,0.0021743733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015164579,0.000070455084,0.0013512407,0.0003095551,0.00009137055,0.00013877751,0.00034212516,0.021777805,0.0017502429,0.91273373,0.017812995,0.04347013],"study_design_scores_gemma":[0.0000131429815,0.000021664982,0.0006374774,0.000041222764,0.000023977243,0.00020620956,0.0000876389,0.050061535,0.00045325412,0.9450792,0.003352704,0.000022057358],"about_ca_topic_score_codex":0.0013797402,"about_ca_topic_score_gemma":0.001960202,"teacher_disagreement_score":0.009183643,"about_ca_system_score_codex":0.0012517428,"about_ca_system_score_gemma":0.00058181485,"threshold_uncertainty_score":0.03072238},"labels":[],"label_agreement":null},{"id":"W2794420812","doi":"","title":"The independence number of the competition graph of a bipartite tournament.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tournament; Bipartite graph; Mathematics; Independence (probability theory); Independence number; Competition (biology); Graph; Combinatorics; Mathematical economics; Discrete mathematics; Statistics","score_opus":0.03637645098151386,"score_gpt":0.3473419640278946,"score_spread":0.3109655130463807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794420812","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5452325,0.0011894051,0.21560024,0.0041642985,0.00053334236,0.00026763053,0.005656898,0.0005097825,0.22684588],"genre_scores_gemma":[0.96542835,0.00053431425,0.016849574,0.00035431053,0.00032257417,0.00023823221,0.0013965651,0.00013925917,0.01473674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982412,0.0006109383,0.00007373495,0.00033193434,0.00036418712,0.00037797343],"domain_scores_gemma":[0.9830415,0.011556543,0.001814956,0.0007153916,0.00083029474,0.0020412426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016398974,0.00081433565,0.0010999128,0.0027575372,0.0017319409,0.0037781638,0.0017364136,0.0014500977,0.017933486],"category_scores_gemma":[0.017184181,0.0007886761,0.00076862215,0.001981568,0.0025980598,0.004628316,0.001341747,0.0026479734,0.0013705153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005044439,0.00022198907,0.0045543835,0.00027171653,0.00012128911,0.00012999361,0.00024862547,0.024602864,0.0036747737,0.921357,0.018831164,0.025481697],"study_design_scores_gemma":[0.00012180327,0.00009915028,0.006478662,0.000074414536,0.00008700762,0.0003862411,0.00012037607,0.11951909,0.001778518,0.8639355,0.0073327115,0.00006655245],"about_ca_topic_score_codex":0.0024196543,"about_ca_topic_score_gemma":0.0026298335,"teacher_disagreement_score":0.017933486,"about_ca_system_score_codex":0.0021800334,"about_ca_system_score_gemma":0.0015341392,"threshold_uncertainty_score":0.059993505},"labels":[],"label_agreement":null},{"id":"W2794425788","doi":"","title":"Some congruences involving q-harmonic numbers.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Congruence relation; Mathematics; Harmonic number; Harmonic; Pure mathematics; Arithmetic; Physics; Acoustics","score_opus":0.039689065326381966,"score_gpt":0.3185945052420994,"score_spread":0.2789054399157175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794425788","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069319665,0.0029546574,0.06800886,0.0069117867,0.0021835137,0.00011192802,0.0005147284,0.00019075436,0.84980404],"genre_scores_gemma":[0.80675626,0.002674352,0.036622144,0.0024638707,0.003078269,0.00023315138,0.00075186894,0.00027476673,0.14714527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984749,0.0004217123,0.000108196065,0.00024210017,0.0005056408,0.00024748125],"domain_scores_gemma":[0.9984195,0.00065048767,0.00015153836,0.00017467795,0.00037385835,0.00022990958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016922213,0.00065711234,0.0005355197,0.0018588904,0.0034335405,0.004114579,0.0007309588,0.0012072535,0.018261807],"category_scores_gemma":[0.0046599335,0.00046052047,0.0010433806,0.0013512161,0.0048012603,0.00687335,0.003349193,0.0041257706,0.0038299572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056934095,0.0000063780312,0.000042374293,0.000010474329,0.000001218265,0.000052042695,0.00011987532,0.000025268893,0.00016225473,0.9968742,0.0014169106,0.0012832335],"study_design_scores_gemma":[0.000013007792,0.0000067256487,0.00014821326,0.000013896491,0.0000030158062,0.00011752576,0.00011767088,0.00030693752,0.00025169307,0.98832136,0.010694395,0.0000054818124],"about_ca_topic_score_codex":0.0015461552,"about_ca_topic_score_gemma":0.0013643164,"teacher_disagreement_score":0.018261807,"about_ca_system_score_codex":0.0018339447,"about_ca_system_score_gemma":0.0008121728,"threshold_uncertainty_score":0.0610919},"labels":[],"label_agreement":null},{"id":"W2794432627","doi":"","title":"Maximal independent sets in complementary prism graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Prism; Combinatorics; Discrete mathematics; Optics; Physics","score_opus":0.022734535536246138,"score_gpt":0.30125144275730725,"score_spread":0.2785169072210611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794432627","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3109836,0.001900326,0.39293525,0.002446274,0.0006190292,0.00023881104,0.0030868186,0.0010080526,0.2867819],"genre_scores_gemma":[0.86228395,0.0012766779,0.09762094,0.0008010043,0.0002792936,0.00025231714,0.00254738,0.00021471217,0.034723766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888355,0.00027626514,0.00005430047,0.00027037604,0.00033262215,0.00018288576],"domain_scores_gemma":[0.99606377,0.0022304382,0.0004568131,0.0003854969,0.00044353437,0.00042003885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007645608,0.000510452,0.0006058695,0.0018419536,0.0020957591,0.0025430345,0.0012064138,0.0011026164,0.0122295935],"category_scores_gemma":[0.004969424,0.0008637926,0.0009702787,0.0019243913,0.0020219889,0.003992904,0.002539562,0.0025198727,0.0018070816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006973749,0.000034496894,0.0005579194,0.00017205911,0.000029123885,0.00022824365,0.00022919248,0.0019720364,0.0021164613,0.9761001,0.0057950076,0.012695704],"study_design_scores_gemma":[0.000029835968,0.000021206177,0.00064342486,0.00005936941,0.0000477413,0.0005124285,0.00022201522,0.0093074255,0.0024222145,0.97490215,0.01181465,0.000017695525],"about_ca_topic_score_codex":0.0014392087,"about_ca_topic_score_gemma":0.0025290041,"teacher_disagreement_score":0.0122295935,"about_ca_system_score_codex":0.0011442967,"about_ca_system_score_gemma":0.001183118,"threshold_uncertainty_score":0.040912032},"labels":[],"label_agreement":null},{"id":"W28495531","doi":"10.1016/j.bbrc.2017.05.038","title":"Two General Results on Harmonious Labelings.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.01685622446059893,"score_gpt":0.24563681211705116,"score_spread":0.22878058765645223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W28495531","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019804731,0.007914302,0.6197008,0.008888756,0.008265899,0.00046171286,0.0028768945,0.0063519017,0.32573512],"genre_scores_gemma":[0.31159455,0.0093562445,0.38461417,0.016862592,0.004481743,0.002258967,0.009577202,0.0071625416,0.25409204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952192,0.00069927773,0.00027379164,0.0020676684,0.0011284053,0.000611643],"domain_scores_gemma":[0.99737537,0.00043986703,0.00024129725,0.0011520137,0.00045135195,0.000340223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024161565,0.0013803954,0.0010535608,0.0018760692,0.002347832,0.0031866464,0.0021526313,0.0023351437,0.049584087],"category_scores_gemma":[0.0049770484,0.00095545873,0.0017646999,0.0017276724,0.0039501786,0.00439691,0.006759512,0.0034504298,0.0211492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027948432,0.00011582619,0.00093885843,0.0005991651,0.00010256495,0.00038172718,0.0003080645,0.0013108809,0.028305747,0.8139512,0.04535604,0.10835044],"study_design_scores_gemma":[0.00008991487,0.00015578506,0.0013760307,0.0001453972,0.00009016449,0.001921879,0.0001487165,0.0042999857,0.026732314,0.3784799,0.58646494,0.00009499032],"about_ca_topic_score_codex":0.00080880086,"about_ca_topic_score_gemma":0.0009822339,"teacher_disagreement_score":0.049584087,"about_ca_system_score_codex":0.0018336854,"about_ca_system_score_gemma":0.0016275436,"threshold_uncertainty_score":0.16587532},"labels":[],"label_agreement":null},{"id":"W28604200","doi":"10.7748/ncyp.29.5.12.s12","title":"The Metamorphosis of K4\\e Designs Into Maximum Packings Of Kn With 4-Cycles.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Manufacturing Process and Optimization","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Metamorphosis; Mathematics; Horticulture; Biology; Botany; Larva","score_opus":0.008423485483538396,"score_gpt":0.2008104870456318,"score_spread":0.19238700156209343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W28604200","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27005544,0.0027596436,0.5813222,0.00081438146,0.00041894068,0.00018871963,0.00077973685,0.001116544,0.14254446],"genre_scores_gemma":[0.6647763,0.0014070688,0.30393088,0.0006355295,0.00008256611,0.00024197897,0.000688171,0.00037677836,0.027860638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996555,0.00008611389,0.000039149414,0.000074254785,0.00007908731,0.000065847984],"domain_scores_gemma":[0.99952686,0.00016820163,0.00008634325,0.00013808365,0.00005024881,0.000030238538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003300973,0.0003480998,0.0003300753,0.0005173353,0.0005343507,0.0008467287,0.000620205,0.00051500497,0.009904589],"category_scores_gemma":[0.0015389243,0.00064506405,0.0007887175,0.0005731141,0.00084496,0.0018279726,0.001233137,0.00082338223,0.0013726457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004945072,0.000092791306,0.0012082526,0.00077374745,0.000078216246,0.00043950745,0.00033867994,0.067751765,0.034966696,0.68995076,0.010198872,0.19370617],"study_design_scores_gemma":[0.000090971946,0.00045517975,0.0013699979,0.00026727153,0.00005151988,0.001184769,0.00013657236,0.10342188,0.024539853,0.7908607,0.07754406,0.00007718657],"about_ca_topic_score_codex":0.00078189716,"about_ca_topic_score_gemma":0.0014065806,"teacher_disagreement_score":0.009904589,"about_ca_system_score_codex":0.00045921048,"about_ca_system_score_gemma":0.00035052764,"threshold_uncertainty_score":0.033134162},"labels":[],"label_agreement":null},{"id":"W287610840","doi":"","title":"Edge-critical isometric subgraphs of hypercubes.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hypercube; Mathematics; Isometric exercise; Enhanced Data Rates for GSM Evolution; Combinatorics; Computer science; Telecommunications","score_opus":0.013450739095580063,"score_gpt":0.24307846859906268,"score_spread":0.22962772950348262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W287610840","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78503186,0.0012541875,0.10099575,0.0010160465,0.00017217177,0.00012086875,0.0009292382,0.00030171388,0.1101781],"genre_scores_gemma":[0.9648013,0.0006730893,0.016876435,0.00016347633,0.00007893815,0.000058368325,0.001169998,0.000070900955,0.016107516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99983466,0.000046085177,0.000008074763,0.000028800065,0.000043656422,0.00003872557],"domain_scores_gemma":[0.9993954,0.00018579699,0.00014510554,0.00008346852,0.00007647254,0.000113772185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001401888,0.0002235958,0.00020843226,0.00059109955,0.0005212747,0.00070682884,0.00038782498,0.00028040528,0.006096701],"category_scores_gemma":[0.0011825311,0.00021795799,0.00019302205,0.0005085793,0.00041119786,0.0011237882,0.00087485067,0.00042896305,0.00045486604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002844791,0.000071431845,0.003827209,0.0003486033,0.000045222565,0.00081606593,0.00037695197,0.011154529,0.018780258,0.8941893,0.014747581,0.055358373],"study_design_scores_gemma":[0.000049378537,0.000069163805,0.0069036395,0.00009160662,0.000053372656,0.0016476633,0.000767632,0.05054992,0.013085559,0.88868594,0.03807624,0.000019844092],"about_ca_topic_score_codex":0.00072710257,"about_ca_topic_score_gemma":0.0017690614,"teacher_disagreement_score":0.006096701,"about_ca_system_score_codex":0.000457278,"about_ca_system_score_gemma":0.0002655352,"threshold_uncertainty_score":0.020395458},"labels":[],"label_agreement":null},{"id":"W2884570444","doi":"","title":"On the generalized cayley graphs of power set rings and hamiltonian cycles","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cayley graph; Hamiltonian (control theory); Combinatorics; Pure mathematics; Discrete mathematics; Graph; Mathematical optimization","score_opus":0.02443143932236593,"score_gpt":0.26881966649985106,"score_spread":0.24438822717748512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2884570444","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7498997,0.0036459041,0.09280015,0.002556332,0.0004474329,0.00009126324,0.000481696,0.0003163452,0.14976126],"genre_scores_gemma":[0.96684843,0.0018794795,0.011214985,0.0004490291,0.0004612258,0.00005247952,0.0002570109,0.000075493146,0.018761843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951565,0.0001852717,0.000020156587,0.00009047903,0.000098566015,0.000089978996],"domain_scores_gemma":[0.9984938,0.00064694765,0.0002632186,0.00016691953,0.00017486278,0.00025426812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073558616,0.0007711565,0.00084430806,0.0021507926,0.0016857722,0.0026316904,0.0011620611,0.0008121673,0.008676302],"category_scores_gemma":[0.0021217058,0.00048142025,0.0006727496,0.0020222033,0.002962678,0.005320284,0.0016584845,0.0014065612,0.0007300169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014780313,0.000011252293,0.0001697511,0.000024397961,0.000005928275,0.000049469076,0.00016222097,0.0010353081,0.00026750818,0.9942193,0.00075216155,0.0032879661],"study_design_scores_gemma":[0.0000075134676,0.0000077978975,0.00017497523,0.000009816395,0.0000068838062,0.00004883238,0.00009810879,0.0025821144,0.00009965396,0.9950944,0.0018619135,0.0000079438],"about_ca_topic_score_codex":0.0018612649,"about_ca_topic_score_gemma":0.0023422865,"teacher_disagreement_score":0.008676302,"about_ca_system_score_codex":0.0010143897,"about_ca_system_score_gemma":0.0005269696,"threshold_uncertainty_score":0.029025078},"labels":[],"label_agreement":null},{"id":"W29035179","doi":"10.7812/tpp/16-183","title":"Vertex-neighbor-scattering number of graphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Discrete mathematics; Graph","score_opus":0.005888634782495574,"score_gpt":0.21356273962100136,"score_spread":0.2076741048385058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W29035179","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51442087,0.0029952663,0.18655226,0.006723939,0.0013354734,0.00021744244,0.0034836344,0.00069745217,0.2835736],"genre_scores_gemma":[0.94006824,0.0015502383,0.03287671,0.00064452476,0.00048162584,0.00018465996,0.001260915,0.00014339152,0.022789579],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939406,0.00019482423,0.000027769003,0.00012024346,0.00016913438,0.0000939123],"domain_scores_gemma":[0.9970607,0.0017317889,0.0003651439,0.00025035016,0.0002462365,0.0003457222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005829958,0.00044142627,0.00044605718,0.0025283836,0.0015129765,0.0016036723,0.0007808488,0.00091752235,0.012438847],"category_scores_gemma":[0.0042534983,0.0002320813,0.00035790142,0.0015565028,0.001253428,0.0023901444,0.0009534559,0.0009934756,0.0016523713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009220897,0.000042547694,0.0025667327,0.00019281592,0.000030808358,0.00015514396,0.00028979182,0.004293812,0.0027525628,0.95364386,0.0117016155,0.024238093],"study_design_scores_gemma":[0.000021535488,0.000038099737,0.0018761934,0.000039711424,0.000021847856,0.000531594,0.00017349802,0.02195266,0.0014607352,0.9587286,0.01513587,0.00001981042],"about_ca_topic_score_codex":0.0006204634,"about_ca_topic_score_gemma":0.0011275874,"teacher_disagreement_score":0.012438847,"about_ca_system_score_codex":0.000788858,"about_ca_system_score_gemma":0.00039283826,"threshold_uncertainty_score":0.04161203},"labels":[],"label_agreement":null},{"id":"W29075377","doi":"10.4300/jgme-d-16-00864.1","title":"Graph Reconstruction by Permutations.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.01229706004766689,"score_gpt":0.23337963329807887,"score_spread":0.22108257325041197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W29075377","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01010976,0.00050907204,0.94239855,0.00061157515,0.0004371083,0.0003194318,0.0067535057,0.016540285,0.022320768],"genre_scores_gemma":[0.14708944,0.00081037404,0.7866383,0.0004278862,0.00018996574,0.0006957636,0.019991457,0.005745231,0.038411546],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894303,0.00025504033,0.000084261694,0.0003374034,0.00026087812,0.000119358665],"domain_scores_gemma":[0.9976726,0.00078518904,0.00013049059,0.0010101035,0.00031118758,0.0000903725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013336145,0.0012371913,0.00079839816,0.0033997775,0.0010265798,0.0022370962,0.0012479596,0.0010798399,0.05612368],"category_scores_gemma":[0.008095664,0.00072398735,0.0019681472,0.0022545413,0.00096756517,0.002459565,0.0027704532,0.0018756917,0.021916172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056388706,0.00019696848,0.0022880451,0.0009931524,0.00024139551,0.0005466888,0.0006684209,0.013165149,0.008837657,0.19234799,0.12939718,0.6507535],"study_design_scores_gemma":[0.00016477896,0.00011985466,0.00161928,0.00021709148,0.00015606581,0.0010511231,0.0005021639,0.14202559,0.012260705,0.5719804,0.2698277,0.00007522125],"about_ca_topic_score_codex":0.0024300122,"about_ca_topic_score_gemma":0.0053771134,"teacher_disagreement_score":0.05612368,"about_ca_system_score_codex":0.00056053174,"about_ca_system_score_gemma":0.0012647815,"threshold_uncertainty_score":0.18775237},"labels":[],"label_agreement":null},{"id":"W2907709303","doi":"","title":"On Generalized Total Graceful Labellings of Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01131132811106516,"score_gpt":0.23091397186822876,"score_spread":0.2196026437571636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907709303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32782283,0.002234011,0.5171253,0.0054717097,0.0005811808,0.00026553945,0.002285539,0.001891303,0.1423225],"genre_scores_gemma":[0.8467633,0.0018636093,0.11032321,0.0016951568,0.00047027797,0.00041694843,0.0028589258,0.0007492222,0.034859367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982982,0.000516259,0.00009637765,0.0004351752,0.0003366089,0.00031740492],"domain_scores_gemma":[0.99485403,0.002317946,0.00058327336,0.0013022963,0.0003488504,0.0005935962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013152913,0.0009658842,0.00094950426,0.002041927,0.002707183,0.003127651,0.0016048654,0.0016049058,0.009500491],"category_scores_gemma":[0.0057342197,0.0008300023,0.0016856791,0.0024742915,0.0032171356,0.0068723615,0.0037793308,0.003017546,0.0012752345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049731603,0.000032032705,0.00051194266,0.00009241644,0.000015672282,0.00006428737,0.00033439827,0.004401241,0.0009530505,0.97290975,0.00564231,0.014993132],"study_design_scores_gemma":[0.000014939094,0.000010843254,0.00023295713,0.000025903386,0.000014102269,0.00007643387,0.00010371369,0.009876461,0.00037757072,0.98324984,0.0060048182,0.00001228322],"about_ca_topic_score_codex":0.0023869504,"about_ca_topic_score_gemma":0.0033419698,"teacher_disagreement_score":0.009500491,"about_ca_system_score_codex":0.0025056445,"about_ca_system_score_gemma":0.0011694161,"threshold_uncertainty_score":0.03178233},"labels":[],"label_agreement":null},{"id":"W2914875335","doi":"","title":"On Harmonious Labelings of the Balanced Quadruple Shells.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.008527686614361873,"score_gpt":0.21501612014020313,"score_spread":0.20648843352584126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914875335","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35144895,0.0012964208,0.43518922,0.0023850969,0.0003575679,0.00013846434,0.0011349805,0.0009076683,0.20714162],"genre_scores_gemma":[0.8319361,0.000816104,0.12346229,0.0007904164,0.00019863495,0.00019288968,0.0011787962,0.00043858722,0.04098617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992434,0.00027509197,0.000036961388,0.00016080916,0.00013540314,0.00014843087],"domain_scores_gemma":[0.9983,0.0007471546,0.00021114627,0.0003696802,0.00016192142,0.00021011298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007246645,0.00040619055,0.0006221843,0.0011560979,0.001837975,0.0022598268,0.0010845022,0.0011437917,0.013361861],"category_scores_gemma":[0.0037245315,0.00048007135,0.0005759474,0.0011388096,0.0017538094,0.005007625,0.0024835875,0.0014799598,0.0020860068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004621134,0.00001988816,0.00022942331,0.000044276745,0.000007360045,0.000035619934,0.00012977878,0.0026183054,0.0008610396,0.97688556,0.004283119,0.014839363],"study_design_scores_gemma":[0.000014201931,0.000012301805,0.0001943357,0.000019783183,0.0000058748583,0.00008257794,0.00013130426,0.009830498,0.0006529404,0.98147017,0.007576564,0.00000940183],"about_ca_topic_score_codex":0.00081948057,"about_ca_topic_score_gemma":0.0014965635,"teacher_disagreement_score":0.013361861,"about_ca_system_score_codex":0.00089529005,"about_ca_system_score_gemma":0.00038483102,"threshold_uncertainty_score":0.044699907},"labels":[],"label_agreement":null},{"id":"W2917625227","doi":"","title":"Packing and Covering Complete Bipartite Multidigraphs with 6-circuits.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Electronic circuit; Combinatorics; Electrical engineering; Engineering; Graph","score_opus":0.006993839577240863,"score_gpt":0.18290169322766686,"score_spread":0.175907853650426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2917625227","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5319395,0.0027859835,0.25033307,0.0016325453,0.0003272616,0.00016437631,0.0020364893,0.0007518924,0.21002883],"genre_scores_gemma":[0.91030806,0.0009933988,0.045779508,0.00046889193,0.00019271989,0.00012334013,0.0017697853,0.00015002658,0.040214345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938893,0.00017627788,0.00003281731,0.00011609033,0.00013070747,0.00015528202],"domain_scores_gemma":[0.99852645,0.0007051241,0.00023410618,0.0002840657,0.000090536836,0.00015965993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028665067,0.00045932515,0.00053036696,0.0009281832,0.0010688814,0.0018919278,0.00081295666,0.0011837471,0.013698249],"category_scores_gemma":[0.0021715043,0.0005080131,0.0005859857,0.0014529777,0.000843266,0.0026525133,0.0014589556,0.0009867384,0.0016652707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022270693,0.00011600675,0.0011475587,0.00024290875,0.000052365383,0.0005918463,0.00038792967,0.020853668,0.004036022,0.9170382,0.01337389,0.04193694],"study_design_scores_gemma":[0.00004761248,0.000050730898,0.0015030634,0.00008007004,0.000035006477,0.0007625578,0.00026503127,0.06445685,0.0034391256,0.91044945,0.018885856,0.0000247113],"about_ca_topic_score_codex":0.001177837,"about_ca_topic_score_gemma":0.00160349,"teacher_disagreement_score":0.013698249,"about_ca_system_score_codex":0.00083622016,"about_ca_system_score_gemma":0.000401152,"threshold_uncertainty_score":0.045825183},"labels":[],"label_agreement":null},{"id":"W2918178814","doi":"","title":"Perfect 3-colorings of the Johnson graphs J(4, 2), J(5, 2), J(6, 2) and Petersen graph.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Petersen graph; Graph; Discrete mathematics; Line graph; Graph power","score_opus":0.005587126409057125,"score_gpt":0.18520435595357926,"score_spread":0.17961722954452214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918178814","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78828645,0.0006899829,0.06620731,0.0013810139,0.0003052051,0.000091514696,0.0016927685,0.00056927965,0.14077641],"genre_scores_gemma":[0.96833,0.00023012148,0.0145081,0.00025731686,0.000052170366,0.000042526884,0.00066248415,0.00008396164,0.015833344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950266,0.00012928652,0.000022288094,0.00007786212,0.00009974047,0.00016812973],"domain_scores_gemma":[0.9982114,0.00067218905,0.00034987865,0.0002685336,0.00021284958,0.00028521888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033046544,0.00036025676,0.00027108716,0.0011759726,0.0018832424,0.0017824006,0.0005552124,0.0006913896,0.010411704],"category_scores_gemma":[0.0020895356,0.0005361941,0.00049503765,0.00075202656,0.0012188031,0.0016189042,0.00092967675,0.0008520416,0.00086088135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033650507,0.000092449096,0.0025930575,0.000095395204,0.000036099776,0.00045709373,0.00051694736,0.01374883,0.006651252,0.9461793,0.012802908,0.01649022],"study_design_scores_gemma":[0.00005585501,0.000059286125,0.0050307373,0.000050127062,0.000041261013,0.0006034698,0.0007976926,0.036308847,0.005607852,0.9353938,0.01600138,0.00004961077],"about_ca_topic_score_codex":0.0038373617,"about_ca_topic_score_gemma":0.007685971,"teacher_disagreement_score":0.010411704,"about_ca_system_score_codex":0.0009858082,"about_ca_system_score_gemma":0.000870998,"threshold_uncertainty_score":0.03483063},"labels":[],"label_agreement":null},{"id":"W2918186528","doi":"","title":"Further results on Wiener, Harary indices and graph properties.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Wiener index; Graph; Combinatorics","score_opus":0.03681575060499444,"score_gpt":0.27271480358290334,"score_spread":0.23589905297790892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918186528","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07640829,0.0149951475,0.18520318,0.011502597,0.0024473956,0.00007421288,0.0013195553,0.0006564894,0.70739317],"genre_scores_gemma":[0.75364834,0.016829828,0.06254631,0.0048504607,0.0033372894,0.00014422975,0.0018636445,0.00080305844,0.1559768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994165,0.00015358801,0.000031552932,0.00013408775,0.0001722008,0.00009208336],"domain_scores_gemma":[0.997561,0.0012467114,0.00026026068,0.00035017895,0.00034138237,0.00024034831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001014107,0.0010378442,0.0008686525,0.0030874442,0.0016135045,0.0026621227,0.0010044498,0.0012286988,0.025547644],"category_scores_gemma":[0.005684756,0.00035899493,0.0011061745,0.0030853488,0.002339164,0.008758245,0.0024904404,0.0038463403,0.0042630453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002601703,0.000040059167,0.00038304002,0.0001374104,0.000016271479,0.00010631263,0.00024946244,0.00060149044,0.0013214893,0.9726089,0.0093386695,0.0151707735],"study_design_scores_gemma":[0.0000036195731,0.000009567842,0.000550673,0.000025029922,0.000012040634,0.00012837282,0.00013199852,0.0010211803,0.0004137398,0.9838464,0.013847873,0.000009377523],"about_ca_topic_score_codex":0.0011810997,"about_ca_topic_score_gemma":0.002092001,"teacher_disagreement_score":0.025547644,"about_ca_system_score_codex":0.00097134244,"about_ca_system_score_gemma":0.00049771275,"threshold_uncertainty_score":0.08546543},"labels":[],"label_agreement":null},{"id":"W2918194691","doi":"","title":"Fault Tolerance of λ-Optimal Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Fault tolerance; Computer science; Distributed computing","score_opus":0.01390735851180608,"score_gpt":0.257362109362107,"score_spread":0.24345475085030094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918194691","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33122241,0.002182744,0.6144287,0.00284252,0.00033098934,0.00010473393,0.0007851376,0.0014070467,0.046695687],"genre_scores_gemma":[0.9312192,0.0006289006,0.057193354,0.00029623616,0.00009761437,0.000084041225,0.00047288995,0.00020727057,0.009800531],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992094,0.00022078944,0.00003985131,0.0001542875,0.00016625201,0.00020931235],"domain_scores_gemma":[0.99610245,0.0024140356,0.00045697793,0.00052046095,0.00026377288,0.00024235787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008715289,0.0005297162,0.0006859406,0.0009725879,0.0007081257,0.0013697069,0.0012636387,0.0009402372,0.006641257],"category_scores_gemma":[0.009518129,0.00033250664,0.00044676315,0.0011190701,0.0009940857,0.002297728,0.0012661592,0.0012725239,0.00076103135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049393304,0.00018792255,0.0022344603,0.00035972556,0.00007379733,0.00016947968,0.00021734947,0.4900825,0.0045907847,0.35380664,0.015582204,0.13220114],"study_design_scores_gemma":[0.000041910498,0.00008073723,0.0005572256,0.00006096302,0.000022201046,0.00011979325,0.00013424027,0.39742234,0.00350162,0.593688,0.004355645,0.000015211843],"about_ca_topic_score_codex":0.0019172161,"about_ca_topic_score_gemma":0.0017879443,"teacher_disagreement_score":0.006641257,"about_ca_system_score_codex":0.0015692523,"about_ca_system_score_gemma":0.00088359165,"threshold_uncertainty_score":0.022217274},"labels":[],"label_agreement":null},{"id":"W2918205015","doi":"","title":"Kernels in tensor product of digraphs I.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Tensor product; Product (mathematics); Tensor (intrinsic definition); Pure mathematics; Geometry","score_opus":0.014581871548918197,"score_gpt":0.24800408702177096,"score_spread":0.23342221547285277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918205015","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36808276,0.0013142388,0.5752957,0.0009625746,0.00024117103,0.00012283592,0.001466735,0.0016826291,0.050831404],"genre_scores_gemma":[0.9093658,0.0006717883,0.06690836,0.00021659568,0.0001636198,0.00007901089,0.0011973539,0.00035638092,0.02104132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985789,0.00027716983,0.00016019361,0.00042915478,0.00032312475,0.00023150149],"domain_scores_gemma":[0.99589866,0.001272426,0.0006592303,0.00079831143,0.0006714476,0.00069986423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011263137,0.0005501859,0.0006652517,0.0032179216,0.0015347089,0.0053729094,0.00094479416,0.0008477313,0.007158456],"category_scores_gemma":[0.005423511,0.00059380353,0.0009956231,0.0023478465,0.002229986,0.0075932145,0.0026555664,0.0015651718,0.0015582986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056539375,0.000046816855,0.0014543907,0.000079360136,0.000023551369,0.00019503899,0.00053156726,0.0018806387,0.0014719747,0.9787893,0.0021418186,0.013329088],"study_design_scores_gemma":[0.000009355244,0.00004285572,0.0008996731,0.000044953118,0.00004494476,0.00050662673,0.00033538562,0.023772402,0.0018667866,0.9619119,0.010535654,0.000029367246],"about_ca_topic_score_codex":0.0020729878,"about_ca_topic_score_gemma":0.0019098351,"teacher_disagreement_score":0.007158456,"about_ca_system_score_codex":0.0015875379,"about_ca_system_score_gemma":0.00067547645,"threshold_uncertainty_score":0.023947418},"labels":[],"label_agreement":null},{"id":"W2918261503","doi":"","title":"Tetravalent Normal Primitive Cayley Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cayley graph; Combinatorics; Graph","score_opus":0.011346234755462443,"score_gpt":0.22712490365238494,"score_spread":0.2157786688969225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918261503","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3620462,0.0014379626,0.2046489,0.0040986505,0.001018096,0.00013133774,0.0025253366,0.001520479,0.4225731],"genre_scores_gemma":[0.8603245,0.0010035306,0.057228744,0.00094616954,0.00027813247,0.00010846009,0.0025724927,0.00030883236,0.07722916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949324,0.000099072044,0.00002586155,0.00014518536,0.00012985335,0.00010671548],"domain_scores_gemma":[0.998599,0.00047318364,0.00019483212,0.00030985297,0.00020611545,0.00021707459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035575352,0.0003816634,0.0004945978,0.0012120382,0.0016347193,0.002398252,0.0011992977,0.0008945193,0.020845138],"category_scores_gemma":[0.0017834855,0.0003432244,0.00041678327,0.0014980279,0.0014328859,0.0034465918,0.0014683804,0.0021237351,0.003145934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046213096,0.000031362822,0.00032517163,0.00005139009,0.000005725709,0.00006127223,0.00009229851,0.0010609254,0.0015535144,0.9720168,0.009063103,0.01569211],"study_design_scores_gemma":[0.000014452297,0.00001650153,0.00026738935,0.000019038538,0.000007354914,0.00017459845,0.00016560455,0.00636922,0.0017607611,0.97442526,0.016768437,0.0000113274245],"about_ca_topic_score_codex":0.0012657847,"about_ca_topic_score_gemma":0.0027405613,"teacher_disagreement_score":0.020845138,"about_ca_system_score_codex":0.0013587957,"about_ca_system_score_gemma":0.0005798123,"threshold_uncertainty_score":0.06973398},"labels":[],"label_agreement":null},{"id":"W2918284848","doi":"","title":"Adjacent vertex distinguishing incidence coloring of the tours and cylinder.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Color perception and design","field":"Psychology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Cylinder; Incidence (geometry); Fractional coloring; Combinatorics; Geometry; Graph","score_opus":0.02911012978872399,"score_gpt":0.3061972292388588,"score_spread":0.27708709945013477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918284848","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35657534,0.00029632598,0.4121079,0.0004739834,0.0002890525,0.00010993945,0.000548441,0.0014781806,0.22812094],"genre_scores_gemma":[0.9002305,0.00012908898,0.08173831,0.00006551289,0.00002182825,0.00004050592,0.00033889507,0.00023739116,0.017197968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973947,0.00006988849,0.000011429533,0.00006216651,0.00005566935,0.00006141548],"domain_scores_gemma":[0.998963,0.00039499195,0.00007588417,0.00022361914,0.00021383193,0.0001286452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020891975,0.0002578714,0.00019868425,0.0005411583,0.00072023174,0.0013711113,0.00041606312,0.00035733002,0.014694062],"category_scores_gemma":[0.0019285502,0.00020631288,0.0003299611,0.00039261454,0.0009517822,0.0010813773,0.00069909496,0.000530022,0.0010896879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049215904,0.00008586497,0.0028072952,0.00015766395,0.00001615013,0.00020740234,0.0008174472,0.007628793,0.032945346,0.83172977,0.009234534,0.11387752],"study_design_scores_gemma":[0.00008870185,0.00024642996,0.01139991,0.00008367232,0.00005945275,0.00094542105,0.0016014948,0.15533292,0.03468683,0.7372209,0.05823349,0.000100809375],"about_ca_topic_score_codex":0.004544371,"about_ca_topic_score_gemma":0.008201978,"teacher_disagreement_score":0.014694062,"about_ca_system_score_codex":0.00065673294,"about_ca_system_score_gemma":0.00058700313,"threshold_uncertainty_score":0.049156547},"labels":[],"label_agreement":null},{"id":"W2918293970","doi":"","title":"Bicyclic graphs with the second up to eighth largest hyper-Wiener indices.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bicyclic molecule; Wiener index; Combinatorics; Statistics; Graph; Medicinal chemistry; Chemistry","score_opus":0.019580191362177524,"score_gpt":0.27085861240031606,"score_spread":0.2512784210381385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918293970","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.581316,0.0026780318,0.08403478,0.0015215916,0.0005842752,0.00010866606,0.0018017825,0.0007127048,0.32724226],"genre_scores_gemma":[0.94503576,0.00089914654,0.01636584,0.00045519925,0.00010769316,0.00008768244,0.0007247335,0.000132668,0.036191296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969625,0.00005494625,0.000015975591,0.000049541333,0.00008396348,0.00009924216],"domain_scores_gemma":[0.999292,0.00017537063,0.00011883066,0.00013774468,0.00013443247,0.0001414875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021279218,0.0003884679,0.00042895015,0.0012757095,0.0009806588,0.0015452116,0.0005087982,0.0007261141,0.009133427],"category_scores_gemma":[0.0017754777,0.00033171856,0.0002484818,0.0009880267,0.0008744956,0.0014407597,0.0014575904,0.0011384804,0.0021102089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017129166,0.00002691628,0.00080490427,0.00010783035,0.000015371987,0.00030202308,0.0002431072,0.0018594243,0.009081499,0.9573972,0.0071246875,0.02286577],"study_design_scores_gemma":[0.00003612239,0.000050467534,0.0018046302,0.00009260137,0.00003105522,0.00083657604,0.00029052558,0.008776888,0.008481609,0.95504063,0.024512947,0.000046024586],"about_ca_topic_score_codex":0.0007823343,"about_ca_topic_score_gemma":0.0018455611,"teacher_disagreement_score":0.009133427,"about_ca_system_score_codex":0.0004653308,"about_ca_system_score_gemma":0.00047774275,"threshold_uncertainty_score":0.030554354},"labels":[],"label_agreement":null},{"id":"W2918354268","doi":"","title":"Labeling Total Graphs with a Condition at Distance Two.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.007904088926362404,"score_gpt":0.22793766373462704,"score_spread":0.22003357480826463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918354268","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35416698,0.0012306554,0.4037362,0.007441536,0.0010059505,0.00028469344,0.00748238,0.00331122,0.22134039],"genre_scores_gemma":[0.7898835,0.0007275258,0.1618602,0.0024022448,0.00041373135,0.00029921308,0.0070543485,0.001036797,0.036322378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813795,0.0005030179,0.00015492357,0.0004979303,0.0003737976,0.00033246932],"domain_scores_gemma":[0.9889665,0.006484257,0.0006954296,0.00223345,0.0007826715,0.0008375485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016175383,0.0007058175,0.0008921428,0.0013764808,0.002430603,0.0036366745,0.0020186622,0.0021808636,0.019963123],"category_scores_gemma":[0.012791194,0.00071751984,0.0009548568,0.0021177912,0.0023064646,0.007924802,0.0035804962,0.0034456912,0.002768425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006888292,0.00024790358,0.0019980904,0.0004704208,0.00005174755,0.00014884608,0.00047153403,0.0067996127,0.007968422,0.891553,0.038382173,0.051219366],"study_design_scores_gemma":[0.00010328087,0.000103343045,0.0011277221,0.00009848497,0.000053609012,0.00031551725,0.0005067001,0.018154342,0.006975656,0.9492984,0.023215739,0.000047251528],"about_ca_topic_score_codex":0.0020594923,"about_ca_topic_score_gemma":0.0031575465,"teacher_disagreement_score":0.019963123,"about_ca_system_score_codex":0.0020366448,"about_ca_system_score_gemma":0.0018171507,"threshold_uncertainty_score":0.06678325},"labels":[],"label_agreement":null},{"id":"W2918381582","doi":"","title":"On Some Generalized Geometric Sequences, Stirling Numbers and Euler Polynomials.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Stirling number; Euler's formula; Stirling numbers of the second kind; Stirling numbers of the first kind; Stirling engine; Bell polynomials; Pure mathematics; Mathematical analysis","score_opus":0.034242903030022365,"score_gpt":0.3115542687280929,"score_spread":0.2773113656980705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918381582","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24091808,0.022739006,0.17487977,0.007975349,0.0024616225,0.00007980891,0.0008227372,0.00034644027,0.5497772],"genre_scores_gemma":[0.85108864,0.01595638,0.037233368,0.0019319386,0.0028659895,0.00013911702,0.00077663426,0.00017533857,0.0898327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996006,0.000115306706,0.000020529205,0.00006366063,0.000113156304,0.00008672901],"domain_scores_gemma":[0.9990097,0.00043240923,0.0001453621,0.000096834156,0.00017658682,0.00013892233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008428033,0.0008622536,0.0006877886,0.0027671247,0.0014730919,0.0022355693,0.0007639181,0.0009395615,0.010094388],"category_scores_gemma":[0.0038141932,0.0003107257,0.000672571,0.0026345644,0.003143178,0.005232643,0.0019312808,0.0022927774,0.0018523284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010393393,0.000006028857,0.00007333999,0.000030737596,0.0000026586274,0.000034627865,0.00008114358,0.00039800344,0.00018705585,0.99388313,0.0012997461,0.0039931736],"study_design_scores_gemma":[0.0000036604897,0.000008225631,0.00014454816,0.000017817028,0.0000035829723,0.00006946061,0.00005136805,0.0008991508,0.00008838024,0.99383956,0.0048687663,0.0000056368444],"about_ca_topic_score_codex":0.0011831614,"about_ca_topic_score_gemma":0.0015178251,"teacher_disagreement_score":0.010094388,"about_ca_system_score_codex":0.0012774713,"about_ca_system_score_gemma":0.00064101303,"threshold_uncertainty_score":0.03376907},"labels":[],"label_agreement":null},{"id":"W2918425817","doi":"","title":"Nodal domain count and vertex bipartiteness.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Domain (mathematical analysis); NODAL; Combinatorics; Mathematical analysis; Medicine; Internal medicine; Graph","score_opus":0.021537351238621,"score_gpt":0.2643967134972387,"score_spread":0.2428593622586177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918425817","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5671467,0.0020845304,0.20088366,0.0028851237,0.00026957155,0.00007212451,0.0014987986,0.00047502932,0.22468436],"genre_scores_gemma":[0.97576445,0.0005990194,0.010446682,0.00015850365,0.00017375314,0.000052085194,0.0005128378,0.0000842887,0.0122082895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883944,0.0003853574,0.00005582675,0.0002712872,0.0002374168,0.00021063029],"domain_scores_gemma":[0.9928965,0.0034935472,0.0010552007,0.0006175799,0.0008126998,0.0011244644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017803032,0.00041375213,0.00078331446,0.0033759035,0.0014757715,0.0029053742,0.0013678435,0.0008674688,0.012902399],"category_scores_gemma":[0.009214497,0.0003686515,0.00046001095,0.0019321938,0.003708461,0.006796701,0.0024056744,0.0013513023,0.0013396173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003197701,0.000012755192,0.0010381892,0.000039856994,0.000008465189,0.000029006895,0.00010032783,0.0005817108,0.00038494615,0.99314016,0.0011726845,0.0034598152],"study_design_scores_gemma":[0.000015222856,0.000012867026,0.0011364722,0.000029991721,0.000024695939,0.00017150016,0.00019256369,0.006742631,0.0006402485,0.98767763,0.003341491,0.0000146865505],"about_ca_topic_score_codex":0.0010760624,"about_ca_topic_score_gemma":0.0014354639,"teacher_disagreement_score":0.012902399,"about_ca_system_score_codex":0.0008946485,"about_ca_system_score_gemma":0.00043588065,"threshold_uncertainty_score":0.043162882},"labels":[],"label_agreement":null},{"id":"W2918475526","doi":"","title":"Spectral characterizations of graphs with at most two (signless) Laplacian eigenvalues greater than 2.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Combinatorics; Discrete mathematics; Physics","score_opus":0.021813250109894104,"score_gpt":0.2722463776423414,"score_spread":0.2504331275324473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918475526","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.741722,0.0010045833,0.14556324,0.0021353858,0.00029020343,0.00006931657,0.001419202,0.0007228342,0.107073285],"genre_scores_gemma":[0.98280966,0.00025885704,0.009421695,0.00029648712,0.00016834223,0.00006194034,0.00071659934,0.00010802845,0.0061582527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965596,0.00008153243,0.000017356111,0.0000844758,0.000082407016,0.0000781878],"domain_scores_gemma":[0.9978635,0.0009230597,0.00037019965,0.00022166535,0.00031417506,0.0003075119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031311603,0.0005936725,0.0002839808,0.002484819,0.00082640717,0.0013097147,0.00070314365,0.0008568105,0.008115092],"category_scores_gemma":[0.003104659,0.0002479271,0.0003257745,0.0010144705,0.0012718006,0.0020164337,0.0009999254,0.0011374517,0.001468733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034403216,0.0001363259,0.003005836,0.00023565182,0.000027422084,0.0005504428,0.0010695609,0.0065400717,0.03644153,0.90163875,0.0154755,0.03453485],"study_design_scores_gemma":[0.000032455384,0.000056794877,0.0025252677,0.000050190756,0.000017531122,0.000994169,0.0008820319,0.030668635,0.0055251443,0.9519975,0.0072112,0.000039109706],"about_ca_topic_score_codex":0.0002484882,"about_ca_topic_score_gemma":0.00028703708,"teacher_disagreement_score":0.008115092,"about_ca_system_score_codex":0.00038235512,"about_ca_system_score_gemma":0.00021066662,"threshold_uncertainty_score":0.02714765},"labels":[],"label_agreement":null},{"id":"W2918493888","doi":"","title":"The linear programming approach to the harmonic index of a graph with minimum degree at least three.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Index (typography); Graph; Combinatorics; Computer science; Programming language","score_opus":0.046279962539619524,"score_gpt":0.27706904114541014,"score_spread":0.23078907860579062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918493888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060681142,0.0015004463,0.8227828,0.0031671177,0.0002513888,0.00008022671,0.0006400741,0.00021074708,0.11068611],"genre_scores_gemma":[0.62222546,0.0022789955,0.29726171,0.0009634104,0.0009709694,0.0003319646,0.00093667745,0.00057249673,0.07445832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955744,0.00014958082,0.000011762548,0.00009120326,0.00011028736,0.0000796292],"domain_scores_gemma":[0.99846447,0.001074765,0.000113957525,0.00009240716,0.00014004951,0.00011438249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060158386,0.0005422956,0.0006185787,0.0015450389,0.0007970029,0.0021031278,0.0017394238,0.0008451242,0.011942415],"category_scores_gemma":[0.004109176,0.0003866529,0.00062677276,0.0015853543,0.0016521637,0.0033339444,0.0013442489,0.0031150915,0.0014877822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003510548,0.000046649442,0.00026119984,0.00010589358,0.000017799402,0.00003367341,0.00013558212,0.027460042,0.00087341055,0.9301803,0.0068675512,0.03398277],"study_design_scores_gemma":[0.0000075273706,0.000018348617,0.00015210443,0.000017964643,0.000009062536,0.000028689792,0.00006485464,0.11648791,0.0004337052,0.879043,0.0037260188,0.000010704277],"about_ca_topic_score_codex":0.0028356856,"about_ca_topic_score_gemma":0.0037150895,"teacher_disagreement_score":0.011942415,"about_ca_system_score_codex":0.0016811835,"about_ca_system_score_gemma":0.0009531653,"threshold_uncertainty_score":0.039951384},"labels":[],"label_agreement":null},{"id":"W2918538746","doi":"","title":"The Domination Cover Pebbling Number For Some Cyclic Graphs And Path Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Path (computing); Indifference graph; Cover (algebra); Pathwidth; Chordal graph; Discrete mathematics; Graph; Computer science; Line graph; Computer network","score_opus":0.014403940922441131,"score_gpt":0.2921953203004329,"score_spread":0.27779137937799175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918538746","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79910564,0.0016215309,0.05888929,0.0028469027,0.0001941244,0.00007800792,0.0017429449,0.00041656155,0.13510495],"genre_scores_gemma":[0.97667515,0.0006747282,0.011742834,0.00016839162,0.00012969083,0.00009588792,0.0005849974,0.00007447659,0.00985382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999468,0.00010130658,0.000024584935,0.00012050952,0.00014893405,0.00013667882],"domain_scores_gemma":[0.9954516,0.0031695494,0.00042295794,0.00028002064,0.00024887366,0.00042702857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006093697,0.00042848103,0.00048233426,0.0021909717,0.0015444608,0.002229273,0.0010339618,0.00108457,0.011651105],"category_scores_gemma":[0.0061655343,0.00030773075,0.0003542134,0.0018377806,0.0014451866,0.0037090145,0.0010056042,0.0014221978,0.00089878496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004669755,0.00010109591,0.0043798,0.00025673833,0.000046319346,0.00034456298,0.0005725938,0.014772242,0.0077419695,0.9069616,0.015306275,0.04904975],"study_design_scores_gemma":[0.000050628056,0.00006196492,0.0034219662,0.000059155034,0.000052083844,0.0008065065,0.00025969552,0.053023454,0.0044184546,0.92611265,0.011695197,0.000038277118],"about_ca_topic_score_codex":0.0011823633,"about_ca_topic_score_gemma":0.0014724847,"teacher_disagreement_score":0.011651105,"about_ca_system_score_codex":0.0014975978,"about_ca_system_score_gemma":0.0007064561,"threshold_uncertainty_score":0.03897679},"labels":[],"label_agreement":null},{"id":"W2918625433","doi":"","title":"The corona between paths and cycles.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Solar and Space Plasma Dynamics","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Corona (planetary geology); Mathematics; Physics; Astrobiology","score_opus":0.007262118702023717,"score_gpt":0.23418032954645948,"score_spread":0.22691821084443575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918625433","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17205375,0.012663993,0.1675421,0.01173391,0.001356772,0.00011197864,0.0036599129,0.00095741736,0.62992024],"genre_scores_gemma":[0.8702401,0.0056684436,0.028695412,0.0024049496,0.0016826538,0.00016439363,0.002413743,0.0004963694,0.088234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992737,0.00018410767,0.000046233064,0.0002782627,0.00012331994,0.00009442399],"domain_scores_gemma":[0.997336,0.0011530806,0.00039607406,0.00044660736,0.00032355124,0.0003447639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060613203,0.00054019486,0.00065893226,0.0026967393,0.002558425,0.0062281,0.00084133295,0.0009935441,0.02509114],"category_scores_gemma":[0.0053600133,0.0004751887,0.0007978779,0.0028249088,0.003516419,0.014538392,0.0031741702,0.0020385804,0.0025560558],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001416892,0.000004672815,0.000250854,0.00003276013,0.0000068346476,0.000049800594,0.00015672717,0.00018050613,0.000075205404,0.99056107,0.0027783206,0.0058889925],"study_design_scores_gemma":[0.0000075366283,0.0000059377403,0.0003074387,0.000025575084,0.00000780106,0.00013966138,0.00015494943,0.00051139435,0.000057118894,0.9711732,0.027603554,0.00000589319],"about_ca_topic_score_codex":0.002262006,"about_ca_topic_score_gemma":0.0025190902,"teacher_disagreement_score":0.02509114,"about_ca_system_score_codex":0.0015878961,"about_ca_system_score_gemma":0.00075365265,"threshold_uncertainty_score":0.08393824},"labels":[],"label_agreement":null},{"id":"W2918627044","doi":"","title":"The Feedback Number of Knodel graph W3, n.","year":2018,"lang":"it","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics; Discrete mathematics","score_opus":0.014242571200523047,"score_gpt":0.24997111424620916,"score_spread":0.2357285430456861,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918627044","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7214799,0.0017051792,0.14879562,0.008143812,0.0006274745,0.00018868665,0.008106828,0.0019833336,0.10896908],"genre_scores_gemma":[0.94952744,0.0004456369,0.020587893,0.0005910907,0.00017424684,0.00020051425,0.0020904816,0.0002770381,0.026105652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916565,0.00019084115,0.0000356883,0.00023781753,0.00017062166,0.00019942195],"domain_scores_gemma":[0.9951871,0.0026419265,0.0005515284,0.00048358427,0.0004613256,0.000674472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008482493,0.00048253502,0.00066856184,0.0010301273,0.0016800362,0.0021738478,0.0015711362,0.0014303535,0.016211014],"category_scores_gemma":[0.009312788,0.00030522785,0.0003685271,0.0007274883,0.0012621809,0.0047274516,0.0011414204,0.0012895997,0.0016222554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010815773,0.0002031118,0.004622552,0.0007284049,0.000051303945,0.00017185447,0.00051521324,0.024042262,0.015416972,0.84976524,0.04650046,0.056901053],"study_design_scores_gemma":[0.000103644226,0.00011988661,0.00326867,0.00012972948,0.000049098337,0.00030672154,0.00042871467,0.10396218,0.011535701,0.8608092,0.01922461,0.00006177817],"about_ca_topic_score_codex":0.0020917153,"about_ca_topic_score_gemma":0.0031060379,"teacher_disagreement_score":0.016211014,"about_ca_system_score_codex":0.0017526386,"about_ca_system_score_gemma":0.0011549362,"threshold_uncertainty_score":0.054231226},"labels":[],"label_agreement":null},{"id":"W2918673021","doi":"","title":"On Fibonacci and Lucas Generalized Octonions.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Mathematics; Lucas number; Lucas sequence; Fibonacci polynomials; Pisano period; Pure mathematics; Algebra over a field; Discrete mathematics; Orthogonal polynomials; Classical orthogonal polynomials","score_opus":0.00944649346428206,"score_gpt":0.2757388518394225,"score_spread":0.2662923583751404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918673021","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1448166,0.015943777,0.11097469,0.0072737313,0.003596067,0.00011087688,0.0005840765,0.00034226858,0.71635795],"genre_scores_gemma":[0.8225581,0.008162098,0.03593907,0.002734938,0.002376144,0.0001788508,0.00059287745,0.00026188497,0.12719601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995666,0.00012393588,0.000021263982,0.000054445914,0.00013107715,0.00010270541],"domain_scores_gemma":[0.9992834,0.0003224609,0.00008637591,0.00008278567,0.00013985953,0.00008514617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060542073,0.00096172496,0.0007112754,0.0031193513,0.0023548163,0.0030310652,0.00073653413,0.0014790179,0.014561291],"category_scores_gemma":[0.0028382554,0.00039464858,0.0007835067,0.001812067,0.003579554,0.005490964,0.0019891388,0.0023551276,0.002668765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004695303,0.0000032066393,0.000027107924,0.000012682421,0.0000012204459,0.000033618453,0.00005448493,0.00018261353,0.00008979638,0.9963148,0.001288534,0.0019872321],"study_design_scores_gemma":[0.0000031257014,0.000004239694,0.00007251402,0.000014790566,0.0000018155504,0.00006997521,0.00004617657,0.0008138684,0.00005930756,0.9928939,0.0060143876,0.0000058667183],"about_ca_topic_score_codex":0.001999688,"about_ca_topic_score_gemma":0.0029466068,"teacher_disagreement_score":0.014561291,"about_ca_system_score_codex":0.0017996836,"about_ca_system_score_gemma":0.0006007614,"threshold_uncertainty_score":0.048712373},"labels":[],"label_agreement":null},{"id":"W2918733661","doi":"","title":"On the connective eccentricity index of graphs with fixed clique number.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Clique; Eccentricity (behavior); Combinatorics; Index (typography); Computer science; Political science","score_opus":0.019004138609064206,"score_gpt":0.2799922236122643,"score_spread":0.2609880850032001,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918733661","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73459643,0.0026048084,0.14755046,0.0025046663,0.00035411422,0.000051188,0.0008070429,0.00035764626,0.11117367],"genre_scores_gemma":[0.9758883,0.0007648391,0.015970381,0.00022090352,0.00035608409,0.000047700392,0.00027414758,0.00015415816,0.0063234926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992918,0.00021960976,0.00002770033,0.00016809955,0.00016534685,0.00012735483],"domain_scores_gemma":[0.9874938,0.008647039,0.0013165326,0.0007504196,0.0006753239,0.0011168564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016983835,0.0005275591,0.00081277237,0.0031322513,0.001405237,0.0024285354,0.0017623545,0.0011243648,0.006088662],"category_scores_gemma":[0.014363603,0.00040017883,0.000315516,0.0017849783,0.0027281267,0.0060181883,0.0016733595,0.0019597746,0.00081519195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002422872,0.000057703008,0.002240052,0.00012396886,0.000020885314,0.00016133313,0.00034639277,0.006750887,0.0033222055,0.9710877,0.0035573163,0.012089218],"study_design_scores_gemma":[0.000033820197,0.00003090414,0.0013968651,0.000051626226,0.000025526851,0.00030723077,0.00015153865,0.030647164,0.0011562404,0.9636023,0.0025719407,0.000024737392],"about_ca_topic_score_codex":0.00061333046,"about_ca_topic_score_gemma":0.00079242466,"teacher_disagreement_score":0.006088662,"about_ca_system_score_codex":0.0013828541,"about_ca_system_score_gemma":0.0003962865,"threshold_uncertainty_score":0.020368636},"labels":[],"label_agreement":null},{"id":"W2918744402","doi":"","title":"Iterative algorithm for computing irregularity strength of complete graph.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Algorithm; Graph; Combinatorics","score_opus":0.01930189634969985,"score_gpt":0.2559862754358235,"score_spread":0.2366843790861236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918744402","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022336308,0.00018225939,0.97104216,0.00017003826,0.00007873373,0.00012054872,0.0002548072,0.0011597609,0.004655355],"genre_scores_gemma":[0.18083756,0.00012549665,0.8132262,0.000096431984,0.0000509183,0.0003157595,0.00096039916,0.00025546367,0.0041316715],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991647,0.00026351956,0.000050147417,0.00016404834,0.00024487227,0.00011268802],"domain_scores_gemma":[0.99702954,0.0012188071,0.00018189708,0.0006161705,0.0007731094,0.000180454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012033456,0.0006535258,0.00088948273,0.0019642585,0.0007525818,0.0012696566,0.0020429883,0.0010261417,0.0076626795],"category_scores_gemma":[0.0073752627,0.00043257274,0.00081995357,0.0015233068,0.00089044514,0.0017909501,0.002208703,0.0014059036,0.0019272886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081983465,0.00038157133,0.0066131535,0.0006026012,0.00025190256,0.00020966008,0.0005559391,0.18536186,0.016677422,0.17843238,0.024540164,0.5855534],"study_design_scores_gemma":[0.000097424905,0.00012883177,0.0011378742,0.000037268277,0.00004567546,0.00014521503,0.00012789517,0.8679311,0.005355821,0.11948769,0.005473769,0.000031391595],"about_ca_topic_score_codex":0.0032033222,"about_ca_topic_score_gemma":0.006232142,"teacher_disagreement_score":0.0076626795,"about_ca_system_score_codex":0.0009302784,"about_ca_system_score_gemma":0.0019471684,"threshold_uncertainty_score":0.02563423},"labels":[],"label_agreement":null},{"id":"W2918756888","doi":"","title":"Formulae for two weighted binomial identities with the falling factorials","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Falling (accident); Binomial (polynomial); Statistics; Psychology","score_opus":0.014469807073312907,"score_gpt":0.249990376373861,"score_spread":0.2355205693005481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918756888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12628971,0.001006526,0.6011851,0.003148715,0.0018844183,0.00019144303,0.00058892736,0.0009379385,0.26476726],"genre_scores_gemma":[0.7282618,0.00069619174,0.17121205,0.0015827172,0.001017633,0.00033605087,0.00065760117,0.0009699513,0.09526591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982436,0.0003808705,0.00014182541,0.00028258664,0.0006080179,0.0003432036],"domain_scores_gemma":[0.9984383,0.00059866626,0.00012300785,0.0002677522,0.00032988185,0.00024235279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024429543,0.0010443472,0.0011911297,0.0029761274,0.0031729497,0.0053899335,0.002073878,0.002366502,0.016258955],"category_scores_gemma":[0.006360327,0.0008408773,0.0015698605,0.0025840497,0.0040403316,0.00863921,0.003601847,0.0036302574,0.0038185294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010797838,0.000010527538,0.000055528126,0.000012169663,0.0000022468287,0.00006280686,0.00010377898,0.000104639716,0.00032291605,0.99507624,0.000977653,0.0032607412],"study_design_scores_gemma":[0.000009272642,0.000005338294,0.0000632652,0.000013307272,0.0000061006062,0.000107732645,0.000038400984,0.0021048298,0.00042678244,0.9931852,0.0040248996,0.000014865934],"about_ca_topic_score_codex":0.0008361652,"about_ca_topic_score_gemma":0.0010750168,"teacher_disagreement_score":0.016258955,"about_ca_system_score_codex":0.0022974352,"about_ca_system_score_gemma":0.0009655999,"threshold_uncertainty_score":0.054391623},"labels":[],"label_agreement":null},{"id":"W2918779763","doi":"","title":"The spectrum Meta(K2, 3 > C4, λ).","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Magnetism in coordination complexes","field":"Materials Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectrum (functional analysis); Physics","score_opus":0.023472312717372833,"score_gpt":0.26419774724876804,"score_spread":0.24072543453139522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918779763","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33203208,0.0012859785,0.030361162,0.003645807,0.001453631,0.00006487235,0.0015137059,0.0013607305,0.628282],"genre_scores_gemma":[0.948123,0.00032858233,0.006525703,0.00090735214,0.00017801579,0.00006978177,0.00050689693,0.00031552927,0.043045152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977654,0.000027604012,0.000009177583,0.000049421862,0.000069706904,0.00006750524],"domain_scores_gemma":[0.99980515,0.000037182257,0.000030717416,0.00003661146,0.000033400345,0.000056927413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017227218,0.00041443287,0.00024411175,0.0014934858,0.0017281924,0.0019691873,0.00067702745,0.0007909792,0.026297893],"category_scores_gemma":[0.0004900701,0.00015538352,0.0002375827,0.0004832637,0.00096991926,0.0014979395,0.0011951978,0.00083265326,0.0027400895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000140378,0.00001993172,0.00037127556,0.0001604129,0.0000141643495,0.00036853895,0.00015590782,0.0003002956,0.022198783,0.95097464,0.014024179,0.011271475],"study_design_scores_gemma":[0.000047066485,0.000034066394,0.0013185609,0.00006686683,0.000020794283,0.0013612432,0.00036534385,0.0035014804,0.01431382,0.923185,0.055745196,0.00004059846],"about_ca_topic_score_codex":0.0007631305,"about_ca_topic_score_gemma":0.001232665,"teacher_disagreement_score":0.026297893,"about_ca_system_score_codex":0.00074983644,"about_ca_system_score_gemma":0.00043473905,"threshold_uncertainty_score":0.087975204},"labels":[],"label_agreement":null},{"id":"W2918809886","doi":"","title":"On r-(k)-pancyclic Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.016269665712103143,"score_gpt":0.2883168699452045,"score_spread":0.27204720423310136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918809886","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41126207,0.0032164964,0.17260996,0.0048177717,0.0008275568,0.0002564896,0.003278507,0.0011820592,0.40254906],"genre_scores_gemma":[0.90600616,0.0030582985,0.028057138,0.0011864825,0.00045988362,0.0001444168,0.0017513733,0.00029565842,0.059040483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989496,0.00024261035,0.00005222759,0.0002411003,0.00022941755,0.00028497368],"domain_scores_gemma":[0.9967007,0.0014678448,0.00066582224,0.00047750233,0.0002962214,0.00039182566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043918708,0.0007764165,0.0006883289,0.0017260514,0.0014262995,0.002094177,0.001221201,0.0011343111,0.017746544],"category_scores_gemma":[0.0034850966,0.00053603004,0.00068040943,0.0025774792,0.0017443375,0.004448251,0.0030103705,0.0016693996,0.004618492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021859321,0.00007807893,0.00096056814,0.00040496635,0.000045626413,0.00062149076,0.00060117437,0.006793627,0.005981466,0.9229017,0.022834647,0.03855801],"study_design_scores_gemma":[0.00004440819,0.000048706526,0.0008381796,0.000088184344,0.00003703115,0.00081622787,0.0002007326,0.012372569,0.0018801944,0.9681206,0.015521698,0.000031594114],"about_ca_topic_score_codex":0.0016499354,"about_ca_topic_score_gemma":0.002488952,"teacher_disagreement_score":0.017746544,"about_ca_system_score_codex":0.0011147154,"about_ca_system_score_gemma":0.00046986248,"threshold_uncertainty_score":0.059368074},"labels":[],"label_agreement":null},{"id":"W2918815615","doi":"","title":"Minimizing Wiener index of trees containing a prescribed subtree.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Wiener index; Index (typography); Statistics; Combinatorics; Computer science; World Wide Web","score_opus":0.03535646671553372,"score_gpt":0.2953473363639706,"score_spread":0.2599908696484369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918815615","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64374155,0.0012166409,0.2554543,0.0007114802,0.00021620045,0.000047514608,0.00059025537,0.0003509792,0.0976711],"genre_scores_gemma":[0.89308536,0.0008259404,0.0689648,0.00019253146,0.00018369501,0.00009144751,0.0007184081,0.00045646465,0.03548136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996741,0.0000662087,0.000019415413,0.000058097423,0.00010705693,0.00007520645],"domain_scores_gemma":[0.9988329,0.00046096006,0.00019087696,0.0001164804,0.00017785192,0.00022089726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045829391,0.00046581475,0.0006685382,0.0015537861,0.00091449125,0.0018207541,0.00092526583,0.0010800847,0.004510414],"category_scores_gemma":[0.003176401,0.00033418107,0.00044516538,0.0008943114,0.00095202256,0.0021699716,0.0013732283,0.0012107239,0.0014537382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096077696,0.00003070072,0.00081459945,0.00009054148,0.000016912882,0.00019401473,0.00023280634,0.0051147547,0.016179878,0.95943666,0.002502638,0.015290428],"study_design_scores_gemma":[0.000015449914,0.00004407685,0.0010630906,0.000035843383,0.000019637202,0.00032483172,0.00015120102,0.050772976,0.0064473506,0.93641084,0.0046927775,0.000021981006],"about_ca_topic_score_codex":0.00069868035,"about_ca_topic_score_gemma":0.0014793827,"teacher_disagreement_score":0.004510414,"about_ca_system_score_codex":0.0010395012,"about_ca_system_score_gemma":0.00040856336,"threshold_uncertainty_score":0.015088797},"labels":[],"label_agreement":null},{"id":"W2918832912","doi":"","title":"A class of cospectral graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Class (philosophy); Combinatorics; Statistics; Computer science; Artificial intelligence","score_opus":0.022938388817884042,"score_gpt":0.29012750521640757,"score_spread":0.2671891163985235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918832912","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26618722,0.0017291292,0.12823409,0.0031299738,0.0012425005,0.00018915441,0.0022677942,0.0011796895,0.5958404],"genre_scores_gemma":[0.91870743,0.0011127245,0.01807741,0.0012651159,0.0007671915,0.00014108536,0.002365503,0.00033653597,0.05722704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959487,0.00006957662,0.000014879001,0.00013217168,0.00011214259,0.000076359385],"domain_scores_gemma":[0.9990427,0.0002595657,0.00015465773,0.00017890157,0.0001848019,0.00017925046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002470778,0.00058725465,0.00043065374,0.0018093133,0.0019256494,0.0024072062,0.0005650861,0.0010609279,0.023723727],"category_scores_gemma":[0.0016237168,0.00024537556,0.00036579938,0.0017213237,0.0011794105,0.0024853246,0.0011783089,0.0014151353,0.0030200821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040618233,0.000043775646,0.0006987787,0.00005961493,0.000009783879,0.00016275703,0.00014368162,0.0004030364,0.0019579614,0.96857846,0.010450245,0.01745132],"study_design_scores_gemma":[0.00002288233,0.000019612226,0.0012576242,0.00003898947,0.000016380252,0.0010380246,0.0003098202,0.006740118,0.0016280115,0.93822134,0.050690215,0.000017026026],"about_ca_topic_score_codex":0.0007822705,"about_ca_topic_score_gemma":0.0009119066,"teacher_disagreement_score":0.023723727,"about_ca_system_score_codex":0.000589968,"about_ca_system_score_gemma":0.00039873956,"threshold_uncertainty_score":0.07936376},"labels":[],"label_agreement":null},{"id":"W2918864036","doi":"","title":"The Radio Number of Edge-Joint Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Joint (building); Enhanced Data Rates for GSM Evolution; Combinatorics; Telecommunications; Computer science; Structural engineering","score_opus":0.013036242085743627,"score_gpt":0.2378308400966959,"score_spread":0.22479459801095225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918864036","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54539955,0.0036898577,0.24401428,0.01041497,0.00068713824,0.00016234523,0.0045734183,0.00092431455,0.19013412],"genre_scores_gemma":[0.9416154,0.0010772039,0.033371575,0.00083100743,0.00040592966,0.000198181,0.0014274396,0.00029543054,0.0207779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802375,0.0008076855,0.00007851766,0.0004535,0.00029418766,0.00034233838],"domain_scores_gemma":[0.985788,0.009534926,0.0014535137,0.0012890953,0.00059534074,0.0013391806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018177233,0.0006707816,0.0009979198,0.002108913,0.0020344374,0.0045359633,0.0025469686,0.0016593711,0.015438809],"category_scores_gemma":[0.015241212,0.0007046581,0.0007039714,0.0017308005,0.0033299667,0.0065478208,0.0024337487,0.0024063177,0.0018870798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003514309,0.000068009256,0.0021150615,0.00025543137,0.000048486523,0.0000763455,0.00029793428,0.015327987,0.0025033387,0.9441846,0.016477378,0.018294025],"study_design_scores_gemma":[0.00008859756,0.00007514195,0.0018762483,0.0000937027,0.00007073793,0.0003677889,0.00031740539,0.065638274,0.0032698426,0.9110259,0.01713056,0.00004577388],"about_ca_topic_score_codex":0.0014096816,"about_ca_topic_score_gemma":0.0013409862,"teacher_disagreement_score":0.015438809,"about_ca_system_score_codex":0.0018972036,"about_ca_system_score_gemma":0.0009190027,"threshold_uncertainty_score":0.0516479},"labels":[],"label_agreement":null},{"id":"W2918883355","doi":"","title":"Super edge connectivity of direct product of graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Product (mathematics); Geometry; Computer science; Artificial intelligence","score_opus":0.013916518316738678,"score_gpt":0.2351739771977522,"score_spread":0.22125745888101353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918883355","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59688663,0.0015334387,0.23920777,0.000788319,0.00022636943,0.00007331096,0.0009421456,0.0004588602,0.15988317],"genre_scores_gemma":[0.94886476,0.0008344647,0.029076155,0.00019678751,0.00014523769,0.00007646521,0.00079284195,0.00009633585,0.019916926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994961,0.00014857916,0.00002468816,0.00012677032,0.00013362952,0.0000701517],"domain_scores_gemma":[0.99752134,0.0012487031,0.00032540818,0.00025224907,0.00034269443,0.00030947375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003885675,0.00031804806,0.00039705032,0.0015910267,0.0006954276,0.0013598275,0.0007250399,0.0006197793,0.01181851],"category_scores_gemma":[0.0033197086,0.00035493137,0.0003233705,0.0011877437,0.00092375785,0.0032548697,0.0012958576,0.00085567805,0.0009919665],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093447146,0.0000332934,0.0015457376,0.00016904993,0.00002612287,0.0004987977,0.00031307456,0.0048466194,0.0033046505,0.9602497,0.005455196,0.023464251],"study_design_scores_gemma":[0.000019075964,0.000062601735,0.0017632073,0.00004694157,0.00003240867,0.0010598238,0.00019768813,0.037549175,0.0017883078,0.9435255,0.013938803,0.000016325113],"about_ca_topic_score_codex":0.00057822646,"about_ca_topic_score_gemma":0.0010891188,"teacher_disagreement_score":0.01181851,"about_ca_system_score_codex":0.00039714025,"about_ca_system_score_gemma":0.00022897121,"threshold_uncertainty_score":0.039536834},"labels":[],"label_agreement":null},{"id":"W2918914696","doi":"","title":"On wy-Perfect Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.015544611197801513,"score_gpt":0.2865267648438405,"score_spread":0.27098215364603895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918914696","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24925344,0.0035813923,0.33579293,0.0058458517,0.0010147751,0.00019373512,0.002307054,0.0012385249,0.40077233],"genre_scores_gemma":[0.8517092,0.0029506718,0.051683206,0.0017659868,0.00054689567,0.00017641275,0.0020957997,0.00046378284,0.08860819],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999038,0.00024611028,0.000055203684,0.00019620797,0.00021612024,0.0002483345],"domain_scores_gemma":[0.997879,0.0008379091,0.00032295773,0.00040440078,0.00023693236,0.00031876226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007779908,0.0007682842,0.0007354691,0.0024084866,0.002180299,0.002706098,0.0009209658,0.0010195072,0.015881376],"category_scores_gemma":[0.0035913084,0.0005316262,0.00080393616,0.0023071493,0.0024474289,0.008448359,0.003292984,0.002161463,0.0027210333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024564319,0.000012813935,0.00030857156,0.00006126587,0.000009600353,0.00008734367,0.00015073466,0.0007344252,0.0004742767,0.9866623,0.004116018,0.007358081],"study_design_scores_gemma":[0.00000775131,0.000007648944,0.00024345727,0.000031167547,0.000010241237,0.00014078486,0.00011914654,0.0021947294,0.00036954592,0.9883836,0.008484016,0.000007894682],"about_ca_topic_score_codex":0.0019331494,"about_ca_topic_score_gemma":0.0033631586,"teacher_disagreement_score":0.015881376,"about_ca_system_score_codex":0.0013570233,"about_ca_system_score_gemma":0.00064951245,"threshold_uncertainty_score":0.05312854},"labels":[],"label_agreement":null},{"id":"W2918944327","doi":"","title":"On the number of (A, B, 2C)-edge colourings in graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Computer science; Artificial intelligence","score_opus":0.011897159054830898,"score_gpt":0.23915384795836364,"score_spread":0.22725668890353273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918944327","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7429976,0.0064246943,0.09527007,0.021080017,0.0013719046,0.0001889254,0.006132478,0.00084735506,0.12568694],"genre_scores_gemma":[0.9485872,0.0017522004,0.03363636,0.0012380666,0.0007968452,0.00024732054,0.001722772,0.0003370887,0.011682082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99564666,0.0015929948,0.00029582548,0.0010175884,0.0006499747,0.0007970334],"domain_scores_gemma":[0.9383994,0.04964347,0.003949646,0.0030296824,0.0018111741,0.0031666127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041251415,0.0008412444,0.0016215622,0.0036129702,0.003121774,0.007820797,0.0035218166,0.004064071,0.014507982],"category_scores_gemma":[0.03223566,0.0011715697,0.0011106017,0.003792407,0.0057881325,0.0103899855,0.0028147644,0.0036665641,0.001638477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014080867,0.0002822344,0.012383001,0.00077434693,0.00017195578,0.00022351439,0.00071507966,0.029159533,0.00640247,0.8696779,0.033214036,0.04558784],"study_design_scores_gemma":[0.00016409137,0.00010229245,0.004844677,0.00017296892,0.00012163803,0.00072256784,0.00058464624,0.06563616,0.0031855374,0.91552645,0.008858953,0.00008001073],"about_ca_topic_score_codex":0.0018655758,"about_ca_topic_score_gemma":0.00240674,"teacher_disagreement_score":0.014507982,"about_ca_system_score_codex":0.0034532328,"about_ca_system_score_gemma":0.0016291405,"threshold_uncertainty_score":0.048534036},"labels":[],"label_agreement":null},{"id":"W2918952405","doi":"","title":"Decycling Number of a class of 4-regular graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Class (philosophy); Combinatorics; Computer science; Artificial intelligence","score_opus":0.011375865053817203,"score_gpt":0.2493761877820263,"score_spread":0.2380003227282091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918952405","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86271733,0.0008847827,0.024555447,0.0016448218,0.00019832514,0.00006422969,0.0016515555,0.000479563,0.10780402],"genre_scores_gemma":[0.9734124,0.00031727977,0.0097558135,0.00028734672,0.00010339788,0.000064627515,0.0012986078,0.00009626553,0.014664337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957305,0.0000626457,0.000020685111,0.00015701931,0.000073363626,0.000113122864],"domain_scores_gemma":[0.9981993,0.00080024713,0.00028172915,0.0002442878,0.00013666149,0.0003377695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002947578,0.00033829082,0.00054730684,0.001853705,0.0014257935,0.002210282,0.0010431822,0.00083976507,0.012829576],"category_scores_gemma":[0.0019228981,0.00024311044,0.0003548539,0.0011098213,0.0010457933,0.0017048969,0.00097366853,0.0014132545,0.00096912903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042935985,0.00018136099,0.0049007605,0.00023153545,0.00003107524,0.00040364233,0.0004538741,0.007937274,0.0074475002,0.9133279,0.015551259,0.049104493],"study_design_scores_gemma":[0.00007882887,0.00008667737,0.0049258205,0.0000918199,0.000044493776,0.0009899815,0.0005787249,0.04201209,0.0065057366,0.9121352,0.03249896,0.000051682593],"about_ca_topic_score_codex":0.001194078,"about_ca_topic_score_gemma":0.0016072576,"teacher_disagreement_score":0.012829576,"about_ca_system_score_codex":0.0009928104,"about_ca_system_score_gemma":0.0005283011,"threshold_uncertainty_score":0.04291922},"labels":[],"label_agreement":null},{"id":"W2918957452","doi":"","title":"A Note on Color Chains of Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.012875506752105442,"score_gpt":0.2442486377232339,"score_spread":0.23137313097112847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918957452","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011865744,0.023850411,0.35334468,0.05892427,0.024121974,0.00012875428,0.0015454029,0.0016546907,0.52456415],"genre_scores_gemma":[0.27646312,0.042122845,0.43623972,0.03606199,0.024623824,0.00050604757,0.0018210296,0.0022975786,0.17986383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985133,0.00056047115,0.000065870285,0.00034342162,0.0003686469,0.0001483248],"domain_scores_gemma":[0.9922214,0.0055211424,0.00017228618,0.0010578475,0.0005574276,0.0004697574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019696597,0.0010383149,0.001134718,0.002024026,0.003069684,0.003691492,0.0027791166,0.002200515,0.024498804],"category_scores_gemma":[0.0071027614,0.00078572845,0.0012264041,0.0034275723,0.00519505,0.011832692,0.0038498312,0.009737668,0.0056308336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045574478,0.00003249838,0.00022508964,0.0001803257,0.000012772241,0.00011230127,0.00017970541,0.00093329535,0.0006506083,0.9062532,0.07102281,0.020351715],"study_design_scores_gemma":[0.0000071286254,0.000013658007,0.00014783024,0.000055932767,0.000009629856,0.000101838945,0.00007749752,0.0016574956,0.00038602925,0.88836455,0.109163515,0.000014893223],"about_ca_topic_score_codex":0.0040774215,"about_ca_topic_score_gemma":0.008053195,"teacher_disagreement_score":0.024498804,"about_ca_system_score_codex":0.0021434042,"about_ca_system_score_gemma":0.0012243557,"threshold_uncertainty_score":0.081956625},"labels":[],"label_agreement":null},{"id":"W2918973811","doi":"","title":"An application of the incidence matrix to digraphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Incidence matrix; Matrix (chemical analysis); Incidence (geometry); Geometry; Structural engineering","score_opus":0.007477007512825804,"score_gpt":0.25633863857868044,"score_spread":0.24886163106585463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918973811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026905438,0.003757529,0.8321574,0.0031481436,0.0009378113,0.0001196671,0.0011407129,0.00082222733,0.13101113],"genre_scores_gemma":[0.4988584,0.0062199067,0.4476275,0.0012889102,0.0015359024,0.00030849836,0.0015323282,0.0005685976,0.042060006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923277,0.0002752633,0.000050099017,0.00016305251,0.0001996285,0.00007912545],"domain_scores_gemma":[0.99715734,0.0017276149,0.00018739306,0.0004223532,0.00027831495,0.00022714256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078322156,0.0007260788,0.00073246774,0.0030056043,0.0016085323,0.0028423949,0.0012817876,0.0011168736,0.012861084],"category_scores_gemma":[0.007212092,0.00065840024,0.001075451,0.00461189,0.0017153143,0.004396419,0.0024578425,0.0029186292,0.0020034316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017122224,0.000031906107,0.0003370463,0.00007557886,0.000014822444,0.000079983016,0.00011321724,0.0035532417,0.00045811725,0.9603769,0.008128302,0.026813636],"study_design_scores_gemma":[0.0000092437485,0.000010729483,0.00021668023,0.000036339938,0.000013532199,0.00020614362,0.00005967794,0.021096654,0.00034212638,0.9626056,0.015389832,0.0000134371885],"about_ca_topic_score_codex":0.0031690777,"about_ca_topic_score_gemma":0.00472633,"teacher_disagreement_score":0.012861084,"about_ca_system_score_codex":0.0017858801,"about_ca_system_score_gemma":0.00095757627,"threshold_uncertainty_score":0.0430246},"labels":[],"label_agreement":null},{"id":"W2919025434","doi":"","title":"Matching in Toeplitz graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Toeplitz matrix; Mathematics; Matching (statistics); Combinatorics; Statistics; Pure mathematics","score_opus":0.011998820705201342,"score_gpt":0.2376903782897646,"score_spread":0.22569155758456327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919025434","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43918088,0.0022863424,0.3476873,0.0048700795,0.00046548533,0.00015026293,0.0017619656,0.0011968814,0.20240068],"genre_scores_gemma":[0.89978534,0.0009345762,0.056491125,0.0006877782,0.0002692659,0.000101752405,0.0010465899,0.00024902337,0.040434673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991129,0.00022905714,0.00004926214,0.00021714675,0.00018660222,0.0002049317],"domain_scores_gemma":[0.9972746,0.0014883974,0.0003082477,0.000434169,0.00020118234,0.0002934766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000779274,0.00050791196,0.00072043965,0.0017524277,0.0019632464,0.0031611086,0.0013470274,0.0015067382,0.014700187],"category_scores_gemma":[0.00419005,0.0004592538,0.00059996743,0.002488862,0.0016906045,0.0070586833,0.0018180808,0.002225567,0.0021123616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004763405,0.000049666098,0.00034881718,0.000066537,0.000007825181,0.00004344556,0.00009497178,0.002159058,0.00080254005,0.97976345,0.0033161768,0.013300036],"study_design_scores_gemma":[0.000009223728,0.000008915082,0.00015110576,0.000012258731,0.000005861152,0.000073354495,0.00009013614,0.009091521,0.00065656035,0.9863945,0.003498853,0.0000075790813],"about_ca_topic_score_codex":0.001429011,"about_ca_topic_score_gemma":0.002409322,"teacher_disagreement_score":0.014700187,"about_ca_system_score_codex":0.0017258362,"about_ca_system_score_gemma":0.0006914048,"threshold_uncertainty_score":0.04917699},"labels":[],"label_agreement":null},{"id":"W2919026095","doi":"","title":"On the Erdos-Sos Conjecture for spiders in graphs having no path with 2k+1 vertices.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Path (computing); Computer science; Computer network","score_opus":0.018521022841210443,"score_gpt":0.2659698895284222,"score_spread":0.24744886668721178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919026095","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6002835,0.006225819,0.10958894,0.025234155,0.0012725592,0.00014322094,0.0018983891,0.0007223829,0.25463107],"genre_scores_gemma":[0.9628739,0.00332779,0.013274099,0.0013609765,0.00087866466,0.00014648239,0.0012800539,0.00016842116,0.01668963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984262,0.00040414624,0.00010941601,0.0003417736,0.0003506443,0.00036792253],"domain_scores_gemma":[0.9873876,0.008212005,0.0010594439,0.0013249011,0.0009515233,0.0010644809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030169224,0.0006831983,0.0017594529,0.002590467,0.0037032973,0.00481365,0.0018608209,0.0030088238,0.010210413],"category_scores_gemma":[0.017700747,0.000772409,0.0012593552,0.0026171906,0.0065176566,0.015795795,0.0051308973,0.0041755605,0.0021142382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012243846,0.000050199742,0.0011236292,0.00012130968,0.000014665911,0.0001251237,0.00039408918,0.0026634808,0.00033655987,0.98412216,0.005096543,0.005829718],"study_design_scores_gemma":[0.000017779652,0.000008273166,0.00018794295,0.00002697801,0.0000064368587,0.00008228869,0.00015736143,0.0035753117,0.000087255015,0.9940975,0.001742104,0.000010846978],"about_ca_topic_score_codex":0.0022490742,"about_ca_topic_score_gemma":0.0018452562,"teacher_disagreement_score":0.010210413,"about_ca_system_score_codex":0.0019986313,"about_ca_system_score_gemma":0.0011705016,"threshold_uncertainty_score":0.034157276},"labels":[],"label_agreement":null},{"id":"W2919067400","doi":"","title":"A degree sequence variant of balanced bipartition problem of graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Sequence (biology); Combinatorics; Genetics; Biology; Physics","score_opus":0.05611509745440838,"score_gpt":0.30466061464293376,"score_spread":0.24854551718852538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919067400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3756678,0.0020441737,0.4668592,0.008767344,0.0010640059,0.00045480343,0.003494813,0.00094167574,0.14070618],"genre_scores_gemma":[0.8461615,0.001227375,0.10961201,0.0010829697,0.0007142381,0.00020067267,0.0041958406,0.00040484432,0.03640054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987913,0.0003233498,0.000059734117,0.00036676656,0.00023828883,0.00022056681],"domain_scores_gemma":[0.9966364,0.0016930079,0.00036322974,0.00047807477,0.00035313674,0.00047614647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085133157,0.0007815589,0.00093786133,0.0012352037,0.0017285403,0.0028100878,0.002068401,0.0028755686,0.016415007],"category_scores_gemma":[0.008581842,0.00046244974,0.0006604188,0.002287701,0.0013589173,0.0061392933,0.0019623656,0.0025790206,0.0018277098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037173746,0.00025373572,0.0013905182,0.00041527007,0.00006155485,0.00043550093,0.0003985357,0.032343626,0.0057425736,0.84564036,0.039177686,0.073768854],"study_design_scores_gemma":[0.000057204285,0.000062875406,0.00055124663,0.000050312075,0.000027245687,0.00044251353,0.00029592536,0.059364423,0.002232934,0.9223202,0.014571939,0.000023163217],"about_ca_topic_score_codex":0.0015331367,"about_ca_topic_score_gemma":0.0013911077,"teacher_disagreement_score":0.016415007,"about_ca_system_score_codex":0.0011501625,"about_ca_system_score_gemma":0.0007834582,"threshold_uncertainty_score":0.05491364},"labels":[],"label_agreement":null},{"id":"W2919068130","doi":"","title":"On the spectral moments of signless Laplacian matrix of trees and unicyclic graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.022112627964107155,"score_gpt":0.29377690374986204,"score_spread":0.27166427578575486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919068130","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5202421,0.009527584,0.39272323,0.0046620253,0.0015080234,0.000057638943,0.0007799449,0.00063129095,0.069868185],"genre_scores_gemma":[0.9759144,0.0019563513,0.013500556,0.00034107806,0.0007135635,0.000055274093,0.00025648507,0.00017111337,0.007091005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955994,0.00016599247,0.000015487618,0.000068091605,0.000105745654,0.00008473071],"domain_scores_gemma":[0.9961972,0.002195512,0.0004904468,0.00027336582,0.0004098345,0.00043358872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009438832,0.00065786805,0.0007279488,0.0024360048,0.00068324024,0.0012764928,0.0013952226,0.0011151838,0.0054195053],"category_scores_gemma":[0.00875794,0.0004134014,0.00046569333,0.0013647887,0.0021797058,0.0028401953,0.0012298034,0.0017659459,0.00089543307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007848432,0.000051668685,0.0007602179,0.00012658267,0.000025448,0.00018061028,0.00026093092,0.011651501,0.0032935115,0.9671911,0.0061549414,0.010225056],"study_design_scores_gemma":[0.000014488448,0.000026234642,0.00097328285,0.000049793147,0.00001500226,0.00026392046,0.00015275273,0.10409922,0.0008632777,0.8908987,0.0026044871,0.00003883794],"about_ca_topic_score_codex":0.0008821725,"about_ca_topic_score_gemma":0.0013085789,"teacher_disagreement_score":0.0054195053,"about_ca_system_score_codex":0.00077066576,"about_ca_system_score_gemma":0.00040082057,"threshold_uncertainty_score":0.018130004},"labels":[],"label_agreement":null},{"id":"W2919090519","doi":"","title":"Tricyclic balanced sampling plans avoiding adjacent units with block size three.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Statistical Process Monitoring","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Block (permutation group theory); Tricyclic; Sampling (signal processing); Statistics; Combinatorics; Computer science; Medicine; Telecommunications; Pharmacology","score_opus":0.10714001523289932,"score_gpt":0.37279361317435616,"score_spread":0.2656535979414568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919090519","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19675681,0.0006911824,0.7737588,0.0006266277,0.00010102809,0.00036737695,0.0019458572,0.00087406137,0.024878168],"genre_scores_gemma":[0.7433067,0.00035611438,0.24300763,0.00026106465,0.000049337654,0.00031546497,0.0016584226,0.00014954469,0.010895693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989637,0.00038710903,0.000063741274,0.00014751789,0.00022586569,0.0002119971],"domain_scores_gemma":[0.9957902,0.002161857,0.0005033933,0.00079911295,0.00037254996,0.0003729392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012333861,0.00040108088,0.00058725406,0.00067545555,0.00046066561,0.0011335593,0.0013607253,0.0006373968,0.008074531],"category_scores_gemma":[0.008089471,0.0002932196,0.00036486387,0.0010069866,0.0006545809,0.0009950366,0.0013850717,0.00070539286,0.0009817348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033803794,0.0003708422,0.005203017,0.00044343344,0.0001482094,0.00043113096,0.00020813437,0.29976666,0.017127201,0.3676703,0.018201891,0.28704888],"study_design_scores_gemma":[0.00033993812,0.0005253093,0.0015811772,0.00007319622,0.00006213452,0.00025067953,0.00011455654,0.81291044,0.008453809,0.16784135,0.0078105354,0.00003690382],"about_ca_topic_score_codex":0.0029439041,"about_ca_topic_score_gemma":0.004434765,"teacher_disagreement_score":0.008074531,"about_ca_system_score_codex":0.0008858349,"about_ca_system_score_gemma":0.0014673169,"threshold_uncertainty_score":0.02701199},"labels":[],"label_agreement":null},{"id":"W2919107023","doi":"","title":"Number of Spanning trees in Different Products of Complete and Complete Tripartite Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spanning tree; Combinatorics; Discrete mathematics","score_opus":0.035141965112555865,"score_gpt":0.2987868566843932,"score_spread":0.26364489157183735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919107023","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9279998,0.001007911,0.038571626,0.00083263806,0.0000959914,0.000043396023,0.003437783,0.00026404098,0.027746703],"genre_scores_gemma":[0.9798187,0.0003490455,0.0131052835,0.00008294219,0.00006141215,0.00005621797,0.001943131,0.000094562565,0.0044887457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889624,0.00031998314,0.00008233936,0.00031784474,0.00023469504,0.0001489045],"domain_scores_gemma":[0.9869354,0.008096654,0.0015353984,0.0011204332,0.00095877005,0.0013534636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012978709,0.00029734237,0.00052190333,0.0017128778,0.0009248362,0.003049451,0.0014534843,0.0011146585,0.013141465],"category_scores_gemma":[0.010651832,0.0004916623,0.0005083944,0.0013455322,0.0013782516,0.0040915017,0.0010337047,0.00075409806,0.0007957853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020048283,0.00022471562,0.02828336,0.00097569486,0.00030722574,0.00053419045,0.0014585005,0.028564919,0.017589424,0.8413596,0.019322846,0.05937471],"study_design_scores_gemma":[0.00013374894,0.00023716442,0.020618761,0.00016297522,0.00039477018,0.0038630997,0.0012898385,0.08705825,0.011316726,0.8587644,0.016083786,0.00007648372],"about_ca_topic_score_codex":0.00033194537,"about_ca_topic_score_gemma":0.00062737364,"teacher_disagreement_score":0.013141465,"about_ca_system_score_codex":0.00071818783,"about_ca_system_score_gemma":0.00048297172,"threshold_uncertainty_score":0.04396254},"labels":[],"label_agreement":null},{"id":"W2919123079","doi":"","title":"A sharper lower bound on the signless Laplacian Estrada index.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Combinatorics; Statistics; Upper and lower bounds; Mathematical analysis; Computer science","score_opus":0.031400793766020146,"score_gpt":0.28679259908889543,"score_spread":0.2553918053228753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919123079","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113141924,0.017403726,0.32718226,0.018847357,0.0053750817,0.00014797857,0.002767145,0.0018305399,0.513304],"genre_scores_gemma":[0.8331855,0.005789324,0.07519915,0.0071324464,0.004122698,0.00036785146,0.0020583917,0.001189596,0.07095505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985353,0.00033333577,0.00005554606,0.00033068057,0.00050015515,0.0002449099],"domain_scores_gemma":[0.99158746,0.0051544155,0.00049065176,0.0011270633,0.00069195137,0.00094835134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020793453,0.0014989967,0.0016510165,0.0038711648,0.0017474298,0.00404781,0.0033960151,0.0029722985,0.02270565],"category_scores_gemma":[0.017148629,0.0005416184,0.0009765853,0.0024077583,0.0030134118,0.007970636,0.0048677777,0.008886352,0.005871205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019696123,0.000104414255,0.0006859396,0.0003006934,0.000035308993,0.00015213787,0.00020077701,0.0041407263,0.005219538,0.9308034,0.0337003,0.024459759],"study_design_scores_gemma":[0.00003209754,0.000050271166,0.000613958,0.00009040159,0.000038473507,0.0002686418,0.00006436799,0.01846772,0.0014844238,0.9649613,0.013893056,0.00003532966],"about_ca_topic_score_codex":0.00080181385,"about_ca_topic_score_gemma":0.0013674396,"teacher_disagreement_score":0.02270565,"about_ca_system_score_codex":0.0018617681,"about_ca_system_score_gemma":0.00076853315,"threshold_uncertainty_score":0.075957954},"labels":[],"label_agreement":null},{"id":"W2919134707","doi":"","title":"One modulo N gracefulness of Crowns, Armed crowns and Chain of even cycles.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Modulo; Mathematics; Chain (unit); Combinatorics; Physics; Astronomy","score_opus":0.014587477308387584,"score_gpt":0.2322848075293288,"score_spread":0.21769733022094123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919134707","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6222448,0.0017582863,0.14894019,0.0035358267,0.0005004382,0.000102109196,0.001156463,0.00079353293,0.22096841],"genre_scores_gemma":[0.9443854,0.00054169167,0.03242209,0.000555338,0.00017914992,0.000049055026,0.00049295375,0.00016491792,0.021209368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951553,0.00009021132,0.000028981503,0.00016343278,0.00007219666,0.0001297118],"domain_scores_gemma":[0.9983536,0.0007171769,0.00017855002,0.00036644362,0.00010803239,0.00027616415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005256066,0.0003924499,0.0005108728,0.0007769061,0.0019974757,0.0026472835,0.0008736673,0.0008530343,0.008796072],"category_scores_gemma":[0.002439125,0.0004065545,0.0006936107,0.0006748063,0.0020850245,0.00452639,0.0017885264,0.001541468,0.0008624257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118559255,0.000033739412,0.00071958225,0.000077648205,0.0000111019,0.00013159118,0.00022740866,0.0013784649,0.0018562395,0.97797376,0.0048694597,0.012602468],"study_design_scores_gemma":[0.00001756609,0.000020229672,0.00034901727,0.000022866123,0.000013934818,0.00018913642,0.00013425921,0.0039092014,0.0010736759,0.98626596,0.007990308,0.000013852099],"about_ca_topic_score_codex":0.0015348843,"about_ca_topic_score_gemma":0.0025865827,"teacher_disagreement_score":0.008796072,"about_ca_system_score_codex":0.001108795,"about_ca_system_score_gemma":0.0006645632,"threshold_uncertainty_score":0.0294258},"labels":[],"label_agreement":null},{"id":"W2919154739","doi":"","title":"Group divisible designs with block size 4 and number of groups 2 or 3.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Block size; Block (permutation group theory); Group (periodic table); Combinatorics; Arithmetic; Computer science; Chemistry","score_opus":0.009805692926298095,"score_gpt":0.21445261662301787,"score_spread":0.20464692369671977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919154739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.421196,0.0018379221,0.43690744,0.0017470687,0.00084481353,0.00041953925,0.0011819855,0.001453537,0.13441171],"genre_scores_gemma":[0.88926554,0.00044069588,0.09158199,0.00039821095,0.00017791489,0.00023800242,0.0003159749,0.00008581802,0.017495869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987078,0.0005195742,0.00006956814,0.00021387904,0.0002400168,0.00024920623],"domain_scores_gemma":[0.9959565,0.0017815112,0.0005407296,0.0010932095,0.00033989,0.00028817853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012398727,0.000602533,0.0005461484,0.00090345804,0.0010195436,0.0013800077,0.0008490996,0.0009676024,0.010628857],"category_scores_gemma":[0.0044229683,0.00036061034,0.00042960286,0.0007451746,0.001186627,0.0013932986,0.0011863773,0.00093161874,0.0016097127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016002872,0.00017152364,0.0014046485,0.0002531317,0.00008494235,0.00046875188,0.00024984477,0.01638354,0.029506247,0.88156354,0.008197366,0.060116198],"study_design_scores_gemma":[0.0005571489,0.00081745535,0.0009962354,0.00018644753,0.00011200885,0.0011363127,0.00018925419,0.07740298,0.03403058,0.83846295,0.04600451,0.00010411398],"about_ca_topic_score_codex":0.000448983,"about_ca_topic_score_gemma":0.0008826576,"teacher_disagreement_score":0.010628857,"about_ca_system_score_codex":0.0009220427,"about_ca_system_score_gemma":0.0010185213,"threshold_uncertainty_score":0.03555703},"labels":[],"label_agreement":null},{"id":"W2919198524","doi":"","title":"On the edge irregularity strength of disjoint union of star graph and subdivision of star graph.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Star (game theory); Mathematics; Subdivision; Graph; Combinatorics; Discrete mathematics; Mathematical analysis; Geography","score_opus":0.012866541259594142,"score_gpt":0.22314762620194933,"score_spread":0.2102810849423552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919198524","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7886984,0.0030213515,0.12848571,0.004029541,0.00037003617,0.00009154444,0.00056606,0.00023872156,0.07449857],"genre_scores_gemma":[0.9776653,0.0007886548,0.015192595,0.00033589665,0.00029537576,0.00006255648,0.00031935022,0.00009282691,0.0052475696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828595,0.0007264495,0.00007815589,0.00030936173,0.00035353354,0.0002464354],"domain_scores_gemma":[0.974596,0.016665224,0.0026087856,0.0020898774,0.0014846306,0.0025553924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025498606,0.0004970768,0.0012508973,0.002840983,0.0020212894,0.0025264963,0.0021681974,0.0017786362,0.0068027647],"category_scores_gemma":[0.022130094,0.00073771464,0.00071758416,0.001728157,0.003624908,0.006957286,0.0032660086,0.0026451729,0.0005826484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003332884,0.00009954922,0.0061023906,0.00018631457,0.00005499455,0.0001932571,0.00046572983,0.014400311,0.00313144,0.95130163,0.0055564195,0.018174686],"study_design_scores_gemma":[0.000062095496,0.000106600615,0.004630149,0.00009421047,0.00009754991,0.00046504234,0.0006207455,0.10711281,0.002098009,0.8791547,0.005503115,0.000055081815],"about_ca_topic_score_codex":0.00173841,"about_ca_topic_score_gemma":0.0015863192,"teacher_disagreement_score":0.0068027647,"about_ca_system_score_codex":0.0013630235,"about_ca_system_score_gemma":0.00052480266,"threshold_uncertainty_score":0.02275753},"labels":[],"label_agreement":null},{"id":"W2919239201","doi":"","title":"Well-Partitioned and Balanced Well-Partitioned Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.012745691456855977,"score_gpt":0.2689667954612418,"score_spread":0.2562211040043858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919239201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41464764,0.0037567506,0.4593731,0.002839247,0.00057308516,0.0002277146,0.0031266734,0.0009413805,0.11451448],"genre_scores_gemma":[0.8968877,0.0019251906,0.06565093,0.0008990606,0.00036507766,0.00016055415,0.0024585926,0.00029231625,0.03136041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990294,0.00021568454,0.00005744541,0.00026233002,0.00020851483,0.00022665219],"domain_scores_gemma":[0.9961725,0.0012606453,0.00065673364,0.0007442828,0.00056950643,0.0005963699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008088247,0.00068432523,0.000526164,0.0017186276,0.0010620463,0.0028095266,0.0009225066,0.0009467586,0.011734543],"category_scores_gemma":[0.004840317,0.0006731982,0.00043445363,0.001513235,0.0013541469,0.0075093727,0.001693522,0.0013515918,0.002381723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032528501,0.00008461372,0.0017275229,0.00016259776,0.000041974283,0.00039952286,0.00045829552,0.006842081,0.00936121,0.9342514,0.009972761,0.036372714],"study_design_scores_gemma":[0.000036630416,0.000040433843,0.0009955096,0.000041455914,0.000031027346,0.0005597467,0.00037210312,0.011779293,0.0024465267,0.9717836,0.011895372,0.000018312352],"about_ca_topic_score_codex":0.0008368703,"about_ca_topic_score_gemma":0.0015299473,"teacher_disagreement_score":0.011734543,"about_ca_system_score_codex":0.0007207927,"about_ca_system_score_gemma":0.0004869994,"threshold_uncertainty_score":0.039255977},"labels":[],"label_agreement":null},{"id":"W2919251934","doi":"","title":"On unicyclic graphs with maximum Harary spectral radius.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; Combinatorics; Eigenvalues and eigenvectors; Physics; Quantum mechanics","score_opus":0.018633089515201602,"score_gpt":0.2671748255604362,"score_spread":0.2485417360452346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919251934","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54336256,0.0070468183,0.1942434,0.0045765787,0.00064309244,0.00013196438,0.0014959315,0.000955037,0.24754468],"genre_scores_gemma":[0.961908,0.002214764,0.019385558,0.00047655933,0.00033616237,0.00010224672,0.0004931131,0.00017545154,0.014908106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998874,0.0004785791,0.00004643635,0.00019578125,0.00018166476,0.00022347046],"domain_scores_gemma":[0.9929235,0.0044000978,0.0009863869,0.0006007673,0.00043653225,0.00065276766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006701777,0.00060656515,0.00091982924,0.0025555454,0.0016804906,0.0021638914,0.0013930306,0.001428905,0.011004116],"category_scores_gemma":[0.008932136,0.00054326275,0.00039139352,0.0020603873,0.0022180586,0.0038170354,0.0029380792,0.0014438413,0.00215396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026237062,0.00004941061,0.0009381545,0.00029479776,0.000034772398,0.00028222418,0.00046039882,0.010801152,0.0042912127,0.945717,0.011792849,0.025075732],"study_design_scores_gemma":[0.000033250115,0.000044277986,0.0008066463,0.000098024444,0.000030687086,0.0005770372,0.0004209699,0.027285937,0.0020230755,0.9611328,0.0075203623,0.000026976755],"about_ca_topic_score_codex":0.00061426056,"about_ca_topic_score_gemma":0.00087540183,"teacher_disagreement_score":0.011004116,"about_ca_system_score_codex":0.0009599215,"about_ca_system_score_gemma":0.00034755052,"threshold_uncertainty_score":0.036812425},"labels":[],"label_agreement":null},{"id":"W2919296063","doi":"","title":"On the maximum signless Laplacian spectral radius of bipartite graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Spectral radius; Combinatorics; Graph; Physics; Eigenvalues and eigenvectors; Quantum mechanics","score_opus":0.026933673101849864,"score_gpt":0.2766647719501171,"score_spread":0.24973109884826727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919296063","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4223737,0.011392458,0.40186328,0.008947379,0.0010843135,0.00011396674,0.0011615487,0.0010307609,0.1520327],"genre_scores_gemma":[0.95836157,0.0031019908,0.029065264,0.0007492474,0.0010282692,0.00016391854,0.00037318966,0.00031470903,0.006841756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985274,0.0007574378,0.00005026415,0.00022692252,0.0002876492,0.00015025248],"domain_scores_gemma":[0.9876601,0.008954185,0.0010208534,0.0006880904,0.0007210692,0.0009557035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021766298,0.00088003627,0.0010621414,0.0030238791,0.0010515472,0.00207662,0.0021323408,0.0018119272,0.005823379],"category_scores_gemma":[0.022995906,0.00050774013,0.0003782261,0.0015795563,0.0037114944,0.0049990625,0.0023520722,0.0019517555,0.001484456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020203892,0.00006778689,0.0009931047,0.00028057658,0.00003394059,0.00011340178,0.0002542116,0.015332438,0.0050164866,0.9446249,0.011990348,0.021090759],"study_design_scores_gemma":[0.000026488851,0.00003670297,0.0007921199,0.00007417598,0.000018930004,0.00024741556,0.0001326766,0.061234947,0.0012330331,0.9330429,0.0031318062,0.000028916831],"about_ca_topic_score_codex":0.0004506458,"about_ca_topic_score_gemma":0.0004972125,"teacher_disagreement_score":0.005823379,"about_ca_system_score_codex":0.0011064,"about_ca_system_score_gemma":0.00043003287,"threshold_uncertainty_score":0.019481122},"labels":[],"label_agreement":null},{"id":"W2919309530","doi":"","title":"Congruences modulo 16, 32 and 64 for bipartitions with distinct even parts.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Modulo; Mathematics; Congruence relation; Arithmetic; Combinatorics","score_opus":0.037433064704065495,"score_gpt":0.31540341220274143,"score_spread":0.27797034749867594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919309530","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0708602,0.002466072,0.07633523,0.0033040626,0.0034085389,0.00015981594,0.00080614537,0.0006093081,0.84205055],"genre_scores_gemma":[0.8350956,0.0015137721,0.043866534,0.0018579448,0.001773237,0.0002536894,0.0010862787,0.0007380174,0.11381491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99727696,0.00063389353,0.0002283033,0.0004217256,0.0007451304,0.0006940397],"domain_scores_gemma":[0.998516,0.0005129941,0.00020589618,0.0002660034,0.0002640179,0.00023506279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015471624,0.0010803271,0.0008498313,0.0020434356,0.004420279,0.0043748966,0.0008490373,0.0013076401,0.029877804],"category_scores_gemma":[0.0044837636,0.0006457628,0.0014895636,0.0013331801,0.0048108143,0.0058177197,0.0038641437,0.004192008,0.007587428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042846943,0.000016993637,0.00006356624,0.000025068308,0.0000033230467,0.00012170957,0.00030042708,0.000062311374,0.00057313975,0.99017745,0.00500879,0.0036043618],"study_design_scores_gemma":[0.000032945944,0.000014167575,0.00013893054,0.00003711928,0.000007720295,0.00021942637,0.00019579644,0.0003314298,0.00079246116,0.9704727,0.027741527,0.000015755846],"about_ca_topic_score_codex":0.0012276623,"about_ca_topic_score_gemma":0.0017702475,"teacher_disagreement_score":0.029877804,"about_ca_system_score_codex":0.0018656738,"about_ca_system_score_gemma":0.0012282962,"threshold_uncertainty_score":0.09995121},"labels":[],"label_agreement":null},{"id":"W2919313757","doi":"","title":"Cactus graphs with equal domination and complementary tree domination numbers.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Botanical Research and Applications","field":"Agricultural and Biological Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cactus; Mathematics; Tree (set theory); Domination analysis; Combinatorics; Horticulture; Graph; Biology; Vertex (graph theory)","score_opus":0.01893480844941211,"score_gpt":0.2617324920323253,"score_spread":0.24279768358291318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919313757","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71346015,0.0015806047,0.050756674,0.0011263096,0.0002406603,0.00012335245,0.002010769,0.00044356703,0.23025782],"genre_scores_gemma":[0.9678211,0.00040793052,0.010686328,0.00026267086,0.000085490574,0.000059362737,0.0010097306,0.000074264375,0.019592997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995447,0.00008606486,0.00002414514,0.00010889967,0.00011799963,0.0001181716],"domain_scores_gemma":[0.9975253,0.0013984466,0.0002904521,0.00023383865,0.00026465696,0.00028720216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027040904,0.00034297467,0.0003535687,0.001768691,0.0012074669,0.00175231,0.00067809323,0.00066535885,0.012977152],"category_scores_gemma":[0.0025285531,0.00026792334,0.0003294101,0.00105321,0.0012475566,0.001856717,0.0011122057,0.00069922593,0.000606765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003883275,0.000070691705,0.0029454136,0.00032574427,0.00005893583,0.0008048739,0.00044356217,0.006677811,0.0119445445,0.93064946,0.0101337815,0.035556875],"study_design_scores_gemma":[0.000114148,0.00007070706,0.0076151565,0.00014196022,0.00015221817,0.002645236,0.0006984859,0.03344634,0.010224461,0.9020333,0.042795934,0.00006193785],"about_ca_topic_score_codex":0.0035265256,"about_ca_topic_score_gemma":0.005750293,"teacher_disagreement_score":0.012977152,"about_ca_system_score_codex":0.0010947943,"about_ca_system_score_gemma":0.00053599634,"threshold_uncertainty_score":0.043412924},"labels":[],"label_agreement":null},{"id":"W2919315061","doi":"","title":"On Ruehr's Identities.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"History and Theory of Mathematics","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.027018444467921933,"score_gpt":0.28381152178793057,"score_spread":0.2567930773200086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919315061","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016880997,0.009769766,0.0424731,0.0073720817,0.001206248,0.000018668528,0.00036562028,0.00014864493,0.9217648],"genre_scores_gemma":[0.6948839,0.0095386235,0.022701237,0.003867904,0.0019780423,0.00007859008,0.0005114932,0.00023246996,0.26620772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902093,0.00040501496,0.00003821012,0.00014902254,0.00025344657,0.00013335892],"domain_scores_gemma":[0.99873763,0.00065972423,0.000074099065,0.00023288695,0.0002302442,0.00006551142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014928998,0.00038045915,0.00046716369,0.0015844784,0.002220917,0.0023752803,0.00069250935,0.0009768519,0.0149775725],"category_scores_gemma":[0.0036063727,0.00022833484,0.0005074951,0.0012437345,0.004554509,0.008459951,0.0024205314,0.0028880702,0.0034301388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026963826,0.000001973284,0.000026715456,0.0000069719817,8.636768e-7,0.000011530009,0.00007656315,0.000027683278,0.000026942067,0.9957295,0.002097246,0.001991305],"study_design_scores_gemma":[0.0000037883208,0.0000039684946,0.0001433626,0.000016920836,0.000002623057,0.000059256086,0.0000759672,0.00015069259,0.000099665005,0.9646682,0.03477129,0.00000415394],"about_ca_topic_score_codex":0.0024986607,"about_ca_topic_score_gemma":0.0028551777,"teacher_disagreement_score":0.0149775725,"about_ca_system_score_codex":0.001725419,"about_ca_system_score_gemma":0.0008216935,"threshold_uncertainty_score":0.050104976},"labels":[],"label_agreement":null},{"id":"W2919325040","doi":"","title":"Linear list r-hued colorings of graphs with bounded maximum subgraph average degrees.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Bounded function; Induced subgraph; Discrete mathematics; Graph","score_opus":0.016832516482014084,"score_gpt":0.2655245428264735,"score_spread":0.2486920263444594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919325040","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4448476,0.0009912543,0.49060455,0.0019719508,0.00027868766,0.00022925982,0.0032781519,0.004873481,0.052924972],"genre_scores_gemma":[0.87104017,0.000458034,0.10814153,0.00068271375,0.00012965816,0.00017529067,0.001918216,0.00082216057,0.016632251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988708,0.0003555403,0.000044911685,0.00024783233,0.00014885713,0.00033207654],"domain_scores_gemma":[0.99093115,0.0048426115,0.0008366728,0.0015326302,0.00088313175,0.0009737327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010838918,0.0007883403,0.00067372486,0.0010697641,0.0014414438,0.002414168,0.0024326409,0.0009144085,0.013139684],"category_scores_gemma":[0.008106725,0.0007906815,0.0006831631,0.0014357003,0.0013101458,0.0029696953,0.0016536588,0.0015645295,0.0025371006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023949922,0.00068496104,0.006858939,0.0012154292,0.0001930731,0.00076114683,0.0012495213,0.1689276,0.04249757,0.60357803,0.05178319,0.11985549],"study_design_scores_gemma":[0.00022938079,0.00022153783,0.0021659909,0.00011071437,0.00011554126,0.00049372105,0.0005740944,0.3861515,0.013271273,0.58698505,0.009597403,0.000083763814],"about_ca_topic_score_codex":0.0035673468,"about_ca_topic_score_gemma":0.0067729265,"teacher_disagreement_score":0.013139684,"about_ca_system_score_codex":0.0021038274,"about_ca_system_score_gemma":0.0013149707,"threshold_uncertainty_score":0.043956637},"labels":[],"label_agreement":null},{"id":"W2919327266","doi":"","title":"List injective Coloring of Planar Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Injective function; Mathematics; Planar; Planar graph; Combinatorics; Graph; Computer science; Computer graphics (images)","score_opus":0.013246325226428523,"score_gpt":0.23360655083332388,"score_spread":0.22036022560689536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919327266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34193,0.0040053856,0.36706483,0.007472395,0.0005960379,0.00016391708,0.0060660755,0.002381351,0.27032006],"genre_scores_gemma":[0.860222,0.0021173314,0.07370172,0.0009847027,0.00038192738,0.00014753218,0.0047504697,0.0005190474,0.057175394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999335,0.00018001445,0.000035194753,0.00014002812,0.00012440754,0.0001854765],"domain_scores_gemma":[0.99631906,0.0022635837,0.00030388634,0.0005612078,0.0002646563,0.00028761887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058222236,0.00060607336,0.00053902477,0.001185587,0.0014661107,0.0033021446,0.0015595796,0.000943911,0.01433344],"category_scores_gemma":[0.003969605,0.00050021376,0.00051498384,0.0021399925,0.0013286917,0.005250302,0.0019959975,0.0018067901,0.0021856097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016529781,0.000101687,0.0018903349,0.00031592607,0.000028961369,0.00011122873,0.00031013624,0.010968348,0.0028960016,0.898558,0.031162586,0.05349149],"study_design_scores_gemma":[0.000037661448,0.000028697208,0.0011774357,0.000049533755,0.00003869469,0.0002299915,0.00039283882,0.029187033,0.0032212152,0.942776,0.022835344,0.00002557002],"about_ca_topic_score_codex":0.0027718418,"about_ca_topic_score_gemma":0.0042192363,"teacher_disagreement_score":0.01433344,"about_ca_system_score_codex":0.0019843255,"about_ca_system_score_gemma":0.00094985985,"threshold_uncertainty_score":0.04795009},"labels":[],"label_agreement":null},{"id":"W2919329670","doi":"","title":"On k-distance Pell numbers and ((k-1)A, (k-1)B, kC)-edge coloured graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Telecommunications","score_opus":0.008923617244636667,"score_gpt":0.22488204618104157,"score_spread":0.2159584289364049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919329670","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48586637,0.0058476133,0.19480236,0.017271727,0.001094642,0.00014604157,0.0020293915,0.00064800674,0.29229394],"genre_scores_gemma":[0.90232587,0.0031297116,0.047234297,0.0015660867,0.00067068357,0.00018868114,0.0012892737,0.00027769266,0.043317627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988431,0.00037194422,0.000072471026,0.00023844124,0.0002193971,0.00025452138],"domain_scores_gemma":[0.9940556,0.004070938,0.0007125435,0.0003752657,0.00027749978,0.0005080534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009786577,0.0008016152,0.0007858,0.0019670133,0.002327427,0.0045223655,0.0015247791,0.0022338426,0.013850219],"category_scores_gemma":[0.008543442,0.0006084658,0.0006291434,0.0031780517,0.004679719,0.010201853,0.003446502,0.003358913,0.0021543948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006418722,0.000018077351,0.0004454025,0.00006601866,0.0000065515237,0.00005702492,0.00019414014,0.0026529485,0.00047089058,0.9833687,0.0047552073,0.007900895],"study_design_scores_gemma":[0.0000137892785,0.0000075672665,0.00028167723,0.00002252828,0.0000056532826,0.00010100529,0.00012171369,0.0033728061,0.00028670052,0.99110085,0.0046705217,0.000015264226],"about_ca_topic_score_codex":0.002373488,"about_ca_topic_score_gemma":0.0027305072,"teacher_disagreement_score":0.013850219,"about_ca_system_score_codex":0.0027139555,"about_ca_system_score_gemma":0.00084831513,"threshold_uncertainty_score":0.04633355},"labels":[],"label_agreement":null},{"id":"W2919430429","doi":"","title":"Cubic Edge-Transitive Graphs Of Order 22pn.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Transitive relation; Enhanced Data Rates for GSM Evolution; Combinatorics; Order (exchange); Discrete mathematics; Computer science; Telecommunications; Business","score_opus":0.009973449825552743,"score_gpt":0.2316946766332426,"score_spread":0.22172122680768988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919430429","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3795992,0.0010115755,0.087366976,0.0034507604,0.0004230081,0.0003108366,0.01416221,0.0015620816,0.5121134],"genre_scores_gemma":[0.84096783,0.00065264147,0.045459326,0.00062746386,0.000113364295,0.00015639559,0.0077819787,0.00035385607,0.103887066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995234,0.00008529707,0.00002053694,0.000101441554,0.00012726717,0.00014211508],"domain_scores_gemma":[0.99860305,0.0005522464,0.00018944568,0.00031156515,0.00017414431,0.00016954681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021588376,0.00043071163,0.00051199255,0.00069373864,0.0016776563,0.0019329515,0.00096802664,0.0007531346,0.029124493],"category_scores_gemma":[0.0019532915,0.00030402493,0.00041459344,0.0013698622,0.00082004303,0.001771199,0.0011924442,0.0013982075,0.0029603252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003965899,0.00016001737,0.0016830777,0.000371788,0.000038902617,0.0005858028,0.00041308257,0.011846511,0.0059587257,0.88750905,0.04054444,0.050492067],"study_design_scores_gemma":[0.00008518188,0.000047412123,0.0019686415,0.00006124325,0.00002983161,0.00043217794,0.00042706513,0.02042936,0.0047483956,0.8952563,0.07647835,0.000035998],"about_ca_topic_score_codex":0.009564005,"about_ca_topic_score_gemma":0.020882783,"teacher_disagreement_score":0.029124493,"about_ca_system_score_codex":0.0017552358,"about_ca_system_score_gemma":0.0016408173,"threshold_uncertainty_score":0.09743118},"labels":[],"label_agreement":null},{"id":"W2919430489","doi":"","title":"Extremal Properties of Some Topological Indices of Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Topology (electrical circuits); Combinatorics","score_opus":0.05432449548216772,"score_gpt":0.2916358624358771,"score_spread":0.23731136695370936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919430489","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.756799,0.002078979,0.09579488,0.0020907996,0.0003945499,0.00005275498,0.0010304421,0.00032045643,0.14143819],"genre_scores_gemma":[0.9844599,0.0005049779,0.009442638,0.00013537225,0.00028227887,0.000047400004,0.0003688775,0.00008200467,0.0046767076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994454,0.00015804963,0.000032010666,0.000101505444,0.00016219518,0.00010082315],"domain_scores_gemma":[0.99717927,0.0011725804,0.00060442503,0.00027230865,0.0003258303,0.00044556073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008793142,0.0005238416,0.0005766774,0.003995042,0.0012980001,0.0028312653,0.0009970684,0.0009703657,0.005341282],"category_scores_gemma":[0.005615753,0.00036112894,0.0004997362,0.001662049,0.002355566,0.0034622306,0.0013181726,0.002084105,0.0006032458],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042972424,0.000019371626,0.0008637253,0.000040751875,0.000009954861,0.00009095336,0.00015604697,0.0009303828,0.0014457182,0.9904867,0.0015060627,0.0044073793],"study_design_scores_gemma":[0.00001468,0.000022849426,0.0016380192,0.000032447628,0.00001888186,0.00038811995,0.00020891575,0.011039999,0.0009704363,0.98260176,0.0030450975,0.00001887763],"about_ca_topic_score_codex":0.0003529145,"about_ca_topic_score_gemma":0.00042112567,"teacher_disagreement_score":0.005341282,"about_ca_system_score_codex":0.00095343776,"about_ca_system_score_gemma":0.00028866204,"threshold_uncertainty_score":0.0178684},"labels":[],"label_agreement":null},{"id":"W2919436614","doi":"","title":"Edge-Critical G, H Colorings.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Computer science; Artificial intelligence","score_opus":0.015637673558514673,"score_gpt":0.2572041463921928,"score_spread":0.24156647283367813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919436614","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53704435,0.0021283084,0.20096253,0.0070429295,0.0011176819,0.00032436723,0.0063843434,0.0016194312,0.24337614],"genre_scores_gemma":[0.91158694,0.00068032095,0.055529904,0.0010582687,0.00018742867,0.00009903536,0.0024760398,0.00024276106,0.028139394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993967,0.00013325954,0.000029465009,0.00017561429,0.00007976413,0.0001851465],"domain_scores_gemma":[0.9969639,0.0013329771,0.0003657752,0.00044874984,0.00029911523,0.0005894027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006439571,0.00066344626,0.00050279923,0.0011804749,0.0024556685,0.0026440069,0.0011412557,0.0013694037,0.017301774],"category_scores_gemma":[0.0041950247,0.0004894228,0.0004958159,0.0010727916,0.0015968569,0.0026496602,0.0017365136,0.0016650931,0.0017278442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004422386,0.00013609852,0.0031722672,0.00034685765,0.000038941595,0.00043046023,0.00033999622,0.0069974023,0.00791798,0.90855753,0.04835632,0.023263972],"study_design_scores_gemma":[0.00011027473,0.000049120437,0.0017784747,0.00009951657,0.000042041305,0.0007513556,0.0007393183,0.021571571,0.0066856756,0.9363012,0.031839017,0.000032411746],"about_ca_topic_score_codex":0.0021362852,"about_ca_topic_score_gemma":0.0037936359,"teacher_disagreement_score":0.017301774,"about_ca_system_score_codex":0.001663796,"about_ca_system_score_gemma":0.0010293801,"threshold_uncertainty_score":0.057880163},"labels":[],"label_agreement":null},{"id":"W2919485004","doi":"","title":"Log-concavity of principal diagonal rays in the regular Lah triangles.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematics and Applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Diagonal; Principal (computer security); Combinatorics; Geometry; Computer science","score_opus":0.048829177326400276,"score_gpt":0.3202622407718201,"score_spread":0.2714330634454198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919485004","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5970444,0.0007762369,0.11349036,0.0019066829,0.00028734026,0.00006881361,0.0011658454,0.0004750155,0.28478527],"genre_scores_gemma":[0.9475917,0.00029654865,0.014223243,0.00030374157,0.00016995159,0.000054293683,0.00059842697,0.00017508975,0.036586795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969363,0.00007444516,0.000009100173,0.00006002398,0.00009279273,0.00007006854],"domain_scores_gemma":[0.9988023,0.0004957498,0.00016002802,0.000125844,0.00025517883,0.00016094939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002685909,0.00023738889,0.0003547196,0.00084989896,0.00086821755,0.0018416457,0.0005448948,0.0004823065,0.01662868],"category_scores_gemma":[0.0032273002,0.00030899726,0.00026224757,0.00049042713,0.0016192558,0.0015876603,0.0010171506,0.0015656956,0.0022940855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016207783,0.00003194361,0.0015826634,0.00006886009,0.0000074673,0.00016502585,0.00025289741,0.001750424,0.0024123483,0.9725271,0.0062931576,0.0147461435],"study_design_scores_gemma":[0.000044929515,0.000036023466,0.0020547009,0.000032227388,0.000008995935,0.0003979599,0.00045432258,0.01629049,0.0018655439,0.968864,0.0099349795,0.000015700969],"about_ca_topic_score_codex":0.0016437827,"about_ca_topic_score_gemma":0.0021085085,"teacher_disagreement_score":0.01662868,"about_ca_system_score_codex":0.0005007352,"about_ca_system_score_gemma":0.00036426506,"threshold_uncertainty_score":0.05562848},"labels":[],"label_agreement":null},{"id":"W2919517672","doi":"","title":"On Co-PI Index of Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pi; Index (typography); Combinatorics; Statistics; Computer science; Geometry","score_opus":0.01241507167439332,"score_gpt":0.2467552856337838,"score_spread":0.23434021395939048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919517672","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34494704,0.0043942733,0.33573782,0.009595125,0.0010133635,0.00021392186,0.003545145,0.0015537463,0.29899952],"genre_scores_gemma":[0.8525082,0.0021071373,0.08953131,0.0015327791,0.0012072527,0.00033180712,0.0030392502,0.0008300508,0.04891229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978104,0.0005323911,0.00012447413,0.00051647,0.0005442923,0.00047206026],"domain_scores_gemma":[0.9879518,0.00679956,0.001280174,0.0019535967,0.0009794638,0.0010353669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018067455,0.0007894962,0.0014689561,0.0049053174,0.0037730718,0.00559125,0.0025436624,0.0023064723,0.012882713],"category_scores_gemma":[0.012456661,0.0005853722,0.0007460919,0.0056146644,0.0036014875,0.01424107,0.0036368503,0.0043621194,0.003090607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009470264,0.00007393957,0.0013487734,0.000109989596,0.000014800513,0.000058381003,0.00026112926,0.0021966903,0.000956358,0.96283495,0.009766183,0.022284092],"study_design_scores_gemma":[0.000015471025,0.000016800495,0.0006236425,0.00003637101,0.000015058271,0.00015522137,0.000156779,0.012360783,0.0010018352,0.9771763,0.008425971,0.000015704243],"about_ca_topic_score_codex":0.0019046793,"about_ca_topic_score_gemma":0.0025108054,"teacher_disagreement_score":0.012882713,"about_ca_system_score_codex":0.0033223426,"about_ca_system_score_gemma":0.0012540778,"threshold_uncertainty_score":0.04309696},"labels":[],"label_agreement":null},{"id":"W2919524422","doi":"","title":"The neighbor expanded sum distinguishing index of Halin graphs","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Index (typography); Computer science","score_opus":0.012323695238111743,"score_gpt":0.23994206256928932,"score_spread":0.22761836733117757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919524422","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7934263,0.0010693237,0.1159075,0.0028950986,0.000276132,0.00006318443,0.0010294876,0.0004965456,0.08483657],"genre_scores_gemma":[0.9645122,0.000284358,0.024001943,0.00038933332,0.00021025032,0.00006365558,0.0006516155,0.00017935653,0.009707197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904805,0.0002769174,0.000044235516,0.00021766464,0.00023989465,0.0001733485],"domain_scores_gemma":[0.9946413,0.0032208997,0.00051562587,0.0006737075,0.00038389114,0.00056442956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011483222,0.0005037109,0.0010321554,0.002140784,0.0022815329,0.003858311,0.002386502,0.00155853,0.0064612916],"category_scores_gemma":[0.0061931666,0.0004341837,0.00044604635,0.0018843479,0.0022729663,0.0065724077,0.0022733968,0.0026783503,0.00072786416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002791197,0.00008271294,0.0016969054,0.00010895745,0.000016749083,0.000071202645,0.00033228326,0.006345709,0.0033077921,0.9607727,0.005632217,0.021353688],"study_design_scores_gemma":[0.000026840198,0.000031346528,0.0007731895,0.000022072461,0.000023509325,0.0001263253,0.00013896474,0.036121216,0.0030421808,0.9559192,0.0037523094,0.000022733882],"about_ca_topic_score_codex":0.0008000398,"about_ca_topic_score_gemma":0.0010431191,"teacher_disagreement_score":0.0064612916,"about_ca_system_score_codex":0.0019321807,"about_ca_system_score_gemma":0.00082771544,"threshold_uncertainty_score":0.021615148},"labels":[],"label_agreement":null},{"id":"W2919529806","doi":"","title":"On safe sets of the Cartesian product of two complete graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Mathematics; Product (mathematics); Combinatorics; Geometry","score_opus":0.01613526313586127,"score_gpt":0.24405758213284087,"score_spread":0.2279223189969796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919529806","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46295026,0.0016617134,0.42462966,0.0031696653,0.00035932206,0.00018103051,0.0023404276,0.0006934802,0.104014374],"genre_scores_gemma":[0.8593148,0.0008784766,0.11056882,0.0006427376,0.00027934214,0.0002517173,0.0026125305,0.00039018504,0.025061434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996858,0.001168653,0.00021975959,0.00067243545,0.0005772747,0.0005039129],"domain_scores_gemma":[0.98790526,0.008041594,0.001095309,0.0013601196,0.00068459654,0.00091303355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002169126,0.00081176346,0.0011514121,0.0025961318,0.003385485,0.00550615,0.002277335,0.0019773196,0.011141713],"category_scores_gemma":[0.008725747,0.0013350758,0.0020100207,0.0024387399,0.004323943,0.013621668,0.0052369507,0.0032496527,0.0015038355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008349892,0.00004370691,0.00060932885,0.00007932676,0.000021076728,0.00010186554,0.00046293248,0.0033708054,0.00048578775,0.9842539,0.0022076333,0.008280142],"study_design_scores_gemma":[0.000015441548,0.000014394423,0.0002478329,0.000040718693,0.00001769717,0.00011350697,0.00025287937,0.0060850773,0.00058682886,0.9891102,0.0035006115,0.000014816465],"about_ca_topic_score_codex":0.0025216783,"about_ca_topic_score_gemma":0.0030264203,"teacher_disagreement_score":0.011141713,"about_ca_system_score_codex":0.002446785,"about_ca_system_score_gemma":0.0010943944,"threshold_uncertainty_score":0.03727275},"labels":[],"label_agreement":null},{"id":"W2919596741","doi":"","title":"The bounds of the sum of cubes of degrees of graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics; Arithmetic","score_opus":0.011775485508897704,"score_gpt":0.22712656967413533,"score_spread":0.21535108416523763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919596741","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22321017,0.0149935,0.44837734,0.019890465,0.001955724,0.00011550052,0.0051548313,0.0010549102,0.28524768],"genre_scores_gemma":[0.87323135,0.004128876,0.086071104,0.0017874846,0.0018429351,0.0003230979,0.0022360845,0.0007357753,0.029643264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962321,0.0011784801,0.00019825554,0.0007779278,0.00096966024,0.0006436658],"domain_scores_gemma":[0.97767925,0.01638108,0.0010961371,0.0020255065,0.0013864931,0.0014316188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033243326,0.0016319357,0.0017096269,0.003669945,0.0024679126,0.006894106,0.004159699,0.0022066296,0.01668227],"category_scores_gemma":[0.028517809,0.001241008,0.0015305475,0.0032646984,0.004289387,0.015523209,0.0057527283,0.0057375375,0.0026330396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018717864,0.000037532533,0.0010036313,0.00017593637,0.000049460567,0.000055777156,0.00020897323,0.0070373304,0.0010413914,0.9613866,0.011422884,0.017393319],"study_design_scores_gemma":[0.000015959837,0.000018648301,0.00067340676,0.00007065529,0.000037970258,0.00016148499,0.000102324535,0.024559783,0.0012278927,0.96500146,0.008105638,0.000024814713],"about_ca_topic_score_codex":0.0021226106,"about_ca_topic_score_gemma":0.0026799978,"teacher_disagreement_score":0.01668227,"about_ca_system_score_codex":0.0032798515,"about_ca_system_score_gemma":0.0012617632,"threshold_uncertainty_score":0.05580777},"labels":[],"label_agreement":null},{"id":"W2919615934","doi":"","title":"Computing total edge product cordial labeling of circulant graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Circulant matrix; Mathematics; Enhanced Data Rates for GSM Evolution; Product (mathematics); Combinatorics; Computer science; Artificial intelligence; Geometry","score_opus":0.013668687130099026,"score_gpt":0.23560794408164107,"score_spread":0.22193925695154204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919615934","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.522974,0.00095178245,0.42357337,0.0015377428,0.00026675346,0.00016258654,0.004002504,0.003589815,0.04294133],"genre_scores_gemma":[0.7679306,0.00034932554,0.21309496,0.00033256842,0.00012870869,0.000114671464,0.0049531697,0.00064344617,0.012452493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941194,0.00016539307,0.000031605126,0.0001618489,0.0001146088,0.00011460476],"domain_scores_gemma":[0.99678934,0.0014943911,0.00029387113,0.0007621674,0.00037039942,0.00028994874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000651029,0.0006611988,0.0009030681,0.0011956242,0.0010269686,0.002279262,0.0013816706,0.0010850173,0.0106591815],"category_scores_gemma":[0.006554884,0.0003973358,0.00054343214,0.0018379829,0.0009133052,0.0033465044,0.0010509533,0.0011179572,0.0016762321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090006494,0.0004625901,0.007602005,0.0008823346,0.000098067285,0.00027123172,0.0004995721,0.11903672,0.0149427205,0.5274647,0.053004265,0.27483565],"study_design_scores_gemma":[0.000076778095,0.00012566433,0.0014356457,0.000056384702,0.0000430077,0.00019253018,0.00022166112,0.38887867,0.007398078,0.5896447,0.011896152,0.000030727017],"about_ca_topic_score_codex":0.0029151912,"about_ca_topic_score_gemma":0.0072819665,"teacher_disagreement_score":0.0106591815,"about_ca_system_score_codex":0.0016927192,"about_ca_system_score_gemma":0.0013378902,"threshold_uncertainty_score":0.03565854},"labels":[],"label_agreement":null},{"id":"W2919672876","doi":"","title":"Cycle Extensions in PBD Block-Intersection Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Intersection (aeronautics); Block (permutation group theory); Combinatorics; Geography","score_opus":0.01743400842951365,"score_gpt":0.28109735408279235,"score_spread":0.2636633456532787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919672876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074607566,0.0006361574,0.816339,0.00079630787,0.0002386041,0.00037405294,0.0017853884,0.0022650931,0.10295796],"genre_scores_gemma":[0.66745394,0.0008705002,0.28070483,0.0005535263,0.00011210629,0.00065515266,0.002971099,0.000935308,0.045743547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838305,0.00042809884,0.00012592968,0.0003548509,0.0004634862,0.00024467695],"domain_scores_gemma":[0.9966737,0.0016727138,0.00026851046,0.00073336455,0.00048159296,0.000170109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012017705,0.0004612621,0.0005487655,0.0015408465,0.0016252153,0.0026819243,0.001402336,0.0008922134,0.014963734],"category_scores_gemma":[0.005730054,0.000725071,0.0012404167,0.0016640145,0.0022023711,0.0057512117,0.0032557377,0.0022823948,0.0024395834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009209696,0.000039882143,0.0005841694,0.00011728265,0.000014735035,0.00018206282,0.00025665623,0.005297636,0.0016945321,0.96931803,0.0022589702,0.020143969],"study_design_scores_gemma":[0.000028944998,0.00002510575,0.00029742235,0.00011197494,0.00003437173,0.00019161012,0.00018994737,0.027692877,0.005092783,0.93383425,0.03247394,0.000026656993],"about_ca_topic_score_codex":0.0042880247,"about_ca_topic_score_gemma":0.0059788427,"teacher_disagreement_score":0.014963734,"about_ca_system_score_codex":0.0015606008,"about_ca_system_score_gemma":0.0015223889,"threshold_uncertainty_score":0.050058722},"labels":[],"label_agreement":null},{"id":"W2919730175","doi":"","title":"On (A, 2B, 2C)-edge colouring in certain class of graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Class (philosophy); Combinatorics; Enhanced Data Rates for GSM Evolution; Computer science; Artificial intelligence","score_opus":0.012858385429157368,"score_gpt":0.2361231034346343,"score_spread":0.22326471800547693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919730175","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5781694,0.0028680721,0.17740771,0.013262458,0.0006189257,0.00020291288,0.0025407507,0.00071198255,0.22421774],"genre_scores_gemma":[0.91958165,0.0015190969,0.049536057,0.00203166,0.0005232814,0.00022115033,0.0014254014,0.0002459154,0.024915783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850804,0.00050052296,0.000060863178,0.00035041146,0.00020509945,0.00037513796],"domain_scores_gemma":[0.9916664,0.005528367,0.00078097195,0.0009094258,0.00036238652,0.00075255625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001260882,0.0005246391,0.0008288619,0.0018356816,0.0026803534,0.00367694,0.0015688363,0.0030933204,0.0131203085],"category_scores_gemma":[0.006044321,0.000596451,0.00091080344,0.0025450457,0.003318948,0.0063379603,0.0023760544,0.0034800163,0.0014059499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011517014,0.00006537567,0.00104719,0.000119582815,0.00001591249,0.00010710628,0.00029404962,0.0038670397,0.0013566931,0.9733046,0.010505895,0.009201503],"study_design_scores_gemma":[0.000037106365,0.00001769033,0.000834822,0.000049138078,0.000015918238,0.00024266409,0.00024376957,0.015601296,0.0006044937,0.9762122,0.006120954,0.000019966972],"about_ca_topic_score_codex":0.0024860885,"about_ca_topic_score_gemma":0.002896961,"teacher_disagreement_score":0.0131203085,"about_ca_system_score_codex":0.0025880372,"about_ca_system_score_gemma":0.0010249277,"threshold_uncertainty_score":0.043891847},"labels":[],"label_agreement":null},{"id":"W2919759756","doi":"","title":"A note on the edge colorings of planar graphs without 7-cycles with three chords.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Planar graph; Enhanced Data Rates for GSM Evolution; Planar; Edge coloring; Graph; Computer science; Artificial intelligence; Line graph; Computer graphics (images)","score_opus":0.02086344610799311,"score_gpt":0.27806442402816783,"score_spread":0.2572009779201747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919759756","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085016295,0.018054,0.29550016,0.02068286,0.026461804,0.00028615005,0.0020283263,0.0028280863,0.54914236],"genre_scores_gemma":[0.54013604,0.02070445,0.31519124,0.007953918,0.0101959,0.00020629869,0.001765982,0.0012940152,0.10255206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993024,0.0001778083,0.000043790962,0.00016620486,0.00020405096,0.000105667095],"domain_scores_gemma":[0.99714166,0.0015103191,0.00017192523,0.0005882846,0.0003500304,0.0002377771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008006186,0.0007629094,0.00066068606,0.0010356432,0.0020861072,0.0017481777,0.0022003287,0.0011247725,0.011770131],"category_scores_gemma":[0.004807099,0.0005939068,0.0012996522,0.0015687228,0.0023619123,0.0027830005,0.0018764391,0.0044591413,0.002913451],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055056124,0.0001182353,0.0013987217,0.000897412,0.000111316745,0.0015897992,0.0005000595,0.011927497,0.012724908,0.7092939,0.13004774,0.1308399],"study_design_scores_gemma":[0.00004703367,0.000122044585,0.0015944347,0.00015030592,0.00008070387,0.0013758382,0.000303437,0.00870558,0.0044555287,0.79465795,0.18841194,0.00009518975],"about_ca_topic_score_codex":0.00466689,"about_ca_topic_score_gemma":0.0081257075,"teacher_disagreement_score":0.011770131,"about_ca_system_score_codex":0.00108691,"about_ca_system_score_gemma":0.0007986226,"threshold_uncertainty_score":0.039375007},"labels":[],"label_agreement":null},{"id":"W2919796294","doi":"","title":"Some enumeration formulas for SYT of rectangular shape with two arms.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Geometry","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Enumeration; Mathematics; Combinatorics; Arithmetic; Algebra over a field; Pure mathematics","score_opus":0.020834149335316247,"score_gpt":0.3041397278850151,"score_spread":0.28330557854969884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919796294","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14789876,0.0026103952,0.41396895,0.0031391922,0.0012240452,0.00020320626,0.0034314187,0.0013837952,0.42614022],"genre_scores_gemma":[0.7683239,0.0015226068,0.13460413,0.0016180938,0.0006226085,0.00034996055,0.0032337075,0.0008978723,0.08882713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993849,0.000120817436,0.00006198909,0.000099287165,0.00019266676,0.00014045803],"domain_scores_gemma":[0.9991345,0.00037626398,0.000087815126,0.00010248698,0.0002283678,0.00007064547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007153988,0.00066180655,0.0007229556,0.0014741761,0.0019847816,0.0033548928,0.0011870504,0.0012755012,0.022003073],"category_scores_gemma":[0.003011639,0.00051381567,0.0015130866,0.0018427823,0.0015925802,0.0060613644,0.0019765904,0.002867532,0.003907254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025527734,0.000017498369,0.00016629134,0.00006253923,0.000006787517,0.00019746322,0.00020201238,0.00044699397,0.00050233264,0.98223037,0.0061252783,0.010016946],"study_design_scores_gemma":[0.000013386268,0.00001291048,0.00019465997,0.000041203442,0.00001655214,0.00028925328,0.00018300742,0.0042162114,0.00078023656,0.98203963,0.012193092,0.000019905425],"about_ca_topic_score_codex":0.0018073837,"about_ca_topic_score_gemma":0.0025483512,"teacher_disagreement_score":0.022003073,"about_ca_system_score_codex":0.0018311737,"about_ca_system_score_gemma":0.00068481883,"threshold_uncertainty_score":0.07360762},"labels":[],"label_agreement":null},{"id":"W2919798801","doi":"","title":"On the sum of the squares of all distances in trees with fixed diameter.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Statistics; Explained sum of squares","score_opus":0.02478737374470275,"score_gpt":0.27420308874436633,"score_spread":0.24941571499966358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919798801","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29032943,0.009165383,0.6291177,0.005112827,0.001037064,0.00008747329,0.0016333257,0.00073222397,0.0627846],"genre_scores_gemma":[0.7842122,0.0045414423,0.17333853,0.0011977328,0.0020552468,0.00028275783,0.0017532278,0.0013878236,0.03123104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832076,0.0006907898,0.000091464906,0.000368476,0.00032881787,0.00019965906],"domain_scores_gemma":[0.98342067,0.013102323,0.0008862537,0.0009553548,0.00076371763,0.0008716034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024841216,0.0012331383,0.001824763,0.0023396604,0.0012181933,0.002566371,0.0035394062,0.0017917508,0.0075803003],"category_scores_gemma":[0.023211839,0.000914601,0.0008784767,0.0021831805,0.0031585237,0.009763708,0.0036495032,0.0035436112,0.001806626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025041297,0.000065151784,0.0018420579,0.00034422558,0.0000933347,0.00015775705,0.0004382065,0.03416808,0.0020788223,0.90851134,0.014989648,0.03706082],"study_design_scores_gemma":[0.000023644317,0.000035680958,0.00086938264,0.00004780617,0.00003777602,0.0002742552,0.00011507721,0.06817925,0.0005272174,0.9260888,0.003775578,0.000025515841],"about_ca_topic_score_codex":0.0015985584,"about_ca_topic_score_gemma":0.0021872167,"teacher_disagreement_score":0.0075803003,"about_ca_system_score_codex":0.0015179393,"about_ca_system_score_gemma":0.00064587756,"threshold_uncertainty_score":0.025358677},"labels":[],"label_agreement":null},{"id":"W2919820325","doi":"","title":"Labeling Mycielski Graphs with a Condition at Distance Two.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Statistics","score_opus":0.009028724248424968,"score_gpt":0.23720384316054777,"score_spread":0.2281751189121228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919820325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3252766,0.0006524641,0.46527016,0.0060777385,0.00096087926,0.0004269367,0.0050899973,0.0047566765,0.19148856],"genre_scores_gemma":[0.7614194,0.00030085954,0.19023842,0.0017551559,0.00021370502,0.00026662202,0.005453799,0.0011010984,0.039250907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984547,0.00034047881,0.00014892884,0.00036077728,0.00032558438,0.0003695975],"domain_scores_gemma":[0.99374205,0.0027432847,0.00046455592,0.001650264,0.0007848235,0.00061496964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011908987,0.00050876697,0.0006610993,0.0012688398,0.0024242257,0.0030057817,0.0016966753,0.0018805849,0.022528186],"category_scores_gemma":[0.008717299,0.0005670473,0.00074362813,0.0015874584,0.0018767444,0.00706947,0.004359854,0.0029542502,0.004499728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012941032,0.0003644504,0.0024671757,0.00041599217,0.000045589153,0.00035551476,0.00074438826,0.004546962,0.022784673,0.87092334,0.03256372,0.06349418],"study_design_scores_gemma":[0.00013648086,0.00014762279,0.0013708757,0.00011112991,0.000070176786,0.00034161514,0.00067877315,0.017324807,0.021583527,0.912583,0.045589726,0.000062223065],"about_ca_topic_score_codex":0.0022079034,"about_ca_topic_score_gemma":0.0035860345,"teacher_disagreement_score":0.022528186,"about_ca_system_score_codex":0.0017289295,"about_ca_system_score_gemma":0.001614355,"threshold_uncertainty_score":0.07536435},"labels":[],"label_agreement":null},{"id":"W2919834984","doi":"","title":"An Exponent Bound for Abelian Group that admit a Covering Extended Building Set.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Exponent; Abelian group; Group (periodic table); Set (abstract data type); Pure mathematics; Generating set of a group; Upper and lower bounds; Combinatorics; Mathematical analysis; Geometry; Physics; Computer science; Quantum mechanics","score_opus":0.024062112244045888,"score_gpt":0.2851975572390513,"score_spread":0.26113544499500546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919834984","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5657845,0.0025791563,0.1646093,0.0024044586,0.00056541496,0.0000796618,0.0010427544,0.00092118455,0.26201352],"genre_scores_gemma":[0.9597095,0.00048105605,0.017258583,0.0003516244,0.00021515101,0.00007393468,0.00052220136,0.00015419791,0.02123372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994105,0.0000785238,0.00003815727,0.00012784603,0.00015176735,0.00019317748],"domain_scores_gemma":[0.997493,0.0014851002,0.00018748351,0.00033399416,0.00020466288,0.0002957563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005284398,0.00055873895,0.00059291,0.0012789706,0.0013783468,0.0026090515,0.0009011368,0.0009878343,0.018826576],"category_scores_gemma":[0.0033672336,0.0002785802,0.00058826583,0.00091603264,0.0013134562,0.003946775,0.0025290968,0.0016555262,0.0024798021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015028124,0.000057251018,0.0012024323,0.00011856636,0.000017215072,0.0002456089,0.00032605935,0.0034534605,0.0033376876,0.97164637,0.0057779285,0.0136672165],"study_design_scores_gemma":[0.000035108096,0.000074383046,0.0009874181,0.00006406963,0.000045246758,0.0005196303,0.0002107613,0.025559887,0.0030922687,0.950719,0.018662173,0.0000300541],"about_ca_topic_score_codex":0.0006035949,"about_ca_topic_score_gemma":0.00078964815,"teacher_disagreement_score":0.018826576,"about_ca_system_score_codex":0.0009392702,"about_ca_system_score_gemma":0.00037623383,"threshold_uncertainty_score":0.06298119},"labels":[],"label_agreement":null},{"id":"W2919880351","doi":"","title":"On The Genus Two Characterizations Of Unit, Unitary Cayley And Co-Maximal Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cayley graph; Unitary state; Genus; Unit (ring theory); Combinatorics; Discrete mathematics; Graph; Botany","score_opus":0.010531919674189488,"score_gpt":0.21468622263424525,"score_spread":0.20415430296005577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919880351","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63347554,0.0031046101,0.06878364,0.0044140453,0.0005408508,0.00006841328,0.00047951285,0.00042497923,0.28870845],"genre_scores_gemma":[0.982381,0.00072877464,0.0058252146,0.00043392857,0.00025546958,0.000045489487,0.00021274072,0.00010344984,0.010014136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993062,0.00020694947,0.00002806342,0.00011947382,0.0001741754,0.00016505903],"domain_scores_gemma":[0.9963994,0.0019959956,0.0004838032,0.00037116272,0.00028389672,0.00046569115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007125822,0.00071953813,0.0005468237,0.0040373835,0.002154072,0.0043081255,0.0011016784,0.0016475439,0.008213375],"category_scores_gemma":[0.005844575,0.00040481612,0.00054153573,0.0021561855,0.005163112,0.0059904465,0.002544179,0.002837431,0.000792521],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035279372,0.000017141254,0.0005438219,0.000027068832,0.0000038699336,0.000080163525,0.00035004725,0.0006125198,0.0005589556,0.99123573,0.0016763639,0.004859091],"study_design_scores_gemma":[0.00000897812,0.000014483283,0.00088241743,0.000039347422,0.000011369251,0.0002453571,0.0004986187,0.0059483144,0.00056230807,0.9872153,0.0045581656,0.000015317104],"about_ca_topic_score_codex":0.0014415941,"about_ca_topic_score_gemma":0.0016574662,"teacher_disagreement_score":0.008213375,"about_ca_system_score_codex":0.0015074393,"about_ca_system_score_gemma":0.0005391388,"threshold_uncertainty_score":0.02747649},"labels":[],"label_agreement":null},{"id":"W2919884788","doi":"","title":"γ-Max Labelings of Graphs with Exterior Major Vertices.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.008250059204412056,"score_gpt":0.21776795897396345,"score_spread":0.2095178997695514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919884788","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39458197,0.0018183565,0.40071565,0.00525514,0.00043077185,0.00017142396,0.00575089,0.0017686498,0.18950716],"genre_scores_gemma":[0.80085564,0.0009557186,0.14810611,0.0014146675,0.00034870516,0.00023164261,0.005030842,0.0008701054,0.042186476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990484,0.0003255755,0.00005594946,0.00023552008,0.00014090262,0.00019358985],"domain_scores_gemma":[0.99454284,0.00313417,0.0006177874,0.00080995704,0.00037740788,0.0005178759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012546752,0.00076133234,0.0007322506,0.0015642531,0.0020578424,0.0034898608,0.0014620717,0.00129383,0.012744],"category_scores_gemma":[0.006620741,0.0007330393,0.0007812462,0.0016351287,0.0018956356,0.0058857375,0.0023956697,0.002572223,0.0020356993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026480106,0.000073715644,0.0014433786,0.00018625893,0.000019717594,0.00007425123,0.00028793735,0.0061487206,0.0023694218,0.9447773,0.017015066,0.027339324],"study_design_scores_gemma":[0.000028338087,0.000022043598,0.00063382904,0.000052364056,0.000017084798,0.0001492177,0.00025163262,0.01449657,0.0019312148,0.9699972,0.012404149,0.000016320239],"about_ca_topic_score_codex":0.001217125,"about_ca_topic_score_gemma":0.0019732078,"teacher_disagreement_score":0.012744,"about_ca_system_score_codex":0.0018507772,"about_ca_system_score_gemma":0.0007545059,"threshold_uncertainty_score":0.042632937},"labels":[],"label_agreement":null},{"id":"W2919988168","doi":"","title":"An Extension Result on Fractional ID-(g, f, m)-Deleted Graph.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Extension (predicate logic); Graph; Combinatorics; Discrete mathematics; Computer science; Programming language","score_opus":0.0169253529771934,"score_gpt":0.26215417324551804,"score_spread":0.24522882026832465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919988168","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3732407,0.002625595,0.33895144,0.006019882,0.0013376074,0.00020859165,0.0028414263,0.0011802677,0.2735945],"genre_scores_gemma":[0.845547,0.0014691119,0.0979932,0.0020836885,0.00056082784,0.000173999,0.0023608042,0.0003272058,0.049484175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999559,0.000078181176,0.000016006108,0.00014957492,0.000076101984,0.00012114818],"domain_scores_gemma":[0.9983334,0.00066332147,0.00011678266,0.00044966248,0.0001877118,0.00024915652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005133467,0.00047196035,0.0006586497,0.0011522977,0.0025572218,0.001850559,0.0017404949,0.0010591964,0.011324556],"category_scores_gemma":[0.0030979074,0.0002971406,0.00075516663,0.0015967604,0.0012647597,0.0046128333,0.0025948551,0.0021191128,0.0012828734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020679664,0.00011093417,0.0013565967,0.00024582312,0.000018460802,0.0002822238,0.00040888376,0.0045238826,0.004017197,0.932031,0.02295571,0.033842508],"study_design_scores_gemma":[0.000043379256,0.00004775743,0.0011508564,0.00007086533,0.00006297455,0.000808208,0.0003772728,0.020225057,0.0039416137,0.92424333,0.049001098,0.000027679103],"about_ca_topic_score_codex":0.0021185966,"about_ca_topic_score_gemma":0.0017750942,"teacher_disagreement_score":0.011324556,"about_ca_system_score_codex":0.0015453898,"about_ca_system_score_gemma":0.0008037163,"threshold_uncertainty_score":0.037884414},"labels":[],"label_agreement":null},{"id":"W2920016910","doi":"","title":"Ordering c-cyclic graphs with respect to signless Laplacian spectral moments.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.023510429681374127,"score_gpt":0.2880957711141978,"score_spread":0.2645853414328237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920016910","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58931386,0.0008002744,0.19079801,0.0016231295,0.0012059463,0.0001412364,0.0009807098,0.00095253746,0.21418433],"genre_scores_gemma":[0.9472904,0.00038336052,0.029566575,0.0006295839,0.0002981439,0.00007463179,0.0004884482,0.00023928336,0.021029651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942505,0.00013398523,0.00002756866,0.0000867678,0.00017805479,0.00014865719],"domain_scores_gemma":[0.99776006,0.00054172915,0.00038344137,0.0003586026,0.0004916141,0.00046454713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042438792,0.0003808333,0.00030750025,0.0020477702,0.0009219605,0.0014168972,0.0005536397,0.0008911212,0.01081347],"category_scores_gemma":[0.0037708587,0.00021937072,0.0002566717,0.0012624598,0.0014545261,0.0013010864,0.0010619578,0.0010555042,0.0013744549],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012730785,0.000039821814,0.0005681927,0.00004983294,0.000007263948,0.00020115374,0.00020229918,0.0015759338,0.0128144855,0.9579955,0.0053738873,0.021044351],"study_design_scores_gemma":[0.000035255922,0.00007578641,0.0011278942,0.000033861208,0.000010999574,0.00053335447,0.0002736429,0.01747649,0.0056274314,0.9616936,0.013070576,0.000041147145],"about_ca_topic_score_codex":0.0011575128,"about_ca_topic_score_gemma":0.0023980162,"teacher_disagreement_score":0.01081347,"about_ca_system_score_codex":0.0006339868,"about_ca_system_score_gemma":0.00068278523,"threshold_uncertainty_score":0.036174655},"labels":[],"label_agreement":null},{"id":"W2920071073","doi":"","title":"Arc-Transitive Prime-Valent Graphs Of Order Twice A Prime Power.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Transitive relation; Prime (order theory); Prime power; Arc (geometry); Combinatorics; Order (exchange); Geometry; Business","score_opus":0.018223771257146547,"score_gpt":0.2921293774823923,"score_spread":0.2739056062252458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920071073","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4319891,0.0012174682,0.18304136,0.0027247416,0.00074106286,0.00017578853,0.002327653,0.0012933372,0.3764895],"genre_scores_gemma":[0.91568804,0.0006960545,0.027120266,0.0004100499,0.0002552639,0.00007234581,0.0011574699,0.0002031612,0.05439736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999482,0.00010402853,0.000028319539,0.00012907898,0.00013941053,0.00011721086],"domain_scores_gemma":[0.9975337,0.0009856567,0.00038504085,0.00041201996,0.000325129,0.00035849118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004948046,0.00055373734,0.0006354274,0.0015554086,0.0016822979,0.0023892394,0.00091689057,0.0007528088,0.013889553],"category_scores_gemma":[0.0028278155,0.000477303,0.000587983,0.0012975223,0.0018956249,0.0036485463,0.0012508503,0.001580113,0.002137305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091596274,0.00003352701,0.00045601165,0.000057110392,0.000016796012,0.00036726668,0.00030553382,0.0008610001,0.0023358774,0.98356795,0.003646674,0.008260774],"study_design_scores_gemma":[0.000024694626,0.000022936012,0.0004790295,0.00001697227,0.000027915241,0.00043718348,0.00017276469,0.0024071846,0.0015857946,0.9828079,0.012004439,0.000013083398],"about_ca_topic_score_codex":0.0012168029,"about_ca_topic_score_gemma":0.0019548025,"teacher_disagreement_score":0.013889553,"about_ca_system_score_codex":0.0009283597,"about_ca_system_score_gemma":0.0005353387,"threshold_uncertainty_score":0.04646516},"labels":[],"label_agreement":null},{"id":"W2920097892","doi":"","title":"Wiener index and Harary index on Hamilton-connected and traceable graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Wiener index; Combinatorics; Statistics; Graph; Computer science; World Wide Web","score_opus":0.01963593642719662,"score_gpt":0.26641896721847375,"score_spread":0.2467830307912771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920097892","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69388294,0.002361252,0.13336816,0.0020132351,0.00044902263,0.00007328877,0.001049689,0.00037647955,0.16642605],"genre_scores_gemma":[0.9680208,0.00091551634,0.00949819,0.00020274382,0.00029734612,0.00005561059,0.00037954084,0.000109106644,0.020521037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994784,0.00010464496,0.000027560563,0.000094991905,0.00017472968,0.00011968989],"domain_scores_gemma":[0.997162,0.0012291981,0.00049774,0.00023982981,0.00032362746,0.0005475997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064049003,0.0005742307,0.00077320583,0.0039763264,0.0014091516,0.0023438837,0.0013015444,0.0010414475,0.0088700885],"category_scores_gemma":[0.0054293456,0.0003108392,0.00054744584,0.0022289369,0.0024721834,0.0052959686,0.002108077,0.001605634,0.0009440307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031053845,0.000013180877,0.00038670047,0.000025478626,0.000008148422,0.000057615318,0.00012600722,0.001158163,0.00070948794,0.99221087,0.0012054717,0.0040678713],"study_design_scores_gemma":[0.000007012123,0.000008608491,0.00039922644,0.000011250345,0.0000067334995,0.000068526955,0.00006714035,0.006481633,0.00031508785,0.9912621,0.0013631964,0.000009397954],"about_ca_topic_score_codex":0.0013982428,"about_ca_topic_score_gemma":0.0016407327,"teacher_disagreement_score":0.0088700885,"about_ca_system_score_codex":0.0014202312,"about_ca_system_score_gemma":0.0005389811,"threshold_uncertainty_score":0.029673398},"labels":[],"label_agreement":null},{"id":"W2920125243","doi":"","title":"The crossing numbers of Cartesian products of path with some graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cartesian product; Path (computing); Crossing number (knot theory); Combinatorics; Computer science; Geography","score_opus":0.008350712571765334,"score_gpt":0.22761142148137045,"score_spread":0.2192607089096051,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920125243","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5458966,0.0010019715,0.3072282,0.00073311717,0.0005358602,0.00010063465,0.00086562254,0.0007851903,0.14285283],"genre_scores_gemma":[0.90077543,0.00049820903,0.07205628,0.00013587842,0.00013680251,0.00009638835,0.0006353271,0.00037591896,0.02528975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993216,0.0001538455,0.000047299145,0.0001666361,0.00019605136,0.00011456729],"domain_scores_gemma":[0.9974305,0.0011280323,0.0004385286,0.00031016677,0.00035727973,0.00033552377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007960439,0.00047756356,0.000363688,0.0027476156,0.0011327534,0.0026063195,0.0008329465,0.0007796428,0.013599238],"category_scores_gemma":[0.005331482,0.00039904437,0.0004809127,0.0017469415,0.0017519639,0.0032839254,0.0014862254,0.0013812509,0.0016348127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007322516,0.000024932191,0.001123437,0.000058957707,0.0000121611465,0.00016272164,0.00034306475,0.0025859757,0.0020404707,0.971183,0.003620434,0.018771522],"study_design_scores_gemma":[0.000017300967,0.00006606874,0.0017589859,0.00006458912,0.000034228553,0.00081414846,0.00037507105,0.017746726,0.005503233,0.94969946,0.023886748,0.000033410528],"about_ca_topic_score_codex":0.0006588051,"about_ca_topic_score_gemma":0.0008414761,"teacher_disagreement_score":0.013599238,"about_ca_system_score_codex":0.00074781134,"about_ca_system_score_gemma":0.00039411828,"threshold_uncertainty_score":0.04549402},"labels":[],"label_agreement":null},{"id":"W2920162031","doi":"","title":"The correlation between the f-chromatic class and the gc-chromatic class of an (r, r+1)-graph.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Color Science and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chromatic scale; Mathematics; Class (philosophy); Combinatorics; Correlation; Graph; Friendship graph; Windmill graph; Computer science; Artificial intelligence; Line graph; Graph power; Geometry","score_opus":0.008361065234893612,"score_gpt":0.24774729673232748,"score_spread":0.23938623149743388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920162031","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85109806,0.0017117254,0.06857564,0.0030399926,0.00028712078,0.00006188268,0.0038773569,0.00072839065,0.07061982],"genre_scores_gemma":[0.99025947,0.00038386232,0.004886556,0.00020797453,0.00021815383,0.00003632615,0.00066853757,0.00009781681,0.0032413043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999022,0.0001797111,0.00002762854,0.00037219934,0.00018254967,0.00021583316],"domain_scores_gemma":[0.98093706,0.011256379,0.003049951,0.0017179372,0.0015150914,0.0015236461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009914506,0.00035297778,0.0005050539,0.003307972,0.0012039974,0.0024675583,0.0011021144,0.001033946,0.010967995],"category_scores_gemma":[0.014603939,0.00035788128,0.00029847422,0.0020726565,0.0025461852,0.0034555658,0.00097476837,0.001562165,0.0009042774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004467112,0.00015236401,0.054646797,0.00021333757,0.00010033117,0.00023748851,0.00049835065,0.013520697,0.008313663,0.8500839,0.020045917,0.051740423],"study_design_scores_gemma":[0.00007469976,0.00013210898,0.061928753,0.00014479172,0.00012282864,0.0013198124,0.00035950541,0.07962403,0.0055689043,0.8383333,0.012244996,0.00014632214],"about_ca_topic_score_codex":0.0039330325,"about_ca_topic_score_gemma":0.0042076227,"teacher_disagreement_score":0.010967995,"about_ca_system_score_codex":0.0015433163,"about_ca_system_score_gemma":0.0007654436,"threshold_uncertainty_score":0.036691606},"labels":[],"label_agreement":null},{"id":"W2920165927","doi":"","title":"On the first reformulated Zagreb indices of graphs with a given clique number.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Clique; Combinatorics; Clique number; Discrete mathematics; Graph","score_opus":0.01730043306879466,"score_gpt":0.27359028305768107,"score_spread":0.25628984998888643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920165927","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13709132,0.0031820533,0.40103775,0.0031940795,0.0029000184,0.00013891316,0.0014916951,0.000558012,0.45040613],"genre_scores_gemma":[0.76044047,0.0020355922,0.16880558,0.0013931678,0.0015877318,0.00023757381,0.0011969449,0.0007925693,0.063510366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901795,0.00028863872,0.000042196232,0.00018413375,0.00027065442,0.00019643153],"domain_scores_gemma":[0.99835986,0.00058774813,0.00016683253,0.00028325064,0.00035650353,0.00024577536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014869764,0.0008093127,0.001019976,0.002549731,0.0021749248,0.0036124878,0.0022203508,0.0014614488,0.012338669],"category_scores_gemma":[0.0067059053,0.00041816378,0.0008449068,0.0021028135,0.0029965048,0.0064617572,0.001824567,0.004781558,0.0027471075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014638908,0.000008938282,0.00008594382,0.000025058593,0.0000025113268,0.000015692158,0.00006660703,0.00050872634,0.00024194397,0.9925708,0.0021044407,0.004354695],"study_design_scores_gemma":[0.000006320518,0.000011401078,0.0001500532,0.000027613576,0.0000056320173,0.000055608496,0.00004800756,0.0040674503,0.00036331007,0.9869942,0.008258984,0.000011407158],"about_ca_topic_score_codex":0.0019908547,"about_ca_topic_score_gemma":0.0035153094,"teacher_disagreement_score":0.012338669,"about_ca_system_score_codex":0.0020913281,"about_ca_system_score_gemma":0.0010515247,"threshold_uncertainty_score":0.04127693},"labels":[],"label_agreement":null},{"id":"W2920179048","doi":"","title":"On k-resonance of plane 4-8 lattices.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Plane (geometry); Resonance (particle physics); Geometry; Physics; Atomic physics","score_opus":0.006982278443218453,"score_gpt":0.20200534809098328,"score_spread":0.19502306964776484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920179048","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5393793,0.0014891834,0.10222404,0.0032213917,0.00069768407,0.00007768735,0.000423099,0.000430677,0.3520568],"genre_scores_gemma":[0.9647332,0.00039736362,0.012980986,0.00045868798,0.00018350223,0.000050636274,0.0001765099,0.000098538316,0.020920472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992778,0.0002175468,0.00002431484,0.000087308115,0.00016065713,0.00023238065],"domain_scores_gemma":[0.99904484,0.00043620454,0.00014160638,0.000105934756,0.000104118175,0.0001673131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041179883,0.00041280224,0.0004482596,0.0015054955,0.0017572105,0.0021596937,0.0006801355,0.0011786378,0.01342698],"category_scores_gemma":[0.0018939666,0.00030051006,0.0004046487,0.000596656,0.001957587,0.0022629693,0.0015532181,0.0013522318,0.0022119484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096075055,0.000020209765,0.00017096713,0.00003998173,0.000006495443,0.00014882296,0.00021767718,0.0023363968,0.0019155091,0.9883428,0.0027459462,0.003959028],"study_design_scores_gemma":[0.00002702459,0.000023479324,0.0002139421,0.00003712286,0.000004997888,0.00020146437,0.00031106136,0.016153803,0.0012091488,0.9764282,0.00536943,0.000020276782],"about_ca_topic_score_codex":0.001230275,"about_ca_topic_score_gemma":0.001592396,"teacher_disagreement_score":0.01342698,"about_ca_system_score_codex":0.0009856517,"about_ca_system_score_gemma":0.00052001467,"threshold_uncertainty_score":0.044917762},"labels":[],"label_agreement":null},{"id":"W2920201989","doi":"","title":"On the spectral radius of books.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; RADIUS; Computer science; Physics; Computer security; Quantum mechanics","score_opus":0.013156290760488385,"score_gpt":0.22218915655746418,"score_spread":0.2090328657969758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920201989","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17353907,0.023448959,0.22090994,0.024332438,0.0012805595,0.000108850545,0.0030015276,0.0013666204,0.552012],"genre_scores_gemma":[0.8938357,0.0070030447,0.04438577,0.0030874403,0.0017213159,0.0002977696,0.0018053573,0.0012719603,0.046591546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955369,0.002078719,0.00019639816,0.0008964138,0.0007353113,0.0005561991],"domain_scores_gemma":[0.96503663,0.0255193,0.0018473958,0.0034020606,0.0020836003,0.0021109586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029507382,0.0008847003,0.002155176,0.005651349,0.0058432035,0.007359065,0.0026085244,0.0028692738,0.028689958],"category_scores_gemma":[0.036138564,0.0010898177,0.0010080698,0.00741468,0.006622601,0.02168369,0.005483873,0.004199316,0.006004418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007023717,0.000020554826,0.00041974158,0.00007190176,0.000012377382,0.00001917478,0.00023355208,0.0009763831,0.00015253121,0.9788223,0.011176155,0.008025089],"study_design_scores_gemma":[0.000016357035,0.0000107135265,0.0005457935,0.000056641646,0.00001690213,0.000112728325,0.00027570562,0.0050066323,0.0002574593,0.9793635,0.0143207945,0.00001674295],"about_ca_topic_score_codex":0.0033342708,"about_ca_topic_score_gemma":0.002686728,"teacher_disagreement_score":0.028689958,"about_ca_system_score_codex":0.0037110974,"about_ca_system_score_gemma":0.0009785659,"threshold_uncertainty_score":0.095977426},"labels":[],"label_agreement":null},{"id":"W2920204422","doi":"","title":"Spanning 3-ended trees in quasi-claw-free graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Claw; Combinatorics; Spanning tree; Biology","score_opus":0.021387877771457828,"score_gpt":0.29092617063252935,"score_spread":0.2695382928610715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920204422","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75491244,0.00091241696,0.17478068,0.0011619357,0.00021501388,0.00012078959,0.001327921,0.00079911546,0.065769754],"genre_scores_gemma":[0.92291105,0.0004600182,0.04910387,0.0003862676,0.00006231473,0.00008337335,0.0014967463,0.00019042882,0.025305888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996124,0.0000836414,0.000029295836,0.000084780586,0.00009095542,0.00009897034],"domain_scores_gemma":[0.9982071,0.0008008718,0.00027411254,0.00019017176,0.00022748428,0.0003001693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004129077,0.00028493788,0.00036136777,0.0011714005,0.0013584212,0.0016907669,0.0008770474,0.0011643297,0.009003008],"category_scores_gemma":[0.0022611183,0.0005427635,0.00044801296,0.0011210868,0.0009764675,0.0031033,0.0015606581,0.0011491703,0.0019260001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017500107,0.00009551791,0.0023194326,0.0002304665,0.00003340336,0.0009639969,0.0010112823,0.0039684637,0.012126803,0.9412374,0.00592615,0.031912234],"study_design_scores_gemma":[0.00003623881,0.00004825746,0.00189657,0.00008684696,0.000036609832,0.0010666864,0.00057958986,0.013622832,0.005226871,0.96341187,0.013961138,0.000026530914],"about_ca_topic_score_codex":0.00092269696,"about_ca_topic_score_gemma":0.002255186,"teacher_disagreement_score":0.009003008,"about_ca_system_score_codex":0.00053985487,"about_ca_system_score_gemma":0.00036930226,"threshold_uncertainty_score":0.030118108},"labels":[],"label_agreement":null},{"id":"W2920214273","doi":"","title":"The diameter and Wiener index of modular product graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Wiener index; Modular design; Index (typography); Product (mathematics); Discrete mathematics; Graph; Computer science; Geometry; Programming language","score_opus":0.017804591139641113,"score_gpt":0.26872947389541857,"score_spread":0.25092488275577746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920214273","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79427135,0.0042573204,0.08179204,0.0021797512,0.00047200816,0.000029474793,0.0006913359,0.00024198285,0.116064794],"genre_scores_gemma":[0.9826163,0.0013143684,0.006302032,0.00012557834,0.00048886973,0.00004501019,0.00022512027,0.00009843606,0.008784504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995363,0.0001063398,0.000022680577,0.00011990452,0.00011889169,0.00009594493],"domain_scores_gemma":[0.9965215,0.0017598405,0.0006283869,0.00025649727,0.0002526541,0.0005810546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008336667,0.0005639642,0.0006994015,0.0030305653,0.00094555324,0.0021583305,0.0010235821,0.00082690234,0.0044562337],"category_scores_gemma":[0.0066850134,0.00044408604,0.00040543228,0.0011756271,0.0023479112,0.0058011874,0.0018924304,0.0011711991,0.0010423925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091355345,0.000020335476,0.0013934486,0.00005613857,0.000016529268,0.000092802926,0.00027043239,0.0018395381,0.0035845914,0.98224753,0.0026264677,0.007760807],"study_design_scores_gemma":[0.000017800743,0.000028106651,0.0021752531,0.000034190838,0.000025701558,0.0003839367,0.00015832104,0.011961794,0.0021347287,0.9781507,0.0049075517,0.00002189397],"about_ca_topic_score_codex":0.00042524384,"about_ca_topic_score_gemma":0.00043575413,"teacher_disagreement_score":0.0044562337,"about_ca_system_score_codex":0.0009416721,"about_ca_system_score_gemma":0.00026533424,"threshold_uncertainty_score":0.014907539},"labels":[],"label_agreement":null},{"id":"W2920249708","doi":"","title":"Distance spectrum of the generalized lexicographic product of a graph with a family of regular graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Lexicographical order; Product (mathematics); Graph product; Graph; Combinatorics; Spectrum (functional analysis); Discrete mathematics; Line graph; Pathwidth; Geometry; Physics","score_opus":0.00898990812416968,"score_gpt":0.2047603004149597,"score_spread":0.19577039229079002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920249708","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8253641,0.00063280284,0.10868678,0.0013813778,0.00016416874,0.000028959517,0.000696052,0.0002534244,0.06279227],"genre_scores_gemma":[0.9714626,0.00024805294,0.018620651,0.0001922575,0.00012984313,0.00004826584,0.0004789441,0.00009904905,0.0087203495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995202,0.00011345515,0.00002243204,0.00013057026,0.00012982576,0.00008346795],"domain_scores_gemma":[0.99848026,0.0005704195,0.00026954027,0.0001576749,0.00017724722,0.0003448551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046357606,0.00033309677,0.0004782216,0.0017383884,0.0011726733,0.0018115615,0.0007807725,0.00081269414,0.007628827],"category_scores_gemma":[0.0019227738,0.00028446343,0.00039379986,0.0009728734,0.001298692,0.0021007394,0.0011875592,0.00092082814,0.0007373028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080536025,0.000023900762,0.0006248834,0.000033716376,0.000010221864,0.00010460003,0.00015014602,0.0017641168,0.0024880539,0.9870898,0.002001054,0.005628895],"study_design_scores_gemma":[0.000029461085,0.000042583346,0.0012404012,0.000025816185,0.000015106936,0.0005262267,0.0002719019,0.032197326,0.0019064094,0.95785964,0.0058634556,0.000021692542],"about_ca_topic_score_codex":0.00079668104,"about_ca_topic_score_gemma":0.0006687077,"teacher_disagreement_score":0.007628827,"about_ca_system_score_codex":0.00087420444,"about_ca_system_score_gemma":0.0004047455,"threshold_uncertainty_score":0.02552098},"labels":[],"label_agreement":null},{"id":"W2920313231","doi":"","title":"Distance two labelings in regular bipartite graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Discrete mathematics; Graph","score_opus":0.01041271974958137,"score_gpt":0.24002021229023857,"score_spread":0.2296074925406572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920313231","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3905411,0.002829724,0.43791324,0.011247074,0.0007694705,0.000205485,0.003862682,0.0010174443,0.15161388],"genre_scores_gemma":[0.8565798,0.0010085008,0.109190345,0.001192883,0.00044633247,0.00020311301,0.0023563874,0.0003232516,0.028699473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971507,0.001091512,0.00020609445,0.00066345057,0.00050241995,0.00038573932],"domain_scores_gemma":[0.9861254,0.009577513,0.0011448284,0.0014526037,0.0006477581,0.0010518889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021123225,0.0005347056,0.0009588808,0.002420148,0.0024922974,0.004797047,0.0018123956,0.0025416925,0.012536641],"category_scores_gemma":[0.014512689,0.00069546804,0.0009364987,0.0029622752,0.00321757,0.008565119,0.0033177778,0.003402105,0.0017374726],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015384168,0.000063869826,0.0009791002,0.0001281937,0.00002341866,0.00006557999,0.00027561982,0.0027939249,0.0006976278,0.96843344,0.0076655857,0.01871987],"study_design_scores_gemma":[0.000032647204,0.000018191782,0.00039896433,0.00003977249,0.000019049867,0.0001728149,0.0002484155,0.013262822,0.0007817647,0.9777985,0.0072095958,0.000017404123],"about_ca_topic_score_codex":0.0013640196,"about_ca_topic_score_gemma":0.0016486134,"teacher_disagreement_score":0.012536641,"about_ca_system_score_codex":0.0025237987,"about_ca_system_score_gemma":0.001038402,"threshold_uncertainty_score":0.04193926},"labels":[],"label_agreement":null},{"id":"W2920327934","doi":"","title":"Ordering connected non-bipartite graphs by the least Q-eigenvalue.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Eigenvalues and eigenvectors; Discrete mathematics; Graph; Physics; Quantum mechanics","score_opus":0.022627687731638785,"score_gpt":0.2802282080225212,"score_spread":0.25760052029088243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920327934","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40754884,0.00091871445,0.45931965,0.0028570218,0.00078899605,0.0002588071,0.0016229202,0.0012450583,0.12543999],"genre_scores_gemma":[0.8129093,0.000663497,0.13526179,0.00090514414,0.00044078805,0.0003052175,0.0012371463,0.00055681146,0.04772013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901545,0.00035940018,0.000058841986,0.00016839367,0.00019882897,0.00019896915],"domain_scores_gemma":[0.9956482,0.0019939775,0.00069192355,0.00045976322,0.0005669216,0.000639254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007908628,0.0006381962,0.0007143847,0.0018492778,0.0014034945,0.0020474703,0.0007305218,0.0012797742,0.016798267],"category_scores_gemma":[0.0055348026,0.00046506696,0.0005369213,0.0013953495,0.0018203554,0.0025214914,0.0014439718,0.0016556004,0.0037797599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003095702,0.0001356089,0.0013565723,0.00021769917,0.000033003602,0.00040492348,0.0005257651,0.004870277,0.01617458,0.927523,0.015173767,0.03327528],"study_design_scores_gemma":[0.00004219448,0.000047063895,0.00059794757,0.000034537392,0.000010364331,0.00025698915,0.0002246792,0.012515668,0.002381524,0.97785485,0.006011721,0.000022368666],"about_ca_topic_score_codex":0.0007350932,"about_ca_topic_score_gemma":0.0016017533,"teacher_disagreement_score":0.016798267,"about_ca_system_score_codex":0.0008316305,"about_ca_system_score_gemma":0.0006905372,"threshold_uncertainty_score":0.056195796},"labels":[],"label_agreement":null},{"id":"W2920329972","doi":"","title":"A New Lower Bound on the Total Domination Number of a Tree.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Tree (set theory); Domination analysis; Combinatorics; Upper and lower bounds; Mathematical analysis; Graph","score_opus":0.015207045081257102,"score_gpt":0.2931586158511737,"score_spread":0.2779515707699166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920329972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07227004,0.011859222,0.61334884,0.0067973146,0.002541674,0.00021600912,0.004922609,0.0019281697,0.28611618],"genre_scores_gemma":[0.6265308,0.008459936,0.26889822,0.0032372668,0.0041204453,0.0007949777,0.00622377,0.0022784227,0.079456165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974657,0.00033201417,0.00013708719,0.0006493675,0.00097241404,0.00044333216],"domain_scores_gemma":[0.9886341,0.007203744,0.00055423635,0.0016819314,0.0010129511,0.0009130242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019088719,0.0016357602,0.0016184826,0.0041390317,0.0020822354,0.0056801494,0.0041174055,0.002248659,0.022896837],"category_scores_gemma":[0.01241465,0.0007374391,0.0014071722,0.0036809405,0.0021141304,0.01103768,0.003433103,0.006015607,0.004908132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042544873,0.0002495128,0.0024649738,0.001021562,0.00016166501,0.00031008545,0.00040488917,0.03079632,0.020943929,0.76329416,0.06777105,0.11215647],"study_design_scores_gemma":[0.000049160313,0.000103100516,0.0017418542,0.00023588963,0.00017248148,0.0010036267,0.00015166128,0.115645975,0.006734443,0.8087038,0.065377824,0.00008023077],"about_ca_topic_score_codex":0.0012243412,"about_ca_topic_score_gemma":0.0029376,"teacher_disagreement_score":0.022896837,"about_ca_system_score_codex":0.0030616361,"about_ca_system_score_gemma":0.0013007097,"threshold_uncertainty_score":0.07659751},"labels":[],"label_agreement":null},{"id":"W2920365169","doi":"","title":"First Reformulated Zagreb Index And Some Graph Operations.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Graph; Combinatorics; Computer science; World Wide Web","score_opus":0.013728541977211137,"score_gpt":0.27196476074937176,"score_spread":0.25823621877216063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920365169","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06883533,0.0068109343,0.3120914,0.0053611957,0.0039569456,0.000121238154,0.001730739,0.00055783166,0.6005344],"genre_scores_gemma":[0.69497997,0.0055706026,0.15101571,0.0024268194,0.0027842696,0.0002135935,0.0013913901,0.00081535045,0.14080225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992735,0.00017017545,0.00004747591,0.0001659821,0.00021097357,0.00013193111],"domain_scores_gemma":[0.99923456,0.00023886729,0.000068042245,0.0001686048,0.00020430368,0.00008568058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010300041,0.0008043369,0.00093525526,0.0027923165,0.0021194143,0.0032021787,0.0013765758,0.0010545112,0.014243507],"category_scores_gemma":[0.0035602616,0.00025794076,0.0008699836,0.0030226791,0.0025471116,0.007891513,0.002180269,0.0039100777,0.0042838594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010431313,0.000006854417,0.00005243986,0.000027349453,0.0000027396322,0.0000199828,0.0000562205,0.00021715788,0.0001847498,0.98833185,0.0028750561,0.008215034],"study_design_scores_gemma":[0.0000046603777,0.000011993549,0.00012585931,0.000021774566,0.0000072507128,0.00008660915,0.0000432107,0.0011981467,0.00037913688,0.9757336,0.02237725,0.000010526469],"about_ca_topic_score_codex":0.0022020682,"about_ca_topic_score_gemma":0.0025584372,"teacher_disagreement_score":0.014243507,"about_ca_system_score_codex":0.001909429,"about_ca_system_score_gemma":0.0008548961,"threshold_uncertainty_score":0.047649324},"labels":[],"label_agreement":null},{"id":"W2920387528","doi":"","title":"The degree sequence of the graph with cyclomatic number less than four.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cyclomatic complexity; Degree (music); Graph; Sequence (biology); Discrete mathematics; Computer science; Programming language; Software","score_opus":0.0243412446848802,"score_gpt":0.2135070677587121,"score_spread":0.1891658230738319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920387528","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7915454,0.0008005248,0.052760214,0.0029218327,0.0008898331,0.0001488296,0.0073495153,0.00060067687,0.1429832],"genre_scores_gemma":[0.9517113,0.000639536,0.017856192,0.00044463907,0.00011152903,0.00012240169,0.003089742,0.00013171192,0.025893006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999801,0.000035495148,0.00000831064,0.000050353607,0.00003673627,0.000068142916],"domain_scores_gemma":[0.9990551,0.00032363637,0.00014831545,0.00009386935,0.00019678383,0.00018235754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017896344,0.0003308901,0.00018889019,0.0018852664,0.0009013785,0.00087246485,0.0004147253,0.00061265036,0.006930134],"category_scores_gemma":[0.0013942457,0.00014238921,0.00019230395,0.00086153706,0.00077595725,0.0008336381,0.00049619836,0.0008620951,0.0012682484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060377736,0.0001337322,0.006253919,0.00036465464,0.000031094663,0.0013519354,0.0008742334,0.00843494,0.04769014,0.8581396,0.027388923,0.048733033],"study_design_scores_gemma":[0.00009195078,0.00026505964,0.016896434,0.0002928316,0.000057079433,0.0029148906,0.0012499028,0.057179898,0.029736534,0.7763041,0.11488468,0.00012662636],"about_ca_topic_score_codex":0.001867613,"about_ca_topic_score_gemma":0.0021139132,"teacher_disagreement_score":0.006930134,"about_ca_system_score_codex":0.00070252613,"about_ca_system_score_gemma":0.0006437638,"threshold_uncertainty_score":0.023183644},"labels":[],"label_agreement":null},{"id":"W2920454506","doi":"","title":"The pancyclic properties of d-ary n-dimensional cube.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cube (algebra); Pure mathematics; Combinatorics","score_opus":0.009062265075893937,"score_gpt":0.1860738171771643,"score_spread":0.17701155210127037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920454506","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52895325,0.0029693719,0.06770912,0.0033763112,0.00048729798,0.00010390669,0.0025469915,0.00025524164,0.39359862],"genre_scores_gemma":[0.97662354,0.0012318703,0.007853157,0.0004385594,0.00017560604,0.00006485297,0.00052502484,0.0000415327,0.013045828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961334,0.0000805702,0.00001788738,0.00007056295,0.00011910661,0.00009851484],"domain_scores_gemma":[0.9982936,0.00074795214,0.00027327778,0.0003164722,0.00019633927,0.00017234494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024155986,0.00024764266,0.0003479835,0.00073960715,0.0010069074,0.0018017243,0.0004910352,0.000534567,0.009080595],"category_scores_gemma":[0.002783326,0.00021674401,0.0002510204,0.0010898287,0.0011375297,0.0020901095,0.0013518834,0.0010660235,0.0010548553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017132069,0.00002380076,0.0005811828,0.00011631306,0.00001165315,0.0002786916,0.00024240337,0.0050343582,0.004398208,0.9598297,0.0106804315,0.01863189],"study_design_scores_gemma":[0.000038456532,0.00006151469,0.0011193032,0.00004559202,0.000018331746,0.0007623524,0.00022153962,0.019790482,0.0027914734,0.9552714,0.019850472,0.000029019657],"about_ca_topic_score_codex":0.0013940339,"about_ca_topic_score_gemma":0.001354959,"teacher_disagreement_score":0.009080595,"about_ca_system_score_codex":0.00057550374,"about_ca_system_score_gemma":0.00051973,"threshold_uncertainty_score":0.030377567},"labels":[],"label_agreement":null},{"id":"W2920466201","doi":"","title":"On Zagreb indices and spectral radius of partial k-trees.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; RADIUS; Spectral radius; Physics; Computer science; Eigenvalues and eigenvectors","score_opus":0.02003394539558644,"score_gpt":0.2844005039640042,"score_spread":0.26436655856841773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920466201","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7290553,0.008106514,0.09426637,0.0022616803,0.000369467,0.00004405468,0.00065758824,0.00032135853,0.16491765],"genre_scores_gemma":[0.9752677,0.002098394,0.0141679095,0.00023568221,0.0003036016,0.00005247304,0.00034352372,0.0001173363,0.0074133724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992143,0.0002458445,0.000047623056,0.00013852447,0.00018760188,0.00016604224],"domain_scores_gemma":[0.99566144,0.0023649072,0.0006924661,0.00033982625,0.00037971127,0.00056162523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011424702,0.0005114217,0.0010967718,0.00354756,0.0017050918,0.0030394818,0.0013517464,0.001026105,0.005721359],"category_scores_gemma":[0.009063406,0.00038821873,0.00032404604,0.0023045277,0.0027015926,0.005344995,0.0021024963,0.0017999883,0.00143097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007474296,0.000024135159,0.0012445007,0.000060138587,0.000010055823,0.000046518853,0.0003107499,0.0020588746,0.00089470885,0.9819402,0.0019601919,0.011375202],"study_design_scores_gemma":[0.000013147279,0.00001769666,0.0013865863,0.00004806718,0.000015742708,0.0002045256,0.0002653106,0.00845921,0.00050995627,0.98497194,0.0040913387,0.00001637871],"about_ca_topic_score_codex":0.0015039508,"about_ca_topic_score_gemma":0.0018768464,"teacher_disagreement_score":0.005721359,"about_ca_system_score_codex":0.0012653448,"about_ca_system_score_gemma":0.00042474447,"threshold_uncertainty_score":0.019139886},"labels":[],"label_agreement":null},{"id":"W2920477488","doi":"","title":"Reciprocal Product Degree Distance of Tensor Product of Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Reciprocal; Tensor product; Product (mathematics); Degree (music); Combinatorics; Pure mathematics; Geometry; Physics; Linguistics","score_opus":0.0181237300429473,"score_gpt":0.23851606653457288,"score_spread":0.2203923364916256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920477488","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63716614,0.0023069694,0.2434985,0.002220518,0.00053068186,0.00006797581,0.0015123632,0.0006458588,0.112051025],"genre_scores_gemma":[0.9507453,0.00080596976,0.033312596,0.00023246113,0.00025871675,0.000060485156,0.00084233476,0.00018492172,0.013557211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840146,0.00044307337,0.00008707571,0.0003771193,0.00047445498,0.00021677454],"domain_scores_gemma":[0.9946148,0.0019810356,0.0007878272,0.00094078324,0.000956408,0.0007191008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011472715,0.00045993002,0.00069174357,0.0027565605,0.0012824978,0.0030337262,0.0012941819,0.0010536064,0.008631887],"category_scores_gemma":[0.008546933,0.000335456,0.0004642898,0.0023982602,0.0017428825,0.0063731717,0.0021982726,0.0014694822,0.0016259855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022577902,0.00006640772,0.0029776837,0.00014628319,0.00004363826,0.00014189344,0.00055377174,0.004048621,0.0031117196,0.94921243,0.0067272717,0.03274456],"study_design_scores_gemma":[0.000021014406,0.00009803294,0.0027150894,0.000056664387,0.00007075143,0.00080543745,0.00048618097,0.0389254,0.003878388,0.935058,0.01783437,0.00005072237],"about_ca_topic_score_codex":0.0009509478,"about_ca_topic_score_gemma":0.0010358493,"teacher_disagreement_score":0.008631887,"about_ca_system_score_codex":0.0011788096,"about_ca_system_score_gemma":0.00041678402,"threshold_uncertainty_score":0.028876543},"labels":[],"label_agreement":null},{"id":"W2920493612","doi":"","title":"On list backbone coloring of graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Complete coloring; Graph coloring; List coloring; Edge coloring; Fractional coloring; Greedy coloring; Combinatorics; Graph; Line graph","score_opus":0.01357559685688206,"score_gpt":0.23368173776398318,"score_spread":0.22010614090710112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920493612","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16631562,0.008033477,0.5058974,0.016595244,0.001980008,0.00034649338,0.0039062195,0.0022655271,0.29465994],"genre_scores_gemma":[0.65480226,0.008208177,0.22547702,0.0047113798,0.0024607324,0.0005272697,0.0061859027,0.0014020749,0.09622526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985662,0.00050981215,0.00005529203,0.0002909638,0.0002472321,0.00033053476],"domain_scores_gemma":[0.992591,0.00469636,0.00044646574,0.0011375992,0.00049927336,0.00062938436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015653408,0.0011341539,0.0011624448,0.0022059944,0.0028478615,0.0037085828,0.0024511747,0.0019375411,0.019877661],"category_scores_gemma":[0.00882329,0.0007782087,0.0008813659,0.0039274152,0.0027589668,0.0109276455,0.00353906,0.0037825597,0.0036112303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017433053,0.00017063487,0.001133721,0.0003122555,0.00003214382,0.00009200313,0.00031671065,0.011092337,0.0012519581,0.87999237,0.05233853,0.053092953],"study_design_scores_gemma":[0.00003703623,0.00002604771,0.00046239674,0.000069547525,0.0000239321,0.00012784454,0.0002501755,0.024110725,0.00076977984,0.9558948,0.01820859,0.000019041052],"about_ca_topic_score_codex":0.0042615053,"about_ca_topic_score_gemma":0.006769475,"teacher_disagreement_score":0.019877661,"about_ca_system_score_codex":0.0033443181,"about_ca_system_score_gemma":0.0016734615,"threshold_uncertainty_score":0.066497445},"labels":[],"label_agreement":null},{"id":"W2920501364","doi":"","title":"Integral Graphs With Distinct Eigenvalues.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Pure mathematics; Physics","score_opus":0.024139030417929874,"score_gpt":0.28524564654847334,"score_spread":0.2611066161305435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920501364","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40600115,0.0018638506,0.22817063,0.0045184577,0.0009977306,0.00010298266,0.00087859004,0.00082267926,0.35664394],"genre_scores_gemma":[0.9378573,0.0007274803,0.027277535,0.00053922,0.0003744794,0.00007128399,0.00037636174,0.0001858493,0.03259045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942243,0.00011245135,0.000022162063,0.00012530028,0.00019593918,0.000121725345],"domain_scores_gemma":[0.9985266,0.0005516788,0.0002038974,0.00023662779,0.00023182626,0.0002492656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045559247,0.0005610331,0.000597304,0.0023877227,0.0013862567,0.002503169,0.0008095626,0.00125861,0.01290766],"category_scores_gemma":[0.0035498603,0.00041586408,0.00047190703,0.0010967499,0.0025600512,0.003566418,0.0023817862,0.00228738,0.0021095644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025102509,0.000016426884,0.00017306299,0.000025487045,0.000005409511,0.00010986095,0.00009691868,0.0003414719,0.0012187365,0.99054724,0.0024257472,0.0050145276],"study_design_scores_gemma":[0.000009770367,0.0000054387856,0.00022801185,0.000013268261,0.000006854235,0.00024722968,0.00008468505,0.0030676776,0.0004955988,0.9927246,0.0031103764,0.0000064970013],"about_ca_topic_score_codex":0.0004504504,"about_ca_topic_score_gemma":0.0007383856,"teacher_disagreement_score":0.01290766,"about_ca_system_score_codex":0.0008903239,"about_ca_system_score_gemma":0.00045931904,"threshold_uncertainty_score":0.043180406},"labels":[],"label_agreement":null},{"id":"W2920588083","doi":"","title":"One class of primitive 2-arc transitive graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Transitive relation; Arc (geometry); Class (philosophy); Combinatorics; Discrete mathematics; Geometry; Computer science; Artificial intelligence","score_opus":0.02076743782908075,"score_gpt":0.27991681813936203,"score_spread":0.2591493803102813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920588083","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29053265,0.0012800422,0.1240263,0.0027798521,0.0011181515,0.0002881547,0.0041313376,0.0025674598,0.573276],"genre_scores_gemma":[0.9093658,0.0006647854,0.023774074,0.00052127254,0.0004702183,0.00011376538,0.0031403436,0.00024948898,0.06170028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994531,0.00005570969,0.000025561934,0.00018126877,0.00015738558,0.00012683294],"domain_scores_gemma":[0.9984724,0.00044025973,0.00020523438,0.00043565247,0.0001852429,0.00026133077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024910402,0.00053281605,0.00049903104,0.0011939217,0.0017195417,0.0026706364,0.0012102753,0.001205863,0.023269907],"category_scores_gemma":[0.0017381618,0.0002735015,0.00067139877,0.0009742963,0.0012392286,0.0029254798,0.0012898841,0.0017635033,0.003223774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012011431,0.00009418498,0.0010746962,0.00015334135,0.000015599448,0.00045373137,0.00028691572,0.0007273405,0.0025988114,0.93595105,0.014212857,0.044311337],"study_design_scores_gemma":[0.000040224666,0.000063625695,0.0014140245,0.000053611075,0.000023955168,0.0015194181,0.0002442498,0.004215813,0.0022623506,0.92477363,0.06535593,0.00003308999],"about_ca_topic_score_codex":0.0006580076,"about_ca_topic_score_gemma":0.0010291076,"teacher_disagreement_score":0.023269907,"about_ca_system_score_codex":0.00070402346,"about_ca_system_score_gemma":0.0007071492,"threshold_uncertainty_score":0.07784563},"labels":[],"label_agreement":null},{"id":"W2920649362","doi":"","title":"Hamilton Cycles in n-Extendable Bipartite Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Combinatorics; Discrete mathematics; Graph","score_opus":0.007572838735499005,"score_gpt":0.20994394999402358,"score_spread":0.20237111125852458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920649362","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49168238,0.0017211905,0.3149108,0.0017545111,0.0003136967,0.00019753241,0.0010341912,0.00044880094,0.18793695],"genre_scores_gemma":[0.9349327,0.0007110991,0.02589289,0.0003339149,0.00011156155,0.00013098774,0.00034504288,0.00004811459,0.03749373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960834,0.00013656315,0.00002015319,0.00007790422,0.000083610284,0.0000734842],"domain_scores_gemma":[0.99869174,0.0006682351,0.00020838054,0.0001400453,0.00012444667,0.0001672779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031576966,0.00033107185,0.00027100524,0.0011261555,0.0007662869,0.001021424,0.0005686927,0.00065602857,0.0073597715],"category_scores_gemma":[0.0022377733,0.00029224696,0.00031967717,0.0007461598,0.00091843726,0.001544077,0.001010117,0.00070783054,0.00059645413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059479622,0.000040120536,0.00061470503,0.00008288888,0.000018251996,0.00024861388,0.00019223451,0.0073184283,0.0024914914,0.9671491,0.003401909,0.018382866],"study_design_scores_gemma":[0.000023019225,0.000024126288,0.00066935166,0.000035167275,0.000014376394,0.00022389535,0.00011687596,0.031205447,0.0009917626,0.95689625,0.009786002,0.000013664986],"about_ca_topic_score_codex":0.0019399344,"about_ca_topic_score_gemma":0.004177748,"teacher_disagreement_score":0.0073597715,"about_ca_system_score_codex":0.00090716366,"about_ca_system_score_gemma":0.00053258403,"threshold_uncertainty_score":0.02462089},"labels":[],"label_agreement":null},{"id":"W2920654334","doi":"","title":"A new labeling of C2n proves that K4 + M6n decomposes K6n+4.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Inorganic Chemistry and Materials","field":"Chemistry","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.013406220743093836,"score_gpt":0.24498066221705173,"score_spread":0.2315744414739579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920654334","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11979733,0.0010850489,0.24890295,0.004862332,0.0043608053,0.0001809726,0.0020398288,0.0019745394,0.61679626],"genre_scores_gemma":[0.5847656,0.0012048185,0.21354938,0.0022672426,0.000712681,0.00028049716,0.0040523335,0.0023497639,0.19081774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928325,0.0000763013,0.00003642501,0.00018842709,0.00026116718,0.00015446571],"domain_scores_gemma":[0.99938583,0.00009037631,0.00004577057,0.00012943956,0.00020239403,0.00014617307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042625132,0.0013600282,0.0004679617,0.0015828317,0.002450461,0.0015773462,0.0010980582,0.0007289026,0.028862879],"category_scores_gemma":[0.0008652717,0.0003529813,0.0009658433,0.00070384063,0.0019385047,0.003043808,0.003244586,0.002985651,0.0063068112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034245025,0.0001695221,0.001167801,0.00040559145,0.000054205408,0.0009861734,0.0010667018,0.0011092991,0.042399984,0.81761616,0.054666825,0.08001524],"study_design_scores_gemma":[0.00005774318,0.00011142907,0.00217479,0.0001344463,0.00007899711,0.0013908,0.00078645546,0.0039141555,0.03448462,0.66841996,0.2883492,0.00009747336],"about_ca_topic_score_codex":0.002284122,"about_ca_topic_score_gemma":0.005575437,"teacher_disagreement_score":0.028862879,"about_ca_system_score_codex":0.0014060067,"about_ca_system_score_gemma":0.0007506483,"threshold_uncertainty_score":0.09655589},"labels":[],"label_agreement":null},{"id":"W2920676263","doi":"","title":"Plane graphs without homeomorphically irreducible spanning trees","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spanning tree; Combinatorics; Plane (geometry); Geometry","score_opus":0.021787341638129926,"score_gpt":0.28831440027833233,"score_spread":0.26652705864020243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920676263","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6678133,0.0009875434,0.18598919,0.001833653,0.00018004836,0.0001455928,0.0020980153,0.00095887476,0.13999379],"genre_scores_gemma":[0.92183936,0.0010398942,0.042531226,0.00043168524,0.00010512935,0.00008751243,0.0020708465,0.00026279996,0.031631432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999468,0.00009663083,0.000029138868,0.00014627042,0.00013632812,0.00012357492],"domain_scores_gemma":[0.9986022,0.00046385638,0.00030760223,0.00029742403,0.00016292723,0.0001659032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003055388,0.00070354424,0.00074650336,0.0015834505,0.0013562558,0.0035301752,0.0010448218,0.0014082508,0.012325809],"category_scores_gemma":[0.0020069804,0.0007846042,0.0006490404,0.0021011762,0.001408132,0.0041989908,0.0018008891,0.0023931284,0.0022421565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011616318,0.00005831745,0.000857278,0.00010240616,0.000037176236,0.00030090177,0.00029856668,0.0026708334,0.0043668426,0.9721306,0.003976609,0.01508426],"study_design_scores_gemma":[0.0000410424,0.000026312391,0.0010756208,0.000032366857,0.00006416136,0.0006805306,0.00036407495,0.00784423,0.003072148,0.97495383,0.01182607,0.00001974863],"about_ca_topic_score_codex":0.0010840265,"about_ca_topic_score_gemma":0.001447521,"teacher_disagreement_score":0.012325809,"about_ca_system_score_codex":0.00061513815,"about_ca_system_score_gemma":0.00034947842,"threshold_uncertainty_score":0.041234016},"labels":[],"label_agreement":null},{"id":"W2920684777","doi":"","title":"Twin signed total domination numbers in directed graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01073964492393636,"score_gpt":0.27440831720286907,"score_spread":0.2636686722789327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920684777","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5642094,0.0011501041,0.30453357,0.001323551,0.00056463963,0.00010630362,0.00090656546,0.00064051565,0.12656532],"genre_scores_gemma":[0.94787353,0.00040555972,0.031499952,0.00019711923,0.00014204155,0.00009931828,0.00033471873,0.00010760887,0.019340167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991171,0.00023208417,0.00007153384,0.00017232317,0.00026864323,0.00013819446],"domain_scores_gemma":[0.9965037,0.0016506553,0.00049089163,0.00036030577,0.0005496661,0.0004448667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095699704,0.00034464794,0.00038612692,0.001865583,0.0010238385,0.0027145066,0.0006564185,0.0006065698,0.006923403],"category_scores_gemma":[0.0059794514,0.00028035208,0.00031241262,0.0014657394,0.0014840171,0.004008473,0.0014354781,0.0010409441,0.0007732939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099209516,0.000021398204,0.0010979561,0.000093164235,0.000015761487,0.00012707061,0.0002663978,0.0019158155,0.0030118488,0.9629933,0.0024706817,0.027887315],"study_design_scores_gemma":[0.000022259475,0.000030472373,0.0005965885,0.000036962687,0.000022514734,0.00036166704,0.00016751655,0.011276592,0.0026203599,0.9755086,0.009334813,0.000021722652],"about_ca_topic_score_codex":0.0004046589,"about_ca_topic_score_gemma":0.0008805971,"teacher_disagreement_score":0.006923403,"about_ca_system_score_codex":0.0007902153,"about_ca_system_score_gemma":0.000562397,"threshold_uncertainty_score":0.023161113},"labels":[],"label_agreement":null},{"id":"W2920730178","doi":"","title":"Dominating set and hamiltonicity in claw-heavy graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Claw; Combinatorics; Set (abstract data type); Biology; Computer science; Programming language","score_opus":0.019312237141795082,"score_gpt":0.29657290160451144,"score_spread":0.27726066446271636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920730178","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77338785,0.0016893444,0.12109004,0.0033988943,0.00029680802,0.0002020638,0.001352418,0.00032525425,0.098257266],"genre_scores_gemma":[0.96502864,0.0005777776,0.01134239,0.00043558408,0.00016792316,0.00008264975,0.0007546202,0.00005266882,0.021557724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952865,0.00009153479,0.000018505292,0.00012645808,0.00011557142,0.000119308184],"domain_scores_gemma":[0.996784,0.0017954715,0.0004116897,0.00027905975,0.00025599828,0.00047380108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004307962,0.00039625246,0.00050146435,0.0015084271,0.0015890683,0.0017757498,0.0011773143,0.0008733956,0.00733823],"category_scores_gemma":[0.0034218258,0.000495866,0.000457859,0.001378677,0.0019289788,0.002316576,0.0016528063,0.0014151279,0.00055731647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020499148,0.00010677572,0.0028022714,0.00021215797,0.0000480603,0.00049709406,0.0007284267,0.0064751483,0.0074697887,0.95072067,0.008387407,0.022347283],"study_design_scores_gemma":[0.000057732526,0.000057167224,0.0018984347,0.000040093528,0.00003955404,0.00047592603,0.00040476964,0.018879782,0.0027173678,0.9684549,0.0069515337,0.000022807182],"about_ca_topic_score_codex":0.003811846,"about_ca_topic_score_gemma":0.0059520225,"teacher_disagreement_score":0.00733823,"about_ca_system_score_codex":0.0013183596,"about_ca_system_score_gemma":0.00077458826,"threshold_uncertainty_score":0.024548829},"labels":[],"label_agreement":null},{"id":"W2920753679","doi":"","title":"Hyper-Wiener index and Hamiltonicity of graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Wiener index; Combinatorics; Statistics; Graph; Computer science; World Wide Web","score_opus":0.022559600643046556,"score_gpt":0.28002582304284424,"score_spread":0.25746622239979766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920753679","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6847284,0.00428952,0.12872592,0.0027103606,0.00047636015,0.000060279704,0.0007982669,0.00026563625,0.1779453],"genre_scores_gemma":[0.96940494,0.0013733725,0.008564313,0.00024486592,0.0003214429,0.000046390058,0.00029269888,0.00006822052,0.01968367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996865,0.00007567641,0.000015233156,0.00005861057,0.00009824245,0.00006575213],"domain_scores_gemma":[0.9985446,0.0005766593,0.0003131752,0.00013259103,0.00017369824,0.00025937246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047391732,0.00037535987,0.0004662359,0.0027541236,0.00082035956,0.0019123661,0.00065260375,0.0006506735,0.0054375473],"category_scores_gemma":[0.003273261,0.00026692718,0.00038657867,0.0014162719,0.0019535748,0.0029243284,0.0012686875,0.0010441258,0.00079786347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022963624,0.000011276127,0.0005750721,0.000028376175,0.000008563916,0.000056018594,0.00012647352,0.00090570294,0.0012441468,0.99001336,0.0013183424,0.005689645],"study_design_scores_gemma":[0.0000058290907,0.000007281133,0.0005548039,0.000011462391,0.000005671098,0.00007030786,0.000070076116,0.0041777296,0.00037909718,0.99293643,0.0017739575,0.0000072642097],"about_ca_topic_score_codex":0.0012862411,"about_ca_topic_score_gemma":0.0020695708,"teacher_disagreement_score":0.0054375473,"about_ca_system_score_codex":0.0009849529,"about_ca_system_score_gemma":0.0004180187,"threshold_uncertainty_score":0.018190444},"labels":[],"label_agreement":null},{"id":"W2920782108","doi":"","title":"2-upper bound graphs of posets","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.015371943110201996,"score_gpt":0.2894162301046144,"score_spread":0.2740442869944124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920782108","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21868354,0.0019500748,0.5682213,0.005370675,0.0007008152,0.0002674157,0.0036765663,0.0023859572,0.19874366],"genre_scores_gemma":[0.7411548,0.0017980352,0.12957063,0.0030137396,0.00089452247,0.00060799165,0.0073651066,0.0018550516,0.113740094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99714726,0.0006136432,0.00015504443,0.00079677714,0.0007141259,0.00057310617],"domain_scores_gemma":[0.9926777,0.0037773186,0.00068038306,0.0011434348,0.0007014638,0.0010196028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013521075,0.0021285273,0.0018209969,0.003896921,0.003937741,0.00980382,0.0035162368,0.0027332988,0.038982306],"category_scores_gemma":[0.0069397027,0.0019053664,0.0026235725,0.004747946,0.003293931,0.012281329,0.0063853706,0.006449037,0.005573373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016311185,0.00012560507,0.0006060869,0.00017081996,0.000037682457,0.00019611818,0.0007829831,0.00380063,0.0018003847,0.97148263,0.007577438,0.01325648],"study_design_scores_gemma":[0.00002303405,0.000018946226,0.00037082477,0.000035268502,0.000029519075,0.00015014973,0.00018672559,0.0052601015,0.0009446045,0.9846311,0.008331015,0.000018737876],"about_ca_topic_score_codex":0.0025636617,"about_ca_topic_score_gemma":0.0038158805,"teacher_disagreement_score":0.038982306,"about_ca_system_score_codex":0.002175674,"about_ca_system_score_gemma":0.0009266824,"threshold_uncertainty_score":0.13040876},"labels":[],"label_agreement":null},{"id":"W29361179","doi":"10.3382/ps/pex441","title":"A Few More RPMDs with k = 4.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arithmetic","score_opus":0.004310950935722856,"score_gpt":0.18520250813181502,"score_spread":0.18089155719609215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W29361179","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42484948,0.0033465405,0.3944448,0.0010334031,0.0034612888,0.0012174188,0.014705617,0.018752856,0.13818865],"genre_scores_gemma":[0.6735576,0.00096430356,0.22225872,0.00066973,0.0002701243,0.0015373447,0.014698125,0.0041651,0.081879005],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940014,0.00010467171,0.00006490208,0.00022361141,0.00009572862,0.00011091125],"domain_scores_gemma":[0.9989317,0.00023314489,0.000079981306,0.00040380753,0.00021813635,0.00013316097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007703163,0.0010023558,0.0010150592,0.00082667894,0.0007994347,0.0011652191,0.001701482,0.0011058404,0.07179894],"category_scores_gemma":[0.0032768692,0.00042127137,0.0010509809,0.0009963139,0.00042736696,0.0015115385,0.0010415408,0.0014411377,0.026596405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005673252,0.0016832054,0.023121404,0.003547249,0.0005822258,0.0014245181,0.00090603856,0.051535282,0.14679983,0.08286987,0.093642466,0.58821464],"study_design_scores_gemma":[0.0010414367,0.001893513,0.0284235,0.00037986855,0.000434749,0.0022527254,0.00074585323,0.28541988,0.13154483,0.058194492,0.4891958,0.00047339135],"about_ca_topic_score_codex":0.0014073021,"about_ca_topic_score_gemma":0.0017904924,"teacher_disagreement_score":0.07179894,"about_ca_system_score_codex":0.00059483957,"about_ca_system_score_gemma":0.00060408295,"threshold_uncertainty_score":0.2401914},"labels":[],"label_agreement":null},{"id":"W2950432683","doi":"","title":"Convolution identities for Tribonacci numbers.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Convolution (computer science); Computer science; Artificial intelligence","score_opus":0.011797417539972457,"score_gpt":0.2872344292052236,"score_spread":0.27543701166525114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950432683","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046209056,0.0071178377,0.2302833,0.0030680955,0.0036546383,0.000057210615,0.0005897528,0.0004452184,0.70857495],"genre_scores_gemma":[0.73924,0.0044959625,0.07577306,0.0021209854,0.002316611,0.00018220616,0.0007704099,0.0004364725,0.17466429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928206,0.00012511363,0.00004293605,0.00011218119,0.00031823144,0.00011957032],"domain_scores_gemma":[0.9991373,0.0002595039,0.00008621638,0.00012217226,0.0002650571,0.0001297983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007468004,0.00065403804,0.00059080136,0.0019305465,0.002520261,0.0034309325,0.00072903075,0.0012065845,0.013640467],"category_scores_gemma":[0.0028182892,0.0002778346,0.0007152369,0.001679925,0.0021954556,0.0053932853,0.0017650678,0.0026084175,0.0045884307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038637722,0.000003090708,0.00003366003,0.000013028623,0.000001153401,0.000026368058,0.000056844518,0.000053876982,0.00018924335,0.99467814,0.002141976,0.002798822],"study_design_scores_gemma":[0.0000028165014,0.0000047930635,0.00011457937,0.000015656702,0.0000031337688,0.00016474917,0.000036159712,0.0012367063,0.0003446873,0.9809089,0.01715959,0.000008278315],"about_ca_topic_score_codex":0.0016037135,"about_ca_topic_score_gemma":0.001926884,"teacher_disagreement_score":0.013640467,"about_ca_system_score_codex":0.0017475679,"about_ca_system_score_gemma":0.00090716797,"threshold_uncertainty_score":0.045631886},"labels":[],"label_agreement":null},{"id":"W2953142165","doi":"","title":"On the skew-spectral distribution of randomly oriented graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Random Matrices and Applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Adjacency matrix; Sigma; Normalization (sociology); Skew; Random matrix; Graph; Random graph; Discrete mathematics; Eigenvalues and eigenvectors; Physics","score_opus":0.01620221759106559,"score_gpt":0.2746590354659375,"score_spread":0.2584568178748719,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953142165","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24260184,0.0019629556,0.7319262,0.0024936777,0.00030557826,0.00017639426,0.0008162878,0.00063144276,0.019085692],"genre_scores_gemma":[0.94815874,0.0024902169,0.038269233,0.00079297845,0.0006082149,0.00036773988,0.0008111685,0.00024524878,0.008256361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982179,0.0008685806,0.00005195673,0.00029982266,0.0003246023,0.0002370596],"domain_scores_gemma":[0.9814714,0.011405381,0.0024820615,0.0016066788,0.0017469598,0.0012875157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048011374,0.0011893462,0.0011258197,0.0030612536,0.0009955846,0.001593812,0.0022653802,0.0015213065,0.0055091227],"category_scores_gemma":[0.02776747,0.0006268241,0.0008203983,0.001435742,0.0058383136,0.0046650935,0.0017907737,0.0019978078,0.0013392275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008346794,0.000043608892,0.0010542925,0.00008841778,0.000019422474,0.00014251008,0.00019248837,0.021555701,0.0018309279,0.9666979,0.00263252,0.005658689],"study_design_scores_gemma":[0.000039469956,0.00007140675,0.001237991,0.00009402824,0.000019510258,0.0002499205,0.00015696733,0.35145712,0.0013400385,0.6433278,0.001935964,0.00006983435],"about_ca_topic_score_codex":0.0023322382,"about_ca_topic_score_gemma":0.0018364639,"teacher_disagreement_score":0.0055091227,"about_ca_system_score_codex":0.0018586399,"about_ca_system_score_gemma":0.00086391857,"threshold_uncertainty_score":0.025391161},"labels":[],"label_agreement":null},{"id":"W2955064194","doi":"","title":"Reconstruction Number For Ulam's Conjecture.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Conjecture; Combinatorics","score_opus":0.014927761469452752,"score_gpt":0.2647661887584002,"score_spread":0.24983842728894745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955064194","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21788827,0.005466672,0.14565104,0.044732045,0.0035104617,0.00011790542,0.00163635,0.0013793595,0.5796178],"genre_scores_gemma":[0.9383565,0.0015797607,0.02179856,0.0023100467,0.0013945281,0.000106080835,0.0012959022,0.0001674247,0.032991115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989023,0.0002789573,0.00003822832,0.00023885847,0.0003321751,0.00020943528],"domain_scores_gemma":[0.99503076,0.0031579635,0.00029884826,0.0006973378,0.00045069112,0.00036434593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016649322,0.0006374357,0.0010294822,0.0015458424,0.0020368495,0.0033926263,0.0016675927,0.002498556,0.027522301],"category_scores_gemma":[0.010011827,0.0004278137,0.00079897733,0.0014202468,0.0038529963,0.0080813635,0.0033482187,0.004832289,0.0032465267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000115232026,0.000022166174,0.00039599926,0.00008934281,0.000010228243,0.000068716836,0.000108303655,0.0006489481,0.00025831003,0.9800494,0.009645081,0.00858834],"study_design_scores_gemma":[0.000027965643,0.00001826944,0.0003060853,0.00002824932,0.000012986591,0.000108661065,0.0000816336,0.0031760295,0.0004001237,0.9869307,0.008898726,0.000010551964],"about_ca_topic_score_codex":0.0008046217,"about_ca_topic_score_gemma":0.00062918,"teacher_disagreement_score":0.027522301,"about_ca_system_score_codex":0.0016201477,"about_ca_system_score_gemma":0.00082669983,"threshold_uncertainty_score":0.092071235},"labels":[],"label_agreement":null},{"id":"W2962760670","doi":"","title":"Maximally connected and super arc-connected Bi-Cayley digraphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arc (geometry); Cayley graph; Combinatorics; Geometry; Graph","score_opus":0.021095974597185464,"score_gpt":0.25668725136268533,"score_spread":0.23559127676549987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962760670","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45750788,0.0022819906,0.19510286,0.0020269575,0.00043692288,0.00013336557,0.003161843,0.0007028197,0.33864543],"genre_scores_gemma":[0.9152285,0.000989166,0.04501416,0.0008006315,0.00013536417,0.00009854577,0.001975345,0.00009855075,0.035659764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996698,0.00009440801,0.000021829408,0.00008886431,0.00007094209,0.000054281678],"domain_scores_gemma":[0.9989103,0.00037737752,0.00016499331,0.00012362015,0.00019533106,0.00022836884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003085201,0.00038306753,0.00032613717,0.0014052611,0.0011585343,0.0015909858,0.000807716,0.0007322898,0.011831878],"category_scores_gemma":[0.0016871771,0.00038808366,0.0003702187,0.0014123309,0.0006757215,0.0023089217,0.0011674361,0.0011552188,0.0013168443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057805893,0.000026386435,0.0005804379,0.00011906786,0.000021508742,0.00026648183,0.00017040285,0.0013620065,0.002424579,0.9785686,0.00471033,0.011692445],"study_design_scores_gemma":[0.000023856843,0.000021618818,0.0010859683,0.000045148332,0.000039863404,0.00052549416,0.0002722933,0.013146065,0.0013109939,0.96641713,0.01709494,0.000016581636],"about_ca_topic_score_codex":0.0012912147,"about_ca_topic_score_gemma":0.0031419308,"teacher_disagreement_score":0.011831878,"about_ca_system_score_codex":0.0006849477,"about_ca_system_score_gemma":0.00042991462,"threshold_uncertainty_score":0.039581597},"labels":[],"label_agreement":null},{"id":"W2962768725","doi":"","title":"On the fractional metric dimension of corona product graphs and lexicographic product graphs","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Metric dimension; Mathematics; Combinatorics; Lexicographical order; Vertex (graph theory); Dimension (graph theory); Product (mathematics); Graph; Discrete mathematics; Chordal graph; 1-planar graph; Geometry","score_opus":0.017058077471779492,"score_gpt":0.23390648515683352,"score_spread":0.21684840768505403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962768725","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88029754,0.001083636,0.110105716,0.00042823722,0.000029686458,0.000026505659,0.00095201586,0.00032773084,0.0067488374],"genre_scores_gemma":[0.95436907,0.0004133308,0.043308802,0.00007115138,0.000051279414,0.000034905817,0.0007577323,0.00007112425,0.0009227052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994561,0.00012065551,0.000037835922,0.00016135439,0.000107164524,0.0001168723],"domain_scores_gemma":[0.99743927,0.001470837,0.00037701015,0.0003501973,0.00013882053,0.00022378861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057564996,0.0006159152,0.0008050991,0.0021714845,0.00096930494,0.00236888,0.0009015721,0.0008786417,0.0023639502],"category_scores_gemma":[0.0051760455,0.00040369527,0.00050906965,0.0030111708,0.0016583542,0.0052283625,0.0011565065,0.0008507724,0.00023524839],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009835009,0.00023025098,0.033075653,0.00040217265,0.00017565292,0.0002558819,0.0012762416,0.17532408,0.011032376,0.61432076,0.0070521575,0.15587135],"study_design_scores_gemma":[0.000041321146,0.000084928484,0.007462223,0.00004721161,0.000057504625,0.0005146241,0.00044686848,0.23960647,0.0061060106,0.739152,0.00640373,0.000077097495],"about_ca_topic_score_codex":0.0018762551,"about_ca_topic_score_gemma":0.0020704898,"teacher_disagreement_score":0.00236888,"about_ca_system_score_codex":0.0014466846,"about_ca_system_score_gemma":0.00045321335,"threshold_uncertainty_score":0.010496438},"labels":[],"label_agreement":null},{"id":"W2962895022","doi":"","title":"A Note On q-Bernoulli Numbers And q-Bernstein Polynomials.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Approximation Theory and Sequence Spaces","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bernstein polynomial; Bernoulli's principle; Bernoulli polynomials; Discrete mathematics; Combinatorics; Pure mathematics; Difference polynomials; Orthogonal polynomials; Physics","score_opus":0.02743574576995265,"score_gpt":0.29928085485727407,"score_spread":0.2718451090873214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962895022","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12969948,0.03748382,0.36319673,0.027675748,0.011259056,0.000069616544,0.00029028425,0.00024879386,0.43007642],"genre_scores_gemma":[0.8237874,0.025570517,0.08727851,0.0062350896,0.005486057,0.0000684664,0.00018818144,0.00014918609,0.05123669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999403,0.00019626338,0.000021351,0.00009833438,0.00018978376,0.00009125398],"domain_scores_gemma":[0.99856013,0.00081435364,0.00012851194,0.00013917427,0.00017576624,0.00018198478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015737923,0.00050447945,0.00044945616,0.0010091268,0.0013069105,0.0011464248,0.0007845628,0.00084941357,0.0058592637],"category_scores_gemma":[0.0037421251,0.00021209678,0.00055218645,0.0014311573,0.0033571783,0.004496358,0.0024597065,0.0034348883,0.00080452237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001761595,0.000010030472,0.00014326468,0.00005761694,0.0000042084944,0.00011106899,0.00013382829,0.00045120707,0.0006856405,0.98956925,0.0026918368,0.006124341],"study_design_scores_gemma":[0.0000072991197,0.000047706217,0.0004173085,0.0000360753,0.000008436354,0.00032557285,0.000107173684,0.0029089951,0.00062691927,0.9581626,0.037331015,0.000020946829],"about_ca_topic_score_codex":0.0014081086,"about_ca_topic_score_gemma":0.0010790552,"teacher_disagreement_score":0.0058592637,"about_ca_system_score_codex":0.00084076874,"about_ca_system_score_gemma":0.0006196733,"threshold_uncertainty_score":0.019601166},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Spanning tree; Bipartite graph; Disjoint sets; Graph; Integer (computer science); Discrete mathematics; Computer science","score_opus":0.015190567271106667,"score_gpt":0.23693426405566012,"score_spread":0.22174369678455347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962898528","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81370693,0.0024323468,0.14218338,0.0010942925,0.000083972234,0.00012356193,0.0023485408,0.0003012391,0.037725672],"genre_scores_gemma":[0.9734563,0.0014351258,0.020977927,0.00016347597,0.00020070987,0.00019951462,0.0014538876,0.000046914745,0.002066061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919957,0.00020825083,0.000041806477,0.00023363168,0.00017557145,0.00014119434],"domain_scores_gemma":[0.99746597,0.0011772695,0.0005456753,0.00027677408,0.00029254975,0.0002418124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048556988,0.0004818874,0.0005568314,0.0018095366,0.0008039672,0.0014690267,0.0007632239,0.00064247183,0.0024864054],"category_scores_gemma":[0.004034585,0.0003992024,0.00039860164,0.0019319262,0.0013325175,0.0027603616,0.0010760394,0.0006825995,0.00015168377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047267662,0.00007280072,0.011362148,0.0006777667,0.0001612852,0.00088579045,0.0015622008,0.07032985,0.015157789,0.8127879,0.009810626,0.07671926],"study_design_scores_gemma":[0.00008677022,0.000120618875,0.014706343,0.00015123947,0.00010481659,0.0018662167,0.000590253,0.20052259,0.0036325282,0.75173914,0.026416175,0.00006330911],"about_ca_topic_score_codex":0.001210563,"about_ca_topic_score_gemma":0.0012635124,"teacher_disagreement_score":0.0024864054,"about_ca_system_score_codex":0.00093089504,"about_ca_system_score_gemma":0.00036797152,"threshold_uncertainty_score":0.008317888},"labels":[],"label_agreement":null},{"id":"W2962922560","doi":"","title":"Notes on the sum of powers of the signless Laplacian eigenvalues of graphs","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Eigenvalues and eigenvectors; Graph; Sums of powers; Discrete mathematics; Connectivity; Physics","score_opus":0.02401801892270766,"score_gpt":0.2676450529362539,"score_spread":0.24362703401354624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962922560","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4621878,0.013239006,0.3417663,0.006985232,0.0027128914,0.00006161077,0.0007020953,0.00087278517,0.1714723],"genre_scores_gemma":[0.9681649,0.00233286,0.016853184,0.0006662299,0.0018843564,0.00006304939,0.00022291129,0.00023816361,0.009574362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988065,0.00031526803,0.000060484024,0.00030468742,0.0003813436,0.00013173497],"domain_scores_gemma":[0.9916358,0.0058736727,0.00057395844,0.00068587426,0.0005213869,0.0007093523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002019501,0.0013029831,0.0011402722,0.0036357136,0.00090933836,0.0023058096,0.0018702513,0.00085566455,0.0077562556],"category_scores_gemma":[0.012283145,0.00043933527,0.00086435495,0.001960728,0.0054004756,0.005462201,0.002219547,0.0032248348,0.0008676328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020916952,0.000043454933,0.0013862038,0.00025851539,0.000043865308,0.00050925405,0.00046656522,0.008329394,0.0067764274,0.9602948,0.0052009146,0.016481306],"study_design_scores_gemma":[0.000019588133,0.00007158253,0.0018997398,0.000058533544,0.000033385873,0.00042076,0.00009143625,0.030339006,0.0017289114,0.9619797,0.0033200006,0.00003740524],"about_ca_topic_score_codex":0.00039932178,"about_ca_topic_score_gemma":0.0004046224,"teacher_disagreement_score":0.0077562556,"about_ca_system_score_codex":0.0008316589,"about_ca_system_score_gemma":0.00024027629,"threshold_uncertainty_score":0.025947273},"labels":[],"label_agreement":null},{"id":"W2962975014","doi":"","title":"The bondage number of $(n-3)$-regular graphs of order $n$","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Dominating set; Domination analysis; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.018970910859867244,"score_gpt":0.2758323996745476,"score_spread":0.25686148881468035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962975014","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9603445,0.00031256693,0.022184227,0.00033115436,0.000035754474,0.00002418429,0.00032640292,0.00010106806,0.016340254],"genre_scores_gemma":[0.9875945,0.00022627396,0.009081029,0.000037253492,0.000022749375,0.000030061956,0.00019242083,0.000031604297,0.0027840426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972314,0.000057757312,0.000014959855,0.00007416129,0.0000727137,0.000057165864],"domain_scores_gemma":[0.99823135,0.00092752255,0.00034216378,0.00014246827,0.000110067114,0.00024649856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027466984,0.00022690487,0.00028344552,0.00083620107,0.00069092,0.0008550472,0.00040528277,0.00045176124,0.0027087876],"category_scores_gemma":[0.0022792285,0.00021544186,0.0002706463,0.0004514608,0.0010911308,0.0014727336,0.0004964574,0.0005090148,0.0002547996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001357342,0.00018632377,0.041927855,0.00042092847,0.00013149732,0.0012136193,0.0015180401,0.0683855,0.1069288,0.6933641,0.008701801,0.07586423],"study_design_scores_gemma":[0.0000864006,0.00035475564,0.027145058,0.0000655664,0.000076616874,0.0023912722,0.0006702812,0.17726508,0.03715739,0.73477685,0.019906461,0.000104238],"about_ca_topic_score_codex":0.0007080309,"about_ca_topic_score_gemma":0.0014150552,"teacher_disagreement_score":0.0027087876,"about_ca_system_score_codex":0.0006457767,"about_ca_system_score_gemma":0.00034272068,"threshold_uncertainty_score":0.009061813},"labels":[],"label_agreement":null},{"id":"W2962977310","doi":"","title":"Indecomposable tournaments and their indecomposable subtournaments on 5 and 7 vertices.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tournament; Indecomposable module; Combinatorics; Cardinality (data modeling); Mathematics; Vertex (graph theory); Discrete mathematics; Interval (graph theory); Graph; Computer science","score_opus":0.013287051937384477,"score_gpt":0.2556531109342326,"score_spread":0.24236605899684813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962977310","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77851766,0.0020207705,0.10084275,0.0005401695,0.00035290318,0.00023064885,0.0028699748,0.0003903984,0.11423469],"genre_scores_gemma":[0.9030707,0.0009545201,0.057813395,0.00020547351,0.00017236233,0.00029977414,0.0044530607,0.00008404868,0.03294682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920064,0.00010354608,0.000054350407,0.00026228745,0.00016490754,0.00021431422],"domain_scores_gemma":[0.99931335,0.00017535147,0.00021367977,0.000074527285,0.000075855714,0.00014717865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029889194,0.00048291392,0.00036739442,0.0008912341,0.0012118905,0.0016943249,0.00080830965,0.00053341564,0.007943407],"category_scores_gemma":[0.0011623312,0.00033509638,0.0008441254,0.0012181399,0.001183308,0.0011360504,0.0010885715,0.0015512996,0.00080035126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007604104,0.00023173852,0.003218428,0.00021742225,0.00007498049,0.0014602115,0.0015105832,0.01120141,0.010240129,0.8934369,0.006648798,0.07099905],"study_design_scores_gemma":[0.00020366092,0.00039091895,0.0067192595,0.00008878656,0.00006237854,0.0015040872,0.0005195942,0.026567942,0.005951907,0.8497807,0.108132705,0.000078000914],"about_ca_topic_score_codex":0.0023683785,"about_ca_topic_score_gemma":0.0024306134,"teacher_disagreement_score":0.007943407,"about_ca_system_score_codex":0.0011177075,"about_ca_system_score_gemma":0.00047515947,"threshold_uncertainty_score":0.02657342},"labels":[],"label_agreement":null},{"id":"W2962988885","doi":"","title":"Some Plethystic Identities And Kostka-Foulkes Polynomials.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Image (mathematics); Catalan number; Rational function; Macdonald polynomials; Field (mathematics); Degree (music); Operator (biology); Space (punctuation); Identity (music); Function (biology); Pure mathematics; Discrete mathematics; Orthogonal polynomials; Difference polynomials; Physics","score_opus":0.05133186597379016,"score_gpt":0.3089247305585206,"score_spread":0.25759286458473046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962988885","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.421685,0.00620088,0.21317577,0.008706524,0.0012377903,0.00008377853,0.0007554391,0.0003496371,0.34780514],"genre_scores_gemma":[0.9304273,0.0019456352,0.021437924,0.0007328349,0.0010331308,0.00005301242,0.00027449906,0.00007870367,0.044017002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964154,0.00007289246,0.000013995843,0.0000489839,0.00014543308,0.0000772024],"domain_scores_gemma":[0.99961615,0.00012758352,0.0000622619,0.00004039769,0.00007669205,0.00007686222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006853398,0.00048363578,0.00035974145,0.0014428914,0.0013956225,0.001546907,0.00067295413,0.00076594454,0.0048841536],"category_scores_gemma":[0.0019761785,0.0002366463,0.0006046451,0.001243008,0.0024656267,0.0036764892,0.0014317516,0.0020188468,0.0010049313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057279535,0.000006897789,0.000091740214,0.000009068217,0.0000010436355,0.000048394253,0.00009146408,0.00017927447,0.0002829438,0.99633336,0.0008289532,0.0021211528],"study_design_scores_gemma":[0.0000054424313,0.000006461069,0.00023018217,0.0000070476317,0.0000024671965,0.00014541794,0.000045077173,0.0018148985,0.00027573013,0.9939785,0.0034823872,0.0000063353455],"about_ca_topic_score_codex":0.001584427,"about_ca_topic_score_gemma":0.0016220695,"teacher_disagreement_score":0.0048841536,"about_ca_system_score_codex":0.0012167912,"about_ca_system_score_gemma":0.0007279859,"threshold_uncertainty_score":0.016339123},"labels":[],"label_agreement":null},{"id":"W2963002481","doi":"","title":"Lower bounds for algebraic connectivity of graphs in terms of matching number or edge covering number.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Algebraic connectivity; Matching (statistics); Algebraic number; Enhanced Data Rates for GSM Evolution; Upper and lower bounds; Discrete mathematics; Graph; Connectivity; Line graph; Computer science; Statistics","score_opus":0.023840666708191155,"score_gpt":0.30532034046449696,"score_spread":0.2814796737563058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963002481","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32913095,0.008840183,0.5515894,0.0040570656,0.00028509405,0.00018590025,0.001858143,0.00097613625,0.1030771],"genre_scores_gemma":[0.92720306,0.0029713036,0.0647371,0.00023734558,0.00048020654,0.00019649806,0.0012133721,0.00017223085,0.0027888734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978155,0.00044310122,0.00010493257,0.00054165337,0.00075133063,0.00034357357],"domain_scores_gemma":[0.9797071,0.015974369,0.0016910472,0.001152103,0.0008208056,0.00065461674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013806282,0.0015663294,0.0011162269,0.0035957254,0.0011125861,0.0024704624,0.001986697,0.0013137652,0.007536584],"category_scores_gemma":[0.01744317,0.00040511801,0.0007845071,0.0033728322,0.0023503967,0.00695977,0.0020463187,0.0024021708,0.0006805871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061762065,0.00029994716,0.01151825,0.0011134848,0.0001983129,0.00046109044,0.00067567,0.085452944,0.029267121,0.7776875,0.0076171076,0.08509092],"study_design_scores_gemma":[0.000059983453,0.0004804068,0.011670096,0.0003179425,0.00033409483,0.002325455,0.00048125882,0.23650597,0.026297724,0.6963581,0.025027137,0.00014189426],"about_ca_topic_score_codex":0.0005840556,"about_ca_topic_score_gemma":0.0010431375,"teacher_disagreement_score":0.007536584,"about_ca_system_score_codex":0.0015832304,"about_ca_system_score_gemma":0.0004970017,"threshold_uncertainty_score":0.025212407},"labels":[],"label_agreement":null},{"id":"W2963073113","doi":"","title":"New inequalities on the hyperbolicity constant of line graphs","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Geodesic; Combinatorics; Infimum and supremum; Graph; Hyperbolic geometry; Constant (computer programming); Real line; Metric space; Line (geometry); Upper and lower bounds; Discrete mathematics; Mathematical analysis; Geometry; Algebraic geometry","score_opus":0.047041989565067825,"score_gpt":0.28250308860033796,"score_spread":0.23546109903527013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963073113","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44998506,0.013262334,0.34401172,0.007647181,0.00051022205,0.00016527773,0.002831202,0.0008544416,0.18073252],"genre_scores_gemma":[0.92258525,0.0028767092,0.052185945,0.0013351826,0.0007268343,0.00022602417,0.001260636,0.00045637618,0.018347079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982229,0.00044446526,0.00010679157,0.00046306153,0.000433978,0.00032891516],"domain_scores_gemma":[0.9812541,0.012364005,0.0018917007,0.0012270045,0.0017288113,0.0015344057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023007067,0.0013318083,0.0007668604,0.0041065174,0.0010859888,0.0028033,0.0022467119,0.00135818,0.010421195],"category_scores_gemma":[0.01383195,0.0008499819,0.00086274964,0.0026972753,0.0033096173,0.007725089,0.0031114079,0.005011585,0.0011993141],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033043086,0.00008563268,0.005528878,0.00041534222,0.0000807028,0.0005143749,0.0011701771,0.013345364,0.012094325,0.93034124,0.007792199,0.02830139],"study_design_scores_gemma":[0.00006008188,0.000151795,0.005214857,0.00014313257,0.00009448998,0.0005733745,0.00060992246,0.06482567,0.0045832354,0.9032565,0.020401686,0.00008525743],"about_ca_topic_score_codex":0.0015627303,"about_ca_topic_score_gemma":0.0020750398,"teacher_disagreement_score":0.010421195,"about_ca_system_score_codex":0.0030891928,"about_ca_system_score_gemma":0.00043021844,"threshold_uncertainty_score":0.03486234},"labels":[],"label_agreement":null},{"id":"W2963088367","doi":"","title":"The Laplacian polynomial of graphs derived from regular graphs and applications","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Graph; 1-planar graph; Laplace operator; Symmetric graph; Discrete mathematics; Chordal graph; Line graph; Voltage graph; Mathematical analysis","score_opus":0.013213284517185332,"score_gpt":0.24862245707134292,"score_spread":0.23540917255415758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963088367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42250356,0.001891544,0.4948434,0.0010140374,0.00026677956,0.000080080215,0.0004052214,0.00054067426,0.078454755],"genre_scores_gemma":[0.960201,0.0008792332,0.032792065,0.00011827985,0.00017482713,0.00002850876,0.0001671982,0.00008360338,0.005555375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997676,0.00004506545,0.000009054305,0.000043533797,0.00009020387,0.000044556782],"domain_scores_gemma":[0.9993167,0.00028873634,0.000089001325,0.00008280296,0.00014124846,0.00008147865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027924366,0.00032079854,0.0002881863,0.0018401851,0.0004650725,0.0007586903,0.00058527995,0.00036935363,0.0032615224],"category_scores_gemma":[0.00278247,0.00015151073,0.00044647048,0.0014600696,0.0009752078,0.0014949357,0.0006962492,0.00091013627,0.00040300566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058609665,0.00005506887,0.0009679744,0.00021359586,0.000017152594,0.00024225382,0.000331517,0.0309138,0.011231537,0.9039478,0.0027738565,0.049246885],"study_design_scores_gemma":[0.000008849225,0.000033052114,0.0010967703,0.000018994431,0.000012500276,0.00036906797,0.00014993874,0.15964632,0.00292301,0.83143127,0.0042825765,0.000027600488],"about_ca_topic_score_codex":0.0010606222,"about_ca_topic_score_gemma":0.0013474007,"teacher_disagreement_score":0.0032615224,"about_ca_system_score_codex":0.00078248786,"about_ca_system_score_gemma":0.0004414814,"threshold_uncertainty_score":0.010910928},"labels":[],"label_agreement":null},{"id":"W2963101942","doi":"","title":"A note on Erdös-Faber-Lovász Conjecture and edge coloring of complete graphs","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Enhanced Data Rates for GSM Evolution; Edge coloring; Graph coloring; Computer science; Graph; Artificial intelligence; Line graph","score_opus":0.01477613073365393,"score_gpt":0.22714554719184227,"score_spread":0.21236941645818833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963101942","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22896557,0.019505527,0.36254182,0.08177177,0.006709745,0.00016982958,0.0024337417,0.0014370469,0.29646504],"genre_scores_gemma":[0.8626372,0.013047909,0.07291074,0.0076853307,0.0069776317,0.0001823552,0.0017606859,0.0003814218,0.034416683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974343,0.00080234447,0.000113879374,0.00080853485,0.0005027422,0.00033813887],"domain_scores_gemma":[0.9891284,0.007968622,0.00043875704,0.0012270722,0.00067800144,0.0005591504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038048301,0.0011080734,0.002160146,0.002841273,0.003731917,0.005856101,0.0029958426,0.003351637,0.008385682],"category_scores_gemma":[0.014318054,0.0010995965,0.0020837272,0.005308888,0.0057960902,0.014853682,0.0040032887,0.009144386,0.0010849527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116743475,0.000059798655,0.0008396885,0.00016063776,0.000024799057,0.000085070824,0.0003019015,0.0038513374,0.0006092149,0.9663684,0.015676552,0.011905967],"study_design_scores_gemma":[0.000019639881,0.000009579869,0.00027170207,0.000021525597,0.000014451684,0.000046429534,0.000098193974,0.0052704057,0.00023285276,0.98602575,0.007973455,0.000016027952],"about_ca_topic_score_codex":0.005917107,"about_ca_topic_score_gemma":0.0040453426,"teacher_disagreement_score":0.008385682,"about_ca_system_score_codex":0.0041874764,"about_ca_system_score_gemma":0.001394579,"threshold_uncertainty_score":0.030382454},"labels":[],"label_agreement":null},{"id":"W2963103783","doi":"","title":"Poncelet's Theorem in the four non-isomorphic finite projective planes of order 9.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Projective test; Order (exchange); Projective plane; Pure mathematics; Geometry; Business","score_opus":0.010041789105039441,"score_gpt":0.20594157992666806,"score_spread":0.19589979082162862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963103783","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2566459,0.0029592412,0.10166475,0.00666226,0.0014082029,0.000117734344,0.0007565986,0.0004191123,0.6293662],"genre_scores_gemma":[0.91712683,0.0011061161,0.019757537,0.0010354511,0.00035919787,0.000091660375,0.00047765515,0.00010094842,0.05994459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939966,0.00013859298,0.000025331121,0.00013050411,0.00015134814,0.00015457581],"domain_scores_gemma":[0.9993006,0.0003296907,0.00006558461,0.00011548854,0.00010475444,0.00008382913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068298366,0.0006073461,0.0006900221,0.0016856936,0.0024005612,0.002833358,0.00094725343,0.0012093161,0.016039725],"category_scores_gemma":[0.0018687235,0.00031592927,0.00085461425,0.0011578602,0.0034542144,0.0043659685,0.0020139252,0.0030253688,0.0015268632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022772334,0.000010012715,0.00012233669,0.000025039059,0.0000068178438,0.00009387441,0.00011606223,0.00029405765,0.00018889565,0.9935703,0.001892431,0.0036572397],"study_design_scores_gemma":[0.000019006526,0.000009227781,0.00029345564,0.000012992475,0.000008516676,0.0001634843,0.00010090763,0.0007955391,0.00040805512,0.98822,0.009960189,0.000008739463],"about_ca_topic_score_codex":0.0027972015,"about_ca_topic_score_gemma":0.0023396784,"teacher_disagreement_score":0.016039725,"about_ca_system_score_codex":0.0014484423,"about_ca_system_score_gemma":0.0007544632,"threshold_uncertainty_score":0.053658247},"labels":[],"label_agreement":null},{"id":"W2963129494","doi":"","title":"The number of spanning trees of power graphs associated with specific groups and some applications.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Spanning tree; Graph; Isomorphism (crystallography); Discrete mathematics","score_opus":0.01965033774156178,"score_gpt":0.2796773922405817,"score_spread":0.2600270544990199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963129494","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8619008,0.001461415,0.09542036,0.00094144896,0.00010016642,0.00005527443,0.0005936512,0.00018053889,0.039346352],"genre_scores_gemma":[0.9690954,0.000779776,0.02456177,0.00007208988,0.000113098664,0.000054918455,0.00042444575,0.000041844633,0.0048566926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968016,0.00008067239,0.000019158906,0.000100901285,0.000059093327,0.00005998763],"domain_scores_gemma":[0.9983713,0.00088133465,0.0002993527,0.0001419716,0.00011672197,0.00018937625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003938342,0.00026685925,0.00026713774,0.0013958446,0.00083640986,0.0010242225,0.00066284585,0.0006205385,0.003481321],"category_scores_gemma":[0.0024328353,0.00019386016,0.00038994462,0.0013035112,0.0013013169,0.002440534,0.0007821315,0.0006074619,0.00030722216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011306265,0.00006010521,0.0049093277,0.0001605973,0.000028515266,0.00028014567,0.0008443482,0.008667846,0.007278251,0.93914956,0.003235278,0.035273027],"study_design_scores_gemma":[0.00001767273,0.00007713303,0.004683766,0.000037200127,0.000050633535,0.0013287461,0.0005196197,0.041696735,0.0048675877,0.9344981,0.012197308,0.000025529289],"about_ca_topic_score_codex":0.0005631665,"about_ca_topic_score_gemma":0.0007400777,"teacher_disagreement_score":0.003481321,"about_ca_system_score_codex":0.00065074145,"about_ca_system_score_gemma":0.00026405652,"threshold_uncertainty_score":0.011646211},"labels":[],"label_agreement":null},{"id":"W2963163826","doi":"","title":"The minimal size of a graph with given generalized 3-edge-connectivity","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Lambda; Combinatorics; Graph; Disjoint sets; Upper and lower bounds; Order (exchange); Integer (computer science); Discrete mathematics; Mathematical analysis; Physics","score_opus":0.017004155107788806,"score_gpt":0.23080822894137812,"score_spread":0.21380407383358932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963163826","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9472296,0.00038283557,0.029499512,0.0013333277,0.000033817756,0.00005531752,0.0038198205,0.00027864685,0.017367095],"genre_scores_gemma":[0.96260196,0.00038665943,0.029675132,0.00021080146,0.000056989913,0.0001273461,0.0030267548,0.00012167568,0.003792612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963534,0.00007112432,0.000019832049,0.00013161277,0.000059593785,0.000082526036],"domain_scores_gemma":[0.9977847,0.0011897351,0.00028447201,0.00020105694,0.00015624812,0.00038371855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027288447,0.00046016768,0.00048220117,0.0006776107,0.00073774764,0.001404435,0.0010998715,0.00069803244,0.00498322],"category_scores_gemma":[0.0023527415,0.00031583564,0.00043869411,0.0006743268,0.000764794,0.0018465065,0.0008542023,0.0005564929,0.00042894608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027843781,0.00029001132,0.03850545,0.0027542182,0.00037523705,0.0020691603,0.0026294144,0.14150336,0.2124932,0.48474085,0.034978107,0.07687659],"study_design_scores_gemma":[0.00027983257,0.00049793534,0.036414888,0.0002407185,0.00034698524,0.0041441815,0.0018810764,0.29957047,0.053812724,0.5688361,0.033831947,0.00014319681],"about_ca_topic_score_codex":0.0011658586,"about_ca_topic_score_gemma":0.0026712385,"teacher_disagreement_score":0.00498322,"about_ca_system_score_codex":0.00094276643,"about_ca_system_score_gemma":0.0007122138,"threshold_uncertainty_score":0.016670525},"labels":[],"label_agreement":null},{"id":"W2963502383","doi":"","title":"A computer search of maximal partial spreads in PG(3, q).","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Value (mathematics); Statistics","score_opus":0.05240371949745303,"score_gpt":0.323880214815369,"score_spread":0.27147649531791596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963502383","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79084975,0.0014207076,0.13206075,0.0019355944,0.000059431688,0.000102790946,0.0025442739,0.001296341,0.06973046],"genre_scores_gemma":[0.90084225,0.00035348086,0.088190354,0.00018968056,0.000038800754,0.00009600495,0.002366331,0.0001956121,0.007727593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998324,0.00004225626,0.000008244746,0.00005706714,0.00003445098,0.000025643627],"domain_scores_gemma":[0.9988925,0.0008318761,0.0000689403,0.00009496646,0.000052035888,0.00005971807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035998708,0.00033239633,0.00039029418,0.00080669066,0.0006677824,0.0008453014,0.00053029694,0.00045808248,0.011505692],"category_scores_gemma":[0.0033298477,0.00020888489,0.00035523417,0.0007557044,0.00043569537,0.0015332738,0.0006477056,0.0005681823,0.0013479275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019181,0.00032851062,0.01605599,0.0013421006,0.0002092231,0.0007220859,0.0017749213,0.108934745,0.038578544,0.44098008,0.05000534,0.33915043],"study_design_scores_gemma":[0.0003472186,0.00044813685,0.003957956,0.00013933485,0.00012299718,0.0007459904,0.0010581852,0.33349228,0.021360228,0.5955532,0.042712286,0.00006218208],"about_ca_topic_score_codex":0.000912246,"about_ca_topic_score_gemma":0.0019252104,"teacher_disagreement_score":0.011505692,"about_ca_system_score_codex":0.00045389342,"about_ca_system_score_gemma":0.0006238525,"threshold_uncertainty_score":0.038490355},"labels":[],"label_agreement":null},{"id":"W2963579132","doi":"","title":"Cycles are determined by their domination polynomials.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Graph; Dominating set; Simple graph; Polynomial; Order (exchange); Discrete mathematics; Mathematical analysis","score_opus":0.011349914316980255,"score_gpt":0.257201414940366,"score_spread":0.24585150062338576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963579132","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7966225,0.0012528906,0.15558402,0.00051613373,0.00010103033,0.00014935843,0.0013749109,0.00030423142,0.044094834],"genre_scores_gemma":[0.97557527,0.0006092782,0.012876763,0.00007573045,0.00010365589,0.0000660553,0.0004414019,0.00007147173,0.010180395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938536,0.000064349406,0.000021943197,0.00018725843,0.00014631734,0.00019482475],"domain_scores_gemma":[0.99789774,0.00092483964,0.00042668683,0.00017734767,0.00029908802,0.00027424953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028861855,0.000351779,0.00034415838,0.0014934608,0.0012056482,0.0017010059,0.000523744,0.00038157156,0.0036337522],"category_scores_gemma":[0.003730882,0.0003476635,0.0005084969,0.0017324736,0.0015166417,0.002002954,0.0010971678,0.0006955767,0.00042729505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044264845,0.00008318284,0.008057454,0.00024861982,0.000054888027,0.0004623391,0.00143678,0.013303189,0.020054895,0.8697608,0.0044420823,0.08165312],"study_design_scores_gemma":[0.000066867884,0.00010336285,0.0075640664,0.00006294363,0.00006063214,0.0012728376,0.00040919863,0.04390114,0.010341161,0.9087427,0.027399274,0.00007576127],"about_ca_topic_score_codex":0.0036057555,"about_ca_topic_score_gemma":0.0042608273,"teacher_disagreement_score":0.0036337522,"about_ca_system_score_codex":0.0014766447,"about_ca_system_score_gemma":0.0008143058,"threshold_uncertainty_score":0.012156069},"labels":[],"label_agreement":null},{"id":"W2963704621","doi":"","title":"Equivalence between Extendability and Factor-Criticality.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Criticality; Mathematics; Equivalence (formal languages); Pure mathematics; Factor (programming language); Nuclear physics; Physics; Computer science; Programming language","score_opus":0.0344585319924574,"score_gpt":0.33757427598177286,"score_spread":0.30311574398931546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963704621","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20341156,0.0028751546,0.21874991,0.0039334698,0.0006510642,0.00012888177,0.00095445407,0.00082971394,0.5684658],"genre_scores_gemma":[0.95600367,0.0011678895,0.013488402,0.0006814136,0.0005294041,0.00007707152,0.00066700764,0.00022217043,0.027162967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870217,0.00023300642,0.000085297084,0.00046522685,0.0002763159,0.00023795989],"domain_scores_gemma":[0.9938672,0.003249456,0.00043099257,0.0009501846,0.0009252915,0.0005768439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010827678,0.0004853836,0.00066192925,0.0021485363,0.0015891531,0.0029679085,0.0007859939,0.00095320964,0.016271828],"category_scores_gemma":[0.008263114,0.00040950597,0.00085204566,0.0013248906,0.0051863827,0.010620456,0.0031879127,0.003133474,0.0015555122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031124044,0.000015017369,0.0004631555,0.00004016875,0.000008104887,0.00008830408,0.0003117631,0.00021837697,0.0005330513,0.9901905,0.0015244755,0.006575985],"study_design_scores_gemma":[0.000012807572,0.000010480996,0.00040244163,0.000023775812,0.000011216641,0.00023636899,0.00017349802,0.00054959557,0.00062018185,0.98919207,0.008759493,0.000008059235],"about_ca_topic_score_codex":0.0014415166,"about_ca_topic_score_gemma":0.0011452651,"teacher_disagreement_score":0.016271828,"about_ca_system_score_codex":0.001220822,"about_ca_system_score_gemma":0.0005212782,"threshold_uncertainty_score":0.054434717},"labels":[],"label_agreement":null},{"id":"W2963762533","doi":"","title":"A linear algebraic approach to orthogonal arrays and Latin squares","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Orthogonal array; Rank (graph theory); Algebraic number; Matrix (chemical analysis); Latin square; Orthogonal basis; Basis (linear algebra); Orthogonal matrix; Algebra over a field; Combinatorics; Pure mathematics; Mathematical analysis; Geometry; Statistics","score_opus":0.011382821637307295,"score_gpt":0.20291604016779738,"score_spread":0.19153321853049007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963762533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066408874,0.0032370812,0.9386748,0.0010783636,0.00041253658,0.00003959299,0.00009442331,0.00010802162,0.049714312],"genre_scores_gemma":[0.30742407,0.007590053,0.6152117,0.0022676552,0.0029962254,0.00029780134,0.0003233041,0.0002519766,0.06363728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987639,0.0005432652,0.00006084047,0.00020378821,0.00032441274,0.000103714054],"domain_scores_gemma":[0.99895465,0.0004906545,0.00011307251,0.00014582879,0.000246364,0.00004933209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007741226,0.0007573446,0.0005675423,0.0017948938,0.0010002995,0.002047891,0.0009973134,0.0007887453,0.0075676665],"category_scores_gemma":[0.002718277,0.0003610861,0.0008138709,0.0020839989,0.0028966668,0.00312373,0.001977581,0.0029750369,0.002232507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066318908,0.000015745685,0.000051128485,0.000038676964,0.000005821117,0.000035033456,0.00008613927,0.0028731662,0.00073585537,0.9815506,0.0011902114,0.013411073],"study_design_scores_gemma":[0.0000073575693,0.00004483488,0.00008011899,0.000025085987,0.000005300086,0.00016296815,0.00006305606,0.018949555,0.0010693748,0.95029044,0.029281989,0.000019813977],"about_ca_topic_score_codex":0.00072244316,"about_ca_topic_score_gemma":0.0008159077,"teacher_disagreement_score":0.0075676665,"about_ca_system_score_codex":0.000871494,"about_ca_system_score_gemma":0.00055853266,"threshold_uncertainty_score":0.025316417},"labels":[],"label_agreement":null},{"id":"W2963843099","doi":"","title":"Some Identities Of Symmetric For q-Bernoulli Polynomials Under Symmetric Group Of Degree n.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Symmetric group; Combinatorics; Group (periodic table); Bernoulli's principle; Pure mathematics; Physics","score_opus":0.06358258956569258,"score_gpt":0.3147013484733588,"score_spread":0.2511187589076662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963843099","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32207224,0.005989291,0.17853495,0.006321079,0.0030574393,0.00017702815,0.0010327521,0.0002962589,0.48251897],"genre_scores_gemma":[0.91130906,0.0021205316,0.02473024,0.0011229133,0.0016574515,0.00012189126,0.0004514183,0.0001205698,0.058365893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992717,0.00021189083,0.000037032016,0.00009803523,0.0002487342,0.00013265443],"domain_scores_gemma":[0.99918896,0.00021120795,0.00013536324,0.0000867353,0.0001923274,0.00018540838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011812769,0.0005139435,0.00048280787,0.001598133,0.0019362082,0.0018231632,0.0007957352,0.0008738109,0.00997284],"category_scores_gemma":[0.0026094276,0.0003184601,0.0008003966,0.0010407909,0.0020631962,0.0033848463,0.0018148766,0.0021300947,0.0021388258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015578626,0.000018086537,0.00017658778,0.000024528514,0.000003102042,0.0000956433,0.0001534972,0.00019363216,0.00055322645,0.99218845,0.0023658234,0.0042118244],"study_design_scores_gemma":[0.000010433655,0.000017535167,0.00037406926,0.000014872282,0.0000056713434,0.00025687777,0.00007283827,0.0018373296,0.00035472648,0.99017745,0.0068663363,0.00001189938],"about_ca_topic_score_codex":0.0008480448,"about_ca_topic_score_gemma":0.0009667497,"teacher_disagreement_score":0.00997284,"about_ca_system_score_codex":0.0012865363,"about_ca_system_score_gemma":0.0009005196,"threshold_uncertainty_score":0.03336245},"labels":[],"label_agreement":null},{"id":"W2963906609","doi":"","title":"On the hypercompetition numbers of hypergraphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hypergraph; Digraph; Combinatorics; Mathematics; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.02624788001298216,"score_gpt":0.25014753469931567,"score_spread":0.2238996546863335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963906609","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3410377,0.010001283,0.44248405,0.0037958564,0.00058526563,0.00030812435,0.0022366159,0.0006403217,0.19891085],"genre_scores_gemma":[0.8486037,0.0049786693,0.12893167,0.00074363453,0.0008184787,0.0006729849,0.0014040088,0.00025042737,0.013596388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99710494,0.0007485043,0.00014372966,0.00063231104,0.00085164566,0.00051884865],"domain_scores_gemma":[0.9746962,0.020255258,0.0013355558,0.0013256541,0.0011232487,0.0012640713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025928568,0.0015276356,0.0010205854,0.005315633,0.0017755141,0.0032215791,0.0019392004,0.001806289,0.009510934],"category_scores_gemma":[0.018760808,0.00094243995,0.0008562266,0.004471722,0.0050914325,0.008065592,0.002101401,0.004056599,0.0012035415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025186327,0.000077543584,0.002017303,0.00034093388,0.000048964044,0.00021246224,0.00035390203,0.02414247,0.003901852,0.9286677,0.005658718,0.034326423],"study_design_scores_gemma":[0.000052409214,0.000104192884,0.0018783906,0.00014790997,0.000046344398,0.00064424705,0.00013858147,0.06390828,0.0040051355,0.91793877,0.011066874,0.00006886282],"about_ca_topic_score_codex":0.0014139843,"about_ca_topic_score_gemma":0.001409657,"teacher_disagreement_score":0.009510934,"about_ca_system_score_codex":0.0031251365,"about_ca_system_score_gemma":0.0011888376,"threshold_uncertainty_score":0.031817257},"labels":[],"label_agreement":null},{"id":"W2963938510","doi":"","title":"Nonmedian Direct Products of Graphs with Loops.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.021286525295279517,"score_gpt":0.26126204148081067,"score_spread":0.23997551618553115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963938510","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56288445,0.002102153,0.22097315,0.00090700533,0.00034934605,0.000070155715,0.0011307845,0.0007526577,0.21083027],"genre_scores_gemma":[0.8901134,0.0007178203,0.042382717,0.00025763502,0.00023419199,0.000059358594,0.00086010055,0.00022735888,0.0651474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995571,0.000082899605,0.000028641827,0.00013531564,0.00012812721,0.00006794546],"domain_scores_gemma":[0.99820423,0.00070776546,0.00037012727,0.0002453642,0.00024478577,0.00022782927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003579449,0.00040982582,0.00039702153,0.0009273412,0.001024771,0.0021137302,0.0007872206,0.0004889572,0.0131093105],"category_scores_gemma":[0.0020215174,0.00041660925,0.00041160022,0.00082177337,0.0009288365,0.0040660766,0.0016186453,0.0010173116,0.0028088267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011545178,0.00004704071,0.001274644,0.00010814189,0.000025074049,0.00038384742,0.00038621176,0.000880884,0.0035861095,0.9696035,0.003063775,0.020525262],"study_design_scores_gemma":[0.000014185949,0.00003595223,0.0007325574,0.000027530645,0.000021859374,0.000646491,0.00019566595,0.002650043,0.0026894528,0.9745507,0.01842343,0.000012114484],"about_ca_topic_score_codex":0.00032242236,"about_ca_topic_score_gemma":0.00090571877,"teacher_disagreement_score":0.0131093105,"about_ca_system_score_codex":0.00053844036,"about_ca_system_score_gemma":0.0003520788,"threshold_uncertainty_score":0.04385495},"labels":[],"label_agreement":null},{"id":"W2963995511","doi":"","title":"A note on 2-subset-regular self-complementary 3-uniform hypergraphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics; Arithmetic","score_opus":0.005274001393304178,"score_gpt":0.18998650655606586,"score_spread":0.1847125051627617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963995511","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2792163,0.003973328,0.3020059,0.00461075,0.0025317045,0.00019224964,0.00068289007,0.0007255066,0.40606135],"genre_scores_gemma":[0.8862755,0.0033071642,0.08773547,0.0015831497,0.0008485084,0.00011810182,0.00041923355,0.00011017962,0.019602757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997749,0.000067705194,0.000011189275,0.0000529772,0.000053455424,0.000039791124],"domain_scores_gemma":[0.99961215,0.00018801104,0.00003521714,0.000059277656,0.00004757845,0.00005772034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030359565,0.00026765297,0.00023771414,0.00051839586,0.0008421824,0.0006881216,0.0004312885,0.00041298883,0.005924938],"category_scores_gemma":[0.0010247866,0.00017124761,0.00031364395,0.0006795326,0.0008309049,0.0012660355,0.001057821,0.0010330091,0.00072958606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011395903,0.000048279253,0.001160818,0.00024848085,0.000020964402,0.001307274,0.00051191583,0.003058247,0.01413059,0.92839104,0.012699527,0.038308892],"study_design_scores_gemma":[0.000026868049,0.00014795394,0.002460861,0.000083298975,0.000050384133,0.0026572016,0.00045745503,0.016279845,0.0115247695,0.85906637,0.107198164,0.0000467841],"about_ca_topic_score_codex":0.00063652144,"about_ca_topic_score_gemma":0.0011480876,"teacher_disagreement_score":0.005924938,"about_ca_system_score_codex":0.00039398402,"about_ca_system_score_gemma":0.00022954718,"threshold_uncertainty_score":0.019820929},"labels":[],"label_agreement":null},{"id":"W2964046804","doi":"","title":"On the reciprocal degree distance of graphs with cut vertices or cut edges.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Reciprocal; Degree (music); Combinatorics; Physics","score_opus":0.0821127410272369,"score_gpt":0.29683252418585687,"score_spread":0.21471978315861998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964046804","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61183125,0.007382788,0.2413871,0.0050113415,0.0008928865,0.000088333785,0.0015783078,0.00047233285,0.13135564],"genre_scores_gemma":[0.94398314,0.0026755736,0.040414073,0.000604449,0.0007758345,0.0001202107,0.00094139867,0.00028566638,0.010199694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981172,0.0007173593,0.000094246374,0.00039435542,0.0004378074,0.0002389946],"domain_scores_gemma":[0.98643607,0.009219038,0.0015541749,0.0010016972,0.000824369,0.00096464297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018538382,0.00085658237,0.0011699799,0.0036919303,0.0013813877,0.002571547,0.0025808758,0.0017961268,0.0066817338],"category_scores_gemma":[0.020180598,0.00043155602,0.00054440444,0.0026695316,0.0025361038,0.0065654377,0.0026158132,0.0024644155,0.0016419175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036362736,0.00012233401,0.0038495776,0.00033490697,0.0000863755,0.00017797439,0.00054792874,0.014667607,0.0027850145,0.92589134,0.011134742,0.040038686],"study_design_scores_gemma":[0.000048011105,0.000089701505,0.0023347498,0.00009878276,0.00007562101,0.00066341594,0.00049756246,0.044103418,0.001793682,0.9420545,0.008188891,0.00005175632],"about_ca_topic_score_codex":0.0008210232,"about_ca_topic_score_gemma":0.0008564445,"teacher_disagreement_score":0.0066817338,"about_ca_system_score_codex":0.001423504,"about_ca_system_score_gemma":0.0003961535,"threshold_uncertainty_score":0.022352636},"labels":[],"label_agreement":null},{"id":"W2964060150","doi":"","title":"How to Play Dundee","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Catalan number; Sequence (biology); nobody; Combinatorics; Value (mathematics); Mathematics; Mathematical economics; Bernoulli's principle; Discrete mathematics; Computer science; Statistics; Computer security; Physics","score_opus":0.016945077576415776,"score_gpt":0.25918928028676647,"score_spread":0.2422442027103507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964060150","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07452982,0.0028955701,0.5904801,0.013928559,0.0017940971,0.00050212484,0.0011754407,0.0029275378,0.3117668],"genre_scores_gemma":[0.5151887,0.0013110905,0.33447307,0.002016092,0.00016462749,0.00069941167,0.0012372831,0.00068949355,0.14422028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990194,0.00033904886,0.00004870753,0.00024233108,0.0001607354,0.00018974276],"domain_scores_gemma":[0.99918467,0.0004330289,0.000048261587,0.00011164965,0.000096968295,0.00012547601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008041046,0.001114787,0.00087035244,0.00045504927,0.0014376896,0.003613516,0.0016075416,0.0016585373,0.034413647],"category_scores_gemma":[0.0039455397,0.0005397347,0.0007113375,0.00038844714,0.0017305196,0.004960251,0.002579931,0.0018281197,0.0047525987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004131379,0.00013315989,0.0010981271,0.000275864,0.00006885723,0.0005865837,0.0012433334,0.024144059,0.001812564,0.8690437,0.030932983,0.070247695],"study_design_scores_gemma":[0.00015711652,0.00013213539,0.00029489113,0.00015438958,0.000031225005,0.00038351174,0.00068361417,0.0842895,0.001807045,0.62656105,0.28542718,0.000078298835],"about_ca_topic_score_codex":0.0041069947,"about_ca_topic_score_gemma":0.0055400957,"teacher_disagreement_score":0.034413647,"about_ca_system_score_codex":0.0013038582,"about_ca_system_score_gemma":0.0006288595,"threshold_uncertainty_score":0.11512506},"labels":[],"label_agreement":null},{"id":"W2964120173","doi":"","title":"Some remarks about the derivation operator and generalized Stirling numbers.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Stirling numbers of the first kind; Stirling number; Bijection; Vertex (graph theory); Stirling numbers of the second kind; Tuple; Operator (biology); Combinatorics; Tree (set theory); Set (abstract data type); Bell polynomials; Discrete mathematics; Graph","score_opus":0.04740610890017493,"score_gpt":0.29310177757781625,"score_spread":0.2456956686776413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964120173","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063322045,0.054639798,0.3192103,0.079944454,0.01898709,0.00014677725,0.0010622212,0.00078586646,0.46190146],"genre_scores_gemma":[0.59963435,0.03731279,0.15057652,0.033023056,0.031448822,0.00050076284,0.0009358149,0.00086300075,0.1457048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886656,0.00034603899,0.000070389295,0.00016531402,0.00044363525,0.000108115324],"domain_scores_gemma":[0.99780303,0.0013287731,0.00020969177,0.00019415637,0.0003230804,0.00014120585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027224284,0.0011487106,0.00073977455,0.0021619084,0.0018172417,0.0025600805,0.0018678755,0.0014970148,0.015636565],"category_scores_gemma":[0.0061387233,0.00033186658,0.0012393455,0.0020713462,0.005165219,0.00728067,0.0019637893,0.0040994403,0.0023722155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021981328,0.000013854912,0.00020131122,0.00011600742,0.000008579091,0.00026394922,0.0003611348,0.00041868968,0.00062446366,0.98384315,0.0072315293,0.0068953577],"study_design_scores_gemma":[0.000006406708,0.00002803536,0.0003962044,0.000047477697,0.0000063106972,0.00031169984,0.00014758226,0.00091981195,0.00030279605,0.96210647,0.03570833,0.000018973999],"about_ca_topic_score_codex":0.0013142339,"about_ca_topic_score_gemma":0.0011810721,"teacher_disagreement_score":0.015636565,"about_ca_system_score_codex":0.0010796181,"about_ca_system_score_gemma":0.00047445748,"threshold_uncertainty_score":0.052309513},"labels":[],"label_agreement":null},{"id":"W2964173614","doi":"","title":"The partition dimension of corona product graphs","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Partition (number theory); Metric dimension; Connectivity; Graph; Discrete mathematics; Chordal graph; 1-planar graph","score_opus":0.011331266588769288,"score_gpt":0.21947306362596508,"score_spread":0.2081417970371958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964173614","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9097836,0.00080635137,0.06728418,0.00047448,0.000094102754,0.000045709974,0.0012308365,0.00030961423,0.01997102],"genre_scores_gemma":[0.98337597,0.0003719569,0.011188844,0.00012451892,0.000116847055,0.00006912542,0.0012335844,0.000096250325,0.0034228489],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902093,0.00017661693,0.000053600197,0.000281452,0.0002522479,0.0002151215],"domain_scores_gemma":[0.9975504,0.00077164255,0.0004946034,0.0003181238,0.0003136817,0.0005515388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064852525,0.0005688765,0.0008357418,0.0029646803,0.001171303,0.0029881885,0.0010054949,0.00088912516,0.00395214],"category_scores_gemma":[0.0035940807,0.00047256335,0.0007003062,0.002118149,0.001861839,0.0036076885,0.0017842072,0.001085161,0.0004371908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003400994,0.00007103123,0.0051966324,0.00015107487,0.00009137986,0.00021915893,0.0010468338,0.013494853,0.0055489056,0.94432306,0.0045817452,0.024935227],"study_design_scores_gemma":[0.00005255163,0.00013706135,0.0072470265,0.000055375942,0.00006879538,0.0008248981,0.00044254703,0.076165006,0.0030398169,0.90005845,0.0118170595,0.00009151463],"about_ca_topic_score_codex":0.0013399567,"about_ca_topic_score_gemma":0.00095642096,"teacher_disagreement_score":0.00395214,"about_ca_system_score_codex":0.0016107728,"about_ca_system_score_gemma":0.0004313716,"threshold_uncertainty_score":0.013221264},"labels":[],"label_agreement":null},{"id":"W2964237471","doi":"","title":"Extremal Triangular Chain Graphs for Bond Incident Degree (BID) Indices","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Thermal and Kinetic Analysis","field":"Materials Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chain (unit); Combinatorics; Degree (music); Discrete mathematics; Physics","score_opus":0.022029540680303935,"score_gpt":0.2438676726541534,"score_spread":0.22183813197384947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964237471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29622877,0.00063785806,0.58809257,0.00029896546,0.00019019918,0.000107366766,0.00077111524,0.0006019442,0.11307117],"genre_scores_gemma":[0.92658955,0.0005160693,0.063245,0.000114753784,0.00007888724,0.00014373733,0.00046700076,0.0002692136,0.0085757645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999775,0.000046266276,0.000012795396,0.00005063144,0.00007146704,0.00004387766],"domain_scores_gemma":[0.99905556,0.0003590489,0.00017315384,0.00016276834,0.00015206647,0.00009738529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005024294,0.00053576083,0.0004119021,0.0028801647,0.0008736811,0.0015768501,0.0010455726,0.0006354268,0.008549377],"category_scores_gemma":[0.0023626192,0.00029124564,0.00041113398,0.0014059941,0.0012263388,0.0019550277,0.0006708966,0.0009785723,0.0008330652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025600744,0.000019416599,0.0006401298,0.000053041775,0.0000072086636,0.00012793466,0.000080763275,0.011534557,0.004092105,0.9730715,0.001255615,0.009092124],"study_design_scores_gemma":[0.0000049801456,0.000013779215,0.00066227745,0.000033726945,0.000010270062,0.00021896421,0.00011461044,0.122240506,0.0029610125,0.8710744,0.0026360366,0.00002940233],"about_ca_topic_score_codex":0.0004716669,"about_ca_topic_score_gemma":0.0013683824,"teacher_disagreement_score":0.008549377,"about_ca_system_score_codex":0.00077013834,"about_ca_system_score_gemma":0.00031950715,"threshold_uncertainty_score":0.028600454},"labels":[],"label_agreement":null},{"id":"W2964239655","doi":"","title":"Constructing regular graphs with smallest defining number.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Cardinality (data modeling); Graph; Chromatic scale; Brooks' theorem; Discrete mathematics; Chordal graph; 1-planar graph; Computer science","score_opus":0.011710156329296069,"score_gpt":0.2598272596101379,"score_spread":0.24811710328084186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964239655","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27439713,0.0003829576,0.69082266,0.00045516045,0.00011607194,0.0002509771,0.00056505675,0.0015676946,0.03144237],"genre_scores_gemma":[0.43792456,0.00031881317,0.5518971,0.00016145468,0.00003021223,0.00017341062,0.0013232352,0.00046258757,0.0077085504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999255,0.00022147798,0.00003460602,0.00023683677,0.00012258139,0.0001293719],"domain_scores_gemma":[0.997692,0.0008560711,0.00024154196,0.00080047076,0.00022713716,0.000182784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007352715,0.0005939326,0.00053999765,0.0009139529,0.0011251025,0.0009142673,0.0009639863,0.0004765315,0.0029103542],"category_scores_gemma":[0.0034185688,0.00063096103,0.00094550557,0.000708256,0.0011793093,0.0018232655,0.0019098024,0.0010538448,0.0008038411],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047014534,0.00032240184,0.0077017983,0.0006311073,0.00007964488,0.0006283639,0.0015999582,0.036678452,0.065058775,0.68013406,0.010883326,0.19581202],"study_design_scores_gemma":[0.00014298798,0.00025134694,0.0035576168,0.00015321262,0.00014549535,0.0021201402,0.0009075925,0.1689105,0.07929094,0.6732526,0.0711288,0.00013875257],"about_ca_topic_score_codex":0.0009435041,"about_ca_topic_score_gemma":0.002095141,"teacher_disagreement_score":0.0029103542,"about_ca_system_score_codex":0.0008948978,"about_ca_system_score_gemma":0.000853998,"threshold_uncertainty_score":0.009736061},"labels":[],"label_agreement":null},{"id":"W2964278440","doi":"","title":"Fault-tolerance of balanced hypercubes with faulty vertices and faulty edges.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hypercube; Combinatorics; Bipartite graph; Hamiltonian path; Mathematics; Fault tolerance; Hamiltonian (control theory); Embedding; Graph; Discrete mathematics; Computer science; Distributed computing","score_opus":0.011708026096431142,"score_gpt":0.22825893696829128,"score_spread":0.21655091087186012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964278440","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65754336,0.002161963,0.3274272,0.0005074742,0.00018196918,0.00010012768,0.0003928419,0.00046348982,0.011221578],"genre_scores_gemma":[0.9715764,0.0005586712,0.024087908,0.000095927666,0.00003173433,0.00008757509,0.00038120637,0.000035500212,0.0031450698],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995721,0.00009638998,0.000027938018,0.0000736927,0.00011164629,0.0001183123],"domain_scores_gemma":[0.999159,0.00026989044,0.00020462654,0.00012962472,0.00014856772,0.00008834565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030272367,0.0005846848,0.00038313982,0.0005652175,0.00055767753,0.0006397351,0.0006200768,0.0005574243,0.0020761173],"category_scores_gemma":[0.0018593488,0.00028947476,0.00033576667,0.00055897445,0.0005857001,0.0013190253,0.0012848765,0.0004521372,0.00029384563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014358042,0.00015264688,0.005971208,0.000651334,0.00017609305,0.0011390084,0.0007282583,0.6558291,0.07269573,0.14059551,0.004746867,0.115878455],"study_design_scores_gemma":[0.000095473086,0.00045404886,0.0019714765,0.00007203258,0.000055969707,0.0005191492,0.00041456826,0.8042893,0.03301241,0.15143183,0.0076401015,0.000043553435],"about_ca_topic_score_codex":0.0018308338,"about_ca_topic_score_gemma":0.00128341,"teacher_disagreement_score":0.0020761173,"about_ca_system_score_codex":0.0006538947,"about_ca_system_score_gemma":0.00031815754,"threshold_uncertainty_score":0.006945312},"labels":[],"label_agreement":null},{"id":"W2964279196","doi":"","title":"Binomial transform of products.","year":2016,"lang":"ca","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Fibonacci number; Binomial coefficient; Harmonic number; Binomial (polynomial); Gaussian binomial coefficient; Laguerre polynomials; Binomial approximation; Binomial distribution; Product (mathematics); Bernoulli's principle; Sequence (biology); Bernoulli number; Negative binomial distribution; Discrete mathematics; Combinatorics; Pure mathematics; Statistics; Poisson distribution","score_opus":0.009538572845635846,"score_gpt":0.24856885561594652,"score_spread":0.2390302827703107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964279196","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16451405,0.001786722,0.67981714,0.0007050924,0.0010952434,0.00010768435,0.00057495304,0.00071634864,0.15068269],"genre_scores_gemma":[0.8340411,0.0015905492,0.1326765,0.00031483252,0.0007740784,0.00013067035,0.0009829762,0.000359308,0.029129818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991316,0.00015955024,0.000037455924,0.00013373018,0.00038484827,0.00015285319],"domain_scores_gemma":[0.99872226,0.0005534169,0.00018513082,0.00012939962,0.00027293846,0.00013678879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013264524,0.0007537488,0.00060834695,0.003291285,0.0010166169,0.002815151,0.00085260527,0.00082492223,0.012968109],"category_scores_gemma":[0.007503007,0.0003110805,0.0007708494,0.0016147693,0.0018860983,0.0049774023,0.0017010861,0.0016948663,0.004067672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058568432,0.00002732325,0.00053881516,0.000060908616,0.000010267288,0.00021352503,0.00017872597,0.0026461664,0.0019031757,0.9664596,0.0022167945,0.025686204],"study_design_scores_gemma":[0.00001339535,0.00004857922,0.0005584189,0.000055842287,0.000016186565,0.00087237736,0.000103351806,0.032848686,0.0032431053,0.9529346,0.009274261,0.000031191255],"about_ca_topic_score_codex":0.0005916373,"about_ca_topic_score_gemma":0.0006577389,"teacher_disagreement_score":0.012968109,"about_ca_system_score_codex":0.00080517546,"about_ca_system_score_gemma":0.0006538719,"threshold_uncertainty_score":0.043382704},"labels":[],"label_agreement":null},{"id":"W2964291259","doi":"","title":"More on total monochromatic connection of graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Monochromatic color; Graph; Connectivity; Path graph; Discrete mathematics; Complete graph; Graph power; Line graph; Physics","score_opus":0.016327045608882398,"score_gpt":0.2884815805784785,"score_spread":0.27215453496959613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964291259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09469377,0.04060519,0.54796654,0.009862498,0.0036401225,0.00019838073,0.002573324,0.001582025,0.29887825],"genre_scores_gemma":[0.72212785,0.021395331,0.1552882,0.011870387,0.004680068,0.00029442037,0.0024885149,0.0016843161,0.08017085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986407,0.0002969653,0.000036211986,0.00048125704,0.00029443327,0.0002504735],"domain_scores_gemma":[0.99771667,0.0011748328,0.0002543102,0.00043609602,0.000250912,0.00016720466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012300542,0.0019347271,0.0009022549,0.002652444,0.0014441567,0.0017854117,0.0013083458,0.0016459988,0.016743274],"category_scores_gemma":[0.004162665,0.0005979291,0.0016975591,0.0048588077,0.0020660108,0.007129221,0.0012930761,0.0033259538,0.0019370229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008183823,0.000093226736,0.0016683317,0.00035765386,0.000062416606,0.00025058864,0.0005300137,0.010903371,0.004161891,0.92280984,0.025727404,0.03335347],"study_design_scores_gemma":[0.000022350456,0.00014087406,0.0023114264,0.000113316775,0.000053485826,0.00070650293,0.00018369395,0.024764204,0.0020168917,0.8627745,0.10683798,0.00007482878],"about_ca_topic_score_codex":0.0037863674,"about_ca_topic_score_gemma":0.0044975406,"teacher_disagreement_score":0.016743274,"about_ca_system_score_codex":0.0022358522,"about_ca_system_score_gemma":0.00047879358,"threshold_uncertainty_score":0.056011856},"labels":[],"label_agreement":null},{"id":"W2964336310","doi":"","title":"P 2k+1 -factorization of symmetric complete bipartite multi-digraphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Factorization; Combinatorics; Complete bipartite graph; Graph; Algorithm","score_opus":0.012850550209698127,"score_gpt":0.20130412126206385,"score_spread":0.1884535710523657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964336310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25783035,0.0013070242,0.5266246,0.0024554932,0.0005602412,0.00046979223,0.0069169444,0.0010083447,0.20282722],"genre_scores_gemma":[0.83046824,0.0007763855,0.09840187,0.00061097933,0.00024527914,0.00024543848,0.0045327665,0.00021578267,0.064503096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991584,0.00015252671,0.000047904483,0.00025664334,0.0001624952,0.000222083],"domain_scores_gemma":[0.9987387,0.00035296186,0.00019771176,0.00021279717,0.00024038892,0.00025744655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044267313,0.0007211596,0.00066782185,0.0011351921,0.001476045,0.0024562364,0.0008454827,0.0008939723,0.024127496],"category_scores_gemma":[0.0020895824,0.0004653694,0.0006680548,0.0008754448,0.00097341725,0.002545691,0.0014910003,0.0014514731,0.004321078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022637937,0.00019577774,0.0010730636,0.00039452093,0.000046278492,0.0005804211,0.0003730438,0.011258107,0.006998058,0.9150909,0.022803329,0.040960126],"study_design_scores_gemma":[0.000041011786,0.000059189028,0.0009840957,0.000087843204,0.000022578986,0.0007463761,0.00027771102,0.035921145,0.0020002567,0.94053835,0.019283924,0.00003743722],"about_ca_topic_score_codex":0.0015296742,"about_ca_topic_score_gemma":0.0031773597,"teacher_disagreement_score":0.024127496,"about_ca_system_score_codex":0.0012430553,"about_ca_system_score_gemma":0.000999257,"threshold_uncertainty_score":0.080714464},"labels":[],"label_agreement":null},{"id":"W2964344819","doi":"","title":"Cycle structures of autotopisms of the Latin squares of order up to 11","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Latin square; Mathematics; BETA (programming language); Order (exchange); Delta; Alpha (finance); Combinatorics; Square (algebra); Physics; Statistics; Geometry; Chemistry; Computer science","score_opus":0.0067334071503194395,"score_gpt":0.20614109394995983,"score_spread":0.19940768679964038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964344819","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85593116,0.0009160743,0.04618363,0.0002761317,0.000114199414,0.000079467776,0.00033339285,0.0001662687,0.09599966],"genre_scores_gemma":[0.9577416,0.00060332177,0.016060067,0.000124094,0.0001261278,0.000099970544,0.00040565198,0.00008924007,0.024749877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995709,0.000076681856,0.00002236495,0.00010539021,0.00010378657,0.00012080834],"domain_scores_gemma":[0.9993636,0.00018387925,0.00013845747,0.00009252284,0.00012281563,0.00009870943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020711705,0.00036825985,0.00028130203,0.0019407996,0.001163643,0.0016135888,0.0004572882,0.00049983035,0.005811576],"category_scores_gemma":[0.0006631782,0.00034124608,0.0005223358,0.0008763849,0.0014384402,0.0011589277,0.0007769494,0.0007800418,0.00065119716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057275214,0.000025958732,0.0010203028,0.000046280373,0.000009279805,0.0002748796,0.0005468031,0.0014848709,0.0055106757,0.97301877,0.0009791711,0.017025573],"study_design_scores_gemma":[0.000033663553,0.00010448585,0.003553993,0.00006724525,0.000029542418,0.0011925555,0.0008009154,0.012416484,0.009370689,0.9391984,0.03318102,0.000051039024],"about_ca_topic_score_codex":0.001051955,"about_ca_topic_score_gemma":0.0012284794,"teacher_disagreement_score":0.005811576,"about_ca_system_score_codex":0.0008350903,"about_ca_system_score_gemma":0.00046995297,"threshold_uncertainty_score":0.019441664},"labels":[],"label_agreement":null},{"id":"W2964349387","doi":"","title":"Some formulas for numbers of line segments and lines in a rectangular grid.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Grid; Line (geometry); Line segment; Combinatorics; Geometry","score_opus":0.046902095426489133,"score_gpt":0.35000202173603123,"score_spread":0.3030999263095421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964349387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036844965,0.00600487,0.759547,0.002071033,0.0012430311,0.00020598734,0.0016994409,0.00086138095,0.19152232],"genre_scores_gemma":[0.38737863,0.0042786202,0.557339,0.0016731794,0.0012391304,0.00079643406,0.0020145497,0.0009463401,0.044334117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991341,0.0001686205,0.000091869486,0.00017150912,0.00031320265,0.00012063918],"domain_scores_gemma":[0.99853563,0.0007254894,0.00017121295,0.00015807677,0.00034542786,0.00006419861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013134311,0.0009192291,0.0005746692,0.0020596068,0.0010041447,0.0018815624,0.002091315,0.0010380618,0.011780773],"category_scores_gemma":[0.00798976,0.00051176257,0.00086609286,0.0019569136,0.0016334653,0.006867589,0.001540113,0.0026252563,0.0034835467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005871228,0.000050566403,0.0010066065,0.00027975012,0.000021022217,0.00028598876,0.0005809286,0.0031898099,0.0027414507,0.8970675,0.015486968,0.07923076],"study_design_scores_gemma":[0.00003245519,0.00007256045,0.0016756124,0.00017498588,0.000069479494,0.00087055145,0.00034995307,0.03198683,0.0037616198,0.88554823,0.075392224,0.00006546257],"about_ca_topic_score_codex":0.0017424827,"about_ca_topic_score_gemma":0.002655358,"teacher_disagreement_score":0.011780773,"about_ca_system_score_codex":0.001832874,"about_ca_system_score_gemma":0.00041838986,"threshold_uncertainty_score":0.03941059},"labels":[],"label_agreement":null},{"id":"W2974361103","doi":"","title":"Common multiples of paths and stars","year":2019,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Historical Astronomy and Related Studies","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Multiple; Stars; Mathematics; Arithmetic; Astrophysics; Physics","score_opus":0.0050349108063383295,"score_gpt":0.2029398479754449,"score_spread":0.19790493716910657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2974361103","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20015123,0.004895375,0.31723645,0.0045550237,0.0013376512,0.00013131724,0.0017781137,0.00085923716,0.4690556],"genre_scores_gemma":[0.83477974,0.003465714,0.058827028,0.00065146136,0.0011028122,0.0000948406,0.0011237725,0.00031782032,0.09963681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977447,0.00050612004,0.00016886217,0.0008271553,0.00046843998,0.00028474128],"domain_scores_gemma":[0.9952958,0.0019242315,0.0006820802,0.0010062461,0.0006801371,0.00041154362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012281049,0.0008431965,0.0010860721,0.004501725,0.0045480626,0.0058800173,0.0016068186,0.0014038787,0.019946767],"category_scores_gemma":[0.0058636563,0.0006889635,0.001268861,0.008149373,0.0073991013,0.016673863,0.004386414,0.0034938015,0.003121775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013792958,0.0000047519584,0.00015884935,0.000028581799,0.0000068029663,0.00006393145,0.0001817547,0.00010876548,0.00010288148,0.9942076,0.0007912925,0.004331028],"study_design_scores_gemma":[0.000005062617,0.000006589197,0.00016454812,0.000019399722,0.000011687648,0.00035736262,0.00016569132,0.00026249664,0.0001766034,0.9812097,0.01761116,0.000009747382],"about_ca_topic_score_codex":0.0015634714,"about_ca_topic_score_gemma":0.0013575623,"teacher_disagreement_score":0.019946767,"about_ca_system_score_codex":0.0018781554,"about_ca_system_score_gemma":0.0010195733,"threshold_uncertainty_score":0.06672853},"labels":[],"label_agreement":null},{"id":"W29797089","doi":"10.1007/164_2018_138","title":"Packings with block size five and index one: v \\equiv 2 (mod 4).","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mod; Mathematics; Block (permutation group theory); Index (typography); Block size; Combinatorics; Arithmetic; Statistics; Computer science; World Wide Web","score_opus":0.005980269939868157,"score_gpt":0.1673284559591292,"score_spread":0.16134818601926104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W29797089","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29841182,0.030479614,0.23309267,0.00408065,0.016954849,0.002627209,0.038285393,0.06256566,0.31350216],"genre_scores_gemma":[0.5329642,0.01347026,0.1897362,0.0025421,0.0010031261,0.004398464,0.04601195,0.011013861,0.1988597],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994844,0.000070651746,0.000051130315,0.00013504023,0.00011648037,0.00014226875],"domain_scores_gemma":[0.9996166,0.00006314864,0.000048668513,0.00010366904,0.000060551272,0.000107339365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038133588,0.0014160144,0.0017486796,0.0009908009,0.0013769876,0.0013246894,0.0020557255,0.0010041522,0.13000043],"category_scores_gemma":[0.001345308,0.00093224156,0.0007519098,0.0014235196,0.00043901041,0.0017535108,0.0016349738,0.001621563,0.061882548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005603458,0.0009232286,0.002665736,0.003714602,0.00042136936,0.0011607528,0.00045843955,0.018709034,0.21029665,0.06645033,0.34035897,0.34923744],"study_design_scores_gemma":[0.00077567564,0.0012542247,0.001370305,0.0002549989,0.00021470641,0.0005871513,0.0002485221,0.041956715,0.12160589,0.020154314,0.81138206,0.00019543798],"about_ca_topic_score_codex":0.0014670878,"about_ca_topic_score_gemma":0.0019675517,"teacher_disagreement_score":0.13000043,"about_ca_system_score_codex":0.00063359895,"about_ca_system_score_gemma":0.0007838207,"threshold_uncertainty_score":0.43489474},"labels":[],"label_agreement":null},{"id":"W298550780","doi":"","title":"La {-k}-autoduality des sommes lexicographiques finies de tournois suivant un 3-cycle ou un tournoi critique.","year":2006,"lang":"fr","type":"article","venue":"Ars Combinatoria","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Humanities; Philosophy","score_opus":0.03123489315163599,"score_gpt":0.30835286969836256,"score_spread":0.2771179765467266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W298550780","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68610483,0.00085944723,0.15812597,0.002348607,0.0004199617,0.00006334499,0.00084609375,0.0004767309,0.15075493],"genre_scores_gemma":[0.926953,0.00041340533,0.033315945,0.0004114933,0.00017258157,0.00006994125,0.00088170974,0.00019368647,0.037588112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985738,0.0004381305,0.000072271505,0.00033408002,0.00031872027,0.00026305876],"domain_scores_gemma":[0.9977849,0.0010782696,0.00022166417,0.00020521143,0.0003957699,0.00031414584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013203921,0.00077022344,0.0010698971,0.0020662202,0.0029201172,0.006298742,0.00074237806,0.0020797856,0.011319654],"category_scores_gemma":[0.0051008053,0.0006889248,0.0016306962,0.001718141,0.0044851005,0.0043663606,0.0016479628,0.004394078,0.0015924983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023090738,0.000033928838,0.0012683071,0.000058391102,0.0000406383,0.00024434496,0.00062276336,0.0016615671,0.0031707967,0.9839702,0.0016591263,0.0070390883],"study_design_scores_gemma":[0.00013479526,0.000090443675,0.0032082994,0.00005674126,0.000048242422,0.0007525284,0.0008602377,0.015540206,0.0037711884,0.96045434,0.015002046,0.00008088645],"about_ca_topic_score_codex":0.012994021,"about_ca_topic_score_gemma":0.014087634,"teacher_disagreement_score":0.012994021,"about_ca_system_score_codex":0.002824823,"about_ca_system_score_gemma":0.0014087362,"threshold_uncertainty_score":0.037868083},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.008007175654805906,"score_gpt":0.17949479778737687,"score_spread":0.17148762213257096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W29918265","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4262697,0.0036743449,0.4651577,0.0016956014,0.00016753044,0.00020273718,0.0028136682,0.0006979863,0.09932083],"genre_scores_gemma":[0.94481146,0.0015926519,0.04522379,0.0002909258,0.00027703657,0.0001721554,0.0024752948,0.00015723752,0.0049993866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909663,0.00020641611,0.00007497959,0.00023689975,0.00025189485,0.00013308479],"domain_scores_gemma":[0.9925235,0.004429303,0.0015258176,0.00054342,0.00047097148,0.0005069272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070897513,0.00082626473,0.00042263677,0.0029349658,0.00070450135,0.001716497,0.00083694124,0.00094532495,0.0073022693],"category_scores_gemma":[0.005653793,0.0003816778,0.0006558054,0.0023737068,0.0012825247,0.0036397388,0.0009937107,0.0016257624,0.00081121596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020399332,0.00014511275,0.011173297,0.0006205348,0.00009229471,0.0006107564,0.00082157855,0.028663373,0.018913984,0.85837775,0.0071496586,0.0732277],"study_design_scores_gemma":[0.000023544817,0.00015540543,0.00549641,0.00012217808,0.000055359804,0.0022687963,0.00048668592,0.05322375,0.0058566905,0.9111688,0.021110557,0.00003176791],"about_ca_topic_score_codex":0.0002254,"about_ca_topic_score_gemma":0.0004284075,"teacher_disagreement_score":0.0073022693,"about_ca_system_score_codex":0.0007310504,"about_ca_system_score_gemma":0.00022468915,"threshold_uncertainty_score":0.024428487},"labels":[],"label_agreement":null},{"id":"W3013793676","doi":"","title":"Block-Transitive 2-(v, k, 1) Designs and the Groups E 7 (q).","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Transitive relation; Mathematics; Block (permutation group theory); Combinatorics; Automorphism; Automorphism group; Prime (order theory); Flag (linear algebra); Discrete mathematics; Pure mathematics; Algebra over a field","score_opus":0.04434625951599355,"score_gpt":0.30695642591820665,"score_spread":0.26261016640221313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013793676","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6981464,0.001113006,0.18947858,0.00055030576,0.00016493104,0.000117208205,0.00021575001,0.00017670692,0.110037185],"genre_scores_gemma":[0.9566539,0.0003133168,0.024784964,0.000120687415,0.000047623103,0.000053548843,0.0001376641,0.000028835824,0.017859453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996233,0.00012659037,0.000023364195,0.000053510663,0.000089228044,0.00008393902],"domain_scores_gemma":[0.9990834,0.00038127293,0.00026148648,0.00012989483,0.00008347509,0.00006033934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036514955,0.00023168598,0.00017809615,0.00037766906,0.000515865,0.00089628284,0.00024017617,0.00042759333,0.005074817],"category_scores_gemma":[0.0013553365,0.00018277238,0.00027757327,0.0002446045,0.0008067333,0.0013180947,0.0007521549,0.00041533023,0.00066877785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015072693,0.000045355286,0.0014921156,0.00007269081,0.000016995085,0.00024752252,0.00038841544,0.0031033477,0.010529342,0.9536586,0.0011430932,0.02915185],"study_design_scores_gemma":[0.00006500694,0.0003005134,0.0017084178,0.000047301815,0.000024839357,0.00073333364,0.00025732967,0.01716401,0.011065411,0.93366796,0.034936983,0.000028744584],"about_ca_topic_score_codex":0.00046495462,"about_ca_topic_score_gemma":0.0010375531,"teacher_disagreement_score":0.005074817,"about_ca_system_score_codex":0.00041033947,"about_ca_system_score_gemma":0.000388506,"threshold_uncertainty_score":0.016977012},"labels":[],"label_agreement":null},{"id":"W3014844","doi":"10.1007/bf01988032","title":"Recursive constructions on large sets of some balanced incomplete block designs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Block (permutation group theory); Arithmetic; Combinatorics; Discrete mathematics","score_opus":0.010568064870484012,"score_gpt":0.21796563939955124,"score_spread":0.20739757452906724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014844","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059517387,0.0003181844,0.92045015,0.00031216707,0.000079751655,0.00024161172,0.0004442437,0.0002601658,0.018376231],"genre_scores_gemma":[0.54962504,0.00055972044,0.42543584,0.00027765785,0.00010054614,0.000930579,0.0009974157,0.00016580988,0.021907372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823534,0.00081503537,0.000110623296,0.0002678799,0.00035424918,0.0002167856],"domain_scores_gemma":[0.9958586,0.0023805106,0.00054224103,0.0006332875,0.0004068771,0.00017840741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019865003,0.00058643555,0.00049342436,0.000871415,0.000884963,0.0011719464,0.0007358824,0.00065650797,0.009234274],"category_scores_gemma":[0.0053828494,0.00050695473,0.00089645106,0.0006920281,0.0011688583,0.0015768928,0.0013500012,0.0012215758,0.0016970476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012913738,0.00004488371,0.0004828768,0.00015076263,0.000035611778,0.000144663,0.00022145886,0.023166519,0.0062242644,0.9287785,0.0015716752,0.039049692],"study_design_scores_gemma":[0.00011803398,0.00021495782,0.0005234164,0.000090770176,0.000052028525,0.0002224174,0.000097196615,0.08517855,0.0063289045,0.88111496,0.026022894,0.000035956335],"about_ca_topic_score_codex":0.00078585045,"about_ca_topic_score_gemma":0.0016749167,"teacher_disagreement_score":0.009234274,"about_ca_system_score_codex":0.0010820997,"about_ca_system_score_gemma":0.0008091261,"threshold_uncertainty_score":0.030891716},"labels":[],"label_agreement":null},{"id":"W30224642","doi":"10.1038/s41598-018-32298-1","title":"On Graphs Whose Acyclic Graphoidal Covering Number Is One Less Than Its Cyclomatic Number.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cyclomatic complexity; Combinatorics; Discrete mathematics; Computer science; Programming language; Software","score_opus":0.02159831771197511,"score_gpt":0.28798031761858794,"score_spread":0.2663819999066128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W30224642","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8082418,0.0021201312,0.1465651,0.0018006624,0.00018895333,0.00013222783,0.0034645477,0.00052011345,0.036966525],"genre_scores_gemma":[0.949381,0.0020221102,0.03441243,0.00035419298,0.00023837268,0.0001605008,0.003180713,0.00012476865,0.010125975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994716,0.00014358894,0.000031060783,0.00018136376,0.00008020614,0.000092136135],"domain_scores_gemma":[0.99598664,0.0021300644,0.0009908233,0.0003817804,0.00020283062,0.00030785226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036253306,0.00048368075,0.00040753777,0.0022365958,0.0010724907,0.0016770422,0.0005016754,0.0007592855,0.004841564],"category_scores_gemma":[0.002887326,0.00030678633,0.00049884676,0.001936421,0.0012051184,0.0023555793,0.0006216594,0.0005707491,0.0006470806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034920938,0.000095334246,0.008778684,0.00061782333,0.00014494418,0.0010787898,0.00087492337,0.025685558,0.016385306,0.87733114,0.0074121063,0.061246045],"study_design_scores_gemma":[0.000035215067,0.000075116805,0.006708126,0.00013727206,0.00008385153,0.0016812824,0.0003477469,0.058562264,0.0040921452,0.8991627,0.029078625,0.00003571815],"about_ca_topic_score_codex":0.0011575271,"about_ca_topic_score_gemma":0.0021723392,"teacher_disagreement_score":0.004841564,"about_ca_system_score_codex":0.001184839,"about_ca_system_score_gemma":0.00032523207,"threshold_uncertainty_score":0.016196668},"labels":[],"label_agreement":null},{"id":"W30538323","doi":"10.1038/d41586-018-07734-x","title":"Every Plane Graph with Girth at least 4 without 8- and 9-circuits is 3-Choosable.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Girth (graph theory); Electronic circuit; Graph; Plane (geometry); Combinatorics; Discrete mathematics; Arithmetic; Geometry; Electrical engineering; Engineering","score_opus":0.004147788796509642,"score_gpt":0.16255924101002223,"score_spread":0.15841145221351258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W30538323","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7893985,0.0007125756,0.0906222,0.0021993213,0.00021896887,0.0001675751,0.004772812,0.00092563755,0.11098236],"genre_scores_gemma":[0.9389652,0.0009355314,0.032326784,0.00056162593,0.000074741474,0.00010913729,0.004222968,0.00021791049,0.022586098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967706,0.000037492748,0.00001535656,0.0000870933,0.00007487498,0.00010819913],"domain_scores_gemma":[0.9987161,0.0006013122,0.0002628878,0.00020816733,0.00008454622,0.00012695778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019540454,0.00058812,0.0006803601,0.0005159533,0.00095942145,0.0020742558,0.00069170527,0.00094210776,0.01643381],"category_scores_gemma":[0.00096453563,0.00065100635,0.0010167486,0.0008737793,0.0010599853,0.0020567207,0.0007964748,0.0014109979,0.0020264534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036212672,0.00057529437,0.012399751,0.0014993696,0.0006763617,0.003257708,0.0011604382,0.03107652,0.16968542,0.5689433,0.03729523,0.1698094],"study_design_scores_gemma":[0.0008430444,0.00067584624,0.02030988,0.00018190952,0.0006000219,0.0050273747,0.0010584871,0.033578042,0.102513626,0.75513226,0.07987309,0.00020637656],"about_ca_topic_score_codex":0.0019704856,"about_ca_topic_score_gemma":0.0026884482,"teacher_disagreement_score":0.01643381,"about_ca_system_score_codex":0.000657445,"about_ca_system_score_gemma":0.00066481344,"threshold_uncertainty_score":0.054976583},"labels":[],"label_agreement":null},{"id":"W30750922","doi":"","title":"King's Total Domination Number on the Square of Side n","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Dominating set; Domination analysis; Vertex (graph theory); Combinatorics; Mathematics; Graph; Square (algebra); Connectivity; Discrete mathematics; Geometry","score_opus":0.013299274648357817,"score_gpt":0.2736437662253444,"score_spread":0.2603444915769866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W30750922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30850762,0.006334677,0.39095697,0.0055182446,0.00069195614,0.00030442255,0.005141007,0.00128453,0.28126058],"genre_scores_gemma":[0.87954134,0.0041311975,0.06898491,0.0011835955,0.00042546072,0.0003229655,0.0016950407,0.00030780118,0.04340762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855345,0.00019749175,0.000074697804,0.0003869329,0.00039806296,0.0003892522],"domain_scores_gemma":[0.994896,0.0030741675,0.0003566564,0.00070453977,0.0005185566,0.00045015223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001139325,0.000962295,0.0010942661,0.0013497773,0.0012515093,0.0023948494,0.0016836053,0.00065433764,0.009677854],"category_scores_gemma":[0.0050072544,0.0004118893,0.00083640555,0.002075087,0.001948928,0.0041966466,0.0026518106,0.0016387056,0.0013705206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007681833,0.00012240073,0.0064735077,0.0013058139,0.00021828448,0.0006065864,0.0012150862,0.0820822,0.024638614,0.69243145,0.0707244,0.11941348],"study_design_scores_gemma":[0.00012762789,0.00021761829,0.0060261195,0.00021023024,0.00027443524,0.0013574146,0.00040472575,0.21378382,0.018573925,0.6360571,0.12282602,0.00014093169],"about_ca_topic_score_codex":0.004314053,"about_ca_topic_score_gemma":0.007617157,"teacher_disagreement_score":0.009677854,"about_ca_system_score_codex":0.0020691403,"about_ca_system_score_gemma":0.0010788414,"threshold_uncertainty_score":0.032375634},"labels":[],"label_agreement":null},{"id":"W309275459","doi":"","title":"Perfect -latin squares.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Latin square; Biology; Food science","score_opus":0.01037542429947677,"score_gpt":0.1823213698910491,"score_spread":0.17194594559157234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W309275459","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026729641,0.007578228,0.10262587,0.0047247824,0.002843275,0.00008243664,0.0022982094,0.0010376961,0.8520798],"genre_scores_gemma":[0.5670789,0.0055284123,0.06751919,0.0034082648,0.0016519539,0.00018314415,0.0022278463,0.00078575034,0.35161656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993451,0.00019119718,0.000022632037,0.00016281754,0.0001710644,0.00010714169],"domain_scores_gemma":[0.9993668,0.0001852413,0.000091179434,0.00018135582,0.000107767184,0.000067650966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034525798,0.0006975317,0.00062545843,0.0010968184,0.0011950681,0.0020716516,0.0006281081,0.00088011805,0.05436987],"category_scores_gemma":[0.0021699364,0.00032767394,0.00035458946,0.0014014555,0.0011109393,0.0025875363,0.0016541721,0.0016762113,0.016354205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000589865,0.000020663678,0.00019950462,0.00009370429,0.000013982171,0.000084282605,0.00007790274,0.00070639123,0.0010131439,0.9131446,0.042499498,0.042087425],"study_design_scores_gemma":[0.000017566641,0.000015383743,0.00021292167,0.00003837189,0.000009967468,0.00030871123,0.000062899395,0.0023058415,0.0015501872,0.89112663,0.10433978,0.000011763379],"about_ca_topic_score_codex":0.00067912025,"about_ca_topic_score_gemma":0.0017121092,"teacher_disagreement_score":0.05436987,"about_ca_system_score_codex":0.0008170144,"about_ca_system_score_gemma":0.00052868546,"threshold_uncertainty_score":0.1818853},"labels":[],"label_agreement":null},{"id":"W31267046","doi":"","title":"The Dynamic Coloring Numbers of Pseudo-Halin Graphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Treewidth; Pathwidth; Graph; Line graph","score_opus":0.005903853570609179,"score_gpt":0.21390702935142047,"score_spread":0.2080031757808113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W31267046","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5428586,0.0022213166,0.17749073,0.0067199958,0.0008540306,0.00015027118,0.002340169,0.0007456937,0.26661927],"genre_scores_gemma":[0.94845355,0.00077037525,0.026176466,0.0004168358,0.0002793208,0.00019156854,0.0007109372,0.0001777716,0.022823181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991621,0.00022906798,0.000038023205,0.0001845781,0.00019736482,0.00018897704],"domain_scores_gemma":[0.99432015,0.0034247604,0.00060438825,0.0005145427,0.0005036727,0.00063244335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097563065,0.00051889097,0.0004219643,0.002854123,0.0022300314,0.0040673614,0.0014628503,0.0011802736,0.013977093],"category_scores_gemma":[0.008976965,0.00054228137,0.00035304372,0.0017745704,0.0028388237,0.0068342974,0.0016671997,0.0019809352,0.0014282613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010736772,0.000023516764,0.0007828907,0.000042422922,0.000005916555,0.000031114447,0.00014318051,0.003571711,0.0010963656,0.97865134,0.005127208,0.0104168635],"study_design_scores_gemma":[0.00003191213,0.000021425449,0.00091520353,0.000035966965,0.0000102195545,0.00012940065,0.00022292043,0.02241196,0.0024924532,0.96339214,0.010311439,0.000024851133],"about_ca_topic_score_codex":0.001452275,"about_ca_topic_score_gemma":0.0018602401,"teacher_disagreement_score":0.013977093,"about_ca_system_score_codex":0.002474261,"about_ca_system_score_gemma":0.0009512949,"threshold_uncertainty_score":0.046757996},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics","score_opus":0.019290742424289572,"score_gpt":0.2675628570168777,"score_spread":0.24827211459258813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W31298921","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3513069,0.0019432423,0.10564218,0.0027715468,0.001085681,0.00015286022,0.004495137,0.0010942592,0.53150815],"genre_scores_gemma":[0.8916117,0.0010467733,0.023196831,0.00037139287,0.00020916047,0.00014728915,0.0019305674,0.00032463943,0.08116159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944144,0.000092400325,0.00002084611,0.00013720593,0.00016562319,0.0001424815],"domain_scores_gemma":[0.99782467,0.0008863319,0.00022030357,0.00037407875,0.00035254908,0.00034210135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005399504,0.0004031432,0.00039119413,0.0026953982,0.0016957863,0.0038403836,0.0009991889,0.0008459408,0.03241947],"category_scores_gemma":[0.0038615398,0.00032683404,0.00023716221,0.00182365,0.0016507171,0.004229306,0.0012478759,0.0017734161,0.003910072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014218695,0.000028772927,0.00093529694,0.000069182606,0.0000075482617,0.000032725868,0.00016577823,0.0017645679,0.002170762,0.966822,0.009692138,0.018168965],"study_design_scores_gemma":[0.00003404797,0.000028364382,0.0016286849,0.000056012937,0.000012845728,0.000136323,0.0002811898,0.011090982,0.0032524858,0.9416687,0.041784406,0.000025964482],"about_ca_topic_score_codex":0.0022954992,"about_ca_topic_score_gemma":0.004971665,"teacher_disagreement_score":0.03241947,"about_ca_system_score_codex":0.0018686125,"about_ca_system_score_gemma":0.0007942436,"threshold_uncertainty_score":0.10845393},"labels":[],"label_agreement":null},{"id":"W3141724913","doi":"","title":"Paired-Domination in Claw-Free Graphs with Minimum Degree at Least Four.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Claw; Degree (music); Combinatorics; Biology; Physics","score_opus":0.03066532496089894,"score_gpt":0.2654474907939363,"score_spread":0.23478216583303738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3141724913","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86918736,0.000692655,0.063296184,0.0015801293,0.00011531123,0.00015036452,0.0012236264,0.0004782313,0.06327614],"genre_scores_gemma":[0.9616247,0.00030215128,0.017859995,0.00031871107,0.00005913468,0.00010376303,0.0011399525,0.00009522975,0.01849634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999419,0.00011556955,0.000028749242,0.00014391684,0.00011255407,0.00018021013],"domain_scores_gemma":[0.9963677,0.0018855585,0.0005390001,0.00030414356,0.00032219102,0.00058135425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043273647,0.000429392,0.00052380416,0.0014209124,0.0018662865,0.0017828344,0.0014342334,0.0011390803,0.009846262],"category_scores_gemma":[0.0038943752,0.0005982341,0.0005011776,0.0012314809,0.0012236906,0.0031011603,0.0018679474,0.0012833641,0.0012811195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011263943,0.0005141665,0.014911431,0.00092686975,0.00023548768,0.0032991276,0.002536925,0.024203712,0.039054018,0.781759,0.02520054,0.10623237],"study_design_scores_gemma":[0.00019978637,0.00015869376,0.0050914534,0.00019546285,0.00016750695,0.00249956,0.0015517656,0.050367862,0.018338354,0.89929265,0.022067681,0.00006927622],"about_ca_topic_score_codex":0.0018337064,"about_ca_topic_score_gemma":0.0036323573,"teacher_disagreement_score":0.009846262,"about_ca_system_score_codex":0.000758572,"about_ca_system_score_gemma":0.0007763366,"threshold_uncertainty_score":0.032939076},"labels":[],"label_agreement":null},{"id":"W3141989380","doi":"","title":"On (a, d)-Antimagic Labelings of Generalized Petersen Graphs P(n, 3).","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.01564480844889474,"score_gpt":0.22455993650482572,"score_spread":0.208915128055931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3141989380","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62382305,0.0017666051,0.17812277,0.004095464,0.00035122837,0.00017335785,0.0018913057,0.00070792256,0.18906839],"genre_scores_gemma":[0.9062314,0.0014600592,0.06495828,0.0009396979,0.00023436414,0.0001745594,0.0017067852,0.00020533218,0.02408959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990024,0.00033114207,0.000057980647,0.00021275878,0.00017946935,0.00021624984],"domain_scores_gemma":[0.9962191,0.0023056655,0.0004729856,0.00042265697,0.00020270293,0.00037682342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076501485,0.0006015985,0.0005877729,0.0017797651,0.0026525902,0.0034795352,0.0010139357,0.002038759,0.007469405],"category_scores_gemma":[0.0041216114,0.00067111314,0.00079050224,0.0023673128,0.002403626,0.0053632553,0.0027578021,0.0021589787,0.001335963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001304423,0.00006080343,0.00085866265,0.000115817464,0.000018887433,0.00014271546,0.00042723684,0.005007666,0.001846016,0.9637091,0.0078307865,0.01985191],"study_design_scores_gemma":[0.000024595172,0.00001882412,0.0004912378,0.000037655616,0.000013561724,0.00016296457,0.00026409916,0.010067944,0.00088685955,0.9819933,0.0060236207,0.0000153005],"about_ca_topic_score_codex":0.0018283885,"about_ca_topic_score_gemma":0.002936046,"teacher_disagreement_score":0.007469405,"about_ca_system_score_codex":0.0018085092,"about_ca_system_score_gemma":0.0007197462,"threshold_uncertainty_score":0.024987698},"labels":[],"label_agreement":null},{"id":"W3144027832","doi":"","title":"Graph designs for nine graphs with six vertices and nine edges.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Graph","score_opus":0.01691304859091494,"score_gpt":0.1984579077484705,"score_spread":0.18154485915755555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3144027832","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20473197,0.0008413485,0.64287436,0.0016446855,0.0007299507,0.00059851905,0.001959792,0.001125694,0.1454936],"genre_scores_gemma":[0.7030109,0.0004396083,0.26498467,0.00037358204,0.000066417946,0.00036104623,0.0008617605,0.00008857901,0.029813448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934834,0.0002649311,0.00003301874,0.00012317773,0.00013274624,0.0000978731],"domain_scores_gemma":[0.9988727,0.00040712333,0.00012672509,0.0002403256,0.0002430034,0.00011006244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006025436,0.00047003783,0.00026532414,0.0006609654,0.0009986131,0.0009557965,0.0006935998,0.0008668639,0.018040052],"category_scores_gemma":[0.0021436887,0.00023411035,0.00039247217,0.0006101595,0.0006299681,0.00091744587,0.00068734883,0.0006008135,0.0023429953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009042842,0.00025096364,0.0012339771,0.0005457806,0.00010557035,0.0005627064,0.0003013763,0.03514542,0.031948607,0.793246,0.017376628,0.1183787],"study_design_scores_gemma":[0.00047164524,0.0007820484,0.0018798307,0.00023542959,0.00017029636,0.0010646594,0.00051146414,0.10998521,0.035661943,0.7265418,0.1225697,0.00012611964],"about_ca_topic_score_codex":0.00075385266,"about_ca_topic_score_gemma":0.0020355987,"teacher_disagreement_score":0.018040052,"about_ca_system_score_codex":0.0008417082,"about_ca_system_score_gemma":0.00071205606,"threshold_uncertainty_score":0.06035},"labels":[],"label_agreement":null},{"id":"W31460525","doi":"10.1039/c9cc05103a","title":"Powers of Asteroidal Triple-free Graphs with Applications.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Emil Aaltosen Säätiö; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.010637802496877196,"score_gpt":0.2542648206693099,"score_spread":0.24362701817243268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W31460525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15100773,0.006048688,0.4968782,0.0026027935,0.0017902614,0.00018533233,0.0011988229,0.0017997484,0.3384884],"genre_scores_gemma":[0.7937354,0.003047154,0.11899336,0.0007543897,0.00035373453,0.00016015705,0.001018719,0.0003340756,0.08160308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998313,0.00003032047,0.0000139465055,0.00004197506,0.000057371788,0.0000250932],"domain_scores_gemma":[0.999548,0.00011372545,0.000081948136,0.00010998466,0.000073798816,0.00007255455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000260609,0.0003303092,0.0001915089,0.000865113,0.0005895214,0.0012851603,0.00033015996,0.00030145267,0.014867323],"category_scores_gemma":[0.00095999194,0.00017721274,0.00029610473,0.0008387019,0.0009598882,0.0018836699,0.0010632353,0.00075864693,0.002175522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041641382,0.000013983812,0.00012762305,0.00014165303,0.000008613212,0.0001677191,0.00022587355,0.0019487196,0.00724139,0.94465995,0.0048652776,0.040557615],"study_design_scores_gemma":[0.000011616294,0.000043867494,0.00020509922,0.00005054909,0.000011283319,0.0005228469,0.00013020697,0.0062364433,0.007070086,0.86501217,0.12069095,0.000014919898],"about_ca_topic_score_codex":0.0003634996,"about_ca_topic_score_gemma":0.0011064005,"teacher_disagreement_score":0.014867323,"about_ca_system_score_codex":0.0005132919,"about_ca_system_score_gemma":0.00028394724,"threshold_uncertainty_score":0.0497362},"labels":[],"label_agreement":null},{"id":"W3147214075","doi":"","title":"On mutually independent hamiltonian cycles.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Differential Equations and Dynamical Systems","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hamiltonian (control theory); Pure mathematics; Mathematical physics; Mathematical optimization","score_opus":0.025043720322080378,"score_gpt":0.3022289866036339,"score_spread":0.27718526628155354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3147214075","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3839903,0.00361139,0.19034618,0.0027380914,0.00078539265,0.00016116262,0.0008606245,0.00025792155,0.41724885],"genre_scores_gemma":[0.9346065,0.0010397237,0.016725013,0.00051714986,0.00034672022,0.000137847,0.00037701274,0.00010632474,0.046143826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943537,0.00015514092,0.000029142027,0.00009699744,0.00014995346,0.00013329342],"domain_scores_gemma":[0.99896514,0.0003849618,0.00017216375,0.000120628094,0.00016401353,0.00019307187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042642897,0.0005054583,0.00048684067,0.0015593161,0.0013547912,0.0014652768,0.0007489995,0.00085315015,0.011735428],"category_scores_gemma":[0.0023998842,0.00034468935,0.00051913585,0.00079981674,0.0016971665,0.0029642659,0.0025211507,0.0012864163,0.0011524392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008224015,0.0000063474977,0.00009523068,0.000019396244,0.0000060826997,0.000060991522,0.00007191961,0.000416187,0.00028421113,0.99499184,0.0010056101,0.003033973],"study_design_scores_gemma":[0.0000066954567,0.0000046381742,0.0001285871,0.000012199014,0.000004232496,0.000082513354,0.00004819281,0.003150601,0.00014253616,0.99328244,0.0031322478,0.0000051434004],"about_ca_topic_score_codex":0.0008057242,"about_ca_topic_score_gemma":0.0014959031,"teacher_disagreement_score":0.011735428,"about_ca_system_score_codex":0.0008826711,"about_ca_system_score_gemma":0.0005231635,"threshold_uncertainty_score":0.039258957},"labels":[],"label_agreement":null},{"id":"W3149348444","doi":"","title":"On (a, d)-Antimagic Labelings of Generalized Petersen Graphs P(n, 2).","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Petersen graph; Discrete mathematics; Graph; Line graph; Voltage graph","score_opus":0.010177966502979077,"score_gpt":0.23125126471741325,"score_spread":0.22107329821443417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3149348444","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6234416,0.001783775,0.18128616,0.0041162856,0.00035229127,0.00018033854,0.0019385597,0.0007115017,0.18618947],"genre_scores_gemma":[0.9036883,0.001410841,0.06663361,0.0009275594,0.00023844188,0.00018291667,0.0017141458,0.00020348695,0.025000768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989792,0.000343719,0.000058614034,0.00021619431,0.00018293415,0.0002194473],"domain_scores_gemma":[0.99610317,0.00238364,0.00047425795,0.00044888095,0.00020627906,0.00038385854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077882595,0.0006071465,0.00060604623,0.0017654343,0.0026410576,0.0035138654,0.0010310011,0.0020558683,0.007624334],"category_scores_gemma":[0.0043486124,0.00068195997,0.00077448454,0.00236345,0.0023609665,0.005450991,0.0027624879,0.0021275876,0.0013187482],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013816264,0.00006500321,0.0008414684,0.00011797329,0.000019575698,0.0001446589,0.00042881176,0.0053369314,0.0018351371,0.9625268,0.008217114,0.020328252],"study_design_scores_gemma":[0.000026108113,0.000019759624,0.0004768109,0.00003699461,0.000013457209,0.00016244131,0.0002565893,0.0108685205,0.00085368985,0.9813658,0.0059043886,0.000015317695],"about_ca_topic_score_codex":0.0017173437,"about_ca_topic_score_gemma":0.002775828,"teacher_disagreement_score":0.007624334,"about_ca_system_score_codex":0.0018016986,"about_ca_system_score_gemma":0.0007170475,"threshold_uncertainty_score":0.0255059},"labels":[],"label_agreement":null},{"id":"W3150070852","doi":"","title":"Identities Involving the Fibonacci Polynomials.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Mathematics; Fibonacci polynomials; Pure mathematics; Combinatorics; Algebra over a field; Difference polynomials; Orthogonal polynomials","score_opus":0.00886453314740844,"score_gpt":0.2577756218206085,"score_spread":0.24891108867320005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3150070852","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032923363,0.008354686,0.2234032,0.0036442874,0.0035397937,0.00009336521,0.0006941613,0.00035947486,0.7269877],"genre_scores_gemma":[0.6781463,0.00825357,0.10234565,0.002967482,0.004027562,0.0002235876,0.0009630219,0.00040244503,0.20267035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867404,0.0003352212,0.000080321646,0.00016493305,0.00056545227,0.00017993161],"domain_scores_gemma":[0.99862146,0.00055606436,0.00013538457,0.00022139518,0.00035966738,0.00010611428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012416773,0.0008764305,0.0007871974,0.0029076042,0.0033414997,0.0046634823,0.00085405464,0.001564645,0.01628979],"category_scores_gemma":[0.0051870523,0.00044738452,0.0011678527,0.0020223034,0.0031841088,0.0068425564,0.0019818698,0.0028137125,0.005930684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036196252,0.0000025917236,0.000026146068,0.000015780108,0.000001566384,0.00003588152,0.00005573919,0.00007948351,0.0001472286,0.9944465,0.0022343688,0.0029510462],"study_design_scores_gemma":[0.000003321447,0.0000038424882,0.00006877136,0.000017485185,0.0000033792264,0.00014821163,0.0000368662,0.0007007207,0.0002556609,0.98517877,0.013574748,0.000008192876],"about_ca_topic_score_codex":0.0017501676,"about_ca_topic_score_gemma":0.0024170037,"teacher_disagreement_score":0.01628979,"about_ca_system_score_codex":0.0016171363,"about_ca_system_score_gemma":0.0012742165,"threshold_uncertainty_score":0.0544948},"labels":[],"label_agreement":null},{"id":"W3150871087","doi":"","title":"Quaternary Quasi-Cyclic Codes with Even Length Components.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Quaternary; Mathematics; Geology; Paleontology","score_opus":0.025103895406318192,"score_gpt":0.21940292284172855,"score_spread":0.19429902743541036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3150871087","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44267756,0.007000292,0.33135378,0.003740071,0.001644377,0.00022880523,0.0018092408,0.00071959256,0.2108263],"genre_scores_gemma":[0.9269617,0.0020265556,0.036195192,0.0007873344,0.0005101747,0.00010632958,0.000621552,0.0001138776,0.03267725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993635,0.00015576456,0.000042568554,0.00007722923,0.00022200514,0.00013888419],"domain_scores_gemma":[0.9983392,0.00055211125,0.00028082813,0.0003545189,0.00030725324,0.00016600112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006241823,0.0004431382,0.0004121568,0.0010745688,0.00094854855,0.0018078414,0.00045845401,0.0007003359,0.0059860926],"category_scores_gemma":[0.0028073885,0.0003097972,0.00032185297,0.0010505088,0.0013157643,0.00180329,0.0012025686,0.0010217077,0.0015567902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001132907,0.000021440717,0.00039297756,0.00007439718,0.000007999465,0.0001695752,0.00011920642,0.0013707378,0.006930621,0.97061586,0.003260685,0.01692315],"study_design_scores_gemma":[0.00005259409,0.000112786256,0.00088570017,0.000080154656,0.000027392036,0.0008753898,0.00010508946,0.016938461,0.009337246,0.93522286,0.03631715,0.000045113793],"about_ca_topic_score_codex":0.0004879136,"about_ca_topic_score_gemma":0.000736305,"teacher_disagreement_score":0.0059860926,"about_ca_system_score_codex":0.0007540186,"about_ca_system_score_gemma":0.0010234227,"threshold_uncertainty_score":0.020025492},"labels":[],"label_agreement":null},{"id":"W3151244505","doi":"","title":"Trees with the second and third largest number of maximum independent sets.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Statistics","score_opus":0.017541912431659378,"score_gpt":0.2757287504529915,"score_spread":0.25818683802133213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3151244505","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4060585,0.004458025,0.3671485,0.0076204864,0.00096581486,0.0003226558,0.01623516,0.0027664818,0.19442447],"genre_scores_gemma":[0.8249084,0.0012160669,0.13444877,0.0010893904,0.00050786353,0.00027602637,0.0061514326,0.0005136862,0.030888397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990896,0.00018661673,0.000050477203,0.00019798109,0.00023347703,0.00024191744],"domain_scores_gemma":[0.992312,0.0042271097,0.0008193517,0.0011139229,0.0006896718,0.0008380336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007123543,0.00050108304,0.0009303081,0.0014582964,0.002148665,0.0032986766,0.0013210954,0.0020308304,0.01167824],"category_scores_gemma":[0.0090679675,0.0007481413,0.0011121643,0.0018878604,0.0011448152,0.0034882345,0.0014605318,0.0021900628,0.0030683444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006109823,0.00022579047,0.0047160783,0.00055518793,0.00014842083,0.0011175978,0.00052347424,0.00989285,0.019372635,0.82926124,0.06566454,0.06791117],"study_design_scores_gemma":[0.000096462834,0.000060768125,0.004118532,0.00011937204,0.00013346408,0.0026876016,0.00024021635,0.022981733,0.009014555,0.9242321,0.03627244,0.000042666394],"about_ca_topic_score_codex":0.00088449003,"about_ca_topic_score_gemma":0.0021798613,"teacher_disagreement_score":0.01167824,"about_ca_system_score_codex":0.0011574555,"about_ca_system_score_gemma":0.001325396,"threshold_uncertainty_score":0.039067626},"labels":[],"label_agreement":null},{"id":"W31595256","doi":"10.1016/j.pbj.0000000000000030","title":"Clique graphs of Helly circular arc graphs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chordal graph; Clique-sum; Combinatorics; Indifference graph; Mathematics; Split graph; Block graph; Cograph; Treewidth; Trapezoid graph; Interval graph; Pathwidth; Discrete mathematics; Clique graph; Clique problem; 1-planar graph; Graph; Line graph","score_opus":0.016661615856261584,"score_gpt":0.27487472912401456,"score_spread":0.258213113267753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W31595256","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57901037,0.0025304786,0.280334,0.006552592,0.0007017677,0.0006542067,0.004349478,0.0009623868,0.124904685],"genre_scores_gemma":[0.92057693,0.001155665,0.049976643,0.0009089458,0.00024952617,0.00022872273,0.0021383637,0.0001678212,0.024597306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991111,0.0003316617,0.00003923354,0.00018905375,0.00016524587,0.00016372991],"domain_scores_gemma":[0.9931137,0.0040418063,0.0011659986,0.00075359346,0.00041263952,0.0005123329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006606678,0.0004525408,0.00036775536,0.0014076729,0.0023632273,0.0013049168,0.0010242957,0.0009870558,0.0122107435],"category_scores_gemma":[0.0042368528,0.00047540796,0.000641281,0.0014250402,0.0012923139,0.003079987,0.0011792914,0.0011189225,0.0010587712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004592644,0.00016634786,0.0048731244,0.00055714115,0.000151702,0.0020213965,0.0013192657,0.0137399845,0.0082291765,0.9084981,0.018821198,0.04116323],"study_design_scores_gemma":[0.000079713725,0.000065594795,0.0034414353,0.00006957902,0.000093325434,0.0018738392,0.0006455285,0.036110792,0.003764708,0.91905487,0.03475196,0.00004870916],"about_ca_topic_score_codex":0.0025523908,"about_ca_topic_score_gemma":0.003964606,"teacher_disagreement_score":0.0122107435,"about_ca_system_score_codex":0.0010723068,"about_ca_system_score_gemma":0.00062242115,"threshold_uncertainty_score":0.04084903},"labels":[],"label_agreement":null},{"id":"W31786110","doi":"10.1016/j.purol.2019.09.010","title":"On Graphs with Strong a-valuations.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.021920382205357664,"score_gpt":0.29964358799455476,"score_spread":0.27772320578919707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W31786110","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13442825,0.007503683,0.34844142,0.0082139755,0.0013802965,0.00013555803,0.001369728,0.00062291604,0.49790418],"genre_scores_gemma":[0.8387133,0.0044770846,0.062674105,0.0025529638,0.001079633,0.00017119866,0.0012372164,0.00025873783,0.088835806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989336,0.00038168704,0.00006355138,0.00022700596,0.0001827863,0.00021133026],"domain_scores_gemma":[0.99713767,0.001292803,0.00029506223,0.00045385028,0.00037128548,0.0004493287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012980847,0.0008026983,0.0006871524,0.0024861146,0.002640456,0.0031952278,0.00088669325,0.0016103627,0.01209079],"category_scores_gemma":[0.0029395795,0.000545346,0.0013097522,0.0018602207,0.0041761617,0.009314839,0.0041365013,0.0035004949,0.0023654352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016376654,0.000010409824,0.000168984,0.000037559323,0.000008065035,0.00006221965,0.00011194476,0.00031550232,0.0003476566,0.9938181,0.0018486608,0.0032545738],"study_design_scores_gemma":[0.0000056997897,0.0000089199475,0.0001912352,0.000021702142,0.000007854413,0.00012374422,0.000080324164,0.00095906237,0.00017416448,0.9928953,0.0055267443,0.000005358364],"about_ca_topic_score_codex":0.0014366317,"about_ca_topic_score_gemma":0.0020662055,"teacher_disagreement_score":0.01209079,"about_ca_system_score_codex":0.0013123663,"about_ca_system_score_gemma":0.00065139704,"threshold_uncertainty_score":0.04044777},"labels":[],"label_agreement":null},{"id":"W3192563145","doi":"","title":"(2k+1)-辺連結グラフにおいて与えられた頂点を連結する2つの経路","year":2005,"lang":"ja","type":"article","venue":"Ars Combinatoria","topic":"Military Technology and Strategies","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.00767923371065386,"score_gpt":0.21060156039251102,"score_spread":0.20292232668185717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3192563145","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14199014,0.0011887508,0.096976444,0.0058306796,0.0033192078,0.00026978742,0.0031559684,0.0015407159,0.7457284],"genre_scores_gemma":[0.55697256,0.0009937979,0.046494693,0.0017267207,0.00075993716,0.0002511519,0.002412443,0.000923613,0.3894652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983467,0.00024945682,0.00011815001,0.00034349665,0.0004064881,0.0005355922],"domain_scores_gemma":[0.99847287,0.0003110798,0.00017484745,0.00037849837,0.0004496563,0.00021296604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007084025,0.0011514243,0.00095733727,0.0019502373,0.002967186,0.005654667,0.0018665637,0.0015153375,0.059819307],"category_scores_gemma":[0.0019200213,0.0004993484,0.0011596058,0.0015587868,0.0028276825,0.0053519653,0.0034781464,0.0028451628,0.021716036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026741836,0.0001187982,0.001156874,0.00038321508,0.000054014243,0.00052095234,0.00050294935,0.0010757736,0.006502035,0.904723,0.026921967,0.05777311],"study_design_scores_gemma":[0.00005911276,0.000084242434,0.0019396725,0.00007584585,0.000059761158,0.001870695,0.0005513222,0.0037163866,0.006683949,0.85581315,0.12905388,0.00009201642],"about_ca_topic_score_codex":0.0010926083,"about_ca_topic_score_gemma":0.0018547527,"teacher_disagreement_score":0.059819307,"about_ca_system_score_codex":0.0019282758,"about_ca_system_score_gemma":0.000841456,"threshold_uncertainty_score":0.2001155},"labels":[],"label_agreement":null},{"id":"W3199746871","doi":"","title":"Gray Codes for AT-Free Orders","year":2021,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Gray (unit); Gray code; Arithmetic; Algorithm; Medicine","score_opus":0.011691373019040696,"score_gpt":0.23394766561978073,"score_spread":0.22225629260074004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199746871","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44326466,0.0024552133,0.2694514,0.0065753055,0.0010530323,0.00016776152,0.001555155,0.0010903762,0.2743872],"genre_scores_gemma":[0.91212314,0.0011629157,0.021634802,0.0011077218,0.0005988581,0.00012896922,0.00048284858,0.000292853,0.062467914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903935,0.0001857852,0.000045516637,0.00012104559,0.00035029778,0.00025807178],"domain_scores_gemma":[0.99716705,0.0013701667,0.00031849628,0.0004925645,0.0003318097,0.00032003174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080865895,0.0008597235,0.0010280748,0.002771776,0.0019649009,0.0039313403,0.0011235195,0.0013998363,0.011959193],"category_scores_gemma":[0.0036785405,0.00045221543,0.00082562293,0.002386686,0.0036023466,0.0044412585,0.002317631,0.0033823461,0.0020816827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023614592,0.000008608389,0.000052093175,0.000012854824,0.0000020725174,0.000026880558,0.0000655762,0.0007215532,0.00028405274,0.99511755,0.00096165953,0.0027232887],"study_design_scores_gemma":[0.0000074571326,0.000005297762,0.00004558339,0.000008092109,0.000003056143,0.000026057607,0.000015470161,0.0023191217,0.0002469673,0.99552,0.0017950083,0.000007860574],"about_ca_topic_score_codex":0.0020058174,"about_ca_topic_score_gemma":0.0018567108,"teacher_disagreement_score":0.011959193,"about_ca_system_score_codex":0.0024521751,"about_ca_system_score_gemma":0.0013174207,"threshold_uncertainty_score":0.040007472},"labels":[],"label_agreement":null},{"id":"W3214813422","doi":"10.61091/ars163-02","title":"On the circuits of splitting matroids representable over GF(p)","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Matroid; Electronic circuit; Combinatorics; Arithmetic; Mathematics; Graphic matroid; Computer science; Discrete mathematics; Theoretical computer science; Engineering; Electrical engineering","score_opus":0.010047099580994947,"score_gpt":0.24210190770688347,"score_spread":0.23205480812588852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3214813422","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68542194,0.0006142939,0.23985386,0.00062592875,0.00006908965,0.0001325031,0.0011508381,0.00034627927,0.07178521],"genre_scores_gemma":[0.92463726,0.0007811621,0.053274807,0.00022790463,0.00016352262,0.00011915565,0.0018075584,0.0001312188,0.018857386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996593,0.000042622964,0.000014042378,0.00011636906,0.000096520365,0.000071137285],"domain_scores_gemma":[0.99921274,0.00034054142,0.0001647035,0.00008876016,0.00009718544,0.00009594773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020713956,0.0006148976,0.00028744928,0.00068684336,0.00050376036,0.0013502518,0.00074343395,0.00050098705,0.0069582155],"category_scores_gemma":[0.0012723301,0.00025255463,0.00045734315,0.0010229957,0.00095488405,0.0025256877,0.00088426546,0.0011824955,0.000537992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019346645,0.000103291284,0.0011554563,0.0001591281,0.000019202633,0.00030322943,0.0004879684,0.022049816,0.015610626,0.8955014,0.003094647,0.061321687],"study_design_scores_gemma":[0.00005696314,0.0002313809,0.00281931,0.00008045503,0.00003982642,0.0008664368,0.0003673078,0.096659146,0.015229315,0.86385745,0.019750597,0.000041747044],"about_ca_topic_score_codex":0.00125166,"about_ca_topic_score_gemma":0.0017521665,"teacher_disagreement_score":0.0069582155,"about_ca_system_score_codex":0.0011202482,"about_ca_system_score_gemma":0.00031648696,"threshold_uncertainty_score":0.02327758},"labels":[],"label_agreement":null},{"id":"W3225683","doi":"10.1111/j.1552-6909.1988.tb00454.x","title":"Sp-Sets with Multiplier p.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Multiplier (economics); Mathematics; Arithmetic; Economics; Keynesian economics","score_opus":0.00623970409345416,"score_gpt":0.1896039206715281,"score_spread":0.18336421657807395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3225683","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21517639,0.0013906123,0.5492573,0.0040852847,0.0009457484,0.00050683494,0.0048680613,0.0013219123,0.22244789],"genre_scores_gemma":[0.71986496,0.0010929023,0.17752194,0.0008101106,0.00056050805,0.0007925529,0.0033371572,0.00036714348,0.09565268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985355,0.00035698613,0.00012234344,0.00038669223,0.00034020416,0.00025824833],"domain_scores_gemma":[0.99580634,0.0019823823,0.00048344885,0.0006442739,0.00070109,0.0003823695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013166757,0.00070808554,0.00081446866,0.0021718226,0.0025001003,0.002801765,0.0009918535,0.0010551553,0.027538342],"category_scores_gemma":[0.006094713,0.00047783725,0.0010099525,0.0018602401,0.0019512074,0.0029058687,0.002579747,0.0020373557,0.005197367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023605545,0.0000785904,0.0010989408,0.0001873308,0.00006880044,0.00027374923,0.00029754132,0.0046127695,0.0025617129,0.93698347,0.009555908,0.044045024],"study_design_scores_gemma":[0.000053971704,0.00011682228,0.0008803626,0.0000389162,0.000030900137,0.00055373966,0.0001696923,0.017688846,0.0020939051,0.9504436,0.02789868,0.000030605042],"about_ca_topic_score_codex":0.001210171,"about_ca_topic_score_gemma":0.0015108285,"teacher_disagreement_score":0.027538342,"about_ca_system_score_codex":0.0015139788,"about_ca_system_score_gemma":0.0012393496,"threshold_uncertainty_score":0.09212488},"labels":[],"label_agreement":null},{"id":"W32355936","doi":"10.1039/d0ob00617c","title":"Spanning Trees Orthogonal to One-Factorizations of K 2n .","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Key Research and Development Program of China; Chinese Academy of Sciences; National Natural Science Foundation of China","keywords":"Mathematics; Spanning tree; Combinatorics","score_opus":0.009432520135238544,"score_gpt":0.20343251724879927,"score_spread":0.19399999711356072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W32355936","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1994796,0.0014040158,0.72133636,0.0013554548,0.00041192575,0.00028672765,0.0020062558,0.00094979635,0.072770014],"genre_scores_gemma":[0.7262332,0.0017150636,0.22332692,0.00045771003,0.00023879624,0.00030629165,0.003273751,0.00034389543,0.044104297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995654,0.00009667776,0.00003177016,0.00012538122,0.00008300687,0.00009762613],"domain_scores_gemma":[0.9990144,0.00040670994,0.00017912184,0.00015254562,0.00012921449,0.00011799846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039859535,0.0005070831,0.0003697782,0.0008663458,0.0007357422,0.0010475751,0.0004376935,0.00041414713,0.012516628],"category_scores_gemma":[0.0022061057,0.00021988167,0.0004532702,0.0007987619,0.00068687374,0.0012838555,0.00078257325,0.00080271286,0.0027920003],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024364096,0.00012585257,0.0009977835,0.0004133534,0.000051836967,0.00026961396,0.0003919259,0.021831032,0.015942698,0.76988006,0.015117977,0.17473422],"study_design_scores_gemma":[0.00004792106,0.0001145985,0.0008896714,0.00005759034,0.00002232542,0.00043892616,0.00015323833,0.052847117,0.0033943325,0.9071076,0.03490063,0.00002602798],"about_ca_topic_score_codex":0.00089745864,"about_ca_topic_score_gemma":0.0018676007,"teacher_disagreement_score":0.012516628,"about_ca_system_score_codex":0.00073150825,"about_ca_system_score_gemma":0.00053059525,"threshold_uncertainty_score":0.041872263},"labels":[],"label_agreement":null},{"id":"W326312060","doi":"","title":"On constrained 2-Partitions of monochromatic sets and generalizations in the sense of Erdos-Ginzburg-Ziv.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Monochromatic color; Mathematics; Combinatorics; Sense (electronics); Physics; Chemistry; Optics","score_opus":0.0150296317507517,"score_gpt":0.2522213373162421,"score_spread":0.23719170556549038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W326312060","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3697561,0.0059301145,0.46560904,0.0035438186,0.0006682927,0.00021556021,0.0017143603,0.00036129163,0.15220146],"genre_scores_gemma":[0.9118742,0.0025358489,0.06101962,0.0010855293,0.0006576798,0.000275664,0.0012684087,0.00020961872,0.021073524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900585,0.00031799029,0.000058494414,0.00022113089,0.00021462483,0.00018193948],"domain_scores_gemma":[0.99798596,0.00091302267,0.00032021027,0.00036093808,0.00018951666,0.0002303438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013982088,0.00070182484,0.0010126748,0.002163977,0.0021951036,0.0032804452,0.0013120028,0.0012610747,0.009383796],"category_scores_gemma":[0.006309771,0.0005441181,0.00082501024,0.0030101058,0.0028900427,0.008786947,0.0036242895,0.002167163,0.0010178898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017386636,0.000005823832,0.000117196214,0.000021791615,0.000004333513,0.000031703647,0.00010990243,0.00093140895,0.00017821767,0.9941508,0.0010394057,0.0033918985],"study_design_scores_gemma":[0.000006649162,0.000005872892,0.000184086,0.00001673277,0.000003952907,0.000062472536,0.000070984686,0.0035291233,0.000093092865,0.9934269,0.0025918114,0.000008271315],"about_ca_topic_score_codex":0.0016796299,"about_ca_topic_score_gemma":0.0019763233,"teacher_disagreement_score":0.009383796,"about_ca_system_score_codex":0.0013087577,"about_ca_system_score_gemma":0.0006145911,"threshold_uncertainty_score":0.03139192},"labels":[],"label_agreement":null},{"id":"W327581366","doi":"","title":"Erratum: a little emendation to the graceful labelling of the Generalized Petersen Graph P8t, 3 when t = 5.","year":2007,"lang":"en","type":"erratum","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Labelling; Mathematics; Graph; Combinatorics; Chemistry; Biochemistry","score_opus":0.017010267011709417,"score_gpt":0.2417993118362034,"score_spread":0.224789044824494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W327581366","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043313325,0.0020374686,0.0020050497,0.108902305,0.8689964,0.00002791356,0.0007091796,0.00045623118,0.016432324],"genre_scores_gemma":[0.024961788,0.015339621,0.014813693,0.2752327,0.31507242,0.0002072199,0.0040405635,0.0026251182,0.34770688],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99776244,0.0003673337,0.0002968032,0.00035297702,0.0009743206,0.0002461132],"domain_scores_gemma":[0.9930339,0.0022014496,0.00048523294,0.0007683122,0.002996834,0.0005142915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019396603,0.0018059355,0.0012163144,0.0027028401,0.0043121874,0.0026543026,0.003958429,0.005699421,0.03555329],"category_scores_gemma":[0.024883334,0.001095716,0.0012880554,0.002526494,0.003702791,0.0043349336,0.0017507251,0.009624131,0.02561044],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025565008,0.0000071021873,0.00002429294,0.000057216912,0.000004803101,0.00012978105,0.000019959232,0.000047673257,0.000044794662,0.0027446314,0.9926804,0.0042137555],"study_design_scores_gemma":[0.000025198753,0.000031774834,0.00043731445,0.00019050435,0.000025322432,0.0005655387,0.00009577863,0.0002914323,0.0004261753,0.011232459,0.98663425,0.00004435672],"about_ca_topic_score_codex":0.0077392426,"about_ca_topic_score_gemma":0.010777097,"teacher_disagreement_score":0.03555329,"about_ca_system_score_codex":0.003692541,"about_ca_system_score_gemma":0.0021081453,"threshold_uncertainty_score":0.11893767},"labels":[],"label_agreement":null},{"id":"W33126347","doi":"10.1097/md.0000000000022910","title":"Generalized Index of Boolean Matrices.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Computer science","score_opus":0.009065880315117573,"score_gpt":0.23158043235767972,"score_spread":0.22251455204256215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W33126347","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24750973,0.004057254,0.35439956,0.0042768,0.0023146437,0.00027777764,0.003053812,0.00092821085,0.38318223],"genre_scores_gemma":[0.8953813,0.0014839952,0.051228106,0.0013242122,0.001006274,0.00021007723,0.0011296301,0.00017838224,0.04805794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987747,0.00021284238,0.00011515256,0.00023597619,0.00044138113,0.00022000395],"domain_scores_gemma":[0.99784267,0.0006072137,0.00045357188,0.000293732,0.0005222156,0.000280606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007063615,0.0006274409,0.0005864165,0.0024297093,0.000974702,0.0031530736,0.00065287156,0.0006918883,0.016416617],"category_scores_gemma":[0.0035774526,0.00020484532,0.0006246,0.0014609979,0.0013009716,0.0035266127,0.0015594956,0.0014104996,0.0029040303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054904875,0.000021911896,0.0002547898,0.00008494253,0.000013478367,0.00009365777,0.000101026366,0.0006412761,0.0021249894,0.9789796,0.0035161544,0.014113203],"study_design_scores_gemma":[0.000013478127,0.000032750864,0.00043218056,0.000020132782,0.000010236226,0.0003648597,0.000039220125,0.00649933,0.0014996541,0.9811886,0.009875189,0.000024481731],"about_ca_topic_score_codex":0.0008753864,"about_ca_topic_score_gemma":0.0013390885,"teacher_disagreement_score":0.016416617,"about_ca_system_score_codex":0.0015729376,"about_ca_system_score_gemma":0.0006440731,"threshold_uncertainty_score":0.054919004},"labels":[],"label_agreement":null},{"id":"W33743767","doi":"10.1186/s13019-021-01418-w","title":"New Sufficient Conditions for s-Hamiltonian Graphs and s-Hamiltonian Connected Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Hamiltonian (control theory); Hamiltonian path; Graph; Connectivity; Pancyclic graph; Discrete mathematics; Line graph; 1-planar graph","score_opus":0.020367679419616945,"score_gpt":0.2765313554340319,"score_spread":0.256163676014415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W33743767","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14424746,0.003580943,0.6222993,0.009892143,0.0030869467,0.0013878057,0.013779784,0.0023857737,0.19933976],"genre_scores_gemma":[0.7560555,0.0035724377,0.19706881,0.0030420327,0.0023454383,0.0018329584,0.013145937,0.0006475678,0.022289297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860954,0.0003555943,0.0001490625,0.00033276854,0.0002930095,0.00026007276],"domain_scores_gemma":[0.98511654,0.00866257,0.0014917807,0.00083141273,0.002185667,0.0017120128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019352086,0.0011973281,0.0011473262,0.003672521,0.002141282,0.0020485031,0.0019672222,0.0026136492,0.0277718],"category_scores_gemma":[0.015036773,0.00095123285,0.0020412013,0.0020192368,0.0026904421,0.0063715144,0.0028491945,0.004527441,0.0040556244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000275241,0.0002548974,0.0028344656,0.00072063715,0.0000845236,0.0021970377,0.0006904898,0.008380359,0.009298705,0.92211974,0.030470952,0.022672942],"study_design_scores_gemma":[0.00018084019,0.00015307436,0.0025570465,0.00021235576,0.00009963617,0.0016297463,0.00086730596,0.035520326,0.0034011723,0.92345035,0.03179633,0.00013176743],"about_ca_topic_score_codex":0.0021241747,"about_ca_topic_score_gemma":0.0041220556,"teacher_disagreement_score":0.0277718,"about_ca_system_score_codex":0.0014556638,"about_ca_system_score_gemma":0.0020204931,"threshold_uncertainty_score":0.09290594},"labels":[],"label_agreement":null},{"id":"W339857704","doi":"","title":"There are binary circular cube-free words of length n contained within the Thue-Morse word for all positive integers n.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Word (group theory); Morse code; Binary number; Cube (algebra); Combinatorics; Word length; Discrete mathematics; Arithmetic; Geometry; Computer science; Natural language processing; Telecommunications","score_opus":0.01057388134700569,"score_gpt":0.23592382872048187,"score_spread":0.2253499473734762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W339857704","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7030596,0.004578167,0.0850273,0.0019666879,0.00066086964,0.00012417107,0.00210325,0.00092049997,0.20155941],"genre_scores_gemma":[0.90692496,0.0015724229,0.040429056,0.0006186096,0.00019380322,0.00035643997,0.0020014588,0.0001501021,0.047753118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996141,0.000066006454,0.000034100376,0.00009373871,0.00008925879,0.00010272517],"domain_scores_gemma":[0.9980008,0.0010641107,0.0003720927,0.00013723502,0.00022486987,0.0002007998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029462774,0.00059148145,0.00053977413,0.0008290266,0.001982516,0.001983489,0.00054916297,0.0011362253,0.012499989],"category_scores_gemma":[0.0022476024,0.0004925583,0.00043516303,0.0010849491,0.0013420032,0.0027055268,0.0018557681,0.0008728681,0.0041605346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015452006,0.0001621658,0.0039926358,0.0009313497,0.00005230213,0.0026863304,0.0022580037,0.0020880143,0.03596422,0.8484069,0.011808706,0.090104245],"study_design_scores_gemma":[0.00011289116,0.0002314376,0.005169965,0.00024130118,0.000070138456,0.0029831112,0.0017662165,0.008339949,0.04208552,0.8730813,0.06572222,0.00019583367],"about_ca_topic_score_codex":0.00085806457,"about_ca_topic_score_gemma":0.0013720219,"teacher_disagreement_score":0.012499989,"about_ca_system_score_codex":0.0006352415,"about_ca_system_score_gemma":0.000796067,"threshold_uncertainty_score":0.04181665},"labels":[],"label_agreement":null},{"id":"W34358114","doi":"10.3390/ph14070688","title":"Face antimagic labelings of plane graphs Pba.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Narodowe Centrum Nauki","keywords":"Mathematics; Combinatorics; Plane (geometry); Geometry","score_opus":0.007376999723166518,"score_gpt":0.20877792333908377,"score_spread":0.20140092361591724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W34358114","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84902644,0.01109449,0.06347924,0.00068874867,0.00042993188,0.00025589863,0.0010949136,0.000734962,0.073195405],"genre_scores_gemma":[0.937785,0.004078004,0.030023012,0.00034110114,0.000057729863,0.0001441349,0.0010820588,0.00010565197,0.026383277],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998988,0.000018186596,0.0000043684645,0.000030412004,0.000025323117,0.000022961702],"domain_scores_gemma":[0.99994576,0.000008410959,0.000015515303,0.000008771222,0.000012650969,0.000008893509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010051884,0.00036473747,0.00012601484,0.00031234353,0.00019580273,0.00022565956,0.00022618838,0.00036622718,0.006376666],"category_scores_gemma":[0.00012918573,0.00013335476,0.00016643966,0.00024053207,0.00014455068,0.00022311133,0.00025934906,0.0004464424,0.0020763157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011856526,0.00002019185,0.00014307498,0.00010885889,0.000009853436,0.00009443665,0.000023905575,0.00018024658,0.98631835,0.0016912903,0.0004554747,0.010835727],"study_design_scores_gemma":[0.0000117347545,0.00022206947,0.0005726346,0.0000115641005,0.000013816321,0.00018999483,0.000018985651,0.0010247492,0.9733193,0.00021949317,0.02438973,0.0000059042077],"about_ca_topic_score_codex":0.00053994695,"about_ca_topic_score_gemma":0.0008521662,"teacher_disagreement_score":0.006376666,"about_ca_system_score_codex":0.00025326211,"about_ca_system_score_gemma":0.00016995714,"threshold_uncertainty_score":0.021332026},"labels":[],"label_agreement":null},{"id":"W34543125","doi":"","title":"On Some Conjectures by Rabinowitz.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.005757502094319035,"score_gpt":0.21253766055134513,"score_spread":0.2067801584570261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W34543125","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027655922,0.035306826,0.12676026,0.38463685,0.015726777,0.00011690063,0.0010548821,0.0009654314,0.40777615],"genre_scores_gemma":[0.67248523,0.036880717,0.06389998,0.06773337,0.03059476,0.0005570896,0.0022860775,0.0010050437,0.12455775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978225,0.00093193055,0.000094722986,0.0004016845,0.0005239581,0.00022519194],"domain_scores_gemma":[0.9819717,0.014176103,0.0003805669,0.0016664828,0.001350614,0.0004544749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052865343,0.0009776317,0.0011556008,0.0018808607,0.004040919,0.0045177955,0.0020865481,0.0039772424,0.018848572],"category_scores_gemma":[0.025343852,0.0006321405,0.0012282343,0.003322385,0.010218729,0.01965113,0.0043442356,0.009375343,0.0043502003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052343792,0.0000370983,0.00021740739,0.000098012344,0.000014612191,0.00007126553,0.00027719294,0.0009009821,0.00006579554,0.9303665,0.059606254,0.008292498],"study_design_scores_gemma":[0.000015004427,0.000006911288,0.00012098431,0.00004005862,0.0000056342265,0.000033769564,0.00006252113,0.00074399926,0.00006597845,0.97872263,0.020174677,0.000007969499],"about_ca_topic_score_codex":0.0030016848,"about_ca_topic_score_gemma":0.0024451518,"teacher_disagreement_score":0.018848572,"about_ca_system_score_codex":0.0028794678,"about_ca_system_score_gemma":0.0014299776,"threshold_uncertainty_score":0.06305474},"labels":[],"label_agreement":null},{"id":"W3469504","doi":"","title":"Constructing families of highly similar but non-isomorphic tournaments.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.055067777851644864,"score_gpt":0.338224176091208,"score_spread":0.2831563982395631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3469504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4497156,0.0008830514,0.50182194,0.00079773634,0.00018084193,0.00025100907,0.00063575007,0.00067395554,0.045040082],"genre_scores_gemma":[0.85358256,0.00035419068,0.13570073,0.00020775599,0.00007852853,0.00021793932,0.0012801178,0.00013881487,0.0084393965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850345,0.0005963823,0.00007594792,0.0003314448,0.00025386183,0.00023887331],"domain_scores_gemma":[0.99398464,0.0037404269,0.0005410945,0.001085888,0.0002658747,0.00038211868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014620883,0.00045503385,0.0006937912,0.0012610664,0.001501471,0.001984044,0.0017841749,0.0011757234,0.007764664],"category_scores_gemma":[0.010860526,0.00069662486,0.0013884605,0.0017811271,0.0010912103,0.00232021,0.0020102686,0.001336364,0.0006941913],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005147564,0.0004255597,0.0069248965,0.00035453506,0.00032362994,0.0010601301,0.0011017277,0.09031014,0.009538251,0.72584933,0.013137816,0.15045919],"study_design_scores_gemma":[0.00016855221,0.0002481916,0.002576,0.00007890924,0.00015112151,0.0013055928,0.0005782366,0.19840625,0.004504411,0.77409726,0.017830098,0.00005540269],"about_ca_topic_score_codex":0.0009628972,"about_ca_topic_score_gemma":0.0010726429,"teacher_disagreement_score":0.007764664,"about_ca_system_score_codex":0.0009887184,"about_ca_system_score_gemma":0.0005722795,"threshold_uncertainty_score":0.025975406},"labels":[],"label_agreement":null},{"id":"W3484787","doi":"","title":"Graph designs for eight graphs with six vertices and eight edges (index >1).","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics","score_opus":0.014421072735930126,"score_gpt":0.19427767105891255,"score_spread":0.17985659832298242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3484787","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39298373,0.0011753856,0.3724529,0.0013281432,0.00069977954,0.0006810873,0.0028672274,0.0015699458,0.22624178],"genre_scores_gemma":[0.78428787,0.00042248573,0.1802923,0.00024074758,0.000050016657,0.00037167218,0.0008873035,0.000074908516,0.033372723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964285,0.00012090349,0.000018730532,0.00006781126,0.000076147284,0.00007359888],"domain_scores_gemma":[0.99936444,0.0001916052,0.0000803089,0.00016495865,0.00013596888,0.00006279069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046254447,0.00046275175,0.00025356267,0.0006351413,0.0007901058,0.0007887227,0.00065082335,0.0007510397,0.022403808],"category_scores_gemma":[0.001408509,0.00020987629,0.00031188765,0.0005266394,0.00050331256,0.0007823559,0.0005129681,0.00045739417,0.0028700433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001521518,0.00034324417,0.0019173813,0.00084323547,0.0001228669,0.0008588588,0.00040164115,0.0455565,0.06765571,0.6587025,0.029918384,0.19215816],"study_design_scores_gemma":[0.00062044366,0.0012249782,0.002599159,0.00028523742,0.00019109451,0.001374413,0.0005481914,0.11126916,0.05714794,0.6513003,0.1732815,0.00015762827],"about_ca_topic_score_codex":0.00062529003,"about_ca_topic_score_gemma":0.0018245999,"teacher_disagreement_score":0.022403808,"about_ca_system_score_codex":0.000681375,"about_ca_system_score_gemma":0.000541271,"threshold_uncertainty_score":0.07494819},"labels":[],"label_agreement":null},{"id":"W34914328","doi":"","title":"Maximally local-edge-connected graphs and digraphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Computer science; Telecommunications","score_opus":0.010867030066820205,"score_gpt":0.24752762622162705,"score_spread":0.23666059615480683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W34914328","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36158532,0.005993418,0.54026467,0.0037531133,0.0005126665,0.0004016416,0.009313504,0.0010277122,0.077148],"genre_scores_gemma":[0.83048916,0.0034943058,0.13765603,0.0009629483,0.0003099884,0.00032064144,0.0059370035,0.00012543946,0.020704513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995141,0.0001560801,0.000030417066,0.00019345173,0.00005316707,0.000052824915],"domain_scores_gemma":[0.9982804,0.0008151468,0.00035914461,0.00023263806,0.000121017445,0.00019168651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044167772,0.0005267386,0.0004192015,0.0021913024,0.001095427,0.0011514429,0.00082119764,0.000850541,0.005966468],"category_scores_gemma":[0.0023021246,0.00027787304,0.00053116324,0.0021303683,0.0010756708,0.0023076828,0.0008801651,0.00078172056,0.0009894642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022341768,0.00011370843,0.005051961,0.00082777126,0.00020350367,0.0012900991,0.0006799693,0.017428689,0.006136766,0.87099856,0.0118539175,0.08519163],"study_design_scores_gemma":[0.00004057686,0.00008922539,0.004040333,0.00013391327,0.00012971944,0.0017985287,0.0003581901,0.030820942,0.0017764448,0.9158154,0.044951666,0.0000451015],"about_ca_topic_score_codex":0.0011969637,"about_ca_topic_score_gemma":0.002278296,"teacher_disagreement_score":0.005966468,"about_ca_system_score_codex":0.00069250836,"about_ca_system_score_gemma":0.0003923263,"threshold_uncertainty_score":0.019959807},"labels":[],"label_agreement":null},{"id":"W34988218","doi":"10.1183/23120541.00511-2021","title":"Extremal Size In Graphs With Bounded Degree.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"European and Developing Countries Clinical Trials Partnership","keywords":"Mathematics; Degree (music); Bounded function; Combinatorics; Mathematical analysis","score_opus":0.016480262883457268,"score_gpt":0.2541906489632152,"score_spread":0.23771038607975792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W34988218","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52978784,0.005507844,0.3346921,0.013129196,0.0007522757,0.0001645614,0.0073414007,0.0032079362,0.10541693],"genre_scores_gemma":[0.95476085,0.0012152181,0.030343644,0.0011114419,0.00045647883,0.00019080387,0.0017730523,0.0007472247,0.009401212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982608,0.0005068836,0.00006566355,0.00050502206,0.0002938778,0.0003676939],"domain_scores_gemma":[0.9808158,0.013951719,0.001517169,0.0016475766,0.00062753074,0.001440133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017759384,0.00059754774,0.0012251023,0.0026454334,0.0017250084,0.0028132978,0.0023951204,0.0016729797,0.012178152],"category_scores_gemma":[0.016376426,0.00066981826,0.0010121703,0.0013054892,0.0026589911,0.0067306804,0.0028086638,0.0024002586,0.0011595191],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038617876,0.00006431851,0.0038105717,0.0004962323,0.000080193306,0.00036231737,0.000487809,0.01729424,0.005028411,0.9309307,0.023216536,0.01784244],"study_design_scores_gemma":[0.000040006453,0.00003110525,0.0016955356,0.00007933246,0.00004814736,0.00039664336,0.00016106312,0.056674898,0.00220024,0.93210155,0.0065389206,0.00003256083],"about_ca_topic_score_codex":0.0013574893,"about_ca_topic_score_gemma":0.0020335498,"teacher_disagreement_score":0.012178152,"about_ca_system_score_codex":0.0019201858,"about_ca_system_score_gemma":0.0007423087,"threshold_uncertainty_score":0.040739954},"labels":[],"label_agreement":null},{"id":"W35075569","doi":"10.1007/s00604-022-05173-0","title":"Eccentricity sequences and eccentricity sets in digraphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Research Council of Thailand","keywords":"Digraph; Eccentricity (behavior); Mathematics; Combinatorics; Sequence (biology); Vertex (graph theory); Eccentric; Set (abstract data type); Order (exchange); Discrete mathematics; Physics; Graph; Computer science; Biology","score_opus":0.03507426591244646,"score_gpt":0.283843585084521,"score_spread":0.24876931917207457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W35075569","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37311473,0.0018011847,0.5357464,0.0010759685,0.00033909842,0.00019715454,0.0019213388,0.001115422,0.08468874],"genre_scores_gemma":[0.8127918,0.0010492968,0.15764111,0.00034022745,0.00017240719,0.00017420274,0.001508198,0.000190916,0.026131833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994803,0.00012416685,0.00004307558,0.00018389476,0.00010892641,0.000059576592],"domain_scores_gemma":[0.9978467,0.00084027427,0.00046216714,0.00023448064,0.0003618456,0.0002545001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040713197,0.00040222306,0.0003341177,0.0020114435,0.0008364023,0.0014038513,0.00050074264,0.00069224444,0.007105543],"category_scores_gemma":[0.0034944292,0.00035854717,0.00028099967,0.0015314748,0.0013129034,0.0023599907,0.0009549815,0.0007608225,0.0014049333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023507544,0.00005815795,0.0026932582,0.0002865593,0.000033326956,0.00056176365,0.0007952927,0.011758022,0.017510464,0.8627177,0.0039909575,0.099359475],"study_design_scores_gemma":[0.00003468244,0.00012056167,0.0029942067,0.00010392669,0.000030677373,0.0013463275,0.00047146712,0.06064735,0.011555773,0.8855106,0.037137102,0.000047223257],"about_ca_topic_score_codex":0.000710343,"about_ca_topic_score_gemma":0.0010111309,"teacher_disagreement_score":0.007105543,"about_ca_system_score_codex":0.00089621055,"about_ca_system_score_gemma":0.00033743258,"threshold_uncertainty_score":0.023770392},"labels":[],"label_agreement":null},{"id":"W3526629","doi":"10.1016/0049-3848(86)90145-3","title":"On the Existence of Extended 5-Cycle Systems Having a Prescribed Number of Idempotent Elements.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Idempotence; Idempotent matrix; Pure mathematics; Combinatorics","score_opus":0.01446420584719671,"score_gpt":0.21516381113641753,"score_spread":0.20069960528922082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3526629","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28439713,0.00631553,0.5534664,0.00073052605,0.0010058006,0.0003868961,0.0009277487,0.0012321727,0.15153782],"genre_scores_gemma":[0.84658843,0.0023419715,0.107537925,0.0005209189,0.0001774966,0.000659174,0.0009954934,0.0002382797,0.04094028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994679,0.00013154317,0.00003060126,0.00015399177,0.00011538171,0.00010062064],"domain_scores_gemma":[0.99942005,0.0001794783,0.000085874664,0.00017397758,0.00007559046,0.00006505073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048544403,0.00046589493,0.0003543053,0.00086763164,0.0007893389,0.0012191818,0.0008416264,0.00073586137,0.013168554],"category_scores_gemma":[0.0013523845,0.00028518683,0.00035863987,0.00055686885,0.0013646628,0.0018684595,0.0014043669,0.00063823967,0.0028205467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016571312,0.00005402365,0.00060470303,0.00017239411,0.000027136779,0.00018102395,0.00014707533,0.0044286023,0.023605507,0.93285424,0.0016939531,0.036065504],"study_design_scores_gemma":[0.00010316999,0.00042165013,0.0009356759,0.00009871315,0.000039364884,0.0005294422,0.00011051943,0.019418968,0.032831766,0.78987104,0.1555703,0.00006939247],"about_ca_topic_score_codex":0.00031553075,"about_ca_topic_score_gemma":0.00043632672,"teacher_disagreement_score":0.013168554,"about_ca_system_score_codex":0.00074477564,"about_ca_system_score_gemma":0.00045493717,"threshold_uncertainty_score":0.044053137},"labels":[],"label_agreement":null},{"id":"W35311340","doi":"","title":"The Connectivity of Matching Transformation Graphs of Cubic Bipartite Plane Graphs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Matching (statistics); Transformation (genetics); Combinatorics; Plane (geometry); Graph; Geometry; Statistics; Chemistry","score_opus":0.01160662076294117,"score_gpt":0.22591766938675548,"score_spread":0.2143110486238143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W35311340","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8318694,0.0011415455,0.06656927,0.0029406373,0.000100352154,0.00012254852,0.002169114,0.00038037708,0.09470679],"genre_scores_gemma":[0.98259485,0.0005356086,0.009877952,0.0001835718,0.0000822254,0.00007898999,0.0012303689,0.00008228721,0.0053340886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943143,0.00018774091,0.000025371337,0.00013279439,0.00009537695,0.0001272512],"domain_scores_gemma":[0.99511284,0.0030808947,0.00083438086,0.0003932115,0.00023200696,0.00034664874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041944894,0.00036592354,0.00045904596,0.0016615828,0.0014728205,0.0025040812,0.0011297663,0.0015189514,0.010039054],"category_scores_gemma":[0.006697697,0.00052870205,0.0004235705,0.0018458422,0.001762108,0.004114845,0.0013671448,0.0014500017,0.0008208714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003623288,0.00011268826,0.0047760247,0.0002432266,0.00003257273,0.00030085188,0.0007513465,0.020331066,0.00443323,0.91815233,0.013865178,0.036639035],"study_design_scores_gemma":[0.00007722088,0.000049196773,0.0042334786,0.00006921455,0.000042670727,0.00046165986,0.000728354,0.06613015,0.0029294707,0.9159755,0.009274857,0.000028154609],"about_ca_topic_score_codex":0.0031766032,"about_ca_topic_score_gemma":0.0029410603,"teacher_disagreement_score":0.010039054,"about_ca_system_score_codex":0.0011828993,"about_ca_system_score_gemma":0.00047940938,"threshold_uncertainty_score":0.033584},"labels":[],"label_agreement":null},{"id":"W35341376","doi":"10.1177/00469580221086922","title":"On Connected [k, k+1]-Factors in Claw-Free Graphs.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Fundação de Apoio à Pesquisa do Estado da Paraíba; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Claw; Mathematics; Combinatorics; Biology; Ecology","score_opus":0.023810903285058988,"score_gpt":0.26164254658796327,"score_spread":0.23783164330290427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W35341376","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92761296,0.00112411,0.056975543,0.00061186665,0.00007698971,0.000091511974,0.0013552373,0.0002842466,0.011867607],"genre_scores_gemma":[0.9809136,0.00049714703,0.011444266,0.00011312338,0.000058104222,0.000052531006,0.0014114495,0.00008523152,0.005424563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923706,0.00014790709,0.000037611222,0.000284008,0.00010480494,0.00018860356],"domain_scores_gemma":[0.9944748,0.0024279922,0.0013093696,0.0005221013,0.00040218324,0.0008634445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047752375,0.0007140097,0.0006046339,0.0031996062,0.0019333536,0.0017114092,0.00091427297,0.0008331307,0.008833417],"category_scores_gemma":[0.005346417,0.0004548873,0.00070041005,0.00214395,0.0017482484,0.0027772777,0.0012037376,0.00082307344,0.000989272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014768209,0.00040679422,0.07438716,0.0009875691,0.00041758025,0.0017690981,0.00481069,0.042378455,0.020357754,0.75014365,0.013293334,0.08957107],"study_design_scores_gemma":[0.0000889089,0.00015547773,0.024437092,0.00018083648,0.0001933677,0.0013410198,0.0014708724,0.05760209,0.0035474522,0.89734596,0.013542813,0.00009414674],"about_ca_topic_score_codex":0.0071792467,"about_ca_topic_score_gemma":0.011093097,"teacher_disagreement_score":0.008833417,"about_ca_system_score_codex":0.00084143,"about_ca_system_score_gemma":0.00048007845,"threshold_uncertainty_score":0.029550672},"labels":[],"label_agreement":null},{"id":"W35647878","doi":"","title":"The Ehrenfeucht-Fraisse Game for Paths and Cycles","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.01323359922616632,"score_gpt":0.25845646713267834,"score_spread":0.24522286790651202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W35647878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15492517,0.0018339894,0.6481368,0.008636373,0.00028193984,0.00029170144,0.00090596016,0.00047842108,0.18450963],"genre_scores_gemma":[0.85974395,0.001447552,0.102358215,0.0006151814,0.00017339499,0.00030345836,0.00050487154,0.00016075,0.03469257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963934,0.0016680137,0.00022958287,0.0005173742,0.0006169459,0.00057469576],"domain_scores_gemma":[0.9930587,0.0049951673,0.00027140646,0.00069192075,0.0004082173,0.00057464035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037582635,0.0010589493,0.0021108927,0.0021566614,0.0038450377,0.009563445,0.002443603,0.004529563,0.012383388],"category_scores_gemma":[0.015835578,0.00073002285,0.0017621331,0.00314822,0.0070226807,0.01813125,0.004610091,0.0036985888,0.0011591387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024472674,0.000007994365,0.00006000791,0.000017643166,0.000005177469,0.000026879177,0.00011223781,0.0018113278,0.00005031893,0.9949981,0.0005152474,0.0023706343],"study_design_scores_gemma":[0.0000071246154,0.0000027116005,0.0000144874675,0.0000059780073,0.0000035745982,0.000011954572,0.000034611832,0.004125679,0.000036100508,0.99448276,0.001270706,0.000004286414],"about_ca_topic_score_codex":0.0077577317,"about_ca_topic_score_gemma":0.005581748,"teacher_disagreement_score":0.012383388,"about_ca_system_score_codex":0.00413004,"about_ca_system_score_gemma":0.0025742254,"threshold_uncertainty_score":0.0414266},"labels":[],"label_agreement":null},{"id":"W35665625","doi":"10.1016/j.ejmp.2022.05.017","title":"Acyclic Domination Number and Minimum Degree in 2-Diameter-Critical Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Combinatorics; Physics","score_opus":0.031746575799540606,"score_gpt":0.3052332758681095,"score_spread":0.2734867000685689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W35665625","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68484837,0.0010132565,0.28232527,0.0010467321,0.00007929437,0.000098674864,0.002214244,0.00041047946,0.02796364],"genre_scores_gemma":[0.9552637,0.000456532,0.040323693,0.00007261034,0.000056568995,0.000081495244,0.0006903513,0.00009029275,0.002964754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955744,0.00015841355,0.000018952775,0.00011909552,0.00008044385,0.00006570866],"domain_scores_gemma":[0.99143326,0.00638914,0.0010288744,0.00036940887,0.00041135144,0.0003680218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074898987,0.00038560713,0.00029752072,0.0032154159,0.00094910903,0.0012052113,0.00070994237,0.00058814784,0.004304296],"category_scores_gemma":[0.009301915,0.00033512004,0.00027048122,0.0013000946,0.0009764136,0.0016362781,0.00057086797,0.000479903,0.00039212866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082807336,0.00011975048,0.041648958,0.0008493691,0.00012727852,0.0006416182,0.0013873479,0.26064816,0.028707553,0.55177635,0.011889226,0.10137626],"study_design_scores_gemma":[0.00005441356,0.00008216665,0.016987005,0.00012431204,0.00006683733,0.0009964996,0.00047122326,0.34146667,0.011248439,0.6170477,0.0113978,0.000057024652],"about_ca_topic_score_codex":0.0020911868,"about_ca_topic_score_gemma":0.0037462641,"teacher_disagreement_score":0.004304296,"about_ca_system_score_codex":0.0011235164,"about_ca_system_score_gemma":0.00044249612,"threshold_uncertainty_score":0.01439929},"labels":[],"label_agreement":null},{"id":"W35730211","doi":"10.1177/10600280221105508","title":"Some Formulas for Generalized Stirling Numbers.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematical Inequalities and Applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Stirling engine; Stirling numbers of the first kind; Stirling number; Stirling numbers of the second kind; Applied mathematics; Calculus (dental); Pure mathematics; Thermodynamics; Physics","score_opus":0.07117268403799556,"score_gpt":0.3502821948303073,"score_spread":0.2791095107923117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W35730211","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021425698,0.03142072,0.6099317,0.004681787,0.0068808002,0.00016203053,0.0020168268,0.0006961251,0.3227843],"genre_scores_gemma":[0.3844456,0.028232131,0.44351205,0.004582384,0.005437825,0.00072810287,0.0018582894,0.00092702976,0.13027659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994267,0.00015532316,0.000049091774,0.000090010035,0.0002105946,0.00006820802],"domain_scores_gemma":[0.9990995,0.00041073264,0.00010336157,0.000104176914,0.0002272163,0.00005501336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017180387,0.0014026453,0.0005421907,0.0030177024,0.00056441186,0.0017116814,0.0011638158,0.0008843561,0.01701945],"category_scores_gemma":[0.0046825157,0.000321818,0.0009386748,0.0019624084,0.001184174,0.0030290298,0.0012858846,0.0028629438,0.0061832573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003007627,0.0000133678295,0.00009643572,0.00016732888,0.000010181548,0.00006994483,0.00011151684,0.0010255064,0.00083728455,0.95150024,0.010277505,0.03586055],"study_design_scores_gemma":[0.000012572947,0.000040920364,0.0002824671,0.00010211683,0.000017581193,0.00029040288,0.00004688953,0.011692529,0.0009829424,0.91912574,0.06737398,0.000031937147],"about_ca_topic_score_codex":0.00078292267,"about_ca_topic_score_gemma":0.001489972,"teacher_disagreement_score":0.01701945,"about_ca_system_score_codex":0.0012255885,"about_ca_system_score_gemma":0.0005567407,"threshold_uncertainty_score":0.056935728},"labels":[],"label_agreement":null},{"id":"W35857846","doi":"10.1126/sciadv.abo4459","title":"Total Perfect Codes in Tensor Products of Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Institute of General Medical Sciences; National Institute on Aging","keywords":"Mathematics; Combinatorics; Discrete mathematics; Tensor product; Vertex (graph theory); Graph; Pure mathematics","score_opus":0.02030590098042657,"score_gpt":0.2640185442954222,"score_spread":0.24371264331499565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W35857846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35199973,0.007559043,0.525319,0.004632268,0.0010512733,0.00020208192,0.0042541176,0.0011334964,0.10384901],"genre_scores_gemma":[0.90468955,0.0028469092,0.0559457,0.00086095365,0.0006956749,0.00020008437,0.00196868,0.00031466287,0.032477662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986613,0.0004091204,0.00008972299,0.00028151946,0.00034164157,0.00021662776],"domain_scores_gemma":[0.9961359,0.001600258,0.0007881988,0.00062197656,0.00047633325,0.000377329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011431604,0.0008383492,0.0006617703,0.0028763015,0.0012151917,0.002359316,0.0005865191,0.0007755192,0.0100054145],"category_scores_gemma":[0.004258617,0.00042162655,0.0007893953,0.002114726,0.0023687335,0.0031625107,0.0018016051,0.00132407,0.0016729477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006289869,0.000016177737,0.00038068774,0.000102379934,0.00002299228,0.00009407625,0.00022249516,0.0034143755,0.0008398793,0.9753636,0.0034843818,0.015996065],"study_design_scores_gemma":[0.0000097661705,0.000021188524,0.00025409952,0.000018831646,0.00000726883,0.0001238179,0.000039574767,0.008865237,0.00029092786,0.9848015,0.005555898,0.000011993262],"about_ca_topic_score_codex":0.0011095083,"about_ca_topic_score_gemma":0.0018363993,"teacher_disagreement_score":0.0100054145,"about_ca_system_score_codex":0.0012627539,"about_ca_system_score_gemma":0.0005717992,"threshold_uncertainty_score":0.033471465},"labels":[],"label_agreement":null},{"id":"W35924807","doi":"10.17392/1469-22","title":"Digraphs Whose Nodes are Multigraphs Having Exactly Two Degrees f and 2.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.012638851634045075,"score_gpt":0.19641588354844872,"score_spread":0.18377703191440364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W35924807","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5674645,0.007146014,0.27844957,0.0036911934,0.001212526,0.0004282627,0.010979225,0.00198733,0.12864135],"genre_scores_gemma":[0.9009686,0.0020893048,0.066424824,0.00076429825,0.00032413204,0.0002413242,0.004066886,0.00018194214,0.024938654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990324,0.00021466511,0.0000858728,0.00039197822,0.00015253745,0.00012258868],"domain_scores_gemma":[0.99623185,0.0019737496,0.0006915278,0.0005588039,0.00028034573,0.0002636829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087376055,0.000576409,0.0005362488,0.0027468905,0.0011981837,0.0020265172,0.00074854644,0.00066097453,0.009007825],"category_scores_gemma":[0.004189793,0.00038915864,0.0006215314,0.0016466076,0.0018478674,0.0021311296,0.0011337078,0.00063958595,0.0017914496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008682089,0.00028806966,0.031604286,0.0016420557,0.00060013286,0.0031732467,0.0021860881,0.008667847,0.019063113,0.7134239,0.024183122,0.1942999],"study_design_scores_gemma":[0.00011065272,0.00018680014,0.023312394,0.00028418176,0.0002991895,0.007463153,0.0011096378,0.0197556,0.00546173,0.8034206,0.13848306,0.000112958114],"about_ca_topic_score_codex":0.0012914214,"about_ca_topic_score_gemma":0.0019141374,"teacher_disagreement_score":0.009007825,"about_ca_system_score_codex":0.0009975557,"about_ca_system_score_gemma":0.0004419732,"threshold_uncertainty_score":0.030134141},"labels":[],"label_agreement":null},{"id":"W36280574","doi":"","title":"Reciprocal Sums of lth Power of Generalized Binary Sequences with Indices.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Reciprocal; Mathematics; Binary number; Arithmetic; Statistics; Linguistics","score_opus":0.01479477952527019,"score_gpt":0.22573780007210892,"score_spread":0.21094302054683872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W36280574","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36470884,0.003126025,0.3222541,0.0017143626,0.0012400759,0.00013149792,0.00065257796,0.0007884688,0.30538416],"genre_scores_gemma":[0.89585656,0.0010936698,0.05256849,0.0006328812,0.00086772384,0.00014993588,0.00035781937,0.0002850128,0.048187934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838066,0.00044588317,0.00010931037,0.0002302651,0.0005372264,0.0002967105],"domain_scores_gemma":[0.99764425,0.0009132956,0.00029015454,0.00049182953,0.00034645444,0.00031403507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001105098,0.00083663507,0.0007896443,0.0023040737,0.0012242397,0.0031104365,0.0011871046,0.0012196382,0.013331896],"category_scores_gemma":[0.006867689,0.00042358442,0.0006966667,0.001489321,0.0020129478,0.004329818,0.0022475682,0.0016574361,0.00351465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103105616,0.000031466014,0.00027395788,0.000084433224,0.00001924868,0.00024887026,0.00018432557,0.0012783424,0.0043980107,0.97390544,0.0025390869,0.016933689],"study_design_scores_gemma":[0.000021440626,0.000057509624,0.0004539063,0.000066979825,0.000036179317,0.0011571035,0.000119704535,0.016531644,0.0063624303,0.9628388,0.01230782,0.00004639508],"about_ca_topic_score_codex":0.00023320054,"about_ca_topic_score_gemma":0.00039688608,"teacher_disagreement_score":0.013331896,"about_ca_system_score_codex":0.0008049422,"about_ca_system_score_gemma":0.00055203284,"threshold_uncertainty_score":0.044599593},"labels":[],"label_agreement":null},{"id":"W36448044","doi":"10.3233/bpl-220139","title":"Some designs related to group actions.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Psychological Testing and Assessment","field":"Psychology","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Group (periodic table); Group action; Pure mathematics; Chemistry","score_opus":0.10387031573964164,"score_gpt":0.36887984833971416,"score_spread":0.26500953260007254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W36448044","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060467422,0.013564801,0.39555487,0.013140077,0.051298473,0.034477983,0.013082062,0.0058529703,0.4125613],"genre_scores_gemma":[0.23021914,0.008974973,0.35290188,0.012045235,0.0041114273,0.12825571,0.004164825,0.0017871918,0.25753972],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98912245,0.0059580267,0.001336347,0.0015416769,0.0015992224,0.0004422791],"domain_scores_gemma":[0.9856228,0.006280867,0.0014730698,0.003973383,0.0020512296,0.0005986379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071129883,0.0015648141,0.0009492302,0.0012936089,0.0019404616,0.0020345643,0.0015000292,0.0025672622,0.13639285],"category_scores_gemma":[0.0276601,0.0005460102,0.0012859348,0.0013960686,0.0028263074,0.0016755204,0.00290253,0.0030140392,0.025876109],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.011581987,0.0023149706,0.0031511083,0.0058554346,0.00040656925,0.0003696535,0.003410301,0.0008491842,0.012658533,0.17858738,0.109360054,0.67145485],"study_design_scores_gemma":[0.0015513906,0.0060214214,0.00822818,0.0014682572,0.00034906407,0.00057409727,0.0010904436,0.001593506,0.0067707375,0.10173748,0.87048346,0.00013194732],"about_ca_topic_score_codex":0.0009428095,"about_ca_topic_score_gemma":0.0015508204,"teacher_disagreement_score":0.13639285,"about_ca_system_score_codex":0.0011960486,"about_ca_system_score_gemma":0.0018995663,"threshold_uncertainty_score":0.45627952},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.026469833968516262,"score_gpt":0.2914175538317178,"score_spread":0.26494771986320154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W36680195","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08112663,0.010445205,0.649586,0.015161617,0.0026873564,0.00032351067,0.006702565,0.0012617429,0.23270544],"genre_scores_gemma":[0.7172735,0.01647456,0.11422687,0.0035726354,0.0035241295,0.001180685,0.0046892553,0.0010992669,0.13795914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993988,0.0001801429,0.000028270017,0.00015584302,0.0001363803,0.00010053982],"domain_scores_gemma":[0.9980394,0.000992869,0.00032875343,0.00017759153,0.00027229,0.00018910615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006722977,0.0012687898,0.0007479136,0.0029536127,0.0010965749,0.0020248264,0.0013040508,0.0018363643,0.030461961],"category_scores_gemma":[0.0039282045,0.00034489494,0.0010115404,0.0019766225,0.0016275065,0.002800514,0.0015202507,0.0023120476,0.006977292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035464036,0.000035673875,0.0005514952,0.00020895556,0.0000265221,0.00031952123,0.00030340522,0.008684508,0.0015677476,0.94509834,0.02329007,0.019878218],"study_design_scores_gemma":[0.0000078588255,0.000009740524,0.0005208206,0.000027796268,0.000006575318,0.00036674197,0.00008844553,0.027249735,0.00016226344,0.95281404,0.0187267,0.000019323317],"about_ca_topic_score_codex":0.0024236399,"about_ca_topic_score_gemma":0.002871198,"teacher_disagreement_score":0.030461961,"about_ca_system_score_codex":0.001328479,"about_ca_system_score_gemma":0.0005940588,"threshold_uncertainty_score":0.101905406},"labels":[],"label_agreement":null},{"id":"W36900608","doi":"10.3390/foods12051090","title":"Total Coloring of Series-Parallel Graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Series (stratigraphy); Complete coloring; Fractional coloring; Greedy coloring; Brooks' theorem; Edge coloring; Total coloring; Graph coloring; Series and parallel circuits; Combinatorics; Chordal graph; Graph; 1-planar graph; Physics","score_opus":0.010598490676317253,"score_gpt":0.21465824861470736,"score_spread":0.20405975793839012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W36900608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1937303,0.0017823651,0.646603,0.0011121795,0.0007206926,0.00047858682,0.0044260398,0.0046855663,0.14646135],"genre_scores_gemma":[0.7391678,0.002134601,0.18637726,0.00054896687,0.00021715775,0.00042422206,0.0055012875,0.0010387114,0.06459004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933213,0.00013871517,0.00003516171,0.00023009033,0.00015912073,0.00010476264],"domain_scores_gemma":[0.9987016,0.0003115522,0.00019006612,0.000403738,0.00025599665,0.0001370986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005303536,0.00088973105,0.00043886417,0.0014014263,0.000905186,0.0013404755,0.0006641795,0.00035418235,0.01840572],"category_scores_gemma":[0.0018001753,0.0004190169,0.0009243235,0.0016031448,0.0009758831,0.0016122322,0.0010809153,0.0009424431,0.002525935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035219343,0.00016788127,0.0024076179,0.0011023735,0.00019874756,0.0005028901,0.0007312316,0.034989852,0.037078388,0.67335516,0.030411001,0.21870273],"study_design_scores_gemma":[0.000056380264,0.00022415048,0.002869107,0.00009761166,0.000102435835,0.0009606873,0.0002920283,0.06142487,0.018191114,0.8126173,0.1031099,0.00005434342],"about_ca_topic_score_codex":0.0017252071,"about_ca_topic_score_gemma":0.0021971182,"teacher_disagreement_score":0.01840572,"about_ca_system_score_codex":0.0009883107,"about_ca_system_score_gemma":0.0007105071,"threshold_uncertainty_score":0.061573207},"labels":[],"label_agreement":null},{"id":"W37332138","doi":"10.1002/ijgo.14963","title":"On the Intersection of two m-sets and the Erdos-Ginzburg-Ziv Theorem.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Intersection (aeronautics); Integer (computer science); Combinatorics; Sequence (biology); Extension (predicate logic); Discrete mathematics; Computer science","score_opus":0.014840498826867696,"score_gpt":0.2811401410461164,"score_spread":0.2662996422192487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W37332138","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41945803,0.004288678,0.2724353,0.0051617343,0.0007486848,0.000118202406,0.00040237696,0.00028805164,0.29709888],"genre_scores_gemma":[0.9523747,0.0014201378,0.03438389,0.00067399733,0.00037604742,0.00019792802,0.00023442144,0.000055113003,0.010283821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850214,0.00050871447,0.000079362064,0.00028878756,0.00039578576,0.00022526171],"domain_scores_gemma":[0.99722594,0.0015661482,0.00043521074,0.00024457384,0.0002602207,0.0002678858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024744691,0.00054077234,0.0011165794,0.0022260626,0.0027884515,0.0029227422,0.0014919882,0.0016288117,0.0053305235],"category_scores_gemma":[0.0076060384,0.0005555096,0.0009498702,0.0016205296,0.005336901,0.008710487,0.006384239,0.002714153,0.00093495456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012484496,0.0000051448433,0.00008860998,0.000013734127,0.0000035413784,0.000044587567,0.00009091526,0.00027880256,0.000118258635,0.9975126,0.00031043644,0.0015208827],"study_design_scores_gemma":[0.000012538152,0.000011256461,0.00010825486,0.000021499185,0.000005907255,0.00012958894,0.00008022401,0.0025740606,0.00024207424,0.99406415,0.0027425908,0.0000078514595],"about_ca_topic_score_codex":0.00072639826,"about_ca_topic_score_gemma":0.00035010418,"teacher_disagreement_score":0.0053305235,"about_ca_system_score_codex":0.0019215818,"about_ca_system_score_gemma":0.0006441336,"threshold_uncertainty_score":0.017832398},"labels":[],"label_agreement":null},{"id":"W37360314","doi":"10.1007/s41870-023-01336-1","title":"Graph decompositions through prescribed vertices without isolates.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Graph","score_opus":0.02692470145932538,"score_gpt":0.2861416189690892,"score_spread":0.25921691750976383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W37360314","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06757975,0.00078900566,0.8369582,0.0013116471,0.0003655972,0.0005595563,0.0021577128,0.0012531877,0.089025356],"genre_scores_gemma":[0.43607217,0.0017706007,0.4665108,0.0006041587,0.00022389568,0.0008383906,0.00559539,0.00074764254,0.087636925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986468,0.00038418017,0.00010789236,0.0004123926,0.00026325037,0.00018555536],"domain_scores_gemma":[0.9969506,0.0012035717,0.00036506107,0.00074293703,0.00044496983,0.0002928228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084742083,0.0007918012,0.00071338937,0.0028698074,0.0023473094,0.0033631348,0.0012566191,0.0014921075,0.024174718],"category_scores_gemma":[0.005107503,0.00076663063,0.0014774441,0.0022192565,0.0023386476,0.004483815,0.0024903456,0.001774567,0.005059768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011649689,0.000072415045,0.00095717254,0.00024506456,0.000048678306,0.00037462832,0.00080525794,0.012075679,0.002734306,0.923539,0.0076343063,0.051396996],"study_design_scores_gemma":[0.00003621951,0.000048015736,0.0006767163,0.000111409885,0.000050374318,0.00050732074,0.000489584,0.034063905,0.0017811757,0.8959562,0.0662513,0.000027675072],"about_ca_topic_score_codex":0.0038509162,"about_ca_topic_score_gemma":0.005112948,"teacher_disagreement_score":0.024174718,"about_ca_system_score_codex":0.0014045775,"about_ca_system_score_gemma":0.0011718348,"threshold_uncertainty_score":0.080872476},"labels":[],"label_agreement":null},{"id":"W37767160","doi":"10.3389/fmolb.2023.1212541","title":"New Classes of Combinatorial Identities.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Sesquiterpenes and Asteraceae Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Regione Campania","keywords":"Mathematics; Combinatorics","score_opus":0.007988335338341708,"score_gpt":0.2526196993656266,"score_spread":0.24463136402728491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W37767160","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13954957,0.008135709,0.20847203,0.0024389399,0.003165392,0.00043502377,0.0027219136,0.002570961,0.63251036],"genre_scores_gemma":[0.6634566,0.0055428315,0.10607143,0.0024073783,0.0013218168,0.00067317695,0.005255099,0.00068073417,0.21459101],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994672,0.00006566778,0.000038318216,0.00017373922,0.00015459114,0.00010052647],"domain_scores_gemma":[0.9996667,0.000043396765,0.00004359405,0.00011858242,0.000053464883,0.000074230826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025322614,0.00072787283,0.0005221024,0.001342812,0.0011636013,0.0022475582,0.000670378,0.0006021417,0.025270658],"category_scores_gemma":[0.00077528314,0.00026128447,0.0006005378,0.0010227005,0.0010953884,0.0021346756,0.001973946,0.0010801326,0.0069433907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010552683,0.000082687526,0.0005883451,0.00018559981,0.000028042981,0.00031621117,0.00012786794,0.000776423,0.014119515,0.88390046,0.012703214,0.08706611],"study_design_scores_gemma":[0.00004608114,0.00017544765,0.00093892496,0.0000616408,0.00004493227,0.0021978277,0.00015643497,0.005091345,0.013174612,0.44816214,0.5299024,0.000048266375],"about_ca_topic_score_codex":0.00027173926,"about_ca_topic_score_gemma":0.00058733777,"teacher_disagreement_score":0.025270658,"about_ca_system_score_codex":0.0007227599,"about_ca_system_score_gemma":0.00054716103,"threshold_uncertainty_score":0.08453882},"labels":[],"label_agreement":null},{"id":"W37843838","doi":"","title":"The crossing number of P(10, 3) is six.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Crossing number (knot theory); Combinatorics; Geography; Cartography; Intersection (aeronautics)","score_opus":0.006790254492457936,"score_gpt":0.23282530009685584,"score_spread":0.2260350456043979,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W37843838","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4445352,0.0012110646,0.057595633,0.0068432107,0.0017587024,0.00014112346,0.0017154295,0.001838853,0.4843608],"genre_scores_gemma":[0.94381684,0.0007850013,0.015244076,0.0008148885,0.00017332679,0.00007472587,0.0008598389,0.00027133137,0.037959952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938035,0.000099161705,0.000018917368,0.00012672083,0.00015594228,0.00021882453],"domain_scores_gemma":[0.99915195,0.000292799,0.00013520327,0.000110285735,0.00008209758,0.00022775737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040217183,0.00064557814,0.0004895843,0.0020028718,0.0021816615,0.0025693853,0.0008235858,0.0015569682,0.035908543],"category_scores_gemma":[0.0018881003,0.0003379274,0.0005319235,0.0013704768,0.0017137685,0.0018438428,0.0011693119,0.0021731176,0.006338384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066023186,0.0002550815,0.0027188996,0.00041068584,0.000088236324,0.0021746333,0.0006426824,0.002222776,0.027855447,0.82065666,0.034097657,0.10821696],"study_design_scores_gemma":[0.00007363277,0.00013968382,0.004056786,0.00011113669,0.000057176574,0.0027049265,0.0006543585,0.0037971905,0.016005902,0.87310445,0.09920264,0.00009205923],"about_ca_topic_score_codex":0.00089807843,"about_ca_topic_score_gemma":0.0009926888,"teacher_disagreement_score":0.035908543,"about_ca_system_score_codex":0.0007939019,"about_ca_system_score_gemma":0.00087108504,"threshold_uncertainty_score":0.12012607},"labels":[],"label_agreement":null},{"id":"W38130022","doi":"10.1111/jcpp.13940","title":"Sphere-of-Influence Graphs on a Sphere.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.009295260172094756,"score_gpt":0.22710268250822138,"score_spread":0.21780742233612663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W38130022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028895067,0.0015125095,0.93205917,0.0027957798,0.00027197835,0.00040300292,0.0050838296,0.0023220682,0.026656568],"genre_scores_gemma":[0.5309493,0.002991956,0.4106035,0.0011393934,0.00052764517,0.0011030146,0.0110218115,0.0013791837,0.040284157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973592,0.00092389947,0.00023289333,0.00065353996,0.0005890929,0.00024128646],"domain_scores_gemma":[0.98929673,0.0061708125,0.00084506074,0.0021273564,0.0009100734,0.00064984924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023217394,0.0012389561,0.0018638266,0.003223037,0.001675668,0.0035776307,0.001961627,0.0017555361,0.017405268],"category_scores_gemma":[0.018689377,0.00079080666,0.0021550357,0.0030204295,0.0023444223,0.004936404,0.0033162078,0.0021526376,0.0036022987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036205043,0.00009761058,0.0040361555,0.0005309868,0.00025303676,0.0004680306,0.00055882294,0.121505454,0.0013933425,0.706806,0.037066948,0.12692167],"study_design_scores_gemma":[0.000054502372,0.000049863498,0.00093741337,0.00006437929,0.00008300117,0.00029592228,0.00012655671,0.2585493,0.001158144,0.6879216,0.05072912,0.000030156101],"about_ca_topic_score_codex":0.0062690675,"about_ca_topic_score_gemma":0.010306972,"teacher_disagreement_score":0.017405268,"about_ca_system_score_codex":0.0018160925,"about_ca_system_score_gemma":0.0016969822,"threshold_uncertainty_score":0.058226407},"labels":[],"label_agreement":null},{"id":"W38371716","doi":"10.1007/s43477-023-00092-5","title":"On the Connectivity of (4;g)-Cages.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Eunice Kennedy Shriver National Institute of Child Health and Human Development; National Center for Chronic Disease Prevention and Health Promotion","keywords":"Mathematics; Combinatorics","score_opus":0.012091663010184227,"score_gpt":0.18071383805628483,"score_spread":0.1686221750461006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W38371716","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45289788,0.004984069,0.12224699,0.005533404,0.00071445527,0.00016116069,0.0052781105,0.00055756007,0.40762636],"genre_scores_gemma":[0.92669445,0.0041800668,0.03429209,0.0009188844,0.00045109083,0.00027599622,0.0036020942,0.00024827904,0.029337114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996587,0.00009546789,0.000015733609,0.00008658446,0.00006783472,0.00007567763],"domain_scores_gemma":[0.99838257,0.000871665,0.0002729773,0.00014293136,0.000114774986,0.00021513193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002539413,0.0003556542,0.0004373407,0.0016728777,0.0014246581,0.0013879185,0.0007649522,0.0009860594,0.020316105],"category_scores_gemma":[0.0021727858,0.00028823878,0.00034480207,0.0011606744,0.0013994097,0.0026211652,0.0015344766,0.0012414916,0.0021710237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016566341,0.000033678753,0.0016570466,0.0002495898,0.000031334144,0.00040573298,0.00038625824,0.0071030967,0.0037959793,0.9260551,0.030951317,0.0291652],"study_design_scores_gemma":[0.000040259965,0.00005431103,0.003126405,0.0000975999,0.000028854605,0.00086685095,0.00036541285,0.014603238,0.00161988,0.9507209,0.028445374,0.00003090417],"about_ca_topic_score_codex":0.0011098419,"about_ca_topic_score_gemma":0.0019510271,"teacher_disagreement_score":0.020316105,"about_ca_system_score_codex":0.0005907952,"about_ca_system_score_gemma":0.0002845687,"threshold_uncertainty_score":0.06796408},"labels":[],"label_agreement":null},{"id":"W38533780","doi":"10.37201/req/149.2023","title":"Upper bounds on the domination number of a graph in terms of order and minimum degree.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Combinatorics; Graph; Order (exchange); Physics","score_opus":0.013871727514548926,"score_gpt":0.27393067211615574,"score_spread":0.26005894460160683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W38533780","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25529018,0.029731046,0.42215064,0.008695016,0.0008298555,0.00020894878,0.009903193,0.0030488772,0.2701422],"genre_scores_gemma":[0.8776998,0.009981215,0.0859336,0.0009314732,0.001433337,0.0003305991,0.0033756453,0.0007842916,0.01953012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976877,0.0004250942,0.0001206478,0.0003922533,0.0007683896,0.0006059316],"domain_scores_gemma":[0.95557326,0.03655156,0.0018579229,0.0031099892,0.0012837793,0.0016234366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026177994,0.0018378901,0.0016619033,0.0050003626,0.0015400669,0.0040527456,0.0027794284,0.0013054345,0.011948132],"category_scores_gemma":[0.022714032,0.0008767019,0.0012172445,0.0043775523,0.001972256,0.007649778,0.0027396725,0.0030071752,0.0021468827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015899143,0.00043655877,0.011007177,0.0015765271,0.00037391295,0.00050194777,0.000853131,0.23059429,0.026794763,0.52330613,0.044319462,0.15864612],"study_design_scores_gemma":[0.00007311116,0.00013765224,0.008017103,0.0003931229,0.0002580079,0.0009978183,0.00018928574,0.33013842,0.009779456,0.62069833,0.029186044,0.0001317019],"about_ca_topic_score_codex":0.0021674724,"about_ca_topic_score_gemma":0.007961065,"teacher_disagreement_score":0.011948132,"about_ca_system_score_codex":0.00346373,"about_ca_system_score_gemma":0.0013351687,"threshold_uncertainty_score":0.039970517},"labels":[],"label_agreement":null},{"id":"W38897458","doi":"10.1016/j.scitotenv.2024.174089","title":"A Characterization Of Connected Matroids.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Matroid; Mathematics; Characterization (materials science); Combinatorics; Nanotechnology","score_opus":0.012246746438446835,"score_gpt":0.21440450569538028,"score_spread":0.20215775925693344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W38897458","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1720631,0.0018660306,0.79210204,0.0022236211,0.00019515524,0.00018803458,0.004311595,0.00061867974,0.02643174],"genre_scores_gemma":[0.83585966,0.002471899,0.13176994,0.0006504471,0.0008228806,0.00042690898,0.007723613,0.00041724116,0.019857485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811697,0.00061835296,0.00015941466,0.0005624195,0.0003898613,0.00015295229],"domain_scores_gemma":[0.9896774,0.0057553137,0.0017213026,0.0008841295,0.0011884392,0.0007734276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018101411,0.0010359589,0.0011484874,0.0024401706,0.0007969536,0.0035452012,0.001496766,0.0013462713,0.011051524],"category_scores_gemma":[0.011529182,0.00060222234,0.0014318335,0.0021317534,0.0020247109,0.0045252363,0.0018699203,0.002666645,0.0019670667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022064353,0.00015304549,0.0074784113,0.00049696147,0.00020860546,0.00042338533,0.0006034456,0.114336506,0.0030516775,0.7955754,0.01460016,0.062851794],"study_design_scores_gemma":[0.000026276897,0.00017457052,0.0024442046,0.0000795585,0.000042437707,0.0007231011,0.00017347666,0.34028405,0.000922749,0.64387536,0.011222238,0.000031912976],"about_ca_topic_score_codex":0.0008560361,"about_ca_topic_score_gemma":0.00063663797,"teacher_disagreement_score":0.011051524,"about_ca_system_score_codex":0.0012299364,"about_ca_system_score_gemma":0.00053278304,"threshold_uncertainty_score":0.036971092},"labels":[],"label_agreement":null},{"id":"W38963144","doi":"10.2478/aiht-2024-75-3819","title":"An Introduction to Maximum Sum Permutations of Graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.008935909092831627,"score_gpt":0.23754806125519673,"score_spread":0.2286121521623651,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W38963144","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015530654,0.011364892,0.9335806,0.0034557767,0.0028109578,0.00033081745,0.0051940894,0.00756799,0.034141865],"genre_scores_gemma":[0.049751308,0.021004332,0.8671991,0.0062531494,0.006824861,0.0023073107,0.015429785,0.006288583,0.024941467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950429,0.0019458883,0.0005014512,0.0011102256,0.0011353558,0.00026410437],"domain_scores_gemma":[0.98714846,0.009039777,0.00054618774,0.001997792,0.0009199001,0.00034799022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005209961,0.002726665,0.0022383982,0.0049827755,0.001651699,0.0051429747,0.0039711287,0.0029147868,0.045239244],"category_scores_gemma":[0.018423947,0.0020227192,0.0047262604,0.0062820683,0.0028052602,0.008532745,0.0044615907,0.007119042,0.018842826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001411443,0.0001416289,0.0011549431,0.002071342,0.00034186043,0.0006225892,0.0005214061,0.013971754,0.0017711391,0.59230906,0.14192995,0.24502325],"study_design_scores_gemma":[0.000035560523,0.000044497607,0.00030353025,0.00026365105,0.000047144465,0.00048672687,0.00007842682,0.02083426,0.00039784805,0.7933042,0.18415692,0.00004722515],"about_ca_topic_score_codex":0.0021343566,"about_ca_topic_score_gemma":0.0027705743,"teacher_disagreement_score":0.045239244,"about_ca_system_score_codex":0.0021419616,"about_ca_system_score_gemma":0.0020470386,"threshold_uncertainty_score":0.1513403},"labels":[],"label_agreement":null},{"id":"W39381033","doi":"10.3389/fnume.2024.1324698","title":"A Note on the Unit Interval Number and Proper Interval Number of Graphs.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Heart, Lung, and Blood Institute","keywords":"Mathematics; Interval (graph theory); Unit interval; Unit (ring theory); Combinatorics; Discrete mathematics; Mathematics education","score_opus":0.021097818232278666,"score_gpt":0.29992475290418696,"score_spread":0.2788269346719083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W39381033","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020151805,0.040039957,0.6428725,0.042133342,0.037795898,0.0003203532,0.0019122969,0.001409648,0.21336426],"genre_scores_gemma":[0.33142284,0.02162768,0.5654067,0.013793726,0.034747593,0.0008516754,0.0014594807,0.0010725327,0.0296178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955888,0.0017745823,0.00052438775,0.0010190739,0.0008739787,0.00021926952],"domain_scores_gemma":[0.9715996,0.019992482,0.0012322238,0.004068699,0.0024212152,0.0006857682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048470446,0.0008912312,0.0011552012,0.0033754604,0.0021512061,0.0036409306,0.0026488234,0.0016886805,0.008371412],"category_scores_gemma":[0.03363641,0.0005340025,0.0011807717,0.00388723,0.008625667,0.009421378,0.0027607777,0.00802741,0.002499809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016895843,0.000037115627,0.0010885451,0.0004078067,0.00003811673,0.00040393704,0.00034569795,0.0011911979,0.0012307605,0.86511344,0.052407537,0.0775669],"study_design_scores_gemma":[0.000017969183,0.000079223064,0.0015429263,0.000119307,0.00003795984,0.00095169275,0.00011050868,0.0025394706,0.0010813385,0.8637763,0.12966578,0.000077548844],"about_ca_topic_score_codex":0.001869341,"about_ca_topic_score_gemma":0.0015087073,"teacher_disagreement_score":0.008371412,"about_ca_system_score_codex":0.0013114279,"about_ca_system_score_gemma":0.0007899322,"threshold_uncertainty_score":0.028005183},"labels":[],"label_agreement":null},{"id":"W39451528","doi":"10.3390/cimb46100648","title":"Counting pan-fan maps on nonorientable surfaces.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Geometry; Combinatorics","score_opus":0.022552055203445064,"score_gpt":0.28805302792670956,"score_spread":0.2655009727232645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W39451528","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5233498,0.0033848472,0.39597547,0.0006437548,0.0005426152,0.00031992246,0.0028522797,0.0028721977,0.07005909],"genre_scores_gemma":[0.85599834,0.0013847294,0.11704344,0.00014328546,0.00023019979,0.0001912966,0.0034523862,0.00053882325,0.021017538],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961156,0.000057506903,0.000015683476,0.00009677714,0.00015410001,0.000064377906],"domain_scores_gemma":[0.998985,0.0003103034,0.00017830344,0.0001406845,0.0002826881,0.00010296507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040177163,0.0007467755,0.000495015,0.003170955,0.00068585074,0.001241694,0.0007987547,0.0005291185,0.01107906],"category_scores_gemma":[0.002968607,0.00028704887,0.00045379245,0.0012954089,0.0006212232,0.0017006852,0.001206699,0.00044560057,0.0016598532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076822593,0.00015281589,0.044718932,0.001135294,0.00018272843,0.0014943366,0.0010212858,0.046300102,0.041293837,0.3527338,0.024771366,0.48542735],"study_design_scores_gemma":[0.00007289598,0.00022697364,0.044091202,0.00021911203,0.0001070762,0.0048870184,0.0013915282,0.43080723,0.019973876,0.3928506,0.10524181,0.0001306885],"about_ca_topic_score_codex":0.0014757372,"about_ca_topic_score_gemma":0.0015044227,"teacher_disagreement_score":0.01107906,"about_ca_system_score_codex":0.00040177145,"about_ca_system_score_gemma":0.00030981435,"threshold_uncertainty_score":0.03706318},"labels":[],"label_agreement":null},{"id":"W40043733","doi":"","title":"Optimal Binary Linear Codes.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Binary number; Arithmetic","score_opus":0.007077893867938434,"score_gpt":0.206232152952072,"score_spread":0.19915425908413356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W40043733","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08811896,0.008739059,0.41273174,0.0076122885,0.0015441237,0.00018488242,0.0027252818,0.0009563582,0.4773873],"genre_scores_gemma":[0.8049201,0.003897537,0.09513976,0.0017588867,0.0008543421,0.00023093089,0.0017152238,0.00026933185,0.09121388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863774,0.00034119398,0.00006114663,0.00019401214,0.00045059557,0.00031531398],"domain_scores_gemma":[0.99807113,0.00089652993,0.00018466408,0.00040105835,0.00028761645,0.00015903017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005705862,0.00060799945,0.000610106,0.001263232,0.00083428697,0.0018037235,0.0007593503,0.0012066168,0.014071803],"category_scores_gemma":[0.0048634694,0.0003689004,0.00035396326,0.0014064172,0.0010635467,0.00242253,0.0021732997,0.0016312134,0.003466468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019480266,0.00008234294,0.00034805448,0.00018490799,0.000029413188,0.00006566448,0.00011342827,0.014153989,0.0034111976,0.8708735,0.030154226,0.08038844],"study_design_scores_gemma":[0.000056697954,0.000042684216,0.0003695338,0.00008130758,0.000024845966,0.00018710512,0.00007648806,0.05379188,0.0034506295,0.91775006,0.024145756,0.00002315194],"about_ca_topic_score_codex":0.0009502653,"about_ca_topic_score_gemma":0.0021214788,"teacher_disagreement_score":0.014071803,"about_ca_system_score_codex":0.0017483833,"about_ca_system_score_gemma":0.0013524655,"threshold_uncertainty_score":0.047074854},"labels":[],"label_agreement":null},{"id":"W40066852","doi":"","title":"Embeddings of Steiner Quadruple Systems using Extensions of Linear Spaces.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Steiner system; Combinatorics; Pure mathematics; Discrete mathematics","score_opus":0.0127891565091201,"score_gpt":0.2265981414725181,"score_spread":0.213808984963398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W40066852","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3483525,0.0012672474,0.4871031,0.0011174111,0.0005959156,0.00014064393,0.0009299206,0.0010266446,0.15946661],"genre_scores_gemma":[0.8562627,0.0007368408,0.105407536,0.00034658564,0.00022731157,0.00013360614,0.00084659475,0.0003595671,0.035679206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993961,0.00019037921,0.00003875132,0.00013287152,0.00012882573,0.00011317934],"domain_scores_gemma":[0.99903935,0.0003256946,0.00014853124,0.00019713893,0.00012371561,0.00016554646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032074592,0.0005327468,0.00041733662,0.0013944043,0.0011171736,0.0026146215,0.00079167413,0.0007895424,0.011155537],"category_scores_gemma":[0.0017810839,0.00042505682,0.0006374412,0.0011674656,0.0012861902,0.0046622828,0.002959191,0.0018538781,0.0022113717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005151592,0.00003923193,0.00019353056,0.000046248035,0.000009665285,0.00012987985,0.0002881791,0.0023384427,0.001853477,0.9760803,0.0024674663,0.0165021],"study_design_scores_gemma":[0.000017210474,0.000044645938,0.00020684117,0.00003656096,0.000011653833,0.00026727622,0.00034066036,0.011036143,0.0016003496,0.9687299,0.017687516,0.000021292552],"about_ca_topic_score_codex":0.00045906735,"about_ca_topic_score_gemma":0.00073446054,"teacher_disagreement_score":0.011155537,"about_ca_system_score_codex":0.00075558777,"about_ca_system_score_gemma":0.00029552513,"threshold_uncertainty_score":0.037319005},"labels":[],"label_agreement":null},{"id":"W41230315","doi":"","title":"Major Index for Standard Young Tableaux.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematics, Computing, and Information Processing","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Statistics; Computer science; World Wide Web","score_opus":0.010783374824399746,"score_gpt":0.24451011332122846,"score_spread":0.2337267384968287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W41230315","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103116855,0.0035311258,0.2192401,0.0021394272,0.0035126356,0.00020019902,0.0068779388,0.0030900908,0.6582916],"genre_scores_gemma":[0.7233636,0.0015332557,0.055009607,0.00093880354,0.0009175466,0.00025172925,0.0042979657,0.0009589093,0.21272865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996006,0.00005959865,0.00003798396,0.00007382902,0.00013954335,0.00008850345],"domain_scores_gemma":[0.99940443,0.0001512584,0.00007853052,0.00009065898,0.00017517639,0.000100052086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004875789,0.0004910249,0.0005517135,0.0015486571,0.0011480165,0.003482992,0.0006799168,0.00050972705,0.030677432],"category_scores_gemma":[0.0014401727,0.00024774752,0.00042170857,0.0012489299,0.0008101429,0.0029939704,0.0012331695,0.0010923201,0.009313277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067555105,0.000018184272,0.00020287851,0.00006910142,0.0000076127303,0.00008872019,0.00011921768,0.00019047734,0.0014629976,0.9578882,0.016829833,0.023055252],"study_design_scores_gemma":[0.000024565754,0.000048994578,0.000439318,0.00004366562,0.000015785752,0.0003885051,0.00008490422,0.0020845225,0.0029413013,0.88109136,0.112811774,0.00002531268],"about_ca_topic_score_codex":0.0005695688,"about_ca_topic_score_gemma":0.0010779948,"teacher_disagreement_score":0.030677432,"about_ca_system_score_codex":0.0015049558,"about_ca_system_score_gemma":0.0006739599,"threshold_uncertainty_score":0.102626264},"labels":[],"label_agreement":null},{"id":"W41471150","doi":"","title":"On the independence number of the Cartesian product of caterpillars.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Botany and Plant Ecology Studies","field":"Agricultural and Biological Sciences","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Mathematics; Independence (probability theory); Product (mathematics); Cartesian coordinate system; Arithmetic; Pure mathematics; Statistics; Discrete mathematics; Geometry","score_opus":0.013790453618965016,"score_gpt":0.21081660782033856,"score_spread":0.19702615420137354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W41471150","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56514466,0.006298592,0.16714601,0.005243693,0.001150953,0.00007366285,0.001757466,0.00045680616,0.25272813],"genre_scores_gemma":[0.95808935,0.0020369375,0.018034466,0.00041514312,0.0010130682,0.000085039996,0.00081958115,0.00020692337,0.019299349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990453,0.00024709324,0.00007478393,0.00022317034,0.00022530282,0.00018429657],"domain_scores_gemma":[0.99073774,0.0063254274,0.0008241636,0.0006479851,0.00060609286,0.00085864303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001657743,0.00072842516,0.00089431903,0.002823096,0.0014283261,0.0028721157,0.0010570468,0.0008974031,0.011024952],"category_scores_gemma":[0.008639488,0.0006663834,0.0007507267,0.0015341692,0.0038886466,0.007645234,0.002426614,0.003008216,0.0016843068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013010557,0.000026857151,0.0013521244,0.00009157607,0.000018007995,0.000101087826,0.00019934603,0.0015165077,0.00078466145,0.9832676,0.0038805364,0.008631729],"study_design_scores_gemma":[0.000023631392,0.000040481882,0.0023675798,0.000041258354,0.000025381354,0.00034327086,0.00006889412,0.0068162796,0.00058804965,0.98372364,0.0059316866,0.000029936447],"about_ca_topic_score_codex":0.0012715517,"about_ca_topic_score_gemma":0.0015742772,"teacher_disagreement_score":0.011024952,"about_ca_system_score_codex":0.0012975471,"about_ca_system_score_gemma":0.0005549052,"threshold_uncertainty_score":0.036882162},"labels":[],"label_agreement":null},{"id":"W41547039","doi":"","title":"On Skolem-Graceful and Cordial Graphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.00593498906881944,"score_gpt":0.2024602084891991,"score_spread":0.19652521942037965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W41547039","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.415452,0.0026887543,0.23488544,0.0072688754,0.0006365016,0.00015093136,0.001935532,0.0023186537,0.3346633],"genre_scores_gemma":[0.8929506,0.0013245034,0.045125976,0.0011206331,0.00036620288,0.000119193144,0.0013455242,0.00047466747,0.05717277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991443,0.00022401386,0.000045331755,0.00018402222,0.00018062872,0.00022160068],"domain_scores_gemma":[0.99718827,0.0013168226,0.00035026335,0.0006021797,0.0002003604,0.00034208258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008506933,0.00068929716,0.0006635686,0.0019145418,0.0026469762,0.0030075768,0.0013346793,0.0012076964,0.014013671],"category_scores_gemma":[0.0041531087,0.0004750041,0.0007673228,0.0023820978,0.0034623477,0.007818567,0.0032687976,0.002611075,0.0021562204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004526987,0.00002377891,0.00024720555,0.000050136758,0.000004892952,0.00004926874,0.00018289626,0.001036372,0.0005068986,0.9846503,0.0041672774,0.00903564],"study_design_scores_gemma":[0.000009415036,0.000007070371,0.00016506776,0.00001817307,0.000006301924,0.000069563655,0.000091156035,0.002274516,0.00048115218,0.9899615,0.0069069457,0.000009102308],"about_ca_topic_score_codex":0.0021948456,"about_ca_topic_score_gemma":0.0035664367,"teacher_disagreement_score":0.014013671,"about_ca_system_score_codex":0.0023825103,"about_ca_system_score_gemma":0.00073366304,"threshold_uncertainty_score":0.046880424},"labels":[],"label_agreement":null},{"id":"W41584405","doi":"","title":"Diagonal flips of pseudo triangulations on the sphere.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Diagonal; Mathematics; Combinatorics; Geometry; Pure mathematics","score_opus":0.022131219918457592,"score_gpt":0.2472481836692579,"score_spread":0.22511696375080031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W41584405","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28195333,0.00075723365,0.610842,0.0005362362,0.00066574,0.00019954226,0.00085443334,0.0013319937,0.10285959],"genre_scores_gemma":[0.8356281,0.0005908417,0.11626395,0.00020839945,0.0001369922,0.00012487468,0.0010523795,0.00079094805,0.045203485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999506,0.000118414304,0.000026238098,0.000061490085,0.00019674428,0.00009116656],"domain_scores_gemma":[0.9990988,0.0002681919,0.000096521275,0.00022239868,0.00019690902,0.000117318436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038039644,0.00033845808,0.00036062373,0.0011405847,0.00087190757,0.0012121288,0.0006459296,0.000582531,0.0177032],"category_scores_gemma":[0.0030589085,0.00032243345,0.00041169327,0.00061452785,0.0012697085,0.0013627646,0.002468072,0.00091606664,0.0027980132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021698451,0.0000368108,0.0008625078,0.00010734025,0.000015477124,0.0002658096,0.00031680253,0.016679293,0.007845382,0.8698942,0.011796079,0.09196335],"study_design_scores_gemma":[0.00008257489,0.00010929833,0.00094864133,0.00009044781,0.000021338528,0.00048227212,0.0005086916,0.14796638,0.012058511,0.7989974,0.038693015,0.000041408046],"about_ca_topic_score_codex":0.0010170334,"about_ca_topic_score_gemma":0.0020686453,"teacher_disagreement_score":0.0177032,"about_ca_system_score_codex":0.00044947802,"about_ca_system_score_gemma":0.00034898764,"threshold_uncertainty_score":0.059223115},"labels":[],"label_agreement":null},{"id":"W41737647","doi":"","title":"The Edge-Isoperimetric Problem for Regular Planar Tesselations.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Isoperimetric inequality; Mathematics; Enhanced Data Rates for GSM Evolution; Planar; Combinatorics; Geometry; Computer science; Artificial intelligence; Computer graphics (images)","score_opus":0.04353509506206449,"score_gpt":0.3027902123735871,"score_spread":0.2592551173115226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W41737647","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4416117,0.0048409016,0.39765006,0.008067006,0.0005105178,0.00020511255,0.0019347813,0.00036449122,0.14481533],"genre_scores_gemma":[0.90794456,0.0032774273,0.060389057,0.00063606,0.00063475437,0.00018506827,0.0013948259,0.00015074022,0.025387423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987074,0.0003675067,0.000084882944,0.00027341192,0.00032903653,0.00023767173],"domain_scores_gemma":[0.9912178,0.0063175904,0.00079825846,0.00043463972,0.00050419255,0.0007274588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019374609,0.0008071678,0.0011815277,0.00212214,0.0015551554,0.004057859,0.0025184613,0.002869967,0.011073017],"category_scores_gemma":[0.01436355,0.0006005813,0.0009205565,0.0021331424,0.002637652,0.009669312,0.0037634661,0.0043209856,0.0011103214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012464677,0.00007338306,0.00097377383,0.00018534326,0.000036400073,0.00013061387,0.00018115655,0.009249602,0.0009023874,0.9642271,0.0054834494,0.018432304],"study_design_scores_gemma":[0.000026087397,0.000043178938,0.0005805412,0.000039680242,0.000020675972,0.00022866765,0.00019738174,0.034877583,0.00075181155,0.95882595,0.004390955,0.000017469776],"about_ca_topic_score_codex":0.0010904553,"about_ca_topic_score_gemma":0.00097419467,"teacher_disagreement_score":0.011073017,"about_ca_system_score_codex":0.0014976441,"about_ca_system_score_gemma":0.00068074476,"threshold_uncertainty_score":0.037042975},"labels":[],"label_agreement":null},{"id":"W41832373","doi":"","title":"Lah Matrix and Its Algebraic Properties.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Algebraic number; Matrix (chemical analysis); Pure mathematics; Algebra over a field; Mathematical analysis; Materials science; Composite material","score_opus":0.014252823818078979,"score_gpt":0.2326254931632552,"score_spread":0.2183726693451762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W41832373","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18571097,0.0069822944,0.2964593,0.0071267877,0.001303475,0.00016316802,0.0026097125,0.0013260305,0.4983183],"genre_scores_gemma":[0.874843,0.00178578,0.03531794,0.0011974716,0.0013715483,0.00011679103,0.0011881749,0.00021828843,0.08396109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951625,0.00010134877,0.00002143912,0.000089191344,0.00017927182,0.000092473805],"domain_scores_gemma":[0.99867415,0.0003411493,0.00022312911,0.00017942066,0.00035938635,0.0002227273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000429259,0.00029138062,0.00041208178,0.0015652574,0.0011662745,0.0024038912,0.00061449595,0.00059732114,0.02239312],"category_scores_gemma":[0.0028947322,0.0002254503,0.00033665245,0.0011634529,0.001894842,0.0032287869,0.0012702249,0.0016716851,0.0065632295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027665405,0.000017644348,0.0001747939,0.000032565746,0.0000048276497,0.00007179159,0.00010612831,0.00028921667,0.0009059142,0.98600185,0.0050170976,0.007350411],"study_design_scores_gemma":[0.0000120487075,0.000021467307,0.00026165205,0.000011035974,0.0000048633847,0.00028587558,0.00008853242,0.0035299307,0.0008951513,0.9788552,0.016019033,0.000015182209],"about_ca_topic_score_codex":0.0011250692,"about_ca_topic_score_gemma":0.0011749761,"teacher_disagreement_score":0.02239312,"about_ca_system_score_codex":0.00072536856,"about_ca_system_score_gemma":0.00058069604,"threshold_uncertainty_score":0.07491243},"labels":[],"label_agreement":null},{"id":"W4187411","doi":"10.1016/0013-4694(69)91361-3","title":"On 3-Hypergraphs with Equal Degree Sequences.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Combinatorics; Discrete mathematics","score_opus":0.011802308836113619,"score_gpt":0.20624362873441562,"score_spread":0.19444131989830202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4187411","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3176152,0.0033535496,0.40322858,0.0032302658,0.00066675694,0.00016674702,0.001456056,0.00062219944,0.26966056],"genre_scores_gemma":[0.83852714,0.0030933234,0.080390766,0.0015048786,0.0005745899,0.00023937375,0.0012571616,0.0002780409,0.0741347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999033,0.00036240465,0.000048726874,0.0001622506,0.00019384883,0.0001998093],"domain_scores_gemma":[0.996476,0.0020227816,0.0005090047,0.00031201064,0.0003369824,0.00034317782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006227927,0.00059483445,0.00049885886,0.002961519,0.0017764152,0.0025325322,0.0007497936,0.0011668524,0.013152404],"category_scores_gemma":[0.0035123178,0.0004977588,0.0005738323,0.002151244,0.0016794244,0.0044799,0.0018800452,0.001597701,0.002422136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060859395,0.00003200413,0.00037172827,0.00007535736,0.000016065424,0.00024329183,0.0003261926,0.0038943884,0.0018938347,0.97413176,0.0039067795,0.015047676],"study_design_scores_gemma":[0.000012536546,0.000014866462,0.00039427835,0.000053581185,0.000010770097,0.00028221746,0.00018963362,0.010628453,0.0009172397,0.9765118,0.010967358,0.000017420316],"about_ca_topic_score_codex":0.0017323418,"about_ca_topic_score_gemma":0.0030260736,"teacher_disagreement_score":0.013152404,"about_ca_system_score_codex":0.0015048819,"about_ca_system_score_gemma":0.0006253461,"threshold_uncertainty_score":0.043999135},"labels":[],"label_agreement":null},{"id":"W42227420","doi":"","title":"Formulas For Sums Of Generalized Order-k Fibonacci Type Sequences By Matrix Methods.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Mathematics; Type (biology); Order (exchange); Combinatorics; Matrix (chemical analysis); Pure mathematics; Biology","score_opus":0.024070670213089656,"score_gpt":0.35188386468389404,"score_spread":0.32781319447080437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W42227420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068400405,0.006079615,0.74015033,0.0013748895,0.0014443981,0.00013763332,0.0008369075,0.000677174,0.18089859],"genre_scores_gemma":[0.6064648,0.003312183,0.32211718,0.00079011166,0.0013124039,0.00033410956,0.0007762633,0.0006460307,0.06424684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992907,0.00016023763,0.000056266996,0.00007291093,0.00033995401,0.00007985873],"domain_scores_gemma":[0.9988778,0.0004978688,0.00008909044,0.00011538993,0.00034146564,0.00007835735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010317597,0.00087944325,0.00074280443,0.0027826102,0.0013091081,0.0036014498,0.0017504593,0.001129642,0.01200942],"category_scores_gemma":[0.0046796696,0.0005503212,0.0009828883,0.0020315032,0.0013993137,0.0057422426,0.0014496654,0.001959648,0.0030841494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001266551,0.0000117494055,0.000105551815,0.000057219586,0.0000073596407,0.00006326495,0.00011685025,0.00073899043,0.000586823,0.98589885,0.0026177196,0.009783038],"study_design_scores_gemma":[0.0000070209608,0.000007938276,0.00010888458,0.00003764149,0.0000102110935,0.00018972934,0.00004833111,0.012429757,0.0005870371,0.9813132,0.005244314,0.00001586212],"about_ca_topic_score_codex":0.0011082381,"about_ca_topic_score_gemma":0.0028088614,"teacher_disagreement_score":0.01200942,"about_ca_system_score_codex":0.0012077822,"about_ca_system_score_gemma":0.00065452914,"threshold_uncertainty_score":0.040175498},"labels":[],"label_agreement":null},{"id":"W43069128","doi":"","title":"Some Properties of (k, 0)-sets of Cyclic Groups.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cyclic group; Pure mathematics","score_opus":0.013790653651423486,"score_gpt":0.1798142748881543,"score_spread":0.1660236212367308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W43069128","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57287097,0.0021709765,0.090261765,0.003332272,0.0005344752,0.00015280693,0.0020394807,0.00039415402,0.32824308],"genre_scores_gemma":[0.95966125,0.0006964675,0.01708183,0.0006833386,0.00044586227,0.00016808076,0.001075657,0.000094766874,0.020092689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887055,0.00033008857,0.000093291776,0.00021989582,0.00027783203,0.00020842004],"domain_scores_gemma":[0.99595934,0.0024480773,0.0005262224,0.0003797595,0.00028635588,0.000400247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096434867,0.0004957703,0.0005226068,0.002529299,0.0029675667,0.004269029,0.001023982,0.0012342964,0.012108282],"category_scores_gemma":[0.0045784866,0.0005696817,0.00079351437,0.0022003988,0.0031666877,0.004334349,0.002482201,0.0015145333,0.0014447015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005655399,0.000024441553,0.0005641969,0.0000538999,0.000011678803,0.00012966392,0.0003840895,0.0005549548,0.0011660785,0.989316,0.0020921605,0.0056463755],"study_design_scores_gemma":[0.000020590645,0.000028182109,0.0006571044,0.00003026427,0.000011189753,0.00031280593,0.0002117966,0.0017416043,0.0009182416,0.9900748,0.0059757535,0.000017610217],"about_ca_topic_score_codex":0.00085112103,"about_ca_topic_score_gemma":0.0007618415,"teacher_disagreement_score":0.012108282,"about_ca_system_score_codex":0.0012731884,"about_ca_system_score_gemma":0.00057053805,"threshold_uncertainty_score":0.040506303},"labels":[],"label_agreement":null},{"id":"W43227363","doi":"","title":"Average distance in k-connected tournaments.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01215013825521703,"score_gpt":0.2710863167351376,"score_spread":0.25893617847992056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W43227363","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.734965,0.0033572346,0.19748814,0.00347296,0.00040953347,0.000097206146,0.0024274054,0.00089498895,0.05688752],"genre_scores_gemma":[0.96729594,0.0009541019,0.019711677,0.00029921604,0.00033527424,0.00010226437,0.0010070177,0.00017098057,0.010123522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979673,0.000474279,0.00012003985,0.0006003521,0.00045932323,0.00037871787],"domain_scores_gemma":[0.98606586,0.008875857,0.0015429811,0.0009675308,0.0008073402,0.001740506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015173755,0.0007166055,0.001857983,0.0026383684,0.0021732883,0.005371954,0.003187843,0.0019584526,0.010778454],"category_scores_gemma":[0.017416012,0.00060274004,0.0008360756,0.0036451553,0.0019821771,0.006286991,0.002472764,0.002264267,0.001345112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081080676,0.00019533969,0.006667216,0.0004912235,0.00022485947,0.00030401847,0.00071872113,0.06022927,0.003273651,0.8517532,0.016325753,0.059005976],"study_design_scores_gemma":[0.00009490559,0.0000943281,0.002271532,0.00005160685,0.000072812596,0.0004437291,0.00019039722,0.10145399,0.0010423086,0.8896277,0.004616802,0.000039955048],"about_ca_topic_score_codex":0.0018075919,"about_ca_topic_score_gemma":0.0025300677,"teacher_disagreement_score":0.010778454,"about_ca_system_score_codex":0.0024648705,"about_ca_system_score_gemma":0.0007860411,"threshold_uncertainty_score":0.03605753},"labels":[],"label_agreement":null},{"id":"W43266184","doi":"","title":"Graceful Lobsters Obtained from Diameter Four Trees Using Partitioning Technique.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.03835592948898357,"score_gpt":0.2536990941832677,"score_spread":0.2153431646942841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W43266184","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4382429,0.0010314378,0.49784154,0.0007448265,0.000267814,0.00018951848,0.0018704126,0.0020192135,0.057792343],"genre_scores_gemma":[0.7854589,0.0005985431,0.17123413,0.00023294069,0.00008205453,0.00013619548,0.0031034744,0.00061278907,0.038540956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997552,0.000029838246,0.000017508193,0.000056290894,0.000069378584,0.00007181262],"domain_scores_gemma":[0.99909294,0.00029346158,0.000089602174,0.00032467593,0.00007959759,0.0001198302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029244903,0.00047236454,0.0008132671,0.0013835866,0.0011664056,0.001514043,0.0010001966,0.0006839617,0.007271942],"category_scores_gemma":[0.0020230003,0.00034842567,0.00075592875,0.0011655494,0.0008570281,0.0014800492,0.0017628026,0.0011068144,0.0019733065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013155359,0.00031748982,0.007657388,0.0007235223,0.00018300314,0.0020972781,0.001417884,0.066447236,0.07716659,0.5065697,0.02638953,0.30971473],"study_design_scores_gemma":[0.00018633775,0.00031712512,0.0066938773,0.0002025878,0.00021778008,0.0020159604,0.0008203993,0.23286921,0.045086697,0.648689,0.062783614,0.000117397416],"about_ca_topic_score_codex":0.0012304714,"about_ca_topic_score_gemma":0.0024872334,"teacher_disagreement_score":0.007271942,"about_ca_system_score_codex":0.0005837679,"about_ca_system_score_gemma":0.00068175525,"threshold_uncertainty_score":0.0243271},"labels":[],"label_agreement":null},{"id":"W43417702","doi":"","title":"The glueing number of ordered sets.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01478113677538938,"score_gpt":0.24642111615273235,"score_spread":0.23163997937734296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W43417702","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21620733,0.005004822,0.30429456,0.004182208,0.0029895834,0.00013535429,0.0019671053,0.0015212437,0.46369776],"genre_scores_gemma":[0.881297,0.0025057958,0.06940114,0.00083020213,0.0010453948,0.00020668046,0.0010429958,0.0004725687,0.043198183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978446,0.00051159697,0.00021496534,0.00049999246,0.00054777856,0.0003811055],"domain_scores_gemma":[0.9931865,0.0033237669,0.00063430215,0.0011163452,0.00070889987,0.0010302614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018686258,0.00076472404,0.0010387345,0.004628121,0.00298646,0.005514666,0.0013328984,0.0014216623,0.015955744],"category_scores_gemma":[0.011940705,0.0007002018,0.0009558435,0.0027412286,0.0054351236,0.013272902,0.0041688783,0.0034679605,0.0039156848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006377681,0.000007858926,0.00028518034,0.0000504239,0.000006440971,0.00005368037,0.00014984171,0.00032074575,0.00049450103,0.98377013,0.0022326042,0.012564826],"study_design_scores_gemma":[0.000007681051,0.000015078116,0.0002198332,0.000039241655,0.000010806729,0.0001393568,0.00008548904,0.0010598132,0.00093410077,0.9866002,0.010873912,0.000014510678],"about_ca_topic_score_codex":0.0007371619,"about_ca_topic_score_gemma":0.00089070055,"teacher_disagreement_score":0.015955744,"about_ca_system_score_codex":0.0015570178,"about_ca_system_score_gemma":0.00090706773,"threshold_uncertainty_score":0.05337727},"labels":[],"label_agreement":null},{"id":"W43428214","doi":"","title":"A Bijective Proof of an Identity Concerning Nodes of Fixed Degree in Planted Trees.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bijection; Degree (music); Identity (music); Combinatorics; Discrete mathematics; Aesthetics","score_opus":0.02417275242599681,"score_gpt":0.2655721328022063,"score_spread":0.2413993803762095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W43428214","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04948552,0.0023278578,0.70085776,0.008635935,0.0031854415,0.00019612316,0.0012612713,0.0015162032,0.23253387],"genre_scores_gemma":[0.6786164,0.0029707968,0.2294248,0.0069126235,0.0022221399,0.00057255605,0.0016042562,0.0019189029,0.075757496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835145,0.0004926346,0.00010261577,0.0003830071,0.00043787487,0.00023251024],"domain_scores_gemma":[0.9923368,0.004864551,0.00032148825,0.00094568037,0.0009760742,0.00055537856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018486081,0.00086899847,0.0011291486,0.0012474225,0.003474765,0.002990697,0.0023482833,0.0023936876,0.016144032],"category_scores_gemma":[0.010726274,0.0011266345,0.0021556295,0.0016635046,0.004042535,0.013765438,0.007389162,0.008343468,0.0035419164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003141153,0.00006128019,0.00019500247,0.00013021579,0.000016949321,0.0001814121,0.00048544048,0.0004829124,0.0012833884,0.9789523,0.009234648,0.008944913],"study_design_scores_gemma":[0.000017035634,0.000014534212,0.00020937259,0.000035782963,0.00002335924,0.00028009617,0.00012873804,0.0015426989,0.0008819776,0.98446876,0.012377903,0.000019663194],"about_ca_topic_score_codex":0.0021537398,"about_ca_topic_score_gemma":0.003016618,"teacher_disagreement_score":0.016144032,"about_ca_system_score_codex":0.0019934885,"about_ca_system_score_gemma":0.0013767186,"threshold_uncertainty_score":0.054007173},"labels":[],"label_agreement":null},{"id":"W4385341391","doi":"10.61091/ars156-05","title":"Equitable Edge Coloring of Splitting Graph of Some Classes of Wheel Graphs","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Edge coloring; Mathematics; Combinatorics; Graph coloring; Brooks' theorem; Graph; Fractional coloring; List coloring; Chromatic scale; Complete coloring; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Graph power; Line graph; Computer science; Artificial intelligence","score_opus":0.023230566677458306,"score_gpt":0.25226463351926687,"score_spread":0.22903406684180855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385341391","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8772908,0.00017892904,0.10262872,0.0002016513,0.000031714084,0.000047168214,0.00043102124,0.00014396313,0.019046018],"genre_scores_gemma":[0.9750329,0.00012452189,0.02121501,0.00005071251,0.000014831015,0.00003984246,0.00055371353,0.000042877004,0.002925563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956125,0.00007313015,0.000022838138,0.00012589064,0.000074575495,0.00014222719],"domain_scores_gemma":[0.99905723,0.00027668237,0.00014753311,0.00020246954,0.00016185905,0.00015421356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027933152,0.00027521822,0.00029188916,0.0009101293,0.0010497925,0.0007762837,0.00055973866,0.0003659448,0.003956779],"category_scores_gemma":[0.0011285375,0.00021832886,0.00026713673,0.0006683758,0.0006450471,0.0013799387,0.000587239,0.00051045953,0.00018622896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007612092,0.0003324716,0.028055899,0.00026396304,0.00007557261,0.0010184182,0.0014338173,0.06917396,0.06382351,0.7102953,0.008326913,0.11643904],"study_design_scores_gemma":[0.00009531192,0.00017169387,0.021612523,0.00005901099,0.00007914902,0.0016186137,0.0012467414,0.29345474,0.029072965,0.62570375,0.026814286,0.0000712368],"about_ca_topic_score_codex":0.002507905,"about_ca_topic_score_gemma":0.0038708944,"teacher_disagreement_score":0.003956779,"about_ca_system_score_codex":0.0009041814,"about_ca_system_score_gemma":0.0004289113,"threshold_uncertainty_score":0.0132367015},"labels":[],"label_agreement":null},{"id":"W4385341429","doi":"10.61091/ars","title":"Ars Combinatoria","year":2023,"lang":"en","type":"paratext","venue":"Ars Combinatoria","topic":"Architecture and Art History Studies","field":"Arts and Humanities","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.02848788420724892,"score_gpt":0.24261188357090013,"score_spread":0.2141239993636512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385341429","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034646373,0.003265721,0.0047541847,0.005233712,0.006589619,0.00008066581,0.004300677,0.001603787,0.97382516],"genre_scores_gemma":[0.013396439,0.007603009,0.00597069,0.0026453924,0.005304401,0.00029022119,0.0062723327,0.0028384372,0.9556791],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99498534,0.00082977256,0.0004210251,0.0012947316,0.0021485705,0.00032054863],"domain_scores_gemma":[0.9948723,0.0010778871,0.0003355286,0.0013961906,0.0017680551,0.0005500767],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0023610923,0.002145593,0.0025807042,0.0055009723,0.004645284,0.02363354,0.00200102,0.0031076374,0.54336965],"category_scores_gemma":[0.009965954,0.0012232589,0.0013853777,0.009750637,0.0035489474,0.012376725,0.0052922345,0.008445491,0.47369927],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038135902,0.000028831411,0.0001488811,0.00030877313,0.000016465758,0.00007003565,0.00010040997,0.00024812832,0.00026661938,0.2697977,0.6522117,0.07676436],"study_design_scores_gemma":[0.0000062640634,0.000007515349,0.00013545917,0.00006790708,0.0000038871644,0.000086574626,0.000028512031,0.00014504108,0.00007112781,0.029786581,0.9696511,0.00000995043],"about_ca_topic_score_codex":0.007989556,"about_ca_topic_score_gemma":0.0051179933,"teacher_disagreement_score":0.45663035,"about_ca_system_score_codex":0.008502576,"about_ca_system_score_gemma":0.004268494,"threshold_uncertainty_score":0.6513277},"labels":[],"label_agreement":null},{"id":"W4385341959","doi":"10.61091/ars156-01","title":"Radio Antipodal Labeling of Mongolian Tent and Torus Grid Graphs","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"SSN College of Engineering","keywords":"Antipodal point; Mathematics; Torus; Grid; Combinatorics; Geometry","score_opus":0.012926107791912875,"score_gpt":0.2251847969094647,"score_spread":0.2122586891175518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385341959","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97387064,0.0001027133,0.018650142,0.00009664908,0.000009780452,0.000013021334,0.00024007996,0.000049621794,0.0069673695],"genre_scores_gemma":[0.98098826,0.00009460396,0.016335798,0.000025502239,0.000008696929,0.000022495497,0.00036417934,0.000014250353,0.002146207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99986815,0.000030333822,0.000008677758,0.00003173187,0.000020176776,0.000040931587],"domain_scores_gemma":[0.9993795,0.00026586116,0.00013387094,0.00008931694,0.000049917882,0.00008147522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019514778,0.00015055621,0.00022023753,0.0005067791,0.00059235276,0.00062166504,0.00038973647,0.00030519496,0.0020170854],"category_scores_gemma":[0.00089665904,0.00017699288,0.00017917124,0.00038822985,0.0005328412,0.0008288572,0.00048533693,0.00026439913,0.00017591826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011613863,0.00019340265,0.033306967,0.00040257364,0.000064492546,0.00064270437,0.0018899161,0.09591376,0.050813988,0.70575804,0.0075457734,0.102307044],"study_design_scores_gemma":[0.00011853825,0.00041873552,0.024397166,0.00008113882,0.00007585103,0.0017735038,0.0015806366,0.38104194,0.023416448,0.5329895,0.034040503,0.00006606248],"about_ca_topic_score_codex":0.0010893304,"about_ca_topic_score_gemma":0.0017085781,"teacher_disagreement_score":0.0020170854,"about_ca_system_score_codex":0.00063110417,"about_ca_system_score_gemma":0.0003164704,"threshold_uncertainty_score":0.006747782},"labels":[],"label_agreement":null},{"id":"W4385349867","doi":"10.61091/ars156-02","title":"Further Results on Radio Number of Wedge sum of Graphs","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Injective function; Graph; Physics","score_opus":0.01695318783950207,"score_gpt":0.25242533733964795,"score_spread":0.2354721495001459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385349867","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80482775,0.0011481756,0.15409304,0.00029889485,0.00006917289,0.000044912733,0.00084806926,0.0007200114,0.037949953],"genre_scores_gemma":[0.9511923,0.0004941885,0.040678494,0.00012841859,0.00008956303,0.0000760514,0.0014975268,0.0002630748,0.0055803163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995173,0.00008137044,0.000021057222,0.00012029832,0.00014620624,0.000113768925],"domain_scores_gemma":[0.99855417,0.00066724233,0.00025042813,0.00021041316,0.00013319583,0.00018449112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045124933,0.00055298075,0.00044746557,0.0019193398,0.00063576724,0.00093000237,0.0010161588,0.00034624353,0.004994255],"category_scores_gemma":[0.003033846,0.0002537022,0.00065088324,0.0012833585,0.00096095284,0.0020090463,0.0011556349,0.00081193744,0.00051734323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007056393,0.00029706286,0.03932593,0.0008923529,0.00016180218,0.001145729,0.0016802646,0.1532589,0.04325174,0.62573004,0.010909714,0.1226409],"study_design_scores_gemma":[0.000059497543,0.00042376434,0.029344387,0.00011905757,0.0001948841,0.002304703,0.00080662436,0.42311162,0.025340283,0.4841866,0.034011006,0.000097620774],"about_ca_topic_score_codex":0.0006888378,"about_ca_topic_score_gemma":0.0006909308,"teacher_disagreement_score":0.004994255,"about_ca_system_score_codex":0.0005312187,"about_ca_system_score_gemma":0.00023716199,"threshold_uncertainty_score":0.01670742},"labels":[],"label_agreement":null},{"id":"W4385349925","doi":"10.61091/ars156-03","title":"ombinatorial Bounds of the Regularity of Elimination Ideals","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Commutative Algebra and Its Applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Monomial; Simple (philosophy); Monomial ideal; Combinatorics; Type (biology); Square (algebra); Discrete mathematics; Pure mathematics; Mathematical analysis; Polynomial ring; Polynomial; Geometry","score_opus":0.039305332518659544,"score_gpt":0.3220477836810988,"score_spread":0.2827424511624393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385349925","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6690028,0.005095322,0.21252501,0.0028417485,0.00023881452,0.00007018955,0.00071062444,0.00045477212,0.10906081],"genre_scores_gemma":[0.97890145,0.000775085,0.015094384,0.00015302598,0.00025481905,0.00005261111,0.0002961291,0.000074083546,0.004398262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986123,0.0002936635,0.000058100395,0.00036995017,0.00041699054,0.00024898312],"domain_scores_gemma":[0.9894907,0.0078434,0.0007682532,0.00075373554,0.0005433833,0.0006005388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020250056,0.0007461495,0.00086861517,0.0029457973,0.0012706461,0.0022613304,0.0015967595,0.0006962712,0.0041660625],"category_scores_gemma":[0.008784347,0.00054631685,0.0008455004,0.0013506737,0.0027847479,0.004844642,0.0026140222,0.0031729634,0.00044171527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002479292,0.00008658791,0.004718941,0.00019903267,0.00005477837,0.0003133473,0.00042238858,0.007908013,0.008779468,0.959857,0.0019360103,0.015476522],"study_design_scores_gemma":[0.000021713047,0.00007445082,0.004305014,0.000047780664,0.000054258267,0.0004928077,0.00014810098,0.07297297,0.008580624,0.9087956,0.0044566155,0.000050075905],"about_ca_topic_score_codex":0.00045777977,"about_ca_topic_score_gemma":0.0006556567,"teacher_disagreement_score":0.0041660625,"about_ca_system_score_codex":0.0011771006,"about_ca_system_score_gemma":0.0002964338,"threshold_uncertainty_score":0.013936877},"labels":[],"label_agreement":null},{"id":"W4385350581","doi":"10.61091/ars156-04","title":"A Note on Distance Irregular Labeling of Graphs","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Bound graph; Graph power; Discrete mathematics; Line graph","score_opus":0.013396903220207557,"score_gpt":0.24255414817006432,"score_spread":0.22915724494985676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385350581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2728746,0.0057803104,0.62925565,0.0025740725,0.001254166,0.000083824234,0.0005945253,0.0010070123,0.086575784],"genre_scores_gemma":[0.8311045,0.004307085,0.15330012,0.00059370045,0.00082799647,0.00007000042,0.00072016555,0.00026596303,0.008810443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992467,0.00017040994,0.0000512587,0.00022333095,0.00022070842,0.00008759931],"domain_scores_gemma":[0.99829227,0.0006474972,0.00020884418,0.00036813074,0.00027600658,0.00020730651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056240265,0.0004343495,0.00043697478,0.0012939299,0.00103782,0.0010313503,0.0006744948,0.0006670236,0.0030895027],"category_scores_gemma":[0.0030743815,0.0003078267,0.0005697737,0.0023078322,0.0014401452,0.0030453077,0.0011730224,0.0015026439,0.00051193306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015045992,0.00005337231,0.0051886453,0.00033086396,0.000034631757,0.00064634206,0.0011790138,0.022620857,0.014656497,0.8568552,0.0075099035,0.090774156],"study_design_scores_gemma":[0.000015597934,0.00016551295,0.0038200174,0.00006929702,0.000043571577,0.0011806434,0.0006922321,0.07810949,0.00755704,0.85325706,0.055009227,0.00008040512],"about_ca_topic_score_codex":0.0014445116,"about_ca_topic_score_gemma":0.0011299708,"teacher_disagreement_score":0.0030895027,"about_ca_system_score_codex":0.0008545874,"about_ca_system_score_gemma":0.00026731938,"threshold_uncertainty_score":0.010335445},"labels":[],"label_agreement":null},{"id":"W4385892758","doi":"10.61091/ars156-06","title":"Royal Colorings of Graphs","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Edge coloring; Mathematics; Vertex (graph theory); Complete coloring; Fractional coloring; List coloring; Graph; Greedy coloring; Graph coloring; Discrete mathematics; Graph power; Line graph","score_opus":0.014004832174625573,"score_gpt":0.22815570783966613,"score_spread":0.21415087566504054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385892758","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34139132,0.0035649417,0.37293956,0.0025715274,0.00083105365,0.00015783685,0.0014530072,0.0012562154,0.27583447],"genre_scores_gemma":[0.8543522,0.0019982986,0.10957388,0.0007769136,0.00065458263,0.00012353105,0.0009629443,0.00041512362,0.031142568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978169,0.00051667535,0.00014143476,0.0004746692,0.00052237697,0.0005278752],"domain_scores_gemma":[0.9945615,0.0023870133,0.0007639706,0.0011243335,0.0005387619,0.000624373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017022663,0.000687439,0.00072090747,0.0018404094,0.0017699029,0.0034356688,0.0010729587,0.0008141983,0.0065009454],"category_scores_gemma":[0.005762027,0.0007779948,0.0011411482,0.0015053471,0.004024756,0.004539944,0.0025469433,0.0022926324,0.0015581709],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008767967,0.000017773767,0.00041356654,0.00010375414,0.000012426138,0.00006396613,0.00030835968,0.0045802644,0.002172531,0.97488743,0.0037675365,0.013584705],"study_design_scores_gemma":[0.000029695946,0.000045346947,0.00061037287,0.000039890358,0.000017200076,0.00025881527,0.00017880891,0.014587767,0.0019647647,0.9590196,0.023210187,0.000037439804],"about_ca_topic_score_codex":0.00133004,"about_ca_topic_score_gemma":0.0016597173,"teacher_disagreement_score":0.0065009454,"about_ca_system_score_codex":0.0023433832,"about_ca_system_score_gemma":0.00070225546,"threshold_uncertainty_score":0.021747887},"labels":[],"label_agreement":null},{"id":"W43882796","doi":"","title":"Hyperhamiltonicity Of The Cartesian Product Of Two Directed Cycles.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Mathematics; Product (mathematics); Combinatorics; Geometry","score_opus":0.015748186784744406,"score_gpt":0.2610002338938697,"score_spread":0.24525204710912532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W43882796","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7023671,0.0010339946,0.12327183,0.0007786785,0.00037999268,0.000110436944,0.00043910125,0.00018368359,0.17143515],"genre_scores_gemma":[0.9751126,0.0003197487,0.007794066,0.00012609496,0.00007357994,0.000059723563,0.00017920836,0.000032383774,0.016302595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960035,0.00010954948,0.000020155663,0.000085536056,0.00008692598,0.000097630196],"domain_scores_gemma":[0.99944097,0.000139902,0.000106847576,0.00006779899,0.000110853056,0.00013362037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029311536,0.00026987641,0.0002452654,0.0005443774,0.000929338,0.0012976669,0.0003705307,0.00037877218,0.005730554],"category_scores_gemma":[0.0010485617,0.00025126175,0.00028517272,0.00036874058,0.0012085123,0.0013906792,0.001403846,0.0005545211,0.00077278895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007762012,0.000012321891,0.0003543775,0.000023481543,0.0000071338113,0.0002612596,0.00037098018,0.0009376106,0.002246472,0.9907611,0.0007837037,0.0041640196],"study_design_scores_gemma":[0.000045219567,0.00006396826,0.0004998002,0.000021943843,0.000020513668,0.00035148303,0.00035426777,0.008977446,0.003823012,0.97153026,0.014286153,0.000026035357],"about_ca_topic_score_codex":0.0015940359,"about_ca_topic_score_gemma":0.002122446,"teacher_disagreement_score":0.005730554,"about_ca_system_score_codex":0.0005667355,"about_ca_system_score_gemma":0.0005315471,"threshold_uncertainty_score":0.019170582},"labels":[],"label_agreement":null},{"id":"W4391127430","doi":"10.61091/ars157-11","title":"Independent Fixed Connected Geodetic Number of a Graph","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Geodetic datum; Mathematics; Graph; Combinatorics; Geodesy; Geography","score_opus":0.018683842477843642,"score_gpt":0.2954436813489655,"score_spread":0.2767598388711218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127430","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7618943,0.0007809824,0.17588122,0.0005658133,0.0000917118,0.00009804751,0.00077987456,0.0004513996,0.05945664],"genre_scores_gemma":[0.97215414,0.00033817664,0.021679249,0.000066692046,0.000050588733,0.00009844373,0.00045423218,0.0000699456,0.0050884327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994211,0.00011287593,0.000020178413,0.0001829793,0.00015233131,0.000110556626],"domain_scores_gemma":[0.99786025,0.0010473668,0.0003315331,0.0002875716,0.00020079201,0.00027243904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039198424,0.0005304671,0.0005442571,0.002480453,0.0012499891,0.0016156335,0.0010349719,0.0007576232,0.00597333],"category_scores_gemma":[0.0028423136,0.00036725678,0.0005411892,0.0016296097,0.0020463646,0.002499879,0.0011750797,0.0011354354,0.00044971696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022737478,0.00004420364,0.003749678,0.00020012053,0.000051160227,0.00032184095,0.00039956698,0.023807567,0.017042939,0.9327245,0.0025572556,0.01887375],"study_design_scores_gemma":[0.000062385705,0.00014552026,0.0076230397,0.000089607296,0.000089785906,0.0012423331,0.00044921777,0.108566016,0.01608167,0.8482038,0.017342929,0.00010379542],"about_ca_topic_score_codex":0.0007550026,"about_ca_topic_score_gemma":0.0010393491,"teacher_disagreement_score":0.00597333,"about_ca_system_score_codex":0.0012105688,"about_ca_system_score_gemma":0.0005797217,"threshold_uncertainty_score":0.019982815},"labels":[],"label_agreement":null},{"id":"W4391127438","doi":"10.61091/ars157-09","title":"On Tades of Disjoint Union of Some Graphs","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Disjoint sets; Disjoint union (topology); Combinatorics; Discrete mathematics","score_opus":0.014070247058755914,"score_gpt":0.23380750556491342,"score_spread":0.2197372585061575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127438","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77761775,0.0002957876,0.19331299,0.00034877233,0.00006938419,0.000055500095,0.0006500062,0.00056612096,0.02708378],"genre_scores_gemma":[0.8729763,0.00022909445,0.113822624,0.00014023215,0.000056162848,0.00008599986,0.0015386362,0.00021068129,0.010940253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992793,0.00013995357,0.000041440126,0.000240927,0.00014876881,0.00014956147],"domain_scores_gemma":[0.99857473,0.000567603,0.00025532927,0.0002743754,0.00016827138,0.00015967496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050039834,0.0004670842,0.00047542359,0.0018381893,0.001298961,0.0015197296,0.00071803184,0.0006400925,0.0068910704],"category_scores_gemma":[0.0026537005,0.0005007588,0.00076146476,0.0012681372,0.0014842079,0.0024173371,0.001558473,0.00088569935,0.00068965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030156286,0.00007275862,0.0063735526,0.0001513627,0.000046230685,0.00032382665,0.00081224827,0.022786943,0.0071452055,0.92786056,0.0038146628,0.030310998],"study_design_scores_gemma":[0.000038941074,0.00010061878,0.0036354307,0.00005108725,0.0000461847,0.00056942913,0.00067783735,0.124727614,0.007208131,0.8471256,0.015791614,0.000027517824],"about_ca_topic_score_codex":0.0013908122,"about_ca_topic_score_gemma":0.0018376776,"teacher_disagreement_score":0.0068910704,"about_ca_system_score_codex":0.00095961714,"about_ca_system_score_gemma":0.00030627317,"threshold_uncertainty_score":0.02305293},"labels":[],"label_agreement":null},{"id":"W4391127440","doi":"10.61091/ars157-08","title":"Total Dominator Colorings of P 4 -reducible and P 4 -tidy Graphs","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.012254370400480987,"score_gpt":0.22937707837489707,"score_spread":0.21712270797441607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127440","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8832375,0.0002787587,0.098330185,0.0005407359,0.000031852203,0.00010157868,0.0017620883,0.0004838973,0.015233345],"genre_scores_gemma":[0.92442423,0.0002528316,0.066952735,0.00008849454,0.000026603106,0.00008768897,0.002344845,0.000097481214,0.005725078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999619,0.000063814725,0.00002573818,0.00011447458,0.00007676896,0.000100165234],"domain_scores_gemma":[0.9985636,0.00072938774,0.00022390502,0.00022296191,0.00011119029,0.00014894523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003736408,0.00038337437,0.0004637179,0.0012409803,0.0010260737,0.001942388,0.00070159347,0.00043235836,0.0026665232],"category_scores_gemma":[0.0018590613,0.00044629324,0.00063430745,0.0011178937,0.001065695,0.0014271697,0.0008865982,0.0008346416,0.00017821064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012656556,0.0002867882,0.027150182,0.00067813304,0.00012582116,0.000985241,0.0023004205,0.2259392,0.040795565,0.53188366,0.013447697,0.15514164],"study_design_scores_gemma":[0.0001380265,0.000120896475,0.0093493,0.000056036708,0.00007331036,0.00072006555,0.0009912688,0.26390612,0.015593119,0.6984646,0.010526322,0.000060954626],"about_ca_topic_score_codex":0.004280858,"about_ca_topic_score_gemma":0.0060222484,"teacher_disagreement_score":0.004280858,"about_ca_system_score_codex":0.0016660255,"about_ca_system_score_gemma":0.00079864246,"threshold_uncertainty_score":0.012087882},"labels":[],"label_agreement":null},{"id":"W4391127473","doi":"10.61091/ars157-06","title":"Results on Grundy Chromatic Number of Join Graph of Graphs","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Join (topology); Combinatorics; Graph","score_opus":0.017827237562604466,"score_gpt":0.2561446523972409,"score_spread":0.23831741483463642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127473","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6518283,0.004286314,0.21082075,0.0016965711,0.00024073213,0.000079656755,0.0014006259,0.00050694065,0.12914024],"genre_scores_gemma":[0.9546383,0.001597111,0.032996703,0.00016671063,0.00016963076,0.000078939134,0.0005450006,0.00013378952,0.009673826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994349,0.00008315043,0.00001969547,0.00018735004,0.00011672413,0.00015811928],"domain_scores_gemma":[0.9979001,0.00116095,0.00022761655,0.0002619061,0.00018298453,0.0002664891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059082784,0.0004959222,0.0006033036,0.0023184228,0.0018906533,0.0019050328,0.00088073,0.00058396405,0.0064060153],"category_scores_gemma":[0.0023576128,0.00035513227,0.0007449243,0.0020646583,0.0024080698,0.0037909278,0.00145221,0.0019374063,0.00071490393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021226128,0.000058446116,0.0046326527,0.00018343232,0.00003269724,0.000093070834,0.00058811833,0.02319783,0.006212322,0.93426746,0.0046708933,0.025850788],"study_design_scores_gemma":[0.0000403914,0.000114449766,0.0053157276,0.000056299963,0.000047810285,0.00034679496,0.00046089134,0.069440655,0.0072458927,0.89321643,0.023657737,0.000056978064],"about_ca_topic_score_codex":0.0037725002,"about_ca_topic_score_gemma":0.0034723864,"teacher_disagreement_score":0.0064060153,"about_ca_system_score_codex":0.0020295233,"about_ca_system_score_gemma":0.0007587803,"threshold_uncertainty_score":0.021430254},"labels":[],"label_agreement":null},{"id":"W4391127474","doi":"10.61091/ars157-01","title":"Sum Divisor Cordial Labeling of T p -Tree Related Graphs","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Divisor (algebraic geometry); Tree (set theory); Discrete mathematics","score_opus":0.014532946269376087,"score_gpt":0.23233158679085675,"score_spread":0.21779864052148065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127474","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7747695,0.0003986834,0.17449988,0.0005021417,0.000099633035,0.00009058688,0.0007431854,0.00080287986,0.04809351],"genre_scores_gemma":[0.9063729,0.0003079336,0.08036777,0.00015742792,0.000051994182,0.00007992062,0.0009915115,0.000105350446,0.0115650995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997863,0.000042983866,0.000015826005,0.00007168368,0.000041290135,0.000041967003],"domain_scores_gemma":[0.99924695,0.00018705706,0.00014389935,0.0001640005,0.00012345688,0.00013474756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017417708,0.0002032207,0.00026798772,0.0007341998,0.00095005,0.000959665,0.00048747525,0.00042951116,0.005113974],"category_scores_gemma":[0.001151496,0.00015151767,0.00025507913,0.0009855321,0.0006009446,0.001377827,0.0007167858,0.00060112367,0.00053344824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035692446,0.0001598557,0.004699207,0.00024575726,0.000027617096,0.0008262798,0.0009406775,0.018805034,0.043643206,0.7742277,0.007019629,0.14904806],"study_design_scores_gemma":[0.000049266022,0.00019949202,0.00414342,0.000056699002,0.00005425608,0.0016285256,0.0005800902,0.1313669,0.030701559,0.78747773,0.043701578,0.00004047766],"about_ca_topic_score_codex":0.0009579933,"about_ca_topic_score_gemma":0.0012471154,"teacher_disagreement_score":0.005113974,"about_ca_system_score_codex":0.0008600627,"about_ca_system_score_gemma":0.00037692057,"threshold_uncertainty_score":0.017108023},"labels":[],"label_agreement":null},{"id":"W4391127486","doi":"10.61091/ars157-02","title":"On Lie Derivations, Generalized Lie Derivations and Lie Centralizers of Octonion Algebras","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics; Lie algebra; Simple Lie group; Killing form; Lie theory; Algebra over a field; Adjoint representation of a Lie algebra; Lie conformal algebra","score_opus":0.0396619479369193,"score_gpt":0.3149132896548352,"score_spread":0.27525134171791593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127486","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56244904,0.010335866,0.27684677,0.0023425226,0.00056998676,0.00010054256,0.00044245095,0.00020579883,0.14670706],"genre_scores_gemma":[0.9464606,0.0040075066,0.029664345,0.0004072328,0.0008895418,0.00006826811,0.00025936146,0.0000723735,0.018170789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995222,0.00015479911,0.00002295032,0.00008533269,0.00012223763,0.000092379516],"domain_scores_gemma":[0.99955446,0.00010768169,0.00007956126,0.000046738827,0.00010979296,0.00010180378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006421975,0.0006289932,0.00043516632,0.0018688516,0.0011850242,0.0014580861,0.00053259317,0.00056701753,0.0032841908],"category_scores_gemma":[0.0011786434,0.00020621455,0.00053577387,0.0016854024,0.0030118779,0.0038468428,0.0015626878,0.0014157582,0.00079913303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001914525,0.00001380873,0.00023734629,0.000039006205,0.0000054792663,0.00012767561,0.00037695566,0.0008070993,0.0019510229,0.9892124,0.00050249207,0.0067076264],"study_design_scores_gemma":[0.0000062257946,0.000038206927,0.00041021666,0.000018754125,0.000005039677,0.00024730866,0.00016367258,0.0038674634,0.00083665724,0.9892184,0.005169627,0.0000183383],"about_ca_topic_score_codex":0.0007574247,"about_ca_topic_score_gemma":0.0006424004,"teacher_disagreement_score":0.0032841908,"about_ca_system_score_codex":0.00067202514,"about_ca_system_score_gemma":0.0005564823,"threshold_uncertainty_score":0.010986686},"labels":[],"label_agreement":null},{"id":"W4391127496","doi":"10.61091/ars157-05","title":"Tutte polynomial of self-similar network models with applications","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Tutte polynomial; Polynomial; Combinatorics; Discrete mathematics; Mathematical analysis","score_opus":0.009928133510105717,"score_gpt":0.23704206009602746,"score_spread":0.22711392658592175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127496","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41638857,0.0011392896,0.5551269,0.0013386194,0.00011970275,0.00009110762,0.00042641806,0.0003683551,0.025000947],"genre_scores_gemma":[0.9742036,0.0005932322,0.019281508,0.00013828195,0.00012158871,0.00009869719,0.00019854822,0.00009601696,0.0052684303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948895,0.00020077094,0.000013744301,0.00007634532,0.000094893214,0.00012539937],"domain_scores_gemma":[0.9966684,0.0019927586,0.0003414834,0.00031389878,0.00034760937,0.00033579185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083132455,0.0004978831,0.000617253,0.0015300994,0.00085225556,0.0012207715,0.0009267159,0.0009832807,0.004824815],"category_scores_gemma":[0.008168007,0.0003150444,0.00080615655,0.0010227609,0.0015852654,0.0025540993,0.0012784014,0.0013729165,0.00047345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005968227,0.0000538562,0.001795986,0.000088935565,0.000025555297,0.00015597443,0.00018629724,0.17625916,0.0019459467,0.8093631,0.0025826,0.007482743],"study_design_scores_gemma":[0.0000063183857,0.000016948574,0.00036069157,0.000010952625,0.000007915725,0.00007851874,0.000052204392,0.7001274,0.00043870293,0.29773962,0.001147218,0.000013609993],"about_ca_topic_score_codex":0.0030034776,"about_ca_topic_score_gemma":0.0031484147,"teacher_disagreement_score":0.004824815,"about_ca_system_score_codex":0.0012194552,"about_ca_system_score_gemma":0.0007505428,"threshold_uncertainty_score":0.01614064},"labels":[],"label_agreement":null},{"id":"W4391127498","doi":"10.61091/ars157-10","title":"On Vertex-Edge Resolvability for the Web Graph and Prism Related Graph","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Graph; Neighbourhood (mathematics); Discrete mathematics; Mathematical analysis","score_opus":0.01510902090050381,"score_gpt":0.23677102527053426,"score_spread":0.22166200437003045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127498","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8417621,0.00062276074,0.12227633,0.0013977711,0.00008564917,0.000044936547,0.0006534794,0.00028035647,0.032876574],"genre_scores_gemma":[0.973369,0.00022333754,0.021678165,0.00014093556,0.00007920363,0.000059619328,0.0005492094,0.00011445661,0.0037859706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990074,0.00036287057,0.00003713244,0.00022146513,0.00017051883,0.00020054432],"domain_scores_gemma":[0.9943961,0.0035179502,0.0006635008,0.0006742548,0.0002296972,0.00051853183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013513692,0.00058640644,0.0006637299,0.0019038382,0.0017325999,0.0022221843,0.0017085196,0.0014372153,0.006486266],"category_scores_gemma":[0.0064013544,0.00039672854,0.0009068201,0.0012960105,0.0027255905,0.003954887,0.0024066144,0.0018355952,0.00052197423],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009881473,0.000038044225,0.0021009988,0.000061586725,0.000016603879,0.000068541616,0.00018801916,0.022060758,0.0011319946,0.96551025,0.0019203568,0.006803907],"study_design_scores_gemma":[0.000021356886,0.000034572477,0.0013227207,0.000025144602,0.000015786734,0.00015076117,0.00019026727,0.104973786,0.0010945544,0.88972616,0.0024174377,0.000027468614],"about_ca_topic_score_codex":0.0019257206,"about_ca_topic_score_gemma":0.0020658122,"teacher_disagreement_score":0.006486266,"about_ca_system_score_codex":0.0017937842,"about_ca_system_score_gemma":0.000713403,"threshold_uncertainty_score":0.021698713},"labels":[],"label_agreement":null},{"id":"W4391127501","doi":"10.61091/ars157-07","title":"H - V -Super-Strong- ( a , d ) -antimagic decomposition of complete bipartite graphs","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Complete bipartite graph; Graph","score_opus":0.022046636902891516,"score_gpt":0.2638523015819857,"score_spread":0.24180566467909417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127501","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60964876,0.0004568682,0.34148833,0.00072379,0.00008908247,0.00018763964,0.0013455099,0.00043511385,0.045624923],"genre_scores_gemma":[0.8859842,0.00030853978,0.1036352,0.00027912523,0.0000616228,0.00013408653,0.0014105976,0.000065810484,0.008120793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994735,0.00011924986,0.000032651657,0.00013445459,0.00012564163,0.000114496455],"domain_scores_gemma":[0.9985343,0.00039480324,0.00024187456,0.0002258683,0.00026282066,0.00034027145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005149718,0.00047017407,0.0003352498,0.0008351794,0.0009968304,0.001137651,0.0006012491,0.0005109288,0.0031841965],"category_scores_gemma":[0.0014291961,0.00045080605,0.0006547762,0.0007718197,0.00087933516,0.0015699242,0.0016125552,0.0010827916,0.00053469924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046869167,0.00022223362,0.0051370417,0.00045105346,0.00011563884,0.00070990756,0.0011788487,0.02503255,0.051521897,0.8486437,0.007555933,0.058962464],"study_design_scores_gemma":[0.00007944048,0.00020817723,0.0032804722,0.0000766539,0.00008597415,0.0012334981,0.000791419,0.12086372,0.01881052,0.83114094,0.023386974,0.000042201907],"about_ca_topic_score_codex":0.0011096696,"about_ca_topic_score_gemma":0.002116938,"teacher_disagreement_score":0.0031841965,"about_ca_system_score_codex":0.00066303037,"about_ca_system_score_gemma":0.00078802335,"threshold_uncertainty_score":0.0106521845},"labels":[],"label_agreement":null},{"id":"W4391127506","doi":"10.61091/ars157-12","title":"Broadcast Domination in Line Graphs of Trees","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Line (geometry); Combinatorics; Geometry","score_opus":0.021494279347316576,"score_gpt":0.30032992707406947,"score_spread":0.2788356477267529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127506","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73289067,0.0009476131,0.23698491,0.0006103639,0.000027007882,0.00013789207,0.000967344,0.0010321942,0.026402047],"genre_scores_gemma":[0.9510737,0.00044473074,0.04189952,0.00018240725,0.000048588547,0.00014849956,0.00082978205,0.00009119967,0.0052814623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992287,0.00015176725,0.000038049395,0.00021405838,0.00016133754,0.00020614456],"domain_scores_gemma":[0.9954632,0.002351991,0.0008531802,0.00036213826,0.0005666433,0.00040278205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037174232,0.00031954705,0.00048862945,0.0009039074,0.00092200626,0.0013776951,0.0007852,0.000518642,0.0030741917],"category_scores_gemma":[0.0037040224,0.00033492615,0.00031983416,0.0010760906,0.0010006736,0.0016970929,0.0010127269,0.00079300447,0.00038752725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001512373,0.00025559508,0.012583247,0.00080754556,0.00015588748,0.0012954875,0.0026993854,0.1790357,0.09688885,0.5477565,0.014364545,0.14264491],"study_design_scores_gemma":[0.00024066647,0.0004947965,0.008699984,0.00012276319,0.0001373428,0.002398279,0.0015082104,0.5240645,0.031245632,0.38887066,0.04211551,0.000101681995],"about_ca_topic_score_codex":0.0034202358,"about_ca_topic_score_gemma":0.0036856635,"teacher_disagreement_score":0.0034202358,"about_ca_system_score_codex":0.0016353724,"about_ca_system_score_gemma":0.0004553823,"threshold_uncertainty_score":0.011865497},"labels":[],"label_agreement":null},{"id":"W4391127510","doi":"10.61091/ars157-13","title":"Extremal Regular Graphs of Given Chromatic Number","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics","score_opus":0.019419569842584146,"score_gpt":0.28633348463248803,"score_spread":0.2669139147899039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127510","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8688877,0.00024761131,0.075755574,0.0006117669,0.00006640413,0.00004118214,0.00047595287,0.00037327022,0.05354052],"genre_scores_gemma":[0.9757947,0.00010993702,0.018702734,0.00009432935,0.000027474138,0.000028899001,0.00025792356,0.00007140046,0.0049126456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965894,0.00008271102,0.000013282276,0.00010218115,0.000057067362,0.00008582805],"domain_scores_gemma":[0.9989371,0.00034226722,0.00023945568,0.00016206568,0.0001508728,0.00016826214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027543821,0.00032244297,0.00027535236,0.0009785785,0.00080153765,0.00128259,0.0006270231,0.0005439444,0.0045401533],"category_scores_gemma":[0.0013075928,0.00026041624,0.00022848118,0.00063297764,0.0011769336,0.0013212105,0.000762884,0.0008171943,0.0002972049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021107057,0.00005014939,0.0025017955,0.000110702655,0.00002756548,0.00042609565,0.00029874928,0.013728679,0.022897458,0.94616807,0.0021699565,0.011409601],"study_design_scores_gemma":[0.00004732978,0.000101617414,0.005927357,0.00005532763,0.000056095672,0.0010267871,0.00090838695,0.10003847,0.016038248,0.8618273,0.013903992,0.0000691348],"about_ca_topic_score_codex":0.00050867285,"about_ca_topic_score_gemma":0.0012766204,"teacher_disagreement_score":0.0045401533,"about_ca_system_score_codex":0.0008728012,"about_ca_system_score_gemma":0.00023279423,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4391127513","doi":"10.61091/ars157-04","title":"Rainbow Vertex Connection Numbers and Total Rainbow Connection Numbers of Middle and Total Graphs","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Foundation of Henan Educational Committee; National Natural Science Foundation of China; Henan Normal University","keywords":"Rainbow; Connection (principal bundle); Mathematics; Vertex (graph theory); Combinatorics; Graph; Geometry; Physics; Optics","score_opus":0.01376848703772906,"score_gpt":0.22084355689478874,"score_spread":0.20707506985705967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127513","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69658643,0.0024160526,0.23611192,0.0008658097,0.00018460419,0.00011673438,0.001686546,0.00043641252,0.061595522],"genre_scores_gemma":[0.92869693,0.00089579483,0.061564397,0.0001664459,0.00012764467,0.00012800538,0.00073501107,0.00015055774,0.0075352173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988111,0.00020091627,0.00006804436,0.00041009966,0.00024348435,0.00026639557],"domain_scores_gemma":[0.99469155,0.0027332762,0.0007612869,0.0005676089,0.00040735194,0.000839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009757534,0.0007378609,0.00053605024,0.0024773662,0.0013070885,0.0023071712,0.0013740296,0.00068188,0.00729384],"category_scores_gemma":[0.004906318,0.00043800258,0.00091163605,0.002150894,0.0022434667,0.0056387368,0.001781846,0.0014730422,0.00046824882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042731053,0.00009584085,0.0067053563,0.00046068843,0.00008788981,0.00016811996,0.00056521466,0.026599238,0.009627948,0.90062845,0.0048741885,0.04975978],"study_design_scores_gemma":[0.000041353294,0.00015641454,0.0043024253,0.000093405346,0.00010377981,0.00052249327,0.00034964047,0.04958812,0.0070615546,0.9245584,0.013158957,0.00006345754],"about_ca_topic_score_codex":0.0009473672,"about_ca_topic_score_gemma":0.0012845839,"teacher_disagreement_score":0.00729384,"about_ca_system_score_codex":0.0017447012,"about_ca_system_score_gemma":0.00059836614,"threshold_uncertainty_score":0.024400353},"labels":[],"label_agreement":null},{"id":"W4391127520","doi":"10.61091/ars157-14","title":"On Lanzhou Index of Graphs","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Innovation Scientists and Technicians Troop Construction Projects of Henan Province; National Natural Science Foundation of China; Sungkyunkwan University; National Research Foundation","keywords":"Mathematics; Index (typography); Statistics; Computer science; World Wide Web","score_opus":0.028476082883004183,"score_gpt":0.29881417138011196,"score_spread":0.2703380884971078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127520","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.817354,0.0045259246,0.11024168,0.00061607,0.00012287125,0.0000614513,0.0008301671,0.00021095188,0.06603688],"genre_scores_gemma":[0.97339636,0.0014698762,0.0191456,0.00015853118,0.00025765054,0.0000688243,0.00053429423,0.00008374267,0.004885231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938726,0.00012605467,0.000045222467,0.00017001541,0.00014653044,0.00012483286],"domain_scores_gemma":[0.9981305,0.0008426453,0.00041947258,0.00018204062,0.00021788616,0.00020753659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008819775,0.00039220756,0.00065931235,0.003723295,0.00137575,0.0013337428,0.0006004391,0.00054481346,0.004026396],"category_scores_gemma":[0.0032276362,0.00019799267,0.000520206,0.0025523335,0.0015013702,0.0032644626,0.0011832064,0.0009054246,0.0005615122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014216421,0.000030453813,0.0052537816,0.00009696347,0.000028809922,0.00015700632,0.00045093297,0.004214181,0.0052703395,0.96046466,0.0018624391,0.022028286],"study_design_scores_gemma":[0.000025836434,0.0001330601,0.00989362,0.000066427565,0.000045483423,0.00072100357,0.00032175527,0.037420284,0.0038414195,0.9320916,0.015389274,0.00005016062],"about_ca_topic_score_codex":0.0010504464,"about_ca_topic_score_gemma":0.001478297,"teacher_disagreement_score":0.004026396,"about_ca_system_score_codex":0.0013416857,"about_ca_system_score_gemma":0.00028350632,"threshold_uncertainty_score":0.013469577},"labels":[],"label_agreement":null},{"id":"W4391127522","doi":"10.61091/ars157-03","title":"On a conjecture of the harmonic index with given minimum degree of graphs and short proof of Liu’s result on Randić index","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Conjecture; Index (typography); Degree (music); Combinatorics; Discrete mathematics; Statistics; Computer science; Physics","score_opus":0.03007204907759478,"score_gpt":0.2713264816441492,"score_spread":0.2412544325665544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127522","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15785259,0.028576344,0.54285634,0.044496935,0.0068616,0.00022340019,0.0019574198,0.0014939172,0.21568152],"genre_scores_gemma":[0.8244205,0.009946813,0.12380082,0.006733814,0.009831379,0.00036399456,0.0016319733,0.00061577023,0.022655005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824834,0.00035770773,0.00009705887,0.00065546896,0.0004438209,0.00019755533],"domain_scores_gemma":[0.9929034,0.004992267,0.00052644714,0.0006125532,0.0005874496,0.0003777954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027012585,0.0010226512,0.0014368868,0.0028239419,0.0018313706,0.0023703892,0.0021016821,0.002110474,0.006872381],"category_scores_gemma":[0.014412927,0.00066044525,0.0017779716,0.003876424,0.0052862307,0.008347051,0.0034717084,0.0063216933,0.0015078131],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016116457,0.00005841772,0.001484622,0.000404894,0.000045659064,0.00042303855,0.00055090553,0.0036238485,0.002620801,0.94596165,0.01989971,0.024765443],"study_design_scores_gemma":[0.000026769001,0.000068309666,0.0012529795,0.00007308819,0.00004243535,0.00043042554,0.00010165122,0.009247093,0.0016228203,0.96910113,0.017983036,0.00005022109],"about_ca_topic_score_codex":0.0009224812,"about_ca_topic_score_gemma":0.000585981,"teacher_disagreement_score":0.006872381,"about_ca_system_score_codex":0.0020776729,"about_ca_system_score_gemma":0.0006618494,"threshold_uncertainty_score":0.022990406},"labels":[],"label_agreement":null},{"id":"W4391127623","doi":"10.61091/ars156-1","title":"Radio Antipodal Labeling of Mongolian Tent and Torus Grid Graphs","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"SSN College of Engineering","keywords":"Antipodal point; Torus; Mathematics; Grid; Combinatorics; Geometry","score_opus":0.012926107791912875,"score_gpt":0.2251847969094647,"score_spread":0.2122586891175518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127623","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97387064,0.000102713195,0.018650126,0.00009664908,0.000009780452,0.00001302131,0.00024007996,0.0000496217,0.0069673597],"genre_scores_gemma":[0.98098826,0.000094603776,0.016335798,0.000025502213,0.000008696914,0.000022495453,0.00036417885,0.000014250299,0.0021462059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99986815,0.000030333764,0.00000867775,0.00003173181,0.000020176736,0.000040931547],"domain_scores_gemma":[0.9993795,0.0002658604,0.00013387081,0.000089316774,0.000049917788,0.00008147507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019514778,0.00015055592,0.00022023731,0.0005067791,0.0005923525,0.00062166475,0.00038973632,0.00030519438,0.0020170817],"category_scores_gemma":[0.00089665817,0.0001769927,0.00017917108,0.00038822947,0.00053284044,0.0008288556,0.0004853364,0.00026439887,0.00017591791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011613857,0.00019340245,0.03330696,0.0004025736,0.00006449254,0.0006427043,0.001889915,0.09591389,0.050813984,0.705758,0.0075457655,0.102306984],"study_design_scores_gemma":[0.000118538075,0.0004187353,0.024397152,0.00008113878,0.000075850905,0.0017735037,0.0015806358,0.38104233,0.023416419,0.5329892,0.03404046,0.00006606238],"about_ca_topic_score_codex":0.0010893304,"about_ca_topic_score_gemma":0.0017085774,"teacher_disagreement_score":0.0020170817,"about_ca_system_score_codex":0.0006311036,"about_ca_system_score_gemma":0.0003164701,"threshold_uncertainty_score":0.006747782},"labels":[],"label_agreement":null},{"id":"W4391127629","doi":"10.61091/ars156-2","title":"Further Results on Radio Number of Wedge sum of Graphs","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Wedge (geometry); Combinatorics; Discrete mathematics; Geometry","score_opus":0.01695318783950207,"score_gpt":0.25242533733964795,"score_spread":0.2354721495001459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127629","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80482775,0.0011481756,0.15409304,0.00029889485,0.00006917289,0.000044912733,0.00084806926,0.0007200114,0.037949953],"genre_scores_gemma":[0.9511923,0.0004941885,0.040678494,0.00012841859,0.00008956303,0.0000760514,0.0014975268,0.0002630748,0.0055803163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995173,0.00008137044,0.000021057222,0.00012029832,0.00014620624,0.000113768925],"domain_scores_gemma":[0.99855417,0.00066724233,0.00025042813,0.00021041316,0.00013319583,0.00018449112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045124933,0.00055298075,0.00044746557,0.0019193398,0.00063576724,0.00093000237,0.0010161588,0.00034624353,0.004994255],"category_scores_gemma":[0.003033846,0.0002537022,0.00065088324,0.0012833585,0.00096095284,0.0020090463,0.0011556349,0.00081193744,0.00051734323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007056393,0.00029706286,0.03932593,0.0008923529,0.00016180218,0.001145729,0.0016802646,0.1532589,0.04325174,0.62573004,0.010909714,0.1226409],"study_design_scores_gemma":[0.000059497543,0.00042376434,0.029344387,0.00011905757,0.0001948841,0.002304703,0.00080662436,0.42311162,0.025340283,0.4841866,0.034011006,0.000097620774],"about_ca_topic_score_codex":0.0006888378,"about_ca_topic_score_gemma":0.0006909308,"teacher_disagreement_score":0.004994255,"about_ca_system_score_codex":0.0005312187,"about_ca_system_score_gemma":0.00023716199,"threshold_uncertainty_score":0.01670742},"labels":[],"label_agreement":null},{"id":"W4391127630","doi":"10.61091/ars156-6","title":"Royal Colorings of Graphs","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.014004832174625573,"score_gpt":0.22815570783966613,"score_spread":0.21415087566504054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23254558,0.0053551267,0.40693608,0.0035144587,0.0014010937,0.0001781284,0.0016569266,0.0012958554,0.34711665],"genre_scores_gemma":[0.81703675,0.0032668596,0.13272144,0.001232184,0.0011466487,0.00016779009,0.0011644076,0.00049229315,0.04277161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976882,0.00059541356,0.00014824113,0.00051183003,0.0005413135,0.0005151258],"domain_scores_gemma":[0.9944258,0.0025250912,0.0007274377,0.0011101753,0.0005959999,0.0006155477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016446164,0.0007222198,0.0007170403,0.0020745234,0.0018657341,0.0035283607,0.0010027708,0.0009044623,0.007985463],"category_scores_gemma":[0.005773167,0.00076992996,0.001153942,0.0016011305,0.0043760478,0.004492819,0.0025272751,0.002407244,0.0020011114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005481191,0.000012220304,0.0002816162,0.00007846496,0.000008960215,0.000047301586,0.0002543077,0.002764796,0.0012788987,0.98011094,0.003990311,0.011117227],"study_design_scores_gemma":[0.000021437556,0.000028463488,0.00039121904,0.00003516884,0.000011651085,0.00020199396,0.00015246053,0.0075644585,0.0011558112,0.9614724,0.028937425,0.00002764578],"about_ca_topic_score_codex":0.0014858001,"about_ca_topic_score_gemma":0.0017249368,"teacher_disagreement_score":0.007985463,"about_ca_system_score_codex":0.0024395124,"about_ca_system_score_gemma":0.0007599222,"threshold_uncertainty_score":0.026714087},"labels":[],"label_agreement":null},{"id":"W4391127631","doi":"10.61091/ars156-4","title":"A Note on Distance Irregular Labeling of Graphs","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.013396903220207557,"score_gpt":0.24255414817006432,"score_spread":0.22915724494985676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127631","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38325876,0.0077757905,0.4768943,0.0063852696,0.001588507,0.00007701348,0.0008963372,0.0008803612,0.12224366],"genre_scores_gemma":[0.893838,0.0031078379,0.09333038,0.00074198673,0.0008112221,0.000045547265,0.0004976981,0.00015582104,0.007471525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992705,0.00019647107,0.00004162072,0.00019925545,0.00019805167,0.000094093426],"domain_scores_gemma":[0.9972248,0.0014309869,0.00028052885,0.0005092905,0.00027927713,0.00027509686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006805018,0.00037702243,0.00048958475,0.0013790854,0.001174557,0.0011503767,0.0006773104,0.00074311876,0.0029350468],"category_scores_gemma":[0.0037362985,0.00029325258,0.0005016338,0.002313392,0.0017087489,0.0031385482,0.0013158213,0.0018458026,0.00042554128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089164576,0.000035745048,0.004195262,0.00016822093,0.000020545065,0.00025748712,0.00060355855,0.012194218,0.005348306,0.93151146,0.0059307273,0.039645344],"study_design_scores_gemma":[0.0000092206,0.000082610655,0.002778847,0.000039936513,0.000021641681,0.0006727138,0.00039062614,0.03396017,0.002493513,0.9212003,0.038311522,0.000038976916],"about_ca_topic_score_codex":0.0013286872,"about_ca_topic_score_gemma":0.0010652939,"teacher_disagreement_score":0.0029350468,"about_ca_system_score_codex":0.001050637,"about_ca_system_score_gemma":0.0003101696,"threshold_uncertainty_score":0.009818733},"labels":[],"label_agreement":null},{"id":"W4391127632","doi":"10.61091/ars156-5","title":"Equitable Edge Coloring of Splitting Graph of Some Classes of Wheel Graphs","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Edge coloring; Enhanced Data Rates for GSM Evolution; Graph coloring; Combinatorics; Graph; Line graph; Computer science; Graph power; Artificial intelligence","score_opus":0.023230566677458306,"score_gpt":0.25226463351926687,"score_spread":0.22903406684180855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127632","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8681142,0.00018384073,0.114799574,0.00019074364,0.000028564093,0.000045078414,0.00042337843,0.0001432007,0.016071422],"genre_scores_gemma":[0.973683,0.00012199308,0.022929925,0.000044118,0.000013644836,0.000035418416,0.0005187733,0.000040336537,0.002612821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995321,0.000081993814,0.000025333922,0.00013825345,0.000082241204,0.00014010769],"domain_scores_gemma":[0.99899656,0.0002983499,0.00017295993,0.0002162391,0.00016379546,0.00015217294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028934068,0.00027086315,0.00029444968,0.0008792878,0.0010041973,0.00076078915,0.00054130895,0.00035404935,0.003645696],"category_scores_gemma":[0.001223574,0.00022661385,0.00026418368,0.0006702077,0.0006311806,0.001414465,0.0005663567,0.00048332053,0.00017831738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009277692,0.00034978046,0.032900088,0.00030379806,0.00008394675,0.001080245,0.0015624284,0.0884122,0.06958037,0.6631275,0.008030363,0.13364147],"study_design_scores_gemma":[0.000089505986,0.00017797694,0.021723576,0.000057340734,0.000074385454,0.0015277518,0.0011956245,0.3118364,0.029789105,0.6083359,0.025123762,0.00006862964],"about_ca_topic_score_codex":0.002480983,"about_ca_topic_score_gemma":0.0038321232,"teacher_disagreement_score":0.003645696,"about_ca_system_score_codex":0.0008486996,"about_ca_system_score_gemma":0.00041548547,"threshold_uncertainty_score":0.012196064},"labels":[],"label_agreement":null},{"id":"W4391127633","doi":"10.61091/ars156-3","title":"Combinatorial Bounds of the Regularity of Elimination Ideals","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Commutative Algebra and Its Applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arithmetic; Combinatorics","score_opus":0.03880462837160163,"score_gpt":0.3204500255938554,"score_spread":0.28164539722225373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127633","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7458896,0.004418482,0.16023389,0.003381141,0.0002629258,0.000065875756,0.00065747724,0.0004294857,0.08466115],"genre_scores_gemma":[0.9824905,0.00078413356,0.012203764,0.00016698161,0.00033564863,0.0000540389,0.00034159436,0.000084864776,0.003538382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985592,0.0003086159,0.000054794113,0.00036952467,0.0004799979,0.00022801592],"domain_scores_gemma":[0.9888521,0.008150746,0.0008440746,0.0008379869,0.00056783145,0.0007473288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017094518,0.0007135502,0.00096504536,0.0030581816,0.0013163566,0.0024258085,0.0017953987,0.0007756323,0.0036592204],"category_scores_gemma":[0.009594062,0.0006455302,0.0009361744,0.0014296889,0.0031682102,0.004590511,0.0022804704,0.003175996,0.00038495354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025248705,0.00009665153,0.0059564738,0.0002219944,0.000065705455,0.00044337928,0.00043690385,0.012716162,0.009689597,0.9530023,0.0026920205,0.01442635],"study_design_scores_gemma":[0.00003329579,0.00008831062,0.006206343,0.000051510688,0.000077195255,0.00085348246,0.00018418703,0.08764109,0.008816366,0.8908012,0.0051773163,0.00006970805],"about_ca_topic_score_codex":0.00049015303,"about_ca_topic_score_gemma":0.0006318354,"teacher_disagreement_score":0.0036592204,"about_ca_system_score_codex":0.0011710157,"about_ca_system_score_gemma":0.00030014326,"threshold_uncertainty_score":0.012241304},"labels":[],"label_agreement":null},{"id":"W4391622594","doi":"10.61091/ars159-10","title":"Groups Generated by Pattern Avoiding Permutations","year":2024,"lang":"en","type":"preprint","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Combinatorics; Mathematics","score_opus":0.008891041553598563,"score_gpt":0.2108900942415152,"score_spread":0.20199905268791662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391622594","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8505272,0.00040229675,0.119025044,0.0002754704,0.000063930915,0.0000923884,0.0001326492,0.00012278464,0.029358111],"genre_scores_gemma":[0.97109175,0.00022731803,0.021560498,0.000059530583,0.0000689149,0.00008474374,0.00018890905,0.000029299168,0.006689125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942636,0.00012622947,0.000036883288,0.00012993309,0.00015117807,0.00012939826],"domain_scores_gemma":[0.99864644,0.00043465805,0.00046352003,0.00015913851,0.00012622193,0.00017006737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003766589,0.0004582231,0.00037085067,0.001235329,0.00084976654,0.0011965431,0.000613769,0.0006361254,0.0031880112],"category_scores_gemma":[0.0019179144,0.0001798031,0.00047877533,0.00077605364,0.0013672971,0.0013899151,0.0011700885,0.0007982715,0.00043129918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002148475,0.00011025176,0.0044208546,0.00016173042,0.000050738185,0.0012721291,0.0010782336,0.018505083,0.038951155,0.9075692,0.0008424673,0.026823299],"study_design_scores_gemma":[0.000057277153,0.0003310946,0.0019788134,0.000051149622,0.000046145757,0.0015421938,0.0006567707,0.057145163,0.025860775,0.89717937,0.015113011,0.000038296253],"about_ca_topic_score_codex":0.00029986296,"about_ca_topic_score_gemma":0.00024554128,"teacher_disagreement_score":0.0031880112,"about_ca_system_score_codex":0.00050178065,"about_ca_system_score_gemma":0.00030844627,"threshold_uncertainty_score":0.01066494},"labels":[],"label_agreement":null},{"id":"W43937067","doi":"","title":"Lattices associated with finite vector spaces and finite affine spaces.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Affine transformation; Pure mathematics; Vector space","score_opus":0.016066743740976212,"score_gpt":0.22117527866337816,"score_spread":0.20510853492240194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W43937067","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31814146,0.0073382114,0.36050105,0.0057422663,0.0016181375,0.00012841701,0.0017568712,0.0010197093,0.30375388],"genre_scores_gemma":[0.9215973,0.0015179367,0.03666709,0.00049879734,0.0008161228,0.00008090441,0.0008175253,0.00014504041,0.03785931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982204,0.0005694583,0.00012747817,0.00023518219,0.00052937446,0.00031811895],"domain_scores_gemma":[0.9977685,0.00081397005,0.00039850298,0.00025528623,0.00030772755,0.00045610752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010070595,0.00050852087,0.00064336235,0.0021090354,0.0018113919,0.005375127,0.0008978175,0.0008883571,0.009978279],"category_scores_gemma":[0.003583679,0.0005104827,0.00081408146,0.0018815331,0.004649468,0.007018402,0.0033996871,0.0029666163,0.0017819903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016888878,0.000007753811,0.00012870746,0.000016221937,0.0000039301704,0.00004012599,0.00008825171,0.0002409537,0.00019947151,0.99661946,0.0006458004,0.00199239],"study_design_scores_gemma":[0.0000100560555,0.000007705754,0.00010257568,0.000012322888,0.000004134947,0.000110252055,0.00009794283,0.001436638,0.00031155295,0.9937219,0.004176382,0.000008487129],"about_ca_topic_score_codex":0.0013294213,"about_ca_topic_score_gemma":0.0013064656,"teacher_disagreement_score":0.009978279,"about_ca_system_score_codex":0.0016446938,"about_ca_system_score_gemma":0.00081727956,"threshold_uncertainty_score":0.033380628},"labels":[],"label_agreement":null},{"id":"W4394793066","doi":"10.61091/ars158-01","title":"Four Classes of Nonterminating 3 F 2 (1)-Series via Kummer and Thomae Transformations","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Series (stratigraphy); Integer (computer science); Pure mathematics; Algebra over a field; Combinatorics; Computer science","score_opus":0.032783160747235536,"score_gpt":0.3124393012508767,"score_spread":0.2796561405036412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394793066","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8149621,0.0008365952,0.0781158,0.0006076022,0.00029610583,0.00008780985,0.00011075905,0.00050693547,0.10447631],"genre_scores_gemma":[0.9694671,0.00038253822,0.016399018,0.00013802864,0.00018810408,0.000083241255,0.00009870919,0.00012636541,0.013116799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930716,0.00011303897,0.000054331013,0.00007844114,0.000295885,0.00015111233],"domain_scores_gemma":[0.99900776,0.0003888869,0.00019593765,0.00014671063,0.00012158773,0.0001391505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001154913,0.0005998619,0.00058696396,0.0020061496,0.0016590701,0.002408348,0.0015753994,0.0014304925,0.0054527675],"category_scores_gemma":[0.002955086,0.0002691256,0.0007964863,0.0013254818,0.0021773765,0.002815341,0.0012556962,0.0015532374,0.0006403234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043401833,0.000039300023,0.0006153048,0.00005418864,0.000007935481,0.0005547641,0.00044317477,0.0010762551,0.0073080542,0.97749376,0.0006549533,0.011708945],"study_design_scores_gemma":[0.000047271114,0.00006896974,0.0018770454,0.000052129606,0.000025535604,0.0013564846,0.00024211338,0.02388686,0.00786008,0.95651984,0.008008982,0.000054769756],"about_ca_topic_score_codex":0.00019307321,"about_ca_topic_score_gemma":0.000353731,"teacher_disagreement_score":0.0054527675,"about_ca_system_score_codex":0.00091592787,"about_ca_system_score_gemma":0.0005076789,"threshold_uncertainty_score":0.018241346},"labels":[],"label_agreement":null},{"id":"W4394793194","doi":"10.61091/ars158-06","title":"Component Intersection Graph of Finite Dimensional Vector Spaces","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Intersection graph; Clique graph; Intersection (aeronautics); Graph; Vector space; Connected component; Discrete mathematics; Intersection number; Block graph; Line graph; Graph power; Pure mathematics; Geometry; 1-planar graph","score_opus":0.011640247785428864,"score_gpt":0.22800729992271804,"score_spread":0.21636705213728918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394793194","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6486082,0.00074019877,0.3238181,0.00049875944,0.0000822454,0.000074925294,0.00082708016,0.00042384784,0.024926707],"genre_scores_gemma":[0.9476489,0.000412933,0.046623647,0.00009101167,0.000045083616,0.000095307216,0.0010333437,0.000073331204,0.0039764172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932253,0.00013886328,0.00003122257,0.00018251094,0.00020024975,0.00012467631],"domain_scores_gemma":[0.998398,0.0006133538,0.00029223366,0.00017102879,0.000321722,0.00020371568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028519038,0.0004388815,0.0005085008,0.0020488903,0.001329874,0.0020270313,0.0009709413,0.0005025328,0.0034912475],"category_scores_gemma":[0.0017146784,0.00024799095,0.00036975244,0.0029427665,0.0013719453,0.0029091865,0.0012999289,0.00092383963,0.0003448254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000107077445,0.000044755234,0.002409862,0.000090536785,0.000027847893,0.00017999021,0.00037200045,0.010866933,0.003559457,0.96023816,0.001593908,0.020509424],"study_design_scores_gemma":[0.000020135649,0.00010413795,0.0035074994,0.000043445118,0.000042934218,0.0006110776,0.0005443105,0.12652911,0.0062101567,0.8445568,0.017778855,0.0000515594],"about_ca_topic_score_codex":0.0020032017,"about_ca_topic_score_gemma":0.0011283251,"teacher_disagreement_score":0.0034912475,"about_ca_system_score_codex":0.0011053318,"about_ca_system_score_gemma":0.0005073775,"threshold_uncertainty_score":0.011679411},"labels":[],"label_agreement":null},{"id":"W4394793197","doi":"10.61091/ars158-12","title":"\\(q\\)-Analogue of the Generalized Fibonacci and Lucas Polynomials","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Fibonacci polynomials; Mathematics; Lucas number; Binomial coefficient; Combinatorics; Lucas sequence; Factorization; Pisano period; Polynomial matrix; Matrix (chemical analysis); Cholesky decomposition; Polynomial; Discrete mathematics; Pure mathematics; Algebra over a field; Classical orthogonal polynomials; Matrix polynomial; Orthogonal polynomials; Mathematical analysis; Algorithm","score_opus":0.009777923447713678,"score_gpt":0.2671608530925313,"score_spread":0.2573829296448176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394793197","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30095845,0.0032248897,0.58587414,0.0011572115,0.00090652244,0.00013399783,0.0005792961,0.0003268488,0.10683874],"genre_scores_gemma":[0.85099584,0.0020261612,0.117625125,0.00037643957,0.0005803624,0.00011312201,0.00033237028,0.0001472575,0.027803345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995597,0.00007492991,0.000021056549,0.00008859661,0.00014365654,0.00011199714],"domain_scores_gemma":[0.99949837,0.000105934545,0.000080586135,0.00006163453,0.00019812064,0.000055341534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004057476,0.00048996287,0.00042120533,0.0013577279,0.0008460815,0.00116962,0.0004981283,0.00051882566,0.0058617415],"category_scores_gemma":[0.0017983195,0.00021666817,0.00065429334,0.0010438344,0.0013761289,0.001853699,0.0007231302,0.0010757713,0.0010958335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019439018,0.000007703293,0.0002389049,0.000048857662,0.0000047199483,0.0001262315,0.00011509623,0.002609358,0.0032310241,0.9790363,0.0009166423,0.013645731],"study_design_scores_gemma":[0.00001777391,0.000055871395,0.0010042245,0.00004167719,0.000012732931,0.0007420533,0.00016628942,0.037797492,0.003895649,0.93227637,0.023934992,0.00005485223],"about_ca_topic_score_codex":0.0020958818,"about_ca_topic_score_gemma":0.0027798845,"teacher_disagreement_score":0.0058617415,"about_ca_system_score_codex":0.0008619406,"about_ca_system_score_gemma":0.00088238856,"threshold_uncertainty_score":0.019609451},"labels":[],"label_agreement":null},{"id":"W4394793198","doi":"10.61091/ars158-05","title":"On Domination and 2-packing Numbers in Intersecting Linear Systems","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Prime (order theory); Rank (graph theory); Projective plane; Element (criminal law); Discrete mathematics; Geometry","score_opus":0.015467110374370329,"score_gpt":0.2987086625492166,"score_spread":0.28324155217484626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394793198","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6414893,0.012564167,0.22545443,0.004200745,0.0005851944,0.00017144889,0.0016617929,0.0005883176,0.113284715],"genre_scores_gemma":[0.95819443,0.0033750173,0.02516901,0.0005502622,0.0008532835,0.00020013859,0.0010269514,0.0001434788,0.010487516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99768484,0.00065501116,0.00012241561,0.00046555922,0.00049506506,0.00057708286],"domain_scores_gemma":[0.988457,0.008368441,0.0011661021,0.00058089953,0.00056915026,0.0008583821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016570741,0.001488442,0.0018933528,0.00495364,0.0028116233,0.0045407247,0.0017503402,0.0014078525,0.008340076],"category_scores_gemma":[0.010257854,0.0009540266,0.0010854106,0.0058894577,0.004842536,0.0079208445,0.003294733,0.0027219818,0.001027683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039500865,0.00008087226,0.004080888,0.00028457324,0.00006400611,0.00029313762,0.0010296626,0.023852654,0.0024592977,0.9384642,0.006784183,0.022211464],"study_design_scores_gemma":[0.000060381564,0.00010596699,0.0018581928,0.00010082716,0.000041131556,0.00033090773,0.00030389713,0.084715165,0.0009549762,0.9045489,0.0069136135,0.000066042834],"about_ca_topic_score_codex":0.0027989938,"about_ca_topic_score_gemma":0.0022273562,"teacher_disagreement_score":0.008340076,"about_ca_system_score_codex":0.0036394296,"about_ca_system_score_gemma":0.0008754719,"threshold_uncertainty_score":0.027900398},"labels":[],"label_agreement":null},{"id":"W4394793212","doi":"10.61091/ars158-02","title":"\\((d,1)\\)-Total Labelling of Generalized Petersen Graphs \\(P(n,k)\\)","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Labelling; Mathematics; Combinatorics; Chemistry","score_opus":0.01254218486588947,"score_gpt":0.23351784059567426,"score_spread":0.22097565572978478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394793212","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95987326,0.00015844115,0.019363772,0.00025493323,0.000032235537,0.00003211029,0.0004271417,0.000098871584,0.019759307],"genre_scores_gemma":[0.9739275,0.00019927758,0.019540137,0.000119540266,0.000020957761,0.00006892335,0.00079874747,0.00005615926,0.0052687414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995328,0.00010093203,0.000024088711,0.0001241966,0.00008399972,0.00013402344],"domain_scores_gemma":[0.998211,0.000854725,0.00033455156,0.0002701917,0.00014014258,0.00018937583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043523815,0.00032922585,0.0002817868,0.0009252685,0.0017449762,0.0014742237,0.00060569256,0.00066776073,0.0041421345],"category_scores_gemma":[0.0016343568,0.00032991488,0.0004607293,0.0008537296,0.0012633969,0.0015932522,0.00097333465,0.00064840785,0.00035382883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007484516,0.00022158904,0.033876047,0.0005910176,0.00009027407,0.0009160859,0.0014620874,0.035691,0.059849817,0.78724277,0.009113239,0.07019761],"study_design_scores_gemma":[0.00013942193,0.00028981947,0.028486384,0.0001216337,0.00016357772,0.003929435,0.0023230098,0.13226138,0.059367597,0.7291105,0.04369273,0.00011457297],"about_ca_topic_score_codex":0.000872358,"about_ca_topic_score_gemma":0.0018992499,"teacher_disagreement_score":0.0041421345,"about_ca_system_score_codex":0.0008606907,"about_ca_system_score_gemma":0.0005016187,"threshold_uncertainty_score":0.013856828},"labels":[],"label_agreement":null},{"id":"W4394793213","doi":"10.61091/ars158-11","title":"Prefixes of Stanley’s Catalan Paths with Odd Returns to the \\(x\\)-axis–Standard Version and Skew Catalan-Stanley Paths","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Catalan number; Catalan; Combinatorics; Skew; Tuple; Alphabet; Order (exchange); Set (abstract data type); Discrete mathematics; Computer science; Humanities; Telecommunications","score_opus":0.006239565600843324,"score_gpt":0.2159879738433406,"score_spread":0.20974840824249727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394793213","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59502757,0.0005877871,0.27474,0.0009014514,0.00043030988,0.0001346601,0.0005917495,0.0006600819,0.12692639],"genre_scores_gemma":[0.9009784,0.00029530333,0.06118513,0.00028182342,0.00017334626,0.00021272374,0.00048661337,0.00037298488,0.036013603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991897,0.00018967796,0.000060137216,0.00016817522,0.00020212344,0.0001901766],"domain_scores_gemma":[0.9974261,0.0011578074,0.000264794,0.00045145542,0.0004372375,0.0002626687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097496674,0.00044352934,0.0004939836,0.0014787173,0.0014437112,0.0023378935,0.00065420516,0.0009277689,0.009389831],"category_scores_gemma":[0.0047979597,0.000398301,0.0008695522,0.001282121,0.002074017,0.0027528035,0.0010350016,0.0012989666,0.0018379786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045785764,0.0000145634085,0.00040186403,0.000021724325,0.0000032007097,0.00018497507,0.00026399852,0.0013241894,0.0013657886,0.98694044,0.0009334477,0.0084999455],"study_design_scores_gemma":[0.000015321708,0.000029178856,0.00059567514,0.000024806579,0.0000059035365,0.0003606255,0.000106759406,0.017553926,0.0029177954,0.9699425,0.008417122,0.000030441812],"about_ca_topic_score_codex":0.0011434648,"about_ca_topic_score_gemma":0.0014354324,"teacher_disagreement_score":0.009389831,"about_ca_system_score_codex":0.0012614315,"about_ca_system_score_gemma":0.0008752167,"threshold_uncertainty_score":0.031412065},"labels":[],"label_agreement":null},{"id":"W4394793215","doi":"10.61091/ars158-03","title":"Algorithmic Aspects of Vertex-edge Domination in Some Graphs","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"SASTRA University; National Board for Higher Mathematics; Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Neighbourhood (mathematics); Dominating set; Edge cover; Chordal graph; Bipartite graph; Vertex cover; Discrete mathematics; Maximal independent set; Graph; 1-planar graph","score_opus":0.012135276949478156,"score_gpt":0.2796549732610593,"score_spread":0.2675196963115812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394793215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29894114,0.0013680639,0.6606463,0.0028212527,0.000093562354,0.00038812228,0.00065712765,0.00051109114,0.034573395],"genre_scores_gemma":[0.7832802,0.0006539393,0.20541553,0.0003577666,0.0001030613,0.00023864431,0.00093710725,0.00010405047,0.008909636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985177,0.00044975537,0.0000972847,0.00034755727,0.00037252408,0.00021516206],"domain_scores_gemma":[0.9951624,0.0033440092,0.0004299566,0.00041245337,0.00039873662,0.00025246528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014241725,0.00045016303,0.00062168547,0.0012498297,0.0013414411,0.002564775,0.001800117,0.0009914213,0.0027762966],"category_scores_gemma":[0.008085935,0.0004052053,0.0006180227,0.0019960182,0.0018882792,0.003402378,0.0022287525,0.0012806527,0.00025780944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040484135,0.00023376264,0.0076237204,0.0004702339,0.000120667624,0.00081329985,0.0010963891,0.1490805,0.00824498,0.7299666,0.00727914,0.09466597],"study_design_scores_gemma":[0.00009532386,0.00006184419,0.0011426386,0.000038379538,0.000054226643,0.00063480466,0.00026347992,0.40238625,0.0029440369,0.58203566,0.010318235,0.000025105022],"about_ca_topic_score_codex":0.0024105152,"about_ca_topic_score_gemma":0.0033650466,"teacher_disagreement_score":0.0027762966,"about_ca_system_score_codex":0.0016073021,"about_ca_system_score_gemma":0.0010954129,"threshold_uncertainty_score":0.011661828},"labels":[],"label_agreement":null},{"id":"W4394793216","doi":"10.61091/ars158-08","title":"Description of the \\((\\leq 3)\\)-hypomorphic Posets and Bichains. Application to the \\((\\leq 3)\\)-reconstruction","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Homotopy and Cohomology in Algebraic Topology","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.018272905226154795,"score_gpt":0.26252674933894066,"score_spread":0.24425384411278586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394793216","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5275614,0.000799497,0.39704078,0.00086800056,0.00016884264,0.000228136,0.0013065272,0.00044016115,0.071586594],"genre_scores_gemma":[0.925185,0.00027547943,0.05710965,0.00016315142,0.00006614495,0.00014020364,0.0010858381,0.00011811016,0.015856324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993241,0.000113250004,0.00005451733,0.00017839782,0.00021948515,0.00011030999],"domain_scores_gemma":[0.9995622,0.00009041406,0.00007413917,0.00008442432,0.00009534131,0.00009345356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005211736,0.0005575311,0.00038141478,0.0009834629,0.0008273488,0.0020178333,0.0009013299,0.0005276667,0.0070581823],"category_scores_gemma":[0.0008401369,0.00035232154,0.0006002843,0.00075267896,0.0020712928,0.003101287,0.0016681356,0.0016573225,0.0004985071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047440768,0.000035011035,0.0005542414,0.00004494597,0.0000061856404,0.00018188733,0.0005197243,0.0022724557,0.0063878517,0.98141277,0.0005482934,0.007989157],"study_design_scores_gemma":[0.00003133739,0.00011871424,0.0018327393,0.00004822044,0.000024147443,0.0014369568,0.0008853573,0.026131516,0.012899736,0.93548334,0.021046331,0.00006168065],"about_ca_topic_score_codex":0.0010595466,"about_ca_topic_score_gemma":0.0010283446,"teacher_disagreement_score":0.0070581823,"about_ca_system_score_codex":0.00084482273,"about_ca_system_score_gemma":0.00042003434,"threshold_uncertainty_score":0.023611963},"labels":[],"label_agreement":null},{"id":"W4394793217","doi":"10.61091/ars158-04","title":"Near Hexagons of Order \\((3,t)\\) having a Big Quad","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Order (exchange); Isomorphism (crystallography); Combinatorics; Crystallography; Business; Crystal structure","score_opus":0.00844429568122194,"score_gpt":0.20840420293730594,"score_spread":0.199959907256084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394793217","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9198149,0.00033361124,0.029055046,0.00010911159,0.00008478483,0.0000737751,0.0010907361,0.00021187509,0.04922612],"genre_scores_gemma":[0.9779198,0.000161998,0.013282469,0.000059806734,0.000017334616,0.00003236347,0.0016128351,0.000041885356,0.0068713734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99978787,0.000024400584,0.000010668429,0.0000487769,0.000048925842,0.000079210564],"domain_scores_gemma":[0.9996087,0.00009087731,0.0000921515,0.00007067563,0.000052937135,0.00008470083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012536178,0.00028925986,0.000355017,0.0007450904,0.0007952982,0.00091430574,0.00031159312,0.00040269783,0.0071967924],"category_scores_gemma":[0.00042670526,0.0001935661,0.00038103212,0.0007637889,0.00083811476,0.00075771887,0.0008474975,0.00051824393,0.0011541718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027596008,0.00028914062,0.048430014,0.0007887684,0.0001319892,0.003995283,0.0021556348,0.027821956,0.08160127,0.6860251,0.018194664,0.12780654],"study_design_scores_gemma":[0.00020936737,0.0012235402,0.071805835,0.00052913325,0.00016146158,0.013541716,0.008433834,0.090332985,0.06925661,0.5985206,0.14579323,0.00019174439],"about_ca_topic_score_codex":0.000765351,"about_ca_topic_score_gemma":0.0009636534,"teacher_disagreement_score":0.0071967924,"about_ca_system_score_codex":0.00031133805,"about_ca_system_score_gemma":0.00020926325,"threshold_uncertainty_score":0.024075627},"labels":[],"label_agreement":null},{"id":"W4394793218","doi":"10.61091/ars158-10","title":"Counting Distinct Adjacent r-tuples in Words","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tuple; Mathematics; Arithmetic; Combinatorics; Discrete mathematics","score_opus":0.009912383422988145,"score_gpt":0.26386296322184283,"score_spread":0.25395057979885466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394793218","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45558468,0.00054601347,0.49937296,0.0005022603,0.00025143722,0.0001900132,0.0009892342,0.0010719864,0.041491363],"genre_scores_gemma":[0.86245674,0.0004575275,0.11184385,0.000180383,0.00022765323,0.0004926623,0.0015432956,0.0007419905,0.022055916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981495,0.0004464185,0.00014724844,0.00035292946,0.00058001874,0.0003239585],"domain_scores_gemma":[0.9949185,0.0027709105,0.00040178845,0.0007171867,0.0008759595,0.00031551986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015045954,0.00062693766,0.00072970707,0.003847245,0.0013566938,0.0026222952,0.001682173,0.0010439731,0.008283862],"category_scores_gemma":[0.009653188,0.0005919732,0.0010688652,0.0021621266,0.0018690039,0.0037143556,0.0017750966,0.00092706335,0.0026687675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013525833,0.000055579723,0.005024656,0.00016428091,0.000020360185,0.0004902116,0.0012767388,0.0071859728,0.009752671,0.92542344,0.0036755372,0.046795238],"study_design_scores_gemma":[0.000020908388,0.00007772811,0.0030510537,0.00012621305,0.00004377985,0.001311966,0.00046246365,0.11330811,0.020042349,0.84585613,0.015590805,0.000108484586],"about_ca_topic_score_codex":0.00065372733,"about_ca_topic_score_gemma":0.0007134621,"teacher_disagreement_score":0.008283862,"about_ca_system_score_codex":0.0011122106,"about_ca_system_score_gemma":0.00054209866,"threshold_uncertainty_score":0.027712226},"labels":[],"label_agreement":null},{"id":"W4394794863","doi":"10.61091/ars158-09","title":"A Variant of the Round-Robin Scheduling Problem","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Scheduling (production processes); Mathematics; Weighted round robin; Construct (python library); Job shop scheduling; Mathematical optimization; Combinatorics; Computer science; Round-robin scheduling; Dynamic priority scheduling; Computer network","score_opus":0.05936538615957712,"score_gpt":0.3395977549067772,"score_spread":0.28023236874720003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394794863","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059949055,0.0002380572,0.90790045,0.0012345448,0.00037284236,0.0004190654,0.0011680746,0.0004956473,0.028222155],"genre_scores_gemma":[0.41123536,0.00048879196,0.5528051,0.0004976503,0.00037361967,0.0004764175,0.0014951957,0.00029421432,0.03233365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978607,0.0008414516,0.000103003294,0.000537552,0.000315218,0.00034208174],"domain_scores_gemma":[0.9974369,0.0012114692,0.0002920487,0.00049557636,0.00023809943,0.00032594372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017572657,0.0010384208,0.00084259536,0.00043428305,0.0009901192,0.0015099216,0.0026063952,0.0012067695,0.012249614],"category_scores_gemma":[0.005029478,0.00046084303,0.0011722797,0.0009596413,0.0009943561,0.003115691,0.0009543693,0.0018999903,0.0016932866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007015029,0.0003839588,0.0008619397,0.00040224858,0.00011659079,0.0004895692,0.00030812714,0.33587033,0.009550675,0.5635743,0.023595136,0.06414569],"study_design_scores_gemma":[0.00020452945,0.00027624262,0.0004864934,0.00003125879,0.000051783172,0.00042369342,0.00017852124,0.6118892,0.004371646,0.34716567,0.034862664,0.00005823127],"about_ca_topic_score_codex":0.0031104302,"about_ca_topic_score_gemma":0.003269857,"teacher_disagreement_score":0.012249614,"about_ca_system_score_codex":0.0013072274,"about_ca_system_score_gemma":0.0018921565,"threshold_uncertainty_score":0.040979028},"labels":[],"label_agreement":null},{"id":"W4394919489","doi":"10.61091/ars158-07","title":"Bond Incident Degree (BID) Indices of Line Graphs of some Chemical Structures in Drugs","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Drug Discovery Methods","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Line (geometry); Combinatorics; Geometry; Physics","score_opus":0.019815833946728874,"score_gpt":0.29691829772583694,"score_spread":0.2771024637791081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394919489","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36545536,0.0010214429,0.59819627,0.00037340724,0.00006996763,0.0001256416,0.0012349216,0.0005063168,0.033016626],"genre_scores_gemma":[0.92183167,0.0007377181,0.07355735,0.00006863785,0.000042853364,0.00010577582,0.0006819823,0.00009152633,0.0028825263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996499,0.00010430391,0.000019011972,0.000069634414,0.00010871324,0.000048480157],"domain_scores_gemma":[0.99823725,0.0009722274,0.0002655981,0.00018194484,0.00022572381,0.000117155585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045843938,0.00030615783,0.00025294622,0.0030073982,0.00047796842,0.0009414276,0.00052157784,0.00034782448,0.004109139],"category_scores_gemma":[0.0034159867,0.00017651373,0.00039200217,0.0016563407,0.0007334813,0.0015796052,0.00051408925,0.0005742922,0.00046465907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003885317,0.00013996134,0.025671823,0.0005708561,0.000119063225,0.0005501119,0.0005922579,0.18248159,0.021395158,0.5642744,0.007834483,0.19598185],"study_design_scores_gemma":[0.000030203142,0.00017320114,0.015600938,0.000079225,0.00007479015,0.00069337734,0.00030733048,0.5201479,0.011124067,0.4359611,0.01575194,0.000055796903],"about_ca_topic_score_codex":0.00069407525,"about_ca_topic_score_gemma":0.000800722,"teacher_disagreement_score":0.004109139,"about_ca_system_score_codex":0.00064844155,"about_ca_system_score_gemma":0.000256704,"threshold_uncertainty_score":0.01374644},"labels":[],"label_agreement":null},{"id":"W4400512456","doi":"10.61091/ars159-12","title":"A Note on Acyclic Token Sliding Reconfiguration Graphs of Independent Sets","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Japan Society for the Promotion of Science; Vietnam Institute for Advanced Study in Mathematics","keywords":"Combinatorics; Security token; Graph; Control reconfiguration; Mathematics; Discrete mathematics; Computer science; Computer network","score_opus":0.022282467778505767,"score_gpt":0.3089376826373435,"score_spread":0.2866552148588377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400512456","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29836905,0.0034715335,0.5289405,0.004546772,0.0006429473,0.00023780207,0.0010205627,0.0009146826,0.16185622],"genre_scores_gemma":[0.84935284,0.0035866753,0.1236418,0.0015103455,0.00088886695,0.0002038945,0.0011199017,0.0002562671,0.019439451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992889,0.00015203629,0.0000420485,0.00017896546,0.00021208108,0.0001259292],"domain_scores_gemma":[0.9961739,0.0023605856,0.0004971411,0.00039928165,0.0002968016,0.00027239343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006952951,0.00045894596,0.00036979493,0.0014267341,0.0012302704,0.0012688537,0.0010907447,0.00063647627,0.008262238],"category_scores_gemma":[0.0027184943,0.000500604,0.000955829,0.0021553647,0.0018016805,0.0032335618,0.001497391,0.0019487517,0.0005336778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015224246,0.00006541699,0.002120823,0.00026556925,0.000037337733,0.0008957016,0.0007662748,0.016883822,0.007485848,0.9254021,0.0046660737,0.041258793],"study_design_scores_gemma":[0.000038300932,0.00015182227,0.003390439,0.00008205669,0.00007253995,0.00069666945,0.0005215786,0.04156725,0.0060034418,0.9048233,0.04259865,0.000053941825],"about_ca_topic_score_codex":0.0038108246,"about_ca_topic_score_gemma":0.0037446357,"teacher_disagreement_score":0.008262238,"about_ca_system_score_codex":0.0010764232,"about_ca_system_score_gemma":0.00069757487,"threshold_uncertainty_score":0.027639985},"labels":[],"label_agreement":null},{"id":"W4400512457","doi":"10.61091/ars159-08","title":"Super Edge-magic Total Strength of Some Unicyclic Graphs","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Bijection; MAGIC (telescope); Simple graph; Graph; Vertex (graph theory); Conjecture; Discrete mathematics; Physics; Quantum mechanics","score_opus":0.009943952473893777,"score_gpt":0.22997066693811213,"score_spread":0.22002671446421834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400512457","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9477513,0.00030674238,0.02522373,0.0002988533,0.000020610614,0.000031465912,0.0005096776,0.00013090557,0.025726868],"genre_scores_gemma":[0.9870842,0.00017300883,0.01043434,0.00008294462,0.000022660339,0.000031318334,0.0004155743,0.000026022957,0.0017298077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996494,0.0000646415,0.000026232154,0.00009746093,0.00009209323,0.00007015966],"domain_scores_gemma":[0.9979163,0.0007793558,0.00045091248,0.00019457586,0.00032198505,0.00033688277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038026136,0.00026889553,0.0003177038,0.0014624699,0.00072937546,0.00069796393,0.0005039654,0.00035239427,0.0027059333],"category_scores_gemma":[0.002081448,0.00032292042,0.0003398719,0.0011579137,0.0007938267,0.0009907674,0.0006175537,0.0006498341,0.00016236768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007412351,0.00009564055,0.01984453,0.00061024923,0.0001991027,0.0010317921,0.0013436902,0.0232294,0.07747977,0.7979189,0.0049887123,0.072517045],"study_design_scores_gemma":[0.00016513129,0.00041648452,0.027867517,0.00012568253,0.0003125732,0.0039101844,0.0010087782,0.11832136,0.034143377,0.788451,0.02514635,0.00013150644],"about_ca_topic_score_codex":0.00080787495,"about_ca_topic_score_gemma":0.0012740156,"teacher_disagreement_score":0.0027059333,"about_ca_system_score_codex":0.000567323,"about_ca_system_score_gemma":0.00031521954,"threshold_uncertainty_score":0.009052217},"labels":[],"label_agreement":null},{"id":"W4400512486","doi":"10.61091/ars159-15","title":"Sharp Upper Bound for Harmonic Index of Trees with Given Total Domination Number","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Universiti Malaysia Terengganu; Universiti Sains Malaysia","keywords":"Mathematics; Combinatorics; Upper and lower bounds; Vertex (graph theory); Graph; Connectivity; Bound graph; Simple graph; Harmonic mean; Topological index; Discrete mathematics; Mathematical analysis; Geometry; Graph power; Line graph","score_opus":0.018183247079297034,"score_gpt":0.29291427582129237,"score_spread":0.27473102874199534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400512486","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71806216,0.0036704852,0.18392596,0.00133181,0.00016097691,0.000064730164,0.0011961288,0.000372722,0.091214985],"genre_scores_gemma":[0.97785425,0.00084644253,0.015615778,0.00015388793,0.0001655031,0.000060594397,0.00046048712,0.00010844522,0.004734406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931264,0.00009147296,0.000023038323,0.00014977127,0.00020023517,0.00022289138],"domain_scores_gemma":[0.99737465,0.0016248923,0.00016275272,0.0002362043,0.00022487371,0.00037662958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000750961,0.00045164672,0.0009089975,0.0022102431,0.0011903696,0.0021232015,0.0014664151,0.0008501196,0.0047283936],"category_scores_gemma":[0.0050044493,0.0003094312,0.00047806636,0.0013264157,0.001316581,0.0026488537,0.001801961,0.0013318824,0.00043779594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035518061,0.00010212036,0.0063053407,0.00036219627,0.00008133891,0.00046185593,0.0007019999,0.038817823,0.027548522,0.88701224,0.0063228663,0.031928357],"study_design_scores_gemma":[0.00002812899,0.000076605575,0.00468648,0.00008081244,0.000063415166,0.00066267274,0.0002449906,0.20696348,0.008134609,0.77207595,0.006914081,0.00006887375],"about_ca_topic_score_codex":0.0006741799,"about_ca_topic_score_gemma":0.0011901803,"teacher_disagreement_score":0.0047283936,"about_ca_system_score_codex":0.0014842404,"about_ca_system_score_gemma":0.00041216798,"threshold_uncertainty_score":0.015818119},"labels":[],"label_agreement":null},{"id":"W4400512493","doi":"10.61091/ars159-07","title":"On the Shelter of a Poset &amp; Its Algebraic Applications","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Higher Education Commision, Pakistan","keywords":"Partially ordered set; Mathematics; Chain (unit); Algebraic number; Combinatorics; Property (philosophy); Element (criminal law); Discrete mathematics; Physics; Mathematical analysis","score_opus":0.017383602065694035,"score_gpt":0.26157743944537054,"score_spread":0.2441938373796765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400512493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38773134,0.0038377002,0.3954213,0.0018502222,0.00037863286,0.00014135051,0.0008865664,0.00059243647,0.20916054],"genre_scores_gemma":[0.9146713,0.0018406892,0.055950135,0.00035036856,0.0004393265,0.00020537789,0.00071096,0.00025773453,0.025574073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889684,0.00029978174,0.000085251486,0.00027409432,0.00025060796,0.00019328416],"domain_scores_gemma":[0.99875784,0.00048068803,0.0001620105,0.00016942678,0.00019607012,0.00023385535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011581866,0.00077091774,0.0009523483,0.002924459,0.0027352495,0.0034891742,0.0007697978,0.00066016585,0.009288448],"category_scores_gemma":[0.0017907217,0.0005364942,0.0010975505,0.002131291,0.0054535093,0.005942207,0.005179047,0.0024287319,0.0015085442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028333066,0.000010915164,0.00032269195,0.000027951932,0.0000070356145,0.000080538084,0.00062739605,0.0010596754,0.0009297802,0.9893968,0.0005541106,0.0069547454],"study_design_scores_gemma":[0.000013870806,0.000073877134,0.00038609857,0.000047482714,0.000018755713,0.00029585478,0.00084035116,0.007593758,0.001356831,0.9611003,0.028245838,0.000027036263],"about_ca_topic_score_codex":0.0010662214,"about_ca_topic_score_gemma":0.001208822,"teacher_disagreement_score":0.009288448,"about_ca_system_score_codex":0.0010502296,"about_ca_system_score_gemma":0.0006358366,"threshold_uncertainty_score":0.031072974},"labels":[],"label_agreement":null},{"id":"W4400512506","doi":"10.61091/ars159-14","title":"5-Regular Subgraphs in Hypercubes","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Science and Engineering Research Board; Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Combinatorics; Hypercube; Mathematics; Integer (computer science); Vertex (graph theory); Induced subgraph; Discrete mathematics; Graph","score_opus":0.009741632269100343,"score_gpt":0.22829226629881294,"score_spread":0.2185506340297126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400512506","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8664555,0.00083645986,0.07817589,0.0006723695,0.000064671105,0.00018046652,0.0014556954,0.00044257814,0.051716328],"genre_scores_gemma":[0.93585193,0.0006190899,0.051453643,0.00024323181,0.000053467742,0.0001883429,0.004025008,0.000097110715,0.007468155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942786,0.00013072339,0.000044492946,0.0001473326,0.00012594875,0.00012369882],"domain_scores_gemma":[0.99910295,0.00031850347,0.00022498236,0.00011647023,0.00012125446,0.0001158996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002771626,0.00031294086,0.00030482796,0.00068686134,0.00066236715,0.0010766976,0.00058972853,0.0004997041,0.0042352136],"category_scores_gemma":[0.0014774934,0.00037998686,0.0005722413,0.0008385565,0.0007764739,0.001344765,0.0012427694,0.00061941467,0.0006667077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055409776,0.0002203518,0.010487883,0.0008142128,0.000095254,0.0017785144,0.0015072133,0.084459275,0.039702248,0.7840532,0.012302967,0.0640247],"study_design_scores_gemma":[0.0001761663,0.00020791577,0.008833126,0.00014841298,0.00005602508,0.0016328489,0.0014415146,0.19029737,0.02171458,0.7420958,0.03333045,0.00006584793],"about_ca_topic_score_codex":0.0015881078,"about_ca_topic_score_gemma":0.0022051623,"teacher_disagreement_score":0.0042352136,"about_ca_system_score_codex":0.00082417537,"about_ca_system_score_gemma":0.00036605645,"threshold_uncertainty_score":0.014168203},"labels":[],"label_agreement":null},{"id":"W4400512519","doi":"10.61091/ars159-09","title":"On the Eccentric Graph of Trees","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Eccentric; Graph; Vertex (graph theory); Complement graph; Bound graph; Discrete mathematics; Graph power; Line graph; Physics","score_opus":0.023725452130310354,"score_gpt":0.2797744487017792,"score_spread":0.25604899657146885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400512519","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69579935,0.0010273908,0.24846527,0.00082608586,0.00008914222,0.000057573536,0.00030111204,0.00013764782,0.053296354],"genre_scores_gemma":[0.943986,0.0013203189,0.04655091,0.00022416894,0.00018049468,0.000054082444,0.00040183842,0.00007508031,0.007207136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996197,0.00010971869,0.000014465605,0.0001092229,0.00007216598,0.000074678144],"domain_scores_gemma":[0.99852127,0.000677618,0.0002569245,0.00015507369,0.00016673861,0.00022237467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039743507,0.00035975978,0.00043722146,0.0011527269,0.0013267499,0.0009701447,0.0005417007,0.0007157749,0.0034441263],"category_scores_gemma":[0.0024234867,0.00021702815,0.0002896661,0.0012130251,0.001832963,0.0029547682,0.0019261946,0.00091801246,0.0004203584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009029399,0.000029104409,0.0015508501,0.00008286458,0.000009802959,0.00050127984,0.0006508208,0.0076706787,0.005416162,0.9679597,0.0012691728,0.014769308],"study_design_scores_gemma":[0.000021452335,0.00006290561,0.0020774805,0.00004472846,0.000024823352,0.0009485633,0.00068972795,0.037994016,0.002226432,0.9375172,0.018372875,0.00001980457],"about_ca_topic_score_codex":0.0012706334,"about_ca_topic_score_gemma":0.0009425387,"teacher_disagreement_score":0.0034441263,"about_ca_system_score_codex":0.00058601977,"about_ca_system_score_gemma":0.00023774178,"threshold_uncertainty_score":0.011521757},"labels":[],"label_agreement":null},{"id":"W4400512525","doi":"10.61091/ars159-11","title":"Graceful Labellings of Variable Windmills Using Skolem-type Sequences","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex (graph theory); Type (biology); Mathematics; Graph; Combinatorics; Discrete mathematics; Computer science; Geology","score_opus":0.019184589989957968,"score_gpt":0.25428148416126767,"score_spread":0.2350968941713097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400512525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2871679,0.00029439974,0.66200584,0.0005624908,0.00026278693,0.00008888512,0.00024955472,0.0010867433,0.048281383],"genre_scores_gemma":[0.82892865,0.0003093761,0.15010862,0.00034637118,0.00010443531,0.00015477711,0.00041472557,0.0005780229,0.019055009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992017,0.00019233534,0.000049722963,0.0002094575,0.00018884365,0.00015799151],"domain_scores_gemma":[0.99821305,0.00072516926,0.0002172862,0.00042983543,0.00019876592,0.00021595742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008763804,0.000565318,0.00038309125,0.0011277325,0.0018759774,0.0015380174,0.00090410555,0.00094019243,0.005474641],"category_scores_gemma":[0.002949222,0.0005573106,0.0009836142,0.00068748486,0.0025556607,0.003995533,0.0019328383,0.0021479595,0.0010887987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000613224,0.000021285447,0.00042915362,0.000040262687,0.0000058312057,0.00016424645,0.0004330472,0.0036201675,0.0049899286,0.9809795,0.00074193854,0.008513266],"study_design_scores_gemma":[0.000012254227,0.000034152614,0.00019513103,0.000035680732,0.0000092355285,0.00016427261,0.00015229086,0.0118564665,0.0058896155,0.97238886,0.009230735,0.000031264404],"about_ca_topic_score_codex":0.0006625762,"about_ca_topic_score_gemma":0.0010787377,"teacher_disagreement_score":0.005474641,"about_ca_system_score_codex":0.0010380455,"about_ca_system_score_gemma":0.00047548683,"threshold_uncertainty_score":0.01831448},"labels":[],"label_agreement":null},{"id":"W4400512536","doi":"10.61091/ars159-06","title":"Some Properties of Channel Detecting Codes on Specific Domains","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Channel (broadcasting); Code (set theory); Construct (python library); Algorithm; Computer science; Systematic code; Focus (optics); Channel code; Mathematics; Transmission (telecommunications); Theoretical computer science; Low-density parity-check code; Decoding methods; Programming language; Physics; Telecommunications","score_opus":0.021807081454215956,"score_gpt":0.2358875450683831,"score_spread":0.21408046361416716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400512536","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7285833,0.00038876076,0.23132977,0.00052568637,0.00008101241,0.00007979706,0.00043730668,0.00039661725,0.038177695],"genre_scores_gemma":[0.9764845,0.00023732494,0.018784218,0.0001356564,0.000091183414,0.0000894138,0.00031412486,0.00013611864,0.0037274624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986772,0.00030974753,0.00007872328,0.00023754536,0.00038437254,0.00031243634],"domain_scores_gemma":[0.99068075,0.0053875367,0.0012397658,0.0007858516,0.0012887284,0.00061743706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085679657,0.0004629446,0.00051728357,0.0015078016,0.0011514995,0.0014945164,0.0006094458,0.0008081202,0.0028210296],"category_scores_gemma":[0.0060628415,0.00026111215,0.00066069927,0.0009723883,0.0022410504,0.0020100598,0.0012176897,0.0014907377,0.00042643587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020781963,0.000039992723,0.0015966607,0.000098909244,0.000013905106,0.00028946853,0.00029715037,0.017490974,0.009582417,0.9574618,0.001094635,0.011826337],"study_design_scores_gemma":[0.00007407013,0.00024285921,0.0015506663,0.00007638713,0.000037693033,0.001098452,0.00026127248,0.14852285,0.021876449,0.81908464,0.0070454655,0.00012908565],"about_ca_topic_score_codex":0.0007074529,"about_ca_topic_score_gemma":0.00039270552,"teacher_disagreement_score":0.0028210296,"about_ca_system_score_codex":0.00093489845,"about_ca_system_score_gemma":0.00084395055,"threshold_uncertainty_score":0.009437263},"labels":[],"label_agreement":null},{"id":"W4400512539","doi":"10.61091/ars159-13","title":"Construction of Coded Caching Scheme Based on Vector Space over Finite Field","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Tianjin Municipal Education Commission; Civil Aviation University of China","keywords":"Scheme (mathematics); Cache; Computer science; Space (punctuation); Finite field; Field (mathematics); Transmission (telecommunications); Class (philosophy); Computer network; Algorithm; Mathematics; Discrete mathematics; Telecommunications","score_opus":0.009957352580260814,"score_gpt":0.22956339593889946,"score_spread":0.21960604335863865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400512539","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14624636,0.00032380808,0.8412704,0.00018157075,0.00009110347,0.00014185034,0.00013676901,0.0005285167,0.011079559],"genre_scores_gemma":[0.80981773,0.0002395482,0.1856975,0.00006977562,0.000024702964,0.000108319684,0.00014428109,0.00002461635,0.003873473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997173,0.00007964452,0.000020689595,0.00004654209,0.00008378352,0.00005202147],"domain_scores_gemma":[0.9994504,0.00013182178,0.000078332465,0.00014217017,0.00015203808,0.00004527944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029093842,0.00027776125,0.00038163827,0.00065560517,0.00047803405,0.00062176667,0.00052542955,0.00041255084,0.0017532436],"category_scores_gemma":[0.0008773191,0.00012069014,0.0002992093,0.0009930019,0.0005729754,0.0010363617,0.00053723255,0.00039827707,0.00027940905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033551472,0.00015836355,0.0020752226,0.00024134068,0.000049637598,0.000321226,0.00026251865,0.15487517,0.1081466,0.5709027,0.003992314,0.15863933],"study_design_scores_gemma":[0.00008769452,0.0003757164,0.0006223884,0.000031247222,0.00002876417,0.00052236434,0.00008413849,0.89999264,0.040088914,0.047216862,0.010874878,0.00007446982],"about_ca_topic_score_codex":0.0014739156,"about_ca_topic_score_gemma":0.001063602,"teacher_disagreement_score":0.0017532436,"about_ca_system_score_codex":0.0007448032,"about_ca_system_score_gemma":0.00069520035,"threshold_uncertainty_score":0.0058651567},"labels":[],"label_agreement":null},{"id":"W4400513378","doi":"10.61091/ars159-01","title":"On Fractional ID-\\((g,f)\\)-factor-critical Covered Graphs","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Shandong Province; Government of Jiangsu Province","keywords":"Mathematics; Factor (programming language); Combinatorics; Computer science; Programming language","score_opus":0.019749619431785062,"score_gpt":0.31950573020830364,"score_spread":0.2997561107765186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400513378","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8660452,0.0007016082,0.118020184,0.00035505267,0.00004744372,0.000070686016,0.00063071074,0.00025683176,0.013872222],"genre_scores_gemma":[0.9735092,0.00039932178,0.023057934,0.00010020072,0.000060385355,0.000047597267,0.00079025724,0.0000715273,0.0019635663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948525,0.00006106851,0.00002540321,0.00016799873,0.00010074404,0.00015944894],"domain_scores_gemma":[0.99831104,0.0007228113,0.00023814519,0.00019193221,0.00021948529,0.00031660724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032882873,0.00057618594,0.00052865094,0.001797023,0.001540567,0.001114667,0.0006046071,0.00065134175,0.002950745],"category_scores_gemma":[0.0028805262,0.00035912398,0.00063334266,0.0012826707,0.0014843019,0.0019179209,0.0013335877,0.00061587326,0.0002881264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010739636,0.00014425328,0.02115077,0.0005527845,0.00011488673,0.0025199617,0.002255225,0.071576424,0.061523058,0.7737939,0.0065699522,0.058724806],"study_design_scores_gemma":[0.0001097868,0.00026665337,0.011352032,0.00019403386,0.00019547941,0.0041877073,0.0016725957,0.20309739,0.030821854,0.7168165,0.03116782,0.00011809775],"about_ca_topic_score_codex":0.0036433376,"about_ca_topic_score_gemma":0.0026345253,"teacher_disagreement_score":0.0036433376,"about_ca_system_score_codex":0.0011055741,"about_ca_system_score_gemma":0.00048912084,"threshold_uncertainty_score":0.009871244},"labels":[],"label_agreement":null},{"id":"W4400513380","doi":"10.61091/ars159-03","title":"Full Edge-Friendly Index Sets of One Point Union of Cycles","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Point (geometry); Enhanced Data Rates for GSM Evolution; Geometry; Computer science; Artificial intelligence","score_opus":0.021356344053248058,"score_gpt":0.28971049691793777,"score_spread":0.2683541528646897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400513380","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7171612,0.00094989146,0.20732744,0.00020991314,0.00008898289,0.00016093231,0.0013875661,0.0005659582,0.07214802],"genre_scores_gemma":[0.9163176,0.0006795396,0.06745392,0.00018410721,0.00011295635,0.00027305618,0.0022606486,0.0002947816,0.012423386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988651,0.00013156304,0.0000987064,0.000305771,0.00039396217,0.00020480585],"domain_scores_gemma":[0.99837035,0.00041518122,0.00033645768,0.00028580838,0.00027220524,0.00032003497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051536516,0.00061611424,0.00079743325,0.002784204,0.0019138304,0.0028032935,0.001243673,0.0007837752,0.0051431623],"category_scores_gemma":[0.003010797,0.0005636939,0.0009530136,0.0022080105,0.0014422175,0.003120698,0.0020387066,0.0009999383,0.001090339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025581682,0.00006628454,0.0024417208,0.0001477058,0.000045086148,0.0004512129,0.001027039,0.0093109,0.0065624863,0.9466597,0.0024203034,0.030611886],"study_design_scores_gemma":[0.00004372148,0.00010715375,0.0017175949,0.000078845755,0.00005752712,0.0006130938,0.00042760698,0.048631273,0.005559968,0.9267419,0.015957506,0.00006378296],"about_ca_topic_score_codex":0.0012217689,"about_ca_topic_score_gemma":0.0010530163,"teacher_disagreement_score":0.0051431623,"about_ca_system_score_codex":0.0008860113,"about_ca_system_score_gemma":0.00044981128,"threshold_uncertainty_score":0.017205596},"labels":[],"label_agreement":null},{"id":"W4400513382","doi":"10.61091/ars159-05","title":"Sharp Bounds for the General Randic Index of \\(R\\)-Graph Products","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"United Arab Emirates University","keywords":"Mathematics; Graph; Combinatorics; Index (typography); Discrete mathematics; Computer science","score_opus":0.05393937460844137,"score_gpt":0.34449367099766165,"score_spread":0.29055429638922026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400513382","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43924844,0.006621462,0.4102548,0.0021675169,0.0002206392,0.00013472274,0.0008313015,0.00072723784,0.13979387],"genre_scores_gemma":[0.911089,0.0018646406,0.0792397,0.00032342208,0.00030361692,0.000166744,0.00046004035,0.00025991484,0.006292937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.997482,0.0006262826,0.00011086138,0.0007262484,0.0006047608,0.00044991358],"domain_scores_gemma":[0.98248464,0.011811381,0.0015409648,0.0020183423,0.0009403671,0.0012043411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037658913,0.0014917012,0.0011146633,0.0037515818,0.0012599833,0.004092689,0.0032373385,0.0015209848,0.004548434],"category_scores_gemma":[0.017478118,0.00072987017,0.0011541025,0.0018982975,0.005723117,0.00844308,0.0032084254,0.00467128,0.00081954815],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001910699,0.000044831257,0.0028495844,0.00016252771,0.000046335852,0.00017151814,0.0002505012,0.016113184,0.005897222,0.960421,0.0016668346,0.012185389],"study_design_scores_gemma":[0.00002188475,0.00008237021,0.0022948927,0.000101910635,0.00006473079,0.0003779702,0.00012700472,0.103880174,0.006651292,0.8809923,0.0053318534,0.000073702155],"about_ca_topic_score_codex":0.00085000624,"about_ca_topic_score_gemma":0.0013382005,"teacher_disagreement_score":0.004548434,"about_ca_system_score_codex":0.0024171015,"about_ca_system_score_gemma":0.0006765598,"threshold_uncertainty_score":0.019916177},"labels":[],"label_agreement":null},{"id":"W4400513417","doi":"10.61091/ars159-04","title":"\\(4\\)-Total Prime Cordial Labeling of Some Derived Graphs","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Prime (order theory); Combinatorics","score_opus":0.010543433514159846,"score_gpt":0.2301129023131489,"score_spread":0.21956946879898906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400513417","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8423026,0.00028480895,0.09062988,0.00044987598,0.000050354247,0.000053600386,0.00039432017,0.00026738003,0.0655671],"genre_scores_gemma":[0.93510884,0.00033649322,0.04758648,0.00014497452,0.000039515246,0.00004573853,0.00080754183,0.00006776525,0.01586269],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998666,0.000023773244,0.000007660638,0.000045697743,0.0000251729,0.00003108242],"domain_scores_gemma":[0.9997037,0.00007949092,0.000049432965,0.000055039174,0.00006198001,0.000050304698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014903859,0.00017440143,0.00018517047,0.00039249423,0.00089618244,0.0005575938,0.00033618,0.00026074867,0.0030629856],"category_scores_gemma":[0.0005368742,0.00011599552,0.00023547684,0.00050857593,0.0005294954,0.00082732126,0.00043836306,0.0004695137,0.00028691423],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011807136,0.00005671445,0.0035088458,0.0001656247,0.000014783706,0.00042648436,0.000672446,0.0075792833,0.017826576,0.9178281,0.0035694186,0.048233747],"study_design_scores_gemma":[0.00005580434,0.00012284012,0.0051115486,0.000049508322,0.00007820788,0.0012639988,0.0005706065,0.059046127,0.029296365,0.8384324,0.06593482,0.000037797625],"about_ca_topic_score_codex":0.0014070803,"about_ca_topic_score_gemma":0.0020655065,"teacher_disagreement_score":0.0030629856,"about_ca_system_score_codex":0.0009047786,"about_ca_system_score_gemma":0.00037692633,"threshold_uncertainty_score":0.010246754},"labels":[],"label_agreement":null},{"id":"W4400513463","doi":"10.61091/ars159-02","title":"Computing Edge Irregularity Strength of Star and Banana Trees Using Algorithmic Approach","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Star (game theory); Enhanced Data Rates for GSM Evolution; Tree (set theory); Combinatorics; Computer science; Artificial intelligence; Mathematical analysis","score_opus":0.018458059347602654,"score_gpt":0.24229526607082805,"score_spread":0.22383720672322538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400513463","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5359907,0.00033835223,0.4528656,0.00019565433,0.000033556666,0.000076425065,0.0003299185,0.00071074464,0.009459037],"genre_scores_gemma":[0.80424297,0.00016497647,0.19296297,0.00006146469,0.000018248425,0.000059733255,0.0007810962,0.000079076606,0.0016294315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.999539,0.000060284936,0.000029002313,0.00012990697,0.00016644441,0.00007537694],"domain_scores_gemma":[0.9981267,0.0008795496,0.00025878864,0.00021495909,0.0004019593,0.00011806451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052001886,0.0003696104,0.00043438261,0.002030243,0.0006442871,0.0011259827,0.00066566485,0.00056250155,0.0019362755],"category_scores_gemma":[0.003947225,0.00025682518,0.0004847125,0.0014306089,0.00067612564,0.0017198381,0.00074153236,0.00057582144,0.00026363466],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007702,0.00026026435,0.041495647,0.0004890486,0.000107851214,0.00063891354,0.0007663987,0.33990148,0.044745933,0.26506433,0.005506238,0.30025378],"study_design_scores_gemma":[0.000020753074,0.00015466746,0.0051570376,0.000027506103,0.00003776571,0.00040824406,0.00024274085,0.891742,0.011416904,0.087007575,0.0037566568,0.000028133723],"about_ca_topic_score_codex":0.0019399419,"about_ca_topic_score_gemma":0.0032944933,"teacher_disagreement_score":0.002030243,"about_ca_system_score_codex":0.0006732932,"about_ca_system_score_gemma":0.0006150541,"threshold_uncertainty_score":0.006477535},"labels":[],"label_agreement":null},{"id":"W4402536618","doi":"10.61091/ars-in-press-02","title":"Nilpotent Covers of Dihedral Groups","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dihedral group; Nilpotent; Dihedral angle; Pure mathematics; Group (periodic table); Chemistry","score_opus":0.005181752518495255,"score_gpt":0.18989263048196028,"score_spread":0.18471087796346503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402536618","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9792594,0.00044162586,0.0058517135,0.00007917345,0.000019623247,0.000016006012,0.000101364494,0.0000579855,0.014173132],"genre_scores_gemma":[0.99730396,0.00011461273,0.001337022,0.00001619206,0.000016992111,0.000017469965,0.00012435911,0.0000068115974,0.0010626321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949956,0.000059663824,0.000025985026,0.00007023998,0.00015899206,0.0001855888],"domain_scores_gemma":[0.9989573,0.00043286514,0.00020671371,0.00008911979,0.00008917047,0.00022474433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002776008,0.00035926574,0.0004007404,0.0028131453,0.0010018097,0.0017805734,0.00045419423,0.00035091484,0.0019462197],"category_scores_gemma":[0.0017264236,0.000184239,0.00020388835,0.00096566614,0.0009425356,0.0010875894,0.001515445,0.0003451209,0.0002459487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008809638,0.00016492924,0.023627348,0.00026491217,0.00007777589,0.0012590776,0.0022147277,0.020684466,0.06624312,0.83886904,0.0021103558,0.04360324],"study_design_scores_gemma":[0.0001070785,0.00033426998,0.01750301,0.000080724414,0.00007184928,0.0019684639,0.0018902336,0.09217356,0.04943764,0.81402105,0.022343347,0.00006883429],"about_ca_topic_score_codex":0.00051445275,"about_ca_topic_score_gemma":0.00051371625,"teacher_disagreement_score":0.0028131453,"about_ca_system_score_codex":0.0009397513,"about_ca_system_score_gemma":0.00034023874,"threshold_uncertainty_score":0.0068184137},"labels":[],"label_agreement":null},{"id":"W4403165667","doi":"10.61091/ars-160-05","title":"Hub Cover Pebbling Number","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematics and Applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cover (algebra); Mathematics; Engineering","score_opus":0.03712291434200046,"score_gpt":0.3339131113200706,"score_spread":0.2967901969780702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165667","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8850088,0.00044542507,0.06412107,0.00036537432,0.0000761075,0.000063898275,0.0033216337,0.0009060578,0.045691695],"genre_scores_gemma":[0.9777371,0.00020915056,0.012484324,0.000035149722,0.000023709368,0.00003859698,0.0014506418,0.00008452777,0.007936848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997106,0.000017803155,0.0000060845455,0.000062982435,0.00009729546,0.00010524362],"domain_scores_gemma":[0.99896383,0.0004993284,0.00008339588,0.00015464019,0.00015329372,0.00014561445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002830094,0.00038193527,0.0004146982,0.0016696253,0.00069178833,0.00086599874,0.00049320713,0.00058092055,0.010090859],"category_scores_gemma":[0.0026002578,0.00014297069,0.00022820427,0.0010443974,0.0007248924,0.0015130427,0.0005394102,0.00052458886,0.0010674375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009010363,0.00022450257,0.025142867,0.00038695312,0.00011673432,0.0005913473,0.00039253914,0.38671228,0.04779676,0.32815704,0.02848294,0.18109499],"study_design_scores_gemma":[0.00005786972,0.00021332402,0.02877001,0.00006429028,0.00007263066,0.0008909161,0.00024877038,0.6060545,0.055685926,0.2859392,0.021909298,0.00009336106],"about_ca_topic_score_codex":0.0019971575,"about_ca_topic_score_gemma":0.0026430476,"teacher_disagreement_score":0.010090859,"about_ca_system_score_codex":0.0013633365,"about_ca_system_score_gemma":0.00057555945,"threshold_uncertainty_score":0.03375727},"labels":[],"label_agreement":null},{"id":"W4403165669","doi":"10.61091/ars-160-13","title":"Properties of Cubic Fuzzy Competition Graphs with Applications","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Competition (biology); Fuzzy logic; Cubic graph; Discrete mathematics; Computer science; Artificial intelligence; Graph; Line graph; Biology","score_opus":0.07967434188132747,"score_gpt":0.34778938230432416,"score_spread":0.2681150404229967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165669","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22958818,0.0005027515,0.711937,0.00065945485,0.00007283933,0.0001248121,0.00049252127,0.00025611682,0.056366358],"genre_scores_gemma":[0.9367557,0.00027292056,0.05592016,0.000112223526,0.00003997292,0.00009073131,0.00026249368,0.000044749024,0.006501117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992907,0.00017423432,0.000033827153,0.00013400326,0.00026328678,0.00010392493],"domain_scores_gemma":[0.9976452,0.0011275179,0.00029244527,0.00018636453,0.0005533351,0.00019504238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007267943,0.00031920997,0.00042309897,0.0014546424,0.0012377901,0.0011183593,0.0007885642,0.000656655,0.0064236913],"category_scores_gemma":[0.0037547392,0.00021592698,0.0008333002,0.0015743101,0.0014725885,0.0015975062,0.00091740786,0.0008625634,0.00036963826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058401318,0.0000247125,0.0011809091,0.00009482625,0.00002340192,0.00023287677,0.00028954248,0.058906373,0.0027528065,0.90984786,0.0013470075,0.02524124],"study_design_scores_gemma":[0.00001698027,0.000043645658,0.0009985871,0.00001903678,0.000013140996,0.00035381367,0.00017433058,0.25922707,0.0008881693,0.7328021,0.0054340386,0.000029085146],"about_ca_topic_score_codex":0.007840718,"about_ca_topic_score_gemma":0.0044058817,"teacher_disagreement_score":0.007840718,"about_ca_system_score_codex":0.0013959436,"about_ca_system_score_gemma":0.00083402114,"threshold_uncertainty_score":0.021489382},"labels":[],"label_agreement":null},{"id":"W4403165675","doi":"10.61091/ars-160-07","title":"Hyperplanes of Segre Geometries","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematics and Applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hyperplane; Mathematics; Geometry","score_opus":0.035952620625211755,"score_gpt":0.31303252701213374,"score_spread":0.277079906386922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165675","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86196077,0.00093151076,0.060612652,0.00029626436,0.00020100406,0.00005253159,0.00041244458,0.00022424993,0.075308576],"genre_scores_gemma":[0.97708845,0.0003780368,0.009458562,0.00006209169,0.00015169448,0.000026177566,0.00047153764,0.000042187192,0.012321247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994029,0.0000921712,0.000028325914,0.00012029418,0.00016874388,0.00018762334],"domain_scores_gemma":[0.99956304,0.000056708723,0.00010769555,0.000064395346,0.00009898509,0.00010914496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040300295,0.00056772545,0.00032248968,0.0013665551,0.0009968912,0.0016849443,0.0004075838,0.0004224497,0.0069004456],"category_scores_gemma":[0.00069363124,0.00022441937,0.00044116838,0.0006816591,0.00269451,0.0027596203,0.001626453,0.0012622427,0.0012808302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063219464,0.000024903988,0.0025746406,0.000049489812,0.00001151088,0.00023890518,0.0007336287,0.0009973773,0.004311043,0.9760066,0.0011839607,0.013804749],"study_design_scores_gemma":[0.00003576431,0.00024785587,0.008874041,0.000061778745,0.000025617192,0.0015237074,0.0016545493,0.005095474,0.008798574,0.9298462,0.043759257,0.000077113706],"about_ca_topic_score_codex":0.000625988,"about_ca_topic_score_gemma":0.00050150976,"teacher_disagreement_score":0.0069004456,"about_ca_system_score_codex":0.0005971413,"about_ca_system_score_gemma":0.00026120475,"threshold_uncertainty_score":0.023084342},"labels":[],"label_agreement":null},{"id":"W4403165685","doi":"10.61091/ars-160-15","title":"On Detour Index of Join of Hamilton-connected Graphs","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Join (topology); Mathematics; Index (typography); Combinatorics; Computer science; World Wide Web","score_opus":0.009935465471465751,"score_gpt":0.22702169703484976,"score_spread":0.217086231563384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165685","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6004817,0.0018712295,0.31650636,0.00051757245,0.00017541055,0.000068012596,0.00048308505,0.00026568587,0.0796309],"genre_scores_gemma":[0.9672034,0.000629487,0.025907977,0.00008559145,0.00013553872,0.00006382491,0.0002982627,0.00010749577,0.005568347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955755,0.000096722644,0.000019877612,0.00007953874,0.00016454332,0.000081717684],"domain_scores_gemma":[0.9971584,0.0017137261,0.00033719276,0.00021122364,0.00022801985,0.00035137276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068478164,0.0003166213,0.0004768721,0.0023408118,0.0010899315,0.0013859345,0.0010324494,0.000745436,0.0065775653],"category_scores_gemma":[0.004338071,0.00016700735,0.00030218472,0.0013680134,0.0015521434,0.0033066391,0.0015732506,0.0012472181,0.0006108627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118963486,0.000040101142,0.0016814199,0.00010300539,0.000010351436,0.00009991149,0.00028646138,0.016001223,0.0040020263,0.9598761,0.0013563293,0.016424134],"study_design_scores_gemma":[0.0000143646785,0.00006094816,0.0013877283,0.00003051007,0.000012456539,0.00014740521,0.00023247268,0.10657766,0.0030511788,0.8841409,0.004318463,0.000025863228],"about_ca_topic_score_codex":0.0007005078,"about_ca_topic_score_gemma":0.00087184657,"teacher_disagreement_score":0.0065775653,"about_ca_system_score_codex":0.0010855895,"about_ca_system_score_gemma":0.00029785253,"threshold_uncertainty_score":0.022004128},"labels":[],"label_agreement":null},{"id":"W4403165688","doi":"10.61091/ars-160-08","title":"Decomposition of the λ -Fold Complete Equipartite Graph into Unicyclic Graphs of Order Five","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Fold (higher-order function); Combinatorics; Graph; Discrete mathematics; Computer science; Programming language","score_opus":0.0075931445805088975,"score_gpt":0.2268545531715541,"score_spread":0.2192614085910452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165688","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78609616,0.00036001255,0.16362889,0.00021324899,0.00005941306,0.0001052852,0.0007405412,0.00024152391,0.04855493],"genre_scores_gemma":[0.9670721,0.00017378484,0.02609971,0.00009197027,0.000019781233,0.000047083697,0.0006044808,0.00002710709,0.005863899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99983406,0.000033734756,0.000009879417,0.00003858712,0.000037448528,0.00004632009],"domain_scores_gemma":[0.99952626,0.00008266298,0.00008403435,0.00009597619,0.00009430214,0.00011685788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014007094,0.00023067424,0.00020317109,0.00091038045,0.0005535115,0.0006077254,0.00033932927,0.00022685164,0.0038520466],"category_scores_gemma":[0.0005757962,0.00019806821,0.0003577718,0.0005107528,0.0005834411,0.00068849453,0.00050525664,0.00044726918,0.00033674872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003580126,0.000076257806,0.0034311172,0.00029257848,0.00005971598,0.00070848875,0.00097018306,0.02364102,0.045309987,0.8650065,0.004753895,0.0553922],"study_design_scores_gemma":[0.000056100598,0.00022162394,0.0116575025,0.00011259646,0.00009591426,0.002138789,0.0012222563,0.10882107,0.019366127,0.8265183,0.02973345,0.00005627115],"about_ca_topic_score_codex":0.0015846835,"about_ca_topic_score_gemma":0.0023756733,"teacher_disagreement_score":0.0038520466,"about_ca_system_score_codex":0.0005044583,"about_ca_system_score_gemma":0.00030119327,"threshold_uncertainty_score":0.012886345},"labels":[],"label_agreement":null},{"id":"W4403165693","doi":"10.61091/ars-60-03","title":"Illuminating a Graph","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.015949325037328408,"score_gpt":0.28917292093243696,"score_spread":0.27322359589510853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073848754,0.0008455169,0.84435433,0.0018884,0.0002718314,0.00028687197,0.0005962248,0.0008602881,0.07704789],"genre_scores_gemma":[0.59377795,0.0012357661,0.36620158,0.0009054087,0.00015079715,0.0003136514,0.0006565257,0.00033713994,0.036421224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988232,0.00036896218,0.000038880687,0.00030935084,0.00022997579,0.00022954062],"domain_scores_gemma":[0.99881494,0.00055215554,0.000090393616,0.00026299834,0.00009392951,0.00018565191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065641257,0.0011310364,0.0006885421,0.0005140714,0.0010510825,0.0018026815,0.0013307217,0.0012979531,0.01594868],"category_scores_gemma":[0.0023471597,0.00041863442,0.00078564347,0.00055145065,0.0022126106,0.003864593,0.0029581827,0.0023512298,0.0018312111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021264402,0.00011298125,0.0006400177,0.0002292021,0.00004639793,0.00035876787,0.00039355922,0.049722493,0.011956415,0.890993,0.006784444,0.038550016],"study_design_scores_gemma":[0.00006761607,0.00031620136,0.0004787499,0.00007503005,0.000048323534,0.00062850723,0.00032395276,0.1488882,0.006433661,0.77456534,0.06812213,0.000052236952],"about_ca_topic_score_codex":0.0012541852,"about_ca_topic_score_gemma":0.0014636981,"teacher_disagreement_score":0.01594868,"about_ca_system_score_codex":0.0011330346,"about_ca_system_score_gemma":0.0006579759,"threshold_uncertainty_score":0.053353667},"labels":[],"label_agreement":null},{"id":"W4403165696","doi":"10.61091/ars-160-16","title":"Edge Domination and Secure Edge Domination in Mycielski Graph of Trees","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Graph; Combinatorics; Domination analysis; Computer science; Vertex (graph theory); Telecommunications","score_opus":0.011006214837464,"score_gpt":0.2774832059882226,"score_spread":0.2664769911507586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165696","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80139494,0.001583825,0.16821547,0.0009893589,0.000073715026,0.00011328034,0.000958073,0.00024899427,0.02642232],"genre_scores_gemma":[0.9829427,0.00044361176,0.01438596,0.00008423034,0.000031308096,0.000039568313,0.00026341155,0.00002530624,0.0017840213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890864,0.00017117878,0.000069202004,0.0002614195,0.00028622468,0.00030331124],"domain_scores_gemma":[0.99474984,0.00326036,0.00050964975,0.0005180963,0.0004821021,0.00047991765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009864127,0.00053497247,0.0006048575,0.0013395445,0.0012785243,0.0018549009,0.00094147195,0.00046316264,0.0019506625],"category_scores_gemma":[0.0049239867,0.0003409409,0.0005453117,0.0011218784,0.0015363736,0.0034484959,0.001844581,0.0013321401,0.00024449936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013843692,0.00019831695,0.01922423,0.00061176904,0.00014973518,0.00051168597,0.0014901011,0.08146909,0.06794813,0.7709091,0.005455077,0.050648373],"study_design_scores_gemma":[0.00011629777,0.00028558014,0.009003923,0.00009994241,0.00020473123,0.0010654582,0.0005831371,0.26759556,0.025044583,0.6791086,0.016793348,0.000098767494],"about_ca_topic_score_codex":0.0013129557,"about_ca_topic_score_gemma":0.0024646383,"teacher_disagreement_score":0.0019506625,"about_ca_system_score_codex":0.0018247493,"about_ca_system_score_gemma":0.00072016823,"threshold_uncertainty_score":0.0132395625},"labels":[],"label_agreement":null},{"id":"W4403165698","doi":"10.61091/ars-160-06","title":"An Alternate Form of Merino-Micka-Mütze’s Solution to a Knuth’s Combinatorial Generation Problem","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Combinatorial design; Discrete mathematics","score_opus":0.037621156564105605,"score_gpt":0.32284011705640897,"score_spread":0.2852189604923034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165698","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0432881,0.0023761857,0.77803624,0.0074113887,0.0013296774,0.000255605,0.0005012274,0.00040561226,0.16639595],"genre_scores_gemma":[0.37281004,0.0027364253,0.51739526,0.0025678868,0.0011518182,0.0006236488,0.0007837594,0.0004050593,0.101526126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994054,0.00015220794,0.000030268848,0.00015910841,0.00015943726,0.00009367266],"domain_scores_gemma":[0.999574,0.00014628943,0.000034892164,0.00011570018,0.000074768795,0.00005436584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008109018,0.0006730856,0.0007789521,0.0010659025,0.0011719659,0.0016812754,0.0015579759,0.0020441525,0.014307257],"category_scores_gemma":[0.003549533,0.00032242973,0.0010536711,0.0012858583,0.0016626939,0.002623419,0.0022104513,0.0022666394,0.0023951866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015851743,0.0000233277,0.0001236185,0.000089648456,0.000010904515,0.000096828866,0.00017095916,0.0024257933,0.00050724536,0.9659296,0.006801512,0.023804713],"study_design_scores_gemma":[0.000027291399,0.000033050605,0.00010755927,0.00004879376,0.000013117241,0.00021143159,0.00008874169,0.013220684,0.0005265562,0.9375049,0.0481972,0.000020671065],"about_ca_topic_score_codex":0.0006886996,"about_ca_topic_score_gemma":0.0011090856,"teacher_disagreement_score":0.014307257,"about_ca_system_score_codex":0.0007469175,"about_ca_system_score_gemma":0.000988047,"threshold_uncertainty_score":0.04786253},"labels":[],"label_agreement":null},{"id":"W4403165702","doi":"10.61091/ars-160-10","title":"A Note on Complete Classification of Repeated-Root σ -Constacyclic Codes of Prime Power Length over F p m [ u ] / ⟨ u 3 ⟩ and their Hamming Distances","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hamming distance; Prime (order theory); Combinatorics; Hamming code; Root (linguistics); Prime power; Discrete mathematics; Statistics; Block code","score_opus":0.014657195662445307,"score_gpt":0.248646103392119,"score_spread":0.2339889077296737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165702","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65339327,0.007880054,0.22475171,0.00802919,0.0020517777,0.00008731601,0.00157027,0.00059130596,0.10164507],"genre_scores_gemma":[0.9344555,0.002872395,0.044621535,0.001237333,0.0014192319,0.000060257644,0.001431149,0.00014064512,0.013761966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922717,0.00010531117,0.000058268273,0.00021865832,0.0002889173,0.000101722326],"domain_scores_gemma":[0.99663466,0.002018391,0.0003382924,0.00050461455,0.00029873368,0.00020545573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073332473,0.0004312285,0.0008704673,0.0016863878,0.0015926795,0.0020875698,0.0008042867,0.001110951,0.0031188384],"category_scores_gemma":[0.0040412312,0.0003181827,0.00043637288,0.0020174272,0.0020138868,0.0026853024,0.0012529579,0.003394579,0.00062803895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003051312,0.000058909347,0.004717267,0.0002564835,0.000026965572,0.0006998157,0.0013774671,0.0050863395,0.008087975,0.8686633,0.015327662,0.09539268],"study_design_scores_gemma":[0.000027672702,0.00015645123,0.0036395888,0.00009622783,0.000027513131,0.0011325371,0.00022732282,0.015915273,0.0057808817,0.9307397,0.04218784,0.00006898244],"about_ca_topic_score_codex":0.00083692564,"about_ca_topic_score_gemma":0.00070659176,"teacher_disagreement_score":0.0031188384,"about_ca_system_score_codex":0.0007954816,"about_ca_system_score_gemma":0.00074152637,"threshold_uncertainty_score":0.010433555},"labels":[],"label_agreement":null},{"id":"W4403165707","doi":"10.61091/ars-160-02","title":"Nilpotent Covers of Dihedral Groups","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Nilpotent; Mathematics; Dihedral group; Dihedral angle; Pure mathematics; Group (periodic table); Chemistry","score_opus":0.005181752518495255,"score_gpt":0.18989263048196028,"score_spread":0.18471087796346503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165707","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9792594,0.00044162586,0.0058517135,0.00007917345,0.000019623247,0.000016006012,0.000101364494,0.0000579855,0.014173132],"genre_scores_gemma":[0.99730396,0.00011461273,0.001337022,0.00001619206,0.000016992111,0.000017469965,0.00012435911,0.0000068115974,0.0010626321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949956,0.000059663824,0.000025985026,0.00007023998,0.00015899206,0.0001855888],"domain_scores_gemma":[0.9989573,0.00043286514,0.00020671371,0.00008911979,0.00008917047,0.00022474433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002776008,0.00035926574,0.0004007404,0.0028131453,0.0010018097,0.0017805734,0.00045419423,0.00035091484,0.0019462197],"category_scores_gemma":[0.0017264236,0.000184239,0.00020388835,0.00096566614,0.0009425356,0.0010875894,0.001515445,0.0003451209,0.0002459487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008809638,0.00016492924,0.023627348,0.00026491217,0.00007777589,0.0012590776,0.0022147277,0.020684466,0.06624312,0.83886904,0.0021103558,0.04360324],"study_design_scores_gemma":[0.0001070785,0.00033426998,0.01750301,0.000080724414,0.00007184928,0.0019684639,0.0018902336,0.09217356,0.04943764,0.81402105,0.022343347,0.00006883429],"about_ca_topic_score_codex":0.00051445275,"about_ca_topic_score_gemma":0.00051371625,"teacher_disagreement_score":0.0028131453,"about_ca_system_score_codex":0.0009397513,"about_ca_system_score_gemma":0.00034023874,"threshold_uncertainty_score":0.0068184137},"labels":[],"label_agreement":null},{"id":"W4403165709","doi":"10.61091/ars-160-04","title":"Outer Independent Double Roman Domination Stability in Graphs","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Stability (learning theory); Combinatorics; Computer science","score_opus":0.022446951307488958,"score_gpt":0.2950131467055869,"score_spread":0.27256619539809795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165709","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8538639,0.0007807716,0.12832065,0.00024515932,0.000023260312,0.00006649612,0.00041208309,0.00030787312,0.0159798],"genre_scores_gemma":[0.9831424,0.0003785974,0.013915208,0.000050100003,0.00004601246,0.000045049877,0.00038790744,0.000060204053,0.0019745084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993326,0.00011239354,0.000041132298,0.00019472753,0.00018362822,0.00013554974],"domain_scores_gemma":[0.9957867,0.002442769,0.00066339347,0.00031985829,0.00043686433,0.0003504303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007553833,0.00085218536,0.0005255641,0.0022521932,0.00073860557,0.0012738549,0.00087438105,0.00045932955,0.0017805464],"category_scores_gemma":[0.0050021275,0.0003829324,0.0006289896,0.001334697,0.001273158,0.001592634,0.0012421256,0.0006970583,0.00032859523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015001664,0.00022330797,0.031630266,0.0006566594,0.0002659566,0.0010091556,0.0020235237,0.42497644,0.10933724,0.2953249,0.004651557,0.12840089],"study_design_scores_gemma":[0.00007201528,0.0002336905,0.011057503,0.000061956605,0.000092663664,0.00080631336,0.00037171802,0.6992434,0.029106779,0.25260484,0.006274651,0.00007442043],"about_ca_topic_score_codex":0.0012959111,"about_ca_topic_score_gemma":0.0012549453,"teacher_disagreement_score":0.0022521932,"about_ca_system_score_codex":0.0009980139,"about_ca_system_score_gemma":0.00035851746,"threshold_uncertainty_score":0.0072411895},"labels":[],"label_agreement":null},{"id":"W4403165714","doi":"10.61091/ars160-01","title":"A Parity Result for Some p -Regular Partitions","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Parity (physics); Combinatorics; Physics; Atomic physics","score_opus":0.06075898436147115,"score_gpt":0.3636629751546327,"score_spread":0.30290399079316155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165714","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7931937,0.000745431,0.05134243,0.00256365,0.00042657793,0.000053301832,0.0005231818,0.00027979453,0.15087193],"genre_scores_gemma":[0.986081,0.00017497654,0.004394459,0.00039053403,0.0002180694,0.000048632395,0.00029986748,0.000057255107,0.008335175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903715,0.00015858722,0.00003998311,0.0002119943,0.0002501968,0.0003020521],"domain_scores_gemma":[0.99720925,0.0013916604,0.00033323112,0.00038946647,0.00026980575,0.00040653138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012563618,0.00056866964,0.0006845431,0.0012016384,0.0020540848,0.0026954736,0.00068296195,0.00075144204,0.006083923],"category_scores_gemma":[0.00523028,0.00037687458,0.00057891995,0.00080745167,0.0032009522,0.0032887487,0.002911637,0.0015476554,0.001009148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004898934,0.00007975127,0.004247732,0.00011123487,0.000025636702,0.0006615636,0.00060455984,0.002290078,0.006784908,0.9621236,0.0057169623,0.016864236],"study_design_scores_gemma":[0.000091530586,0.000091179994,0.0017213234,0.000027749147,0.000037326994,0.00068284845,0.00017018607,0.011150671,0.0037758008,0.976488,0.0057378975,0.000025597843],"about_ca_topic_score_codex":0.0006378693,"about_ca_topic_score_gemma":0.00038351546,"teacher_disagreement_score":0.006083923,"about_ca_system_score_codex":0.001038171,"about_ca_system_score_gemma":0.0005713369,"threshold_uncertainty_score":0.02035278},"labels":[],"label_agreement":null},{"id":"W4403165717","doi":"10.61091/ars-160-12","title":"On the k-Spanning Cyclability of 4-Valent Cayley Graphs on Abelian Groups","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cayley graph; Abelian group; Mathematics; Combinatorics; Pure mathematics; Graph","score_opus":0.020262456624433163,"score_gpt":0.2878129390935451,"score_spread":0.26755048246911195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165717","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9734167,0.00042999478,0.011340571,0.00025089196,0.000030762872,0.000027086566,0.00013511868,0.00005775525,0.014311127],"genre_scores_gemma":[0.99440336,0.0004632952,0.002967415,0.000045835357,0.00008978947,0.000019707413,0.00021086859,0.000015901667,0.0017839748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997254,0.000057698868,0.00001744943,0.00007218448,0.00004722309,0.0000800909],"domain_scores_gemma":[0.99865204,0.00058311236,0.00034794764,0.000094907125,0.00010476487,0.00021727003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030430214,0.00043840735,0.00028171533,0.0016636819,0.0010091638,0.0011972808,0.00048083317,0.0006369857,0.0045676786],"category_scores_gemma":[0.0013931566,0.00023945092,0.00036225928,0.0014041301,0.0016378735,0.0023707817,0.0010747412,0.00054400193,0.00026510263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043616895,0.00013201241,0.009882754,0.0002628276,0.00005788597,0.002070715,0.0028767665,0.022930335,0.022930013,0.8968823,0.0025811577,0.038957],"study_design_scores_gemma":[0.00005211686,0.00018873469,0.0071767345,0.000069922266,0.00003768428,0.0011480564,0.0016317606,0.038403854,0.004549526,0.93930954,0.00737148,0.000060565566],"about_ca_topic_score_codex":0.001682221,"about_ca_topic_score_gemma":0.0014927335,"teacher_disagreement_score":0.0045676786,"about_ca_system_score_codex":0.0005521899,"about_ca_system_score_gemma":0.00022947958,"threshold_uncertainty_score":0.015280426},"labels":[],"label_agreement":null},{"id":"W4403165726","doi":"10.61091/ars-160-14","title":"Enumeration and Growth Functions for Uniform Tilings of the Hyperbolic Plane","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Enumeration; Mathematics; Plane (geometry); Hyperbolic geometry; Pure mathematics; Combinatorics; Geometry","score_opus":0.019535203395977054,"score_gpt":0.2668368736791199,"score_spread":0.24730167028314284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165726","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.915825,0.000393937,0.061282203,0.00023322707,0.000045090837,0.000035866404,0.00036667017,0.00017029118,0.021647707],"genre_scores_gemma":[0.97314924,0.00036025257,0.018228892,0.000046009092,0.00005623551,0.000117137264,0.0006544873,0.00010341074,0.0072842627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965215,0.000063471605,0.000029205976,0.00006429676,0.00009025936,0.00010066415],"domain_scores_gemma":[0.997617,0.0013287738,0.00034306146,0.00016044395,0.0003117236,0.00023899287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047057224,0.00037534322,0.00039515854,0.0026743438,0.0008006746,0.0017467005,0.000558245,0.00056914194,0.0037285467],"category_scores_gemma":[0.0038886024,0.00032448475,0.00047163293,0.0010803625,0.0011567087,0.0014317388,0.000907589,0.000534271,0.00053941074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015952259,0.00007236985,0.010554227,0.00013642466,0.000021054078,0.00047559105,0.0006134144,0.02882161,0.018878315,0.894892,0.0025748808,0.04280075],"study_design_scores_gemma":[0.000030022713,0.00008516261,0.0075818226,0.000078654375,0.000018969773,0.00095639424,0.000490133,0.26374242,0.016027063,0.7038884,0.0070475615,0.00005336607],"about_ca_topic_score_codex":0.0009198065,"about_ca_topic_score_gemma":0.00072075287,"teacher_disagreement_score":0.0037285467,"about_ca_system_score_codex":0.0008245191,"about_ca_system_score_gemma":0.00023661248,"threshold_uncertainty_score":0.012473226},"labels":[],"label_agreement":null},{"id":"W4403165727","doi":"10.61091/ars-160-09","title":"Decomposition of Complete Tripartite Graphs into Short Cycles","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Decomposition; Discrete mathematics; Chemistry","score_opus":0.02228818980086592,"score_gpt":0.3231222616827255,"score_spread":0.30083407188185957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165727","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47621936,0.0025845533,0.44238213,0.00083916966,0.00028924365,0.0004824004,0.0034776246,0.00055008795,0.07317544],"genre_scores_gemma":[0.838907,0.0011788177,0.12506513,0.00059918273,0.00017895056,0.00040987984,0.0044534975,0.00020937508,0.028998218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995105,0.00008943853,0.000034668814,0.00013642144,0.00011432284,0.000114664275],"domain_scores_gemma":[0.99901915,0.000121315534,0.00016658376,0.00020592548,0.00023536701,0.00025164773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022412064,0.00052407035,0.00040790663,0.0012827654,0.0008752463,0.0013101129,0.0006379003,0.0005740572,0.006651316],"category_scores_gemma":[0.0012929462,0.00040161863,0.0006554992,0.0011180397,0.00069312996,0.0021831307,0.001320513,0.0010060875,0.0010166396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039855012,0.00008845493,0.0018369525,0.00046895805,0.00011704459,0.00054679794,0.0010419105,0.024961624,0.027971428,0.8321564,0.013057192,0.09735455],"study_design_scores_gemma":[0.00003110712,0.000098770106,0.0017114081,0.000106726104,0.00005731769,0.0006059035,0.0004695071,0.047027364,0.0046997545,0.9063103,0.038842358,0.00003946957],"about_ca_topic_score_codex":0.001738779,"about_ca_topic_score_gemma":0.0029715311,"teacher_disagreement_score":0.006651316,"about_ca_system_score_codex":0.00089747796,"about_ca_system_score_gemma":0.0005055168,"threshold_uncertainty_score":0.022250831},"labels":[],"label_agreement":null},{"id":"W4403165732","doi":"10.61091/ars-160-17","title":"New Ways to Balance Numbers","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Balance (ability); Psychology","score_opus":0.04181947401945184,"score_gpt":0.33799578860609925,"score_spread":0.2961763145866474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056838065,0.005167467,0.7409246,0.006457228,0.002482199,0.00020238516,0.00032888594,0.00090394577,0.1866953],"genre_scores_gemma":[0.44695058,0.0024611056,0.47572574,0.0032565075,0.0017844171,0.00081122556,0.0003719007,0.00083427946,0.06780421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996716,0.00087434513,0.00029270753,0.000849618,0.0008661984,0.00040127142],"domain_scores_gemma":[0.9972506,0.0010495306,0.00030011428,0.0006728325,0.0003975095,0.0003293556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003702175,0.0015813367,0.0011878047,0.0033922167,0.0032294332,0.0057627237,0.0015018199,0.0025414845,0.014539474],"category_scores_gemma":[0.010808829,0.0008786777,0.001260775,0.0022025974,0.006484244,0.016833467,0.00562463,0.0051645353,0.004382601],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004307207,0.00001966805,0.00014917833,0.000039734383,0.0000060815523,0.000026983082,0.0002347558,0.0006881083,0.0011885619,0.9783729,0.0017775332,0.017453475],"study_design_scores_gemma":[0.00003111053,0.000047756133,0.000086350825,0.00006803289,0.0000110375995,0.00013723047,0.00015965264,0.0040964866,0.0013003115,0.9342408,0.05979116,0.000030006224],"about_ca_topic_score_codex":0.00042912664,"about_ca_topic_score_gemma":0.00068240374,"teacher_disagreement_score":0.014539474,"about_ca_system_score_codex":0.00194105,"about_ca_system_score_gemma":0.00081939274,"threshold_uncertainty_score":0.048639417},"labels":[],"label_agreement":null},{"id":"W4403165746","doi":"10.61091/ars-160-11","title":"The Monophonic-triangular Number of a Graph","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.006335626600193409,"score_gpt":0.23845258957322277,"score_spread":0.23211696297302936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165746","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.783995,0.0005757188,0.11198204,0.0005926079,0.0002792908,0.00008537163,0.0011702445,0.00043590303,0.10088399],"genre_scores_gemma":[0.96300834,0.00018183138,0.02948181,0.000092120594,0.0001116503,0.000078943165,0.0003807645,0.00005020829,0.0066143046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942976,0.00010729259,0.00005038678,0.000202167,0.000113979295,0.00009630982],"domain_scores_gemma":[0.9982667,0.00074450683,0.00028122365,0.0002700901,0.00018542848,0.00025209013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032049074,0.00022675822,0.00026571675,0.0012315965,0.0008769258,0.0016796237,0.00049159786,0.00050903007,0.005288383],"category_scores_gemma":[0.0016355102,0.00016724097,0.0002854907,0.0007327641,0.0018672417,0.0017975142,0.0007282659,0.0004910488,0.0005594896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022221351,0.000034380904,0.0021676712,0.00013783886,0.000014027299,0.00029924433,0.0007608284,0.0035940292,0.019446477,0.9413575,0.0020198193,0.029945891],"study_design_scores_gemma":[0.0000325367,0.00017733179,0.003426254,0.00006904317,0.00003649091,0.001469489,0.0004800514,0.03760403,0.0137649225,0.92026806,0.022604616,0.00006725007],"about_ca_topic_score_codex":0.0005188274,"about_ca_topic_score_gemma":0.0007551577,"teacher_disagreement_score":0.005288383,"about_ca_system_score_codex":0.0006997228,"about_ca_system_score_gemma":0.00039081578,"threshold_uncertainty_score":0.017691433},"labels":[],"label_agreement":null},{"id":"W4406163797","doi":"10.61091/ars161-03","title":"\\((n−2)\\)-Fault-Tolerant Edge-Pancyclicity of Möbius Cubes \\(MQ_n\\)","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Computer science; Artificial intelligence","score_opus":0.01186018279222473,"score_gpt":0.2432766486586561,"score_spread":0.2314164658664314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406163797","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88416225,0.0004067702,0.09155561,0.0003931489,0.000119788776,0.000076850745,0.00038050208,0.00016999459,0.022735028],"genre_scores_gemma":[0.97883075,0.00023630177,0.017054575,0.00010415782,0.000028995028,0.000051344385,0.00029151168,0.00002319403,0.0033792222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998041,0.00003334881,0.000014376587,0.000042963482,0.00004880803,0.000056317647],"domain_scores_gemma":[0.99943894,0.00015050214,0.00012524692,0.000110667665,0.000104437655,0.000070195536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016272989,0.00020725196,0.000250736,0.00028592054,0.0005609583,0.00051843614,0.00041792012,0.00022534135,0.00147028],"category_scores_gemma":[0.0010352811,0.00011405624,0.00025179438,0.00038874647,0.0005152814,0.0006446089,0.00076164183,0.00041981915,0.00018940147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012465727,0.00009791187,0.0064088413,0.00041258306,0.00007649741,0.001441979,0.00064871483,0.17553388,0.1433854,0.5335962,0.006755365,0.13039608],"study_design_scores_gemma":[0.00014423639,0.0007436002,0.00496999,0.00006343367,0.000045805038,0.0021002172,0.00040213845,0.41690475,0.106057376,0.44313207,0.025336454,0.0000999083],"about_ca_topic_score_codex":0.0014866054,"about_ca_topic_score_gemma":0.0017698067,"teacher_disagreement_score":0.0014866054,"about_ca_system_score_codex":0.00043064103,"about_ca_system_score_gemma":0.00039969158,"threshold_uncertainty_score":0.0049185157},"labels":[],"label_agreement":null},{"id":"W4406163979","doi":"10.61091/ars161-15","title":"Hamilton-connected properties of 3-connected {claw, hourglass, bull}-free graphs","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Claw; Hourglass; Mathematics; Combinatorics; Geography; Structural engineering; Engineering","score_opus":0.01876740492641785,"score_gpt":0.24959209917180447,"score_spread":0.23082469424538662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406163979","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9405855,0.00021887978,0.036205065,0.00024496944,0.00001876324,0.000056411252,0.0005696769,0.0001830678,0.021917704],"genre_scores_gemma":[0.9884157,0.00017813398,0.007820431,0.00007205958,0.000013811802,0.00004483024,0.0004813192,0.000045015015,0.0029286984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998529,0.000017202308,0.000008831022,0.0000435877,0.00004059288,0.000036840378],"domain_scores_gemma":[0.9990466,0.00036496858,0.00023164923,0.00009592345,0.00009992694,0.00016093659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000121905185,0.00028957773,0.00021130955,0.0009959845,0.0011117962,0.0010232126,0.0005059439,0.0004365761,0.0052194027],"category_scores_gemma":[0.0009428567,0.00035792805,0.00026563497,0.00089180836,0.0009365344,0.0010146546,0.00069125294,0.0005344289,0.00026520048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048423212,0.00014906781,0.017210575,0.0005605142,0.00013733085,0.0031011375,0.0029774748,0.022822678,0.09820299,0.7957187,0.0069837705,0.05165148],"study_design_scores_gemma":[0.00013739121,0.00016666754,0.027183596,0.000117427306,0.00021579265,0.0031082043,0.0018102557,0.049245354,0.044575747,0.8441462,0.029195229,0.00009817849],"about_ca_topic_score_codex":0.0040271115,"about_ca_topic_score_gemma":0.0054183872,"teacher_disagreement_score":0.0052194027,"about_ca_system_score_codex":0.00047717404,"about_ca_system_score_gemma":0.0003222343,"threshold_uncertainty_score":0.017460644},"labels":[],"label_agreement":null},{"id":"W4406164119","doi":"10.61091/ars161-01","title":"The Zero Forcing Number of Quartic Circulant Graphs of Prime Order","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Circulant matrix; Quartic function; Prime (order theory); Order (exchange); Zero (linguistics); Forcing (mathematics); Combinatorics; Pure mathematics; Discrete mathematics; Mathematical analysis","score_opus":0.005492508806893865,"score_gpt":0.21444864632565572,"score_spread":0.20895613751876185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406164119","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9475621,0.000250208,0.029629668,0.00034745727,0.00005640791,0.000022834934,0.00018973436,0.00010428511,0.021837449],"genre_scores_gemma":[0.9924349,0.0001452262,0.004985628,0.000039052968,0.000038339094,0.000026504062,0.000105436084,0.000029677933,0.0021952176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997991,0.000035282697,0.000008261936,0.000045182245,0.00004507362,0.000067180634],"domain_scores_gemma":[0.99877673,0.00066598604,0.00015620848,0.000096389456,0.000121597404,0.00018306146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037124404,0.00030648755,0.0003156743,0.0015538958,0.0011405902,0.0012786052,0.00046685516,0.00046872464,0.0032760082],"category_scores_gemma":[0.0018427225,0.0001978319,0.00024766935,0.00060140446,0.0015754063,0.0010231584,0.00054785406,0.0007220842,0.00025176437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020870594,0.000050679035,0.002754313,0.00011464719,0.000015820324,0.00029307892,0.00042338046,0.011993681,0.027579574,0.9405958,0.0017741476,0.014196098],"study_design_scores_gemma":[0.000052176616,0.000101501064,0.0043271226,0.00006154444,0.000036669233,0.00047318754,0.00034458743,0.08631817,0.016979834,0.887072,0.004169868,0.000063246705],"about_ca_topic_score_codex":0.00085239287,"about_ca_topic_score_gemma":0.0013510456,"teacher_disagreement_score":0.0032760082,"about_ca_system_score_codex":0.0008449693,"about_ca_system_score_gemma":0.0006084707,"threshold_uncertainty_score":0.010959387},"labels":[],"label_agreement":null},{"id":"W4406164136","doi":"10.61091/ars161-04","title":"A Classification of Mengerian 4-uniform Hypergraphs Derived from Graphs","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.00979477293055983,"score_gpt":0.20593983887715075,"score_spread":0.19614506594659092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406164136","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4676562,0.007835652,0.30929294,0.0013049584,0.00052788446,0.000277978,0.0024276932,0.0011568237,0.20951982],"genre_scores_gemma":[0.83217293,0.0050625545,0.11781971,0.00093912834,0.0004911114,0.00027024024,0.0048018047,0.00039587903,0.038046546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995497,0.00011071625,0.000040748804,0.00011141044,0.00011058044,0.000076775934],"domain_scores_gemma":[0.99891555,0.0004567074,0.00016691076,0.00017140458,0.000171665,0.00011772378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040291843,0.0005648144,0.0004004089,0.0029481482,0.001388588,0.0016683819,0.00067913125,0.00073164765,0.0077313553],"category_scores_gemma":[0.0015522875,0.00030291593,0.00054125505,0.0022362832,0.0008020687,0.0028818594,0.0011620816,0.0010724519,0.00078897225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010953983,0.00003960035,0.0023924846,0.00032736958,0.000036930174,0.00043094484,0.00039449235,0.002917617,0.006955194,0.9119203,0.0048493114,0.0696263],"study_design_scores_gemma":[0.00001931962,0.00007095395,0.0046296017,0.00016880251,0.000070863745,0.0015454598,0.00039895563,0.012963606,0.006044745,0.9003729,0.073665544,0.000049237366],"about_ca_topic_score_codex":0.00042865484,"about_ca_topic_score_gemma":0.0005408494,"teacher_disagreement_score":0.0077313553,"about_ca_system_score_codex":0.0006480536,"about_ca_system_score_gemma":0.00029035538,"threshold_uncertainty_score":0.025863945},"labels":[],"label_agreement":null},{"id":"W4406164146","doi":"10.61091/ars161-08","title":"On-line and Non-line Weighted Generalized Fibonomial Sums","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Line (geometry); Combinatorics; Geometry","score_opus":0.03189240409156067,"score_gpt":0.3196134810689648,"score_spread":0.2877210769774041,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406164146","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22795339,0.0016321648,0.62741965,0.0008152438,0.0011218608,0.0000976494,0.00020975905,0.00035061425,0.14039968],"genre_scores_gemma":[0.74289197,0.0012924565,0.17931177,0.00087630394,0.00091488735,0.00017723338,0.00024240598,0.00041715655,0.07387578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916625,0.0001908753,0.00007216669,0.00013583202,0.0003110887,0.00012374087],"domain_scores_gemma":[0.9992174,0.0001750264,0.0001212643,0.00013795115,0.00025679168,0.000091523136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008340903,0.00063178,0.00050961826,0.0014877171,0.0012525491,0.0020757585,0.0007908119,0.0008621435,0.008718099],"category_scores_gemma":[0.0026046354,0.00022894022,0.0006632519,0.0015069734,0.0015346382,0.004924555,0.001140205,0.0012752115,0.0018623902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016045322,0.000011963076,0.00014382064,0.00003466269,0.0000074100153,0.00013850737,0.00010830878,0.00082375493,0.0024234108,0.9805417,0.0007779024,0.014972534],"study_design_scores_gemma":[0.0000049351875,0.000030886637,0.00029124107,0.000018659837,0.000013918298,0.0005173739,0.00008305612,0.009868262,0.002281379,0.9736414,0.013227876,0.000020989823],"about_ca_topic_score_codex":0.0002649255,"about_ca_topic_score_gemma":0.0004599809,"teacher_disagreement_score":0.008718099,"about_ca_system_score_codex":0.0005365226,"about_ca_system_score_gemma":0.0003003671,"threshold_uncertainty_score":0.02916497},"labels":[],"label_agreement":null},{"id":"W4406164268","doi":"10.61091/ars161-05","title":"Extremal Results for \\(K^-_{r+1}\\) -free Unbalanced Signed Graphs","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.026522128597922003,"score_gpt":0.2931352409297267,"score_spread":0.2666131123318047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406164268","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7393279,0.0017173835,0.14625585,0.0010814918,0.00015331095,0.000047000896,0.00039050583,0.00021109387,0.110815465],"genre_scores_gemma":[0.9761593,0.0006666582,0.014064778,0.00015689478,0.000119421195,0.000051765062,0.00044273943,0.000091626825,0.008246927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945253,0.00016292358,0.000025749532,0.000088712564,0.00016661358,0.00010357484],"domain_scores_gemma":[0.99831474,0.0008326622,0.00031053528,0.0001379908,0.00015156438,0.00025257346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066241674,0.00077348255,0.00065220834,0.0019252497,0.0012997474,0.0016839587,0.0011999249,0.0009572447,0.00552701],"category_scores_gemma":[0.0036310563,0.00036746342,0.00049402344,0.0010272098,0.0015251581,0.0032115255,0.0015862618,0.0013852167,0.0004956961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085972046,0.000041824453,0.0006685639,0.00013370148,0.000016592618,0.000115196126,0.00015490397,0.0143059,0.0023373791,0.9723403,0.0016381957,0.008161477],"study_design_scores_gemma":[0.000017870772,0.00003790527,0.00067205325,0.00004222847,0.000018079685,0.00023062572,0.00017485797,0.055520926,0.002138115,0.93739456,0.0037250314,0.000027724971],"about_ca_topic_score_codex":0.00038959848,"about_ca_topic_score_gemma":0.0006446614,"teacher_disagreement_score":0.00552701,"about_ca_system_score_codex":0.00096790405,"about_ca_system_score_gemma":0.00033573864,"threshold_uncertainty_score":0.018489718},"labels":[],"label_agreement":null},{"id":"W4406164271","doi":"10.61091/ars161-09","title":"On Hermitian Cones in \\(pG(3,q^2\\)","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Hermitian matrix; Mathematics; Characterization (materials science); Pure mathematics; Combinatorics; Physics; Optics","score_opus":0.009287498487718702,"score_gpt":0.237330348251289,"score_spread":0.22804284976357028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406164271","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5808397,0.0016852018,0.25239825,0.0018354439,0.0005984924,0.00021104253,0.0014293995,0.00026930412,0.1607332],"genre_scores_gemma":[0.9404565,0.0009322326,0.031027442,0.00059074484,0.0005960334,0.00012346654,0.0010208206,0.00014808794,0.025104582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924636,0.00018829963,0.000039550418,0.00011793348,0.00024171994,0.0001661469],"domain_scores_gemma":[0.998738,0.00034521398,0.000293359,0.00007766444,0.00025505314,0.00029070873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052957993,0.00082749466,0.00051947293,0.0017843506,0.001557009,0.0026551737,0.0006797846,0.0005063762,0.0075336415],"category_scores_gemma":[0.0012198136,0.00023302407,0.00042358806,0.001587575,0.0019289964,0.0032720182,0.0014893579,0.001883194,0.0010597076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003694404,0.00003153185,0.0003623314,0.00003740224,0.000004374356,0.00020411731,0.00013970697,0.0009835804,0.0014064062,0.98856366,0.0019093405,0.006320531],"study_design_scores_gemma":[0.000022340608,0.000054687713,0.00077143084,0.000037891627,0.0000062604026,0.0004021764,0.0002289315,0.0124817025,0.0013933436,0.9747487,0.009818877,0.00003366855],"about_ca_topic_score_codex":0.0009642591,"about_ca_topic_score_gemma":0.0008333789,"teacher_disagreement_score":0.0075336415,"about_ca_system_score_codex":0.00065864186,"about_ca_system_score_gemma":0.00043201432,"threshold_uncertainty_score":0.025202513},"labels":[],"label_agreement":null},{"id":"W4406164283","doi":"10.61091/ars161-14","title":"Sharp Lower Bound for Randić index of Trees with Fixed Roman Domination Number","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Upper and lower bounds; Combinatorics; Computer science; World Wide Web; Mathematical analysis","score_opus":0.016686441878597295,"score_gpt":0.2918168312654158,"score_spread":0.2751303893868185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406164283","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5771528,0.0083610425,0.22985613,0.0024759243,0.00032887224,0.00010836256,0.0013590072,0.0008708402,0.17948696],"genre_scores_gemma":[0.96493095,0.001465467,0.025424147,0.00033181283,0.00025201854,0.00010774214,0.00059726543,0.00020497387,0.0066856365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989435,0.00019927953,0.000039995266,0.00024148173,0.0002635698,0.00031216547],"domain_scores_gemma":[0.9953784,0.0027294764,0.00040845235,0.0005103605,0.00039289318,0.00058051676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010866103,0.00072208524,0.0013354969,0.0031014227,0.0016356924,0.0031739392,0.0017778177,0.0011988619,0.006067576],"category_scores_gemma":[0.008584617,0.00047457346,0.00061151484,0.0014660319,0.0021715176,0.003994345,0.0020450281,0.0026897283,0.00086483685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030485584,0.000068808935,0.003307729,0.0002661131,0.00004820848,0.00031393845,0.00040657952,0.020300211,0.010760091,0.9420257,0.0065116,0.015686171],"study_design_scores_gemma":[0.00003619242,0.00006400859,0.002076056,0.00010900758,0.00004904518,0.00054462196,0.00015650185,0.075832285,0.0045368033,0.9090172,0.007512315,0.0000658642],"about_ca_topic_score_codex":0.0005465218,"about_ca_topic_score_gemma":0.0010228895,"teacher_disagreement_score":0.006067576,"about_ca_system_score_codex":0.0016144133,"about_ca_system_score_gemma":0.00055792875,"threshold_uncertainty_score":0.020298064},"labels":[],"label_agreement":null},{"id":"W4406164286","doi":"10.61091/ars161-12","title":"Type 1 Kochol Superpositions: Goldberg and Loupekine with Blowup and Semiblowup snarks","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Phytochemical Studies and Bioactivities","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Mathematics; Type (biology); Pure mathematics; Biology","score_opus":0.005038533683521914,"score_gpt":0.21909896281544203,"score_spread":0.2140604291319201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406164286","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.914656,0.00031968314,0.05639281,0.00037530973,0.00014307507,0.000057960024,0.00029129558,0.00046913946,0.027294863],"genre_scores_gemma":[0.9800525,0.00012610189,0.013805402,0.00016932849,0.000035596768,0.000049419617,0.00032564922,0.0000829619,0.0053530117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994943,0.00008423819,0.000029609357,0.000110215726,0.00015882375,0.0001226793],"domain_scores_gemma":[0.9988181,0.00037241375,0.00018602378,0.00030926196,0.00014066555,0.00017355321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038480348,0.0003030985,0.00043052222,0.0009299775,0.0015784738,0.00089229376,0.0006531772,0.0005152649,0.005345142],"category_scores_gemma":[0.0018838411,0.00035842077,0.00085306854,0.0007187243,0.001381197,0.0014505804,0.001699553,0.0013258379,0.00037607335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007342796,0.00009973067,0.011135357,0.00020494458,0.00007991666,0.0015572222,0.00084723055,0.007993793,0.03998942,0.89682883,0.0050150366,0.03551413],"study_design_scores_gemma":[0.00011304293,0.00037720022,0.013726756,0.00006433152,0.00016395374,0.0036965467,0.0009858374,0.0637933,0.035347275,0.8575947,0.023993948,0.00014301116],"about_ca_topic_score_codex":0.0013353869,"about_ca_topic_score_gemma":0.002269431,"teacher_disagreement_score":0.005345142,"about_ca_system_score_codex":0.0007227248,"about_ca_system_score_gemma":0.0006239042,"threshold_uncertainty_score":0.017881274},"labels":[],"label_agreement":null},{"id":"W4406164298","doi":"10.61091/ars161-06","title":"Total Coloring and Efficient Domination Applications to Non-Cayley Non-Shreier Vertex-transitive Graphs","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Discrete mathematics; Cayley graph; Graph","score_opus":0.003972590158681082,"score_gpt":0.2046014828315814,"score_spread":0.2006288926729003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406164298","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3243326,0.0007581507,0.63528126,0.00074381655,0.00011882669,0.00016818792,0.00035652547,0.0007550294,0.03748557],"genre_scores_gemma":[0.8272476,0.0005567418,0.15817009,0.00022500753,0.00008082577,0.0001460012,0.0003978873,0.00019463514,0.012981166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921656,0.00031258658,0.00003291222,0.00014664562,0.00015985059,0.00013151272],"domain_scores_gemma":[0.9970276,0.0016607934,0.00017733165,0.00060747936,0.00027530358,0.00025155017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009146354,0.00066374574,0.0004640898,0.000750472,0.00086331286,0.0015666949,0.0011816534,0.00034314295,0.0034187345],"category_scores_gemma":[0.0029494967,0.000332448,0.00056315016,0.0014118495,0.0010660625,0.0015632996,0.0015804982,0.0009097539,0.00036169108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017776788,0.0001281411,0.001286073,0.00021975933,0.00005476532,0.0001909854,0.0005990988,0.10661549,0.015986204,0.7984268,0.004773338,0.07154157],"study_design_scores_gemma":[0.000061337065,0.00008747245,0.00049719977,0.000026773218,0.000040701398,0.00020459158,0.0001372414,0.41680804,0.007986412,0.5625881,0.011541121,0.000021050464],"about_ca_topic_score_codex":0.002311611,"about_ca_topic_score_gemma":0.0057199216,"teacher_disagreement_score":0.0034187345,"about_ca_system_score_codex":0.0016796379,"about_ca_system_score_gemma":0.0010681734,"threshold_uncertainty_score":0.012186706},"labels":[],"label_agreement":null},{"id":"W4406164335","doi":"10.61091/ars161-11","title":"Gallai Theorems Involving Minority and Majority Parameters","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics; Mathematical economics","score_opus":0.02760015309998062,"score_gpt":0.2868270254014063,"score_spread":0.2592268723014257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406164335","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13384503,0.0043361364,0.4920699,0.0052597006,0.0008046198,0.00023330956,0.00067948195,0.0005149034,0.36225685],"genre_scores_gemma":[0.9068386,0.001823202,0.0674087,0.0009908791,0.000579103,0.00034960482,0.00034928494,0.00018986597,0.0214707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996801,0.0007467007,0.00029350573,0.0005497035,0.0011244563,0.00048462496],"domain_scores_gemma":[0.9863494,0.0084969,0.0013324417,0.0019877441,0.0012260275,0.0006074337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005490725,0.0011236228,0.00092610146,0.0028559363,0.0029375523,0.006555036,0.0015383183,0.0021454194,0.0067758746],"category_scores_gemma":[0.01732767,0.0005077435,0.001853728,0.0012994566,0.006197215,0.01095721,0.00534575,0.0043329173,0.0018891474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017514167,0.0000046128835,0.00022476447,0.00003309309,0.0000073424817,0.000038804515,0.00014951166,0.0009672058,0.0002669722,0.9937397,0.0011777597,0.0033726234],"study_design_scores_gemma":[0.000007343761,0.000010949249,0.0002516733,0.000032119082,0.000013783492,0.00013531683,0.000116921256,0.0066311606,0.0022098399,0.98445857,0.0061020874,0.00003021582],"about_ca_topic_score_codex":0.0007138474,"about_ca_topic_score_gemma":0.0005567489,"teacher_disagreement_score":0.0067758746,"about_ca_system_score_codex":0.0026997547,"about_ca_system_score_gemma":0.0010056951,"threshold_uncertainty_score":0.029038072},"labels":[],"label_agreement":null},{"id":"W4406164349","doi":"10.61091/ars161-13","title":"On Fibonacci (p,r) -cubes","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Mathematics; Combinatorics; Arithmetic","score_opus":0.007820327461750742,"score_gpt":0.2719315758266857,"score_spread":0.26411124836493494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406164349","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15558216,0.008038556,0.61434174,0.0029373365,0.0012877078,0.00014882424,0.000850852,0.00038776555,0.21642505],"genre_scores_gemma":[0.7658795,0.0061663333,0.17970973,0.0024997038,0.0010991733,0.00040431565,0.0011982773,0.00023469524,0.04280825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989779,0.00034969317,0.00006715498,0.00017985904,0.00025728333,0.00016820116],"domain_scores_gemma":[0.99818736,0.0010983071,0.00015380753,0.0001621728,0.00030904985,0.00008920623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011567875,0.0006353499,0.00077157887,0.0015303092,0.0021516052,0.002326518,0.0008216575,0.0010723292,0.006821687],"category_scores_gemma":[0.0041253883,0.00040486554,0.001108397,0.0028729665,0.0029964237,0.0047934903,0.0015466462,0.0015099447,0.0013772394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012098851,0.00000283093,0.00007678262,0.000026007487,0.0000035166272,0.000093233604,0.00007298468,0.0015783887,0.00030890742,0.99257666,0.0010688491,0.004179603],"study_design_scores_gemma":[0.000005026521,0.000011319158,0.000086161104,0.00001669997,0.000003935344,0.00014630845,0.00004200583,0.005235259,0.00031345538,0.98505855,0.0090706,0.000010670861],"about_ca_topic_score_codex":0.002802567,"about_ca_topic_score_gemma":0.002043211,"teacher_disagreement_score":0.006821687,"about_ca_system_score_codex":0.0015413256,"about_ca_system_score_gemma":0.0007360784,"threshold_uncertainty_score":0.02282083},"labels":[],"label_agreement":null},{"id":"W4406164401","doi":"10.61091/ars161-02","title":"Generating Hypergraphs of Finite Groups","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Pure mathematics","score_opus":0.0065926494154069015,"score_gpt":0.1946719160706673,"score_spread":0.1880792666552604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406164401","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72669023,0.0012494347,0.21208626,0.001592071,0.00012512125,0.00011332616,0.00049344124,0.00025708298,0.0573931],"genre_scores_gemma":[0.9477834,0.00056537567,0.036728438,0.00022511407,0.00013559392,0.00008958109,0.00050465803,0.000054802134,0.0139131695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965143,0.00012077903,0.000012826775,0.00008221118,0.00006315168,0.00006955409],"domain_scores_gemma":[0.9990758,0.0004276585,0.000118099386,0.00012222663,0.00012570823,0.0001304729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036032664,0.00028816433,0.0002608424,0.0011495101,0.0007501774,0.0015655578,0.00044385687,0.00056547235,0.0034477846],"category_scores_gemma":[0.0013673408,0.00020148233,0.0004129435,0.0010489393,0.0015200308,0.0023417538,0.0009779163,0.00107697,0.0003752985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018651197,0.0000109392695,0.00058143033,0.00002981365,0.000004608001,0.00006213971,0.00032720744,0.0015043743,0.0017578535,0.9872508,0.0004905445,0.007961575],"study_design_scores_gemma":[0.00000964863,0.00001991059,0.00062073703,0.000020591322,0.000007774401,0.00013631239,0.00029760643,0.009244854,0.0021575661,0.97928077,0.0081926035,0.000011606061],"about_ca_topic_score_codex":0.00095456705,"about_ca_topic_score_gemma":0.0008441709,"teacher_disagreement_score":0.0034477846,"about_ca_system_score_codex":0.0010548905,"about_ca_system_score_gemma":0.00041018464,"threshold_uncertainty_score":0.011533916},"labels":[],"label_agreement":null},{"id":"W4406164433","doi":"10.61091/ars161-10","title":"3-Trees with Diameter 2","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.013178216316463988,"score_gpt":0.2714635989864607,"score_spread":0.25828538266999673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406164433","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48323557,0.003951001,0.3407571,0.002260338,0.0005257208,0.00031044416,0.0077186613,0.0013126059,0.15992856],"genre_scores_gemma":[0.8239591,0.002087427,0.13477589,0.0009186064,0.0002566577,0.0002740478,0.0042264536,0.0003396109,0.033162143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960774,0.00004319474,0.000027873597,0.00012031815,0.000102434846,0.00009842856],"domain_scores_gemma":[0.9986877,0.000533334,0.00024291249,0.0001688729,0.00018912237,0.00017807061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024181079,0.00040973423,0.0004653472,0.0008574304,0.0008444931,0.0016830147,0.0005737908,0.0010445527,0.0067791096],"category_scores_gemma":[0.0016103634,0.00045258153,0.0006166576,0.0010668936,0.00082319044,0.0018955753,0.0012181655,0.0010746323,0.0022047805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037503094,0.00008166099,0.0029353693,0.00046998658,0.000044947545,0.0008473792,0.0007146855,0.007884306,0.050508518,0.8621042,0.014716096,0.05931784],"study_design_scores_gemma":[0.00007562787,0.00014696247,0.005066423,0.00013157284,0.00006494769,0.003516221,0.00039923843,0.018912902,0.01785638,0.8192811,0.1344928,0.000055761833],"about_ca_topic_score_codex":0.0005476914,"about_ca_topic_score_gemma":0.0008325061,"teacher_disagreement_score":0.0067791096,"about_ca_system_score_codex":0.0005604837,"about_ca_system_score_gemma":0.00033383304,"threshold_uncertainty_score":0.022678375},"labels":[],"label_agreement":null},{"id":"W4406164450","doi":"10.61091/ars161-07","title":"A New Series of Affine Resolvable PBIB(4) Designs in Two Replicates","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Optimal Experimental Design Methods","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Indian Agricultural Research Institute; Indian Council of Agricultural Research","keywords":"Mathematics; Series (stratigraphy); Affine transformation; Combinatorics; Pure mathematics; Biology","score_opus":0.12324048761226183,"score_gpt":0.4414839682629218,"score_spread":0.31824348065066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406164450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012631506,0.00044226096,0.9832734,0.000078534504,0.00010013507,0.0006233439,0.00030987797,0.00027376774,0.0022670995],"genre_scores_gemma":[0.1489663,0.0007992142,0.83934736,0.00025613455,0.0001375248,0.004436094,0.00071329233,0.00011457581,0.005229502],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9851216,0.010086494,0.0006165441,0.0020223684,0.0017011416,0.00045184785],"domain_scores_gemma":[0.9890435,0.005049689,0.0017744885,0.0024200317,0.00123019,0.000482192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011917936,0.0016671672,0.0028800813,0.0013865347,0.0006581487,0.0013929424,0.004044219,0.0013543972,0.007483874],"category_scores_gemma":[0.016757246,0.0010775154,0.0019950194,0.0016627985,0.001561718,0.001527189,0.0014496559,0.0023382995,0.001367628],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0045402646,0.0008260751,0.0016872797,0.0018130954,0.0006801533,0.00016119862,0.0003254929,0.14790304,0.026420908,0.28491423,0.0043947767,0.5263335],"study_design_scores_gemma":[0.0040514716,0.012407114,0.003933328,0.00044908296,0.0008652929,0.0004786106,0.00010759156,0.6237229,0.038376402,0.25179875,0.06340452,0.00040485925],"about_ca_topic_score_codex":0.00064620544,"about_ca_topic_score_gemma":0.0008715592,"teacher_disagreement_score":0.011917936,"about_ca_system_score_codex":0.0013506621,"about_ca_system_score_gemma":0.0027980984,"threshold_uncertainty_score":0.06302881},"labels":[],"label_agreement":null},{"id":"W4406164824","doi":"10.61091/ars161-16","title":"The 2 -burning Number of a Graph","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Mount Allison University","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.01337650856485818,"score_gpt":0.30332214073398817,"score_spread":0.28994563216913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406164824","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5838604,0.0011662756,0.35461572,0.0050649345,0.0002017747,0.00022077166,0.000805239,0.0005477283,0.053517215],"genre_scores_gemma":[0.9356314,0.0005821637,0.046900578,0.000398731,0.00012392027,0.00019744283,0.0003702431,0.00017018494,0.015625445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998566,0.0005958516,0.000052724798,0.00033788808,0.00022499614,0.00022263225],"domain_scores_gemma":[0.9894075,0.0064854436,0.0012344908,0.0009374809,0.00044883165,0.0014862851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022117475,0.00092854444,0.0014095402,0.001331788,0.001966304,0.0032296602,0.0026459203,0.0025663697,0.010940521],"category_scores_gemma":[0.012753705,0.0009761875,0.0010253818,0.0010555318,0.003817679,0.007818833,0.0018867484,0.003330549,0.0011760169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003035263,0.00013232089,0.0013069956,0.00017150446,0.00003589174,0.00023666419,0.00060663855,0.0866115,0.0043524164,0.8950472,0.004212601,0.0069827056],"study_design_scores_gemma":[0.00008307032,0.000105155435,0.00041311487,0.0000484089,0.000021799842,0.0002608271,0.00018632963,0.32721883,0.0011616569,0.66749465,0.0029676908,0.00003841977],"about_ca_topic_score_codex":0.0014768639,"about_ca_topic_score_gemma":0.0012215001,"teacher_disagreement_score":0.010940521,"about_ca_system_score_codex":0.002333892,"about_ca_system_score_gemma":0.0010465049,"threshold_uncertainty_score":0.036599696},"labels":[],"label_agreement":null},{"id":"W4408736685","doi":"10.61091/ars162-09","title":"Conflict-free coloring games","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Mathematics; Mathematical economics","score_opus":0.024554731006287345,"score_gpt":0.2856816891758718,"score_spread":0.2611269581695844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408736685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08612234,0.0013926622,0.7500433,0.003869694,0.0006582668,0.0008915893,0.0009830116,0.0002837314,0.15575542],"genre_scores_gemma":[0.7958242,0.0016281115,0.15615205,0.0017659421,0.0004873001,0.0011645013,0.0009438238,0.00013787308,0.041896142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970824,0.0011751945,0.00013583252,0.00046802772,0.00057366793,0.00056485855],"domain_scores_gemma":[0.9961738,0.002461794,0.00023685682,0.00029094238,0.00039636783,0.00044012716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015960186,0.0015488192,0.0012255417,0.00072556286,0.0021068999,0.0031229462,0.0022664906,0.0019839457,0.0075430456],"category_scores_gemma":[0.0063046603,0.0004928373,0.0012097774,0.0011403537,0.0031652672,0.004068758,0.002596038,0.0032113225,0.0007700953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092053466,0.000073958494,0.00022510115,0.00007371901,0.000028991859,0.00006978697,0.00022038423,0.023455273,0.0005224501,0.960975,0.004155749,0.01010756],"study_design_scores_gemma":[0.00011265645,0.00006930233,0.0001545457,0.000032709104,0.000027516393,0.00010646192,0.00013366388,0.1306317,0.0005953048,0.8470516,0.021055633,0.000028931305],"about_ca_topic_score_codex":0.004706212,"about_ca_topic_score_gemma":0.0038473967,"teacher_disagreement_score":0.0075430456,"about_ca_system_score_codex":0.0033784616,"about_ca_system_score_gemma":0.0022220553,"threshold_uncertainty_score":0.025234044},"labels":[],"label_agreement":null},{"id":"W4408736690","doi":"10.61091/ars162-08","title":"Enumeration of rooted biloopless nonseparable planar near-triangulations","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Chongqing Municipal Education Commission; Chongqing University of Arts and Sciences; Chongqing University; National Natural Science Foundation of China","keywords":"Enumeration; Mathematics; Combinatorics; Planar; Computer science; Computer graphics (images)","score_opus":0.009915929746068594,"score_gpt":0.2551366332711311,"score_spread":0.24522070352506253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408736690","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5165452,0.0005028828,0.4488139,0.00028399564,0.000063587526,0.000088137516,0.00063780573,0.00050229277,0.032562297],"genre_scores_gemma":[0.8915412,0.0002942373,0.09931959,0.00006867372,0.000042047643,0.00008475432,0.0009849354,0.00011883942,0.00754578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921954,0.00014050778,0.000060756985,0.00010744664,0.00033747527,0.00013431408],"domain_scores_gemma":[0.99787724,0.0009722624,0.00025399507,0.00029340762,0.00039064387,0.00021249484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047295878,0.000272488,0.0004886169,0.001473254,0.0008959519,0.0012045703,0.001013996,0.000643662,0.007872579],"category_scores_gemma":[0.004003568,0.00032245403,0.000405096,0.0010381043,0.000956782,0.002658,0.0019842384,0.0009800545,0.00096254126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032908234,0.00006788745,0.003078517,0.0005128337,0.000037552523,0.0003799411,0.0005263422,0.023650695,0.02110452,0.8517944,0.0024888685,0.09602932],"study_design_scores_gemma":[0.000041251496,0.00018964906,0.0027111028,0.000115330695,0.00005728994,0.0012637803,0.0007648292,0.11750083,0.016526489,0.8449258,0.015853489,0.000050073893],"about_ca_topic_score_codex":0.0002495126,"about_ca_topic_score_gemma":0.00043129627,"teacher_disagreement_score":0.007872579,"about_ca_system_score_codex":0.00048113213,"about_ca_system_score_gemma":0.00027526755,"threshold_uncertainty_score":0.026336432},"labels":[],"label_agreement":null},{"id":"W4408736713","doi":"10.61091/ars162-05","title":"Outer independent double Roman domination in unicyclic and bicyclic graphs","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Platforms and Economics","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.010040203062692486,"score_gpt":0.21362789824436895,"score_spread":0.20358769518167646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408736713","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8807832,0.00106207,0.087743744,0.0002741315,0.00003554391,0.000051943356,0.00043661156,0.0001915945,0.029421147],"genre_scores_gemma":[0.9770676,0.00045438873,0.016643276,0.00011345903,0.00003577836,0.00004604041,0.00039263547,0.000060303344,0.0051865485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993899,0.00011588602,0.000036810678,0.00014887482,0.000138859,0.00016955212],"domain_scores_gemma":[0.9973924,0.0011811045,0.00050607196,0.00032523522,0.00028564825,0.00030956863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004785239,0.000537911,0.00051723473,0.0014379942,0.0007163474,0.001345009,0.00075576745,0.0003853857,0.0017306719],"category_scores_gemma":[0.00373313,0.00034266515,0.00038162572,0.0015176856,0.0013672633,0.0016461421,0.0012205156,0.00060508965,0.00025243836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010000372,0.00011446795,0.016438056,0.0006405568,0.00009553087,0.0011615026,0.0019076027,0.09727623,0.025978206,0.7317305,0.0056885844,0.117968656],"study_design_scores_gemma":[0.000109064895,0.00018937993,0.008953395,0.0001378394,0.000115283736,0.002386023,0.0006377021,0.35054326,0.013451557,0.59810823,0.02528419,0.0000839689],"about_ca_topic_score_codex":0.0019044626,"about_ca_topic_score_gemma":0.0026855948,"teacher_disagreement_score":0.0019044626,"about_ca_system_score_codex":0.0009422766,"about_ca_system_score_gemma":0.00037210912,"threshold_uncertainty_score":0.0068367124},"labels":[],"label_agreement":null},{"id":"W4408736722","doi":"10.61091/ars162-04","title":"Some results on 4- remainder cordial labeling of graphs","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Remainder; Mathematics; Combinatorics; Arithmetic","score_opus":0.012551693763359002,"score_gpt":0.24536131392617083,"score_spread":0.23280962016281184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408736722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24447556,0.0026500362,0.49724337,0.0018587696,0.00059050816,0.00021788005,0.0015693768,0.002625651,0.24876887],"genre_scores_gemma":[0.606701,0.0032660605,0.28164977,0.0018103133,0.000964333,0.00037245973,0.0044240835,0.0013081845,0.099503785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991635,0.00016910456,0.00007059371,0.00021930387,0.00019896752,0.00017853917],"domain_scores_gemma":[0.99825007,0.0006392044,0.00024376147,0.00042878196,0.0002729648,0.00016520693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009354478,0.00086827506,0.00064579176,0.0017334719,0.0016520481,0.0018782617,0.0013868079,0.0010141506,0.012146054],"category_scores_gemma":[0.0027267935,0.0005346416,0.0012559629,0.0024174603,0.0015181864,0.0033298892,0.0014172777,0.0019340971,0.0028063513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029834796,0.00010339579,0.001008512,0.00036163474,0.00002616043,0.00033306074,0.0008795819,0.017399354,0.009671476,0.86223674,0.010348368,0.09733344],"study_design_scores_gemma":[0.0000346139,0.00013987502,0.0010982397,0.00009913138,0.000050679908,0.00037707377,0.00022292504,0.05225847,0.008104998,0.88916343,0.048397187,0.000053321794],"about_ca_topic_score_codex":0.0037855334,"about_ca_topic_score_gemma":0.003308985,"teacher_disagreement_score":0.012146054,"about_ca_system_score_codex":0.0026985698,"about_ca_system_score_gemma":0.00070314406,"threshold_uncertainty_score":0.040632606},"labels":[],"label_agreement":null},{"id":"W4408736800","doi":"10.61091/ars162-06","title":"New families of tripartite graphs with local antimagic chromatic number 3","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics","score_opus":0.005649431403261357,"score_gpt":0.2232497043105079,"score_spread":0.21760027290724654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408736800","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7776154,0.0006573659,0.1802554,0.0011268051,0.0001265615,0.000122085,0.00054733903,0.0009936214,0.038555466],"genre_scores_gemma":[0.94476455,0.00030390001,0.045173287,0.00026831462,0.00006145324,0.00021662965,0.0005956313,0.00017350233,0.008442738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992768,0.00018536932,0.000034626548,0.00020019496,0.00016825405,0.0001347539],"domain_scores_gemma":[0.9968532,0.0014902506,0.00038688714,0.00043454528,0.00034568895,0.0004894965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057549466,0.00044122792,0.0004748321,0.0017946261,0.0022957635,0.0018125157,0.0016409367,0.0011539755,0.0055052526],"category_scores_gemma":[0.0028927398,0.00075473066,0.0009421589,0.0012600259,0.0015428123,0.0022305027,0.0017761084,0.0017358796,0.0003683873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021428429,0.00011829276,0.0026291204,0.0001990458,0.00007648291,0.00094746135,0.0012864084,0.013578574,0.020054441,0.9365479,0.005747825,0.018600186],"study_design_scores_gemma":[0.00017107587,0.0002778279,0.0040178243,0.00010661312,0.00016418427,0.0039403155,0.0012757933,0.15164268,0.014983316,0.7884632,0.034816302,0.00014090701],"about_ca_topic_score_codex":0.0010320324,"about_ca_topic_score_gemma":0.0018801705,"teacher_disagreement_score":0.0055052526,"about_ca_system_score_codex":0.0022378294,"about_ca_system_score_gemma":0.00046840886,"threshold_uncertainty_score":0.018416941},"labels":[],"label_agreement":null},{"id":"W4408736811","doi":"10.61091/ars162-01","title":"Acyclic total coloring of graphs with large girths","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Combinatorics","score_opus":0.005903342176377706,"score_gpt":0.22022126215451493,"score_spread":0.21431791997813723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408736811","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79229254,0.00080941315,0.1689539,0.00071651855,0.00006836927,0.000066873145,0.0008954675,0.000550764,0.035646137],"genre_scores_gemma":[0.9548394,0.000574491,0.036332842,0.0002067017,0.00005488459,0.00007660153,0.0009076203,0.00011650547,0.0068909014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993887,0.00016082918,0.000026659065,0.00014815487,0.00010121434,0.00017430459],"domain_scores_gemma":[0.99604625,0.0020885367,0.00040119188,0.0006500706,0.00039996539,0.00041396377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006872382,0.0004402985,0.00032218118,0.0011921903,0.0011045476,0.0013088974,0.00064670824,0.00035437217,0.0026099503],"category_scores_gemma":[0.0030360883,0.00045410485,0.0004710282,0.0014027387,0.0012753346,0.0014048317,0.001363702,0.0006783395,0.0002405284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038491923,0.00008422387,0.008803699,0.0003101189,0.00007108206,0.00032500364,0.00055656664,0.072484955,0.023073062,0.84582245,0.008499876,0.039584216],"study_design_scores_gemma":[0.00009166008,0.00009578614,0.0044911387,0.00006150586,0.00008837244,0.00077597506,0.00036723714,0.19159383,0.012059521,0.7689657,0.021363975,0.00004529785],"about_ca_topic_score_codex":0.0031450104,"about_ca_topic_score_gemma":0.0057860063,"teacher_disagreement_score":0.0031450104,"about_ca_system_score_codex":0.0016237893,"about_ca_system_score_gemma":0.00089557294,"threshold_uncertainty_score":0.011781514},"labels":[],"label_agreement":null},{"id":"W4408736815","doi":"10.61091/ars162-07","title":"On total coloring of 1-planar graphs without 4-cycles","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Total coloring; Planar graph; Combinatorics; Edge coloring; Planar; Graph; Computer science; Graph power; Computer graphics (images); Line graph","score_opus":0.013061476965901698,"score_gpt":0.2873518288260597,"score_spread":0.274290351860158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408736815","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7536205,0.0016772621,0.17013574,0.0026171543,0.00037143324,0.00013670581,0.0013781409,0.001058397,0.06900475],"genre_scores_gemma":[0.9561351,0.0015477256,0.031174574,0.0009204241,0.00025926792,0.00009030283,0.0017014828,0.00028872193,0.007882287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991265,0.0002262209,0.000033380886,0.0002389483,0.00016453763,0.00021056508],"domain_scores_gemma":[0.99303377,0.003979126,0.00071330596,0.0011337165,0.00072379515,0.00041630823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008813294,0.00092378503,0.0006617088,0.0011279817,0.0014099195,0.0018981817,0.0013043886,0.0007844877,0.0066641443],"category_scores_gemma":[0.004591093,0.00055611884,0.0009252346,0.0018625886,0.0017700781,0.0034795399,0.0015050676,0.0013360478,0.00080616656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009755805,0.00025448238,0.010740293,0.0010670491,0.00018098827,0.0010878587,0.0014767656,0.08213664,0.019557852,0.78068703,0.024797568,0.077037916],"study_design_scores_gemma":[0.0001441947,0.00016512103,0.002986311,0.00012699982,0.00012001876,0.00078420294,0.0008075753,0.07741661,0.0077443393,0.8945036,0.015137685,0.00006340826],"about_ca_topic_score_codex":0.0029058687,"about_ca_topic_score_gemma":0.0034814319,"teacher_disagreement_score":0.0066641443,"about_ca_system_score_codex":0.001038451,"about_ca_system_score_gemma":0.0006107361,"threshold_uncertainty_score":0.022293806},"labels":[],"label_agreement":null},{"id":"W4408736823","doi":"10.61091/ars162-02","title":"The degree associated edge reconstruction number of bidegreed graphs is at most four","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Board for Higher Mathematics","keywords":"Mathematics; Degree (music); Enhanced Data Rates for GSM Evolution; Statistics; Combinatorics; Artificial intelligence; Computer science","score_opus":0.023821742122332495,"score_gpt":0.24497500410164152,"score_spread":0.22115326197930904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408736823","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92152643,0.00032279937,0.058131423,0.0004482288,0.00003745133,0.00003696731,0.0003489305,0.0001518772,0.018995848],"genre_scores_gemma":[0.9728371,0.00034034968,0.023036126,0.00010820918,0.00001761653,0.000033894048,0.000569015,0.00003809466,0.003019541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956197,0.00006707713,0.000023144237,0.0001314017,0.000095056756,0.00012134419],"domain_scores_gemma":[0.9976992,0.0012098915,0.00029726283,0.00038330755,0.00021243464,0.0001980135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040960356,0.0003252029,0.00027469473,0.000480229,0.00067898654,0.0010894592,0.0008527608,0.00032783987,0.0021380384],"category_scores_gemma":[0.002614813,0.0002810918,0.0003359927,0.00060867926,0.00089870323,0.0015377377,0.0010199517,0.00094803853,0.00041904626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012841894,0.00037897305,0.041937433,0.000747484,0.00010986108,0.0009169569,0.0011778985,0.06789943,0.12792489,0.5809206,0.008549322,0.16815297],"study_design_scores_gemma":[0.00018061894,0.0006632932,0.03455615,0.00010194659,0.00023380738,0.0045102574,0.0010032409,0.30395663,0.12863757,0.48963386,0.036381934,0.00014063157],"about_ca_topic_score_codex":0.0008996843,"about_ca_topic_score_gemma":0.0015222541,"teacher_disagreement_score":0.0021380384,"about_ca_system_score_codex":0.00062571093,"about_ca_system_score_gemma":0.00037555548,"threshold_uncertainty_score":0.007152498},"labels":[],"label_agreement":null},{"id":"W4408736835","doi":"10.61091/ars162-03","title":"On First Zagreb index, \\({\\tau}\\)-path-coverable and \\({\\tau}\\)-edge-Hamiltonian graphs","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Path (computing); Hamiltonian (control theory); Enhanced Data Rates for GSM Evolution; Hamiltonian path; Combinatorics; Graph; Computer science; Computer network; Telecommunications; Mathematical optimization","score_opus":0.011392266814499862,"score_gpt":0.25933135012198927,"score_spread":0.2479390833074894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408736835","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84587437,0.002584129,0.08828653,0.0014429151,0.00013998408,0.000054851236,0.0013155449,0.00045360206,0.059848163],"genre_scores_gemma":[0.965971,0.0011451317,0.024339912,0.00036442984,0.00020440183,0.00006815841,0.0013993718,0.0002548183,0.006252767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922633,0.00013183383,0.00002693318,0.00023433528,0.00014021453,0.00024034166],"domain_scores_gemma":[0.99404305,0.0037406932,0.000520868,0.00070750475,0.00023398592,0.0007537737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086166797,0.0012522527,0.0013105546,0.0015113299,0.0020095436,0.0032176203,0.0017801363,0.0010597021,0.0051868777],"category_scores_gemma":[0.006066299,0.0005591308,0.0008475423,0.0014184383,0.0021332896,0.0034401615,0.0017519013,0.0026437505,0.000654906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012695385,0.00022464104,0.010039152,0.0006770149,0.00010248775,0.00058246555,0.0014143329,0.04896672,0.021162523,0.84706366,0.012062116,0.056435358],"study_design_scores_gemma":[0.00009065393,0.00014934168,0.005550206,0.00012329227,0.00011082594,0.0006926265,0.0003249197,0.08007298,0.0068233167,0.8976766,0.008330925,0.000054318516],"about_ca_topic_score_codex":0.002764263,"about_ca_topic_score_gemma":0.005389821,"teacher_disagreement_score":0.0051868777,"about_ca_system_score_codex":0.002024838,"about_ca_system_score_gemma":0.00096672255,"threshold_uncertainty_score":0.017351866},"labels":[],"label_agreement":null},{"id":"W4408968070","doi":"10.61091/ars162-14","title":"Type B set partitions, an analogue of restricted growth functions","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Set (abstract data type); Type (biology); Combinatorics; Arithmetic; Computer science; Programming language; Biology","score_opus":0.032223556197832064,"score_gpt":0.32529171378637994,"score_spread":0.2930681575885479,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408968070","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6975806,0.0008985236,0.24100974,0.0010020081,0.0002202471,0.0000773143,0.00040236537,0.00035432848,0.05845491],"genre_scores_gemma":[0.96686625,0.00036450502,0.020693658,0.00024665712,0.0002037608,0.00011474244,0.00030001873,0.00018219385,0.011028156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992211,0.00021234801,0.000035744983,0.00014889996,0.000229367,0.0001524659],"domain_scores_gemma":[0.99698156,0.0015237181,0.0004129091,0.00033641863,0.0004070961,0.0003383879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000924912,0.00038449618,0.00044290398,0.0015182022,0.00094624364,0.0021347436,0.0008054187,0.00077024364,0.004536937],"category_scores_gemma":[0.0052936478,0.0002860997,0.00077649165,0.0009929668,0.0019071248,0.0027573563,0.0009221323,0.0016343109,0.0006210029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030212635,0.000017309645,0.0010150325,0.000030411868,0.0000057997077,0.00012067847,0.00019072604,0.0022231536,0.002156937,0.9886175,0.00077037734,0.004821892],"study_design_scores_gemma":[0.000024159464,0.00008014976,0.0020639023,0.000037927573,0.000012158816,0.0010063564,0.00029235813,0.05336747,0.003930192,0.9319517,0.0071880873,0.00004560241],"about_ca_topic_score_codex":0.00073414005,"about_ca_topic_score_gemma":0.0005221795,"teacher_disagreement_score":0.004536937,"about_ca_system_score_codex":0.0010014685,"about_ca_system_score_gemma":0.00045665837,"threshold_uncertainty_score":0.015177548},"labels":[],"label_agreement":null},{"id":"W4408968077","doi":"10.61091/ars162-13","title":"The strict neighbor-distinguishing index of simple graphs with maximum degree five","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Simple (philosophy); Degree (music); Index (typography); Combinatorics; Statistics; Computer science; Physics","score_opus":0.011707687898848674,"score_gpt":0.2315710755330517,"score_spread":0.21986338763420302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408968077","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91659784,0.00048159287,0.038499437,0.00050711934,0.000041906507,0.00003169067,0.0003842861,0.00012511414,0.043330967],"genre_scores_gemma":[0.98389554,0.00023531691,0.012749916,0.00010188557,0.000030584768,0.000022580978,0.00040677018,0.00002403453,0.0025333005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948287,0.00008807913,0.00003893788,0.00013348294,0.00011908834,0.00013745247],"domain_scores_gemma":[0.9974496,0.0013503388,0.00044543121,0.00025878876,0.00017610016,0.0003197871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046730085,0.00027918193,0.0003076759,0.0008937172,0.00095636415,0.0014726227,0.00056190224,0.00033110875,0.0020090176],"category_scores_gemma":[0.0022053397,0.00031079416,0.0003150597,0.0009716683,0.0012532782,0.0018743728,0.0012666936,0.0007182772,0.00027031184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000682849,0.00017187666,0.025079362,0.00036080636,0.000053887285,0.00041813118,0.0016204213,0.014875489,0.031786866,0.8679987,0.0055904267,0.051361155],"study_design_scores_gemma":[0.00011168361,0.00023881455,0.01565943,0.00007970903,0.00010525668,0.0012666973,0.00095885573,0.073568836,0.027864015,0.85728455,0.022791259,0.00007082204],"about_ca_topic_score_codex":0.0011098365,"about_ca_topic_score_gemma":0.0018494794,"teacher_disagreement_score":0.0020090176,"about_ca_system_score_codex":0.0011488616,"about_ca_system_score_gemma":0.00043790136,"threshold_uncertainty_score":0.00833565},"labels":[],"label_agreement":null},{"id":"W4408968195","doi":"10.61091/ars162-12","title":"Total coloring of regular graphs of girth = degree + 1","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Girth (graph theory); Degree (music); Edge coloring; Combinatorics; Discrete mathematics; Graph; Physics; Graph power; Line graph","score_opus":0.013634592031019396,"score_gpt":0.22868228073811248,"score_spread":0.21504768870709307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408968195","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87323284,0.00023614231,0.09832956,0.00012486169,0.000023761531,0.000040276165,0.0005540223,0.00041872056,0.027039973],"genre_scores_gemma":[0.95810324,0.00024551657,0.033022024,0.000060268358,0.000011590852,0.00003809123,0.00096848124,0.00009685291,0.0074538873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977773,0.000045674948,0.000008359937,0.000050859613,0.000044589367,0.00007283553],"domain_scores_gemma":[0.99945587,0.00017694423,0.00007668356,0.00015431203,0.000067649315,0.00006846646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016330378,0.00027724134,0.0001931115,0.0005691514,0.00046843995,0.0007416759,0.00034972205,0.00015142943,0.0020854997],"category_scores_gemma":[0.0006684029,0.00023796721,0.00035488518,0.0007480847,0.0005573916,0.0005098286,0.00055604195,0.00025405778,0.0002800785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006091909,0.00012047707,0.009876543,0.00040320895,0.00009229047,0.0005485681,0.00077460683,0.16193733,0.119299,0.57631,0.0059214737,0.12410738],"study_design_scores_gemma":[0.00012143186,0.00045060695,0.0096706655,0.00006215633,0.00013960736,0.0013918522,0.00057201413,0.22446986,0.09569009,0.6277164,0.039662566,0.000052683117],"about_ca_topic_score_codex":0.0018996585,"about_ca_topic_score_gemma":0.0040706075,"teacher_disagreement_score":0.0020854997,"about_ca_system_score_codex":0.0006250503,"about_ca_system_score_gemma":0.0004167999,"threshold_uncertainty_score":0.0069767237},"labels":[],"label_agreement":null},{"id":"W4408968267","doi":"10.61091/ars162-11","title":"Counting nodes in Smolyak grids","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.008651257426982471,"score_gpt":0.24075948327289914,"score_spread":0.23210822584591667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408968267","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12087166,0.0002591408,0.86653006,0.00024371177,0.00008594176,0.00004220987,0.0002197364,0.00033805644,0.011409488],"genre_scores_gemma":[0.72353274,0.00040530914,0.26571012,0.00015028288,0.00011819509,0.0001902203,0.00042485417,0.00033736762,0.009130966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990528,0.00024699426,0.000074896976,0.00014637623,0.0003408056,0.00013807333],"domain_scores_gemma":[0.9968323,0.0017294451,0.00024823516,0.00052647095,0.0005023358,0.00016122973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014202528,0.00037305904,0.0006969091,0.0018114055,0.0007050709,0.0015194939,0.0016030105,0.0007516125,0.0038083491],"category_scores_gemma":[0.007260413,0.00035153827,0.00060200517,0.0010997117,0.001998016,0.0042256685,0.001648319,0.0015604345,0.0008666261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042700634,0.000013207379,0.00076174294,0.00004935795,0.0000062542545,0.000050477145,0.00011221809,0.010864121,0.0021852646,0.973459,0.0007207987,0.0117347445],"study_design_scores_gemma":[0.0000135646005,0.000025098509,0.00031951044,0.000025267464,0.000006609389,0.000057651385,0.000045189256,0.16094872,0.0032242772,0.83295184,0.0023645207,0.00001776717],"about_ca_topic_score_codex":0.00089197664,"about_ca_topic_score_gemma":0.0011979726,"teacher_disagreement_score":0.0038083491,"about_ca_system_score_codex":0.0007857467,"about_ca_system_score_gemma":0.00048314044,"threshold_uncertainty_score":0.012740195},"labels":[],"label_agreement":null},{"id":"W4408968286","doi":"10.61091/ars162-10","title":"Chemical applicability of GQ and QG indices of a graph and their bounds","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.011899939445502987,"score_gpt":0.2731626614923572,"score_spread":0.2612627220468542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408968286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37056234,0.009029262,0.5252357,0.0020824934,0.00038657026,0.000093595074,0.000720696,0.00028593477,0.091603376],"genre_scores_gemma":[0.94603014,0.0024128917,0.048772417,0.00023330834,0.00033188149,0.00012539329,0.0002565036,0.00007899673,0.0017583825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880564,0.0003986947,0.00006190898,0.00029739473,0.00031213014,0.00012433808],"domain_scores_gemma":[0.99415416,0.0037596256,0.0007581941,0.0006067528,0.00049498084,0.00022624411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019489827,0.0005432304,0.00037933394,0.0037649234,0.0007841233,0.0016336062,0.0008746944,0.00074999686,0.0019038055],"category_scores_gemma":[0.008997721,0.00021153089,0.0004607306,0.0015821228,0.0032848045,0.0041475827,0.0014645724,0.0014200893,0.0003312862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032045096,0.000021972935,0.0018548572,0.00012622346,0.000013638974,0.000054933782,0.00016595416,0.016482335,0.0037771838,0.9622607,0.000582452,0.014627649],"study_design_scores_gemma":[0.000006143842,0.00005931988,0.001681736,0.00004950551,0.00001646327,0.00020461134,0.000120648416,0.069776736,0.0030201017,0.9195148,0.0055211065,0.000028957851],"about_ca_topic_score_codex":0.00060856726,"about_ca_topic_score_gemma":0.00043257995,"teacher_disagreement_score":0.0037649234,"about_ca_system_score_codex":0.0011705088,"about_ca_system_score_gemma":0.0004778197,"threshold_uncertainty_score":0.010307312},"labels":[],"label_agreement":null},{"id":"W4408968553","doi":"10.61091/ars162-15","title":"A short proof for the polynomiality of the stretched littlewood-Richardson coefficients","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Nonlinear Waves and Solitons","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Statistics","score_opus":0.011078616343003314,"score_gpt":0.277647435479172,"score_spread":0.26656881913616864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408968553","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033188645,0.019151885,0.47433507,0.042268492,0.023220975,0.0003835498,0.0037096776,0.0023176027,0.40142405],"genre_scores_gemma":[0.5594259,0.0181002,0.21605712,0.015894556,0.017423358,0.0009804063,0.0027103452,0.0022885709,0.16711949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991979,0.00013073321,0.000057856763,0.00014703273,0.00036692078,0.000099562116],"domain_scores_gemma":[0.9982096,0.00083434896,0.00013951352,0.00015305592,0.00046733426,0.00019620146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017076886,0.0023121224,0.00087087846,0.0020815837,0.001688387,0.0020470726,0.0010386108,0.0012825277,0.029724544],"category_scores_gemma":[0.004915023,0.00056839053,0.0018412618,0.0019113645,0.0030375621,0.0038260461,0.0032976905,0.005412465,0.0056793033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006525043,0.000060931783,0.00032043716,0.0003864134,0.00003846142,0.0005877904,0.00029391397,0.0009834759,0.004766895,0.9177319,0.043589532,0.031174941],"study_design_scores_gemma":[0.000035734778,0.00009988928,0.0013644844,0.00010709975,0.000040519655,0.0005232786,0.00010167773,0.0034533062,0.002858319,0.8986887,0.09266319,0.00006391987],"about_ca_topic_score_codex":0.0018425961,"about_ca_topic_score_gemma":0.0015010878,"teacher_disagreement_score":0.029724544,"about_ca_system_score_codex":0.001652251,"about_ca_system_score_gemma":0.0009264872,"threshold_uncertainty_score":0.09943849},"labels":[],"label_agreement":null},{"id":"W4411720705","doi":"10.61091/ars163-01","title":"Monophonic and edge monophonic numbers of corona product graphs","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Corona (planetary geology); Enhanced Data Rates for GSM Evolution; Product (mathematics); Combinatorics; Telecommunications; Computer science; Geometry; Physics","score_opus":0.005726198067973053,"score_gpt":0.2221859811168071,"score_spread":0.21645978304883404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411720705","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7013442,0.00062691903,0.15580985,0.000554989,0.00022255554,0.00010150879,0.001789428,0.0007572335,0.13879332],"genre_scores_gemma":[0.9379207,0.00029546366,0.028224405,0.0001883719,0.00018611623,0.00012670956,0.0010696704,0.00023143063,0.031757157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996228,0.000046620047,0.000023786839,0.00012335362,0.00009653388,0.000086786036],"domain_scores_gemma":[0.9986688,0.000506287,0.00020515244,0.00012902833,0.00019570853,0.00029502812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029926034,0.00035188836,0.00027303124,0.0013550345,0.000638494,0.0014175267,0.0005942029,0.00042171942,0.01507216],"category_scores_gemma":[0.001806864,0.0002578279,0.00035258968,0.000869319,0.00090420333,0.0020722481,0.00089431053,0.0006569711,0.0014952965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003115217,0.00008285017,0.0023063736,0.00018414152,0.000020663454,0.00031449663,0.0007790907,0.0072264066,0.01212144,0.872698,0.012176316,0.09177876],"study_design_scores_gemma":[0.000057094927,0.00019805184,0.006353753,0.000070921946,0.00003805838,0.0009159589,0.00041234365,0.04712806,0.006752395,0.8983271,0.039683267,0.00006316489],"about_ca_topic_score_codex":0.0010017301,"about_ca_topic_score_gemma":0.0013665733,"teacher_disagreement_score":0.01507216,"about_ca_system_score_codex":0.00072629785,"about_ca_system_score_gemma":0.00029232833,"threshold_uncertainty_score":0.050421417},"labels":[],"label_agreement":null},{"id":"W4411720715","doi":"10.61091/ars163-07","title":"Construction of magic squares and partially balanced incomplete block designs","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Magic square; Mathematics; Block (permutation group theory); MAGIC (telescope); Combinatorics; Arithmetic","score_opus":0.007934536213604302,"score_gpt":0.20574074004573753,"score_spread":0.19780620383213324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411720715","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042371344,0.00024546683,0.94239634,0.0001097538,0.00006432243,0.00008874598,0.00009221937,0.00019978819,0.014432081],"genre_scores_gemma":[0.41978657,0.0004982653,0.569332,0.00012068133,0.000041139872,0.00026545362,0.0002494177,0.000081788865,0.009624754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993113,0.00025067013,0.00004975289,0.00010320203,0.00020724599,0.00007776826],"domain_scores_gemma":[0.9992125,0.00023776019,0.00013217305,0.00019475409,0.00015956437,0.00006310216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000592669,0.00042714624,0.00033442202,0.00060792116,0.0005395663,0.0006672735,0.00047368673,0.00038645978,0.0032297738],"category_scores_gemma":[0.0015548903,0.00031254577,0.00040989928,0.00067880255,0.0008531737,0.0010335944,0.0011750909,0.0007700976,0.00068007136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016786162,0.00003810928,0.0006387848,0.00022120112,0.00003424986,0.00021409124,0.00028290082,0.020118453,0.051273767,0.8044027,0.0014421429,0.121165775],"study_design_scores_gemma":[0.00017588954,0.0007550666,0.0010615921,0.00015222201,0.000083211366,0.0011570572,0.00026328236,0.1836791,0.12441389,0.5983377,0.08980858,0.00011234011],"about_ca_topic_score_codex":0.0002807153,"about_ca_topic_score_gemma":0.00047884535,"teacher_disagreement_score":0.0032297738,"about_ca_system_score_codex":0.00030744454,"about_ca_system_score_gemma":0.00053001975,"threshold_uncertainty_score":0.010804653},"labels":[],"label_agreement":null},{"id":"W4411720721","doi":"10.61091/ars163-06","title":"Coloring of graphs with cost-functions whose marginal costs decrease","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Marginal cost; Combinatorics; Microeconomics; Economics","score_opus":0.012082443639475188,"score_gpt":0.2749637507143706,"score_spread":0.26288130707489543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411720721","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42081317,0.00090734224,0.53806984,0.0023789697,0.00017445085,0.000261862,0.0014078525,0.0009009078,0.035085477],"genre_scores_gemma":[0.8620816,0.00077766634,0.1179753,0.00033036812,0.00014752393,0.00027029307,0.0008070187,0.00053715915,0.017073117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989039,0.0003425305,0.000034457444,0.0002350337,0.0001569064,0.00032714425],"domain_scores_gemma":[0.9928012,0.004350811,0.00077096425,0.00094757,0.00054744055,0.0005820449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016449756,0.0016344835,0.0012011589,0.0009692915,0.000798381,0.0023614538,0.0022422748,0.0013223069,0.010157766],"category_scores_gemma":[0.008405156,0.00059283705,0.0009477142,0.0021730494,0.001303212,0.004191395,0.0008906837,0.0017601136,0.00085773075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008455194,0.0003886877,0.003773304,0.0005039879,0.00013097303,0.00029416342,0.00026351365,0.53736216,0.010896276,0.36783487,0.012422466,0.06528405],"study_design_scores_gemma":[0.000048807713,0.000102140264,0.0013571684,0.00003312747,0.00006276838,0.0001716813,0.0000853378,0.779366,0.003607155,0.21042635,0.0047108447,0.000028549903],"about_ca_topic_score_codex":0.0034518614,"about_ca_topic_score_gemma":0.0042565204,"teacher_disagreement_score":0.010157766,"about_ca_system_score_codex":0.003523705,"about_ca_system_score_gemma":0.0016115743,"threshold_uncertainty_score":0.033981085},"labels":[],"label_agreement":null},{"id":"W4411720731","doi":"10.61091/ars163-04","title":"Bounds on inverse sum indeg index of graph operations","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Inverse; Index (typography); Graph; Combinatorics; Computer science; Geometry","score_opus":0.010714163844504186,"score_gpt":0.24102494779738665,"score_spread":0.23031078395288246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411720731","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11909033,0.004980598,0.5822532,0.0037541015,0.0012781295,0.00029410326,0.003944724,0.004484268,0.27992046],"genre_scores_gemma":[0.7311247,0.0040709823,0.17741615,0.0021872493,0.0027389782,0.0009444286,0.0058070556,0.004375383,0.0713351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950454,0.00068563106,0.00027146668,0.0010393261,0.0020427199,0.000915432],"domain_scores_gemma":[0.98594993,0.00810853,0.0007050836,0.002594652,0.0016069422,0.0010348655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032823216,0.0024344085,0.0018822872,0.0056001656,0.002012084,0.0067539597,0.0042839935,0.0015471757,0.022547988],"category_scores_gemma":[0.019309197,0.0009089971,0.001957328,0.0053316588,0.0034902738,0.018581111,0.0063599595,0.006397216,0.0067625567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006075313,0.00023596284,0.001525895,0.00045421696,0.000058511552,0.00021771548,0.0005710969,0.012337174,0.0029522416,0.8515461,0.020903416,0.108590156],"study_design_scores_gemma":[0.000038018152,0.000099856414,0.000610767,0.0000840978,0.00006519543,0.0002709044,0.00007281078,0.045872524,0.003531986,0.93186927,0.01743074,0.000053853702],"about_ca_topic_score_codex":0.0014343146,"about_ca_topic_score_gemma":0.0018447865,"teacher_disagreement_score":0.022547988,"about_ca_system_score_codex":0.0038958404,"about_ca_system_score_gemma":0.0016340106,"threshold_uncertainty_score":0.07543051},"labels":[],"label_agreement":null},{"id":"W4411720738","doi":"10.61091/ars163-08","title":"Type I and type II codes over the ring \\({\\mathbb F}_2+u{\\mathbb F}_2+u^2{\\mathbb F}_2+u^3{\\mathbb F}_2\\)","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Type (biology); Combinatorics; Ring (chemistry); Chemistry; Geology","score_opus":0.009220630435054828,"score_gpt":0.24031467567472292,"score_spread":0.2310940452396681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411720738","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85196584,0.0006170848,0.0636056,0.0007391302,0.00032292824,0.000092338465,0.0008858124,0.00027269428,0.081498556],"genre_scores_gemma":[0.96531415,0.00034074357,0.016954515,0.00017554351,0.00015734238,0.00007514811,0.00039516206,0.00012171423,0.016465802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993285,0.00009349865,0.000036230012,0.0001298816,0.00018031828,0.00023161076],"domain_scores_gemma":[0.99878985,0.00022971077,0.0003669327,0.00019688475,0.00019300025,0.0002236147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034072596,0.00051546487,0.0002846805,0.0010384322,0.0007743329,0.0014954994,0.00047234105,0.0006315789,0.0059597096],"category_scores_gemma":[0.0016370198,0.00019164881,0.00045018533,0.00067043037,0.0014433484,0.0014438137,0.0010711643,0.0008987859,0.00078293425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035253845,0.00008431911,0.0025702883,0.000092882736,0.000016899661,0.0003064191,0.00035957116,0.0052516377,0.01060727,0.952515,0.0025778087,0.025265187],"study_design_scores_gemma":[0.00010177075,0.00034034895,0.0034838154,0.000116165895,0.000052754935,0.0010900487,0.00059942104,0.042417455,0.032256145,0.89822924,0.021216612,0.00009614954],"about_ca_topic_score_codex":0.00058678805,"about_ca_topic_score_gemma":0.0006359842,"teacher_disagreement_score":0.0059597096,"about_ca_system_score_codex":0.00080612086,"about_ca_system_score_gemma":0.0006781029,"threshold_uncertainty_score":0.019937277},"labels":[],"label_agreement":null},{"id":"W4411720742","doi":"10.61091/ars163-03","title":"Eternal distance-2 domination in trees","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics","score_opus":0.010530093153499303,"score_gpt":0.29029416328090896,"score_spread":0.27976407012740967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411720742","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5785876,0.0010583742,0.40308362,0.0009541401,0.00006274317,0.000100134785,0.0006514158,0.00022431683,0.015277653],"genre_scores_gemma":[0.9222788,0.0005527443,0.072230995,0.00016102336,0.00006591693,0.00007677641,0.00042452256,0.000058656144,0.0041504917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921954,0.00019532633,0.00004271332,0.00019895096,0.0001503519,0.00019308567],"domain_scores_gemma":[0.9955668,0.0029468352,0.00044875266,0.00044204446,0.00031434977,0.0002811985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078842364,0.00033273685,0.00056210416,0.0008806234,0.0011557643,0.0014399684,0.0010923102,0.00065108977,0.0020913589],"category_scores_gemma":[0.004911708,0.00023208813,0.0006042277,0.0012895744,0.0009734988,0.0028382393,0.0013283133,0.0009149527,0.00025957567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009033441,0.00025228158,0.013125784,0.0005536089,0.00013792262,0.0010094354,0.0016416991,0.31392846,0.0528658,0.5152854,0.007026423,0.09326987],"study_design_scores_gemma":[0.000060421316,0.00016061631,0.0033304114,0.00005331166,0.00005495425,0.0014994886,0.00047958264,0.5689076,0.014106369,0.3955502,0.015752431,0.000044713717],"about_ca_topic_score_codex":0.0009369307,"about_ca_topic_score_gemma":0.0014039429,"teacher_disagreement_score":0.0020913589,"about_ca_system_score_codex":0.0010637682,"about_ca_system_score_gemma":0.00038824594,"threshold_uncertainty_score":0.0077182055},"labels":[],"label_agreement":null},{"id":"W4411720755","doi":"10.61091/ars163-05","title":"Primitive normal pairs with prescribed traces over finite fields","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Mathematics; Finite field; Pure mathematics; Combinatorics","score_opus":0.026069999205215463,"score_gpt":0.300264648577068,"score_spread":0.27419464937185256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411720755","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46578535,0.00037701073,0.26599866,0.001686853,0.0009405815,0.00031250308,0.00096362026,0.0024375177,0.26149797],"genre_scores_gemma":[0.8738957,0.00033108893,0.03835793,0.00029518286,0.000411572,0.0001764232,0.00083188765,0.00061160047,0.08508851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857724,0.00023262382,0.000080245416,0.00034635502,0.00043093154,0.00033257945],"domain_scores_gemma":[0.9985896,0.00032775884,0.00015552879,0.00021433782,0.0003406492,0.0003720776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011202829,0.0013088275,0.00083795394,0.0015463481,0.002144408,0.00281521,0.0010547388,0.0009385219,0.018042127],"category_scores_gemma":[0.0039276467,0.0006466059,0.0008876565,0.00089484197,0.0034470388,0.006121078,0.0031533032,0.0028627017,0.004103718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011582098,0.000048159913,0.00051600806,0.000042421445,0.000006321093,0.00020782804,0.0002758636,0.0004968337,0.0018238244,0.98562974,0.0017854783,0.0090516005],"study_design_scores_gemma":[0.000062642735,0.000102450394,0.00033585945,0.000026112059,0.00001005795,0.00047450807,0.00028476334,0.004402103,0.005800951,0.9762639,0.012209013,0.000027690945],"about_ca_topic_score_codex":0.00064099446,"about_ca_topic_score_gemma":0.00065134367,"teacher_disagreement_score":0.018042127,"about_ca_system_score_codex":0.0017603732,"about_ca_system_score_gemma":0.0011842456,"threshold_uncertainty_score":0.060356915},"labels":[],"label_agreement":null},{"id":"W4411798643","doi":"10.61091/ars163-09","title":"Further results for the capacity statistic distribution on compositions of 1s and 2s","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Probability and Risk Models","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Statistic; Statistics; Distribution (mathematics); Mathematical analysis","score_opus":0.07304505701193827,"score_gpt":0.3573336543772995,"score_spread":0.2842885973653613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411798643","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15123563,0.0009229785,0.70260656,0.0042025787,0.00033381887,0.00020178419,0.0015128417,0.0017093524,0.13727449],"genre_scores_gemma":[0.898504,0.0011020255,0.05440723,0.0015074362,0.0009240345,0.0004377098,0.0012698086,0.0015472365,0.04030044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800545,0.00050118717,0.00007264528,0.0003826132,0.00060773926,0.00043040313],"domain_scores_gemma":[0.9910375,0.005499067,0.0010510428,0.00088741805,0.00093585823,0.00058903533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031947328,0.001309774,0.0011348914,0.0024419785,0.0015915516,0.0020945908,0.0023073985,0.0008837567,0.042496275],"category_scores_gemma":[0.018614937,0.0007296566,0.001442743,0.0033240754,0.0038481187,0.008758605,0.0022527205,0.0041323234,0.0037971693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009709279,0.000050698312,0.0010727404,0.00010305907,0.0000152137145,0.00019836551,0.00034758679,0.009601418,0.0025988535,0.9683944,0.005247246,0.012273423],"study_design_scores_gemma":[0.000039120823,0.00006041951,0.0012226272,0.00006852031,0.000027919676,0.00060489477,0.00021716233,0.10218569,0.0037875576,0.87869483,0.013012945,0.00007828476],"about_ca_topic_score_codex":0.0016706843,"about_ca_topic_score_gemma":0.0011718939,"teacher_disagreement_score":0.042496275,"about_ca_system_score_codex":0.0025220143,"about_ca_system_score_gemma":0.0015433017,"threshold_uncertainty_score":0.14216417},"labels":[],"label_agreement":null},{"id":"W4414631947","doi":"10.61091/ars164-08","title":"Kernel-perfectness in digraphs obtained by some operations on digraphs","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Digraph; Kernel (algebra); Arc (geometry); Set (abstract data type); Product (mathematics); Line (geometry)","score_opus":0.005345545598774207,"score_gpt":0.2362664208528371,"score_spread":0.2309208752540629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414631947","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7484779,0.0006984232,0.21528699,0.00032024115,0.00005693651,0.00006420534,0.00072507083,0.0004194531,0.03395084],"genre_scores_gemma":[0.9769746,0.00021229919,0.018502044,0.00005109588,0.000029381406,0.00002568226,0.00027587762,0.000035138994,0.0038939228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995621,0.00005991063,0.000043359712,0.00017365617,0.00007481768,0.00008615759],"domain_scores_gemma":[0.99900085,0.0003732539,0.00014697739,0.00022540712,0.000096364114,0.00015719213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039604568,0.00025650192,0.00038320723,0.00093098683,0.0007733123,0.0015163573,0.00042456048,0.00031513872,0.0028729541],"category_scores_gemma":[0.0016225019,0.0002878941,0.00051273685,0.0009928448,0.0014480733,0.0026784025,0.0010746784,0.00060276594,0.00023158349],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007951332,0.00003388439,0.0021028884,0.00012921113,0.000022703756,0.0003087247,0.00092143565,0.0055165025,0.0053682807,0.9611063,0.0009106024,0.023499914],"study_design_scores_gemma":[0.000035206776,0.00009776966,0.0028733155,0.000035856345,0.000060458533,0.0006823317,0.0004448059,0.028983142,0.0058419444,0.9504962,0.010411825,0.00003711866],"about_ca_topic_score_codex":0.0013220923,"about_ca_topic_score_gemma":0.0015957312,"teacher_disagreement_score":0.0028729541,"about_ca_system_score_codex":0.0009344291,"about_ca_system_score_gemma":0.00040241904,"threshold_uncertainty_score":0.009610951},"labels":[],"label_agreement":null},{"id":"W4414631951","doi":"10.61091/ars164-02","title":"Existentially closed critical Cayley graphs","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Japan Society for the Promotion of Science","keywords":"Cayley graph; Vertex-transitive graph; Vertex (graph theory); Adjacency list; Chordal graph; Indifference graph; Graph; Symmetric graph","score_opus":0.025179444904508793,"score_gpt":0.3294265627726002,"score_spread":0.3042471178680914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414631951","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.852981,0.0003850529,0.10019793,0.0002786351,0.00009280696,0.000080758444,0.0006037587,0.0003464029,0.045033675],"genre_scores_gemma":[0.9762656,0.00016224505,0.017387897,0.000107956635,0.000030473286,0.00003922767,0.00053979526,0.0000525601,0.0054141725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933535,0.000081990576,0.0000525014,0.00021407264,0.00013704086,0.00017900107],"domain_scores_gemma":[0.99806565,0.0005060012,0.0003075871,0.00028045735,0.0004139554,0.00042646346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004215373,0.00042872288,0.0003387656,0.0011073727,0.0013236173,0.0013578255,0.000732003,0.0004069849,0.002707134],"category_scores_gemma":[0.0019750108,0.00029626032,0.000360876,0.00093615527,0.0017249747,0.0018863397,0.0012931229,0.0010824229,0.00019168261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009641129,0.000025396497,0.0032277803,0.00008073029,0.000018847946,0.00042340517,0.0007006342,0.003245207,0.015730992,0.9560029,0.0016595308,0.018788226],"study_design_scores_gemma":[0.000029553463,0.00008493579,0.0036263918,0.000042711898,0.00005175588,0.0010008379,0.0009565839,0.020164482,0.02122354,0.91842407,0.034339685,0.000055488897],"about_ca_topic_score_codex":0.0019674844,"about_ca_topic_score_gemma":0.0024802266,"teacher_disagreement_score":0.002707134,"about_ca_system_score_codex":0.0011349877,"about_ca_system_score_gemma":0.000560711,"threshold_uncertainty_score":0.0090562105},"labels":[],"label_agreement":null},{"id":"W4414631968","doi":"10.61091/ars164-01","title":"Forbidden trees with diameter six for 3-connected graphs","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Vertex (graph theory); Graph; Path (computing); Tree (set theory); Enhanced Data Rates for GSM Evolution","score_opus":0.009599087843447162,"score_gpt":0.23017516000203417,"score_spread":0.22057607215858702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414631968","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8565194,0.0015109166,0.08938688,0.0013656388,0.00018652891,0.000101671794,0.0010517011,0.0005470445,0.049330227],"genre_scores_gemma":[0.9604818,0.0009034441,0.030228421,0.00029980822,0.00008332339,0.00021917606,0.0008590641,0.00009836499,0.006826637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945194,0.00009669288,0.000040392362,0.00011991476,0.00016393095,0.00012713761],"domain_scores_gemma":[0.997995,0.0010859165,0.00038393305,0.00015670057,0.00012648459,0.0002519701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038068448,0.0003387341,0.00041110555,0.0012806071,0.0013675479,0.0017072968,0.00065063173,0.0010724002,0.0030736905],"category_scores_gemma":[0.002299712,0.00049196614,0.0007347147,0.0009186928,0.0009923758,0.00127028,0.001263057,0.0011257018,0.00049835746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034556797,0.00009523469,0.0034020864,0.00031165412,0.000037919224,0.0013064266,0.0014159357,0.014963102,0.01903491,0.93482435,0.0051257294,0.019137044],"study_design_scores_gemma":[0.000115758594,0.00008849319,0.003197376,0.00011544638,0.000052679025,0.002143867,0.00036668216,0.0587179,0.006597815,0.90871423,0.01982517,0.00006455249],"about_ca_topic_score_codex":0.0011094317,"about_ca_topic_score_gemma":0.0013017853,"teacher_disagreement_score":0.0030736905,"about_ca_system_score_codex":0.0013084474,"about_ca_system_score_gemma":0.00047459904,"threshold_uncertainty_score":0.0102825165},"labels":[],"label_agreement":null},{"id":"W4414631978","doi":"10.61091/ars164-09","title":"Nonsplit graphs with split maximal edge induced subgraphs","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Board for Higher Mathematics","keywords":"Graph; Induced subgraph; Enhanced Data Rates for GSM Evolution; Independent set; Set (abstract data type); Line graph","score_opus":0.014494523322379722,"score_gpt":0.2721521042521349,"score_spread":0.25765758092975516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414631978","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8901429,0.0002891697,0.07448807,0.00022379166,0.000026698834,0.00011493866,0.0017355982,0.00042034677,0.032558378],"genre_scores_gemma":[0.9789898,0.0002047518,0.013416611,0.000069225855,0.00001767841,0.00006590212,0.002483869,0.00005456594,0.00469771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971527,0.00003800194,0.00001958496,0.000072444294,0.00006840728,0.00008634239],"domain_scores_gemma":[0.9984688,0.0005531029,0.0003719737,0.00028443508,0.0001578943,0.00016367038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023092225,0.00046982325,0.00029916962,0.00075519364,0.0011220725,0.0011523097,0.0006248525,0.0004610311,0.007480043],"category_scores_gemma":[0.0010440144,0.00029579463,0.00050555676,0.0009614744,0.00092998374,0.0020118419,0.0011525885,0.00063616363,0.00073168083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020108905,0.000437333,0.028974919,0.0012262979,0.00019655618,0.0047215596,0.0016322501,0.030769778,0.095305204,0.69491416,0.013686968,0.12612404],"study_design_scores_gemma":[0.00016203092,0.0005022584,0.029119892,0.00013300644,0.00025231307,0.0051005846,0.0015249463,0.07727257,0.06463156,0.7766801,0.044543725,0.00007699291],"about_ca_topic_score_codex":0.0005369605,"about_ca_topic_score_gemma":0.0011685621,"teacher_disagreement_score":0.007480043,"about_ca_system_score_codex":0.0004212397,"about_ca_system_score_gemma":0.00030891126,"threshold_uncertainty_score":0.025023282},"labels":[],"label_agreement":null},{"id":"W4414643038","doi":"10.61091/ars164-06","title":"On the interval coloring impropriety of graphs","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation of Korea; National Research Foundation; European Commission; National Science Foundation","keywords":"Appearance of impropriety; Interval (graph theory); Vertex (graph theory); Edge coloring; Graph coloring; Graph; Multipartite; Interval graph","score_opus":0.010761492838730572,"score_gpt":0.22974156598262163,"score_spread":0.21898007314389106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414643038","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61275613,0.0018291081,0.34137937,0.0010514669,0.00009781621,0.000104203595,0.0006023122,0.00064158347,0.041538026],"genre_scores_gemma":[0.925542,0.0009480097,0.07001204,0.00021133819,0.00019751389,0.00010076157,0.00054332975,0.00017726453,0.0022678198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977538,0.00052280497,0.00011686277,0.0004988811,0.0005954726,0.0005121891],"domain_scores_gemma":[0.98048604,0.014913392,0.0013251867,0.0017457918,0.0007394369,0.00079011294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019741405,0.0008294907,0.0009679118,0.0022463643,0.0017807786,0.0027649992,0.0016673631,0.0010932003,0.003986062],"category_scores_gemma":[0.009908092,0.0007938766,0.00088729715,0.0030862144,0.0034538438,0.0042043016,0.0021745947,0.0026787554,0.00046096128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007715852,0.00017622029,0.009660599,0.00032167585,0.00007378702,0.0005048074,0.0011603186,0.14635003,0.015851526,0.76508194,0.0041478653,0.055899605],"study_design_scores_gemma":[0.000066653585,0.00019549107,0.00386732,0.00009712886,0.00006372096,0.0010559977,0.0004581038,0.25271463,0.009148705,0.7215789,0.0106855,0.000067823166],"about_ca_topic_score_codex":0.0012685951,"about_ca_topic_score_gemma":0.0010934846,"teacher_disagreement_score":0.003986062,"about_ca_system_score_codex":0.0021536292,"about_ca_system_score_gemma":0.0005544606,"threshold_uncertainty_score":0.015625775},"labels":[],"label_agreement":null},{"id":"W4414643069","doi":"10.61091/ars164-07","title":"On maximum Zagreb connection indices for trees with fixed matching number","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Connection (principal bundle); Matching (statistics); Index (typography); Tree (set theory); Base (topology)","score_opus":0.016139074717204896,"score_gpt":0.2946702317796536,"score_spread":0.27853115706244874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414643069","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90698165,0.0011799147,0.043101437,0.00037283037,0.000057109937,0.000024702123,0.00028471407,0.00016270937,0.04783492],"genre_scores_gemma":[0.98629504,0.00046540578,0.0105074085,0.000046699188,0.00005357623,0.00004057609,0.00019319668,0.000048929454,0.002349126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995685,0.000104938845,0.00001899156,0.00009641142,0.00009657559,0.000114713475],"domain_scores_gemma":[0.99880886,0.0005388696,0.00022880189,0.00010380807,0.00011459766,0.00020510901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087272294,0.0003974034,0.0004902011,0.0027526466,0.0014572518,0.002075347,0.0010366826,0.0006218318,0.002140186],"category_scores_gemma":[0.0032535999,0.00032486796,0.0003537258,0.0018336514,0.0013503343,0.0020491048,0.0010085324,0.0009678339,0.00025306855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009521655,0.00003340121,0.0018038865,0.000077450975,0.0000132794585,0.0000981675,0.00020327301,0.009252327,0.004145532,0.96857977,0.0009345681,0.014763224],"study_design_scores_gemma":[0.00003186517,0.000044934306,0.0049905227,0.000080342375,0.00003558748,0.00035322204,0.00018665114,0.06731337,0.0029422275,0.9199976,0.0039868806,0.000036692887],"about_ca_topic_score_codex":0.0007784327,"about_ca_topic_score_gemma":0.0018355899,"teacher_disagreement_score":0.0027526466,"about_ca_system_score_codex":0.00166031,"about_ca_system_score_gemma":0.0005636208,"threshold_uncertainty_score":0.012046516},"labels":[],"label_agreement":null},{"id":"W4414643071","doi":"10.61091/ars164-05","title":"Primitive star decompositions of graphs","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Star (game theory); Graph; Decomposition; Path (computing); Induced path; Cograph","score_opus":0.004280500213493223,"score_gpt":0.2069997454216965,"score_spread":0.20271924520820328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414643071","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7419425,0.00073154666,0.21576971,0.00044560593,0.00008996796,0.00016092623,0.0014260204,0.00044961637,0.03898408],"genre_scores_gemma":[0.91584736,0.00048893556,0.07349704,0.00011559398,0.00009916599,0.00009084341,0.001568977,0.00008836904,0.008203754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927515,0.00011318896,0.000049747105,0.00020467277,0.00020091934,0.00015624813],"domain_scores_gemma":[0.9976519,0.00062496704,0.00037895885,0.00045183825,0.00041411497,0.00047827946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006190201,0.00040596447,0.00043583993,0.0021698342,0.0009862244,0.0018110342,0.0004515245,0.00050240185,0.0035363634],"category_scores_gemma":[0.0017166621,0.00043570675,0.00066166685,0.0013173486,0.0018120205,0.0020725676,0.0012778675,0.0010564342,0.000574402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018462846,0.000044529414,0.002281197,0.00013769498,0.000029208953,0.0002310646,0.00047017122,0.0061337478,0.014069026,0.95201707,0.0022341248,0.022167632],"study_design_scores_gemma":[0.00002996434,0.000090763715,0.0020654218,0.000048893264,0.000026077501,0.0005113375,0.00028582153,0.029237904,0.005718511,0.950289,0.011673914,0.000022295058],"about_ca_topic_score_codex":0.0005676334,"about_ca_topic_score_gemma":0.0009938986,"teacher_disagreement_score":0.0035363634,"about_ca_system_score_codex":0.00083478715,"about_ca_system_score_gemma":0.0005326147,"threshold_uncertainty_score":0.01183033},"labels":[],"label_agreement":null},{"id":"W4414643096","doi":"10.61091/ars164-03","title":"Local Distance Antimagic Labeling of Generalized Mycielskian Graphs","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bijection; Chromatic scale; Graph; Order (exchange); Arithmetic progression; Connectivity","score_opus":0.008163716929798307,"score_gpt":0.23567361686981855,"score_spread":0.22750989994002024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414643096","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9109139,0.00044538762,0.07250922,0.0003206552,0.00002556674,0.00004028009,0.00031732308,0.00013308383,0.015294566],"genre_scores_gemma":[0.97257566,0.00022039565,0.023137905,0.0000633223,0.00002230118,0.000042125794,0.00027735493,0.000021039317,0.003639948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999721,0.000052218,0.000018937228,0.000088564106,0.00004873096,0.0000705764],"domain_scores_gemma":[0.99936694,0.00019599464,0.00014872427,0.0000985101,0.00008333268,0.000106565414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023090288,0.00030713488,0.00029122675,0.0006911756,0.000910599,0.0009773974,0.0006174104,0.00045355325,0.0020438246],"category_scores_gemma":[0.00083483366,0.00018889378,0.00029979378,0.0009370346,0.0009125741,0.001604083,0.00082330534,0.0005650675,0.00019715363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003689834,0.00007529002,0.0056352336,0.00035972233,0.000040460272,0.00032712353,0.001003642,0.025812853,0.041667353,0.8837355,0.0021654367,0.038808428],"study_design_scores_gemma":[0.00007343268,0.00020161882,0.0074040573,0.00006477384,0.000101296035,0.0011963847,0.0011112909,0.12199107,0.026525747,0.816296,0.02496652,0.000067708934],"about_ca_topic_score_codex":0.0010555309,"about_ca_topic_score_gemma":0.0022762367,"teacher_disagreement_score":0.0020438246,"about_ca_system_score_codex":0.0011612378,"about_ca_system_score_gemma":0.00035229835,"threshold_uncertainty_score":0.008425355},"labels":[],"label_agreement":null},{"id":"W4414643097","doi":"10.61091/ars164-04","title":"Counting adjacencies with difference at most one in -ary words","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Statistic; Generating function; Set (abstract data type); Function (biology); Distribution (mathematics); Chebyshev filter","score_opus":0.008487833351066884,"score_gpt":0.2355380503270227,"score_spread":0.22705021697595584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414643097","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8317195,0.00019317574,0.15757887,0.0002728471,0.000055975914,0.00004508536,0.00031144565,0.00024890158,0.009574173],"genre_scores_gemma":[0.97192276,0.00012026022,0.024318235,0.000054220007,0.00006464072,0.000068226036,0.0004147599,0.00009240496,0.0029445728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989273,0.00021266773,0.000097714656,0.00025247838,0.00029740031,0.0002123769],"domain_scores_gemma":[0.98962003,0.006865207,0.0012122237,0.0010183715,0.00082108076,0.0004631048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011592552,0.00031275206,0.0006323707,0.0018921124,0.001059368,0.0020161364,0.0018949709,0.0007078929,0.0052586044],"category_scores_gemma":[0.011240236,0.0003246224,0.00038520465,0.0019762423,0.0017313847,0.0035743723,0.0011412296,0.00075052923,0.0006162702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056085736,0.00014245545,0.027131151,0.0002550227,0.000045086745,0.00080974965,0.0012842274,0.029187027,0.024619386,0.8526866,0.002308393,0.06097015],"study_design_scores_gemma":[0.00004059154,0.0002328549,0.008185119,0.000061652994,0.00007658737,0.0015544533,0.0006667331,0.23744778,0.03870838,0.7060239,0.00690632,0.000095613315],"about_ca_topic_score_codex":0.00078546605,"about_ca_topic_score_gemma":0.0011625383,"teacher_disagreement_score":0.0052586044,"about_ca_system_score_codex":0.0010289972,"about_ca_system_score_gemma":0.00054499554,"threshold_uncertainty_score":0.017591715},"labels":[],"label_agreement":null},{"id":"W4414769467","doi":"10.61091/ars164-10","title":"Retraction notice: Combinatorial proof of the Girard-Waring formula","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorial proof; Algebra over a field; Calculus (dental); Combinatorial principles; Proof complexity","score_opus":0.007386731914679973,"score_gpt":0.26681438300304855,"score_spread":0.25942765108836857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414769467","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040770117,0.0056260293,0.009828611,0.20401013,0.6687304,0.00005356422,0.001883712,0.000744967,0.1050456],"genre_scores_gemma":[0.13214122,0.00852541,0.018635087,0.045580745,0.3885335,0.0002514822,0.003893534,0.0016456492,0.4007933],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981635,0.0003830261,0.0002106954,0.00029398708,0.00079543603,0.00015329105],"domain_scores_gemma":[0.99345726,0.003346211,0.0002655413,0.0005461037,0.0019560074,0.00042898784],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002569329,0.0011976993,0.0009924023,0.0020201325,0.0016231246,0.0024690456,0.0025341841,0.0031136924,0.039492775],"category_scores_gemma":[0.019647893,0.00044311496,0.00127919,0.0016373721,0.0021110896,0.0039461525,0.0015685001,0.007854752,0.010753089],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055303153,0.000016877031,0.00010519815,0.0001843391,0.000027446635,0.00018599337,0.000103059305,0.000120952725,0.00038713863,0.08016181,0.9024744,0.016177448],"study_design_scores_gemma":[0.00005927802,0.000036559853,0.0016275174,0.00014124824,0.000065256405,0.00065587356,0.000078257515,0.0011153679,0.00094175874,0.09634952,0.8988739,0.00005543592],"about_ca_topic_score_codex":0.0026844584,"about_ca_topic_score_gemma":0.002427399,"teacher_disagreement_score":0.9968863,"about_ca_system_score_codex":0.0030760276,"about_ca_system_score_gemma":0.0019029957,"threshold_uncertainty_score":0.13211656},"labels":[],"label_agreement":null},{"id":"W44666342","doi":"","title":"Which Graphs Have Hall Number Two","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.017097635612002098,"score_gpt":0.23867627100835304,"score_spread":0.22157863539635095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W44666342","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75360656,0.0039184326,0.07439493,0.021242287,0.00089411676,0.00008726577,0.0036867938,0.0019824621,0.14018707],"genre_scores_gemma":[0.9782633,0.00066734815,0.008221163,0.00076845154,0.00035973705,0.000042099095,0.0012530811,0.00021623203,0.010208518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983248,0.00045750962,0.00008301017,0.0004899088,0.00021488102,0.00042973273],"domain_scores_gemma":[0.9764717,0.015600125,0.0018680673,0.0031273786,0.00093323365,0.0019994467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015379398,0.0007452562,0.0016516808,0.0019222092,0.0025632484,0.008669774,0.00217196,0.0032480548,0.02011432],"category_scores_gemma":[0.011599154,0.0012046633,0.0010035206,0.0028515416,0.004975204,0.018689902,0.0023124348,0.0030765703,0.0023198812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011556484,0.00022792815,0.007273748,0.00055260473,0.00008570773,0.00017724201,0.0007395733,0.0053040492,0.0029372922,0.9162073,0.028001897,0.037336998],"study_design_scores_gemma":[0.000061427076,0.000023760815,0.0010511646,0.000045694767,0.00003909375,0.00018728386,0.0007195497,0.0042959373,0.002052832,0.984637,0.006852953,0.000033294415],"about_ca_topic_score_codex":0.000905793,"about_ca_topic_score_gemma":0.0013302972,"teacher_disagreement_score":0.02011432,"about_ca_system_score_codex":0.002164018,"about_ca_system_score_gemma":0.0012265303,"threshold_uncertainty_score":0.06728917},"labels":[],"label_agreement":null},{"id":"W4467802","doi":"","title":"Note: On Directed Odd or Even Minimum (s, t)-Cut Problem and Generalizations.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Maximum cut; Mathematical economics; Graph","score_opus":0.016029789989740358,"score_gpt":0.22022030128027206,"score_spread":0.2041905112905317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4467802","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027599238,0.019838313,0.22741732,0.06261215,0.027123725,0.00043030592,0.005315594,0.0010304877,0.62863284],"genre_scores_gemma":[0.3976696,0.046019692,0.20965317,0.038362637,0.029244328,0.00090698566,0.008353076,0.0011191312,0.26867133],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996277,0.00008070956,0.00001853429,0.00011404331,0.00010692514,0.000052043404],"domain_scores_gemma":[0.99861205,0.0008514326,0.000078392404,0.00014851033,0.00018605725,0.00012345612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006474705,0.0008670539,0.0006960151,0.0010115587,0.0011273162,0.0015985195,0.001374684,0.0012029496,0.027914558],"category_scores_gemma":[0.0032391744,0.00022285322,0.000703062,0.0023865928,0.0011387256,0.0041590654,0.0015161753,0.0036940337,0.0047805756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003107361,0.00015032923,0.0007196705,0.0010635391,0.00005382878,0.0006257333,0.00021629373,0.0046516117,0.0026181242,0.36611515,0.487708,0.13576703],"study_design_scores_gemma":[0.000043241573,0.00010193515,0.001933395,0.00018145444,0.000056128716,0.001148743,0.00020794036,0.011434992,0.0018646403,0.76199853,0.22098231,0.000046714547],"about_ca_topic_score_codex":0.003444686,"about_ca_topic_score_gemma":0.004747211,"teacher_disagreement_score":0.027914558,"about_ca_system_score_codex":0.0008112805,"about_ca_system_score_gemma":0.0005670697,"threshold_uncertainty_score":0.09338349},"labels":[],"label_agreement":null},{"id":"W45017458","doi":"","title":"On 2-Factors with Quadrilaterals Containing Specified Vertices in a Bipartite Graph.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Quadrilateral; Complete bipartite graph; Combinatorics; Graph; Structural engineering; Engineering","score_opus":0.010930092718626423,"score_gpt":0.21220099067908124,"score_spread":0.20127089796045483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W45017458","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28397226,0.0013765641,0.50738937,0.0011299468,0.0005582163,0.00025258533,0.0013711908,0.0009930388,0.20295677],"genre_scores_gemma":[0.7862677,0.0011436727,0.13245916,0.00059068453,0.00026467227,0.00025342425,0.0014149571,0.00047276352,0.07713299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999164,0.00025914062,0.000038338167,0.00016778322,0.00015693813,0.00021374812],"domain_scores_gemma":[0.9984781,0.0006955104,0.0002799625,0.00019044158,0.00015811516,0.00019788179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054391817,0.00067211,0.0005858869,0.0013922919,0.0013477781,0.0016666102,0.0005829539,0.00095385796,0.022988286],"category_scores_gemma":[0.0024005054,0.00044563858,0.0005724039,0.0012672034,0.0014177643,0.002197758,0.0012673343,0.0008546831,0.00422119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024290309,0.00007351162,0.00084886723,0.00014121832,0.000023440376,0.00035078896,0.00031936727,0.011845617,0.004622382,0.9454108,0.009367437,0.026753675],"study_design_scores_gemma":[0.000053184787,0.00005557646,0.000520844,0.00008021157,0.000019820345,0.00043443296,0.00034582877,0.03472681,0.0027041114,0.935141,0.025888687,0.000029311797],"about_ca_topic_score_codex":0.0027829304,"about_ca_topic_score_gemma":0.004572872,"teacher_disagreement_score":0.022988286,"about_ca_system_score_codex":0.0007913886,"about_ca_system_score_gemma":0.00045177634,"threshold_uncertainty_score":0.07690346},"labels":[],"label_agreement":null},{"id":"W45265680","doi":"","title":"On Quadrilaterals and Cycle Covers in a Bipartite Graph.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Quadrilateral; Complete bipartite graph; Combinatorics; Graph; Structural engineering; Finite element method","score_opus":0.013954489477157517,"score_gpt":0.27878385254499,"score_spread":0.2648293630678325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W45265680","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50197846,0.004689339,0.24783823,0.0030586105,0.00050329993,0.00018241194,0.0015466638,0.00045860672,0.23974435],"genre_scores_gemma":[0.88759667,0.0030130702,0.05593384,0.0006316958,0.00050500006,0.00020067545,0.0017689097,0.0002981664,0.050051942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934906,0.00021481427,0.000025662343,0.00011291883,0.00013639133,0.00016122498],"domain_scores_gemma":[0.9975555,0.0015212026,0.00031904483,0.00020282005,0.00015253958,0.00024887075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046870142,0.0004929669,0.0006484604,0.0018464132,0.0016642404,0.0018608768,0.00091300067,0.001328133,0.013972953],"category_scores_gemma":[0.003320873,0.00055278046,0.00054269994,0.0022696338,0.0019080562,0.0038197197,0.0019087938,0.0015377179,0.0017342897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014938465,0.000044263976,0.0011899523,0.00015615461,0.000021740907,0.00026198756,0.00042898543,0.009731879,0.001670466,0.9482158,0.0089474125,0.029181888],"study_design_scores_gemma":[0.000017479028,0.000026482125,0.0007068298,0.00005025434,0.000015590353,0.0003526427,0.00030338418,0.024154646,0.00069632876,0.963105,0.010559184,0.0000121359],"about_ca_topic_score_codex":0.0025662747,"about_ca_topic_score_gemma":0.003954359,"teacher_disagreement_score":0.013972953,"about_ca_system_score_codex":0.0010024958,"about_ca_system_score_gemma":0.00030206834,"threshold_uncertainty_score":0.046744227},"labels":[],"label_agreement":null},{"id":"W45432375","doi":"","title":"The Niche Category of Dense Graphs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Niche; Combinatorics; Ecology; Biology","score_opus":0.012561579035767913,"score_gpt":0.22563545137408672,"score_spread":0.21307387233831881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W45432375","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31552085,0.008095589,0.28202128,0.01097455,0.000674919,0.00014982895,0.004263155,0.0016593041,0.37664056],"genre_scores_gemma":[0.9144073,0.002353037,0.039386366,0.0011837077,0.0005335351,0.00014734459,0.0024149236,0.00030359466,0.039270118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990073,0.00023518517,0.000040921586,0.00022804647,0.00024068277,0.00024785014],"domain_scores_gemma":[0.99761283,0.0010747105,0.0001951901,0.00037006114,0.00025636025,0.0004908347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008629301,0.00043821931,0.00081746886,0.0026376857,0.0033187573,0.0043116347,0.0013964894,0.0014983867,0.011766648],"category_scores_gemma":[0.0035377787,0.0005382267,0.00071827584,0.003176058,0.0034917984,0.008871204,0.0040446282,0.001855854,0.0013932707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025491212,0.0000092026285,0.00030829856,0.000045399294,0.0000046896985,0.000037374546,0.00020778563,0.00029894576,0.00024772418,0.98441607,0.0058174334,0.008581603],"study_design_scores_gemma":[0.00000811832,0.00000852126,0.00034111168,0.000025562524,0.000008124012,0.00016879024,0.00029636125,0.0024050258,0.00024212144,0.9779719,0.018516386,0.000007970239],"about_ca_topic_score_codex":0.0031621424,"about_ca_topic_score_gemma":0.003593092,"teacher_disagreement_score":0.011766648,"about_ca_system_score_codex":0.0017329628,"about_ca_system_score_gemma":0.0008835988,"threshold_uncertainty_score":0.039363325},"labels":[],"label_agreement":null},{"id":"W45661086","doi":"","title":"Finite Linear Spaces With Four More Lines Than Points.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.009353248580632405,"score_gpt":0.20319063039886534,"score_spread":0.19383738181823293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W45661086","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1874674,0.0014764826,0.42707112,0.003950869,0.000648651,0.000075434546,0.0012173869,0.0013143471,0.37677822],"genre_scores_gemma":[0.85386837,0.00045356058,0.053872347,0.0008874384,0.00035226753,0.00009270985,0.0007599376,0.00017928416,0.08953409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985135,0.0005150012,0.000084179934,0.00028456608,0.00030128204,0.00030146108],"domain_scores_gemma":[0.99744993,0.0010831723,0.00026256306,0.000546431,0.00037397997,0.00028389372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051986973,0.00052684225,0.00039483936,0.0013774597,0.0015408488,0.003502806,0.00091771514,0.00087591365,0.025423538],"category_scores_gemma":[0.002796171,0.0003170747,0.00056939916,0.0014397558,0.0030979998,0.005012507,0.002615808,0.0020480033,0.0048658745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059549056,0.000023060174,0.00018945218,0.00003343223,0.000009930503,0.000083275096,0.0001471011,0.0008695971,0.0009814876,0.9834427,0.0027649144,0.011395432],"study_design_scores_gemma":[0.000019584555,0.00003877871,0.00020158109,0.00003110844,0.000011823625,0.0002416354,0.00025742294,0.005533097,0.0026312289,0.9569548,0.034053806,0.000025106378],"about_ca_topic_score_codex":0.0012166661,"about_ca_topic_score_gemma":0.0014772282,"teacher_disagreement_score":0.025423538,"about_ca_system_score_codex":0.0011778679,"about_ca_system_score_gemma":0.00062936376,"threshold_uncertainty_score":0.085050166},"labels":[],"label_agreement":null},{"id":"W45745707","doi":"","title":"Improved Knight Coverings.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Conflict of Laws and Jurisdiction","field":"Social Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Knight; Mathematics; Physics","score_opus":0.011955711676823159,"score_gpt":0.26542991653165043,"score_spread":0.2534742048548273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W45745707","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10406204,0.0019203924,0.40558273,0.0024160715,0.0010987644,0.00026672625,0.003733437,0.0028842448,0.47803566],"genre_scores_gemma":[0.65790343,0.0017586965,0.1926807,0.0010812366,0.000526083,0.0002669005,0.0048727887,0.0015162068,0.13939399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99878687,0.0002955322,0.00007632924,0.00025602806,0.0002959742,0.00028931128],"domain_scores_gemma":[0.9978028,0.0008750381,0.00015447386,0.00073514396,0.00021973389,0.00021279087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008769755,0.0009140879,0.0012676911,0.0016894017,0.0027799795,0.0036432666,0.0014868227,0.001093569,0.034014408],"category_scores_gemma":[0.005131732,0.00059854524,0.0015211963,0.0029816492,0.0016124984,0.0054488536,0.0035884755,0.002595286,0.0065723984],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010187828,0.000079687765,0.0005611584,0.00018868831,0.000052939868,0.00014808396,0.0003623863,0.008605389,0.0011066839,0.8715401,0.0363289,0.08092411],"study_design_scores_gemma":[0.000034569453,0.000026904134,0.00044169548,0.000052781135,0.000049278948,0.00025861402,0.00018843732,0.016577061,0.0012732507,0.91189295,0.069181666,0.000022834722],"about_ca_topic_score_codex":0.0032655925,"about_ca_topic_score_gemma":0.0059093433,"teacher_disagreement_score":0.034014408,"about_ca_system_score_codex":0.0018205903,"about_ca_system_score_gemma":0.0010239244,"threshold_uncertainty_score":0.1137895},"labels":[],"label_agreement":null},{"id":"W45795502","doi":"","title":"Closed Paths In The Coset Diagrams for Acting On Real Quadratic Fields.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Coset; Mathematics; Quadratic equation; Pure mathematics; Geometry; Combinatorics","score_opus":0.01708393881577699,"score_gpt":0.2567556941902353,"score_spread":0.2396717553744583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W45795502","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3086858,0.0018129875,0.35225347,0.0027477222,0.0014144642,0.00020156182,0.0009742961,0.0018086478,0.3301011],"genre_scores_gemma":[0.86426073,0.0011149788,0.05863937,0.00048409402,0.00037316067,0.00017177025,0.00060338597,0.0006311327,0.07372128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99924254,0.00020291675,0.00003803323,0.00014963612,0.00022843128,0.00013847857],"domain_scores_gemma":[0.99910635,0.00036528066,0.00013142888,0.000104061546,0.00013258871,0.00016039168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084272545,0.00057637575,0.00046014442,0.0020844282,0.0020837113,0.003567877,0.00068138575,0.0015551028,0.017403156],"category_scores_gemma":[0.0027709669,0.00039590662,0.0005894787,0.0014170422,0.0019657416,0.007004442,0.0015379288,0.0019238162,0.002646576],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002147049,0.000011407471,0.00009778236,0.000022766919,0.0000021088683,0.00006312165,0.00014639265,0.00021010576,0.00051153346,0.9926882,0.0012807737,0.0049445117],"study_design_scores_gemma":[0.000011129127,0.000009069272,0.00010412346,0.000017725353,0.0000038505277,0.00012651073,0.000095596726,0.0012848632,0.0005680247,0.98984015,0.007929828,0.0000091787515],"about_ca_topic_score_codex":0.0007826721,"about_ca_topic_score_gemma":0.0011053907,"teacher_disagreement_score":0.017403156,"about_ca_system_score_codex":0.0009786232,"about_ca_system_score_gemma":0.0006759988,"threshold_uncertainty_score":0.058219373},"labels":[],"label_agreement":null},{"id":"W46586926","doi":"","title":"Obstruction Sets for Outer-Bananas-Surface Graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Surface (topology); Geometry; Combinatorics","score_opus":0.016359707072415897,"score_gpt":0.25557876359767573,"score_spread":0.23921905652525982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W46586926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32034856,0.00102283,0.35919738,0.0023763988,0.0005006042,0.00016211999,0.0011469375,0.0015352375,0.31370994],"genre_scores_gemma":[0.88578016,0.00051295455,0.046478692,0.0004777386,0.00018976587,0.00016372543,0.0017179803,0.00056992366,0.06410913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993345,0.00012828085,0.000038080834,0.000117940515,0.00023486566,0.00014621325],"domain_scores_gemma":[0.9984145,0.0007255228,0.00014580639,0.00025458058,0.00019638836,0.00026316958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005198157,0.00055929605,0.00067392905,0.002846019,0.002436933,0.003440073,0.001200878,0.0013039892,0.018444244],"category_scores_gemma":[0.0031221076,0.0005248302,0.0009933416,0.0012246391,0.0026019288,0.0037101568,0.00445599,0.0026017025,0.0023212193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023807253,0.000017499826,0.00028141632,0.00003422267,0.0000059993927,0.000077329656,0.0001761495,0.0010779245,0.0005505833,0.9896013,0.0025598714,0.0055937963],"study_design_scores_gemma":[0.000009657829,0.000008983716,0.00030471923,0.000021765456,0.000009279042,0.00013008274,0.00017093103,0.006200195,0.0006884724,0.9831728,0.009272095,0.000011044259],"about_ca_topic_score_codex":0.0013681882,"about_ca_topic_score_gemma":0.0020994702,"teacher_disagreement_score":0.018444244,"about_ca_system_score_codex":0.0012617619,"about_ca_system_score_gemma":0.00045269588,"threshold_uncertainty_score":0.061702132},"labels":[],"label_agreement":null},{"id":"W46589465","doi":"","title":"Arc Signed Graphs of Oriented Graphs.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arc (geometry); Combinatorics; Indifference graph; Graph; Geometry","score_opus":0.018186615225529747,"score_gpt":0.25880686326639474,"score_spread":0.240620248040865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W46589465","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24842541,0.0048178528,0.32917586,0.0023539453,0.0026587257,0.00017548015,0.002236666,0.0014969268,0.40865925],"genre_scores_gemma":[0.84894806,0.0031440402,0.048178133,0.00075998565,0.0007491939,0.00010651208,0.0018330377,0.00039113584,0.09588991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995746,0.00010441578,0.000030638374,0.00008191071,0.00014417432,0.00006426001],"domain_scores_gemma":[0.99866796,0.0004016981,0.00032309073,0.0001632945,0.00025712824,0.00018678934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031894015,0.00049655203,0.0003391089,0.0019209435,0.00077112566,0.0025280206,0.00059290626,0.0006868077,0.015657857],"category_scores_gemma":[0.0025616651,0.0002835539,0.00034186346,0.0015056983,0.0010235622,0.0033721526,0.0011747658,0.001209304,0.0026479142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046857713,0.000027305548,0.0003565517,0.00010020336,0.000009982446,0.00015585149,0.00016624387,0.0009865657,0.0023055049,0.9532938,0.0066293124,0.035921935],"study_design_scores_gemma":[0.000015304926,0.000026863185,0.0005189763,0.000049083585,0.00001607276,0.00037286503,0.00017770872,0.0043556746,0.0018555168,0.9546671,0.03792762,0.000017217508],"about_ca_topic_score_codex":0.0006332313,"about_ca_topic_score_gemma":0.0010584121,"teacher_disagreement_score":0.015657857,"about_ca_system_score_codex":0.0006272538,"about_ca_system_score_gemma":0.00042666946,"threshold_uncertainty_score":0.0523808},"labels":[],"label_agreement":null},{"id":"W46611669","doi":"","title":"Set-magic labelings of infinite graphs.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; MAGIC (telescope); Combinatorics; Discrete mathematics; Astrophysics; Physics","score_opus":0.02035034492159459,"score_gpt":0.222371672435287,"score_spread":0.2020213275136924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W46611669","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33052087,0.0028533428,0.39474174,0.0047468874,0.00054195104,0.00011391464,0.0028903892,0.0014276935,0.26216316],"genre_scores_gemma":[0.8754644,0.00081876747,0.09537217,0.00058371347,0.00024270004,0.00011732739,0.0018182639,0.0002622142,0.025320508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998941,0.0003266554,0.00008034787,0.00021851857,0.00025772545,0.00017575952],"domain_scores_gemma":[0.99505424,0.0029976561,0.00047222938,0.00066067505,0.0003852787,0.00042988837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009003583,0.0004163246,0.00058127363,0.0019269373,0.002070537,0.0037282968,0.0012988087,0.0012725537,0.011007143],"category_scores_gemma":[0.0054936367,0.0006086633,0.00080748857,0.0018759533,0.0025533293,0.0065433276,0.0025161372,0.002605157,0.001211104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003910717,0.000014988616,0.0002625605,0.00004872692,0.000005458716,0.00003087984,0.00013390202,0.0010897766,0.0005888002,0.9864942,0.0030254864,0.008266144],"study_design_scores_gemma":[0.000009004352,0.0000060113744,0.00014177086,0.000021585574,0.0000063767293,0.000085454136,0.000081157894,0.0043245074,0.00062374986,0.99014705,0.00454472,0.000008569452],"about_ca_topic_score_codex":0.0012580083,"about_ca_topic_score_gemma":0.0020609393,"teacher_disagreement_score":0.011007143,"about_ca_system_score_codex":0.0017247013,"about_ca_system_score_gemma":0.00068976235,"threshold_uncertainty_score":0.036822498},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.01794874767751408,"score_gpt":0.21871511490534734,"score_spread":0.20076636722783325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W46767655","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4580607,0.0020565672,0.35384125,0.0055216444,0.0006007127,0.00015779056,0.0037647237,0.0015525029,0.17444406],"genre_scores_gemma":[0.901763,0.00072494417,0.069451824,0.0007198021,0.00022732839,0.00009571426,0.0024746116,0.00029747802,0.024245363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894947,0.00032699757,0.000052892134,0.00024603098,0.0001924653,0.00023217584],"domain_scores_gemma":[0.9942826,0.0034718728,0.0004110335,0.001024693,0.0003423749,0.000467323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010747066,0.00062260753,0.00064691034,0.0011827062,0.0016079395,0.0027962641,0.0014694121,0.0011002581,0.007822355],"category_scores_gemma":[0.0051185056,0.0005188262,0.0006564069,0.001801443,0.0019133012,0.00442577,0.0022177948,0.0022018754,0.0009050533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001655242,0.000077998564,0.0017780863,0.00019295992,0.000027910723,0.00006671175,0.0002555312,0.008570135,0.00219894,0.9405715,0.016122984,0.029971644],"study_design_scores_gemma":[0.00002937471,0.000022723838,0.0006586199,0.000026723388,0.000022677486,0.0001642888,0.00015721419,0.022051662,0.0016131036,0.9671048,0.008135509,0.000013286743],"about_ca_topic_score_codex":0.0018404232,"about_ca_topic_score_gemma":0.0029078382,"teacher_disagreement_score":0.007822355,"about_ca_system_score_codex":0.002078557,"about_ca_system_score_gemma":0.0010260243,"threshold_uncertainty_score":0.026168406},"labels":[],"label_agreement":null},{"id":"W47163984","doi":"","title":"On the Symmetry Groups of Hypergraphs of Perfect Cwatsets.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Symmetry (geometry); Pure mathematics; Combinatorics; Geometry","score_opus":0.004793500089538844,"score_gpt":0.17670995599839498,"score_spread":0.17191645590885613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W47163984","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6576906,0.0015695257,0.14621103,0.002861754,0.0004991471,0.0001870251,0.0008593745,0.0003273552,0.18979423],"genre_scores_gemma":[0.9586779,0.0008560902,0.014545402,0.0005125712,0.0003852867,0.00013027762,0.000534425,0.00011765506,0.024240538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904317,0.0003211979,0.00004555946,0.00015283849,0.0001995617,0.00023760022],"domain_scores_gemma":[0.9966845,0.0016339247,0.00065740437,0.0004201932,0.00024599928,0.0003580842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008454827,0.00050784706,0.00062347535,0.0021948258,0.0018499637,0.0025995565,0.00092204043,0.0011000774,0.010832849],"category_scores_gemma":[0.00413439,0.00045649754,0.00060913886,0.0014488858,0.0029551168,0.005507383,0.0021769383,0.0015524138,0.0012880818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047294492,0.000024420853,0.00039304444,0.00002417608,0.000008069518,0.000083883744,0.00024978828,0.0012008095,0.00078756263,0.9896987,0.0016803083,0.0058020297],"study_design_scores_gemma":[0.000015680242,0.000015592363,0.00032994227,0.000016928014,0.0000059622566,0.000102164384,0.00016108666,0.0036667387,0.00039626655,0.992239,0.003040845,0.000009737623],"about_ca_topic_score_codex":0.0013359173,"about_ca_topic_score_gemma":0.0014436068,"teacher_disagreement_score":0.010832849,"about_ca_system_score_codex":0.0011449754,"about_ca_system_score_gemma":0.00069011946,"threshold_uncertainty_score":0.036239505},"labels":[],"label_agreement":null},{"id":"W48132171","doi":"","title":"A direct construction of transversal covers using group divisible designs.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Transversal (combinatorics); Mathematics; Group (periodic table); Pure mathematics; Mathematical analysis; Physics","score_opus":0.017915168625932065,"score_gpt":0.1950306630076919,"score_spread":0.17711549438175983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W48132171","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2727295,0.0009812576,0.57810104,0.00062355166,0.00048333683,0.0001598072,0.00049283647,0.0009630629,0.14546569],"genre_scores_gemma":[0.8320219,0.00081989187,0.12503047,0.00020927719,0.00015190807,0.00014962045,0.00051597174,0.00021401826,0.04088687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952865,0.00010547363,0.000019204108,0.00010110212,0.00013587455,0.00010979945],"domain_scores_gemma":[0.99922884,0.0002702068,0.000067744404,0.00024505434,0.00007959103,0.00010859597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031132056,0.00043870354,0.00036679092,0.0009800489,0.0009805214,0.0014114281,0.0004998966,0.00052747113,0.008783915],"category_scores_gemma":[0.0012238923,0.00037232097,0.0004967724,0.0006985349,0.0009170906,0.0016386836,0.0026534193,0.0012682804,0.0017229116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011594828,0.00005852836,0.00059539947,0.00010465249,0.000019061596,0.00030640358,0.00045018183,0.0017887539,0.015887091,0.9326007,0.003969167,0.044104174],"study_design_scores_gemma":[0.00007947956,0.00022162884,0.0008697135,0.000094535026,0.00006448364,0.0012557578,0.0003950179,0.014546888,0.02785142,0.888222,0.06635467,0.000044390745],"about_ca_topic_score_codex":0.00026360727,"about_ca_topic_score_gemma":0.00057976006,"teacher_disagreement_score":0.008783915,"about_ca_system_score_codex":0.0004609966,"about_ca_system_score_gemma":0.00030457205,"threshold_uncertainty_score":0.02938509},"labels":[],"label_agreement":null},{"id":"W48206051","doi":"","title":"To Determine 1-Extendable Graphs and its Algorithm.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Algorithm","score_opus":0.013698340040704953,"score_gpt":0.2286208279347688,"score_spread":0.21492248789406385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W48206051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093541615,0.0014355034,0.84220266,0.0026660324,0.000473736,0.000341229,0.0028751907,0.0060266205,0.05043746],"genre_scores_gemma":[0.22401424,0.00068639533,0.74587184,0.00095389487,0.0001920275,0.0002964829,0.006136974,0.00094478787,0.020903343],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991247,0.00018718906,0.000050815775,0.0003473198,0.00017023727,0.00011976706],"domain_scores_gemma":[0.99788505,0.0010681775,0.0001119496,0.0005815487,0.00022050375,0.00013275517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009402229,0.0009137875,0.00081536407,0.0014491045,0.0011200348,0.0018739642,0.0018895529,0.001377204,0.0132775735],"category_scores_gemma":[0.004836937,0.00046940384,0.001188819,0.0019691067,0.00093467976,0.0038952834,0.0025976263,0.0026118401,0.00407245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055652164,0.00069600315,0.0061105485,0.0011128422,0.00016669462,0.00027074685,0.00066163,0.029266834,0.016208023,0.3194044,0.06938187,0.5561639],"study_design_scores_gemma":[0.000100687794,0.00013732628,0.0021163095,0.00011813995,0.000115791954,0.0005104111,0.00036338516,0.102429874,0.011242579,0.8368595,0.04594652,0.000059439575],"about_ca_topic_score_codex":0.0017677946,"about_ca_topic_score_gemma":0.003196294,"teacher_disagreement_score":0.0132775735,"about_ca_system_score_codex":0.0010641168,"about_ca_system_score_gemma":0.0012501028,"threshold_uncertainty_score":0.044417858},"labels":[],"label_agreement":null},{"id":"W4820853","doi":"","title":"Towards a Characterisation of Lottery Set Overlapping Structures.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Lottery; Cardinality (data modeling); Mathematics; Combinatorics; Set (abstract data type); Cardinal number (linguistics); Discrete mathematics; Computer science; Statistics","score_opus":0.028602432087535233,"score_gpt":0.28733000976383855,"score_spread":0.25872757767630333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4820853","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23928712,0.0006313722,0.72262007,0.0009748849,0.000092501825,0.00042708783,0.00082210597,0.00042994606,0.03471488],"genre_scores_gemma":[0.7299673,0.00029819703,0.2565135,0.0003165814,0.00015597542,0.0006839965,0.00088910054,0.00020053232,0.010974797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99595153,0.0012811357,0.0003309444,0.0007945863,0.0010919876,0.00054994755],"domain_scores_gemma":[0.9829623,0.009785343,0.0023367936,0.0028126505,0.0010394113,0.0010636284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040414752,0.000838437,0.0012611161,0.002660132,0.0022692916,0.0044316254,0.0029688356,0.0022565338,0.008672427],"category_scores_gemma":[0.022508932,0.0012184214,0.0018532216,0.0026597234,0.005388428,0.009313087,0.0045344695,0.0042093433,0.0012167756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018067578,0.00009062813,0.0010977604,0.000098472214,0.000019791594,0.000097810305,0.00064709707,0.016375272,0.0017740811,0.96472335,0.00094693527,0.013948235],"study_design_scores_gemma":[0.00004942823,0.00015339533,0.0006269327,0.00009015841,0.000025039428,0.00032114598,0.00021355267,0.12467348,0.002831526,0.86305475,0.0079065375,0.000054191012],"about_ca_topic_score_codex":0.0010612266,"about_ca_topic_score_gemma":0.00081124186,"teacher_disagreement_score":0.008672427,"about_ca_system_score_codex":0.0034252976,"about_ca_system_score_gemma":0.001885899,"threshold_uncertainty_score":0.029012144},"labels":[],"label_agreement":null},{"id":"W4892756","doi":"","title":"Strongly Regular Vertices and Partially Strong Regular Graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Strongly regular graph; Combinatorics; Graph; Pathwidth; Line graph","score_opus":0.03626204350800975,"score_gpt":0.3004805805962099,"score_spread":0.26421853708820014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4892756","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39984748,0.0052847946,0.16166474,0.0076263677,0.0006491961,0.000060169306,0.000738922,0.000496738,0.4236316],"genre_scores_gemma":[0.95913094,0.0013333119,0.012651752,0.00047022695,0.00030535343,0.000033078966,0.000368086,0.000058242833,0.025648957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931586,0.00022608519,0.000035708847,0.00015530402,0.00016030938,0.000106697255],"domain_scores_gemma":[0.99786806,0.0012425004,0.00024582792,0.0002901175,0.00016425423,0.0001891848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061738037,0.0003950444,0.00046465133,0.0011140779,0.0012067023,0.0025001087,0.0005313351,0.00069700344,0.0070340284],"category_scores_gemma":[0.0025594146,0.00032106106,0.0005286847,0.0011834133,0.0033276917,0.004111983,0.0019170858,0.0018420813,0.00090609555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001854512,0.00000696091,0.00024041953,0.000023863558,0.0000059651898,0.000051169576,0.00015417812,0.00029485062,0.00029797733,0.9942848,0.0009794094,0.0036417856],"study_design_scores_gemma":[0.0000052039195,0.000007502819,0.00019238994,0.000009504163,0.000007535115,0.000071802824,0.00011739674,0.0008086883,0.0002149274,0.9941817,0.004379623,0.0000037411003],"about_ca_topic_score_codex":0.0008805614,"about_ca_topic_score_gemma":0.0013889313,"teacher_disagreement_score":0.0070340284,"about_ca_system_score_codex":0.00091280637,"about_ca_system_score_gemma":0.000427682,"threshold_uncertainty_score":0.023531199},"labels":[],"label_agreement":null},{"id":"W49268","doi":"10.1111/j.1432-1033.1975.tb04105.x","title":"On the signed total chromatic number of a graph.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Friendship graph; Graph; Combinatorics; Discrete mathematics; Line graph; Graph power","score_opus":0.006953750136556667,"score_gpt":0.2111156864286416,"score_spread":0.20416193629208493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W49268","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65140957,0.002324704,0.23366137,0.0037528572,0.00075226807,0.0002077655,0.004542294,0.0006395009,0.10270968],"genre_scores_gemma":[0.9211341,0.0020404994,0.04744335,0.0004966366,0.0005505015,0.00030498544,0.0023802212,0.00022732977,0.025422389],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999166,0.00024816487,0.000043525284,0.0002206443,0.00019556598,0.00012615471],"domain_scores_gemma":[0.9960343,0.001910877,0.0008467453,0.0003476232,0.00039424148,0.00046623187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000999595,0.00095708325,0.00064540654,0.0048426306,0.0011743099,0.002991863,0.000863025,0.00092337374,0.015769234],"category_scores_gemma":[0.0045674513,0.00026717494,0.0004884637,0.0031447636,0.0032582718,0.0035537856,0.0015376433,0.0013070636,0.001341264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002468613,0.000038015725,0.0022161198,0.00026324877,0.000048582482,0.0001326806,0.00036392795,0.010908503,0.004134108,0.9414343,0.0065828175,0.03363083],"study_design_scores_gemma":[0.00004452161,0.00009943978,0.0028261258,0.00007510132,0.00003248126,0.00037145903,0.00019075011,0.035885178,0.0012518213,0.94375503,0.015424178,0.00004398161],"about_ca_topic_score_codex":0.001263649,"about_ca_topic_score_gemma":0.0018068512,"teacher_disagreement_score":0.015769234,"about_ca_system_score_codex":0.0019400397,"about_ca_system_score_gemma":0.00060518156,"threshold_uncertainty_score":0.05275339},"labels":[],"label_agreement":null},{"id":"W49550489","doi":"","title":"On the Supermagic Edge-splitting Extension of Graphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Extension (predicate logic); Enhanced Data Rates for GSM Evolution; Computer science; Telecommunications; Programming language","score_opus":0.011577351313636712,"score_gpt":0.21117517839126634,"score_spread":0.19959782707762963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W49550489","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.481928,0.0023650846,0.23509671,0.005893478,0.0004926106,0.00007355176,0.00072206534,0.00052465935,0.2729039],"genre_scores_gemma":[0.9213542,0.001215134,0.049985863,0.0012211925,0.00045166718,0.00007301227,0.0005862537,0.00014468044,0.02496809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957806,0.00013662623,0.000016329739,0.00008966133,0.00008618198,0.00009321045],"domain_scores_gemma":[0.99855524,0.00070812716,0.00012332531,0.00023626297,0.0001262812,0.00025076632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007960686,0.0003542695,0.0005038727,0.0012464776,0.0015200959,0.0016313912,0.000991367,0.0009707453,0.007291017],"category_scores_gemma":[0.0021295706,0.00030909595,0.0005140278,0.0013145924,0.0021122661,0.005294929,0.001985456,0.0023963843,0.0009332862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003633582,0.00002764083,0.00023741047,0.00003174106,0.0000035945952,0.000044763732,0.00013067597,0.0009704502,0.0006855393,0.9874314,0.0027844687,0.007616068],"study_design_scores_gemma":[0.000009411698,0.000009833365,0.0002302945,0.000014461571,0.0000045351635,0.00008789729,0.000086886845,0.004502232,0.0003172798,0.98905176,0.0056795343,0.0000060092843],"about_ca_topic_score_codex":0.0010062899,"about_ca_topic_score_gemma":0.001514477,"teacher_disagreement_score":0.007291017,"about_ca_system_score_codex":0.00092321576,"about_ca_system_score_gemma":0.00041511786,"threshold_uncertainty_score":0.024390876},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dominating set; Metric (unit); Combinatorics; Graph; Business","score_opus":0.012007642032539796,"score_gpt":0.2406084657575433,"score_spread":0.2286008237250035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W49590405","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25144118,0.009338003,0.6042835,0.013054961,0.0009400683,0.00035510186,0.0044431845,0.0013382917,0.11480568],"genre_scores_gemma":[0.8123201,0.0036343301,0.15500955,0.001272923,0.0005549342,0.00029104695,0.0026893776,0.0003168932,0.023910765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99781007,0.0008015006,0.00014959913,0.0005178399,0.0004110339,0.00030989564],"domain_scores_gemma":[0.9909196,0.005795097,0.0008027772,0.0011812778,0.0005653697,0.00073586754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019669114,0.00083638,0.0014068312,0.0018207672,0.002043809,0.0041337856,0.0021865924,0.0021451144,0.006902426],"category_scores_gemma":[0.012754906,0.00077613175,0.00079358765,0.0032641804,0.0024154636,0.007910434,0.0031568727,0.0026094648,0.0014325366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021739269,0.000114208495,0.0017708909,0.0005416741,0.00007395949,0.0001167982,0.00039024322,0.017676627,0.0022026298,0.89878964,0.023761619,0.054344278],"study_design_scores_gemma":[0.00003965344,0.00005404911,0.00064539496,0.00006539231,0.00004601477,0.00042627973,0.00035811996,0.02514388,0.0018449281,0.956732,0.01461871,0.000025466794],"about_ca_topic_score_codex":0.0011499982,"about_ca_topic_score_gemma":0.001767782,"teacher_disagreement_score":0.006902426,"about_ca_system_score_codex":0.002926011,"about_ca_system_score_gemma":0.0011543626,"threshold_uncertainty_score":0.023090899},"labels":[],"label_agreement":null},{"id":"W49934358","doi":"","title":"A Labeling Problem on the Plane Graphs Pa, b.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Plane (geometry); Geometry","score_opus":0.013584339763092201,"score_gpt":0.21483331260099922,"score_spread":0.20124897283790702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W49934358","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3279577,0.0028802322,0.44752026,0.019491062,0.00072298595,0.00029240453,0.0073797754,0.0010866115,0.19266888],"genre_scores_gemma":[0.72169966,0.0025744599,0.21733679,0.0020385291,0.0006341366,0.00032743262,0.007491981,0.00046573297,0.047431316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991615,0.00023228205,0.00004123994,0.00026822303,0.00014040773,0.00015632693],"domain_scores_gemma":[0.99614537,0.0024492238,0.00032051557,0.00053081027,0.00021298086,0.0003410888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076721306,0.0007201648,0.0008380513,0.0009809718,0.0020120677,0.0039036924,0.001380429,0.0025665446,0.01377295],"category_scores_gemma":[0.0048854407,0.000649131,0.0009344883,0.0022748953,0.0018352405,0.007124278,0.0021755819,0.0032293566,0.002045171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025219854,0.00016987692,0.0010857258,0.00025669564,0.0000325198,0.00010740459,0.0003248131,0.009407607,0.0025476934,0.8878733,0.0451899,0.05275231],"study_design_scores_gemma":[0.00006797598,0.00004335991,0.0008583621,0.00007110112,0.00003191176,0.00028193486,0.00042399063,0.026917204,0.0020353596,0.93856364,0.030681215,0.000023867413],"about_ca_topic_score_codex":0.0021990968,"about_ca_topic_score_gemma":0.0020072917,"teacher_disagreement_score":0.01377295,"about_ca_system_score_codex":0.0017611326,"about_ca_system_score_gemma":0.0011011227,"threshold_uncertainty_score":0.046075046},"labels":[],"label_agreement":null},{"id":"W50342112","doi":"","title":"The planar Ramsey numbers PR(K4-e, Kk-e).","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Ramsey's theorem; Planar; Combinatorics; Computer science; Computer graphics (images)","score_opus":0.01562545040079675,"score_gpt":0.22742869666525334,"score_spread":0.2118032462644566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W50342112","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4017607,0.0026249944,0.07456905,0.006674421,0.0005071189,0.00013331966,0.0035880858,0.0012605923,0.5088816],"genre_scores_gemma":[0.9452966,0.0007024367,0.0128221195,0.000580048,0.00014706865,0.000077525016,0.0010740729,0.000118113036,0.0391821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995753,0.000098565506,0.000023200368,0.000106396095,0.000097889824,0.000098497294],"domain_scores_gemma":[0.9985819,0.0007045569,0.00021633472,0.00020769342,0.00014408567,0.00014558544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048394292,0.0003439901,0.00031803473,0.0009402081,0.0014969029,0.0031037398,0.0005406499,0.00084203435,0.019736893],"category_scores_gemma":[0.0034499608,0.00032125428,0.00036646303,0.0008017817,0.0017387567,0.004639009,0.0018928006,0.0019247908,0.0031891116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002794047,0.000027457376,0.000539667,0.00013662079,0.000018733379,0.000118180535,0.00019539773,0.0013607413,0.001560312,0.9662437,0.01325042,0.016269341],"study_design_scores_gemma":[0.000055557684,0.000029973924,0.0011767795,0.000042030115,0.000027606691,0.00044552243,0.00028129248,0.0028968176,0.0028637894,0.9609622,0.031185973,0.000032417363],"about_ca_topic_score_codex":0.0007623368,"about_ca_topic_score_gemma":0.00087636156,"teacher_disagreement_score":0.019736893,"about_ca_system_score_codex":0.0008193475,"about_ca_system_score_gemma":0.00060429453,"threshold_uncertainty_score":0.06602645},"labels":[],"label_agreement":null},{"id":"W50680129","doi":"","title":"On H-chromatic uniqeness of two linear uniform cycles having some edges in common.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics","score_opus":0.009732626660648884,"score_gpt":0.23853471880727378,"score_spread":0.2288020921466249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W50680129","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79111755,0.0010638173,0.07790652,0.0033722678,0.00037716914,0.0001426492,0.0008380209,0.00021216027,0.124969855],"genre_scores_gemma":[0.9732011,0.00042340654,0.0114775365,0.0005586259,0.00025292285,0.00008860419,0.00056432566,0.000081866274,0.013351684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986125,0.00047111066,0.00006351629,0.00032706535,0.00017686897,0.00034879136],"domain_scores_gemma":[0.9920752,0.005027278,0.000949599,0.0006338538,0.0006863824,0.00062776153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013736017,0.00038265524,0.0006500581,0.0020290792,0.0029584006,0.0029802846,0.0011554615,0.0015824965,0.018582968],"category_scores_gemma":[0.009565396,0.00061024964,0.0006248325,0.0017483792,0.00375644,0.006719532,0.0028372868,0.0020671228,0.0010567326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006667286,0.00009844052,0.0028197672,0.00018955987,0.000044494816,0.0004565856,0.0011114347,0.0048311064,0.0045592575,0.9603022,0.006692576,0.018228032],"study_design_scores_gemma":[0.0001166984,0.00013622,0.003420282,0.00007184851,0.000056477213,0.0007399916,0.0018414104,0.021774441,0.0033206497,0.9575396,0.010912431,0.00006994347],"about_ca_topic_score_codex":0.0019040945,"about_ca_topic_score_gemma":0.0017133239,"teacher_disagreement_score":0.018582968,"about_ca_system_score_codex":0.0015757701,"about_ca_system_score_gemma":0.00061572593,"threshold_uncertainty_score":0.062166214},"labels":[],"label_agreement":null},{"id":"W51701293","doi":"","title":"Summation of Reciprocals Related to l-th Power of Generalized Fibonacci Sequences.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Mathematics; Pisano period; Pure mathematics; Discrete mathematics; Fibonacci polynomials","score_opus":0.00955232905023906,"score_gpt":0.2894562022199804,"score_spread":0.27990387316974136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W51701293","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22143884,0.0059862407,0.4212128,0.0014162257,0.0028029156,0.00013679986,0.0005398648,0.00093062414,0.34553567],"genre_scores_gemma":[0.8379691,0.0023330755,0.097814605,0.00093442085,0.0018083713,0.00023690895,0.00046420677,0.00049839343,0.057940803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99899524,0.00024748058,0.000076171724,0.00017297274,0.0003484103,0.00015962966],"domain_scores_gemma":[0.99821424,0.0006111823,0.0002305708,0.00026151925,0.0004582082,0.0002242307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010731228,0.0008576482,0.00083403377,0.0030863127,0.0017333736,0.0025365986,0.0011058347,0.0011810113,0.012962007],"category_scores_gemma":[0.005848597,0.00036522147,0.00083511777,0.0015554862,0.0017275681,0.003565376,0.001427345,0.0012850473,0.0030970383],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042091415,0.00001868417,0.00022840522,0.00011740867,0.000016657808,0.0003445254,0.00019161458,0.0006226884,0.004116055,0.97534263,0.0029424338,0.016016688],"study_design_scores_gemma":[0.000012591918,0.000033553126,0.0005593938,0.000058307454,0.000030463858,0.0016707677,0.000095794756,0.012574541,0.003614467,0.9677334,0.013571559,0.000045185945],"about_ca_topic_score_codex":0.00037635543,"about_ca_topic_score_gemma":0.00076631724,"teacher_disagreement_score":0.012962007,"about_ca_system_score_codex":0.00085533975,"about_ca_system_score_gemma":0.0006374339,"threshold_uncertainty_score":0.04336226},"labels":[],"label_agreement":null},{"id":"W51707718","doi":"","title":"Chirality group and chirality index of Coxeter chiral maps.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chirality (physics); Coxeter group; Mathematics; Group (periodic table); Pure mathematics; Index (typography); Combinatorics; Geometry; Physics; Chiral anomaly; Quantum mechanics; Computer science","score_opus":0.020132099651396205,"score_gpt":0.27802996554067316,"score_spread":0.25789786588927693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W51707718","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62827283,0.0012093544,0.033220876,0.0022954156,0.0008751337,0.00007448468,0.00048070814,0.0002638063,0.3333073],"genre_scores_gemma":[0.9723794,0.00050798815,0.0039904574,0.00025068028,0.00049364,0.000049633207,0.00020971824,0.000077919525,0.022040574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99953175,0.000103845865,0.000023854886,0.00006783142,0.00015065397,0.00012221352],"domain_scores_gemma":[0.9987294,0.00034772765,0.00027304844,0.00012078978,0.00017512187,0.00035390267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064035447,0.00050832797,0.0004840398,0.0031036364,0.0015525986,0.0031771604,0.000727592,0.00073635974,0.010392359],"category_scores_gemma":[0.0025973285,0.00031345984,0.00033778182,0.0009790713,0.0030818982,0.003556929,0.0017814857,0.0018125717,0.0014294588],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054045722,0.000027434447,0.00041011084,0.000015010345,0.0000041150433,0.000100610916,0.00015259023,0.0002721027,0.0013407787,0.9924117,0.0012335957,0.0039779055],"study_design_scores_gemma":[0.000023763403,0.000021539257,0.0005127019,0.000014563423,0.0000058890896,0.00019224022,0.00012451097,0.002557037,0.0010999395,0.9924913,0.00294264,0.000013825068],"about_ca_topic_score_codex":0.0006896523,"about_ca_topic_score_gemma":0.0007038359,"teacher_disagreement_score":0.010392359,"about_ca_system_score_codex":0.00090449635,"about_ca_system_score_gemma":0.0005653767,"threshold_uncertainty_score":0.03476596},"labels":[],"label_agreement":null},{"id":"W5172298","doi":"","title":"A note on the difference between the upper irredundance and independent numbers of a graph.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics; Discrete mathematics","score_opus":0.01351885570207717,"score_gpt":0.2309128043171936,"score_spread":0.21739394861511643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W5172298","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053714223,0.022469407,0.18405902,0.042579427,0.014594328,0.00005656929,0.0009864981,0.00079646637,0.6807441],"genre_scores_gemma":[0.80473167,0.011123368,0.11196988,0.012311048,0.008814594,0.00015766866,0.00062525127,0.00078615255,0.049480367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99807054,0.000586055,0.000116923955,0.00050694,0.00054056273,0.0001789719],"domain_scores_gemma":[0.9892764,0.007961804,0.00040785875,0.0014945441,0.00043118486,0.0004282612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021696773,0.0007272949,0.0009148825,0.0019644706,0.0020811756,0.003732144,0.00214935,0.0018735594,0.009638749],"category_scores_gemma":[0.013497007,0.00046286514,0.00082250906,0.002185954,0.007961603,0.009196434,0.00354464,0.007883051,0.0015554862],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052445448,0.000012827306,0.00019542573,0.000057266603,0.0000069204193,0.000068736175,0.00012656524,0.0002497084,0.0005701427,0.98333365,0.0077743065,0.0075521055],"study_design_scores_gemma":[0.000007284912,0.000014283448,0.00035484636,0.000018674024,0.0000081398675,0.00015273721,0.00004120738,0.00065544056,0.0003771942,0.98209506,0.016262297,0.000012736983],"about_ca_topic_score_codex":0.0010029953,"about_ca_topic_score_gemma":0.0015381646,"teacher_disagreement_score":0.009638749,"about_ca_system_score_codex":0.001316643,"about_ca_system_score_gemma":0.00051137904,"threshold_uncertainty_score":0.03224486},"labels":[],"label_agreement":null},{"id":"W526827","doi":"10.1136/bmj.2.6203.1507","title":"On weight distributions of codes of planes of order 9.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Order (exchange); Business","score_opus":0.010940128916950304,"score_gpt":0.2132957907862825,"score_spread":0.20235566186933218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W526827","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88890773,0.0011036079,0.08101104,0.0017247731,0.00009271904,0.000061969164,0.0010234801,0.00020740082,0.025867352],"genre_scores_gemma":[0.9860751,0.0009220644,0.005502153,0.00019801792,0.00021647118,0.000091068214,0.0007480591,0.00013094403,0.006116072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998638,0.00036213806,0.00004810903,0.00018113475,0.00036667805,0.0004039326],"domain_scores_gemma":[0.9896932,0.0060443394,0.001523508,0.000868438,0.00088290335,0.0009877121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001648523,0.00074118236,0.0007104997,0.00358505,0.0011660029,0.0029749575,0.0014791433,0.0011308964,0.005857936],"category_scores_gemma":[0.01499862,0.0005294078,0.00042487693,0.0024194517,0.0027060118,0.0046124524,0.0022028533,0.0022261133,0.0008886111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028195704,0.000058442776,0.0029330838,0.00005748345,0.000018777382,0.00010422437,0.00040526147,0.008388633,0.002530769,0.9676981,0.0031960784,0.01432719],"study_design_scores_gemma":[0.00004924384,0.000050247236,0.0022979076,0.00007836551,0.000017290486,0.00024579576,0.00021902114,0.049665794,0.002018365,0.9425502,0.0027690788,0.000038725433],"about_ca_topic_score_codex":0.0015418996,"about_ca_topic_score_gemma":0.0013711851,"teacher_disagreement_score":0.005857936,"about_ca_system_score_codex":0.0019670657,"about_ca_system_score_gemma":0.00075877376,"threshold_uncertainty_score":0.019596756},"labels":[],"label_agreement":null},{"id":"W52694867","doi":"","title":"Cops, Robber, and Alarms.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Information and Cyber Security","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.005027234274064227,"score_gpt":0.20163639624847682,"score_spread":0.19660916197441258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W52694867","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06276703,0.026832193,0.183453,0.02788467,0.003451093,0.000104224426,0.0014710396,0.00095298595,0.69308376],"genre_scores_gemma":[0.7608241,0.008471686,0.02998235,0.0029221391,0.0016367097,0.00014721639,0.0010803073,0.0003194683,0.19461603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876606,0.0003079483,0.00007112932,0.00038336992,0.0002627591,0.00020874175],"domain_scores_gemma":[0.9970067,0.0012105701,0.00046307506,0.00047986148,0.00045080233,0.00038905643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008145568,0.0010709403,0.00075964275,0.0022629737,0.0038019756,0.004111485,0.001024018,0.0020671033,0.031959828],"category_scores_gemma":[0.0076547684,0.0005872362,0.00093863416,0.001981966,0.005147827,0.008232967,0.0027585155,0.0029123528,0.004183869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039541403,0.000016539145,0.0004840786,0.000065577115,0.000015451076,0.00012023899,0.00013535914,0.0008242244,0.00009257085,0.9663245,0.018128788,0.013753112],"study_design_scores_gemma":[0.000011023226,0.000018643686,0.00084172684,0.000063997504,0.00002040661,0.00038368578,0.0002581814,0.0025626007,0.00017942587,0.93188596,0.06375583,0.00001853756],"about_ca_topic_score_codex":0.0047493447,"about_ca_topic_score_gemma":0.006772718,"teacher_disagreement_score":0.031959828,"about_ca_system_score_codex":0.002030073,"about_ca_system_score_gemma":0.0010660767,"threshold_uncertainty_score":0.10691631},"labels":[],"label_agreement":null},{"id":"W52787789","doi":"","title":"A Characterization of the Generalized Lah Matrix.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Characterization (materials science); Matrix (chemical analysis); Pure mathematics; Materials science; Composite material; Nanotechnology","score_opus":0.010083486272936069,"score_gpt":0.24532784251585396,"score_spread":0.2352443562429179,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W52787789","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15574723,0.0029592046,0.5746195,0.0036053208,0.0012327674,0.00015345337,0.0020499122,0.0009927533,0.2586399],"genre_scores_gemma":[0.86894447,0.0014650276,0.06084802,0.0017620742,0.0015014232,0.0001777181,0.0013108973,0.00038632195,0.063604124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954236,0.00011168141,0.000021831664,0.00009552226,0.0001524409,0.00007631984],"domain_scores_gemma":[0.99878913,0.00031788796,0.00019518372,0.00018024261,0.00029071144,0.00022682425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004060018,0.0005462041,0.0004350098,0.0019366357,0.0007555445,0.0019547215,0.0007958562,0.00079294597,0.01849081],"category_scores_gemma":[0.0028154603,0.00021690279,0.00040616983,0.0010197612,0.0016893985,0.00192638,0.001192259,0.0016088332,0.005012417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025308396,0.000018077319,0.00024273978,0.00004938773,0.000008166406,0.00011599428,0.00009759643,0.0010204694,0.0027666816,0.9754193,0.005923965,0.014312358],"study_design_scores_gemma":[0.000011361326,0.000029824572,0.00043128923,0.000022235552,0.0000053992417,0.00035841385,0.00007815011,0.0144203855,0.00080760644,0.9695693,0.014238764,0.00002733231],"about_ca_topic_score_codex":0.0008743178,"about_ca_topic_score_gemma":0.001200209,"teacher_disagreement_score":0.01849081,"about_ca_system_score_codex":0.00052030024,"about_ca_system_score_gemma":0.0005422183,"threshold_uncertainty_score":0.06185794},"labels":[],"label_agreement":null},{"id":"W52813985","doi":"","title":"Hamiltonian Cycles in N 2 -Locally Connected Claw-Free Graphs.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Claw; Mathematics; Combinatorics; Hamiltonian (control theory); Mathematical optimization; Structural engineering","score_opus":0.018901733731783367,"score_gpt":0.2569798225516237,"score_spread":0.23807808881984036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W52813985","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89955443,0.0014395036,0.035099614,0.0010435992,0.00012761369,0.00011962043,0.0006782655,0.00031381362,0.06162349],"genre_scores_gemma":[0.9621682,0.00047530877,0.010034119,0.00023226482,0.000038748258,0.0001061148,0.00062722986,0.00006418988,0.026253782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997875,0.00004553657,0.000012322076,0.000051402832,0.0000417928,0.000061481835],"domain_scores_gemma":[0.99916875,0.0003349856,0.00017851456,0.000057246958,0.000079503705,0.00018102356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015684514,0.00042557635,0.00036229068,0.0012198433,0.0013764749,0.0011608358,0.00082155416,0.0010211733,0.010380053],"category_scores_gemma":[0.0013031699,0.00039585071,0.00027634358,0.0008696346,0.0009486796,0.0017021544,0.0012267043,0.0007007422,0.0010167955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006361624,0.00021394526,0.0049062665,0.00070899056,0.000110814275,0.0027665896,0.002204422,0.022084601,0.023701869,0.8394959,0.017327817,0.08584259],"study_design_scores_gemma":[0.000112420115,0.00009935309,0.0032792513,0.00012569258,0.000059969574,0.00094388996,0.0011056897,0.03155687,0.0057195765,0.9427453,0.014206527,0.00004546517],"about_ca_topic_score_codex":0.0024691913,"about_ca_topic_score_gemma":0.0069774967,"teacher_disagreement_score":0.010380053,"about_ca_system_score_codex":0.00068318,"about_ca_system_score_gemma":0.00043952148,"threshold_uncertainty_score":0.034724772},"labels":[],"label_agreement":null},{"id":"W52999166","doi":"","title":"Path Decompositions of lKn, n.","year":2007,"lang":"it","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Path (computing); Mathematics; Arithmetic; Computer science; Operating system","score_opus":0.006374199842404352,"score_gpt":0.21563062262925406,"score_spread":0.2092564227868497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W52999166","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28110063,0.0011018637,0.39667344,0.0014436693,0.00042163467,0.00031753245,0.0068447506,0.0011252249,0.3109713],"genre_scores_gemma":[0.66536355,0.0010119833,0.17158796,0.0006146928,0.00012962888,0.00034464273,0.008851074,0.00067113125,0.15142542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965,0.000057120866,0.000020875232,0.00008763726,0.00008132088,0.00010311077],"domain_scores_gemma":[0.9992449,0.0002218425,0.0000935051,0.00011109959,0.00021221985,0.000116344454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002821392,0.00044691117,0.00023129245,0.0016539863,0.0010587969,0.0018005479,0.0004977686,0.00050564687,0.019890208],"category_scores_gemma":[0.0013888003,0.00027313695,0.0003430767,0.0009923083,0.00064268766,0.0018343141,0.0010426522,0.0009475839,0.004220597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016372492,0.00009736629,0.00091370876,0.00016791682,0.000019010988,0.00033687853,0.0005726897,0.0031721643,0.0072395424,0.92061573,0.017948762,0.048752494],"study_design_scores_gemma":[0.000026338586,0.000029278091,0.001518283,0.000085362095,0.000022172462,0.00041518832,0.00053083774,0.012806367,0.0027529886,0.9281181,0.05367588,0.00001905507],"about_ca_topic_score_codex":0.0023921395,"about_ca_topic_score_gemma":0.005354944,"teacher_disagreement_score":0.019890208,"about_ca_system_score_codex":0.0010894155,"about_ca_system_score_gemma":0.0006808275,"threshold_uncertainty_score":0.06653941},"labels":[],"label_agreement":null},{"id":"W53180385","doi":"","title":"A Geometric Approach to the Reflections of Regular Maps.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematics and Applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Geometry; Pure mathematics","score_opus":0.07094419258264875,"score_gpt":0.31242705094567463,"score_spread":0.24148285836302588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W53180385","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035798445,0.006723743,0.56679404,0.0038279942,0.0017336989,0.000064380576,0.000238814,0.0006163184,0.3842027],"genre_scores_gemma":[0.646824,0.005324679,0.21482792,0.001518276,0.0019790677,0.0001588084,0.0004392479,0.00066128536,0.12826677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992354,0.00025635562,0.000038129125,0.00013843112,0.00023787383,0.000093895236],"domain_scores_gemma":[0.9992549,0.00025121478,0.00007925362,0.00017232772,0.00015040656,0.00009186123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072522165,0.00064370554,0.00047928077,0.001977584,0.0015181147,0.002991085,0.0012118061,0.0009906688,0.012502014],"category_scores_gemma":[0.0027293232,0.00041610835,0.00079262105,0.001078531,0.004465933,0.0059472118,0.0028968567,0.0039002318,0.0029207978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005606968,0.0000044764074,0.000033460707,0.000012309423,0.0000022819863,0.000027870788,0.00013347433,0.00023818504,0.0002119834,0.99332845,0.0012614836,0.0047403798],"study_design_scores_gemma":[0.0000050056337,0.000019211866,0.00006858598,0.000012668815,0.000004222908,0.00014494294,0.00017509937,0.0015933054,0.00030289186,0.97483057,0.022837015,0.000006530059],"about_ca_topic_score_codex":0.0008698617,"about_ca_topic_score_gemma":0.0009475978,"teacher_disagreement_score":0.012502014,"about_ca_system_score_codex":0.00095101586,"about_ca_system_score_gemma":0.00050774013,"threshold_uncertainty_score":0.041823387},"labels":[],"label_agreement":null},{"id":"W54024878","doi":"","title":"Existence of HSOLSSOMs with type h n and 1 n u 1 .","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Type (biology); Pure mathematics; Combinatorics; Geology; Paleontology","score_opus":0.005438531868843801,"score_gpt":0.17781141596049524,"score_spread":0.17237288409165144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W54024878","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76556313,0.0005013015,0.048878502,0.0017834867,0.00042223526,0.00006037752,0.0013322014,0.00037327717,0.18108542],"genre_scores_gemma":[0.9561897,0.00019152527,0.011993949,0.00022057988,0.00010318779,0.00003697304,0.00070534355,0.00006024093,0.030498654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995208,0.00009437098,0.000026450582,0.00009442933,0.00011259421,0.00015134542],"domain_scores_gemma":[0.99762887,0.0009701372,0.0004150021,0.00028344334,0.00028365504,0.00041887374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030174712,0.0002770247,0.00030179028,0.0013120034,0.0018539291,0.0019448809,0.00051331735,0.00093825243,0.0145945335],"category_scores_gemma":[0.0025331585,0.00041097665,0.0003829603,0.0006900536,0.001258106,0.0017522357,0.0017356194,0.00095568824,0.0015626402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029664682,0.00006879556,0.005387409,0.00012179713,0.000024393135,0.00045937888,0.0006168433,0.00080985,0.0071216687,0.9624663,0.007927132,0.014699697],"study_design_scores_gemma":[0.00007500697,0.0001011283,0.0069410177,0.00008324841,0.000042352676,0.0012814424,0.0015657824,0.007779486,0.01198863,0.9383915,0.031699315,0.00005118061],"about_ca_topic_score_codex":0.00068829185,"about_ca_topic_score_gemma":0.0014155626,"teacher_disagreement_score":0.0145945335,"about_ca_system_score_codex":0.00074997655,"about_ca_system_score_gemma":0.0005979745,"threshold_uncertainty_score":0.048823535},"labels":[],"label_agreement":null},{"id":"W54538453","doi":"","title":"The Basis Number of the Direct Product of a Theta Graph and a Path.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Direct product; Graph; Combinatorics; Path (computing); Basis (linear algebra); Product (mathematics); Discrete mathematics; Computer science; Geometry","score_opus":0.007262431607025712,"score_gpt":0.2159267809290735,"score_spread":0.20866434932204778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W54538453","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.601651,0.0014883868,0.12175809,0.003907292,0.0010723813,0.000086677814,0.0036812043,0.0007633684,0.26559153],"genre_scores_gemma":[0.92835015,0.00072565256,0.032500006,0.0003291068,0.00025325626,0.00010980317,0.0014312138,0.00030143955,0.035999455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933714,0.00017003219,0.00003245721,0.00015418719,0.00011133916,0.00019485455],"domain_scores_gemma":[0.99823415,0.00079002517,0.00019982974,0.0002464955,0.00021989513,0.00030959418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006556479,0.0004928384,0.00069268065,0.0019313856,0.0021339557,0.0038348802,0.0011000234,0.001189974,0.01787338],"category_scores_gemma":[0.0028511432,0.00039829867,0.0005792798,0.001310496,0.0022656757,0.004524175,0.0016986552,0.00208316,0.004004228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017492892,0.000030954125,0.0009561859,0.00008770255,0.000012309401,0.000055253364,0.00017778162,0.0011462042,0.002614997,0.9714588,0.007320517,0.015964469],"study_design_scores_gemma":[0.000024162593,0.000038005302,0.0009969809,0.000046512385,0.000021378859,0.00027996307,0.00025771465,0.005241499,0.003577862,0.9731976,0.016291494,0.000026808755],"about_ca_topic_score_codex":0.0011469737,"about_ca_topic_score_gemma":0.0014205823,"teacher_disagreement_score":0.01787338,"about_ca_system_score_codex":0.0011288734,"about_ca_system_score_gemma":0.00080039166,"threshold_uncertainty_score":0.0597924},"labels":[],"label_agreement":null},{"id":"W54544480","doi":"","title":"Edge-added Eccentricities of Vertices in a Graph.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Graph; Computer science; Artificial intelligence","score_opus":0.022744686622149853,"score_gpt":0.26096908762655074,"score_spread":0.2382244010044009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W54544480","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72602206,0.0009271905,0.15721132,0.00084232667,0.0005745922,0.00008622045,0.0017055775,0.00078909786,0.11184158],"genre_scores_gemma":[0.92169297,0.0005137525,0.0556667,0.00014816194,0.00017262732,0.000057247104,0.00068222446,0.00018567355,0.020880628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992493,0.00014702178,0.00005040128,0.0002046337,0.00022551522,0.00012319749],"domain_scores_gemma":[0.9966149,0.0013629969,0.00046702483,0.00059996464,0.0005675702,0.00038760202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005695582,0.00048314256,0.00051046856,0.0023663277,0.0013362729,0.0016128455,0.0009773993,0.001018172,0.011964863],"category_scores_gemma":[0.0073323064,0.00037194506,0.00027863283,0.0017195761,0.0010269769,0.0028321794,0.0017737241,0.001055006,0.0024906276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015152154,0.00022992186,0.019141307,0.00069461117,0.00013174624,0.0029366242,0.0012245524,0.020505507,0.059416037,0.69798565,0.0133188935,0.18289992],"study_design_scores_gemma":[0.000140077,0.00020951264,0.016073886,0.00031804197,0.00022914808,0.0063738828,0.001169687,0.054946583,0.052152563,0.8127396,0.055538315,0.0001087439],"about_ca_topic_score_codex":0.00034234385,"about_ca_topic_score_gemma":0.0007341103,"teacher_disagreement_score":0.011964863,"about_ca_system_score_codex":0.00045107928,"about_ca_system_score_gemma":0.00022304922,"threshold_uncertainty_score":0.040026426},"labels":[],"label_agreement":null},{"id":"W55235417","doi":"","title":"On the connectivity of generalized p-cycles.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Digraph; Mathematics; Combinatorics; Degree (music); Upper and lower bounds; Order (exchange); Enhanced Data Rates for GSM Evolution; Set (abstract data type); Discrete mathematics; Mathematical analysis; Physics; Computer science","score_opus":0.025808839045729174,"score_gpt":0.28955243720565654,"score_spread":0.2637435981599274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W55235417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42870396,0.007453261,0.44679436,0.003934297,0.00025688147,0.0004234973,0.0017938734,0.0003800512,0.11025976],"genre_scores_gemma":[0.9012997,0.006599808,0.08139881,0.0007102534,0.0004982794,0.00063434395,0.0016766584,0.00016916475,0.007012918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991441,0.00025414536,0.000045746016,0.00023746566,0.00017435652,0.00014418356],"domain_scores_gemma":[0.9928845,0.00542083,0.00058179063,0.00038918544,0.00042086275,0.00030284686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064557017,0.0008528584,0.00072383,0.0019144716,0.0014969804,0.0014674243,0.0009854115,0.0012436978,0.005900305],"category_scores_gemma":[0.009356504,0.0005517356,0.0005756897,0.0025330586,0.0021561175,0.0046599866,0.0018971259,0.0013213872,0.00055642077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000392293,0.00008670556,0.003971332,0.00084547285,0.00009879909,0.0013024056,0.00094214175,0.08061947,0.009856246,0.8191859,0.010826197,0.07187301],"study_design_scores_gemma":[0.00007441062,0.00016746926,0.0024373527,0.0002036196,0.000074040836,0.001710123,0.00041084772,0.09129461,0.0040706643,0.88163817,0.017867666,0.000051150553],"about_ca_topic_score_codex":0.0019269346,"about_ca_topic_score_gemma":0.0018772163,"teacher_disagreement_score":0.005900305,"about_ca_system_score_codex":0.0011466766,"about_ca_system_score_gemma":0.00064359297,"threshold_uncertainty_score":0.019738436},"labels":[],"label_agreement":null},{"id":"W55321067","doi":"","title":"On the Hull Number of the Composition of Graphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hull; Composition (language); Combinatorics; Composite material; Art; Materials science; Literature","score_opus":0.009428213206039138,"score_gpt":0.2249279782758415,"score_spread":0.21549976506980234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W55321067","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4984594,0.0021681031,0.25714707,0.007835362,0.00073506904,0.0001233761,0.0017920259,0.00084059,0.23089904],"genre_scores_gemma":[0.88689315,0.0010612021,0.07039122,0.0006287055,0.0006681563,0.00014568609,0.0015819491,0.00044128567,0.03818851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834013,0.00055497745,0.000076855526,0.0003308525,0.00035395604,0.0003432368],"domain_scores_gemma":[0.9887051,0.00797539,0.0008745137,0.0009009823,0.0005434116,0.0010005775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018910032,0.00066720543,0.0011502962,0.0027347966,0.002835002,0.0045717694,0.0019686392,0.0020477937,0.017589025],"category_scores_gemma":[0.012699646,0.00075616257,0.0008857918,0.0020050127,0.004276417,0.0121801365,0.0029445565,0.003748361,0.0023598112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028973338,0.0000700051,0.0016207591,0.00012767913,0.000020565783,0.00009565643,0.0002758966,0.0069593033,0.0012139961,0.9589759,0.010861267,0.019489307],"study_design_scores_gemma":[0.000031684245,0.0000316334,0.0009437534,0.000044999677,0.000021986627,0.00016751217,0.00023088037,0.030660158,0.0016504045,0.96012604,0.0060704774,0.000020432048],"about_ca_topic_score_codex":0.0017206135,"about_ca_topic_score_gemma":0.002222563,"teacher_disagreement_score":0.017589025,"about_ca_system_score_codex":0.00239079,"about_ca_system_score_gemma":0.0008085851,"threshold_uncertainty_score":0.05884117},"labels":[],"label_agreement":null},{"id":"W55585612","doi":"","title":"On the Non-Existence of (g, g\\lambda-1;lambda)-Difference matrices.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Lambda; Mathematics; Pure mathematics; Combinatorics; Physics; Quantum mechanics","score_opus":0.011237856145784781,"score_gpt":0.1841631365943014,"score_spread":0.1729252804485166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W55585612","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5008687,0.0021115178,0.32462755,0.010521688,0.0008451102,0.00013077787,0.00050946086,0.0003937794,0.15999147],"genre_scores_gemma":[0.9562348,0.0007463804,0.028933315,0.0011552611,0.00033662125,0.000100300866,0.00022531826,0.00010046046,0.012167634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978137,0.0008305919,0.000095589785,0.00041182427,0.000421474,0.00042674853],"domain_scores_gemma":[0.96518433,0.02826165,0.0018251835,0.001982921,0.0014739501,0.001272072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025296153,0.00041667954,0.00072798657,0.0014067513,0.0022955693,0.0029291124,0.0014343562,0.0021274164,0.007884973],"category_scores_gemma":[0.027343016,0.0007415115,0.0005184806,0.0008191488,0.0040412336,0.0072615263,0.00355734,0.0041757054,0.0010423696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013836719,0.00004165073,0.00078317715,0.00006721578,0.000015515532,0.00018828994,0.00024156047,0.0019081373,0.0018072232,0.9858283,0.0033050894,0.0056755734],"study_design_scores_gemma":[0.000043988537,0.000035050623,0.0004226844,0.00003248368,0.000012567963,0.0004109856,0.00013658154,0.016291475,0.001329082,0.9790206,0.0022432248,0.000021433249],"about_ca_topic_score_codex":0.0006483124,"about_ca_topic_score_gemma":0.0009529373,"teacher_disagreement_score":0.007884973,"about_ca_system_score_codex":0.0009547339,"about_ca_system_score_gemma":0.0007477746,"threshold_uncertainty_score":0.026377857},"labels":[],"label_agreement":null},{"id":"W55845620","doi":"","title":"The problem of outer-embeddings in pseodosurfaces.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.005093859680975301,"score_gpt":0.22716158544862936,"score_spread":0.22206772576765405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W55845620","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3345282,0.0020372528,0.41954085,0.0053038513,0.0011796581,0.000114970346,0.0010272551,0.00078447873,0.23548336],"genre_scores_gemma":[0.878022,0.0011323628,0.054525755,0.0005678328,0.00043160253,0.000085546046,0.0008598483,0.00064059277,0.06373446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994417,0.00013808506,0.0000350672,0.0001105512,0.00014991908,0.00012478934],"domain_scores_gemma":[0.9989127,0.00044064462,0.00011965318,0.00019169967,0.00017660757,0.0001586767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082739134,0.0007530517,0.000667581,0.0011524096,0.0018265907,0.0029708375,0.0010664419,0.0014479588,0.015579864],"category_scores_gemma":[0.0047462177,0.0003856474,0.0006477501,0.00068404747,0.0028619205,0.0066887406,0.0036771984,0.0032064875,0.0021632367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004120681,0.000017877272,0.00032112212,0.00006170686,0.000006235019,0.000081002436,0.00016446093,0.0019830088,0.00048631348,0.9827383,0.003042455,0.011056379],"study_design_scores_gemma":[0.000008558146,0.000011780063,0.00015072885,0.000022010909,0.0000046924843,0.000090797475,0.00021239824,0.008137127,0.00052504084,0.98352987,0.0072994535,0.000007567866],"about_ca_topic_score_codex":0.0010879138,"about_ca_topic_score_gemma":0.0011330438,"teacher_disagreement_score":0.015579864,"about_ca_system_score_codex":0.00085679255,"about_ca_system_score_gemma":0.00053400506,"threshold_uncertainty_score":0.05211979},"labels":[],"label_agreement":null},{"id":"W5638217","doi":"10.1080/00039896.1968.10665029","title":"Domination Graphs of Extended Rotational Tournaments: Chords and Cycles.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.034540080034856174,"score_gpt":0.35806628137791363,"score_spread":0.32352620134305743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W5638217","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71951187,0.0018004433,0.18391313,0.0012707649,0.00016926475,0.00017798138,0.0014215871,0.00024892198,0.09148604],"genre_scores_gemma":[0.9768753,0.0004942533,0.013453475,0.0001423233,0.00008523602,0.00006293325,0.0006066172,0.000028137758,0.008251764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999225,0.00026576864,0.000035588386,0.00016673048,0.00012566838,0.0001811811],"domain_scores_gemma":[0.995852,0.002285226,0.0007079728,0.0003940128,0.00029461127,0.0004660798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006195779,0.00043391992,0.00061500043,0.0009408094,0.00080820645,0.0030989852,0.001120594,0.00079925754,0.0077409567],"category_scores_gemma":[0.005599873,0.00033590014,0.00049398345,0.0011370128,0.0012499886,0.0030405803,0.0011421313,0.000890701,0.0003993983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047206643,0.00012293573,0.0056026834,0.00021926138,0.00010457288,0.00051833456,0.00057715806,0.031154621,0.0034015814,0.88641596,0.008266883,0.06314397],"study_design_scores_gemma":[0.00011461463,0.00007775506,0.0042680986,0.000055613993,0.00006753505,0.0007600854,0.00038330606,0.07367427,0.0009673096,0.90556186,0.014038696,0.000030929416],"about_ca_topic_score_codex":0.0019630857,"about_ca_topic_score_gemma":0.0023392653,"teacher_disagreement_score":0.0077409567,"about_ca_system_score_codex":0.00090626907,"about_ca_system_score_gemma":0.00047240322,"threshold_uncertainty_score":0.025896013},"labels":[],"label_agreement":null},{"id":"W5642064","doi":"10.1016/s0002-7138(09)61534-x","title":"Halving complete 4-partite graphs","year":2000,"lang":"sv","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Spectrum (functional analysis); Set (abstract data type); Finite set; Discrete mathematics; Physics; Mathematical analysis; Computer science","score_opus":0.009989280154877843,"score_gpt":0.20194056415638015,"score_spread":0.1919512840015023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W5642064","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8991708,0.00023551138,0.080789,0.00021449325,0.000027626224,0.00002911373,0.00033417705,0.00017965678,0.019019574],"genre_scores_gemma":[0.9645515,0.00019207619,0.026960308,0.00009629456,0.000030581155,0.00004226845,0.0007181036,0.00009045701,0.0073184352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965405,0.00006708671,0.000014353006,0.00007723113,0.00008827932,0.00009897635],"domain_scores_gemma":[0.99864095,0.0006642663,0.00013523649,0.00023065947,0.00013883384,0.00019007361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029382686,0.0004899652,0.0005577113,0.0008091196,0.0009255939,0.0011821019,0.0006113368,0.0005148835,0.0046402467],"category_scores_gemma":[0.0015696812,0.00036052422,0.0006413174,0.00038958417,0.0012130805,0.0015630532,0.0012213505,0.0008456962,0.00067313627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010166974,0.00019953838,0.00856384,0.0003730003,0.00012787699,0.0012568888,0.0021448492,0.19327782,0.057623435,0.67394555,0.007316062,0.054154433],"study_design_scores_gemma":[0.000058764905,0.00012491221,0.0016910593,0.00004554553,0.000032767693,0.0004447153,0.000760305,0.2048286,0.025073737,0.76056224,0.00634755,0.000029872821],"about_ca_topic_score_codex":0.00089217647,"about_ca_topic_score_gemma":0.0018525948,"teacher_disagreement_score":0.0046402467,"about_ca_system_score_codex":0.00038894237,"about_ca_system_score_gemma":0.00029746827,"threshold_uncertainty_score":0.015523195},"labels":[],"label_agreement":null},{"id":"W56528681","doi":"","title":"Some Classes of Extended Meldelsohn Triple Systems and Numbers of Common Blocks.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arithmetic","score_opus":0.00830150240946874,"score_gpt":0.2123668151098502,"score_spread":0.20406531270038145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W56528681","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48455766,0.0017973913,0.12721384,0.0014167129,0.0003987234,0.00015113693,0.0014528807,0.00043444266,0.38257718],"genre_scores_gemma":[0.9277383,0.0006649017,0.02293427,0.00034971125,0.00024916578,0.00017076754,0.00089726684,0.0001043693,0.046891235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940264,0.00012107737,0.000032614735,0.0001281546,0.0001452244,0.00017022081],"domain_scores_gemma":[0.99843377,0.0005698609,0.00026774537,0.00023607748,0.00022306733,0.00026945907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004500141,0.0003743152,0.0004400958,0.0021112242,0.0017436608,0.0030235758,0.0007975051,0.0009440198,0.017032037],"category_scores_gemma":[0.0021899524,0.00035247038,0.00060123706,0.0015637715,0.0018175185,0.003993831,0.001553346,0.0014592557,0.001734303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025314912,0.000010430965,0.00019541867,0.000018815961,0.000004416386,0.000057210393,0.00010435568,0.000384008,0.00039791325,0.993465,0.0013495384,0.0039876495],"study_design_scores_gemma":[0.000014440176,0.000015372485,0.0003397745,0.000021153399,0.000007580552,0.00016482905,0.00015124236,0.0032784063,0.0004942281,0.98578185,0.009718967,0.000012154955],"about_ca_topic_score_codex":0.0011644035,"about_ca_topic_score_gemma":0.001674511,"teacher_disagreement_score":0.017032037,"about_ca_system_score_codex":0.0013423656,"about_ca_system_score_gemma":0.00055468845,"threshold_uncertainty_score":0.05697781},"labels":[],"label_agreement":null},{"id":"W5683130","doi":"","title":"On K*-ultrahomogeneous graphs","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Cograph; Indifference graph; Disjoint sets; Clique-sum; Chordal graph; Pathwidth; Discrete mathematics; 1-planar graph; Graph isomorphism; Isomorphism (crystallography); Class (philosophy); Automorphism; Odd graph; Graph; Line graph; Computer science; Chemistry","score_opus":0.0386102489818952,"score_gpt":0.32439358389358147,"score_spread":0.2857833349116863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W5683130","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9704283,0.000167102,0.014400802,0.000237237,0.000016520758,0.000017197328,0.00012990952,0.00004280013,0.014560081],"genre_scores_gemma":[0.9962329,0.0001013217,0.0019452653,0.000044727214,0.000025986423,0.000013975775,0.0001353048,0.000009460026,0.0014910316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995778,0.00008461247,0.00001956756,0.00012496067,0.00006983502,0.0001232374],"domain_scores_gemma":[0.99856657,0.00050786784,0.000370675,0.00018389791,0.000096394535,0.00027457418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003000846,0.00027051373,0.0003538,0.0014731825,0.0015311139,0.0012384345,0.00044938762,0.00043526344,0.0032959073],"category_scores_gemma":[0.001116764,0.00022830458,0.00034797817,0.0011236458,0.0019265118,0.0026160507,0.0017442028,0.00060057273,0.00018708484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026864305,0.00007759465,0.01014153,0.00010858022,0.00003047789,0.00057813054,0.0010038443,0.0069809314,0.008200999,0.952205,0.0011937153,0.019210622],"study_design_scores_gemma":[0.000042263164,0.00009924351,0.009453677,0.000060596198,0.000043301487,0.0009887785,0.0013589379,0.028977316,0.0053737178,0.94418925,0.009381699,0.00003117616],"about_ca_topic_score_codex":0.00090134935,"about_ca_topic_score_gemma":0.0009655668,"teacher_disagreement_score":0.0032959073,"about_ca_system_score_codex":0.000862293,"about_ca_system_score_gemma":0.00021653084,"threshold_uncertainty_score":0.011025906},"labels":[],"label_agreement":null},{"id":"W57158432","doi":"","title":"Skolem arrays and skolem labellings of ladder graphs.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Discrete mathematics","score_opus":0.013727473020705244,"score_gpt":0.2033244794500878,"score_spread":0.18959700642938257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W57158432","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22411466,0.002786851,0.4643023,0.005462559,0.00091161334,0.00012209947,0.0018851295,0.0020957878,0.29831898],"genre_scores_gemma":[0.80134076,0.001514446,0.12296731,0.0013329795,0.00047199652,0.00020873609,0.0016896398,0.00068681437,0.0697873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898154,0.0003510805,0.00006562147,0.00019020464,0.00019590861,0.00021565962],"domain_scores_gemma":[0.99736965,0.0013090777,0.00030890302,0.0005204932,0.00025689363,0.0002348982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008318773,0.00047339697,0.0006443964,0.0017419951,0.002398252,0.0033025746,0.0013737973,0.0015708661,0.013728136],"category_scores_gemma":[0.0040202397,0.0006653747,0.00078719924,0.002420269,0.002589447,0.0070807757,0.0026288133,0.002813426,0.00371108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004313195,0.000017503151,0.00015017779,0.000042344484,0.000004045337,0.00003572857,0.00015415139,0.0005384373,0.0007181639,0.985655,0.003500629,0.009140749],"study_design_scores_gemma":[0.00000784745,0.000007153864,0.00010539128,0.000021316775,0.000005137627,0.00007598031,0.000116163144,0.0019581895,0.00075436715,0.98749477,0.009444038,0.000009696529],"about_ca_topic_score_codex":0.0008471258,"about_ca_topic_score_gemma":0.0014661122,"teacher_disagreement_score":0.013728136,"about_ca_system_score_codex":0.0016557161,"about_ca_system_score_gemma":0.0006746748,"threshold_uncertainty_score":0.0459252},"labels":[],"label_agreement":null},{"id":"W57848759","doi":"","title":"Exhaustion Numbers of Subsets of Abelian Groups.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Abelian group; Combinatorics","score_opus":0.012046222197444409,"score_gpt":0.23381784705870629,"score_spread":0.22177162486126187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W57848759","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66041124,0.0028167625,0.10910469,0.002356386,0.0004626008,0.00008644145,0.0012559453,0.00046244665,0.2230435],"genre_scores_gemma":[0.96255773,0.00053980097,0.012842328,0.00020665576,0.00026402803,0.000092761875,0.0006398815,0.00007001586,0.022786757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933535,0.00018859873,0.0000659181,0.000114818045,0.00014810458,0.00014721628],"domain_scores_gemma":[0.99718285,0.0016361687,0.00029655555,0.00029748408,0.00023155271,0.00035532154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008624677,0.0003998524,0.00054848654,0.0028669594,0.0013123075,0.0032291582,0.00059441646,0.00055591343,0.010867925],"category_scores_gemma":[0.0039632223,0.00028225573,0.0003845233,0.0012951024,0.0024684537,0.0060211155,0.0023545544,0.0014203888,0.0014986785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000121862955,0.000016517099,0.0012399185,0.000058923903,0.000009971632,0.000061354316,0.0002958206,0.0006288469,0.00097364787,0.9833197,0.0021761425,0.011097431],"study_design_scores_gemma":[0.000015742933,0.0000356088,0.0015095196,0.000042382748,0.000015162663,0.00021009844,0.00026394278,0.003629923,0.0014992931,0.9822123,0.010552889,0.000013148333],"about_ca_topic_score_codex":0.00027837735,"about_ca_topic_score_gemma":0.00033579336,"teacher_disagreement_score":0.010867925,"about_ca_system_score_codex":0.0008494132,"about_ca_system_score_gemma":0.00032268406,"threshold_uncertainty_score":0.036356807},"labels":[],"label_agreement":null},{"id":"W57898296","doi":"","title":"The Triangle Intersection Problem for Kite Systems.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Kite; Mathematics; Intersection (aeronautics); Geometry; Aerospace engineering; Engineering","score_opus":0.015447424318495684,"score_gpt":0.2481110705169714,"score_spread":0.2326636461984757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W57898296","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042531505,0.002340497,0.8717571,0.0011963971,0.00027876752,0.0001928732,0.0013957099,0.00092542014,0.079381794],"genre_scores_gemma":[0.5959599,0.0028634141,0.3481259,0.00024063412,0.00016038519,0.00035811114,0.0042834305,0.0004977621,0.047510326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900717,0.00022289848,0.000047542584,0.0002570895,0.00028548195,0.00017991904],"domain_scores_gemma":[0.99872607,0.00074435736,0.00010248622,0.00018467076,0.00013171721,0.00011074641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005700953,0.00075672305,0.001258568,0.00096213835,0.0015500387,0.0026565378,0.002074097,0.0018046261,0.023119487],"category_scores_gemma":[0.0043989494,0.00065184355,0.0010617656,0.0018953633,0.0014109705,0.005662437,0.0035431464,0.0024927456,0.0036808078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023044342,0.00012080857,0.001128973,0.0007151512,0.00009471554,0.00030643996,0.00037048134,0.2094042,0.0017006067,0.54208034,0.029777525,0.21407036],"study_design_scores_gemma":[0.000041770192,0.00006482549,0.0005220853,0.00008706153,0.00003155548,0.00032430247,0.00039570912,0.3001537,0.001612848,0.66361535,0.033113472,0.000037380833],"about_ca_topic_score_codex":0.004834344,"about_ca_topic_score_gemma":0.0059007835,"teacher_disagreement_score":0.023119487,"about_ca_system_score_codex":0.0010784207,"about_ca_system_score_gemma":0.0011270182,"threshold_uncertainty_score":0.07734239},"labels":[],"label_agreement":null},{"id":"W5848928","doi":"10.2466/pms.1965.21.2.535","title":"The Complexity of List Ranking of Trees","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Bounded function; Ranking (information retrieval); Graph; Path (computing); Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.05138417851192042,"score_gpt":0.29403200381298866,"score_spread":0.24264782530106824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W5848928","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.822979,0.0016739956,0.12467775,0.007984454,0.00016406472,0.00039413536,0.0083434,0.002945134,0.030838143],"genre_scores_gemma":[0.93680423,0.00053480774,0.049445875,0.00035679238,0.00013735058,0.0001525072,0.0048446916,0.00037941505,0.007344219],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969896,0.0009848612,0.00019940862,0.00047592062,0.0006515469,0.00069859467],"domain_scores_gemma":[0.97820115,0.017395,0.0011277555,0.00132181,0.0010612353,0.00089301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017812432,0.0006362173,0.0014634869,0.001059585,0.0016899189,0.00545812,0.002225004,0.0015899304,0.013167246],"category_scores_gemma":[0.012778615,0.00056790677,0.0010627639,0.0028740212,0.0010838541,0.007977822,0.0017317538,0.0017158247,0.0014937196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027320883,0.0008784197,0.016434934,0.0029363097,0.00035523908,0.001080197,0.0017102835,0.44450378,0.015297811,0.21275,0.07678563,0.22453527],"study_design_scores_gemma":[0.00030603487,0.00020714407,0.002854683,0.000069237634,0.00014984095,0.0006011166,0.00073783565,0.7403094,0.005168246,0.24074805,0.008787178,0.00006127916],"about_ca_topic_score_codex":0.0060809045,"about_ca_topic_score_gemma":0.0066962475,"teacher_disagreement_score":0.013167246,"about_ca_system_score_codex":0.0034428812,"about_ca_system_score_gemma":0.0024709362,"threshold_uncertainty_score":0.044048786},"labels":[],"label_agreement":null},{"id":"W58592454","doi":"","title":"On Zero Sum Subsequences of Restricted Size III.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Zero (linguistics); Combinatorics; Linguistics","score_opus":0.03248731648268557,"score_gpt":0.3091400473143171,"score_spread":0.27665273083163155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W58592454","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43278578,0.004503097,0.25642374,0.0030442337,0.0018114636,0.00008100876,0.0006301975,0.00086414826,0.2998564],"genre_scores_gemma":[0.9036772,0.0012361588,0.026743373,0.00087955734,0.0006340116,0.00010760535,0.0006362529,0.0004868454,0.06559902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993843,0.00014226725,0.000045068202,0.00010888801,0.00018154467,0.00013789567],"domain_scores_gemma":[0.9977319,0.0010797918,0.00026898555,0.0003437003,0.0002877659,0.00028778976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000801286,0.00054624863,0.0007034457,0.0017403987,0.0016421112,0.0018211788,0.0008778308,0.0009522884,0.009121594],"category_scores_gemma":[0.0057713334,0.00035728424,0.00082203734,0.0010614914,0.0023113296,0.0052038236,0.0027902261,0.002261639,0.0017151689],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053551328,0.00002037268,0.00042206128,0.00005052332,0.000012301603,0.00020807437,0.0002630718,0.00069304963,0.0014196343,0.98700976,0.002421685,0.0074259373],"study_design_scores_gemma":[0.000007410693,0.000018634177,0.0002967359,0.000029398601,0.000008324283,0.00020030914,0.00011166387,0.0029559298,0.0007485588,0.9922267,0.0033867448,0.000009618719],"about_ca_topic_score_codex":0.0007507381,"about_ca_topic_score_gemma":0.00084107043,"teacher_disagreement_score":0.009121594,"about_ca_system_score_codex":0.0009026346,"about_ca_system_score_gemma":0.00043287384,"threshold_uncertainty_score":0.030514777},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; MAGIC (telescope); Enhanced Data Rates for GSM Evolution; Astronomy; Computer science; Artificial intelligence; Physics","score_opus":0.02086550752196746,"score_gpt":0.26537997609622543,"score_spread":0.24451446857425796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W58703409","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06932261,0.0010185532,0.16598257,0.0016776575,0.0017650216,0.00049069896,0.0037970622,0.0024606732,0.75348514],"genre_scores_gemma":[0.5372847,0.0022657758,0.11598764,0.0015128157,0.00044313766,0.00066792726,0.005196215,0.0018826902,0.33475912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990386,0.00014173615,0.000058961537,0.00026038257,0.00022314327,0.00027723424],"domain_scores_gemma":[0.99853396,0.00028744678,0.00015156716,0.00031989423,0.0005357368,0.00017132897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035461716,0.0011106399,0.00076943333,0.0014014749,0.0028815852,0.003844156,0.0012300676,0.0013466233,0.06951389],"category_scores_gemma":[0.0035152063,0.0008146511,0.0007812618,0.0017531359,0.0019653898,0.0039498163,0.001981485,0.0019558968,0.015566058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003215491,0.000074723655,0.0006702962,0.0002902949,0.00004651429,0.00038443887,0.0004440061,0.0007084947,0.0061262175,0.8561492,0.046033386,0.08875085],"study_design_scores_gemma":[0.000052499727,0.00005626037,0.00047496386,0.00011856569,0.00004372041,0.00054392434,0.00035730586,0.0013460973,0.008502787,0.7342392,0.2542255,0.000039207247],"about_ca_topic_score_codex":0.0019944184,"about_ca_topic_score_gemma":0.0034314557,"teacher_disagreement_score":0.06951389,"about_ca_system_score_codex":0.00082168693,"about_ca_system_score_gemma":0.0012829052,"threshold_uncertainty_score":0.2325471},"labels":[],"label_agreement":null},{"id":"W59199974","doi":"","title":"On Optimal Orientations Of Tensor Product Of Complete Graphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Tensor product; Product (mathematics); Tensor (intrinsic definition); Pure mathematics; Combinatorics; Geometry","score_opus":0.017112285705789775,"score_gpt":0.2508220759577143,"score_spread":0.2337097902519245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W59199974","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.491427,0.0034425966,0.36240625,0.0038768076,0.0005480713,0.00019583091,0.0018934527,0.00094900164,0.13526091],"genre_scores_gemma":[0.8107498,0.002479223,0.15422077,0.00059943664,0.00038203227,0.0002152833,0.0026214884,0.0007910074,0.027940877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988053,0.00039188034,0.00006715426,0.00024093216,0.00020192239,0.000292842],"domain_scores_gemma":[0.995237,0.0024446074,0.00050183036,0.0006820878,0.00039162053,0.00074278266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014004356,0.00084474345,0.0009221156,0.0014682917,0.0017335569,0.0037413838,0.0014317606,0.0013278737,0.011632994],"category_scores_gemma":[0.00625851,0.0009350142,0.00072628504,0.0018456262,0.0024010271,0.0087339245,0.0024123865,0.0026882438,0.0017235744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019447702,0.00012613124,0.0011084671,0.00016864549,0.000019309586,0.000057144196,0.00029437183,0.010523143,0.0021404624,0.93352324,0.013842111,0.038002603],"study_design_scores_gemma":[0.000027839784,0.00003377122,0.00053734053,0.000046656132,0.000017144203,0.000083153485,0.0002972688,0.025470264,0.0012146947,0.96481556,0.0074376655,0.000018608895],"about_ca_topic_score_codex":0.002136997,"about_ca_topic_score_gemma":0.003988853,"teacher_disagreement_score":0.011632994,"about_ca_system_score_codex":0.0020960714,"about_ca_system_score_gemma":0.00093517144,"threshold_uncertainty_score":0.03891629},"labels":[],"label_agreement":null},{"id":"W59565414","doi":"","title":"Graceful Lobsters Obtained by Component Moving of Diameter Four Trees.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Component (thermodynamics); Mathematics; Fishery; Biology; Physics","score_opus":0.01015828359208773,"score_gpt":0.2166958584855118,"score_spread":0.20653757489342406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W59565414","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57505125,0.0011565398,0.33666053,0.0011812878,0.00044479987,0.00013626597,0.0012441846,0.0024478897,0.081677176],"genre_scores_gemma":[0.8564597,0.0005498849,0.085660696,0.00033121152,0.00010027236,0.00010609158,0.001616002,0.00073179323,0.054444306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971646,0.00003039976,0.000015772783,0.000073044255,0.000058417074,0.00010600618],"domain_scores_gemma":[0.99890363,0.0003330593,0.00012205624,0.00035103102,0.00007602373,0.00021423193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035971915,0.00053486694,0.0008321342,0.0012440515,0.0014575364,0.0020002571,0.0014883421,0.0009310109,0.010753297],"category_scores_gemma":[0.0032986104,0.00038948614,0.00076069526,0.0010178142,0.0012496897,0.0019233045,0.0026428367,0.0013555379,0.002637918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007664023,0.00013547363,0.004108812,0.00025632925,0.00010410221,0.0009930296,0.00088180235,0.031085212,0.017131638,0.8093121,0.022958744,0.11226641],"study_design_scores_gemma":[0.00012445587,0.00012893748,0.0026702764,0.00011102192,0.00014512724,0.0008197903,0.00051218993,0.12629493,0.01396813,0.80781734,0.047332507,0.000075213226],"about_ca_topic_score_codex":0.0018334987,"about_ca_topic_score_gemma":0.002889911,"teacher_disagreement_score":0.010753297,"about_ca_system_score_codex":0.00076832547,"about_ca_system_score_gemma":0.00059355085,"threshold_uncertainty_score":0.03597337},"labels":[],"label_agreement":null},{"id":"W59737862","doi":"","title":"Coloring Of Meet-Semilattices.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Semigroup; Commutative property; Eulerian path; Discrete mathematics; Graph; Simple graph; Simple (philosophy); Graph homomorphism; Pure mathematics; Graph power; Line graph","score_opus":0.032688064109721915,"score_gpt":0.2888863794986691,"score_spread":0.25619831538894716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W59737862","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3177143,0.0014501406,0.48662195,0.0014940578,0.0007356637,0.00016505718,0.0010446191,0.0011745819,0.1895997],"genre_scores_gemma":[0.86638194,0.00037228994,0.09825471,0.00019134462,0.00024006951,0.00008698639,0.0007056917,0.00012403105,0.033642948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934214,0.000172522,0.000044449855,0.00014190232,0.00018781493,0.000111057634],"domain_scores_gemma":[0.9989243,0.0003121276,0.00013900228,0.00018485404,0.00016222366,0.00027755805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007572197,0.00034854797,0.00030770522,0.0008773144,0.0015855536,0.00216925,0.000551749,0.00046918998,0.008412333],"category_scores_gemma":[0.0013409959,0.00034256882,0.00060852035,0.00060138607,0.0020570112,0.0030870026,0.0015852419,0.0008685709,0.0013330824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000444594,0.000015184364,0.0003928701,0.000034657525,0.0000045195534,0.00009904556,0.00036891847,0.00056376605,0.0018052965,0.98853356,0.0012131457,0.0069246306],"study_design_scores_gemma":[0.000017184484,0.00003473656,0.00044072297,0.000013351394,0.0000063359416,0.00038162258,0.00031481794,0.0050455653,0.0019497111,0.97342086,0.018361943,0.000013092431],"about_ca_topic_score_codex":0.0009771493,"about_ca_topic_score_gemma":0.0015646413,"teacher_disagreement_score":0.008412333,"about_ca_system_score_codex":0.0010995258,"about_ca_system_score_gemma":0.00062298443,"threshold_uncertainty_score":0.028142035},"labels":[],"label_agreement":null},{"id":"W59929550","doi":"","title":"Constrained classes closed under unions and ne.c. structures.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics; Combinatorics","score_opus":0.01542517154865266,"score_gpt":0.24936255073956046,"score_spread":0.2339373791909078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W59929550","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15288553,0.0025672363,0.4542924,0.0040469416,0.00061461434,0.00036552583,0.008736206,0.0021714245,0.3743201],"genre_scores_gemma":[0.820831,0.0008305323,0.05890746,0.00082379044,0.00037757965,0.00041373575,0.0049047763,0.0005065939,0.11240451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823976,0.00025122226,0.0001503359,0.0005378342,0.0005102303,0.00031056974],"domain_scores_gemma":[0.9960672,0.0013572302,0.00050707336,0.0008932525,0.0006179854,0.00055720407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013424034,0.00063144893,0.0007861321,0.001747171,0.0035491416,0.006454185,0.0020165232,0.0015543485,0.025265608],"category_scores_gemma":[0.0057758223,0.00078742125,0.0008837685,0.00243367,0.0032643215,0.011860578,0.0032954328,0.0026658792,0.003201628],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006676517,0.000028284956,0.00041000533,0.000045813656,0.000011916017,0.00009128188,0.00023467923,0.0003378912,0.00078848895,0.9804894,0.00496594,0.012529567],"study_design_scores_gemma":[0.000038838127,0.000016522694,0.0008332723,0.00006521616,0.000038217808,0.000394682,0.00035715406,0.0041407803,0.003026813,0.9243858,0.06666859,0.00003410068],"about_ca_topic_score_codex":0.0053828955,"about_ca_topic_score_gemma":0.0066437996,"teacher_disagreement_score":0.025265608,"about_ca_system_score_codex":0.0027870515,"about_ca_system_score_gemma":0.0018761747,"threshold_uncertainty_score":0.08452189},"labels":[],"label_agreement":null},{"id":"W60221386","doi":"","title":"Assigning Bookmarks in Perfect Binary Trees.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Binary number; Binary tree; Combinatorics; Arithmetic","score_opus":0.014520860364420268,"score_gpt":0.2539736486830309,"score_spread":0.23945278831861064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W60221386","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09787331,0.0016190283,0.78508836,0.0016464004,0.00067812216,0.00024057447,0.0027104174,0.0036884197,0.10645536],"genre_scores_gemma":[0.5216414,0.0014582382,0.4018355,0.0006963234,0.00033565395,0.00020104466,0.0040595876,0.0014348583,0.06833746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975756,0.0005793393,0.00026324778,0.0005913069,0.00057408196,0.0004164476],"domain_scores_gemma":[0.99431676,0.0022377523,0.00052531017,0.0015698383,0.00078382733,0.00056641403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017422729,0.00043804286,0.0009809695,0.0031593046,0.003579816,0.004492582,0.0020551984,0.0017973038,0.018071124],"category_scores_gemma":[0.013303223,0.000833382,0.0012326791,0.0053081526,0.0028200424,0.014012809,0.0048556565,0.0019604678,0.0047575133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108633576,0.00006989312,0.0011417129,0.00016265569,0.00002432701,0.00018288514,0.0004928126,0.0033008843,0.0010982698,0.901785,0.009067522,0.082565464],"study_design_scores_gemma":[0.000014229254,0.00001714903,0.00033339913,0.000071485796,0.0000306203,0.0002120635,0.0002908705,0.008110021,0.0019164301,0.9565584,0.032418754,0.00002654501],"about_ca_topic_score_codex":0.0044954554,"about_ca_topic_score_gemma":0.006841979,"teacher_disagreement_score":0.018071124,"about_ca_system_score_codex":0.0020902029,"about_ca_system_score_gemma":0.0019699081,"threshold_uncertainty_score":0.06045389},"labels":[],"label_agreement":null},{"id":"W60558427","doi":"","title":"Odd (m1, m2, ..., mr)-cycle systems of Kn.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.005333178173023237,"score_gpt":0.18616441581972554,"score_spread":0.1808312376467023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W60558427","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6867282,0.0015602306,0.093847245,0.0014933754,0.00041323114,0.00015435005,0.0016554581,0.00043330397,0.21371463],"genre_scores_gemma":[0.93344295,0.00037580865,0.018546235,0.000286565,0.000078933765,0.000062114734,0.0008572997,0.00008462495,0.046265457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996977,0.00006153744,0.000016542783,0.000063791274,0.00004865093,0.00011188534],"domain_scores_gemma":[0.9994547,0.00013341567,0.00013199846,0.00006971596,0.00010359839,0.00010655689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001890053,0.0003861028,0.0002903745,0.0011322772,0.0013197226,0.0013927214,0.0006133298,0.0006372225,0.015302151],"category_scores_gemma":[0.00093182013,0.00022002008,0.00023389174,0.0005851976,0.0009480516,0.0014456738,0.001224939,0.00074694806,0.0015870822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028639406,0.000054729055,0.0020102267,0.00019140886,0.000027293205,0.0004783613,0.00047918526,0.0033656233,0.010734448,0.9465231,0.009446396,0.0264028],"study_design_scores_gemma":[0.00004268665,0.000072117895,0.0026796404,0.00006710317,0.00003269692,0.0006880741,0.0004990625,0.013222076,0.0058741025,0.9408443,0.03593276,0.00004541371],"about_ca_topic_score_codex":0.00250074,"about_ca_topic_score_gemma":0.005076223,"teacher_disagreement_score":0.015302151,"about_ca_system_score_codex":0.0008588016,"about_ca_system_score_gemma":0.0004361315,"threshold_uncertainty_score":0.051190794},"labels":[],"label_agreement":null},{"id":"W60887568","doi":"","title":"How close to regular must a multipartite tournament be to secure a given path covering number","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Multipartite; Tournament; Mathematics; Path (computing); Discrete mathematics; Combinatorics; Computer science; Computer network; Quantum mechanics; Quantum; Physics","score_opus":0.01579000519708357,"score_gpt":0.22801673884704984,"score_spread":0.21222673364996628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W60887568","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65780544,0.0008539152,0.28401062,0.009682363,0.00062235317,0.00020447286,0.0005386465,0.0017959189,0.04448626],"genre_scores_gemma":[0.96470135,0.00017234434,0.029824855,0.00053711404,0.00008908594,0.000062286854,0.00023801898,0.00014214269,0.0042327303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99594396,0.0012312412,0.00021414665,0.0010100751,0.00060776604,0.0009927419],"domain_scores_gemma":[0.98459506,0.0091808215,0.00083476334,0.0028847686,0.0008475423,0.0016570495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036395001,0.00067548,0.0012899105,0.0009616786,0.002293507,0.0062274835,0.0014486195,0.003100475,0.0059744995],"category_scores_gemma":[0.024986736,0.00047546756,0.00097527885,0.00078428915,0.0026499436,0.008570028,0.0036725055,0.0033829631,0.0012534412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004136258,0.00065054005,0.012050058,0.00035361052,0.0004653532,0.00038710242,0.0009830461,0.18587406,0.020640565,0.63889676,0.019310348,0.116252266],"study_design_scores_gemma":[0.00016360023,0.0005182924,0.0012298238,0.00006224481,0.00011366275,0.0005362419,0.00073845295,0.36256498,0.008410864,0.6182915,0.0073122955,0.00005818145],"about_ca_topic_score_codex":0.0015164425,"about_ca_topic_score_gemma":0.0016271112,"teacher_disagreement_score":0.0062274835,"about_ca_system_score_codex":0.0024094447,"about_ca_system_score_gemma":0.0020946127,"threshold_uncertainty_score":0.01998669},"labels":[],"label_agreement":null},{"id":"W61072206","doi":"","title":"On bipartite generalized Ramsey theory.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Ramsey theory; Combinatorics","score_opus":0.022314320970585787,"score_gpt":0.2802018678683466,"score_spread":0.25788754689776083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W61072206","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13804598,0.017964665,0.19051121,0.01359734,0.0014813115,0.00009203081,0.00076432223,0.00073015655,0.636813],"genre_scores_gemma":[0.89218456,0.008071641,0.029238151,0.0033069937,0.0017907034,0.00024854022,0.00064147287,0.00020990692,0.064308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991486,0.0003824922,0.000029637136,0.00011695652,0.0001900647,0.00013219156],"domain_scores_gemma":[0.9984566,0.00081643596,0.00012220202,0.00019836803,0.00019453347,0.00021190163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012791582,0.0006071401,0.00085780583,0.0020619761,0.002038656,0.0020330215,0.0009911677,0.0013354281,0.008322883],"category_scores_gemma":[0.0033539091,0.00037923377,0.0005262924,0.001802334,0.0045267814,0.008032945,0.0030629288,0.0026315413,0.0015512089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005287202,0.0000049522137,0.00004464888,0.000019747233,0.0000022312606,0.000017811135,0.00006309047,0.00019064029,0.00006734404,0.9960401,0.0017906907,0.0017533663],"study_design_scores_gemma":[0.000002500689,0.0000025355966,0.000054647295,0.000010892862,0.0000017990226,0.00003188068,0.00003416849,0.00075885886,0.00002526469,0.9964289,0.0026459019,0.000002730497],"about_ca_topic_score_codex":0.002038432,"about_ca_topic_score_gemma":0.0024173812,"teacher_disagreement_score":0.008322883,"about_ca_system_score_codex":0.0016487513,"about_ca_system_score_gemma":0.0006534147,"threshold_uncertainty_score":0.02784288},"labels":[],"label_agreement":null},{"id":"W61099736","doi":"","title":"Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs with Distance Sets Missing An Interval.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Interval (graph theory); Combinatorics; Discrete mathematics","score_opus":0.008913949687140479,"score_gpt":0.23078099404702346,"score_spread":0.22186704435988297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W61099736","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6332105,0.0022138646,0.22039376,0.0041350815,0.0004926415,0.000124015,0.0019793392,0.00057389744,0.13687693],"genre_scores_gemma":[0.9458001,0.00071368524,0.039963376,0.00036394995,0.00021364563,0.000110244895,0.0007133124,0.00012962168,0.011992032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901164,0.00021287684,0.000046693942,0.00025322795,0.00020379522,0.0002718048],"domain_scores_gemma":[0.9928445,0.0041559567,0.0009521189,0.0008741327,0.00051588047,0.0006572857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011150473,0.00048083407,0.00051604427,0.0020486445,0.0023012334,0.004268303,0.001783774,0.0013830193,0.011241762],"category_scores_gemma":[0.008952239,0.0005054349,0.00050411845,0.0026048485,0.0032657695,0.0056678653,0.0017923829,0.0019797753,0.0009356037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030695766,0.00003956862,0.001033396,0.00008834903,0.000013231536,0.000052124888,0.0002315196,0.0066993255,0.001973407,0.96955484,0.004806368,0.015200966],"study_design_scores_gemma":[0.000047898287,0.000029873872,0.0009585365,0.000041187708,0.00002517975,0.00017439948,0.00028753147,0.028237378,0.0021882555,0.95889693,0.009082532,0.000030279563],"about_ca_topic_score_codex":0.0028473863,"about_ca_topic_score_gemma":0.0024173546,"teacher_disagreement_score":0.011241762,"about_ca_system_score_codex":0.0028707462,"about_ca_system_score_gemma":0.0009604302,"threshold_uncertainty_score":0.03760743},"labels":[],"label_agreement":null},{"id":"W6110703","doi":"10.1007/bf01254914","title":"On the Local Colorings of Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.0163563646575823,"score_gpt":0.20771586847596632,"score_spread":0.191359503818384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6110703","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5371208,0.003805779,0.37140858,0.0029074699,0.00043900454,0.00019731733,0.00254759,0.00059095706,0.080982424],"genre_scores_gemma":[0.9143734,0.0021675602,0.054140866,0.00039837166,0.00043091955,0.00018312116,0.0019571353,0.00020668382,0.026142051],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931145,0.00021780177,0.00003614695,0.00020974457,0.00011109468,0.00011374821],"domain_scores_gemma":[0.99735105,0.0012541112,0.00057898025,0.00037453073,0.00016142844,0.00027989034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000634846,0.0006920815,0.000638229,0.0018019978,0.0011007703,0.0018074008,0.00063828105,0.00069117855,0.008030605],"category_scores_gemma":[0.0024762151,0.00032057872,0.0008222688,0.0015747075,0.0019303206,0.001982629,0.0013814778,0.0010872196,0.00084880716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012658861,0.000037644808,0.0017935209,0.00028377082,0.000053676446,0.0001632293,0.00031946675,0.018877054,0.0029849699,0.9455606,0.004387,0.025412435],"study_design_scores_gemma":[0.000037054277,0.00007356702,0.0023986008,0.000058338715,0.000045966255,0.0004228341,0.00022766224,0.03703056,0.0013408402,0.94431764,0.014021859,0.000024992944],"about_ca_topic_score_codex":0.0010461126,"about_ca_topic_score_gemma":0.0022130432,"teacher_disagreement_score":0.008030605,"about_ca_system_score_codex":0.0015002491,"about_ca_system_score_gemma":0.00036216772,"threshold_uncertainty_score":0.026865005},"labels":[],"label_agreement":null},{"id":"W61114388","doi":"","title":"Dissolved Graphs and Strong Perfect Graph Conjecture.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Conjecture; Graph; Combinatorics; Strong perfect graph theorem; Line graph; 1-planar graph","score_opus":0.012713019159197654,"score_gpt":0.26526512607692987,"score_spread":0.2525521069177322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W61114388","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3645279,0.006311802,0.1728526,0.040500358,0.0021658987,0.00017374314,0.002587884,0.0011436044,0.40973625],"genre_scores_gemma":[0.9420526,0.002743831,0.019727811,0.0024391187,0.00082858326,0.00010554331,0.0018621774,0.00013362349,0.030106748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848807,0.0004724401,0.00006763302,0.00035123483,0.00038433512,0.00023631784],"domain_scores_gemma":[0.9924385,0.0044826716,0.0008108968,0.0011506015,0.0004679482,0.00064948073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014532317,0.00058839394,0.00075140625,0.0013320538,0.0024142908,0.0031708253,0.0013808326,0.0018552365,0.013532875],"category_scores_gemma":[0.01046007,0.0006694315,0.0007645528,0.0016903388,0.0038353717,0.009332456,0.0038883402,0.0029396706,0.0014777747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004879846,0.000027030304,0.0005084053,0.00008897338,0.000011673617,0.00009381192,0.00015840465,0.0013032038,0.00028653824,0.9814432,0.009824592,0.0062053693],"study_design_scores_gemma":[0.000016685244,0.000009441145,0.00018082537,0.000020310577,0.000009079746,0.00010128681,0.00011280314,0.0022119416,0.0002597645,0.99106455,0.0060070893,0.0000061726046],"about_ca_topic_score_codex":0.0016658319,"about_ca_topic_score_gemma":0.001954783,"teacher_disagreement_score":0.013532875,"about_ca_system_score_codex":0.0015652948,"about_ca_system_score_gemma":0.00094902085,"threshold_uncertainty_score":0.045271993},"labels":[],"label_agreement":null},{"id":"W61204195","doi":"","title":"Properties for a Certain Family of Knot Diagrams.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Knot (papermaking); Mathematics; Combinatorics; Materials science; Composite material","score_opus":0.026932256183836663,"score_gpt":0.2576191893182353,"score_spread":0.23068693313439864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W61204195","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.429994,0.0011305998,0.35531124,0.0018050529,0.000492201,0.00014448556,0.001961058,0.0018568563,0.20730457],"genre_scores_gemma":[0.94589454,0.0007803112,0.026577726,0.00034265325,0.00022947528,0.00011901309,0.0016305129,0.00028645783,0.024139257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917454,0.00011647269,0.00006199093,0.000245131,0.00023904252,0.00016282748],"domain_scores_gemma":[0.99579006,0.0017911,0.0006135308,0.00060286385,0.000707648,0.0004948469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009704927,0.00041091983,0.0004246281,0.0029019185,0.002099445,0.0028138757,0.000662169,0.0012449565,0.017724672],"category_scores_gemma":[0.006601907,0.0003822977,0.0009570655,0.0016774924,0.0013499375,0.0044720173,0.0011689378,0.001487807,0.0025142843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008327014,0.000048940597,0.0024400973,0.00012273663,0.000020435067,0.0005320526,0.00046409684,0.00093745673,0.0026311916,0.97114545,0.0053151096,0.016259018],"study_design_scores_gemma":[0.000040416464,0.00006664343,0.0025329695,0.00008468645,0.000051725747,0.0037632252,0.00042667068,0.007744366,0.003075155,0.9368254,0.045344185,0.0000446537],"about_ca_topic_score_codex":0.0006395135,"about_ca_topic_score_gemma":0.000509082,"teacher_disagreement_score":0.017724672,"about_ca_system_score_codex":0.0007479407,"about_ca_system_score_gemma":0.00040800462,"threshold_uncertainty_score":0.05929488},"labels":[],"label_agreement":null},{"id":"W61563073","doi":"","title":"Hyperbolic Functions with Second Order Recurrence Sequences.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Order (exchange); Pure mathematics; Applied mathematics; Business","score_opus":0.01291664339805501,"score_gpt":0.24053702657116957,"score_spread":0.22762038317311456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W61563073","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26708585,0.0075300406,0.2856065,0.0033689484,0.0018625853,0.000119782526,0.0010884462,0.0007829249,0.432555],"genre_scores_gemma":[0.8693535,0.0018601229,0.023557963,0.00058417825,0.0008689754,0.00007962561,0.00051930896,0.00021534665,0.102960974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995931,0.00009909894,0.000026097954,0.000059066657,0.0001413971,0.00008128298],"domain_scores_gemma":[0.99911004,0.00030973434,0.00015847542,0.00013756024,0.0001721874,0.00011184229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005785862,0.00066211476,0.00047540272,0.0017391813,0.00087645766,0.0023710378,0.00072059175,0.0008403743,0.013109983],"category_scores_gemma":[0.0032776573,0.00033578777,0.0004913531,0.0011641785,0.0013729524,0.0032749136,0.0014160082,0.0016907478,0.0028165795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018582596,0.000011143567,0.00019635602,0.000030503556,0.0000042947363,0.00009346451,0.00011724507,0.00045082901,0.00061354064,0.98672473,0.002824849,0.008914348],"study_design_scores_gemma":[0.000010792279,0.000020056195,0.00036472158,0.000020461992,0.0000070501023,0.0003683048,0.000088802604,0.005586425,0.0008467703,0.9799201,0.012751359,0.000015147387],"about_ca_topic_score_codex":0.00088172965,"about_ca_topic_score_gemma":0.0012122921,"teacher_disagreement_score":0.013109983,"about_ca_system_score_codex":0.0009315782,"about_ca_system_score_gemma":0.00050181337,"threshold_uncertainty_score":0.043857276},"labels":[],"label_agreement":null},{"id":"W61858960","doi":"","title":"Non-Fano Quads in Finite Projective Planes.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fano plane; Mathematics; Pure mathematics; Projective test","score_opus":0.042141846075904384,"score_gpt":0.3394686044767125,"score_spread":0.29732675840080813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W61858960","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5311828,0.0031947999,0.1101299,0.0029908794,0.00065915164,0.00008290624,0.0008682044,0.00037135207,0.35051993],"genre_scores_gemma":[0.9540632,0.00061543536,0.014159023,0.0002590374,0.00017216607,0.000039076403,0.0004454695,0.00009154454,0.030155074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994578,0.00014981674,0.000027607528,0.00010162245,0.00013711269,0.00012606297],"domain_scores_gemma":[0.99935323,0.0002309951,0.00011242352,0.00007241668,0.00008976238,0.00014116892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055232336,0.00062019704,0.00050854,0.0018463649,0.0018522218,0.002323861,0.0006329004,0.00064474595,0.010533002],"category_scores_gemma":[0.0016423059,0.0003840154,0.0005010895,0.00089251436,0.0027490037,0.0039993604,0.0022001988,0.0015697678,0.0012913776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024392306,0.000006299593,0.00025208748,0.000019310555,0.00000479086,0.00008129954,0.00013233635,0.00030339597,0.00031039419,0.9951042,0.001015897,0.00274562],"study_design_scores_gemma":[0.000016662681,0.000014680553,0.00040263808,0.000020775802,0.000008067988,0.00024377361,0.00023550681,0.0020047184,0.0003480724,0.989447,0.0072511225,0.000007084227],"about_ca_topic_score_codex":0.0016436998,"about_ca_topic_score_gemma":0.0021673825,"teacher_disagreement_score":0.010533002,"about_ca_system_score_codex":0.0012347291,"about_ca_system_score_gemma":0.00035752714,"threshold_uncertainty_score":0.03523642},"labels":[],"label_agreement":null},{"id":"W61962611","doi":"","title":"The Upper Forcing Geodetic Number of a Graph","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Geodetic datum; Forcing (mathematics); Graph; Combinatorics; Geodesy; Geology; Mathematical analysis","score_opus":0.012217817210371512,"score_gpt":0.23500609841401046,"score_spread":0.22278828120363894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W61962611","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5838708,0.000891143,0.22038396,0.0044513894,0.00060771976,0.00008082466,0.0013382337,0.00086429185,0.18751167],"genre_scores_gemma":[0.9416181,0.00055706844,0.02531364,0.00051240355,0.00030495677,0.00013504695,0.00072024734,0.00026395865,0.030574685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906284,0.0001623734,0.000045735753,0.00023225977,0.00024388621,0.00025288857],"domain_scores_gemma":[0.99593854,0.0023011088,0.0002988452,0.0005177917,0.00027002068,0.0006737741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010064034,0.0006432735,0.0011729694,0.0027744372,0.0031541574,0.003648172,0.0016036569,0.0015197427,0.015468665],"category_scores_gemma":[0.0041292184,0.0006808158,0.0009533065,0.0014374809,0.0038506472,0.0042218096,0.0033980492,0.0035393573,0.0018193403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008126254,0.000015642454,0.0004961906,0.00004950043,0.000008370822,0.000071705865,0.0002069801,0.003565787,0.0017472984,0.98563254,0.001855938,0.0062689185],"study_design_scores_gemma":[0.000021261489,0.000031642416,0.0007132569,0.000030664756,0.000017244256,0.00019783076,0.00013263793,0.01028674,0.0022254495,0.9771812,0.009136716,0.000025344394],"about_ca_topic_score_codex":0.0013596326,"about_ca_topic_score_gemma":0.0018718267,"teacher_disagreement_score":0.015468665,"about_ca_system_score_codex":0.0016912443,"about_ca_system_score_gemma":0.00083449215,"threshold_uncertainty_score":0.0517478},"labels":[],"label_agreement":null},{"id":"W6211774","doi":"","title":"Stratification and Domination in Prisms.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Eurasian Exchange Networks","field":"Social Sciences","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Stratification (seeds); Horticulture; Biology","score_opus":0.011349969075541559,"score_gpt":0.2698446650894389,"score_spread":0.25849469601389735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6211774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13820271,0.0027216822,0.57223696,0.0049710777,0.00055735395,0.00021239859,0.0012123934,0.00092036236,0.27896515],"genre_scores_gemma":[0.8212499,0.0012814467,0.10818175,0.0007533865,0.00032099718,0.0003334635,0.00089328527,0.0003136365,0.066672206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956928,0.0018231703,0.00043081882,0.00083548314,0.0007302968,0.0004874341],"domain_scores_gemma":[0.9917464,0.004576969,0.00072368834,0.0012327947,0.0010117316,0.0007084119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037231976,0.0005220785,0.0010044829,0.0023947274,0.0044937697,0.0055192946,0.0012133486,0.0011072783,0.019697037],"category_scores_gemma":[0.0143810315,0.0006402163,0.001541049,0.0027829001,0.00526369,0.010895948,0.0061616437,0.002236462,0.0024007405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020442088,0.00000843003,0.0002712416,0.000038552287,0.000012260126,0.00004807129,0.00034502233,0.0007309516,0.00014092552,0.99136484,0.0010475062,0.0059718816],"study_design_scores_gemma":[0.000019037849,0.000008688624,0.00022050353,0.000032681226,0.00001719126,0.000104762104,0.0002219481,0.0034473564,0.00023691209,0.98176426,0.013915289,0.000011453988],"about_ca_topic_score_codex":0.004790268,"about_ca_topic_score_gemma":0.0055137463,"teacher_disagreement_score":0.019697037,"about_ca_system_score_codex":0.0023670495,"about_ca_system_score_gemma":0.0019568047,"threshold_uncertainty_score":0.06589317},"labels":[],"label_agreement":null},{"id":"W62420143","doi":"","title":"Complete Sets of Orthogonal Self-Orthogonal Latin Squares.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Orthogonal array; Latin square; Orthogonal basis; Combinatorics; Statistics; Chemistry; Physics; Food science; Taguchi methods","score_opus":0.014000129129407471,"score_gpt":0.19457764534021188,"score_spread":0.18057751621080442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W62420143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2889309,0.0021667397,0.41250452,0.0015849486,0.0006375442,0.00020488753,0.0035007296,0.0005625208,0.28990725],"genre_scores_gemma":[0.82133895,0.0010661853,0.08880964,0.0012110439,0.0005978385,0.00044213544,0.0037525643,0.00029128624,0.082490385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.997865,0.00061909785,0.00011137678,0.00038231828,0.00071255956,0.0003096512],"domain_scores_gemma":[0.9962573,0.0014770334,0.0005143836,0.000790547,0.0006569925,0.0003037313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078211667,0.0006892591,0.00097629084,0.002343645,0.0022761163,0.0032571477,0.0011380423,0.0010889325,0.012372149],"category_scores_gemma":[0.004899097,0.00068247976,0.0008126473,0.0017319435,0.002263973,0.0033427163,0.0034423054,0.0014374432,0.0028837658],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007262676,0.000031320174,0.00025231243,0.00006370356,0.000028708844,0.00010182519,0.00014296647,0.0021854124,0.0016829318,0.9790829,0.004048807,0.012306592],"study_design_scores_gemma":[0.00002683199,0.000023061088,0.00031805536,0.000034121073,0.000013165161,0.0002482485,0.00011577009,0.006763528,0.0016559421,0.97979593,0.010984898,0.00002060123],"about_ca_topic_score_codex":0.00044678166,"about_ca_topic_score_gemma":0.00077044696,"teacher_disagreement_score":0.012372149,"about_ca_system_score_codex":0.00079638045,"about_ca_system_score_gemma":0.00079189474,"threshold_uncertainty_score":0.04138893},"labels":[],"label_agreement":null},{"id":"W62907451","doi":"","title":"Minimum Sets Forcing Monochromatic Triangles.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Monochromatic color; Forcing (mathematics); Mathematics; Mathematical analysis; Optics; Physics","score_opus":0.011488348016456039,"score_gpt":0.23527003978978508,"score_spread":0.22378169177332904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W62907451","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09625294,0.0013279403,0.77509403,0.0016453317,0.0008139579,0.00017217574,0.0018385197,0.0012557587,0.12159933],"genre_scores_gemma":[0.5941452,0.000985911,0.35070115,0.0006845265,0.00035971156,0.00026613695,0.002942337,0.0009764127,0.048938595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999212,0.00015584986,0.000047539863,0.00015363788,0.00031434893,0.000116626565],"domain_scores_gemma":[0.9976184,0.0012348022,0.00016528515,0.000535408,0.00028763546,0.0001583963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005860974,0.0004587834,0.00085241033,0.0011775324,0.0010851595,0.0016311076,0.0012749685,0.0010300757,0.01850779],"category_scores_gemma":[0.005290254,0.00052521774,0.00089295243,0.00090957974,0.0011209053,0.0021400873,0.0036628435,0.0019684772,0.003181204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033123558,0.00007855,0.00084040314,0.00051124307,0.00004500572,0.0002608148,0.00039544443,0.02716483,0.011561689,0.7813253,0.03250028,0.1449853],"study_design_scores_gemma":[0.00007264491,0.00007162036,0.0005557481,0.00017123645,0.000024543147,0.00040940175,0.00024063517,0.07527388,0.010374186,0.87424344,0.03853716,0.000025597568],"about_ca_topic_score_codex":0.0009088655,"about_ca_topic_score_gemma":0.002273519,"teacher_disagreement_score":0.01850779,"about_ca_system_score_codex":0.00078677025,"about_ca_system_score_gemma":0.00053067063,"threshold_uncertainty_score":0.061914682},"labels":[],"label_agreement":null},{"id":"W62939430","doi":"","title":"Minor clique free extremal graphs","year":2004,"lang":"fr","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Contractible space; Graph; Clique; Block graph; Split graph; Discrete mathematics; Pathwidth; Line graph","score_opus":0.022213531092072424,"score_gpt":0.26927344698587985,"score_spread":0.24705991589380744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W62939430","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72566336,0.0010247384,0.10824041,0.002773963,0.00017310001,0.00016721121,0.0016634462,0.00056553556,0.15972833],"genre_scores_gemma":[0.96532613,0.00033414728,0.017543951,0.00026182362,0.00009495844,0.00006367709,0.00091408344,0.00009031114,0.0153708635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943274,0.00011503551,0.000019480898,0.00014989373,0.00012997446,0.00015279619],"domain_scores_gemma":[0.9978594,0.0010724637,0.00026469107,0.0002831192,0.00016323576,0.0003570848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003856088,0.00043639762,0.00049645576,0.0009737868,0.0013952778,0.001847294,0.0011991634,0.0009881915,0.011053734],"category_scores_gemma":[0.0025366913,0.0004916612,0.00039307633,0.0008653743,0.0011339108,0.0023894133,0.0015047322,0.0018803057,0.0008233955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022829811,0.000079693484,0.001623244,0.0002414804,0.00003719915,0.00061684416,0.0003786583,0.008947643,0.009443793,0.95342976,0.009981242,0.0149921095],"study_design_scores_gemma":[0.000055362652,0.00006214625,0.0031463332,0.00005096794,0.00004750436,0.001233962,0.0003265517,0.056309745,0.0063657397,0.91383344,0.018534584,0.000033797613],"about_ca_topic_score_codex":0.0010260654,"about_ca_topic_score_gemma":0.0024267987,"teacher_disagreement_score":0.011053734,"about_ca_system_score_codex":0.0008206544,"about_ca_system_score_gemma":0.00038806276,"threshold_uncertainty_score":0.036978424},"labels":[],"label_agreement":null},{"id":"W63421133","doi":"","title":"Excess Problem for Modular Lattices.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Modular design; Mathematics; Pure mathematics; Computer science; Programming language","score_opus":0.023054994259248618,"score_gpt":0.2416237437916444,"score_spread":0.21856874953239577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W63421133","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33240286,0.0045995936,0.22387436,0.013217744,0.0010034993,0.00013061837,0.0017658395,0.00081065675,0.4221948],"genre_scores_gemma":[0.91712385,0.0015666632,0.022261212,0.00086805737,0.00085721706,0.00008218802,0.0008494644,0.00020481729,0.056186453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990177,0.0002761187,0.00005620315,0.00013908144,0.0003237947,0.00018704285],"domain_scores_gemma":[0.99788934,0.0011825323,0.00018058637,0.00023980343,0.0002099981,0.00029776583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014287825,0.00055347825,0.0010048045,0.0015757941,0.0017182358,0.0039032488,0.0012084651,0.0011800178,0.02177468],"category_scores_gemma":[0.0053236466,0.0004320479,0.00069264695,0.0014392595,0.0027226978,0.009362182,0.0030909951,0.0026891883,0.0027780002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006844592,0.000019793466,0.00023261615,0.00007442762,0.000009119736,0.00006262481,0.000074587915,0.00080475333,0.00034850853,0.98823047,0.0037805054,0.0062941546],"study_design_scores_gemma":[0.000024036653,0.000008451252,0.00010498608,0.00001679998,0.000009274498,0.00010512023,0.00007045891,0.0034063,0.0003534932,0.99150133,0.0043927305,0.0000069522616],"about_ca_topic_score_codex":0.00077251316,"about_ca_topic_score_gemma":0.001154556,"teacher_disagreement_score":0.02177468,"about_ca_system_score_codex":0.0016114616,"about_ca_system_score_gemma":0.00090928504,"threshold_uncertainty_score":0.07284355},"labels":[],"label_agreement":null},{"id":"W63952162","doi":"","title":"Cubic Graphs with Minimum Number of Spanning Trees.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spanning tree; Combinatorics; Minimum spanning tree","score_opus":0.008992087305351936,"score_gpt":0.21981494272233984,"score_spread":0.2108228554169879,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W63952162","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5521905,0.0027416656,0.2535247,0.009562501,0.00054450607,0.00031669278,0.01415799,0.0021477148,0.16481367],"genre_scores_gemma":[0.8189481,0.0010102387,0.14572363,0.0007594619,0.00021606468,0.00020022182,0.0061946088,0.00048319515,0.026464531],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929845,0.0001719527,0.000038978436,0.00017953555,0.00014208595,0.00016899664],"domain_scores_gemma":[0.9955004,0.0023006778,0.00060883746,0.0007792041,0.00036268114,0.00044832085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048186528,0.00049074064,0.00088053657,0.00076785195,0.0015279622,0.0025624998,0.001417499,0.0014728282,0.013164849],"category_scores_gemma":[0.006095863,0.0005766716,0.0005697091,0.0016898826,0.00081285794,0.0035916497,0.0014307356,0.0016282015,0.0017634623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010446965,0.00038083037,0.0042119827,0.0011348198,0.00011132892,0.00032124433,0.00045427913,0.055729624,0.015194826,0.70924836,0.08566693,0.12650107],"study_design_scores_gemma":[0.00018637523,0.00010685729,0.0030685237,0.00011198922,0.000072854986,0.00060800184,0.0005433606,0.10693572,0.0066711428,0.8475445,0.03410341,0.0000472157],"about_ca_topic_score_codex":0.0031604548,"about_ca_topic_score_gemma":0.0058793933,"teacher_disagreement_score":0.013164849,"about_ca_system_score_codex":0.0015191241,"about_ca_system_score_gemma":0.0014822939,"threshold_uncertainty_score":0.0440408},"labels":[],"label_agreement":null},{"id":"W64469974","doi":"","title":"Symmetric Designs and Self-Dual Codes over Rings.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dual (grammatical number)","score_opus":0.00857695644386442,"score_gpt":0.20865252052036734,"score_spread":0.20007556407650293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W64469974","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34273943,0.005894959,0.38750932,0.003805803,0.0012336336,0.00012332518,0.0005504963,0.00035795348,0.25778508],"genre_scores_gemma":[0.9325984,0.0016424268,0.029161805,0.00059813977,0.0005690601,0.00007314765,0.0001886131,0.000048574333,0.035119846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906725,0.00035482043,0.00004422295,0.00013819628,0.00021748376,0.00017806578],"domain_scores_gemma":[0.998214,0.0007287226,0.00032121455,0.00033101803,0.00022142688,0.0001836954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007857191,0.00038335737,0.00037420282,0.00116544,0.0011375227,0.001962754,0.0004858222,0.0008361528,0.005595433],"category_scores_gemma":[0.0025908821,0.0003357868,0.00045995257,0.0008360477,0.0019694234,0.0028892073,0.0015894445,0.0013601617,0.00096456043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018743563,0.0000114645745,0.00008763147,0.000017819686,0.0000036806155,0.000036283403,0.00006657203,0.00054887054,0.0004368935,0.9943329,0.0008043924,0.0036347564],"study_design_scores_gemma":[0.000010691998,0.000021184878,0.00009775201,0.000016890815,0.000005331272,0.00016293424,0.00006719621,0.0034315938,0.0006953532,0.9897866,0.005694856,0.000009451397],"about_ca_topic_score_codex":0.000386004,"about_ca_topic_score_gemma":0.0006143803,"teacher_disagreement_score":0.005595433,"about_ca_system_score_codex":0.0008985517,"about_ca_system_score_gemma":0.0006371411,"threshold_uncertainty_score":0.01871866},"labels":[],"label_agreement":null},{"id":"W64555105","doi":"","title":"On the Face Lattice of a Poset Polyhedron.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Polyhedron; Partially ordered set; Lattice (music); Mathematics; Face (sociological concept); Combinatorics; Pure mathematics; Physics; Linguistics; Philosophy","score_opus":0.01596850881010932,"score_gpt":0.24533619197354686,"score_spread":0.22936768316343753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W64555105","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17075638,0.00081446656,0.680936,0.0009905748,0.0006624863,0.00022449944,0.0017915162,0.0011364765,0.14268763],"genre_scores_gemma":[0.6421294,0.0009567074,0.2803945,0.00029897745,0.00024890827,0.0002394182,0.0031344916,0.0006236995,0.071973875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945444,0.00010407805,0.000023910732,0.00008149812,0.00023718447,0.000098853874],"domain_scores_gemma":[0.9995845,0.00014643444,0.00004446365,0.00007220667,0.000075509015,0.000076847915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023938243,0.00043892,0.0006028713,0.0011652868,0.0010916829,0.0022374983,0.00076656195,0.00063801615,0.020213693],"category_scores_gemma":[0.0014263124,0.00033682867,0.000639062,0.0009836911,0.0013785956,0.0017720222,0.001978577,0.001681904,0.004190697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014637646,0.00008047984,0.0008289621,0.00016058779,0.000020761865,0.0003906171,0.00029634268,0.023607338,0.00521228,0.8624633,0.016204914,0.090588],"study_design_scores_gemma":[0.000040101535,0.00007883139,0.00059334293,0.000066361994,0.000013397227,0.00058524695,0.00047162562,0.091500044,0.0037299318,0.8701186,0.032773994,0.000028554812],"about_ca_topic_score_codex":0.0014439346,"about_ca_topic_score_gemma":0.0026437845,"teacher_disagreement_score":0.020213693,"about_ca_system_score_codex":0.00050602877,"about_ca_system_score_gemma":0.00038937738,"threshold_uncertainty_score":0.06762153},"labels":[],"label_agreement":null},{"id":"W64760292","doi":"","title":"On Multi-Color Partitions with Distinct Parts.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Partition (number theory); Combinatorics; Colored; Discrete mathematics","score_opus":0.05791716652199947,"score_gpt":0.30699462381296344,"score_spread":0.24907745729096398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W64760292","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42556676,0.008336327,0.40270498,0.0019585693,0.0009750785,0.00019910825,0.00090547913,0.0011231966,0.15823051],"genre_scores_gemma":[0.91246843,0.0022485969,0.05814873,0.00073427137,0.00035100785,0.0002865709,0.00057891285,0.0003690052,0.024814501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988085,0.00025390208,0.00007054474,0.00021642697,0.00032492322,0.00032575818],"domain_scores_gemma":[0.9964529,0.0017382596,0.0006528042,0.00050870073,0.00042558048,0.00022166783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002034727,0.0009766839,0.0010056588,0.0031483998,0.0016368764,0.002610248,0.0014883052,0.0010302509,0.004770418],"category_scores_gemma":[0.008732249,0.0005575747,0.0009862521,0.0027418544,0.0029437167,0.0054906104,0.0024498422,0.0021164033,0.0024158543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013368069,0.000027431915,0.0015402035,0.00020289826,0.00001804063,0.00034304155,0.00092914683,0.0032756364,0.0054759816,0.9631021,0.0035545442,0.021397244],"study_design_scores_gemma":[0.00003105569,0.00004824641,0.0019293678,0.00012304794,0.00005032618,0.0013300703,0.00025676546,0.030625947,0.008291546,0.9463088,0.010938784,0.00006602916],"about_ca_topic_score_codex":0.0016068675,"about_ca_topic_score_gemma":0.0031590417,"teacher_disagreement_score":0.004770418,"about_ca_system_score_codex":0.0025040954,"about_ca_system_score_gemma":0.0007127862,"threshold_uncertainty_score":0.018168569},"labels":[],"label_agreement":null},{"id":"W64826384","doi":"","title":"On Maximal Fractional Independent Sets In Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Maximal independent set; Combinatorics; Discrete mathematics; Chordal graph; 1-planar graph; Graph","score_opus":0.025472710744579765,"score_gpt":0.27652372380635026,"score_spread":0.2510510130617705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W64826384","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30078232,0.010842559,0.25304845,0.0072627296,0.00091382605,0.00008782624,0.0008708113,0.00043864988,0.42575282],"genre_scores_gemma":[0.9326964,0.003778041,0.032028943,0.00088037964,0.0009342002,0.00016590423,0.0004958189,0.00012593098,0.028894436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878854,0.0003825442,0.000065678025,0.00020314744,0.0003542397,0.00020582198],"domain_scores_gemma":[0.9953056,0.0032056593,0.00040707973,0.00034218992,0.0003113729,0.00042810393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015613121,0.0006940571,0.0009708663,0.0038476414,0.0030502265,0.0036174087,0.0013302483,0.0016780811,0.0064307097],"category_scores_gemma":[0.007887614,0.0005692179,0.0008176971,0.0027514137,0.004989731,0.009024445,0.0031363443,0.0029923196,0.0009957255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010346396,0.0000076410415,0.000105935775,0.00002528403,0.0000035281764,0.00003052592,0.00010871493,0.00051720685,0.0001576337,0.995507,0.0009008943,0.002625385],"study_design_scores_gemma":[0.0000030073497,0.0000029125615,0.00007919712,0.0000167813,0.0000031006573,0.000053969183,0.000049117618,0.0017596541,0.00010741419,0.99609816,0.00182299,0.0000036094702],"about_ca_topic_score_codex":0.0014122064,"about_ca_topic_score_gemma":0.0015890464,"teacher_disagreement_score":0.0064307097,"about_ca_system_score_codex":0.0024703473,"about_ca_system_score_gemma":0.00065711426,"threshold_uncertainty_score":0.021512866},"labels":[],"label_agreement":null},{"id":"W65253951","doi":"","title":"Short Even Cycles In Cages With Odd Girth.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Girth (graph theory); Combinatorics","score_opus":0.014433864473765129,"score_gpt":0.24293363922177155,"score_spread":0.22849977474800642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W65253951","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72907585,0.0033225992,0.120619334,0.0011097771,0.0005759008,0.00010928525,0.0010013178,0.0006990005,0.14348695],"genre_scores_gemma":[0.9512015,0.0010186315,0.02087733,0.000315737,0.00009566798,0.000119514174,0.0006559316,0.00014822901,0.025567422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99978846,0.000047036523,0.000014777934,0.000046904737,0.00003962459,0.00006323097],"domain_scores_gemma":[0.9992872,0.00025223187,0.00012303119,0.00010396848,0.00006839273,0.00016520283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001791967,0.00024127257,0.0003179277,0.00077317347,0.0010790125,0.0013753788,0.00048120136,0.00058943575,0.0072851935],"category_scores_gemma":[0.0013161466,0.00026657878,0.0003156225,0.0005868325,0.0010184194,0.0022529534,0.0013365136,0.00054369454,0.0010330938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002129844,0.000025041152,0.0013067772,0.00011944688,0.00001771298,0.00028412184,0.0003375086,0.003538978,0.006396199,0.959093,0.0042275414,0.024440661],"study_design_scores_gemma":[0.000023703951,0.00006214966,0.0008267349,0.000057461108,0.000022705175,0.00036412323,0.00034448516,0.006640303,0.004815902,0.95837563,0.02844806,0.00001880723],"about_ca_topic_score_codex":0.00060332025,"about_ca_topic_score_gemma":0.001184338,"teacher_disagreement_score":0.0072851935,"about_ca_system_score_codex":0.00043730816,"about_ca_system_score_gemma":0.00032088725,"threshold_uncertainty_score":0.024371445},"labels":[],"label_agreement":null},{"id":"W65396729","doi":"","title":"Ramsey Sets for Matchings.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Mathematical economics","score_opus":0.024114873996002283,"score_gpt":0.3199532117136208,"score_spread":0.2958383377176185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W65396729","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06126237,0.018091394,0.32452032,0.009156262,0.0019171146,0.0001857147,0.002705613,0.0013668179,0.58079433],"genre_scores_gemma":[0.79220515,0.008479147,0.090297885,0.0034763687,0.002239511,0.0004914683,0.0025091192,0.00045569128,0.09984562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998137,0.0005130625,0.0001311941,0.0005083882,0.00046783313,0.00024245393],"domain_scores_gemma":[0.99759823,0.0012640706,0.00022295039,0.00044189164,0.00027348334,0.00019928163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002020895,0.0009141602,0.0011949947,0.0041089947,0.0028759525,0.005213949,0.0016182247,0.0021324037,0.02039442],"category_scores_gemma":[0.005854827,0.0008286258,0.0014329446,0.0028191227,0.0032782976,0.014023973,0.0050297095,0.0046229395,0.004386924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012454409,0.000009329674,0.00005040694,0.000043723572,0.000007573695,0.000026718813,0.00009885665,0.00016174537,0.00014341275,0.9918937,0.0028550124,0.0046970006],"study_design_scores_gemma":[0.000005433442,0.00000512997,0.00007250271,0.000019597503,0.0000075567423,0.000086417785,0.000056629,0.00064845645,0.00013111591,0.9884143,0.010547001,0.000005758332],"about_ca_topic_score_codex":0.0011583798,"about_ca_topic_score_gemma":0.0013148962,"teacher_disagreement_score":0.02039442,"about_ca_system_score_codex":0.002699702,"about_ca_system_score_gemma":0.0007029049,"threshold_uncertainty_score":0.0682261},"labels":[],"label_agreement":null},{"id":"W65748452","doi":"","title":"Smallest defining number of r-regular k-chromatic graphs: r 1 k.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics","score_opus":0.007509431451224437,"score_gpt":0.2164806569491387,"score_spread":0.20897122549791428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W65748452","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6922359,0.0017185669,0.11004432,0.0067035523,0.0005633086,0.00018122426,0.003911235,0.001435943,0.18320598],"genre_scores_gemma":[0.9293043,0.00065896875,0.04365431,0.00080761634,0.0002683162,0.00017273001,0.0018359704,0.0004018177,0.02289589],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989153,0.00026665794,0.00006404822,0.00040680263,0.00014291206,0.00020425963],"domain_scores_gemma":[0.9946516,0.0029370019,0.00063926616,0.00058009947,0.00038704442,0.0008050674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091933995,0.00076511037,0.0008809323,0.0011205502,0.001974633,0.004038191,0.0022154546,0.001515663,0.012825415],"category_scores_gemma":[0.00450954,0.00055755023,0.00075955945,0.0010635067,0.0030209953,0.0039364635,0.0020449443,0.0027245537,0.0021749402],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003500648,0.000093098606,0.0023074443,0.00032153114,0.000034380162,0.00014608301,0.00048609564,0.0024484103,0.00911858,0.95061487,0.01567775,0.018401602],"study_design_scores_gemma":[0.00013879381,0.00013943887,0.002785532,0.000074433374,0.00009241942,0.0010853044,0.00052190234,0.010588806,0.00999621,0.9426256,0.031866137,0.00008546338],"about_ca_topic_score_codex":0.0006307106,"about_ca_topic_score_gemma":0.0008910062,"teacher_disagreement_score":0.012825415,"about_ca_system_score_codex":0.0013288669,"about_ca_system_score_gemma":0.0008949451,"threshold_uncertainty_score":0.04290521},"labels":[],"label_agreement":null},{"id":"W65884991","doi":"","title":"Minimum Degree Growth of the Iterated Line Graph.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Iterated function; Degree (music); Graph; Line (geometry); Line graph; Combinatorics; Geometry; Mathematical analysis","score_opus":0.04165766294245196,"score_gpt":0.2822595477716378,"score_spread":0.24060188482918585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W65884991","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7806354,0.0013640454,0.17127256,0.0029431267,0.00016856496,0.000060315106,0.0012395643,0.0005306123,0.041785873],"genre_scores_gemma":[0.9759454,0.0008491487,0.013554478,0.00017204958,0.00019083568,0.000075301934,0.00054666185,0.00014999276,0.008516223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995208,0.00015579145,0.000014667452,0.00009177331,0.00010907012,0.000107968146],"domain_scores_gemma":[0.9938474,0.003505862,0.0009299843,0.00040356012,0.00049846,0.000814699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007346145,0.00049222057,0.00074144086,0.0018627917,0.0008809713,0.0018745431,0.0013586786,0.0011620551,0.0047028093],"category_scores_gemma":[0.0094636865,0.00045126374,0.0005473081,0.0007409797,0.0015775949,0.0029071067,0.0010149437,0.0013328532,0.0007884214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012454191,0.00004582541,0.0023802214,0.00013267573,0.000032269454,0.00028941952,0.00030753363,0.028703826,0.0057550566,0.9450286,0.006000857,0.011199135],"study_design_scores_gemma":[0.00003160455,0.00003003369,0.0018003002,0.00002544991,0.00001691331,0.00023898212,0.000094148025,0.16360866,0.0014726605,0.8305597,0.0020994127,0.000022134094],"about_ca_topic_score_codex":0.0020766035,"about_ca_topic_score_gemma":0.00214426,"teacher_disagreement_score":0.0047028093,"about_ca_system_score_codex":0.0011860506,"about_ca_system_score_gemma":0.00046426724,"threshold_uncertainty_score":0.015732467},"labels":[],"label_agreement":null},{"id":"W65985817","doi":"","title":"Characterizing Intersection Graphs of Substars of a Star.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Star (game theory); Intersection (aeronautics); Combinatorics; Geography; Mathematical analysis; Cartography","score_opus":0.01302765539315038,"score_gpt":0.2551824923929553,"score_spread":0.24215483699980495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W65985817","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5663613,0.0005566829,0.3538249,0.00069559884,0.00013882038,0.0002719042,0.0025966468,0.0013374452,0.07421665],"genre_scores_gemma":[0.8960428,0.0003530168,0.08609281,0.00021986623,0.00010869127,0.00013299478,0.0044010165,0.00060875865,0.012039958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829537,0.00034950092,0.00011851047,0.00041828683,0.00039872708,0.00041967453],"domain_scores_gemma":[0.9914494,0.0040377434,0.0011299916,0.0012767963,0.0012626952,0.0008433147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010683449,0.0006029012,0.00088925817,0.003209075,0.0029001199,0.004569444,0.0018345097,0.0013084343,0.011611123],"category_scores_gemma":[0.007351813,0.0010046116,0.0014794912,0.003510526,0.002287909,0.007903978,0.0032223756,0.002190512,0.0022701046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037719804,0.00022888635,0.011224346,0.00021215416,0.000091613016,0.00068452564,0.0013670038,0.005061031,0.010618687,0.9318299,0.0062004793,0.032104123],"study_design_scores_gemma":[0.000027948929,0.0000953754,0.0037023914,0.00009020442,0.0001261792,0.00075244624,0.0018167171,0.021215055,0.009706828,0.94573295,0.016691871,0.00004192951],"about_ca_topic_score_codex":0.0021639008,"about_ca_topic_score_gemma":0.0028267992,"teacher_disagreement_score":0.011611123,"about_ca_system_score_codex":0.0010163094,"about_ca_system_score_gemma":0.00082992326,"threshold_uncertainty_score":0.038843095},"labels":[],"label_agreement":null},{"id":"W66104440","doi":"","title":"Critical sets in products of latin squares.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Latin square; Statistics; Food science; Chemistry","score_opus":0.00907736098431752,"score_gpt":0.21802162512139808,"score_spread":0.20894426413708056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W66104440","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4051345,0.0050797025,0.27039298,0.002247211,0.0009002975,0.00012212795,0.00048626933,0.00051684177,0.31512013],"genre_scores_gemma":[0.9318652,0.0012243652,0.031115344,0.00044252444,0.00039336405,0.0001280037,0.00029765695,0.00017250392,0.03436113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932563,0.00022652055,0.00003555119,0.0001357695,0.00016117985,0.000115451454],"domain_scores_gemma":[0.99705184,0.0016838434,0.0003683052,0.00025615378,0.00032340875,0.00031644866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005883354,0.00044811395,0.00055170094,0.0025210045,0.0019207251,0.002766872,0.00057847204,0.0008175323,0.011643782],"category_scores_gemma":[0.005004459,0.00053828466,0.00044590965,0.0010429716,0.0026719144,0.0032750226,0.0018152713,0.0012659717,0.0015004626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026485728,0.000008277738,0.00022626948,0.000030252266,0.0000054750926,0.00010106743,0.00015951412,0.0008275686,0.0007110646,0.99173903,0.0018012562,0.004363716],"study_design_scores_gemma":[0.000009773753,0.000013731442,0.00018833681,0.000027284335,0.0000068769627,0.00023025364,0.00013245779,0.0039605414,0.0009053324,0.9874297,0.0070871124,0.000008574032],"about_ca_topic_score_codex":0.00067500956,"about_ca_topic_score_gemma":0.0009798369,"teacher_disagreement_score":0.011643782,"about_ca_system_score_codex":0.0009479184,"about_ca_system_score_gemma":0.000491975,"threshold_uncertainty_score":0.03895241},"labels":[],"label_agreement":null},{"id":"W66450420","doi":"","title":"A New Technique For Constructing Pairwise Balanced Designs From Groups.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pairwise comparison; Combinatorics; Statistics","score_opus":0.01590864148593365,"score_gpt":0.20553577312519936,"score_spread":0.1896271316392657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W66450420","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061140065,0.00020287649,0.97849965,0.00016982065,0.00018910402,0.000114583796,0.00017798918,0.00055398245,0.013977987],"genre_scores_gemma":[0.12619334,0.00045742444,0.8528502,0.00044325797,0.00019575848,0.00046772588,0.0006033694,0.0003285428,0.018460337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987734,0.00034139658,0.00006560542,0.00030419364,0.00040732362,0.000108032786],"domain_scores_gemma":[0.9987166,0.00042784712,0.00011363638,0.0004470572,0.00020096911,0.00009392797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008792425,0.0008246986,0.0005707184,0.0016341739,0.001053394,0.0010062328,0.0009261632,0.0006991143,0.011795766],"category_scores_gemma":[0.0035156072,0.0005337442,0.0006870928,0.0016506033,0.0009612701,0.0020901174,0.0023190912,0.0016423794,0.0044861757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025058351,0.0001634814,0.00043855075,0.00035603432,0.000061491664,0.0002008006,0.00043388564,0.0050270814,0.04612192,0.56845564,0.016434055,0.3620565],"study_design_scores_gemma":[0.00015354586,0.00040781224,0.0004268223,0.00015230419,0.00010462534,0.0009615534,0.00019881496,0.030052712,0.04123021,0.7699097,0.15633166,0.00007029615],"about_ca_topic_score_codex":0.000334749,"about_ca_topic_score_gemma":0.00073517516,"teacher_disagreement_score":0.011795766,"about_ca_system_score_codex":0.00041743054,"about_ca_system_score_gemma":0.000657727,"threshold_uncertainty_score":0.03946072},"labels":[],"label_agreement":null},{"id":"W66989490","doi":"","title":"Connected resolving sets in graphs","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.017811914838034626,"score_gpt":0.2806273165562354,"score_spread":0.2628154017182008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W66989490","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40551463,0.0031856063,0.2754593,0.0059319832,0.00078424107,0.00026830035,0.0012453208,0.0012067865,0.3064038],"genre_scores_gemma":[0.86462206,0.0021034079,0.065700345,0.0010408504,0.0007629923,0.00030736875,0.0017400638,0.0004631124,0.06325977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99784315,0.00067793584,0.00017172389,0.000492981,0.0005630658,0.00025102065],"domain_scores_gemma":[0.99412423,0.003925773,0.0005238343,0.000552549,0.0003894897,0.00048407918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016542982,0.0010564377,0.0016612539,0.005581868,0.0066858237,0.010554651,0.0026209499,0.0030540335,0.01803585],"category_scores_gemma":[0.007780801,0.0019586242,0.0017528597,0.007685862,0.005071467,0.0141615635,0.0052855415,0.00534558,0.0025208592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015370533,0.000018883662,0.00012170376,0.000036351026,0.000008050132,0.000055427907,0.00039247246,0.00043088637,0.0002033233,0.994303,0.0010533503,0.003361198],"study_design_scores_gemma":[0.0000074643094,0.0000036941426,0.000061822226,0.000011253189,0.000011734778,0.000073993215,0.00013352289,0.0008889263,0.00020680293,0.996003,0.002591783,0.00000610515],"about_ca_topic_score_codex":0.0010120276,"about_ca_topic_score_gemma":0.0012520058,"teacher_disagreement_score":0.01803585,"about_ca_system_score_codex":0.0017953183,"about_ca_system_score_gemma":0.00077273074,"threshold_uncertainty_score":0.060335934},"labels":[],"label_agreement":null},{"id":"W67197367","doi":"","title":"A combinatorial structure of affine (a1, ..., at)-resolvable (r, l)-designs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Affine transformation; Combinatorics; Pure mathematics; Discrete mathematics","score_opus":0.008125151538911718,"score_gpt":0.19794097486648696,"score_spread":0.18981582332757524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W67197367","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46869147,0.0008710171,0.37107044,0.0012227618,0.00012806033,0.00016502713,0.0017682957,0.00068200665,0.15540098],"genre_scores_gemma":[0.93594843,0.00027069933,0.04354239,0.00024133807,0.00008999132,0.00010920055,0.00085002097,0.00007948283,0.018868407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993906,0.00018891682,0.000037958638,0.00014016271,0.00013413696,0.00010812027],"domain_scores_gemma":[0.9972652,0.001202359,0.00052563625,0.00046355263,0.00032662408,0.00021676625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048506126,0.00032714297,0.00024778012,0.0012124659,0.0010810579,0.0026228963,0.00080568425,0.00089245016,0.01187936],"category_scores_gemma":[0.0025731446,0.0004119021,0.00036239848,0.0011350818,0.0013658655,0.0016088776,0.0009115057,0.00095126044,0.0017058866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015974982,0.000064848005,0.00089528534,0.00007138317,0.000017502578,0.00031752777,0.00021804371,0.005215748,0.008353063,0.956861,0.002809873,0.025015928],"study_design_scores_gemma":[0.00007710498,0.00018470771,0.0013729054,0.000049445687,0.000039251227,0.0010535032,0.00018663332,0.027632775,0.006596233,0.94851804,0.014243395,0.000045966728],"about_ca_topic_score_codex":0.0005475234,"about_ca_topic_score_gemma":0.00088725996,"teacher_disagreement_score":0.01187936,"about_ca_system_score_codex":0.00067640183,"about_ca_system_score_gemma":0.00048427403,"threshold_uncertainty_score":0.039740384},"labels":[],"label_agreement":null},{"id":"W6738926","doi":"10.1016/0304-3940(84)90123-x","title":"Self-centered super graph of a graph and center number of a graph.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Windmill graph; Cubic graph; Butterfly graph; Graph; Combinatorics; Line graph; Voltage graph; Simplex graph; Discrete mathematics","score_opus":0.02317031662195031,"score_gpt":0.27043285598175565,"score_spread":0.24726253935980533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6738926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33361337,0.0019871935,0.5346749,0.002486445,0.0009728501,0.00026377666,0.0051297727,0.0010468968,0.11982489],"genre_scores_gemma":[0.8191393,0.0020843106,0.12627527,0.00094899815,0.0008064938,0.00038778118,0.0041073347,0.00044877437,0.045801792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993948,0.00016959014,0.000028476901,0.00021979354,0.00010978997,0.00007752689],"domain_scores_gemma":[0.9976102,0.0008375508,0.00056311296,0.0003518352,0.0003038336,0.0003334821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004690344,0.00056744006,0.00061528187,0.0025312917,0.0009292707,0.001517143,0.0007287022,0.00074376987,0.015544363],"category_scores_gemma":[0.002075258,0.0003092265,0.0007197024,0.0016803833,0.0016723115,0.002233341,0.00095370755,0.000986605,0.0022799887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009546253,0.00004832392,0.0011349974,0.00025374698,0.000055016866,0.00038546431,0.00033581443,0.0027896685,0.0064739003,0.95269555,0.007277295,0.0284548],"study_design_scores_gemma":[0.000025998941,0.0000779116,0.0026957286,0.000045569206,0.000044016568,0.0010549927,0.00016785468,0.014840796,0.0021074584,0.94138294,0.03752342,0.00003324006],"about_ca_topic_score_codex":0.00083471235,"about_ca_topic_score_gemma":0.0013373883,"teacher_disagreement_score":0.015544363,"about_ca_system_score_codex":0.0008086471,"about_ca_system_score_gemma":0.0004488086,"threshold_uncertainty_score":0.05200106},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.025517570764678796,"score_gpt":0.2851068964393023,"score_spread":0.2595893256746235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W67537369","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8997984,0.00016728338,0.05732026,0.00024392709,0.000046958467,0.000066984765,0.00063041755,0.0001864587,0.041539423],"genre_scores_gemma":[0.97563386,0.00009096212,0.019207593,0.00007786571,0.000014687153,0.00004242802,0.00058913365,0.000023799916,0.0043198294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99984264,0.000031300548,0.000009307445,0.00003296153,0.000050468014,0.000033401917],"domain_scores_gemma":[0.9990897,0.00026110638,0.00021164607,0.00016149411,0.00014252674,0.00013353137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016959484,0.00018924748,0.00016061778,0.0005322265,0.0007772782,0.000509525,0.00038889662,0.00023508874,0.002977206],"category_scores_gemma":[0.00087688986,0.00015357147,0.00026412526,0.00049395044,0.00060729176,0.00070954766,0.00063198386,0.00054375053,0.0001867512],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018765428,0.000055275323,0.0027375456,0.00016610223,0.000024087278,0.0007588208,0.00064968056,0.009821281,0.024989445,0.9328874,0.003169284,0.024553511],"study_design_scores_gemma":[0.00005999447,0.000084289575,0.0050641005,0.000042205545,0.00003791946,0.0013519789,0.0006722716,0.08295523,0.012745701,0.8784279,0.018524496,0.000033898137],"about_ca_topic_score_codex":0.0023527415,"about_ca_topic_score_gemma":0.0068361717,"teacher_disagreement_score":0.002977206,"about_ca_system_score_codex":0.0007343331,"about_ca_system_score_gemma":0.00051433017,"threshold_uncertainty_score":0.009959698},"labels":[],"label_agreement":null},{"id":"W67599134","doi":"","title":"On the Quaternary Projection of Binary Linear Block Codes.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Quaternary; Binary number; Projection (relational algebra); Block (permutation group theory); Arithmetic; Combinatorics; Algorithm; Geology; Paleontology","score_opus":0.01500699985465057,"score_gpt":0.24732202664166197,"score_spread":0.2323150267870114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W67599134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19992988,0.006600221,0.469695,0.00406179,0.0014912076,0.00018036764,0.0012518181,0.00045904616,0.3163307],"genre_scores_gemma":[0.85603034,0.0062053157,0.072387315,0.0014694973,0.0013775066,0.00021986778,0.0010321225,0.0002638474,0.061014038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991159,0.00029248424,0.000033274282,0.00008228336,0.0003105069,0.00016560983],"domain_scores_gemma":[0.9987097,0.00055226195,0.0001530755,0.00020573766,0.00023395626,0.00014521675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070996536,0.00068832166,0.00061902544,0.0011871216,0.0011457376,0.0018666426,0.0005521131,0.000930719,0.0070658387],"category_scores_gemma":[0.003711794,0.00036309214,0.0003981897,0.0013127733,0.0023042448,0.0034239942,0.0023320187,0.002160514,0.0025026035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003156994,0.000012559727,0.000096159136,0.000027976648,0.0000035220576,0.00005717265,0.00007378848,0.001750714,0.0007867964,0.987079,0.0029423125,0.0071383263],"study_design_scores_gemma":[0.000010417131,0.000023972827,0.00013371774,0.000028604974,0.0000035387147,0.00013117393,0.000035788456,0.01198717,0.0006256236,0.9806755,0.006332398,0.000012093179],"about_ca_topic_score_codex":0.00074946997,"about_ca_topic_score_gemma":0.0008327573,"teacher_disagreement_score":0.0070658387,"about_ca_system_score_codex":0.00068229606,"about_ca_system_score_gemma":0.0008433456,"threshold_uncertainty_score":0.023637593},"labels":[],"label_agreement":null},{"id":"W68092451","doi":"","title":"Generalized Fibonacci polynomial of graph.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Mathematics; Combinatorics; Graph; Fibonacci polynomials; Discrete mathematics; Orthogonal polynomials; Difference polynomials","score_opus":0.02513507556700114,"score_gpt":0.2826466010507899,"score_spread":0.2575115254837888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W68092451","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19695848,0.0049548796,0.17780401,0.0054514464,0.002243939,0.00009706162,0.0015416911,0.0006618185,0.6102866],"genre_scores_gemma":[0.8710276,0.0023295814,0.0419801,0.0010989648,0.0010648124,0.000114020826,0.00076104235,0.00022418195,0.08139981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996007,0.00007289879,0.000011334883,0.00009057505,0.00012626027,0.00009825239],"domain_scores_gemma":[0.9994777,0.0002080263,0.00004878149,0.00008240018,0.000111810914,0.00007144006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035230693,0.00048788104,0.0007164454,0.0022268794,0.0016936903,0.002146222,0.0007556594,0.0008743897,0.015494969],"category_scores_gemma":[0.0018442237,0.0002640555,0.0007248241,0.0016305045,0.0021221177,0.0025123763,0.0011163901,0.002086536,0.0033862172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001361479,0.000004671986,0.00007462635,0.000028844399,0.0000030088356,0.000047965255,0.000069522655,0.00037534235,0.0003969861,0.98844725,0.0043636938,0.006174346],"study_design_scores_gemma":[0.000007516672,0.000007745291,0.00019787569,0.000012072221,0.0000046242853,0.00020108053,0.00004956639,0.0027692898,0.00029135926,0.9845083,0.011941281,0.000009443586],"about_ca_topic_score_codex":0.0023503934,"about_ca_topic_score_gemma":0.0032170957,"teacher_disagreement_score":0.015494969,"about_ca_system_score_codex":0.0016596707,"about_ca_system_score_gemma":0.0007639821,"threshold_uncertainty_score":0.051835835},"labels":[],"label_agreement":null},{"id":"W68153034","doi":"","title":"Szeged Index of armchair polyhex Nanotube.","year":2008,"lang":"hu","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Topological index; Nanotube; Molecular graph; Index (typography); Graph; Mathematics; Bond graph; Combinatorics; Materials science; Nanotechnology; Carbon nanotube; Computer science","score_opus":0.02537950164128944,"score_gpt":0.2624510424169788,"score_spread":0.23707154077568937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W68153034","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8285749,0.0018528474,0.07643358,0.00039547755,0.0003503471,0.0000610644,0.0012170366,0.00033470118,0.09078004],"genre_scores_gemma":[0.98274106,0.0004285899,0.007971247,0.00005328414,0.000046378245,0.000045049142,0.00034904244,0.000053941967,0.008311515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99989974,0.000012767905,0.000009229449,0.000020721274,0.000036315363,0.000021236812],"domain_scores_gemma":[0.99984825,0.000027320511,0.00003889751,0.000015164562,0.000032641976,0.00003768516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013098794,0.00028665943,0.00028009506,0.0022339202,0.00050028745,0.0008963861,0.00027487995,0.00035662862,0.0057210336],"category_scores_gemma":[0.00032081475,0.00007913434,0.00016817421,0.0008040285,0.0007838476,0.00092126813,0.0004783777,0.00025744273,0.0006757263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017618382,0.00004310535,0.0023515609,0.00017206938,0.000020217949,0.0004410331,0.00017999727,0.012899987,0.037437513,0.9186054,0.0031925477,0.02448041],"study_design_scores_gemma":[0.00003041432,0.0001718782,0.008698439,0.000065837994,0.000029430506,0.0011659907,0.0003108333,0.15742809,0.032192826,0.78405064,0.015750583,0.000105008636],"about_ca_topic_score_codex":0.00029099028,"about_ca_topic_score_gemma":0.0003853618,"teacher_disagreement_score":0.0057210336,"about_ca_system_score_codex":0.00047392433,"about_ca_system_score_gemma":0.00019874149,"threshold_uncertainty_score":0.019138753},"labels":[],"label_agreement":null},{"id":"W68296954","doi":"","title":"The number of independent sets intersecting the set of leaves in trees.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Set (abstract data type); Combinatorics; Computer science; Programming language","score_opus":0.02028516209727581,"score_gpt":0.3224003603183159,"score_spread":0.3021151982210401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W68296954","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79696095,0.004824886,0.08642228,0.003014595,0.00066939904,0.00013703435,0.009977594,0.0008643394,0.09712876],"genre_scores_gemma":[0.96075076,0.0017287014,0.023377085,0.00021202156,0.0004512777,0.00018948987,0.003612176,0.00019286344,0.0094857635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978022,0.00047888054,0.00021540913,0.0004932208,0.00064573553,0.00036451293],"domain_scores_gemma":[0.97689635,0.01612193,0.0022559306,0.0016303697,0.0012374972,0.0018579816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018018854,0.00065944367,0.0012954953,0.0045803143,0.0025047688,0.00496842,0.0026512255,0.0020153967,0.010980633],"category_scores_gemma":[0.020591974,0.0007239784,0.00079851307,0.0032587394,0.0031214608,0.0064471187,0.002098105,0.0022058485,0.0016580897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012771008,0.0002260464,0.027127633,0.0008610246,0.00034879145,0.0008509678,0.0012927649,0.016145557,0.014171636,0.8367772,0.022153037,0.078768186],"study_design_scores_gemma":[0.00010987207,0.00014996521,0.015260374,0.00020032914,0.0003342572,0.004508227,0.0008865106,0.040236644,0.010802114,0.90402627,0.023400346,0.000084954714],"about_ca_topic_score_codex":0.000563159,"about_ca_topic_score_gemma":0.0008154798,"teacher_disagreement_score":0.010980633,"about_ca_system_score_codex":0.0011672376,"about_ca_system_score_gemma":0.0007199788,"threshold_uncertainty_score":0.036733866},"labels":[],"label_agreement":null},{"id":"W68466192","doi":"","title":"Geometrically Distributed Random Variables And Permutations Avoiding Consecutive 3-Letter Patterns.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.010723194242734557,"score_gpt":0.22109577845445608,"score_spread":0.21037258421172153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W68466192","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20651868,0.0022084904,0.7297071,0.0052571506,0.00085807696,0.0002504714,0.0011337424,0.0011137642,0.052952565],"genre_scores_gemma":[0.85153145,0.0013996018,0.105567925,0.0013225685,0.0007603195,0.0005973126,0.0011725748,0.00025559159,0.037392683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959038,0.0020227511,0.00018845189,0.00059234415,0.0007067286,0.0005859712],"domain_scores_gemma":[0.98799324,0.0070825676,0.0016983602,0.0018882928,0.00075944245,0.0005780557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024258338,0.0007302326,0.0011212864,0.0023604736,0.002139575,0.0043964484,0.001908186,0.0022331306,0.008245626],"category_scores_gemma":[0.020235334,0.0006335057,0.0009830545,0.002849514,0.003954258,0.005298559,0.0029142727,0.0028673303,0.003455948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009677301,0.000027507858,0.000537682,0.000028649345,0.000017147651,0.00019308337,0.000081956794,0.0056761834,0.00051195384,0.9796214,0.0034874785,0.0097201625],"study_design_scores_gemma":[0.00004276259,0.000029057117,0.00024626483,0.000026034115,0.00001608339,0.00028825426,0.00007199748,0.031955216,0.00069107994,0.96022433,0.0063804826,0.000028429033],"about_ca_topic_score_codex":0.0007419869,"about_ca_topic_score_gemma":0.0012754344,"teacher_disagreement_score":0.008245626,"about_ca_system_score_codex":0.001729999,"about_ca_system_score_gemma":0.0015829002,"threshold_uncertainty_score":0.027584314},"labels":[],"label_agreement":null},{"id":"W68623258","doi":"","title":"Special Face Numbering of Plane Quartic Graphs.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Numbering; Quartic function; Mathematics; Face (sociological concept); Plane (geometry); Combinatorics; Geometry; Pure mathematics; Algorithm; Linguistics; Philosophy","score_opus":0.008941546285403027,"score_gpt":0.2127337850931771,"score_spread":0.20379223880777408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W68623258","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64694536,0.00096599734,0.10208946,0.0018910676,0.0006155467,0.00008174691,0.0008003699,0.00058595446,0.2460245],"genre_scores_gemma":[0.9566003,0.0004288092,0.02271198,0.00030645815,0.00021312771,0.00005426167,0.00068086677,0.000121568955,0.018882578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996306,0.000078523866,0.000017990385,0.000095905685,0.00008687308,0.000090124006],"domain_scores_gemma":[0.99912614,0.00029576794,0.00015400726,0.0002082113,0.00009155301,0.00012425623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003357436,0.00031273774,0.00051699765,0.0012183894,0.001373189,0.0022084822,0.00090453733,0.00096723513,0.009710545],"category_scores_gemma":[0.0015882327,0.00027695234,0.0004466663,0.0009555917,0.0015948913,0.0024823262,0.0011316512,0.0013991839,0.0011685286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088051616,0.00003695796,0.0006931079,0.00007265128,0.0000070015026,0.00012955384,0.00018423235,0.00237951,0.002829686,0.96114147,0.006444311,0.02599337],"study_design_scores_gemma":[0.00001908769,0.000022823937,0.00071716594,0.000022972652,0.000009008213,0.0003201772,0.00017155494,0.0109353345,0.0016725892,0.9736502,0.012445379,0.000013655024],"about_ca_topic_score_codex":0.0008564179,"about_ca_topic_score_gemma":0.0013172991,"teacher_disagreement_score":0.009710545,"about_ca_system_score_codex":0.0009251601,"about_ca_system_score_gemma":0.0002957199,"threshold_uncertainty_score":0.03248501},"labels":[],"label_agreement":null},{"id":"W68678057","doi":"","title":"Some Identities Involving the Generalized Fibonacci and Lucas Numbers.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Mathematics; Lucas number; Lucas sequence; Fibonacci polynomials; Pisano period; Combinatorics; Orthogonal polynomials","score_opus":0.00948353745939186,"score_gpt":0.25526689411412834,"score_spread":0.24578335665473647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W68678057","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08633817,0.022789849,0.12139253,0.009224604,0.0037042005,0.0001231968,0.0007906247,0.00032079796,0.75531614],"genre_scores_gemma":[0.69871986,0.01427686,0.075845964,0.0031466687,0.0043138643,0.00024077168,0.0007211068,0.00029161756,0.20244324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939716,0.00017120583,0.00003770712,0.00007349257,0.00022686062,0.00009356841],"domain_scores_gemma":[0.9991999,0.00033427036,0.00009549955,0.00010399173,0.00019482984,0.00007146627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094096403,0.0007171493,0.00064886746,0.002613192,0.0029470187,0.0035142542,0.0008634235,0.0016153844,0.012292985],"category_scores_gemma":[0.0035825416,0.00044232683,0.0010231147,0.002109442,0.0028665792,0.005973242,0.0015984526,0.0023082176,0.002906247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003211274,0.000003095231,0.000032843167,0.000016555236,0.000001413197,0.00005426291,0.00006381294,0.00009221757,0.00009610028,0.9945068,0.002475433,0.0026543138],"study_design_scores_gemma":[0.000002902886,0.0000026527746,0.000075278374,0.000013921434,0.0000025824836,0.00010485611,0.000039928294,0.00052917545,0.00009271132,0.9898801,0.009250255,0.0000056144777],"about_ca_topic_score_codex":0.0018729478,"about_ca_topic_score_gemma":0.0027792724,"teacher_disagreement_score":0.012292985,"about_ca_system_score_codex":0.0018657712,"about_ca_system_score_gemma":0.00094982825,"threshold_uncertainty_score":0.041124105},"labels":[],"label_agreement":null},{"id":"W68998160","doi":"","title":"Maximum Complementary P3-Packings of Kv.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Statistics","score_opus":0.008776974851571239,"score_gpt":0.20190988841245586,"score_spread":0.1931329135608846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W68998160","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65400463,0.00064663915,0.118724845,0.0011502459,0.00020192841,0.00010806265,0.0025803945,0.00053236657,0.22205092],"genre_scores_gemma":[0.9437045,0.0003190605,0.03492014,0.00023563253,0.00006644691,0.00006985007,0.0017762093,0.00018471266,0.018723466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929714,0.00016776861,0.000038699327,0.000112530804,0.0001561607,0.000227615],"domain_scores_gemma":[0.9976373,0.0012054764,0.00025608554,0.00035106545,0.00026062285,0.0002895488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039339685,0.0005625139,0.0006042997,0.0011686382,0.0016942582,0.0026041921,0.00070179545,0.0011824421,0.019127544],"category_scores_gemma":[0.0041179135,0.0006447272,0.00050790375,0.0015021724,0.0012679972,0.0024069909,0.0018463361,0.0012391572,0.002953607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010232187,0.00021679934,0.0031047626,0.0004453895,0.00007208305,0.0010267833,0.00091001624,0.013858747,0.02150761,0.8698883,0.026251705,0.06169451],"study_design_scores_gemma":[0.00011598125,0.00013993186,0.004094026,0.00016174816,0.000070001464,0.0017134161,0.00094551116,0.059962716,0.020488178,0.88664603,0.025616428,0.000045954646],"about_ca_topic_score_codex":0.0012648857,"about_ca_topic_score_gemma":0.0017702956,"teacher_disagreement_score":0.019127544,"about_ca_system_score_codex":0.0008411486,"about_ca_system_score_gemma":0.0005509856,"threshold_uncertainty_score":0.06398803},"labels":[],"label_agreement":null},{"id":"W69266142","doi":"","title":"New Binary Sequences of Length 4p with Optimal Autocorrelation Magnitude.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Autocorrelation; Binary number; Magnitude (astronomy); Statistics; Arithmetic; Astrophysics; Physics","score_opus":0.01346012957703902,"score_gpt":0.2181718340643522,"score_spread":0.20471170448731318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W69266142","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39153874,0.006811321,0.47534525,0.005150521,0.002169612,0.0004201238,0.002132501,0.0013874277,0.11504452],"genre_scores_gemma":[0.7999523,0.0013416924,0.16938828,0.0007178131,0.00042698163,0.0003162904,0.0012078728,0.0001712561,0.026477568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991683,0.00017912823,0.0000668906,0.00011651262,0.00033735918,0.00013184517],"domain_scores_gemma":[0.9978655,0.0008643809,0.00036842533,0.00027996954,0.0003538192,0.00026802538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007347094,0.0006011471,0.0005387628,0.0013633047,0.00070952775,0.0014984795,0.0007367778,0.0011301074,0.0062287673],"category_scores_gemma":[0.0054339278,0.00050911354,0.00024783445,0.0013170287,0.0009763528,0.0018379136,0.0017058004,0.0011673294,0.0017332993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013855991,0.00022642365,0.0014222658,0.00040182445,0.000048168673,0.0012165809,0.00032552748,0.015880482,0.09979463,0.6912471,0.012761564,0.17528974],"study_design_scores_gemma":[0.0005218123,0.0008291501,0.003118532,0.0003512547,0.0000969733,0.005029865,0.0002950277,0.19871327,0.12634753,0.58463514,0.079828,0.00023342553],"about_ca_topic_score_codex":0.00023944429,"about_ca_topic_score_gemma":0.00066533,"teacher_disagreement_score":0.0062287673,"about_ca_system_score_codex":0.0009144681,"about_ca_system_score_gemma":0.0010876014,"threshold_uncertainty_score":0.020837307},"labels":[],"label_agreement":null},{"id":"W69315576","doi":"","title":"A New Perspective on the Union-Closed Sets Conjecture.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematics and Applications","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Conjecture; Perspective (graphical); Combinatorics; Mathematical economics; Pure mathematics; Geometry","score_opus":0.03567729037421386,"score_gpt":0.3137993830530727,"score_spread":0.27812209267885885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W69315576","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014743319,0.026233999,0.20710765,0.19653775,0.010855165,0.00003845294,0.0008540459,0.0005212509,0.54310834],"genre_scores_gemma":[0.60301524,0.038328774,0.14043604,0.05845103,0.037595563,0.00028820912,0.0019152855,0.0008411006,0.11912872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971727,0.00095798017,0.00010756864,0.0006973124,0.00078426505,0.00028008406],"domain_scores_gemma":[0.99337244,0.0042346106,0.000331711,0.0009331544,0.00056570827,0.000562414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003476623,0.00089798047,0.0017676195,0.003161337,0.005524432,0.011111843,0.0030643141,0.0060410937,0.023015302],"category_scores_gemma":[0.008720539,0.00065179757,0.0013929171,0.004267448,0.014620335,0.039582897,0.0069339545,0.012175663,0.0038210968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051278507,0.0000055820556,0.000032755226,0.00001560842,0.0000018050233,0.000024644854,0.00006619963,0.000061433035,0.00003265953,0.9919857,0.0056975232,0.0020710027],"study_design_scores_gemma":[0.0000036071604,0.0000028341508,0.000029055793,0.00001562525,0.000001494021,0.00005885541,0.0000705026,0.00028813505,0.000031352603,0.9824624,0.017032247,0.000003845952],"about_ca_topic_score_codex":0.0016482898,"about_ca_topic_score_gemma":0.0017882216,"teacher_disagreement_score":0.023015302,"about_ca_system_score_codex":0.0030367104,"about_ca_system_score_gemma":0.0012615402,"threshold_uncertainty_score":0.07699382},"labels":[],"label_agreement":null},{"id":"W69622806","doi":"","title":"Remarks on a general model of a random digraph.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Digraph; Mathematics; Combinatorics","score_opus":0.03522067822346185,"score_gpt":0.2683219233748625,"score_spread":0.23310124515140063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W69622806","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031822797,0.0058803945,0.20611246,0.18433557,0.0050880406,0.00021533869,0.0019659584,0.00097071443,0.5636088],"genre_scores_gemma":[0.74502534,0.008589893,0.04559139,0.06557457,0.0114083085,0.0006907651,0.0009356663,0.0005982938,0.12158586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981628,0.00080336176,0.00005830165,0.00036674974,0.0003965957,0.00021215022],"domain_scores_gemma":[0.9944185,0.0035059936,0.00040971767,0.00074770453,0.00041098407,0.00050711585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025334214,0.0010584253,0.0014605799,0.0017284869,0.0027330662,0.0038692623,0.0035945144,0.006186121,0.04255652],"category_scores_gemma":[0.009919761,0.0005777541,0.0018629177,0.0014218477,0.0056653344,0.011202693,0.0033454213,0.0052974606,0.0042007836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006430511,0.000005674419,0.000039807634,0.000021126114,0.0000041941453,0.00008413408,0.000046578956,0.0006120018,0.00004625806,0.99033654,0.00820793,0.000589266],"study_design_scores_gemma":[0.000009381532,0.0000068642066,0.000064748754,0.000016189642,0.000003371154,0.00007856492,0.000036217443,0.0019436848,0.000020987029,0.99077374,0.0070395134,0.0000068030313],"about_ca_topic_score_codex":0.0029961886,"about_ca_topic_score_gemma":0.0029403863,"teacher_disagreement_score":0.04255652,"about_ca_system_score_codex":0.0022454092,"about_ca_system_score_gemma":0.0007098094,"threshold_uncertainty_score":0.14236575},"labels":[],"label_agreement":null},{"id":"W70115582","doi":"","title":"On Determining the 2-Packing and Domination Numbers of the Cartesian Product of Certain Graphs.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Mathematics; Product (mathematics); Combinatorics; Discrete mathematics; Geometry","score_opus":0.00754509029648136,"score_gpt":0.21210140087665727,"score_spread":0.2045563105801759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W70115582","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8385339,0.0019863753,0.10720398,0.0013700206,0.00013380371,0.000071993316,0.0013976215,0.00029687322,0.04900545],"genre_scores_gemma":[0.93633264,0.0010552714,0.053873878,0.0002211332,0.00016999233,0.00009266134,0.0016677348,0.00011344425,0.0064731278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902546,0.00031484975,0.00006253165,0.00024161834,0.0001728312,0.00018271159],"domain_scores_gemma":[0.98841643,0.0090506775,0.001082433,0.0006011189,0.0003793298,0.00047007677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013513989,0.00063980673,0.00075927976,0.002302965,0.0013026107,0.002856283,0.001195265,0.0012515712,0.006777245],"category_scores_gemma":[0.011175149,0.0006766594,0.00049563113,0.0022756325,0.002553752,0.0052019157,0.0013698452,0.0013862626,0.00096082425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073494605,0.00026939323,0.019010248,0.0005066436,0.000077059995,0.0004283933,0.0012446762,0.037528776,0.008182352,0.84226847,0.015930342,0.07381872],"study_design_scores_gemma":[0.00005601454,0.00008728775,0.0064883763,0.00007779705,0.00003099973,0.0006304095,0.0006202873,0.062017635,0.004425475,0.9187687,0.0067469855,0.000050078786],"about_ca_topic_score_codex":0.0016591098,"about_ca_topic_score_gemma":0.0022741086,"teacher_disagreement_score":0.006777245,"about_ca_system_score_codex":0.0011021218,"about_ca_system_score_gemma":0.0005517948,"threshold_uncertainty_score":0.022672176},"labels":[],"label_agreement":null},{"id":"W70284720","doi":"","title":"K-dominating sets of P[2k+2]xP[n] and P[m]xP[n].","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.010486811885346777,"score_gpt":0.23344293085394574,"score_spread":0.22295611896859896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W70284720","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6673161,0.0023044301,0.13597506,0.007754629,0.0004702629,0.0006956842,0.012914461,0.0008433596,0.17172597],"genre_scores_gemma":[0.86099535,0.0010916104,0.06848885,0.0010590375,0.00024475387,0.0005094735,0.011841429,0.00028719168,0.05548233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983718,0.00031819814,0.00011667649,0.00041734913,0.00039674074,0.0003792853],"domain_scores_gemma":[0.99453026,0.002538761,0.0006241561,0.0007906161,0.00070076203,0.00081533106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011503055,0.0007101125,0.00077625783,0.0012571849,0.0028416354,0.004451077,0.0015107149,0.0012447205,0.010130124],"category_scores_gemma":[0.006376769,0.00084883225,0.00073124026,0.0013485176,0.0015877383,0.004354579,0.0029652794,0.0022435938,0.0018599806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020300047,0.00034388684,0.00576077,0.0006288322,0.00019881623,0.0011999871,0.0017945284,0.01382726,0.018356051,0.8830912,0.034630354,0.038138267],"study_design_scores_gemma":[0.00021414338,0.00013980219,0.0071052276,0.000173811,0.00011471915,0.0026823534,0.0008584115,0.032751236,0.018459845,0.8806148,0.05679113,0.000094505354],"about_ca_topic_score_codex":0.001577395,"about_ca_topic_score_gemma":0.0021211214,"teacher_disagreement_score":0.010130124,"about_ca_system_score_codex":0.0020226904,"about_ca_system_score_gemma":0.0013233545,"threshold_uncertainty_score":0.033888698},"labels":[],"label_agreement":null},{"id":"W7045266","doi":"","title":"On Some Chromatic Properties Of Jahangir Graph.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Graph; Combinatorics","score_opus":0.014492847829718289,"score_gpt":0.2169077993031049,"score_spread":0.2024149514733866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7045266","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42583683,0.0036816723,0.14558339,0.008478416,0.0006279793,0.00016171875,0.0020872361,0.000589003,0.41295367],"genre_scores_gemma":[0.9107984,0.0024125741,0.04366622,0.0012175605,0.0006860064,0.00016668667,0.0016193442,0.00034330052,0.03908996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930346,0.00020000145,0.000028028544,0.00015870607,0.00015162322,0.0001581318],"domain_scores_gemma":[0.9961888,0.002331285,0.00040439246,0.00040056068,0.0002906029,0.0003844015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010128682,0.00050452707,0.0005854487,0.0022918864,0.003053771,0.0028809619,0.0014026794,0.001471322,0.017916422],"category_scores_gemma":[0.0048448076,0.00055220886,0.0006719323,0.0027868568,0.0026821424,0.0074908403,0.001946694,0.0030050257,0.0019328577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047510555,0.00003446674,0.00049791444,0.000080901846,0.000008378596,0.000049378195,0.00022785805,0.0015515995,0.0009388928,0.9811267,0.007210899,0.008225416],"study_design_scores_gemma":[0.000017599272,0.000019691593,0.0008694692,0.000031283238,0.000016608667,0.00014095909,0.00027620388,0.0072868704,0.00071668066,0.98111373,0.00949095,0.000020050162],"about_ca_topic_score_codex":0.0025274998,"about_ca_topic_score_gemma":0.0033625977,"teacher_disagreement_score":0.017916422,"about_ca_system_score_codex":0.002094212,"about_ca_system_score_gemma":0.000723779,"threshold_uncertainty_score":0.059936345},"labels":[],"label_agreement":null},{"id":"W70538647","doi":"","title":"On Multiplicity of triangles in 2-edge colouring of graphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Multiplicity (mathematics); Combinatorics; Enhanced Data Rates for GSM Evolution; Geometry; Artificial intelligence; Computer science","score_opus":0.014051823661386633,"score_gpt":0.24355066159426683,"score_spread":0.2294988379328802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W70538647","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6041229,0.0043480853,0.24415809,0.006949151,0.0013293186,0.00012344417,0.0014520596,0.00069534336,0.1368217],"genre_scores_gemma":[0.9383882,0.0012895596,0.04264408,0.00061506167,0.0006579803,0.00012343658,0.0006087662,0.0002471536,0.015425689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997581,0.0008222613,0.00016401934,0.0004665432,0.00045776425,0.0005084269],"domain_scores_gemma":[0.9809904,0.0130925495,0.0019227207,0.0016505988,0.00088837143,0.0014553528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022918873,0.00076666015,0.0014726067,0.0034076206,0.002921706,0.0044064843,0.003039632,0.0030012953,0.012720744],"category_scores_gemma":[0.016897889,0.001044359,0.00096344406,0.003159537,0.0045606205,0.010136913,0.0039079385,0.0029520586,0.0016274854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022408288,0.00006085632,0.003236023,0.00019100349,0.00002678885,0.00019496918,0.00052723,0.0066528795,0.0019042549,0.9595435,0.0072955373,0.020142885],"study_design_scores_gemma":[0.0000320618,0.00003267767,0.0011964213,0.000061726045,0.000025047648,0.00040323247,0.00032231657,0.017686335,0.0010810683,0.9745273,0.0045968913,0.000034936238],"about_ca_topic_score_codex":0.0015575754,"about_ca_topic_score_gemma":0.0019624962,"teacher_disagreement_score":0.012720744,"about_ca_system_score_codex":0.0020798321,"about_ca_system_score_gemma":0.00063183694,"threshold_uncertainty_score":0.042555094},"labels":[],"label_agreement":null},{"id":"W70810164","doi":"","title":"The Classification of Regular Graphs on f-colorings.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.023221544999808125,"score_gpt":0.226972505765043,"score_spread":0.20375096076523486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W70810164","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6345696,0.007923968,0.19455186,0.009934951,0.0011279024,0.00018675275,0.007951122,0.0014305331,0.14232336],"genre_scores_gemma":[0.9248073,0.0023708986,0.042712536,0.00094488874,0.00085818814,0.00013409133,0.005400748,0.0002784275,0.022492995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992207,0.0001835378,0.000043002914,0.00022158044,0.00013736493,0.00019379135],"domain_scores_gemma":[0.9954543,0.0025187174,0.000515925,0.0006782806,0.00033504076,0.00049776357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008618901,0.000646572,0.0008536978,0.002865195,0.0018270932,0.0041114986,0.0016034715,0.0019196037,0.009135478],"category_scores_gemma":[0.006341442,0.0005328727,0.00071956415,0.0027449618,0.0023068683,0.0055060876,0.001489072,0.0021401963,0.0013680181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000244536,0.000098805445,0.0053518093,0.00027289902,0.000039023915,0.00009032754,0.00040681465,0.006588817,0.001757601,0.87297356,0.04658253,0.06559333],"study_design_scores_gemma":[0.000042761618,0.000032541906,0.0030016687,0.000106044456,0.000027743852,0.0002982543,0.00030205655,0.023335574,0.0007903258,0.9493526,0.022681821,0.000028629314],"about_ca_topic_score_codex":0.0034354727,"about_ca_topic_score_gemma":0.0023267826,"teacher_disagreement_score":0.009135478,"about_ca_system_score_codex":0.0021734845,"about_ca_system_score_gemma":0.00081687234,"threshold_uncertainty_score":0.030561268},"labels":[],"label_agreement":null},{"id":"W71060424","doi":"","title":"On Harmonious Labelings of Some Cycle Related Graphs.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.011237612595566547,"score_gpt":0.20557688974523103,"score_spread":0.19433927714966448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W71060424","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51569784,0.0013425314,0.28089544,0.004237896,0.0002771821,0.00025522147,0.0015120233,0.0008648819,0.19491693],"genre_scores_gemma":[0.8578088,0.0009913052,0.10409349,0.0011381891,0.00025886166,0.0002515308,0.0018014726,0.0003339654,0.033322386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990381,0.00034695104,0.000047047142,0.00021424645,0.00016363553,0.00019002412],"domain_scores_gemma":[0.99688524,0.0016159398,0.00039217187,0.000550544,0.00023128898,0.00032480955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092249084,0.0004048825,0.0006516746,0.0017686994,0.0024717588,0.0022940875,0.0012174671,0.0013893798,0.010945212],"category_scores_gemma":[0.004989904,0.00051900174,0.00071787275,0.0018785845,0.002026307,0.004962843,0.0025968407,0.0019428948,0.0012748264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058673726,0.00004674265,0.0005053558,0.00007451567,0.00001314189,0.00006970602,0.00028942036,0.0026137603,0.0010543785,0.97269124,0.005703272,0.01687985],"study_design_scores_gemma":[0.000020047413,0.000020355543,0.00042715092,0.000023698389,0.00001556056,0.00013963164,0.0002629245,0.010123273,0.00088139466,0.97967416,0.008400431,0.000011309876],"about_ca_topic_score_codex":0.001165375,"about_ca_topic_score_gemma":0.0017680294,"teacher_disagreement_score":0.010945212,"about_ca_system_score_codex":0.0012547886,"about_ca_system_score_gemma":0.00051609514,"threshold_uncertainty_score":0.03661537},"labels":[],"label_agreement":null},{"id":"W7117406377","doi":"10.61091/ars165-05","title":"On error-detecting open-locating-dominating sets","year":2025,"lang":"","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Vertex (graph theory); Independent set; Graph; Set (abstract data type); Maximal independent set; Dominating set","score_opus":0.03106490125795443,"score_gpt":0.3496209828387878,"score_spread":0.3185560815808334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117406377","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22128846,0.00064489245,0.75352305,0.0016005102,0.00017637348,0.00028348246,0.0013906454,0.0008845692,0.020208102],"genre_scores_gemma":[0.8546697,0.00061094953,0.13400654,0.0006765162,0.00017413123,0.00023665657,0.0015621994,0.00024268588,0.007820608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99715483,0.0005199778,0.00020140041,0.0008002141,0.00090881233,0.00041484841],"domain_scores_gemma":[0.97678,0.015393746,0.0018094631,0.0028188487,0.0023007498,0.000897212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021346807,0.0009608823,0.0010293027,0.001453622,0.0015619819,0.0018138497,0.0027706851,0.0010930211,0.0026995365],"category_scores_gemma":[0.017708566,0.00064086093,0.0011616887,0.0025610267,0.0019438779,0.003288355,0.002556801,0.0025298018,0.000417345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057779445,0.0002357606,0.0040386,0.00063265976,0.00013487907,0.000760248,0.0012836987,0.3470643,0.012217967,0.5463773,0.011193201,0.07548351],"study_design_scores_gemma":[0.000091077854,0.00019393212,0.001152309,0.000080179474,0.000071854054,0.0008167846,0.00036855537,0.45832786,0.009293832,0.5186225,0.010913806,0.000067252986],"about_ca_topic_score_codex":0.0028070922,"about_ca_topic_score_gemma":0.002121729,"teacher_disagreement_score":0.0028070922,"about_ca_system_score_codex":0.0026163692,"about_ca_system_score_gemma":0.0012096848,"threshold_uncertainty_score":0.018983245},"labels":[],"label_agreement":null},{"id":"W7117407866","doi":"10.61091/ars165-06","title":"Some properties of generalized &lt;span class=\"math inline\"&gt;\\((k,t)\\)&lt;/span&gt;-Jacobsthal &lt;span class=\"math inline\"&gt;\\(p\\)&lt;/span&gt;-sequences","year":2025,"lang":"","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Pascal (unit); Factorization; Pascal matrix; Matrix decomposition; Algebra over a field","score_opus":0.016849332547204252,"score_gpt":0.26288812125962685,"score_spread":0.2460387887124226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117407866","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26336473,0.0009789929,0.38915518,0.0014413799,0.00120037,0.00021724796,0.0010985044,0.0009993897,0.34154418],"genre_scores_gemma":[0.7596126,0.0010916103,0.08705031,0.0011953864,0.0015096889,0.0003375587,0.0020576,0.001408899,0.14573625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930465,0.00008163368,0.000032892996,0.00019666506,0.00021035693,0.00017374891],"domain_scores_gemma":[0.9991722,0.000115627765,0.00013672649,0.0001222713,0.00028088773,0.00017232116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042855885,0.0008889735,0.0004570867,0.0011937069,0.0015388035,0.0015004713,0.00078881707,0.0006646563,0.028919153],"category_scores_gemma":[0.0016778853,0.00029170528,0.0008883986,0.0009144847,0.0014761756,0.00292067,0.0010645646,0.0016531259,0.0062307217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034602323,0.00005346275,0.0003285431,0.000047520247,0.000005530266,0.00015540374,0.00024367878,0.0007984595,0.0039519602,0.96273637,0.006269348,0.025375076],"study_design_scores_gemma":[0.000024102756,0.00010072569,0.00094114186,0.000037315134,0.000013648208,0.000545403,0.0002050806,0.016120669,0.005166006,0.93662035,0.040152762,0.00007285715],"about_ca_topic_score_codex":0.0015982257,"about_ca_topic_score_gemma":0.0016548424,"teacher_disagreement_score":0.028919153,"about_ca_system_score_codex":0.00089909806,"about_ca_system_score_gemma":0.00070378726,"threshold_uncertainty_score":0.09674424},"labels":[],"label_agreement":null},{"id":"W7117408694","doi":"10.61091/ars165-03","title":"The domatic number game played on graphs","year":2025,"lang":"","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Disjoint sets; Vertex (graph theory); Alice and Bob; Graph; Dominating set; Pairwise comparison","score_opus":0.012502352197433743,"score_gpt":0.29871535748094324,"score_spread":0.2862130052835095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117408694","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20728,0.0004236872,0.63887525,0.002149852,0.0002547949,0.00048496545,0.00131845,0.0010898617,0.14812316],"genre_scores_gemma":[0.8747166,0.00038105738,0.09852275,0.00060819875,0.00009338378,0.0004289538,0.0011086178,0.00023231484,0.023908094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973604,0.0009371812,0.00011860482,0.0005931039,0.00046021954,0.0005303742],"domain_scores_gemma":[0.9946812,0.0032823973,0.0003546399,0.0004805889,0.00036235503,0.000838756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015216513,0.0016117533,0.0010079608,0.0010570845,0.001568365,0.004003235,0.001973083,0.0014144941,0.009000009],"category_scores_gemma":[0.009453362,0.00060266914,0.000970171,0.001003381,0.0038583092,0.006316644,0.0028693886,0.00284493,0.00105319],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046900037,0.00013716909,0.00069172116,0.00011215483,0.00002551247,0.00011883249,0.0004266409,0.036555964,0.0034366522,0.93495363,0.00522885,0.017843772],"study_design_scores_gemma":[0.0001005806,0.00014578184,0.0004165985,0.000046788868,0.000020295092,0.00013508434,0.00020260082,0.20371978,0.0027876392,0.78260356,0.009762408,0.00005876238],"about_ca_topic_score_codex":0.0034461794,"about_ca_topic_score_gemma":0.003662191,"teacher_disagreement_score":0.009000009,"about_ca_system_score_codex":0.0042591244,"about_ca_system_score_gemma":0.0018055893,"threshold_uncertainty_score":0.030902267},"labels":[],"label_agreement":null},{"id":"W7117409206","doi":"10.61091/ars165-02","title":"Regular pandiagonal sparse magic squares of order \\(n\\equiv 5 \\pmod{6}\\) with density 6","year":2025,"lang":"","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Soochow University","keywords":"Magic square; Diagonal; MAGIC (telescope); Generalization; Integer (computer science); Order (exchange)","score_opus":0.010174647057699375,"score_gpt":0.2272439442437728,"score_spread":0.21706929718607343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117409206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070322186,0.00045100434,0.74060845,0.0007439165,0.0008823475,0.00032138728,0.0027966837,0.006049032,0.17782506],"genre_scores_gemma":[0.44478205,0.00045494662,0.4447567,0.0009090511,0.00028984237,0.00075044576,0.0036577643,0.0026934613,0.10170575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994444,0.00009452833,0.00003315267,0.00015926629,0.00017188469,0.00009668191],"domain_scores_gemma":[0.99936587,0.00014092804,0.000067382665,0.00017962884,0.00017970955,0.000066501096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038541364,0.0008813617,0.00062260753,0.00069459405,0.00070131675,0.0009676076,0.0008085423,0.00048156225,0.030107353],"category_scores_gemma":[0.0020999357,0.00046289605,0.00038377297,0.0010001456,0.0011294957,0.0016058924,0.0016294483,0.0012531434,0.010982317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068968907,0.00010973631,0.00073341996,0.00055571523,0.000032267122,0.00034618544,0.0003061481,0.008773971,0.04218929,0.64006686,0.073137805,0.2330589],"study_design_scores_gemma":[0.00017441559,0.00035067153,0.0007370259,0.000105844716,0.000034016317,0.00077817315,0.00022447665,0.06740169,0.07263315,0.57396555,0.2834613,0.00013371186],"about_ca_topic_score_codex":0.00059308263,"about_ca_topic_score_gemma":0.0016616106,"teacher_disagreement_score":0.030107353,"about_ca_system_score_codex":0.0003844606,"about_ca_system_score_gemma":0.00067412754,"threshold_uncertainty_score":0.100719094},"labels":[],"label_agreement":null},{"id":"W7117409928","doi":"10.61091/ars165-09","title":"On sum edge-colorings of graph products","year":2025,"lang":"","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Vertex (graph theory); Graph; Canonical normal form; Strength of a graph; Multiple edges; Extremal graph theory; Complete graph","score_opus":0.012062553462487097,"score_gpt":0.23375881193467574,"score_spread":0.22169625847218863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117409928","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18609373,0.0014754663,0.72998625,0.0009293925,0.0004963356,0.00018447604,0.0013410938,0.0015394057,0.07795387],"genre_scores_gemma":[0.65832704,0.002107618,0.28412235,0.0008555211,0.0006550169,0.00034136858,0.003713189,0.0018712594,0.048006676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983767,0.00043373206,0.000081947874,0.000466307,0.0003542321,0.0002869707],"domain_scores_gemma":[0.99655294,0.0017054603,0.00024852535,0.0006439247,0.0004847479,0.00036445432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013988015,0.0015639792,0.0012547838,0.0020677734,0.0019237952,0.003076981,0.0016138615,0.0009297086,0.012921646],"category_scores_gemma":[0.0049876906,0.00097352004,0.0017134324,0.0031473942,0.0027205728,0.005273884,0.0030228514,0.0026798104,0.0022028375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038498864,0.00013847183,0.0014694908,0.00037198456,0.00006177072,0.00023672677,0.000709989,0.042788,0.004772552,0.838007,0.013890051,0.09716905],"study_design_scores_gemma":[0.000030029267,0.000055811597,0.00038784402,0.000042821914,0.000023997905,0.00016195675,0.00012752044,0.056659337,0.0015699123,0.9322925,0.008620642,0.00002768445],"about_ca_topic_score_codex":0.002707631,"about_ca_topic_score_gemma":0.0024557903,"teacher_disagreement_score":0.012921646,"about_ca_system_score_codex":0.001833436,"about_ca_system_score_gemma":0.0009021629,"threshold_uncertainty_score":0.043227255},"labels":[],"label_agreement":null},{"id":"W7117414153","doi":"10.61091/ars165-08","title":"Generalised nice sets","year":2025,"lang":"","type":"article","venue":"Ars Combinatoria","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Junta de Andalucía; University of Cape Town; Ministerio de Ciencia e Innovación; Universidad de Málaga","keywords":"Homogeneous; Fano plane; Nice; Bracket; Plane (geometry)","score_opus":0.02443632122757952,"score_gpt":0.3153960631150289,"score_spread":0.29095974188744933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117414153","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51507384,0.0011951475,0.23493473,0.00053001207,0.00026268396,0.00017107915,0.0014772973,0.0005154496,0.24583976],"genre_scores_gemma":[0.94380707,0.00039589388,0.029352006,0.00023223659,0.00015076122,0.00011975933,0.0009918181,0.00015920994,0.024791254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910295,0.00013854497,0.000048571517,0.00019800317,0.0003192181,0.00019270132],"domain_scores_gemma":[0.9991806,0.00020669488,0.00011744626,0.00017771966,0.00020948485,0.00010803077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046630035,0.0004886737,0.0006328588,0.0022541678,0.0014374658,0.0025352645,0.0008071278,0.000744269,0.0061930954],"category_scores_gemma":[0.0018738661,0.0003570093,0.00079953595,0.0011580879,0.0025350908,0.0026072022,0.002256009,0.0010102758,0.00082374865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024245617,0.000005374128,0.00043948737,0.000034404933,0.000008675078,0.00015403834,0.00021210795,0.0006594279,0.0016144679,0.9903932,0.0009384301,0.0055159354],"study_design_scores_gemma":[0.000011297608,0.000028686489,0.0012987053,0.000050802526,0.00002279478,0.0007002009,0.0002745505,0.005497224,0.0022813345,0.9637042,0.02610057,0.000029504969],"about_ca_topic_score_codex":0.00073329016,"about_ca_topic_score_gemma":0.0011280423,"teacher_disagreement_score":0.0061930954,"about_ca_system_score_codex":0.00077943923,"about_ca_system_score_gemma":0.0002593021,"threshold_uncertainty_score":0.020717978},"labels":[],"label_agreement":null},{"id":"W7117419254","doi":"10.61091/ars165-01","title":"Signless Laplacian spectral determinations of the starlike trees &lt;span class=\"math inline\"&gt;\\(ST(n, d_1)\\)&lt;/span&gt; and the double starlike trees &lt;span class=\"math inline\"&gt;\\(H_n(p, p)\\)&lt;/span&gt;","year":2025,"lang":"","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Vertex (graph theory); Graph; Degree (music); Tree (set theory); Path graph; Path (computing); Simple graph","score_opus":0.014179583689053027,"score_gpt":0.25874359812753456,"score_spread":0.24456401443848153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117419254","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5900009,0.00022230519,0.19367263,0.00092396536,0.00033381445,0.00006527108,0.0010657134,0.00065607525,0.21305932],"genre_scores_gemma":[0.94041824,0.00016885315,0.030084154,0.00020290978,0.0001305163,0.000041657393,0.00070379634,0.00027718957,0.02797273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997886,0.00002663331,0.000008494416,0.00006528551,0.00007331488,0.000037777256],"domain_scores_gemma":[0.99956197,0.00008106966,0.00006290776,0.00006028149,0.00012803232,0.00010582243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017874481,0.00034238893,0.00019744069,0.0013958957,0.00072075013,0.0010172616,0.00043885835,0.00043786984,0.009655614],"category_scores_gemma":[0.0010804455,0.0001740904,0.00027071522,0.00064852095,0.0010820518,0.0012104212,0.00054760557,0.0006550271,0.0014960114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007309581,0.00006568408,0.0010244183,0.000057584002,0.0000068035038,0.00020773394,0.0004710924,0.0034609581,0.027276611,0.9228448,0.008239463,0.036271688],"study_design_scores_gemma":[0.00001651062,0.000050929622,0.0033349632,0.000026693015,0.000012092578,0.0005109435,0.0004838609,0.051334217,0.01653808,0.909713,0.017917024,0.000061696825],"about_ca_topic_score_codex":0.00071492034,"about_ca_topic_score_gemma":0.0012545431,"teacher_disagreement_score":0.009655614,"about_ca_system_score_codex":0.0005355069,"about_ca_system_score_gemma":0.00033868145,"threshold_uncertainty_score":0.032301307},"labels":[],"label_agreement":null},{"id":"W7117419413","doi":"10.61091/ars165-04","title":"Combinatorial identities using the matrix tree theorem","year":2025,"lang":"","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Indian Institute of Science Education and Research Mohali; Indian Institute of Science","keywords":"Spanning tree; Bipartite graph; Minimum spanning tree; Complete bipartite graph; Trémaux tree; Graph; Tree (set theory); Combinatorial proof; Minimum degree spanning tree","score_opus":0.021477414684064017,"score_gpt":0.3131722221738988,"score_spread":0.2916948074898348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117419413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094663344,0.0018220303,0.73132354,0.0049888575,0.00075890747,0.00010411692,0.0010264111,0.00072303734,0.16458976],"genre_scores_gemma":[0.86951244,0.0018987812,0.09283656,0.0021352223,0.0021935436,0.00036869454,0.001164297,0.0006430435,0.029247455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983877,0.0003825101,0.000065372646,0.00044806648,0.0005274096,0.00018909204],"domain_scores_gemma":[0.9971662,0.0013729804,0.00034474992,0.0004402479,0.00042495443,0.00025085467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013611115,0.00059978705,0.00096591644,0.0022725305,0.0015455311,0.0035926516,0.0017512937,0.0012605734,0.01652132],"category_scores_gemma":[0.006536862,0.00048386524,0.0011713828,0.0028267133,0.0026736038,0.0061835293,0.0019787524,0.0024714072,0.0018548259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008132091,0.0000069928597,0.00012661473,0.00002263544,0.0000041002013,0.00004639869,0.0000529426,0.0010768021,0.00037075684,0.9912039,0.0020565079,0.0050242012],"study_design_scores_gemma":[0.000009301231,0.000010282906,0.0003028366,0.000010578052,0.000004880871,0.00014896199,0.000027095803,0.015930131,0.00031249376,0.97606933,0.007161586,0.000012574848],"about_ca_topic_score_codex":0.0011843002,"about_ca_topic_score_gemma":0.00081378955,"teacher_disagreement_score":0.01652132,"about_ca_system_score_codex":0.0016116258,"about_ca_system_score_gemma":0.0007482529,"threshold_uncertainty_score":0.05526924},"labels":[],"label_agreement":null},{"id":"W7117425606","doi":"10.61091/ars165-07","title":"Counting permutations in \\(S_{2n}\\) and \\(S_{2n+1}\\)","year":2025,"lang":"","type":"article","venue":"Ars Combinatoria","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Disjoint sets; Conjecture; Constructive; Square (algebra); Constructive proof; Symmetric group","score_opus":0.016972498908922586,"score_gpt":0.30706835909546676,"score_spread":0.29009586018654415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117425606","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7036567,0.00030178594,0.20931868,0.0014298514,0.0002785748,0.00021887032,0.0014050533,0.00072733057,0.08266312],"genre_scores_gemma":[0.93554145,0.0002353438,0.045160767,0.00030333834,0.00016692338,0.00024063069,0.0012678677,0.00020073201,0.01688296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899405,0.00017938127,0.00007344164,0.0003154972,0.00022492972,0.00021257203],"domain_scores_gemma":[0.99798846,0.00083471165,0.00038817365,0.00037649806,0.0002423492,0.00016978392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071584206,0.00061833614,0.0004571562,0.0011798666,0.001344062,0.0019238567,0.0009577272,0.0009226002,0.0075859446],"category_scores_gemma":[0.0032213496,0.00027553696,0.0004719167,0.0015821304,0.0021669597,0.0029912842,0.0010965493,0.0007810575,0.0011729437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027329603,0.00008487926,0.008121516,0.00015976634,0.000023853643,0.00042522803,0.0006934227,0.005144053,0.011758577,0.8680169,0.009185299,0.096113324],"study_design_scores_gemma":[0.000033583015,0.00009826547,0.0046946476,0.000039693754,0.00003229302,0.0008486429,0.0002566751,0.03298701,0.018948914,0.91970587,0.02229622,0.00005822009],"about_ca_topic_score_codex":0.0011714079,"about_ca_topic_score_gemma":0.0019364097,"teacher_disagreement_score":0.0075859446,"about_ca_system_score_codex":0.0010119549,"about_ca_system_score_gemma":0.0008433569,"threshold_uncertainty_score":0.025377512},"labels":[],"label_agreement":null},{"id":"W71254070","doi":"","title":"Combinatorial properties of the divisibilty of mn by am + bn + c.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.016232122160847007,"score_gpt":0.1975913502918124,"score_spread":0.1813592281309654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W71254070","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7191475,0.00080408796,0.030877117,0.0038541525,0.0004371198,0.00010410778,0.0007610712,0.00027154008,0.24374327],"genre_scores_gemma":[0.9659176,0.0003025038,0.0057637645,0.00038505415,0.0004255508,0.0001116636,0.00045290813,0.00012200539,0.02651902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990375,0.00025567916,0.00005575816,0.0002003762,0.00024179251,0.00020893473],"domain_scores_gemma":[0.99645585,0.001711375,0.0006035846,0.00048074024,0.00025304497,0.0004954115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093067874,0.000741117,0.0006298537,0.0018100955,0.0017764678,0.0027506708,0.0011228999,0.001045611,0.02080278],"category_scores_gemma":[0.0052984687,0.00046366663,0.0005831073,0.0010557958,0.0039450508,0.0039582937,0.0031535146,0.002717109,0.0020236117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024872384,0.000052894025,0.0006709344,0.00006724287,0.000016612286,0.00022622192,0.0002912886,0.0019517977,0.0030391566,0.9806445,0.0038561788,0.008934401],"study_design_scores_gemma":[0.000080218626,0.00006653332,0.0011465113,0.00003667041,0.000020760914,0.0006591896,0.00009453425,0.0060729277,0.0023743797,0.9793506,0.010065831,0.00003194189],"about_ca_topic_score_codex":0.0007637325,"about_ca_topic_score_gemma":0.0008161838,"teacher_disagreement_score":0.02080278,"about_ca_system_score_codex":0.0011556013,"about_ca_system_score_gemma":0.00052739045,"threshold_uncertainty_score":0.06959218},"labels":[],"label_agreement":null},{"id":"W71359084","doi":"","title":"Matrices Associated to Biindexed Linear Recurrence Relations.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Recurrence relation; Pure mathematics; Combinatorics","score_opus":0.015792530427141505,"score_gpt":0.24541941866985925,"score_spread":0.22962688824271774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W71359084","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.118251204,0.004227089,0.69949293,0.001829466,0.0018360842,0.00025579284,0.002313265,0.0021495193,0.16964467],"genre_scores_gemma":[0.7066392,0.0020952835,0.18809187,0.00090369256,0.0011643983,0.0003472591,0.002614904,0.00075487845,0.09738849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878854,0.00026963145,0.00011333091,0.00022059439,0.00039636018,0.00021154697],"domain_scores_gemma":[0.9977742,0.0006935693,0.000490224,0.000317343,0.0005382407,0.00018649104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006390678,0.0006935856,0.00066280545,0.0024565158,0.0011441404,0.002887871,0.0011653012,0.00081541884,0.022143904],"category_scores_gemma":[0.005921557,0.00036970765,0.0005045232,0.0024631806,0.0011096965,0.0029072755,0.0014428358,0.0015646174,0.0069553894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005171473,0.00004578919,0.00038348182,0.00010974561,0.000015949468,0.00022771631,0.00026637697,0.0016766171,0.0030309625,0.95538163,0.00992451,0.028885538],"study_design_scores_gemma":[0.00001516818,0.00003275333,0.00029113243,0.00004197721,0.000013725045,0.00047392337,0.00010952379,0.018707393,0.0024835786,0.95580494,0.021989994,0.000035979258],"about_ca_topic_score_codex":0.000771742,"about_ca_topic_score_gemma":0.001755414,"teacher_disagreement_score":0.022143904,"about_ca_system_score_codex":0.00085044693,"about_ca_system_score_gemma":0.00056712056,"threshold_uncertainty_score":0.07407874},"labels":[],"label_agreement":null},{"id":"W71397827","doi":"","title":"On 1-Zm-well-covered and strongly Zm-well-covered graphs.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.007502404796612714,"score_gpt":0.2087039548137085,"score_spread":0.20120155001709578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W71397827","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6502328,0.0030733335,0.17206953,0.005991932,0.0002421134,0.00013421617,0.004369467,0.00097307324,0.16291362],"genre_scores_gemma":[0.9385012,0.0014763799,0.03602595,0.000871724,0.00026518825,0.00012465792,0.0027282324,0.0002292823,0.019777397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894255,0.00026410422,0.000047424448,0.00023474352,0.00021953217,0.00029167507],"domain_scores_gemma":[0.9959506,0.002529735,0.0004766945,0.0004184096,0.00024375448,0.0003808157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007248489,0.0006772162,0.0007170871,0.0019971177,0.001730022,0.002920313,0.0011355414,0.001165545,0.008616444],"category_scores_gemma":[0.004012126,0.00065023283,0.0006677261,0.002092455,0.0018944137,0.0062219054,0.0027894657,0.0019743643,0.0012932043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016744286,0.000054235734,0.0018292338,0.00019752447,0.000029501945,0.00020217101,0.000516762,0.005473276,0.0027917153,0.9575676,0.01141202,0.019758604],"study_design_scores_gemma":[0.000025736099,0.000021163982,0.001444953,0.000049313057,0.000026508493,0.00040540166,0.0003179862,0.012373242,0.0014145154,0.97440165,0.009500765,0.000018873536],"about_ca_topic_score_codex":0.0016543446,"about_ca_topic_score_gemma":0.0023691638,"teacher_disagreement_score":0.008616444,"about_ca_system_score_codex":0.0016587741,"about_ca_system_score_gemma":0.00047872032,"threshold_uncertainty_score":0.028824866},"labels":[],"label_agreement":null},{"id":"W71968967","doi":"","title":"On Distance Connected Domination Numbers of Graphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Dominating set; Domination analysis; Vertex (graph theory); Connectivity; Graph; Vertex connectivity; Order (exchange); Connected dominating set; Induced subgraph; Cardinality (data modeling); Integer (computer science); Discrete mathematics","score_opus":0.010305342496407155,"score_gpt":0.27915559109577526,"score_spread":0.2688502485993681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W71968967","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3329934,0.025256308,0.4051718,0.0071815904,0.0013412231,0.00056056713,0.0031062737,0.0008618028,0.22352701],"genre_scores_gemma":[0.87265605,0.010592779,0.088904895,0.0015866016,0.0014992632,0.0009682232,0.0020329165,0.0003764217,0.021382753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99754924,0.0007158644,0.000121134035,0.0005018571,0.0007337064,0.00037814752],"domain_scores_gemma":[0.9782607,0.016978364,0.001645998,0.0006998594,0.0010654649,0.0013497407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031243362,0.0018731955,0.0012932091,0.0065844143,0.0019711778,0.0034734528,0.001791564,0.0015849636,0.006584387],"category_scores_gemma":[0.022125032,0.00078992057,0.0009305466,0.0049754973,0.004660816,0.008342068,0.0031196005,0.003487404,0.0011907938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045893618,0.000064734544,0.0024954085,0.0004920273,0.000068503905,0.00022421226,0.0006889692,0.035895042,0.0024385648,0.9053226,0.008399408,0.043451447],"study_design_scores_gemma":[0.00006555978,0.000101947735,0.0016973903,0.0001749712,0.00004537419,0.00051972293,0.0001764118,0.06163221,0.0011872017,0.91841793,0.01592616,0.00005523015],"about_ca_topic_score_codex":0.0013554229,"about_ca_topic_score_gemma":0.0013068302,"teacher_disagreement_score":0.0065844143,"about_ca_system_score_codex":0.003879168,"about_ca_system_score_gemma":0.0008533733,"threshold_uncertainty_score":0.028145492},"labels":[],"label_agreement":null},{"id":"W72092036","doi":"","title":"Degree Sequences of Optimally Edge-Connected Multigraphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Enhanced Data Rates for GSM Evolution; Combinatorics; Computer science; Artificial intelligence; Physics","score_opus":0.012998791461641877,"score_gpt":0.20781882398912047,"score_spread":0.1948200325274786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W72092036","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66638404,0.001114045,0.24897602,0.0016735771,0.00020503216,0.00015477055,0.0025344861,0.00047100906,0.07848701],"genre_scores_gemma":[0.92717505,0.00062763016,0.05563495,0.00030301552,0.00006875108,0.00012671563,0.0013041805,0.00010862808,0.014651113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955183,0.00013740585,0.00002797347,0.00008739688,0.000102135025,0.00009326099],"domain_scores_gemma":[0.9968041,0.00183934,0.0004228011,0.0002659604,0.00035035601,0.00031744534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036748286,0.00037964288,0.00030796262,0.0016098215,0.00084643264,0.0012910186,0.0006441606,0.000710943,0.006847366],"category_scores_gemma":[0.0050169067,0.00042184163,0.00018906532,0.0011590668,0.0005883508,0.0017697429,0.0007945184,0.001009399,0.0008970739],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029848493,0.0001119924,0.0022540893,0.0002512975,0.000027557537,0.00041815705,0.0004773835,0.03500482,0.013854275,0.8896243,0.009975259,0.04770243],"study_design_scores_gemma":[0.000047317382,0.00005798818,0.0020252531,0.00009734978,0.00001980032,0.00046289628,0.00031072483,0.09231753,0.0067578875,0.88489264,0.0129827745,0.00002790866],"about_ca_topic_score_codex":0.00064642844,"about_ca_topic_score_gemma":0.0017496838,"teacher_disagreement_score":0.006847366,"about_ca_system_score_codex":0.000982833,"about_ca_system_score_gemma":0.00040780474,"threshold_uncertainty_score":0.022906661},"labels":[],"label_agreement":null},{"id":"W72709578","doi":"","title":"The mapping C: G -> C(G), a new graph theoretic map.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.009230056709497154,"score_gpt":0.2062562247875629,"score_spread":0.19702616807806575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W72709578","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18032546,0.003480473,0.6376078,0.009908824,0.002203922,0.00019050884,0.0015161635,0.0013479675,0.16341892],"genre_scores_gemma":[0.7536643,0.002139472,0.19567433,0.0022726122,0.001070927,0.00035757828,0.00079468056,0.00055879285,0.043467324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991561,0.0001935989,0.000039024282,0.00032637815,0.00016973344,0.00011515579],"domain_scores_gemma":[0.99803036,0.0008008304,0.00020086722,0.0003599581,0.0001969913,0.00041104192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006897617,0.00046672457,0.0003615525,0.0021355432,0.0020325156,0.0037850493,0.00086029625,0.0018899624,0.0063387174],"category_scores_gemma":[0.003402032,0.00026670078,0.0005489324,0.0021977548,0.0032744482,0.0065676337,0.0023341463,0.0024958514,0.0012816559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048037407,0.000031988464,0.0003816104,0.00007057574,0.000008502533,0.00007942131,0.00019226712,0.0010459864,0.0029321488,0.9671397,0.007864181,0.020205613],"study_design_scores_gemma":[0.000023902863,0.00004875338,0.00082228734,0.000046357905,0.000028744802,0.0009813806,0.00027110524,0.011007205,0.0031381587,0.89793575,0.085650876,0.000045570647],"about_ca_topic_score_codex":0.0010327022,"about_ca_topic_score_gemma":0.0009453555,"teacher_disagreement_score":0.0063387174,"about_ca_system_score_codex":0.0013912998,"about_ca_system_score_gemma":0.001012496,"threshold_uncertainty_score":0.021205127},"labels":[],"label_agreement":null},{"id":"W72770462","doi":"","title":"The crossing number of flower snarks and related graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Crossing number (knot theory); Combinatorics; Materials science; Composite material; Knot (papermaking)","score_opus":0.009311976865134602,"score_gpt":0.22762053317137684,"score_spread":0.21830855630624224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W72770462","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6730986,0.0047009527,0.10819546,0.0039899056,0.0006316856,0.00008902678,0.001966255,0.0005809468,0.20674725],"genre_scores_gemma":[0.97019595,0.0012288243,0.016530838,0.00030946583,0.00022653252,0.00006005365,0.0006495457,0.000117044125,0.010681664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936014,0.00018818371,0.000030990926,0.00016479047,0.00011935818,0.0001365213],"domain_scores_gemma":[0.99563,0.0026354422,0.00060896785,0.0003809014,0.00023511882,0.0005095119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009544934,0.00041125354,0.0006153381,0.0026413263,0.0017283561,0.0027623076,0.0012786351,0.0015867559,0.009299802],"category_scores_gemma":[0.006675426,0.00043853943,0.00048299888,0.0023151855,0.0020878431,0.0047469744,0.0015045446,0.0014619235,0.00089180924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014483112,0.000042181917,0.0020428232,0.000113344,0.000020310415,0.000120238925,0.00015748026,0.010683049,0.00146751,0.95874923,0.008488605,0.01797041],"study_design_scores_gemma":[0.000021735474,0.00002272191,0.0014016444,0.00004084495,0.000025084604,0.0003631997,0.00019193429,0.028780052,0.001350243,0.9608892,0.0068916227,0.000021688802],"about_ca_topic_score_codex":0.0011806766,"about_ca_topic_score_gemma":0.0013420576,"teacher_disagreement_score":0.009299802,"about_ca_system_score_codex":0.0017997966,"about_ca_system_score_gemma":0.00046895572,"threshold_uncertainty_score":0.031111002},"labels":[],"label_agreement":null},{"id":"W72832394","doi":"","title":"Three challenges in Costas arrays","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Diagonal; Mathematics; Conjecture; Golomb coding; Parity (physics); Combinatorics; Fraction (chemistry); Discrete mathematics; Computer science; Geometry; Physics","score_opus":0.028554957949343342,"score_gpt":0.20542392526065925,"score_spread":0.1768689673113159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W72832394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18853545,0.010646393,0.5420609,0.056180626,0.0014569161,0.0001772648,0.0009067198,0.001871016,0.19816472],"genre_scores_gemma":[0.852869,0.0033249836,0.10276048,0.004154058,0.0019723724,0.00038998635,0.00044064695,0.00037417127,0.033714276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956772,0.0013558593,0.00023047309,0.00090859004,0.0012302,0.00059768604],"domain_scores_gemma":[0.97931653,0.011587744,0.000977434,0.004378141,0.0025711758,0.0011691069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004152957,0.00055045966,0.0014521449,0.0018643813,0.0035359112,0.0050006206,0.002270391,0.004198303,0.010566091],"category_scores_gemma":[0.02518299,0.00064965175,0.0008328378,0.001437431,0.0068329093,0.012376432,0.00435188,0.004684485,0.0023070814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008243909,0.000036343263,0.0008881017,0.000097590484,0.0000068341174,0.00009285667,0.00034641617,0.003358713,0.00119412,0.9547903,0.004548455,0.034557834],"study_design_scores_gemma":[0.000017533805,0.00005027073,0.00034304243,0.000064051026,0.0000032959845,0.00032021024,0.00036628777,0.012154298,0.002182166,0.9612074,0.023257218,0.000034127854],"about_ca_topic_score_codex":0.00080243184,"about_ca_topic_score_gemma":0.0005349383,"teacher_disagreement_score":0.010566091,"about_ca_system_score_codex":0.0019242218,"about_ca_system_score_gemma":0.0010053861,"threshold_uncertainty_score":0.035347104},"labels":[],"label_agreement":null},{"id":"W73276164","doi":"","title":"Complexity Of Computing Of The Domination Number In Hereditary Classes Of Graphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Theoretical computer science; Computer science","score_opus":0.01675329425092998,"score_gpt":0.2472004153658352,"score_spread":0.23044712111490523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W73276164","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77742803,0.0015809687,0.16732018,0.007639723,0.00020370662,0.00017611272,0.004398221,0.001297156,0.039955866],"genre_scores_gemma":[0.96339834,0.0003764127,0.02812651,0.00022997888,0.000247913,0.00008316471,0.001857499,0.00018236983,0.0054977722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978283,0.00060216,0.00011609656,0.0005067621,0.0004975874,0.00044914705],"domain_scores_gemma":[0.97541374,0.02053291,0.0011766766,0.0015216301,0.0005985353,0.000756561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019905781,0.000548911,0.0011336553,0.0016013195,0.0015093825,0.0063383416,0.0024715224,0.0013974081,0.013480497],"category_scores_gemma":[0.021284949,0.0005213142,0.0013066658,0.002095127,0.002540474,0.010253416,0.002031308,0.0023413731,0.0006981083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015040007,0.00039551384,0.023227729,0.00082904805,0.00031568226,0.00043844405,0.0010328202,0.1395615,0.0048960415,0.705335,0.02231122,0.100153014],"study_design_scores_gemma":[0.00007274405,0.000035415986,0.0027851323,0.000036284353,0.000061611914,0.00021941299,0.00020666269,0.2098204,0.001992251,0.7825883,0.002154203,0.000027552842],"about_ca_topic_score_codex":0.0054327166,"about_ca_topic_score_gemma":0.008456627,"teacher_disagreement_score":0.013480497,"about_ca_system_score_codex":0.003871601,"about_ca_system_score_gemma":0.0022523263,"threshold_uncertainty_score":0.045096695},"labels":[],"label_agreement":null},{"id":"W73286898","doi":"","title":"Classification of the [n, 3, n-3]_q NMDS codes over GF(7), GF(8) and GF(9).","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Fractal and DNA sequence analysis","field":"Biochemistry, Genetics and Molecular Biology","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"GF(2); Mathematics; Discrete mathematics; Finite field","score_opus":0.009307898291779314,"score_gpt":0.2413143546526642,"score_spread":0.2320064563608849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W73286898","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.851857,0.0012584617,0.07118756,0.0019188974,0.0002675222,0.00020945378,0.0038477906,0.0006698427,0.0687835],"genre_scores_gemma":[0.95933646,0.00039576303,0.02154372,0.00030576394,0.00011165958,0.00013812757,0.0040194388,0.00010316488,0.014045973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995376,0.0000898442,0.000044052074,0.000052326854,0.00014212956,0.00013408366],"domain_scores_gemma":[0.9976311,0.0008049932,0.00046674415,0.0003089398,0.0005237386,0.00026440047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003506426,0.00038956673,0.00028817423,0.0023769157,0.0011831614,0.0010490692,0.00044133642,0.00076555595,0.0057758633],"category_scores_gemma":[0.002224083,0.00013839507,0.000384061,0.0011143448,0.0012597169,0.000670654,0.0007217371,0.0005748711,0.0010982575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015470703,0.00020842372,0.013225968,0.00036529786,0.00004286141,0.0010208254,0.001000099,0.021861607,0.042899415,0.7453517,0.02419049,0.1482862],"study_design_scores_gemma":[0.00029452585,0.00048586016,0.021677997,0.00036861422,0.000055635304,0.0037983756,0.00082812225,0.14586756,0.038715627,0.68375206,0.10395223,0.0002033924],"about_ca_topic_score_codex":0.003642424,"about_ca_topic_score_gemma":0.0028752582,"teacher_disagreement_score":0.0057758633,"about_ca_system_score_codex":0.0012602756,"about_ca_system_score_gemma":0.0015143825,"threshold_uncertainty_score":0.019322217},"labels":[],"label_agreement":null},{"id":"W73852609","doi":"","title":"Note on acyclic colorings of graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01629310249588141,"score_gpt":0.2869874171003903,"score_spread":0.2706943146045089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W73852609","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017772987,0.019656597,0.27328852,0.022622334,0.022835346,0.0001578251,0.002168189,0.0013281851,0.64017004],"genre_scores_gemma":[0.4458855,0.059636872,0.2402163,0.023803657,0.03190909,0.0004953645,0.0034929996,0.0016965166,0.19286375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991334,0.0002397372,0.000044404944,0.00024453693,0.00023736326,0.00010057007],"domain_scores_gemma":[0.9924085,0.0053185388,0.00022213177,0.0009795442,0.000665332,0.00040587335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014044686,0.0011345062,0.00077650533,0.0019431399,0.0022777726,0.002149426,0.001397816,0.0010431664,0.024032451],"category_scores_gemma":[0.006239112,0.00059274834,0.0011369317,0.002940638,0.0031007978,0.004487264,0.0025511004,0.0046264054,0.003501611],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082001236,0.000037938345,0.00044995424,0.00029658587,0.000028100802,0.00036682928,0.00022423205,0.0011966937,0.0012263408,0.8893685,0.074078344,0.032644518],"study_design_scores_gemma":[0.000011772954,0.000028943035,0.00051863067,0.00007249695,0.000029792436,0.00044187164,0.000072566596,0.0012148615,0.00069737213,0.87883604,0.11805394,0.000021699174],"about_ca_topic_score_codex":0.0055505172,"about_ca_topic_score_gemma":0.00853756,"teacher_disagreement_score":0.024032451,"about_ca_system_score_codex":0.0011429704,"about_ca_system_score_gemma":0.0008538996,"threshold_uncertainty_score":0.08039653},"labels":[],"label_agreement":null},{"id":"W74597297","doi":"","title":"Some Davenport Constants with Weights and Adhikari and Rath's Conjecture.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Subsequence; Combinatorics; Conjecture; Constant (computer programming); Sequence (biology); Bounded function; Mathematical analysis; Chemistry","score_opus":0.005679560799056794,"score_gpt":0.16967655853066035,"score_spread":0.16399699773160356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W74597297","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60178995,0.0043319305,0.09773979,0.0066169747,0.00073301996,0.00017032743,0.0012306639,0.0005139303,0.28687328],"genre_scores_gemma":[0.9583809,0.0011534267,0.021015344,0.0005671261,0.00042208703,0.00014823447,0.00045397592,0.000082569844,0.017776363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886924,0.00016482503,0.00006075805,0.00026806636,0.00034405646,0.0002931019],"domain_scores_gemma":[0.9971739,0.0014857624,0.00040243723,0.00034094218,0.00029018262,0.00030685365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013900198,0.0007906586,0.00056747114,0.0026639793,0.002587231,0.0026442562,0.0015585382,0.0014627562,0.009128233],"category_scores_gemma":[0.00901653,0.0004950032,0.0008406834,0.003171843,0.0032596022,0.007286546,0.0023162344,0.0023497283,0.0009831768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005067047,0.00002913359,0.0011445974,0.00005126184,0.000014377459,0.00010090894,0.0002723019,0.0016868684,0.0005879745,0.9831079,0.0034920506,0.0094619235],"study_design_scores_gemma":[0.000022862048,0.00002175572,0.0007587156,0.000025305357,0.000015641048,0.00027651756,0.00015073335,0.0053723594,0.0010423976,0.9772349,0.0150486445,0.000030118475],"about_ca_topic_score_codex":0.0030561308,"about_ca_topic_score_gemma":0.0020754249,"teacher_disagreement_score":0.009128233,"about_ca_system_score_codex":0.002896822,"about_ca_system_score_gemma":0.0012126247,"threshold_uncertainty_score":0.03053701},"labels":[],"label_agreement":null},{"id":"W75080855","doi":"","title":"The Vertex Linear Arboricity of an Integer Distance Graph with a Special Distance Set.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arboricity; Mathematics; Vertex (graph theory); Combinatorics; Graph; Set (abstract data type); Integer (computer science); Discrete mathematics; Planar graph; Computer science","score_opus":0.00849990397534381,"score_gpt":0.25327281408344565,"score_spread":0.24477291010810184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W75080855","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8250245,0.0003468505,0.054134317,0.0008264726,0.0001309311,0.000040579907,0.0008056917,0.00023820656,0.118452504],"genre_scores_gemma":[0.9790557,0.00018381535,0.011004459,0.000102000515,0.000060556937,0.0000295704,0.00049396534,0.000041918254,0.0090281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997993,0.000048010796,0.00001110516,0.00004949053,0.000047103604,0.000045080727],"domain_scores_gemma":[0.998958,0.00046488448,0.00022920211,0.00009973414,0.00008279906,0.00016533781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013390498,0.0002219592,0.00021589673,0.00068686233,0.0007719102,0.0012034276,0.0005423677,0.00052286783,0.0055112313],"category_scores_gemma":[0.0014143835,0.00019439805,0.00020589038,0.00075280597,0.0007521302,0.0013851646,0.0007146877,0.0007495183,0.0006815357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033660282,0.00007074748,0.0025368468,0.00015009085,0.000024374058,0.00094876357,0.00044245817,0.009183711,0.013660181,0.9414122,0.0059894943,0.025244553],"study_design_scores_gemma":[0.000073319454,0.00012107302,0.003095871,0.000044800905,0.000044362438,0.0015985861,0.0005254665,0.05836421,0.0060898527,0.91319805,0.016813412,0.000031003397],"about_ca_topic_score_codex":0.00068858574,"about_ca_topic_score_gemma":0.00088888453,"teacher_disagreement_score":0.0055112313,"about_ca_system_score_codex":0.0004378763,"about_ca_system_score_gemma":0.00021024924,"threshold_uncertainty_score":0.018436909},"labels":[],"label_agreement":null},{"id":"W7511636","doi":"","title":"Algorithms For The Optimal Hamiltonian Path In Halin Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hamiltonian path; Hamiltonian path problem; Path (computing); Combinatorics; Discrete mathematics; Graph; Computer science","score_opus":0.020960532347010345,"score_gpt":0.2545780518503076,"score_spread":0.23361751950329723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7511636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027815176,0.0013736157,0.94432044,0.002095193,0.00026559844,0.0006361776,0.0023440334,0.004161475,0.01698826],"genre_scores_gemma":[0.22777265,0.00065564126,0.7476645,0.00059492234,0.00014515458,0.0009838041,0.0058608036,0.0011197679,0.01520273],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944633,0.00017839223,0.000029326357,0.00016247726,0.000084691834,0.00009874594],"domain_scores_gemma":[0.99695396,0.0022909227,0.00017729624,0.0002112319,0.00023722029,0.00012938246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011606766,0.0016088262,0.0011103024,0.002128663,0.0009704913,0.0016571908,0.0017789587,0.0019265139,0.022733526],"category_scores_gemma":[0.0059953094,0.00072994875,0.0010755786,0.0016571617,0.0008656902,0.0024576213,0.0017944905,0.0019272281,0.0030694064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003849757,0.0002870492,0.0019704767,0.00082624017,0.0001613822,0.00017685092,0.00034454148,0.59245676,0.0017405639,0.075263314,0.032880533,0.29350734],"study_design_scores_gemma":[0.00010641111,0.000058427322,0.0002593524,0.000048517977,0.000023115099,0.00003952859,0.00014749759,0.8784677,0.0003415674,0.11490735,0.00559094,0.000009658973],"about_ca_topic_score_codex":0.0066397167,"about_ca_topic_score_gemma":0.014740333,"teacher_disagreement_score":0.022733526,"about_ca_system_score_codex":0.0020564387,"about_ca_system_score_gemma":0.0026953507,"threshold_uncertainty_score":0.076051295},"labels":[],"label_agreement":null},{"id":"W75383027","doi":"","title":"4-Circulant Graphs.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Circulant matrix; Mathematics; Combinatorics","score_opus":0.00953351272886977,"score_gpt":0.17653289603992614,"score_spread":0.16699938331105638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W75383027","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18312544,0.002448933,0.2383803,0.0027588487,0.0012235214,0.00024270103,0.0018608312,0.0011883944,0.568771],"genre_scores_gemma":[0.7982927,0.0017363192,0.065517336,0.0015995724,0.00056694425,0.00020285278,0.0015314067,0.00030784978,0.13024496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937767,0.00015199688,0.000024143317,0.00011272634,0.00016534876,0.00016805262],"domain_scores_gemma":[0.99816954,0.0006478295,0.00031321612,0.0002788673,0.0003477361,0.00024289207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039794573,0.0005902236,0.00049454666,0.0020147036,0.0014458968,0.0022641777,0.00077468605,0.0011419142,0.021348853],"category_scores_gemma":[0.0027319605,0.00032917026,0.0004301909,0.0011257934,0.0010758548,0.0020125608,0.0010517021,0.0013508564,0.004571494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047423808,0.000040675768,0.00021776126,0.000056525296,0.000012797024,0.00020728099,0.0000890011,0.0014671393,0.0023842358,0.97204596,0.009497367,0.0139338095],"study_design_scores_gemma":[0.000020612253,0.000021884034,0.00040491825,0.000038434864,0.000016569298,0.00037108126,0.00009259557,0.011366728,0.0019137703,0.94707394,0.03865833,0.00002115869],"about_ca_topic_score_codex":0.0016091657,"about_ca_topic_score_gemma":0.0032732468,"teacher_disagreement_score":0.021348853,"about_ca_system_score_codex":0.0011020204,"about_ca_system_score_gemma":0.0007674456,"threshold_uncertainty_score":0.07141906},"labels":[],"label_agreement":null},{"id":"W75575088","doi":"","title":"Minimum Degree and the Number of Chords.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Combinatorics","score_opus":0.01162912980185739,"score_gpt":0.2325658678797465,"score_spread":0.2209367380778891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W75575088","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6755708,0.005748613,0.1986187,0.005567288,0.000854696,0.00015310357,0.0048408895,0.00071093685,0.107934915],"genre_scores_gemma":[0.96107006,0.001331216,0.024377549,0.00016350922,0.00032257926,0.000070956004,0.0008799836,0.00010232945,0.011681744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982723,0.00033472592,0.00014072953,0.0005324925,0.00035814062,0.00036154588],"domain_scores_gemma":[0.9836062,0.009372665,0.0019744951,0.0016269179,0.0011337945,0.002285956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013530968,0.0004646192,0.0011105901,0.001889259,0.001766854,0.005012184,0.0019217968,0.0013344567,0.008547207],"category_scores_gemma":[0.014608049,0.0005539754,0.0006472231,0.0017375131,0.0032543996,0.007190117,0.0018865921,0.00177398,0.001538604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072417496,0.00010689641,0.007252946,0.0004227682,0.00007325852,0.0004203051,0.00086901075,0.008908553,0.007955228,0.9201385,0.008282983,0.044845354],"study_design_scores_gemma":[0.000060255243,0.0000637208,0.0023009845,0.0000699273,0.00005378115,0.0010921371,0.00043626508,0.010211463,0.0030461934,0.97034115,0.012288431,0.00003565908],"about_ca_topic_score_codex":0.00077907497,"about_ca_topic_score_gemma":0.0012629565,"teacher_disagreement_score":0.008547207,"about_ca_system_score_codex":0.001465498,"about_ca_system_score_gemma":0.0007129027,"threshold_uncertainty_score":0.028593302},"labels":[],"label_agreement":null},{"id":"W75757995","doi":"","title":"On Resolving Acyclic Partitions of Graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Directed acyclic graph; Discrete mathematics","score_opus":0.012915192982007512,"score_gpt":0.23255418091974034,"score_spread":0.21963898793773282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W75757995","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13156706,0.009317914,0.65910316,0.010488324,0.0014479153,0.0004916282,0.003806935,0.0025409705,0.1812361],"genre_scores_gemma":[0.44987297,0.004681994,0.47498244,0.003181965,0.0013226036,0.0004472273,0.009231295,0.0014930504,0.054786343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99722373,0.001105745,0.00016567545,0.00054890104,0.00045621942,0.0004997142],"domain_scores_gemma":[0.9861015,0.00934184,0.0007333015,0.0023945607,0.0006925222,0.000736233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032062223,0.00095585943,0.0014514793,0.0031401494,0.0033051043,0.0048219925,0.0025924586,0.0028212739,0.014988804],"category_scores_gemma":[0.017861255,0.0009055837,0.0012017259,0.004412639,0.003383428,0.0157189,0.005545074,0.004256139,0.0030785832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023767594,0.00018267425,0.001305953,0.00034253713,0.000057730973,0.0001344531,0.00066471804,0.009379401,0.0013546392,0.8364619,0.0421665,0.10771188],"study_design_scores_gemma":[0.000024884126,0.00001957965,0.0002984366,0.000075227166,0.000021670836,0.0001431786,0.00037964937,0.013555309,0.0007737066,0.96534395,0.01934808,0.000016404903],"about_ca_topic_score_codex":0.0031552764,"about_ca_topic_score_gemma":0.0064252093,"teacher_disagreement_score":0.014988804,"about_ca_system_score_codex":0.002090736,"about_ca_system_score_gemma":0.0014638418,"threshold_uncertainty_score":0.050142586},"labels":[],"label_agreement":null},{"id":"W75907754","doi":"","title":"Vertex-Disjoint Paths in Graphs","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Disjoint sets; Vertex (graph theory); Combinatorics; Graph","score_opus":0.016950286058527865,"score_gpt":0.2743511412015198,"score_spread":0.25740085514299194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W75907754","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45499983,0.0045303376,0.3848565,0.005866684,0.0007362671,0.00034047582,0.003025029,0.0015404199,0.14410451],"genre_scores_gemma":[0.7989023,0.004823723,0.13856076,0.0010808965,0.0004989254,0.0004065939,0.002970319,0.00047877335,0.052277695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987135,0.00033906367,0.00009571194,0.00035991275,0.00031188622,0.00017988587],"domain_scores_gemma":[0.9945157,0.003749082,0.0005376331,0.00043230283,0.00030249447,0.0004626954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009405114,0.0010782578,0.0011029998,0.0031418814,0.0028320558,0.004715123,0.0018273498,0.0022229142,0.012188351],"category_scores_gemma":[0.007191813,0.0013278415,0.0010447656,0.0057506934,0.0027572317,0.010680826,0.0038784477,0.0031941617,0.0018307606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090133704,0.00005643339,0.0006579263,0.00020744526,0.000026992833,0.00016536201,0.0005737019,0.0030488728,0.000881832,0.96086216,0.0045190915,0.02890996],"study_design_scores_gemma":[0.000016469136,0.00001000263,0.00015558288,0.000024233817,0.000017799235,0.00010662942,0.00009771884,0.0022967851,0.00026951925,0.99256104,0.0044379234,0.000006296931],"about_ca_topic_score_codex":0.0014181309,"about_ca_topic_score_gemma":0.0019463374,"teacher_disagreement_score":0.012188351,"about_ca_system_score_codex":0.001551774,"about_ca_system_score_gemma":0.0010165477,"threshold_uncertainty_score":0.040774047},"labels":[],"label_agreement":null},{"id":"W75935481","doi":"","title":"Lambda-Designs on 8p+1 Points.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Lambda; Mathematics; Physics; Optics","score_opus":0.013211806983962163,"score_gpt":0.20637079298105399,"score_spread":0.19315898599709183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W75935481","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15597694,0.0011220041,0.5286989,0.0015185226,0.00068876357,0.00021475536,0.00090639765,0.0019140225,0.3089597],"genre_scores_gemma":[0.7292571,0.00072812184,0.13646314,0.0005738586,0.00027078934,0.0003323566,0.0005336991,0.00039649106,0.13144438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838173,0.0004973522,0.00008428698,0.00028160497,0.0004208401,0.00033421456],"domain_scores_gemma":[0.9983658,0.0005065062,0.00017623654,0.00041173294,0.00039216634,0.00014759447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001021673,0.0006593798,0.0004978421,0.0013504191,0.0019997614,0.0026183235,0.000905837,0.0010198837,0.02302304],"category_scores_gemma":[0.002813742,0.00043974546,0.00056168804,0.0011731951,0.0014750803,0.0032918686,0.002391318,0.0013041178,0.0074447743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018252822,0.00004073905,0.00033536972,0.00010124581,0.000017976856,0.00013156922,0.0002476399,0.0017836979,0.004520776,0.9530396,0.00505182,0.034546945],"study_design_scores_gemma":[0.000066889814,0.000108925604,0.00033062542,0.000082684426,0.000028036664,0.00031856124,0.00021904941,0.009276954,0.010167653,0.9313784,0.047983326,0.00003889351],"about_ca_topic_score_codex":0.00060415803,"about_ca_topic_score_gemma":0.0012095141,"teacher_disagreement_score":0.02302304,"about_ca_system_score_codex":0.0013190743,"about_ca_system_score_gemma":0.00083660154,"threshold_uncertainty_score":0.07701975},"labels":[],"label_agreement":null},{"id":"W76027121","doi":"","title":"Some applications of combinatorial designs to extremal graph theory.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Graph theory; Combinatorics; Discrete mathematics","score_opus":0.011140038620850464,"score_gpt":0.21478753270808115,"score_spread":0.20364749408723068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W76027121","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028409828,0.037154917,0.5120599,0.0098461425,0.002347953,0.00015014964,0.00048895885,0.00043369248,0.40910843],"genre_scores_gemma":[0.60974705,0.035475973,0.258646,0.005171658,0.0072350125,0.00064099726,0.0006375411,0.0003639908,0.08208171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990596,0.00042784534,0.000043335516,0.000120805526,0.0002522052,0.000096118194],"domain_scores_gemma":[0.9976891,0.0015997464,0.00012080571,0.00027522075,0.00020349942,0.00011162817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012149949,0.0009407296,0.00072219985,0.0028435923,0.0017790231,0.0026484278,0.0011907637,0.0019656518,0.010951016],"category_scores_gemma":[0.004978406,0.0006679473,0.0010329024,0.0024358518,0.0037891564,0.0036283368,0.0017788581,0.0032418624,0.0015854479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052306386,0.000011930218,0.000053019376,0.000047287638,0.000007102206,0.000051518615,0.000043011558,0.0012524495,0.00012943715,0.9880211,0.0037586063,0.0066193817],"study_design_scores_gemma":[0.000003273488,0.0000059677927,0.000041118437,0.00001805162,0.0000037013651,0.000071274575,0.000018664878,0.0031434912,0.00007519048,0.98956394,0.007051136,0.0000042238685],"about_ca_topic_score_codex":0.0006708087,"about_ca_topic_score_gemma":0.0012422003,"teacher_disagreement_score":0.010951016,"about_ca_system_score_codex":0.0018848196,"about_ca_system_score_gemma":0.00048555486,"threshold_uncertainty_score":0.036634803},"labels":[],"label_agreement":null},{"id":"W76135770","doi":"","title":"The Index of Tricyclic Hamiltonian Graphs with D(G)=3.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tricyclic; Mathematics; Hamiltonian (control theory); Index (typography); Combinatorics; Discrete mathematics; Chemistry; Stereochemistry; Mathematical optimization; Computer science","score_opus":0.014731859839388418,"score_gpt":0.26141076746257247,"score_spread":0.24667890762318406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W76135770","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8420742,0.0011407847,0.015123424,0.00076028635,0.00026311114,0.000039499217,0.0019118398,0.00027226534,0.13841446],"genre_scores_gemma":[0.9854124,0.00052337366,0.0043871384,0.00015185414,0.00008830424,0.000032272124,0.0007486958,0.00008241472,0.008573514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976057,0.00004457164,0.000014797308,0.000040514187,0.00005785479,0.000081811406],"domain_scores_gemma":[0.99845266,0.00044296662,0.0004516973,0.00013534866,0.0001837332,0.00033354384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026384008,0.0002723763,0.0003730132,0.0021110715,0.00080792,0.0017679537,0.000709709,0.0006546551,0.0067604566],"category_scores_gemma":[0.0018295951,0.00018913113,0.00021455424,0.0013222699,0.00089469965,0.0013209651,0.0008944703,0.0005728072,0.0010673775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083301956,0.000114409566,0.0069528576,0.0003145281,0.000054950608,0.0007007319,0.0010235503,0.005583606,0.021631882,0.8888865,0.023332668,0.050571203],"study_design_scores_gemma":[0.000102844526,0.000120637145,0.011009385,0.00016013038,0.00008164679,0.0017125298,0.0009192301,0.032118604,0.012742047,0.9108273,0.03013663,0.00006902113],"about_ca_topic_score_codex":0.00090613693,"about_ca_topic_score_gemma":0.0011973224,"teacher_disagreement_score":0.0067604566,"about_ca_system_score_codex":0.000760542,"about_ca_system_score_gemma":0.0003720112,"threshold_uncertainty_score":0.02261597},"labels":[],"label_agreement":null},{"id":"W76213468","doi":"","title":"Broadcasting in Odd Graphs.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Broadcasting (networking); Computer science; Computer network","score_opus":0.009874596601576854,"score_gpt":0.23397914135811693,"score_spread":0.22410454475654007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W76213468","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2814496,0.007099158,0.3262702,0.00991395,0.0014843749,0.00021323263,0.0023400604,0.00163751,0.36959186],"genre_scores_gemma":[0.8497927,0.0039638127,0.048830118,0.001412773,0.0007557581,0.00020065071,0.0013436225,0.00044518174,0.09325543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950755,0.00012224236,0.000027531234,0.000091722395,0.000112691436,0.00013823766],"domain_scores_gemma":[0.99733114,0.0015123135,0.00027651797,0.00034681882,0.00022125192,0.0003119102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059808476,0.00037413609,0.0005580559,0.0011662174,0.0015224157,0.0017491366,0.000778672,0.00060624146,0.009215271],"category_scores_gemma":[0.003689323,0.00022503773,0.00043105276,0.0011684251,0.0011740023,0.0033031271,0.0015256875,0.0011846274,0.0015260988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012243025,0.000027010718,0.0005285248,0.00017237464,0.000012955991,0.00017516146,0.00021375196,0.0033559345,0.0016564252,0.9514705,0.013543171,0.028721808],"study_design_scores_gemma":[0.000021349662,0.000014681707,0.00030116306,0.000030338026,0.000019699315,0.00021216646,0.000096080395,0.011104299,0.0009959522,0.9658948,0.021298105,0.000011239178],"about_ca_topic_score_codex":0.0025979881,"about_ca_topic_score_gemma":0.0041391817,"teacher_disagreement_score":0.009215271,"about_ca_system_score_codex":0.0015361506,"about_ca_system_score_gemma":0.0010048322,"threshold_uncertainty_score":0.030828118},"labels":[],"label_agreement":null},{"id":"W76416303","doi":"","title":"F-factor and Vertex-disjoint F in a graph.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Disjoint sets; Vertex (graph theory); Graph; Factor (programming language); Discrete mathematics; Computer science; Programming language","score_opus":0.02384189453152436,"score_gpt":0.26140417543416056,"score_spread":0.2375622809026362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W76416303","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47285363,0.0053900443,0.35792124,0.0039147995,0.00091940485,0.00017129524,0.0027295728,0.0012844718,0.15481545],"genre_scores_gemma":[0.8769697,0.002158174,0.08398407,0.00066458597,0.00044932237,0.00011821325,0.0017315554,0.0002979398,0.03362645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891746,0.00017268783,0.00006227264,0.00041125997,0.00016406232,0.0002721981],"domain_scores_gemma":[0.99645066,0.001587993,0.00049472105,0.00053611095,0.0003886122,0.0005417641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008593955,0.0008789724,0.00072667206,0.0022378978,0.002268892,0.002091577,0.00093335786,0.001358718,0.010055339],"category_scores_gemma":[0.004975608,0.00051546854,0.0010809607,0.0018231563,0.003299506,0.005943283,0.0024274683,0.0018903788,0.0016874077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002794814,0.00008116016,0.0016392724,0.00017628535,0.000059128277,0.0006386402,0.0007084693,0.0015108362,0.003431918,0.95018065,0.009516182,0.03177793],"study_design_scores_gemma":[0.000027773285,0.000035829118,0.0008046309,0.00006257457,0.000057718906,0.0010454694,0.00052126934,0.0032881093,0.0026540405,0.96959203,0.021883305,0.000027248312],"about_ca_topic_score_codex":0.0024317952,"about_ca_topic_score_gemma":0.0027914138,"teacher_disagreement_score":0.010055339,"about_ca_system_score_codex":0.0010554991,"about_ca_system_score_gemma":0.00071384467,"threshold_uncertainty_score":0.033638418},"labels":[],"label_agreement":null},{"id":"W76468100","doi":"","title":"Bipartite Dominating Sets in Hypercubes.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Dominating set; Combinatorics; Mathematics; Vertex (graph theory); Hypercube; Cardinality (data modeling); Graph; Discrete mathematics; Computer science","score_opus":0.017858414930476286,"score_gpt":0.29359529617326785,"score_spread":0.27573688124279155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W76468100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084959574,0.02274111,0.7823819,0.0022917725,0.0013735896,0.0008027818,0.0029790944,0.0006291226,0.10184109],"genre_scores_gemma":[0.60303277,0.013787005,0.34039414,0.001920599,0.0017587837,0.0020491362,0.0047077863,0.00026045856,0.03208932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977863,0.0008790375,0.0001575216,0.0004432256,0.0005301929,0.00020378453],"domain_scores_gemma":[0.99794203,0.0010587454,0.0003380846,0.00014411176,0.00033873843,0.0001783175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015625048,0.0011256754,0.0009783631,0.0025817722,0.001166294,0.002812336,0.0008609536,0.0012203,0.004109338],"category_scores_gemma":[0.003914911,0.00060969446,0.0008855142,0.0038880077,0.0014776031,0.0030073267,0.0016825525,0.0012692072,0.001138058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020640636,0.00007512908,0.0011973891,0.0009914273,0.00009258694,0.0005994827,0.0006653954,0.07880952,0.0038780426,0.8338952,0.015458461,0.06413084],"study_design_scores_gemma":[0.000058008824,0.00011140812,0.00076016464,0.00016264323,0.000037735004,0.0009437598,0.0003805101,0.13357815,0.0012822232,0.8076943,0.054951273,0.0000398024],"about_ca_topic_score_codex":0.0012264012,"about_ca_topic_score_gemma":0.0010492866,"teacher_disagreement_score":0.004109338,"about_ca_system_score_codex":0.0020330274,"about_ca_system_score_gemma":0.00073995156,"threshold_uncertainty_score":0.014750719},"labels":[],"label_agreement":null},{"id":"W76655128","doi":"","title":"A Necessary and Sufficient Condition for a 3-Regular Graph to be Cordial.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.04543835954980703,"score_gpt":0.3430079223713551,"score_spread":0.29756956282154806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W76655128","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6922046,0.0007868751,0.096866965,0.0063991775,0.0017644322,0.0004626325,0.005261905,0.0037096967,0.19254366],"genre_scores_gemma":[0.96169555,0.00022498802,0.024269512,0.0008676416,0.00035316212,0.00017414418,0.0029256735,0.0002488567,0.009240467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985513,0.00017244105,0.00017103515,0.00053253036,0.00020145084,0.00037119925],"domain_scores_gemma":[0.98971784,0.0041128546,0.0012068757,0.0013444361,0.0014976949,0.002120364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010784494,0.000648224,0.0011086906,0.0013783074,0.002937149,0.0028491265,0.0013809563,0.0028977618,0.024750182],"category_scores_gemma":[0.011261677,0.00094250555,0.0015668052,0.0009907377,0.0036266341,0.004735717,0.0026386983,0.003109338,0.0049833497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013018978,0.00043807985,0.008046276,0.0006905161,0.00012083579,0.0036618654,0.0018759264,0.0031106137,0.03930471,0.8960619,0.024176484,0.021210985],"study_design_scores_gemma":[0.0004573108,0.0004557178,0.007052754,0.00024205734,0.00019013727,0.004676507,0.0024263735,0.011494045,0.027217947,0.9032766,0.04227771,0.00023282245],"about_ca_topic_score_codex":0.0019549709,"about_ca_topic_score_gemma":0.003109496,"teacher_disagreement_score":0.024750182,"about_ca_system_score_codex":0.0009898654,"about_ca_system_score_gemma":0.001549672,"threshold_uncertainty_score":0.08279759},"labels":[],"label_agreement":null},{"id":"W77443714","doi":"","title":"(K 3 +e, lambda)-group divisible designs of type g t u 1 .","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Lambda; Type (biology); Group (periodic table); Combinatorics; Arithmetic; Discrete mathematics; Physics","score_opus":0.019949034074548264,"score_gpt":0.20691167870315758,"score_spread":0.18696264462860931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W77443714","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48268017,0.00068135664,0.28881428,0.0011840373,0.00079418055,0.00031098185,0.0010817291,0.0014987553,0.2229545],"genre_scores_gemma":[0.8901332,0.0002028521,0.06383373,0.00030225626,0.00010969266,0.00015454517,0.00035697527,0.00013350608,0.044773217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917114,0.00022442531,0.000047519243,0.00015788816,0.00016915327,0.00022991617],"domain_scores_gemma":[0.99842346,0.00042817192,0.00026573907,0.0004346298,0.0002602215,0.00018776758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000677424,0.0004150158,0.00036855976,0.0008560181,0.0012491001,0.0020830906,0.00063244003,0.0009935157,0.018022578],"category_scores_gemma":[0.002312216,0.00025204947,0.0003406977,0.0007015694,0.00089789403,0.0014696374,0.0012702141,0.0007779214,0.002800525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008644347,0.000110499364,0.0014877273,0.0001556329,0.000034211786,0.00047481514,0.00044713766,0.0021992195,0.016434308,0.9293878,0.006465407,0.041938793],"study_design_scores_gemma":[0.00023186098,0.0004456299,0.001381151,0.000141581,0.00006833279,0.0012407425,0.00054226746,0.014861204,0.025958126,0.893546,0.06150271,0.00008043288],"about_ca_topic_score_codex":0.00034538572,"about_ca_topic_score_gemma":0.00063560635,"teacher_disagreement_score":0.018022578,"about_ca_system_score_codex":0.0007836183,"about_ca_system_score_gemma":0.00059068366,"threshold_uncertainty_score":0.06029147},"labels":[],"label_agreement":null},{"id":"W77586124","doi":"","title":"Remarks on MacMahons identity for sums of cubes of binomial coefficients.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Differential Equations and Dynamical Systems","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Binomial coefficient; Identity (music); Binomial (polynomial); Gaussian binomial coefficient; Central binomial coefficient; Combinatorics; Statistics; Negative binomial distribution; Poisson distribution","score_opus":0.029549851452475785,"score_gpt":0.33630465152735517,"score_spread":0.3067548000748794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W77586124","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068266764,0.008522539,0.14177549,0.04418511,0.010650472,0.00010442282,0.001241117,0.00076321006,0.7244909],"genre_scores_gemma":[0.7625583,0.005922862,0.061120074,0.017419651,0.008328342,0.0002919256,0.0007307023,0.0006079838,0.14302024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985012,0.0003611871,0.000099184326,0.0002725098,0.0005510558,0.00021485134],"domain_scores_gemma":[0.9967924,0.0017630516,0.00017674353,0.00030914438,0.00064340315,0.00031528558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030341865,0.00077829737,0.0010809833,0.0021059287,0.00335251,0.0033916428,0.0016671505,0.0019314728,0.02536017],"category_scores_gemma":[0.007930796,0.00048228208,0.0013613986,0.0011730839,0.0057443175,0.007503372,0.003986316,0.0042579616,0.002648957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014530857,0.000007688901,0.00013130272,0.000033658354,0.0000060294615,0.00011051168,0.0002559114,0.00009538375,0.0002125114,0.98901576,0.007468266,0.0026485128],"study_design_scores_gemma":[0.000009612731,0.00001131659,0.000418541,0.00002375571,0.000006856446,0.00018344121,0.000110179986,0.00052292884,0.00023645311,0.9793839,0.019079823,0.00001327496],"about_ca_topic_score_codex":0.0033491277,"about_ca_topic_score_gemma":0.0027082374,"teacher_disagreement_score":0.02536017,"about_ca_system_score_codex":0.0014946865,"about_ca_system_score_gemma":0.0007252448,"threshold_uncertainty_score":0.08483821},"labels":[],"label_agreement":null},{"id":"W77637676","doi":"","title":"Matrices with maximum exponent in the class of central symmetric primitive matrices.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Exponent; Class (philosophy); Combinatorics; Pure mathematics","score_opus":0.006770413602888647,"score_gpt":0.20700227964554374,"score_spread":0.20023186604265508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W77637676","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6267286,0.0023466037,0.27105567,0.0027384427,0.0005094506,0.00013050513,0.00097468763,0.00087066623,0.09464532],"genre_scores_gemma":[0.9601337,0.00054073194,0.024238784,0.00025275073,0.00052795507,0.000057508954,0.00036820667,0.000116217045,0.013764286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936503,0.00013809055,0.000025909478,0.00011533837,0.00018734124,0.00016824661],"domain_scores_gemma":[0.9963225,0.0019802684,0.0004848131,0.0005099835,0.00032381728,0.0003786837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007042459,0.00050624827,0.0006257243,0.0011413678,0.0011797267,0.0023984804,0.00064910186,0.0008213964,0.009136643],"category_scores_gemma":[0.0070618424,0.00033702716,0.00029606887,0.00084004167,0.0017762082,0.0032715283,0.0016696149,0.0017906568,0.0019530691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043744082,0.00008264027,0.0016800401,0.00012536313,0.000018927056,0.0005112616,0.0003007962,0.0039076614,0.0071446695,0.9466311,0.009577817,0.02958234],"study_design_scores_gemma":[0.00006738029,0.000058036225,0.0007266563,0.000041500796,0.000010191509,0.00060342916,0.00010667799,0.019595342,0.0034770814,0.96874076,0.0065530175,0.000019922993],"about_ca_topic_score_codex":0.00034693297,"about_ca_topic_score_gemma":0.0005648914,"teacher_disagreement_score":0.009136643,"about_ca_system_score_codex":0.00050643604,"about_ca_system_score_gemma":0.00053606275,"threshold_uncertainty_score":0.030565143},"labels":[],"label_agreement":null},{"id":"W77651103","doi":"","title":"Gracefulness of n-cone Cm v Kcn.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Conflict of Laws and Jurisdiction","field":"Social Sciences","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cone (formal languages); Pure mathematics; Combinatorics; Algorithm","score_opus":0.017482517811680212,"score_gpt":0.28205087288481795,"score_spread":0.26456835507313775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W77651103","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28390113,0.00088433037,0.12073503,0.0033965379,0.0005495731,0.00014750453,0.0013581216,0.0006780286,0.58834976],"genre_scores_gemma":[0.95396215,0.00031212877,0.009765869,0.00051171513,0.00014625204,0.00007517534,0.000537015,0.00015238323,0.034537315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861896,0.0002555601,0.00008760307,0.00030543338,0.0003540843,0.00037840902],"domain_scores_gemma":[0.99639755,0.0013377257,0.0004045204,0.00057334395,0.00073115807,0.00055566634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013416589,0.00038377018,0.0005861921,0.0015752787,0.0031153874,0.0041078962,0.0011270558,0.0008648409,0.014874831],"category_scores_gemma":[0.005061393,0.00032528723,0.0007994792,0.0011382885,0.004285855,0.0051115267,0.003011543,0.002114041,0.0013164474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021906846,0.0000071329982,0.00022772727,0.000016180693,0.000005038963,0.0000594634,0.0001222107,0.0003606046,0.00017792577,0.9944989,0.00150083,0.0030020766],"study_design_scores_gemma":[0.000013058222,0.000007760254,0.00036241807,0.000015477488,0.000006230885,0.00013211701,0.00014782976,0.0016718772,0.00027147922,0.9896959,0.0076658125,0.000009995028],"about_ca_topic_score_codex":0.0075075817,"about_ca_topic_score_gemma":0.0065799677,"teacher_disagreement_score":0.014874831,"about_ca_system_score_codex":0.0023668387,"about_ca_system_score_gemma":0.0015668597,"threshold_uncertainty_score":0.049761295},"labels":[],"label_agreement":null},{"id":"W77652733","doi":"","title":"New Families of Graceful Disconnected Graphs.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Totally disconnected space; Combinatorics; Locally compact space","score_opus":0.00810323921106155,"score_gpt":0.2114942933123648,"score_spread":0.20339105410130326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W77652733","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.389017,0.0038656294,0.35550764,0.0057885903,0.0006707371,0.00024288458,0.002603388,0.002717044,0.23958711],"genre_scores_gemma":[0.8888883,0.0020461436,0.054761026,0.0011964007,0.00048802875,0.00034555225,0.0023630129,0.0006761489,0.049235422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906796,0.00023268309,0.000043503416,0.00024319673,0.00025412167,0.00015859288],"domain_scores_gemma":[0.9951794,0.0021783072,0.0006000233,0.00083384395,0.00039426296,0.00081419485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009894407,0.00069434487,0.0005695921,0.0028668833,0.0026222963,0.0032234662,0.0017574832,0.0013902362,0.013503707],"category_scores_gemma":[0.0062080226,0.00071985944,0.0009339,0.001648049,0.0026116364,0.0055521647,0.0034389864,0.0022154439,0.0014519078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052578707,0.000022225635,0.0006424296,0.000069028894,0.000011073267,0.00023779485,0.0003769024,0.00201141,0.0012385043,0.9788603,0.0072126775,0.009265028],"study_design_scores_gemma":[0.000030570496,0.000021610354,0.00051034254,0.00003961545,0.00002088685,0.0007980344,0.00026724613,0.010597491,0.0010776595,0.9602154,0.02639821,0.000022779155],"about_ca_topic_score_codex":0.00081949274,"about_ca_topic_score_gemma":0.0012941376,"teacher_disagreement_score":0.013503707,"about_ca_system_score_codex":0.0017147043,"about_ca_system_score_gemma":0.0005625994,"threshold_uncertainty_score":0.04517436},"labels":[],"label_agreement":null},{"id":"W77890457","doi":"","title":"On the (s, t)-Fibonacci and Fibonacci Matrix Sequences.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Mathematics; Pisano period; Fibonacci polynomials; Combinatorics; Orthogonal polynomials","score_opus":0.012947894507071896,"score_gpt":0.2630622541065107,"score_spread":0.2501143595994388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W77890457","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08779937,0.025224414,0.40973777,0.006260607,0.0049859434,0.00018528606,0.001148706,0.00044742474,0.46421045],"genre_scores_gemma":[0.6996131,0.016341178,0.165087,0.0045652636,0.004887126,0.00059099216,0.0013616569,0.00038838945,0.107165284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989286,0.00032211654,0.00007900923,0.00016506307,0.0003295359,0.00017573051],"domain_scores_gemma":[0.99766856,0.0011990296,0.00024312489,0.00023814337,0.0004505053,0.00020064892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013916462,0.0010342563,0.0009284278,0.0031372237,0.0027550152,0.0040544765,0.0012131885,0.0020348576,0.011635988],"category_scores_gemma":[0.00732783,0.00061250525,0.0009480498,0.0028835696,0.0040767905,0.0077761305,0.002300269,0.0031597188,0.00419523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014098357,0.00000514293,0.000043756158,0.000024032435,0.0000029906867,0.00005908228,0.000093092916,0.0004651043,0.00023481357,0.99065924,0.002353052,0.0060455212],"study_design_scores_gemma":[0.000004397246,0.0000078918965,0.00006939258,0.00001943195,0.000002595207,0.00011269706,0.000032038966,0.0016134122,0.00010872962,0.9926513,0.0053682043,0.000009923051],"about_ca_topic_score_codex":0.00204543,"about_ca_topic_score_gemma":0.0020987552,"teacher_disagreement_score":0.011635988,"about_ca_system_score_codex":0.0014172872,"about_ca_system_score_gemma":0.0008756412,"threshold_uncertainty_score":0.038926244},"labels":[],"label_agreement":null},{"id":"W78303509","doi":"","title":"Subdivision of Edges and Matching Size.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Subdivision; Mathematics; Matching (statistics); Combinatorics; Statistics; Geography","score_opus":0.011272839103012763,"score_gpt":0.25503551952794085,"score_spread":0.24376268042492807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W78303509","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47621456,0.004741331,0.46092755,0.0033824681,0.00035122441,0.0002717888,0.0032115919,0.0023517807,0.048547782],"genre_scores_gemma":[0.87373734,0.001136334,0.11265217,0.0003153938,0.00026406778,0.00016438458,0.0022091325,0.00040802185,0.009113241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99655116,0.00088011345,0.00035331506,0.00087930594,0.0007720408,0.000564005],"domain_scores_gemma":[0.9572842,0.02904915,0.003517563,0.0065866592,0.0018597218,0.0017026596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044377893,0.0004932313,0.0013597886,0.0028043091,0.0008642862,0.004396192,0.002418483,0.0014279948,0.009077305],"category_scores_gemma":[0.050069764,0.00064824225,0.00087620044,0.003777943,0.00211471,0.007606464,0.002323232,0.0018163007,0.001649677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016284095,0.00051449775,0.058712598,0.00057513226,0.00023387121,0.00036616807,0.0008002576,0.067826636,0.010873425,0.50743586,0.02684878,0.32418445],"study_design_scores_gemma":[0.0001403834,0.00028334194,0.012460046,0.0001655257,0.00021992637,0.0015813737,0.00055495824,0.22600439,0.009729646,0.72998387,0.018810824,0.000065771535],"about_ca_topic_score_codex":0.0015289248,"about_ca_topic_score_gemma":0.0018691969,"teacher_disagreement_score":0.009077305,"about_ca_system_score_codex":0.0014466308,"about_ca_system_score_gemma":0.0009890778,"threshold_uncertainty_score":0.0303666},"labels":[],"label_agreement":null},{"id":"W78680835","doi":"","title":"On Quadrangulations of Closed Surfaces Covered by Vertices of Degree 3","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Combinatorics; Physics","score_opus":0.014817218742804492,"score_gpt":0.22864598655219712,"score_spread":0.21382876780939264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W78680835","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84332746,0.00040649963,0.091954656,0.00039173674,0.0001783588,0.00008265837,0.0006090355,0.00025554711,0.06279407],"genre_scores_gemma":[0.9567295,0.00036921925,0.020269834,0.0001209936,0.00006328065,0.000052867865,0.00061549456,0.00024969975,0.021529034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994492,0.000096745,0.00002538878,0.000100352525,0.00016976395,0.00015858714],"domain_scores_gemma":[0.99903405,0.00046079577,0.00018351176,0.00009282112,0.00008998926,0.00013879819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029665345,0.0010945877,0.0009774999,0.0020634956,0.0014068733,0.002616455,0.0014120264,0.0010714317,0.015404058],"category_scores_gemma":[0.0020127725,0.0006902319,0.0007329911,0.0015767583,0.0014920521,0.0020621538,0.0026099812,0.0014043755,0.0013089104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005030293,0.00014836076,0.0027031223,0.00023376042,0.00006566752,0.00089233794,0.0010810344,0.045804936,0.009085005,0.88672096,0.0049236296,0.047838103],"study_design_scores_gemma":[0.00008223048,0.00012839866,0.0026791298,0.00009279837,0.000037432408,0.0007714444,0.0011545735,0.15180768,0.0044650333,0.82713103,0.011593051,0.00005723219],"about_ca_topic_score_codex":0.0021631143,"about_ca_topic_score_gemma":0.0024814704,"teacher_disagreement_score":0.015404058,"about_ca_system_score_codex":0.0009005904,"about_ca_system_score_gemma":0.0002509924,"threshold_uncertainty_score":0.051531672},"labels":[],"label_agreement":null},{"id":"W78797683","doi":"","title":"Some Properties Of Strong Domination Numbers Of Hypergraphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.014131852217851671,"score_gpt":0.24701193208292582,"score_spread":0.23288007986507414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W78797683","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5981627,0.0027588066,0.16665614,0.0034678658,0.0003454339,0.0001704899,0.0027417815,0.0006433571,0.22505347],"genre_scores_gemma":[0.96808326,0.0007416801,0.0190918,0.00022414097,0.00036729907,0.00017401762,0.000581614,0.00010200013,0.010634098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985275,0.0004042368,0.00012234981,0.0002761875,0.00046751677,0.00020213555],"domain_scores_gemma":[0.9794312,0.015687736,0.001729529,0.00092392706,0.0011264666,0.0011011325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022288614,0.0005791037,0.00052868365,0.003209545,0.0014865786,0.004705647,0.0009888983,0.0008247745,0.009839663],"category_scores_gemma":[0.01621208,0.0006020668,0.00051521533,0.0030245448,0.0024120673,0.0068331324,0.0014165059,0.0019768716,0.00082513917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000160283,0.000041375824,0.0029313634,0.00016694602,0.000033317127,0.0001373449,0.00049986626,0.0028886856,0.0030700613,0.96378195,0.004670366,0.02161852],"study_design_scores_gemma":[0.00004228973,0.00004358985,0.0024910488,0.000062284824,0.000036254554,0.00048299608,0.00025579895,0.012724112,0.0028914327,0.9727516,0.0081873,0.000031313582],"about_ca_topic_score_codex":0.00049047155,"about_ca_topic_score_gemma":0.00073004473,"teacher_disagreement_score":0.009839663,"about_ca_system_score_codex":0.0016338603,"about_ca_system_score_gemma":0.00059252605,"threshold_uncertainty_score":0.032916903},"labels":[],"label_agreement":null},{"id":"W790617462","doi":"","title":"On the diameter of the generalized undirected de bruijn graphs","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Digraph; De Bruijn sequence; Mathematics; Undirected graph; De Bruijn graph; Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Telecommunications","score_opus":0.008907260818277427,"score_gpt":0.19244935153631856,"score_spread":0.18354209071804115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W790617462","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76031667,0.011048165,0.1484717,0.0036191507,0.00045251552,0.000102696526,0.0012809986,0.00031614213,0.074391946],"genre_scores_gemma":[0.97052956,0.0033388734,0.020783503,0.00022071888,0.0005448064,0.000137108,0.0003687885,0.00009634892,0.003980242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998855,0.00036537356,0.000050271865,0.0002942407,0.00017125857,0.0002638887],"domain_scores_gemma":[0.9924827,0.0053766323,0.0007192232,0.00042528138,0.00038094976,0.00061516394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001001606,0.00065005315,0.00079666195,0.0018591195,0.0011186661,0.0023688753,0.0010697978,0.0006815487,0.002017127],"category_scores_gemma":[0.006449709,0.0006123891,0.00042028987,0.001146954,0.0022677795,0.0028010588,0.001525724,0.001235062,0.000371432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072528474,0.000096104,0.0076772496,0.00040242774,0.000117170064,0.0008087576,0.0017955475,0.07427292,0.018920997,0.83779705,0.012607155,0.044779323],"study_design_scores_gemma":[0.000085893415,0.00015217531,0.006983026,0.00016749761,0.00009785799,0.0014430257,0.00073132815,0.1937165,0.0077597126,0.75816303,0.030608503,0.00009146743],"about_ca_topic_score_codex":0.0014299075,"about_ca_topic_score_gemma":0.00085722166,"teacher_disagreement_score":0.0023688753,"about_ca_system_score_codex":0.0017617792,"about_ca_system_score_gemma":0.00043219517,"threshold_uncertainty_score":0.012782633},"labels":[],"label_agreement":null},{"id":"W79324627","doi":"","title":"Coloring The Line.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Chromatic scale; Edge coloring; Upper and lower bounds; Graph; Brooks' theorem; Line (geometry); Discrete mathematics; Line graph; Graph power; Geometry; Mathematical analysis","score_opus":0.016802277317118676,"score_gpt":0.24196103809690092,"score_spread":0.22515876077978225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W79324627","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070373364,0.0048745084,0.49420273,0.0047223847,0.0015886097,0.00026863615,0.0028883577,0.0033466478,0.41773483],"genre_scores_gemma":[0.5266554,0.0035282108,0.24026409,0.001580127,0.0005042723,0.00029300078,0.0041410485,0.0011015696,0.22193238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995309,0.0000807119,0.000016221084,0.0001638787,0.00011165767,0.0000967209],"domain_scores_gemma":[0.99942183,0.00016003248,0.00006545465,0.00015619137,0.00011711956,0.00007948609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025490456,0.00060752645,0.00041250818,0.00063465175,0.0012305599,0.001704781,0.0007417501,0.0007540265,0.03815258],"category_scores_gemma":[0.0012283173,0.0003583046,0.00044251746,0.0010887521,0.0009255008,0.002401193,0.0011693147,0.0011703254,0.00935616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004265162,0.00010932092,0.00092536514,0.0003032415,0.000032446635,0.00020183045,0.00041074655,0.0074338797,0.01385335,0.681784,0.106798664,0.1877207],"study_design_scores_gemma":[0.00008235537,0.000120569835,0.0007275308,0.000088628934,0.000034275472,0.0007551918,0.00037263235,0.02484537,0.010304745,0.671002,0.29162973,0.000037114598],"about_ca_topic_score_codex":0.0011638823,"about_ca_topic_score_gemma":0.002136268,"teacher_disagreement_score":0.03815258,"about_ca_system_score_codex":0.00122504,"about_ca_system_score_gemma":0.0004754179,"threshold_uncertainty_score":0.1276331},"labels":[],"label_agreement":null},{"id":"W79524663","doi":"","title":"Super Vertex-magic Total Labelings of W3, n.","year":2008,"lang":"it","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; MAGIC (telescope); Vertex (graph theory); Combinatorics; Discrete mathematics; Graph; Physics; Astronomy","score_opus":0.016772864980095056,"score_gpt":0.21931891609575857,"score_spread":0.2025460511156635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W79524663","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5461846,0.00066450617,0.19952658,0.0024511614,0.0002722117,0.00009280638,0.0034051035,0.0011231507,0.24627982],"genre_scores_gemma":[0.87413913,0.00036509015,0.07345785,0.0007848849,0.00013034076,0.00012214303,0.0032509486,0.0005280649,0.047221515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993957,0.0001423571,0.00003513056,0.00013013744,0.00014194578,0.00015468374],"domain_scores_gemma":[0.9981199,0.0008344706,0.00019954274,0.00038850107,0.00021638916,0.00024108827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065314793,0.00048007912,0.00047871418,0.0013463643,0.001698593,0.002450763,0.0011537843,0.00083441066,0.015799703],"category_scores_gemma":[0.0025892302,0.00045097995,0.0006662567,0.0015098936,0.0014497138,0.0034609097,0.0017413219,0.0016924137,0.0016430465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001379552,0.000034947592,0.00056852814,0.00007935552,0.00001139264,0.00008213378,0.0001872567,0.0020296858,0.00198396,0.9711269,0.0087028155,0.015055056],"study_design_scores_gemma":[0.000025175745,0.000012630989,0.0004363586,0.000020120513,0.0000121703515,0.000113164024,0.000112011716,0.008796187,0.0013019772,0.98234653,0.0068128,0.000010875693],"about_ca_topic_score_codex":0.002075485,"about_ca_topic_score_gemma":0.0042756014,"teacher_disagreement_score":0.015799703,"about_ca_system_score_codex":0.0011665585,"about_ca_system_score_gemma":0.0006925314,"threshold_uncertainty_score":0.052855253},"labels":[],"label_agreement":null},{"id":"W79533797","doi":"","title":"Super Edge-Magic Labelings of Generalized Petersen Graphs P(n, 3).","year":2007,"lang":"es","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; MAGIC (telescope); Enhanced Data Rates for GSM Evolution; Discrete mathematics; Astrophysics; Physics; Telecommunications; Computer science","score_opus":0.013420879766842635,"score_gpt":0.24686036976779702,"score_spread":0.23343949000095437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W79533797","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6863785,0.0007120525,0.13433474,0.0016778843,0.00022976997,0.00007797924,0.001208707,0.00064840075,0.17473203],"genre_scores_gemma":[0.9350153,0.0003283829,0.047006328,0.0003517116,0.00008814627,0.00006384189,0.00085026224,0.00014400046,0.016152024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956256,0.00012026774,0.000022120612,0.000094670606,0.000103077175,0.000097272794],"domain_scores_gemma":[0.99873084,0.00060662907,0.00018033283,0.00021389459,0.00010250225,0.00016576434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041533637,0.0003341776,0.00032291672,0.0011019543,0.0014509894,0.001681871,0.000656441,0.00082415657,0.010236004],"category_scores_gemma":[0.001877603,0.00041936358,0.00043274142,0.0010287131,0.0012962093,0.0027548242,0.0014071595,0.001347595,0.00080605753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001279293,0.00003250333,0.00058875664,0.00007143811,0.000009385003,0.00014393263,0.00020805195,0.002947591,0.0026822155,0.96989113,0.0056146337,0.017682442],"study_design_scores_gemma":[0.000022713093,0.00001760674,0.0006582652,0.00002109837,0.000011909841,0.00018619257,0.00015665535,0.011887057,0.0018767482,0.97768205,0.007467207,0.0000124673925],"about_ca_topic_score_codex":0.0008759337,"about_ca_topic_score_gemma":0.0020503474,"teacher_disagreement_score":0.010236004,"about_ca_system_score_codex":0.00066766504,"about_ca_system_score_gemma":0.00045010034,"threshold_uncertainty_score":0.03424281},"labels":[],"label_agreement":null},{"id":"W79648173","doi":"","title":"On Generalizing Motzkin Numbers using k-Trees.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.035643078530386396,"score_gpt":0.2574134179686212,"score_spread":0.22177033943823482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W79648173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09059087,0.003977119,0.79296345,0.003547449,0.0009083279,0.00014702666,0.0005334221,0.0016025946,0.10572975],"genre_scores_gemma":[0.6599215,0.005033438,0.2979664,0.0015065488,0.0012695207,0.00024446298,0.0011554742,0.001106334,0.031796284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821174,0.0005384809,0.00013388,0.0003597848,0.0004693246,0.0002867868],"domain_scores_gemma":[0.99535155,0.0027026837,0.0003189553,0.0009660851,0.00041487213,0.00024586832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019916708,0.0011433145,0.0013409237,0.0042342204,0.0027838622,0.003840414,0.0018636333,0.0015692726,0.008408206],"category_scores_gemma":[0.013109544,0.0006583337,0.0015346402,0.004798106,0.0041629556,0.018837642,0.006472937,0.004646788,0.0026004964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036024823,0.000021823671,0.0003234356,0.000077493394,0.00001139948,0.00008022162,0.0002830061,0.0025714408,0.0004152322,0.9713319,0.0030133184,0.021834616],"study_design_scores_gemma":[0.000004987626,0.000008157998,0.00012853398,0.00002445653,0.00000824852,0.000104969135,0.000076877885,0.006061322,0.00027062924,0.9851944,0.008105165,0.000012247272],"about_ca_topic_score_codex":0.0022197245,"about_ca_topic_score_gemma":0.0030580726,"teacher_disagreement_score":0.008408206,"about_ca_system_score_codex":0.0017527597,"about_ca_system_score_gemma":0.0007931031,"threshold_uncertainty_score":0.028128266},"labels":[],"label_agreement":null},{"id":"W79767735","doi":"","title":"A Problem on Linear Functions and Subsets of a Finite Field.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Finite field; Field (mathematics); Pure mathematics; Combinatorics","score_opus":0.021931515880796785,"score_gpt":0.27348651806389707,"score_spread":0.2515550021831003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W79767735","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25716352,0.010201072,0.31921074,0.069388725,0.0013069145,0.00012509203,0.0016865392,0.00052837713,0.3403891],"genre_scores_gemma":[0.87325555,0.004365717,0.05610629,0.002576773,0.001436657,0.00019590376,0.0009610213,0.00022318291,0.06087888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884135,0.00052829226,0.00006693801,0.00022164699,0.00018184341,0.00016003595],"domain_scores_gemma":[0.99506575,0.0037102585,0.00019263395,0.00036978154,0.00026661655,0.00039496075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019578135,0.00047629653,0.0009588982,0.0016387742,0.0038305926,0.0037246959,0.0016474082,0.002889992,0.010822655],"category_scores_gemma":[0.0070558297,0.0005217104,0.0010088562,0.0024875351,0.005676132,0.019413715,0.0036218697,0.0040197666,0.0014126363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018771281,0.000016657896,0.00011801345,0.000036374542,0.0000036021859,0.000039440198,0.0001712737,0.00032979538,0.00007737681,0.9911419,0.0032838811,0.0047628987],"study_design_scores_gemma":[0.0000052197743,0.000004450086,0.00005476945,0.000016365015,0.0000028991806,0.00006368752,0.00016550034,0.0009109963,0.00008690652,0.99476385,0.003921907,0.000003387747],"about_ca_topic_score_codex":0.0018156568,"about_ca_topic_score_gemma":0.0016430747,"teacher_disagreement_score":0.010822655,"about_ca_system_score_codex":0.002398946,"about_ca_system_score_gemma":0.0010665562,"threshold_uncertainty_score":0.03620541},"labels":[],"label_agreement":null},{"id":"W79879488","doi":"","title":"McLeish's construction for Latin squares without intercalates.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Latin square; Intercalation (chemistry); Chemistry; Food science; Inorganic chemistry","score_opus":0.009266359935564312,"score_gpt":0.21141249303037254,"score_spread":0.20214613309480822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W79879488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023397619,0.0013895755,0.725199,0.0024881777,0.0012265141,0.00014151011,0.00046256054,0.0026357002,0.24305932],"genre_scores_gemma":[0.4511778,0.0013303265,0.37146008,0.0029817487,0.00035773136,0.0003141989,0.0004970921,0.001113334,0.17076771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991836,0.00024091401,0.000030514317,0.00016943533,0.00023434962,0.00014128798],"domain_scores_gemma":[0.9993668,0.00019116524,0.000030026178,0.00023556752,0.000112398564,0.00006407613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005401403,0.00049732416,0.0004687785,0.0010140539,0.0019786167,0.0015087783,0.0012597974,0.0010932325,0.018676518],"category_scores_gemma":[0.0024917899,0.00039453557,0.00058371533,0.0013215195,0.0019021553,0.0030438632,0.0037404152,0.0020125704,0.00534408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008440406,0.000031979605,0.00018101206,0.00013416186,0.000016834609,0.0001242746,0.00038478326,0.0011496904,0.0045197224,0.9225851,0.019357752,0.051430248],"study_design_scores_gemma":[0.000035162295,0.00005247587,0.00026542993,0.000058959038,0.000033734526,0.0003829554,0.00019210407,0.005593843,0.010903861,0.84570515,0.13672748,0.000048780268],"about_ca_topic_score_codex":0.0012045123,"about_ca_topic_score_gemma":0.0025753337,"teacher_disagreement_score":0.018676518,"about_ca_system_score_codex":0.0008212888,"about_ca_system_score_gemma":0.0007338176,"threshold_uncertainty_score":0.062479198},"labels":[],"label_agreement":null},{"id":"W799218574","doi":"","title":"Some results on 4-cycle packings","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.006447865152484092,"score_gpt":0.20106490630664814,"score_spread":0.19461704115416406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W799218574","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28173763,0.006787941,0.25154,0.0043423106,0.0010444518,0.00021470724,0.001264504,0.0008663675,0.45220202],"genre_scores_gemma":[0.7638767,0.009229281,0.08666801,0.0029122941,0.0019633207,0.00057832274,0.002537665,0.00085807126,0.13137648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905115,0.00020592894,0.0000601882,0.00017582165,0.00032676,0.00018015377],"domain_scores_gemma":[0.9965134,0.00216604,0.0003878092,0.00037140812,0.00023772953,0.0003235302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084473856,0.0017476053,0.0016711862,0.004464241,0.0032857428,0.0048468793,0.0020391636,0.0022348172,0.026148152],"category_scores_gemma":[0.0053109154,0.0012977726,0.001747517,0.009003913,0.002781101,0.006482911,0.003401633,0.0045442972,0.0031271738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010176011,0.00009282114,0.00048043623,0.00022885154,0.000034575904,0.00025629223,0.00056982465,0.009083479,0.0014391022,0.9553136,0.008299883,0.02409929],"study_design_scores_gemma":[0.00002079413,0.000020587926,0.00033464367,0.00004259084,0.000027664059,0.0001445764,0.00013310165,0.013715661,0.0006326493,0.9733183,0.011587499,0.000021942],"about_ca_topic_score_codex":0.0027804028,"about_ca_topic_score_gemma":0.0024746116,"teacher_disagreement_score":0.026148152,"about_ca_system_score_codex":0.0020404507,"about_ca_system_score_gemma":0.00091956684,"threshold_uncertainty_score":0.08747423},"labels":[],"label_agreement":null},{"id":"W8041970","doi":"","title":"About Multicoloured Cycles In K_{24n+1}.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.006737357559729747,"score_gpt":0.20348953988985208,"score_spread":0.19675218233012234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W8041970","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68727636,0.0061529195,0.12612934,0.013062,0.0012925798,0.0003026263,0.003705697,0.00043872962,0.16163974],"genre_scores_gemma":[0.93845785,0.0024807057,0.02005422,0.0017709811,0.00074256276,0.0002006975,0.0015469254,0.0001762591,0.03456985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990381,0.00028019378,0.000054074968,0.00028781468,0.00015836293,0.0001814053],"domain_scores_gemma":[0.99309075,0.004374389,0.0014179213,0.00035084938,0.0004277966,0.00033818363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084962,0.0004235473,0.00060056214,0.0019872908,0.003152837,0.002861545,0.0007763415,0.0012975644,0.01281547],"category_scores_gemma":[0.0065400647,0.00029985807,0.0008322571,0.0020926301,0.0018991288,0.0033236549,0.0011569903,0.0015393632,0.0015176748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005184059,0.00012951346,0.0031915167,0.0006717702,0.00012407506,0.0013080232,0.0028116447,0.009538191,0.005044498,0.9082635,0.018719437,0.049679436],"study_design_scores_gemma":[0.00005954393,0.00004784553,0.0020497127,0.00009851046,0.000053608575,0.0007694674,0.0005960481,0.008851673,0.0015932025,0.95785534,0.027976064,0.00004894546],"about_ca_topic_score_codex":0.002163316,"about_ca_topic_score_gemma":0.0030748157,"teacher_disagreement_score":0.01281547,"about_ca_system_score_codex":0.0016198794,"about_ca_system_score_gemma":0.00067690125,"threshold_uncertainty_score":0.04287201},"labels":[],"label_agreement":null},{"id":"W81393103","doi":"","title":"On wins in round robin tournaments.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Mathematical economics; Combinatorics","score_opus":0.02188326442882334,"score_gpt":0.2799370934631654,"score_spread":0.2580538290343421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W81393103","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21243419,0.0037706157,0.35075027,0.0053538,0.001493772,0.00040747394,0.0011515806,0.0006512673,0.42398706],"genre_scores_gemma":[0.8815694,0.002196929,0.044616904,0.0010501592,0.001112834,0.00036709534,0.00090419763,0.00034312857,0.067839324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995878,0.0021453176,0.00017292539,0.00043715298,0.00057104224,0.00079556444],"domain_scores_gemma":[0.9889004,0.0076031815,0.00094278454,0.00073688873,0.0006094338,0.0012073069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003044474,0.001174505,0.0015442367,0.001858388,0.0029676883,0.005045323,0.0020661564,0.0017195689,0.025506953],"category_scores_gemma":[0.017668217,0.0006759736,0.0010692608,0.002070802,0.003405702,0.0071515557,0.0030407638,0.0030998145,0.0027539937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030611572,0.000071311384,0.00078750483,0.00014219055,0.000054379612,0.00012763687,0.00031679156,0.013605378,0.0002885848,0.9536988,0.011167197,0.019433986],"study_design_scores_gemma":[0.00008143336,0.000071952534,0.00060713425,0.000056947265,0.000035558704,0.0001013267,0.0001645476,0.029168451,0.00018480817,0.96095645,0.008549376,0.000021910051],"about_ca_topic_score_codex":0.0033670494,"about_ca_topic_score_gemma":0.0040885163,"teacher_disagreement_score":0.025506953,"about_ca_system_score_codex":0.0019042251,"about_ca_system_score_gemma":0.0013049794,"threshold_uncertainty_score":0.085329235},"labels":[],"label_agreement":null},{"id":"W81407506","doi":"","title":"Transverse families of matchings in the plane.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Transverse plane; Plane (geometry); Combinatorics; Geometry; Structural engineering; Engineering","score_opus":0.011947212194047895,"score_gpt":0.2555910858161357,"score_spread":0.2436438736220878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W81407506","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60207474,0.0012402647,0.19702888,0.0016836886,0.00019818834,0.00009439761,0.0019053753,0.0005711688,0.19520333],"genre_scores_gemma":[0.9390347,0.0009751627,0.021384219,0.00026720745,0.000116169795,0.00008783361,0.0016414963,0.0001502105,0.036342945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937063,0.00014823204,0.000031593154,0.00016314982,0.00013645725,0.00014997507],"domain_scores_gemma":[0.9984061,0.00061456615,0.0003393957,0.00019524754,0.00017933281,0.0002652906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062362093,0.00043942468,0.00042996873,0.0019913493,0.0021503586,0.00250975,0.00072921976,0.00091042597,0.013321462],"category_scores_gemma":[0.003146,0.00063758274,0.00070349866,0.001896726,0.0013053152,0.0038544354,0.0021876758,0.0012055982,0.0018863964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000121396544,0.000026764073,0.0015488476,0.000039100472,0.000021319773,0.0004529162,0.00035894386,0.0013255876,0.0021999995,0.9820087,0.0036900553,0.00820626],"study_design_scores_gemma":[0.000060311708,0.00005344575,0.0022739877,0.000065858614,0.00006144122,0.0016329099,0.0009997311,0.013116702,0.0033678238,0.9528228,0.025517162,0.00002773459],"about_ca_topic_score_codex":0.0019902287,"about_ca_topic_score_gemma":0.0018969317,"teacher_disagreement_score":0.013321462,"about_ca_system_score_codex":0.0009928831,"about_ca_system_score_gemma":0.00043129487,"threshold_uncertainty_score":0.044564724},"labels":[],"label_agreement":null},{"id":"W81409481","doi":"","title":"On Harmonious Graphs of Order 6.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Order (exchange); Pure mathematics; Business","score_opus":0.01563067001445232,"score_gpt":0.21433968190140587,"score_spread":0.19870901188695356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W81409481","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47106263,0.002198501,0.21230185,0.004873594,0.00038882904,0.00016324704,0.0017059699,0.00091704336,0.30638844],"genre_scores_gemma":[0.866138,0.0013864735,0.06448516,0.001078712,0.0002851251,0.00017164534,0.0018766689,0.00036298888,0.06421531],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900514,0.0003249686,0.000043936077,0.00020485392,0.00018022761,0.0002409305],"domain_scores_gemma":[0.9972855,0.001326618,0.0003662031,0.0005124553,0.00020034266,0.00030893588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066201284,0.00044040516,0.00066792814,0.001471753,0.002292641,0.002549953,0.0011687457,0.0010763786,0.013894047],"category_scores_gemma":[0.003295912,0.00050729676,0.00061265065,0.0017126268,0.0021485926,0.0064160842,0.0028068668,0.0019378021,0.0022074538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054002434,0.00003364292,0.0003996306,0.0000697134,0.000011819825,0.00006114599,0.00026908983,0.0023291693,0.00082272646,0.97502524,0.0065611773,0.014362741],"study_design_scores_gemma":[0.000014504346,0.00001311725,0.00036232432,0.000023424225,0.000009084157,0.00009605736,0.00025710696,0.0049023326,0.00069249375,0.9827419,0.010878147,0.0000094943825],"about_ca_topic_score_codex":0.0015650071,"about_ca_topic_score_gemma":0.003191659,"teacher_disagreement_score":0.013894047,"about_ca_system_score_codex":0.0013963936,"about_ca_system_score_gemma":0.0005690004,"threshold_uncertainty_score":0.04648024},"labels":[],"label_agreement":null},{"id":"W81492129","doi":"","title":"On Graceful Generalized Spiders and Caterpillars.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.013052843332068093,"score_gpt":0.22129552602372116,"score_spread":0.20824268269165305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W81492129","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4162502,0.00707987,0.25464767,0.0051097646,0.0009955213,0.00017795888,0.0009531818,0.0018180079,0.31296778],"genre_scores_gemma":[0.92200947,0.0025528641,0.024312338,0.00063006155,0.0004871697,0.00008422865,0.0005260695,0.00029073312,0.049107235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993345,0.00012512914,0.00003557722,0.00012692293,0.00018076392,0.00019710054],"domain_scores_gemma":[0.9990721,0.000298998,0.00011891719,0.0002850744,0.00008544121,0.0001396238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005144221,0.00071226305,0.0009077404,0.0016309711,0.0022238959,0.0025502283,0.0010162091,0.0008624283,0.010096775],"category_scores_gemma":[0.0023184393,0.00043147683,0.0010417888,0.0019530281,0.0038959733,0.006463891,0.003569298,0.0020373536,0.001933419],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030427664,0.000013216638,0.00019792984,0.000037462516,0.0000071174704,0.000085138716,0.00016414266,0.0017011976,0.0004336068,0.9876002,0.00265597,0.007073632],"study_design_scores_gemma":[0.000006598888,0.000008864122,0.00013439506,0.000013292899,0.0000058375995,0.00009621109,0.000054291766,0.0028551177,0.00023045269,0.9904146,0.0061711962,0.000009156199],"about_ca_topic_score_codex":0.0019963498,"about_ca_topic_score_gemma":0.002985811,"teacher_disagreement_score":0.010096775,"about_ca_system_score_codex":0.0016840245,"about_ca_system_score_gemma":0.0005391655,"threshold_uncertainty_score":0.033777118},"labels":[],"label_agreement":null},{"id":"W816148045","doi":"","title":"Trees Which Admit No alpha-labelings","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Alpha (finance); Combinatorics; Statistics","score_opus":0.013306730496009656,"score_gpt":0.23318393458889114,"score_spread":0.21987720409288147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W816148045","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6192138,0.0018431989,0.19610572,0.008317513,0.00040612763,0.00014389887,0.0058230055,0.0024654425,0.16568126],"genre_scores_gemma":[0.8680402,0.0012118174,0.08375277,0.0017311721,0.00040758413,0.00019673198,0.005161806,0.00074420264,0.03875361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981317,0.00041419128,0.00013107485,0.00054081116,0.00032415078,0.00045803748],"domain_scores_gemma":[0.98267937,0.011509499,0.0011990884,0.0024456156,0.000774045,0.0013923818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016215484,0.0009177099,0.001917666,0.0015608907,0.0033693416,0.0076897317,0.0023178724,0.0029983702,0.01247843],"category_scores_gemma":[0.0090205185,0.0017063641,0.0013152764,0.0030853169,0.0032539663,0.01190882,0.0033282738,0.0051873946,0.0024034807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035956423,0.00013255612,0.0023465436,0.0002631268,0.000035061934,0.00021179297,0.0006868371,0.003460114,0.0035631047,0.95504576,0.011791102,0.022104522],"study_design_scores_gemma":[0.000056772788,0.00002043253,0.0006826834,0.000042571242,0.000038969974,0.0003083342,0.00036735335,0.008637787,0.001642862,0.97959226,0.008587544,0.000022561988],"about_ca_topic_score_codex":0.0010308154,"about_ca_topic_score_gemma":0.0019068016,"teacher_disagreement_score":0.01247843,"about_ca_system_score_codex":0.0019753615,"about_ca_system_score_gemma":0.0008301091,"threshold_uncertainty_score":0.04174453},"labels":[],"label_agreement":null},{"id":"W81615461","doi":"","title":"Circumferences of 2-Connected Claw-Free Graphs.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Claw; Mathematics; Combinatorics; Structural engineering; Engineering","score_opus":0.019228272521084465,"score_gpt":0.26707222680117987,"score_spread":0.2478439542800954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W81615461","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7294473,0.0015599198,0.06972194,0.00079212995,0.00032460634,0.000105017454,0.00208866,0.0010969891,0.19486356],"genre_scores_gemma":[0.94703746,0.0006786067,0.020107916,0.0001683145,0.000110861874,0.00012618238,0.001561041,0.00019126081,0.03001824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996195,0.00006219849,0.000021697098,0.00010215421,0.00011204882,0.0000824577],"domain_scores_gemma":[0.9985043,0.00055214675,0.00040443815,0.00013331295,0.00012686863,0.00027889985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001738086,0.0006182177,0.00036792402,0.002455677,0.0011322157,0.0018021788,0.00095860136,0.00090416893,0.013615762],"category_scores_gemma":[0.0021353585,0.00047024,0.00034013204,0.0013850249,0.0012240899,0.0016254219,0.0015976203,0.0007748374,0.002030846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004871061,0.00007800456,0.0037654785,0.0004438092,0.00007539868,0.0016173089,0.0012725596,0.012440274,0.02093136,0.88444054,0.018136187,0.05631198],"study_design_scores_gemma":[0.00012757575,0.00015808405,0.015245232,0.00018534125,0.00010888192,0.0026488276,0.0015134305,0.031802367,0.015289744,0.85534006,0.077465236,0.000115338866],"about_ca_topic_score_codex":0.0016790088,"about_ca_topic_score_gemma":0.0021172594,"teacher_disagreement_score":0.013615762,"about_ca_system_score_codex":0.00054886384,"about_ca_system_score_gemma":0.0002393635,"threshold_uncertainty_score":0.045549273},"labels":[],"label_agreement":null},{"id":"W82574740","doi":"","title":"Long Cycles in 2-Connected Triangle-Free Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Circumference; Bipartite graph; Degree (music); Graph; Connectivity; Discrete mathematics; Geometry; Physics","score_opus":0.024307189558129275,"score_gpt":0.27066436548210565,"score_spread":0.24635717592397638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W82574740","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8303348,0.003955067,0.10627983,0.0011984473,0.00023292418,0.000115367424,0.0005118947,0.00019385708,0.057177864],"genre_scores_gemma":[0.9584247,0.0013334132,0.028944392,0.00027605295,0.000060455957,0.00010884676,0.00038776197,0.00004945757,0.010414987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997508,0.000051126142,0.000015536203,0.00006294347,0.000056272664,0.00006337601],"domain_scores_gemma":[0.99910694,0.0003916073,0.00022404137,0.00007400371,0.000080023645,0.00012336508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017027084,0.00035902503,0.00021598484,0.0007229335,0.000818385,0.0007362703,0.0005072269,0.00068774656,0.004092015],"category_scores_gemma":[0.0016404393,0.0004138446,0.00030930055,0.0009228455,0.00075510296,0.0016091733,0.0012043696,0.00051246985,0.0005444724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009067512,0.00009068844,0.008755297,0.0010395185,0.000110604,0.0033125808,0.0020552494,0.046455745,0.09970811,0.73213214,0.008003692,0.09742966],"study_design_scores_gemma":[0.00013815385,0.00027086484,0.006388702,0.00023471912,0.000083260515,0.0025936256,0.0010044544,0.055416003,0.0335513,0.844318,0.055920318,0.00008058289],"about_ca_topic_score_codex":0.0012488574,"about_ca_topic_score_gemma":0.0023481771,"teacher_disagreement_score":0.004092015,"about_ca_system_score_codex":0.0005598291,"about_ca_system_score_gemma":0.00023088856,"threshold_uncertainty_score":0.013689101},"labels":[],"label_agreement":null},{"id":"W826208409","doi":"","title":"The linear t-arboricity of complete bipartite graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arboricity; Mathematics; Bipartite graph; Dense graph; Complete bipartite graph; Combinatorics; 1-planar graph; Discrete mathematics; Graph; Chordal graph; Planar graph","score_opus":0.02636395996074221,"score_gpt":0.2948282829023085,"score_spread":0.2684643229415663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W826208409","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5775509,0.0014615674,0.16931953,0.0041178735,0.00029416557,0.000118295706,0.002378572,0.0005277515,0.24423134],"genre_scores_gemma":[0.9644109,0.00090062356,0.015446126,0.00055551145,0.00030454047,0.00011576075,0.0011794174,0.00011252706,0.01697456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994672,0.0001878913,0.000029983637,0.00012655876,0.00009953132,0.00008890749],"domain_scores_gemma":[0.9957918,0.002603095,0.0005806981,0.00037893342,0.0003174028,0.00032803963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042639195,0.00028649168,0.00031764654,0.0009288069,0.0008494747,0.0018766035,0.0006016154,0.0007671801,0.010594038],"category_scores_gemma":[0.004905396,0.0003579642,0.00049786863,0.0011866303,0.0016162443,0.0026906442,0.0010410269,0.001609076,0.0015518301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001589304,0.00005518714,0.0016016898,0.00019812208,0.000031889864,0.00037626558,0.00035314955,0.0061914604,0.004195607,0.9510873,0.009360522,0.026389778],"study_design_scores_gemma":[0.000025539084,0.000032130145,0.00068457617,0.000029716519,0.000015732088,0.00035246406,0.000113071575,0.015311884,0.0010931207,0.97822475,0.0041069617,0.0000100570205],"about_ca_topic_score_codex":0.0009131713,"about_ca_topic_score_gemma":0.0012524626,"teacher_disagreement_score":0.010594038,"about_ca_system_score_codex":0.00058715336,"about_ca_system_score_gemma":0.00041971612,"threshold_uncertainty_score":0.035440624},"labels":[],"label_agreement":null},{"id":"W83024883","doi":"","title":"A note on the Alon-Saks-Seymour coloring conjecture.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Conjecture; Combinatorics","score_opus":0.012286738029871656,"score_gpt":0.19181035952498893,"score_spread":0.17952362149511727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W83024883","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053080827,0.01122794,0.20633177,0.14296618,0.021891432,0.00014093333,0.0011468681,0.0009723704,0.5622416],"genre_scores_gemma":[0.7567903,0.014048249,0.071058325,0.030976726,0.014060042,0.0002409206,0.001442027,0.00067928474,0.11070413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99758005,0.00076913583,0.00007336062,0.00048571074,0.0006612747,0.00043033535],"domain_scores_gemma":[0.98966426,0.00679648,0.00039048257,0.001408986,0.0010388156,0.000701004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036831063,0.00092518784,0.0012222863,0.001474614,0.004787402,0.0045707673,0.0025422014,0.004114827,0.021220146],"category_scores_gemma":[0.016942171,0.00055871846,0.0011370822,0.0035222718,0.006063129,0.012547792,0.0054143826,0.0071903146,0.0037352943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080227146,0.000037226353,0.00050017465,0.00009530527,0.000017466751,0.00016663593,0.000193662,0.0014000346,0.00024916136,0.92866904,0.056575045,0.012016149],"study_design_scores_gemma":[0.000015929083,0.000008303273,0.00017153083,0.000027706756,0.00000850833,0.00008004809,0.00007967611,0.0021230273,0.00012184708,0.9773637,0.019989673,0.000010079724],"about_ca_topic_score_codex":0.0048909746,"about_ca_topic_score_gemma":0.004879854,"teacher_disagreement_score":0.021220146,"about_ca_system_score_codex":0.002357392,"about_ca_system_score_gemma":0.0016981879,"threshold_uncertainty_score":0.07098848},"labels":[],"label_agreement":null},{"id":"W83305989","doi":"","title":"On a well-spread halving of regular multigraphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.004842996645751768,"score_gpt":0.19622034415575465,"score_spread":0.19137734751000288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W83305989","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32458138,0.0016699977,0.57562673,0.0023784374,0.00039119358,0.000120031655,0.0003364853,0.0006841119,0.0942116],"genre_scores_gemma":[0.86458987,0.0011601868,0.089626536,0.0007932911,0.0002972573,0.00012983014,0.00030479507,0.00030609337,0.04279213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988298,0.00044793473,0.00004201984,0.00020640921,0.00031204897,0.00016180785],"domain_scores_gemma":[0.9935869,0.003667501,0.00038562407,0.0010850633,0.0006758155,0.00059895066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011876571,0.0005903204,0.00078704173,0.0016375872,0.0018545771,0.0021638174,0.0013146688,0.0013209154,0.0073092687],"category_scores_gemma":[0.009216508,0.00056721515,0.00075253984,0.00094296184,0.0028049508,0.004329185,0.0033259934,0.0030136253,0.0014582278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009735651,0.000031004834,0.0003194207,0.000056607005,0.000019639576,0.00016942027,0.00038922793,0.007847078,0.0022203827,0.97255105,0.0037438346,0.012555001],"study_design_scores_gemma":[0.000012541847,0.000027593682,0.00014512471,0.000028535816,0.000009026174,0.0001829923,0.00012849773,0.028903427,0.0010884639,0.96626264,0.0031973692,0.000013686791],"about_ca_topic_score_codex":0.0007705898,"about_ca_topic_score_gemma":0.0010319754,"teacher_disagreement_score":0.0073092687,"about_ca_system_score_codex":0.0007878371,"about_ca_system_score_gemma":0.00050345773,"threshold_uncertainty_score":0.024451911},"labels":[],"label_agreement":null},{"id":"W83307727","doi":"","title":"Graceful Labeling Of A Family Of Quasistars With Paths In Arithmetic Progression.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arithmetic; Mathematics; Arithmetic progression; Combinatorics","score_opus":0.012457601080427075,"score_gpt":0.25431143517143134,"score_spread":0.24185383409100428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W83307727","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66048825,0.0008032764,0.21491987,0.0014736695,0.00028823194,0.00010190298,0.0015457546,0.0017805455,0.118598476],"genre_scores_gemma":[0.9112361,0.00043743034,0.055437192,0.00027432758,0.00012237683,0.00009618513,0.0012380009,0.00033088072,0.030827483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950135,0.0001008817,0.000030190482,0.00014864429,0.00010343786,0.00011555196],"domain_scores_gemma":[0.9986401,0.00054636685,0.00020419109,0.0002799166,0.0001171386,0.00021229823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005245454,0.00042738774,0.0004573447,0.0012190418,0.002229674,0.002194333,0.00083842705,0.00083962514,0.009388655],"category_scores_gemma":[0.0019471544,0.0004448644,0.00077501906,0.0011740939,0.0019252562,0.0029486555,0.0017218983,0.0014654038,0.0013663033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096214586,0.000028888691,0.0005821172,0.00004468748,0.000008529113,0.00018997131,0.00029998107,0.0022164618,0.0026642338,0.9797894,0.0031163094,0.010963338],"study_design_scores_gemma":[0.00003198075,0.000049431488,0.0006875346,0.000027136795,0.000019297597,0.00034026278,0.00020040652,0.008102571,0.0020841425,0.9718803,0.016551262,0.000025632151],"about_ca_topic_score_codex":0.001248899,"about_ca_topic_score_gemma":0.0015041198,"teacher_disagreement_score":0.009388655,"about_ca_system_score_codex":0.0011485656,"about_ca_system_score_gemma":0.00061113667,"threshold_uncertainty_score":0.03140819},"labels":[],"label_agreement":null},{"id":"W83783398","doi":"","title":"A combinatorial approach to improved Bonferroni inequalities.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bonferroni correction; Mathematics; Inequality; Combinatorics; Statistics; Mathematical analysis","score_opus":0.04787715422498203,"score_gpt":0.3059335039622838,"score_spread":0.2580563497373018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W83783398","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0101136165,0.004524996,0.8145445,0.0041511226,0.0030544484,0.000112841575,0.0007953966,0.0005193131,0.16218378],"genre_scores_gemma":[0.29465297,0.0056162486,0.5989092,0.0039814496,0.005061626,0.00045154555,0.0012877899,0.00069209986,0.089347124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970759,0.0010647972,0.00014116055,0.00036092702,0.0010363285,0.00032083303],"domain_scores_gemma":[0.99542314,0.0023234165,0.0004352718,0.00064858556,0.00088745623,0.00028213076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002900324,0.0014291186,0.00084888603,0.00270192,0.0020228077,0.002136635,0.003683295,0.0013787177,0.03267752],"category_scores_gemma":[0.015041554,0.00067440385,0.0014745278,0.003147113,0.0025674577,0.0063615837,0.0028500154,0.007906782,0.004914685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005749366,0.000041079857,0.0003637952,0.00016725763,0.000028613398,0.00009058463,0.000085836546,0.0045892186,0.0009746501,0.9224231,0.018719316,0.052459016],"study_design_scores_gemma":[0.000015055792,0.000043959062,0.0005045801,0.00006923162,0.000032356827,0.00020308152,0.00004318988,0.022190725,0.0007269807,0.9450405,0.031104105,0.00002618787],"about_ca_topic_score_codex":0.0023780728,"about_ca_topic_score_gemma":0.0069866874,"teacher_disagreement_score":0.03267752,"about_ca_system_score_codex":0.0025295804,"about_ca_system_score_gemma":0.0014614027,"threshold_uncertainty_score":0.10931724},"labels":[],"label_agreement":null},{"id":"W83819121","doi":"","title":"Families of 4-Sets Without Property B.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Property (philosophy); Pure mathematics; Combinatorics; Epistemology; Philosophy","score_opus":0.009102544129121957,"score_gpt":0.2029822138299365,"score_spread":0.19387966970081455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W83819121","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41486752,0.0015150125,0.17864247,0.002607372,0.0005518011,0.00022136838,0.0047655646,0.0012060759,0.39562276],"genre_scores_gemma":[0.9001216,0.00051378383,0.04163807,0.000665054,0.00014681704,0.000314239,0.003153462,0.00019940722,0.053247534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987149,0.00029691745,0.00010532667,0.00031232124,0.00031177962,0.00025873826],"domain_scores_gemma":[0.995828,0.0019943225,0.0005132811,0.00079054426,0.00047248346,0.00040135227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075330614,0.0005221885,0.00065528497,0.0022440613,0.004396344,0.0032338123,0.0011592043,0.001395319,0.026788035],"category_scores_gemma":[0.0041958955,0.0006363486,0.0012052153,0.0015346542,0.0015303786,0.0038502577,0.0026953842,0.0014499576,0.0037716273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002683742,0.00007754761,0.0018040136,0.00013959235,0.00005815219,0.00066907133,0.0004434104,0.0012325951,0.0032898379,0.96697515,0.00811226,0.01692992],"study_design_scores_gemma":[0.000067399575,0.00005988482,0.0018529977,0.00012597807,0.00005988756,0.00191344,0.0007396887,0.0047773086,0.0050397525,0.93856764,0.046750367,0.000045614528],"about_ca_topic_score_codex":0.0011671976,"about_ca_topic_score_gemma":0.0011369084,"teacher_disagreement_score":0.026788035,"about_ca_system_score_codex":0.0011992302,"about_ca_system_score_gemma":0.00079818745,"threshold_uncertainty_score":0.08961487},"labels":[],"label_agreement":null},{"id":"W84438073","doi":"","title":"Some Decomposition Invariants of Crowns.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Decomposition; Pure mathematics; Chemistry; Organic chemistry","score_opus":0.01163160348875944,"score_gpt":0.24985452090623791,"score_spread":0.23822291741747847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W84438073","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2368211,0.0030520542,0.3458337,0.002021109,0.0012427893,0.00020227217,0.002438469,0.0022154923,0.4061731],"genre_scores_gemma":[0.8568579,0.0012194484,0.067469865,0.0006709902,0.000616412,0.00011676147,0.0024874585,0.00078831473,0.06977281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990521,0.0001127224,0.00007300052,0.00020553869,0.0002851514,0.0002715166],"domain_scores_gemma":[0.9984218,0.0003939068,0.00026233657,0.00031409704,0.0003142915,0.00029354816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008896734,0.00051527773,0.0006680698,0.0032692216,0.0022198693,0.0047570416,0.0010546312,0.0009728715,0.01677981],"category_scores_gemma":[0.0031083701,0.000566211,0.0011780317,0.002360605,0.0029815799,0.006232529,0.0023740851,0.0027065717,0.003213341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030853145,0.000017475737,0.00033876987,0.000026198935,0.000007958678,0.000073304414,0.0001938897,0.00032257973,0.00063836086,0.98298,0.004552452,0.010818153],"study_design_scores_gemma":[0.00001704517,0.000019450697,0.00071526534,0.000037248396,0.000025923373,0.0002711224,0.00026530673,0.0027043577,0.0015001302,0.97020626,0.024217196,0.000020716972],"about_ca_topic_score_codex":0.0024869272,"about_ca_topic_score_gemma":0.0029724906,"teacher_disagreement_score":0.01677981,"about_ca_system_score_codex":0.0022808188,"about_ca_system_score_gemma":0.00068773876,"threshold_uncertainty_score":0.056134045},"labels":[],"label_agreement":null},{"id":"W84484537","doi":"","title":"Non-isomorphic Minimal Colorings of K_{4n+3}.","year":2002,"lang":"zh","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.0117901448158318,"score_gpt":0.1917539557327879,"score_spread":0.1799638109169561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W84484537","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7528751,0.00046074388,0.052797966,0.0017179844,0.0003445828,0.00011835498,0.0021640055,0.0006350629,0.18888623],"genre_scores_gemma":[0.9374264,0.00018354334,0.027339201,0.00035015665,0.00007611786,0.000073453295,0.002050028,0.00025081562,0.03225026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999466,0.00011960477,0.000026519047,0.00011043766,0.00008598482,0.00019132209],"domain_scores_gemma":[0.9983581,0.0006076305,0.00026491203,0.00032882576,0.00017046962,0.00027010115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002916972,0.00046838788,0.00043167063,0.000805429,0.0022150055,0.0018994858,0.00092748395,0.00068192097,0.017394774],"category_scores_gemma":[0.0016754238,0.00047210004,0.0005946845,0.0007414003,0.0010598995,0.0012787519,0.001252437,0.0010516489,0.0020293214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090179406,0.0002793449,0.0036351732,0.0003426484,0.00008840663,0.0011542903,0.0009251105,0.008489121,0.024470199,0.8951003,0.027533256,0.037080333],"study_design_scores_gemma":[0.00012341254,0.00005688626,0.0043668128,0.000078647136,0.0000632469,0.0009070114,0.00063291314,0.016182106,0.009328611,0.94404846,0.024163125,0.000048758848],"about_ca_topic_score_codex":0.0027424984,"about_ca_topic_score_gemma":0.006247606,"teacher_disagreement_score":0.017394774,"about_ca_system_score_codex":0.0014242851,"about_ca_system_score_gemma":0.00079148397,"threshold_uncertainty_score":0.05819136},"labels":[],"label_agreement":null},{"id":"W84558688","doi":"","title":"Enumerations of Unlabelled Multigraphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enumeration; Combinatorics; Statistics","score_opus":0.015039088537401933,"score_gpt":0.282554488399597,"score_spread":0.2675153998621951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W84558688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1351537,0.0031558946,0.65291333,0.002122015,0.0009289689,0.0002692305,0.005201245,0.0021372174,0.19811852],"genre_scores_gemma":[0.5278511,0.0020253102,0.3449762,0.0011102664,0.00038686895,0.00044409744,0.008606172,0.0011331156,0.11346682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987808,0.00039549128,0.00010514865,0.00023962471,0.00031154844,0.00016733447],"domain_scores_gemma":[0.99478513,0.002993014,0.00044556177,0.0007990589,0.000594952,0.00038235713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007400979,0.00062358327,0.00053711486,0.0023103808,0.002050649,0.0032443025,0.0014873048,0.0012217409,0.017610451],"category_scores_gemma":[0.005731097,0.00073154346,0.00075007556,0.0027283449,0.0008851185,0.0046734195,0.0023327984,0.0020232864,0.0040137437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016443778,0.000113754744,0.0012427461,0.0004488761,0.000037884252,0.0006576005,0.00069201173,0.005053332,0.0046434053,0.8821158,0.016232712,0.08859743],"study_design_scores_gemma":[0.000015315303,0.000021019838,0.0007621642,0.00020258341,0.000030128254,0.00053879153,0.00025205806,0.014932196,0.0029079018,0.9395676,0.040749546,0.000020780219],"about_ca_topic_score_codex":0.0007543723,"about_ca_topic_score_gemma":0.0029775342,"teacher_disagreement_score":0.017610451,"about_ca_system_score_codex":0.001204968,"about_ca_system_score_gemma":0.0006101351,"threshold_uncertainty_score":0.058912873},"labels":[],"label_agreement":null},{"id":"W84701360","doi":"","title":"On the Analysis of an Algorithm to Generate a Random Cyclic Permutation.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Random permutation; Permutation (music); Algorithm; Combinatorics; Symmetric group","score_opus":0.011586855971283309,"score_gpt":0.23659800854443166,"score_spread":0.22501115257314835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W84701360","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04159587,0.0006969527,0.92209285,0.0010670192,0.00017589849,0.00038228827,0.00030628187,0.0015985167,0.032084294],"genre_scores_gemma":[0.43297875,0.0010718411,0.53255165,0.0010662379,0.00046976245,0.0012559303,0.0012970984,0.0013891285,0.027919587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964665,0.0012287871,0.00020421139,0.0005296603,0.0010202753,0.00055055844],"domain_scores_gemma":[0.9827152,0.013720384,0.0008174346,0.0015287418,0.0008520455,0.000366198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003869413,0.0013272952,0.001363019,0.0023530785,0.0018966817,0.0027425324,0.0028697485,0.0024114754,0.011607544],"category_scores_gemma":[0.025515033,0.0007019978,0.0021379315,0.0023838899,0.0037428774,0.004701698,0.002820972,0.0024839493,0.0028578273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042728966,0.00019453836,0.0015307422,0.00030386302,0.00012477259,0.00016825876,0.0002377309,0.17335391,0.0026853401,0.7401767,0.010768935,0.070027955],"study_design_scores_gemma":[0.00010117264,0.00012807644,0.00033780574,0.00005749632,0.00005434254,0.00017242508,0.000052574942,0.4927008,0.0016163249,0.50018895,0.004553759,0.000036306075],"about_ca_topic_score_codex":0.0023049146,"about_ca_topic_score_gemma":0.0025804855,"teacher_disagreement_score":0.011607544,"about_ca_system_score_codex":0.0024670358,"about_ca_system_score_gemma":0.0031917333,"threshold_uncertainty_score":0.038831174},"labels":[],"label_agreement":null},{"id":"W84752148","doi":"","title":"Lower bounds on the signed k-subdomination number of graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.013654151886603199,"score_gpt":0.27968573837148053,"score_spread":0.26603158648487735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W84752148","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.338095,0.0067302664,0.28620538,0.010327859,0.0020378495,0.00027778005,0.004467978,0.0023924797,0.3494654],"genre_scores_gemma":[0.87582344,0.0034958008,0.08220234,0.0011348991,0.0010319942,0.0004874089,0.0033404515,0.00071461994,0.03176902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979797,0.00037003486,0.00012624766,0.00038966126,0.0006933405,0.00044100874],"domain_scores_gemma":[0.98115784,0.012200165,0.001301285,0.0021661667,0.0015040573,0.0016704878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018996024,0.0016883509,0.0013987161,0.0035982188,0.0020882208,0.004954644,0.0032442405,0.0023064185,0.019492669],"category_scores_gemma":[0.0205576,0.0006478331,0.0010171375,0.0027686923,0.002764025,0.009613397,0.0031965843,0.0048164604,0.0046068467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011899238,0.0002895686,0.004152395,0.00087051385,0.000109124165,0.00033142755,0.0004708963,0.024438202,0.01484371,0.8258269,0.03458457,0.092892796],"study_design_scores_gemma":[0.00006797042,0.00012014901,0.0020613896,0.00016722993,0.00008845438,0.0005773888,0.00017199886,0.04823378,0.0072716298,0.9233132,0.017854037,0.00007275906],"about_ca_topic_score_codex":0.00061312556,"about_ca_topic_score_gemma":0.0014725723,"teacher_disagreement_score":0.019492669,"about_ca_system_score_codex":0.002419759,"about_ca_system_score_gemma":0.0013592803,"threshold_uncertainty_score":0.06520945},"labels":[],"label_agreement":null},{"id":"W85037577","doi":"","title":"Use of complementary property of block designs in PBIB designs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Optimal Experimental Design Methods","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Property (philosophy); Block (permutation group theory); Arithmetic; Combinatorics; Epistemology","score_opus":0.30908903331026544,"score_gpt":0.43611893173867033,"score_spread":0.1270298984284049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W85037577","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00500433,0.00026496168,0.9881521,0.00007936813,0.00005390955,0.00026100012,0.00012370656,0.00015419244,0.0059064557],"genre_scores_gemma":[0.18844245,0.0005103313,0.80422074,0.00026388545,0.00009861573,0.0028249556,0.00023303182,0.00014881529,0.0032571633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97090334,0.02372686,0.0007096082,0.0016462656,0.0025301196,0.000483779],"domain_scores_gemma":[0.94388413,0.045845136,0.0024048677,0.0051922263,0.002168148,0.0005054254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019708151,0.0013991705,0.0020014988,0.0019800267,0.0007796936,0.0018592735,0.0013679178,0.001319636,0.013679651],"category_scores_gemma":[0.053318158,0.001052577,0.0013503368,0.0018704811,0.0026964406,0.0023585418,0.0023222044,0.001981306,0.0019715691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019826523,0.00041197898,0.0018962288,0.001348626,0.00037113237,0.00012837624,0.00020518865,0.0677272,0.009281089,0.65526736,0.0027342746,0.25864595],"study_design_scores_gemma":[0.00084909465,0.0031110023,0.0014545385,0.00044819713,0.00043475776,0.00025685297,0.0001032018,0.34079325,0.01889003,0.60867363,0.024894528,0.00009093164],"about_ca_topic_score_codex":0.0004848826,"about_ca_topic_score_gemma":0.000812703,"teacher_disagreement_score":0.019708151,"about_ca_system_score_codex":0.0010801649,"about_ca_system_score_gemma":0.0030888563,"threshold_uncertainty_score":0.10422796},"labels":[],"label_agreement":null},{"id":"W85383986","doi":"","title":"A table of lower bounds for the number of mutually orthogonal frequency squares","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Mathematics; Table (database); Combinatorics; Arithmetic; Statistics; Computer science","score_opus":0.014791926258050906,"score_gpt":0.2795426746781005,"score_spread":0.2647507484200496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W85383986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021534404,0.058931425,0.65466744,0.00930666,0.004393129,0.0006947413,0.017729914,0.011308747,0.22143349],"genre_scores_gemma":[0.19887795,0.031085754,0.66862786,0.0063504307,0.004758966,0.0025085583,0.023899663,0.006051434,0.05783939],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9911342,0.0019878852,0.00079086854,0.0011539791,0.0038028073,0.0011302189],"domain_scores_gemma":[0.95294565,0.037449066,0.0014592919,0.0048399484,0.0025629841,0.0007431175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004534248,0.0055962447,0.003990415,0.0076182215,0.0034757757,0.008905069,0.0052139885,0.0030474118,0.07624461],"category_scores_gemma":[0.035526715,0.0019573253,0.0027121091,0.008680301,0.0020636467,0.009949928,0.0033764394,0.008636654,0.03592317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014875467,0.000611687,0.0014737608,0.0041562696,0.0004523047,0.00039566844,0.00016644194,0.052679826,0.011421809,0.17994317,0.18215452,0.56505704],"study_design_scores_gemma":[0.00064011925,0.0010635726,0.002560288,0.0017610845,0.0006312719,0.002760204,0.0002472654,0.13639373,0.02191119,0.6161927,0.21531837,0.000520256],"about_ca_topic_score_codex":0.001273386,"about_ca_topic_score_gemma":0.0031730041,"teacher_disagreement_score":0.07624461,"about_ca_system_score_codex":0.003736515,"about_ca_system_score_gemma":0.0033625448,"threshold_uncertainty_score":0.2550636},"labels":[],"label_agreement":null},{"id":"W85618462","doi":"","title":"Antimagic labelings of Msbius grids.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.006653792010955298,"score_gpt":0.20664130603469208,"score_spread":0.19998751402373677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W85618462","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3069889,0.001204036,0.3587256,0.0037673574,0.00047479584,0.00022515345,0.0032963585,0.0019446868,0.32337314],"genre_scores_gemma":[0.786895,0.00068483705,0.13547617,0.0007348225,0.0001568579,0.0002245429,0.003031072,0.0004815036,0.07231523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992342,0.00021734218,0.00005015703,0.00016102423,0.00016959394,0.00016763617],"domain_scores_gemma":[0.99809915,0.0007121838,0.00019691941,0.0004608561,0.00023404215,0.00029690875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043389326,0.0004081382,0.00054370123,0.0013332741,0.0024929743,0.0030637563,0.0010922566,0.0011239242,0.018381016],"category_scores_gemma":[0.002987457,0.0004945639,0.00058971136,0.0018373225,0.0013144736,0.003718199,0.0028049666,0.0015491343,0.0031993142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088704095,0.000024323055,0.00036355155,0.00006610342,0.000007697523,0.000063896594,0.00020456973,0.0017968501,0.0015124243,0.9727471,0.007234145,0.015890649],"study_design_scores_gemma":[0.000021424205,0.000017586033,0.00030396157,0.000035274803,0.000010565733,0.00015165206,0.0002785916,0.009442545,0.0023099813,0.9610569,0.026359443,0.000011981315],"about_ca_topic_score_codex":0.0019311631,"about_ca_topic_score_gemma":0.003256663,"teacher_disagreement_score":0.018381016,"about_ca_system_score_codex":0.0016775212,"about_ca_system_score_gemma":0.00069401244,"threshold_uncertainty_score":0.061490655},"labels":[],"label_agreement":null},{"id":"W85795673","doi":"","title":"The Connectivities of Trunk Graphs of Connected Graphs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chordal graph; Trunk; Combinatorics; Graph; Botany","score_opus":0.015913673954377816,"score_gpt":0.26678116363131926,"score_spread":0.25086748967694145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W85795673","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8020311,0.0009134258,0.07836864,0.000686556,0.0000851182,0.00008171588,0.0021617005,0.0003493397,0.11532243],"genre_scores_gemma":[0.96524227,0.0010390847,0.018275803,0.00014596894,0.00012003618,0.00013402477,0.0020205886,0.00014323344,0.012879134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950826,0.000111972375,0.000029114788,0.00014161087,0.000111137124,0.000097901924],"domain_scores_gemma":[0.9941099,0.003468603,0.0009345488,0.00041486273,0.00052374764,0.00054826547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042131235,0.00043216898,0.0003457219,0.0046050237,0.0014664278,0.0023007614,0.000837999,0.00097577664,0.0139970705],"category_scores_gemma":[0.007501083,0.0006861044,0.00043865023,0.0024871295,0.0016888364,0.0040678536,0.0017414637,0.0013693736,0.001605236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024127738,0.000064134205,0.009346463,0.00022703511,0.00005451072,0.00061706925,0.0018997492,0.004424126,0.008085527,0.9298428,0.0058949846,0.03930221],"study_design_scores_gemma":[0.000034911085,0.00004913702,0.008762951,0.00015256375,0.0001012794,0.0014267337,0.001092764,0.015500197,0.004056734,0.95395434,0.014841946,0.000026414064],"about_ca_topic_score_codex":0.000881678,"about_ca_topic_score_gemma":0.0016392792,"teacher_disagreement_score":0.0139970705,"about_ca_system_score_codex":0.00054959604,"about_ca_system_score_gemma":0.00023564529,"threshold_uncertainty_score":0.046824872},"labels":[],"label_agreement":null},{"id":"W85932271","doi":"","title":"On the stabilizers of the minimum-weight codewords of the binary codes from triangular graphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Binary number; Minimum weight; Combinatorics; Discrete mathematics; Arithmetic","score_opus":0.021324565282180588,"score_gpt":0.2516983781995553,"score_spread":0.23037381291737474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W85932271","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6965405,0.0013081336,0.2063152,0.0017837072,0.0004613353,0.00012839248,0.00090545893,0.0005299351,0.09202746],"genre_scores_gemma":[0.97264636,0.0005259124,0.013213771,0.00020957387,0.00027189348,0.00009778135,0.00048615778,0.00014191898,0.012406627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995677,0.00010576735,0.000020024952,0.0000650106,0.0001415071,0.000099937875],"domain_scores_gemma":[0.99820554,0.0008523117,0.00031565732,0.0001958496,0.00023252169,0.00019813325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004238676,0.00049466453,0.00048478853,0.0013737862,0.0010589493,0.0012619825,0.00073536363,0.0009312277,0.007978153],"category_scores_gemma":[0.004454846,0.00028637997,0.00032093804,0.0007340323,0.0013052989,0.0016326397,0.0012712514,0.0013086569,0.0012910333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014783867,0.000037066653,0.00050087186,0.000102889804,0.00001366281,0.0001591089,0.00035082793,0.011253072,0.008307032,0.95801115,0.0046334052,0.016482996],"study_design_scores_gemma":[0.00003411292,0.00004010631,0.00045681754,0.00003728905,0.000010539659,0.00010913032,0.0001310537,0.05121419,0.0028633282,0.94241464,0.0026682778,0.000020598942],"about_ca_topic_score_codex":0.0011150684,"about_ca_topic_score_gemma":0.0014740202,"teacher_disagreement_score":0.007978153,"about_ca_system_score_codex":0.0005473626,"about_ca_system_score_gemma":0.00035118658,"threshold_uncertainty_score":0.02668953},"labels":[],"label_agreement":null},{"id":"W86337286","doi":"","title":"Choice Number of Complete Multipartite Graphs with Part Size at Most Three.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Multipartite; Mathematics; Combinatorics; Discrete mathematics; Quantum; Physics","score_opus":0.015502711279403218,"score_gpt":0.23160026924501825,"score_spread":0.21609755796561503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W86337286","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7765136,0.0017510151,0.08966929,0.00605096,0.00029527492,0.00015003102,0.006146495,0.00078448636,0.11863882],"genre_scores_gemma":[0.9529815,0.00058517646,0.025091836,0.0005151188,0.0001442959,0.00016310936,0.0024205046,0.0002479826,0.017850537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870896,0.00044749674,0.000062501764,0.00029560048,0.000270277,0.00021516532],"domain_scores_gemma":[0.9879529,0.00855485,0.0008336054,0.0009773263,0.00031756324,0.0013638682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014807485,0.0005511204,0.0009416761,0.0013554662,0.0017836476,0.004459194,0.0018370698,0.0018482078,0.015670562],"category_scores_gemma":[0.008333831,0.00083254697,0.0008387319,0.0016933928,0.002317587,0.0048303655,0.0022378466,0.0020577249,0.0013583285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019053931,0.00017901926,0.0063950988,0.00076264475,0.00013156167,0.00027268118,0.0004932526,0.031923402,0.008531997,0.8739061,0.04044604,0.035052948],"study_design_scores_gemma":[0.00022911422,0.000111425405,0.0029157884,0.00009006301,0.00008935668,0.00056092284,0.00025640984,0.068180434,0.005877107,0.9063749,0.015257844,0.000056746536],"about_ca_topic_score_codex":0.00081778434,"about_ca_topic_score_gemma":0.0012481409,"teacher_disagreement_score":0.015670562,"about_ca_system_score_codex":0.0018706645,"about_ca_system_score_gemma":0.0009274221,"threshold_uncertainty_score":0.0524233},"labels":[],"label_agreement":null},{"id":"W87144123","doi":"","title":"Asymptotic density of brick and word codes.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Word (group theory); Brick; Geometry; Composite material; Materials science","score_opus":0.008523496338954441,"score_gpt":0.23582183955557454,"score_spread":0.2272983432166201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W87144123","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47175124,0.0049781734,0.36623624,0.007798723,0.0007425861,0.00016544845,0.0025501472,0.0016458065,0.1441316],"genre_scores_gemma":[0.9555,0.0017421835,0.016068889,0.00084001996,0.00082312926,0.00037016967,0.0012466167,0.00034978706,0.02305911],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808985,0.0006059583,0.00006135228,0.00022403091,0.00066125,0.00035739862],"domain_scores_gemma":[0.97539073,0.017626032,0.001335452,0.0020915589,0.0021474182,0.0014088271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025147232,0.00060479355,0.0012877837,0.0031059135,0.0014532135,0.002832158,0.0023266156,0.0017678493,0.013426222],"category_scores_gemma":[0.043441955,0.00066295645,0.0005686149,0.0018249708,0.0039950456,0.005561161,0.003215347,0.0025221822,0.0022096068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007584577,0.00003240159,0.00072349556,0.000097764205,0.000015487378,0.000056793986,0.00013214911,0.006742688,0.000626201,0.97770005,0.0073404633,0.006456584],"study_design_scores_gemma":[0.000026875585,0.00001955936,0.00073492056,0.00005960546,0.000010468682,0.0002237204,0.00008944324,0.05881862,0.0006172807,0.93683803,0.0025321895,0.000029322706],"about_ca_topic_score_codex":0.0020639158,"about_ca_topic_score_gemma":0.0017288531,"teacher_disagreement_score":0.013426222,"about_ca_system_score_codex":0.0020589707,"about_ca_system_score_gemma":0.0011877454,"threshold_uncertainty_score":0.04491514},"labels":[],"label_agreement":null},{"id":"W87963164","doi":"","title":"Plane Triangulations in Product Graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Plane (geometry); Product (mathematics); Combinatorics; Geometry","score_opus":0.014243543009763179,"score_gpt":0.2553033681488159,"score_spread":0.2410598251390527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W87963164","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21862932,0.00438417,0.63332623,0.0011967858,0.00048472808,0.00012730906,0.0013313761,0.00090934976,0.13961071],"genre_scores_gemma":[0.7637366,0.0043562856,0.16669545,0.00030726902,0.00028443252,0.00011254272,0.0018185957,0.0005103368,0.062178493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953437,0.0001291553,0.00002905511,0.00009757312,0.00014209768,0.00006768529],"domain_scores_gemma":[0.9987785,0.00050796353,0.00023012301,0.00020413332,0.00016466128,0.0001145662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033775796,0.00037876877,0.0004464886,0.0019119167,0.000958373,0.0022272503,0.0006424467,0.00073800364,0.013747364],"category_scores_gemma":[0.0022750718,0.00052753976,0.0005713571,0.002046025,0.0014718904,0.0029119735,0.0015858164,0.001407823,0.0030418122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008075257,0.000020655325,0.0008864356,0.00013772705,0.00002335449,0.00025416721,0.0003198758,0.0057319524,0.0021662465,0.92282706,0.008270672,0.05928107],"study_design_scores_gemma":[0.000023214467,0.000033301836,0.0008796492,0.00006559839,0.000026760057,0.0007703939,0.00044489518,0.023324957,0.0018190566,0.93282956,0.03976261,0.00002000903],"about_ca_topic_score_codex":0.001899531,"about_ca_topic_score_gemma":0.0030682525,"teacher_disagreement_score":0.013747364,"about_ca_system_score_codex":0.0006926222,"about_ca_system_score_gemma":0.00033133515,"threshold_uncertainty_score":0.045989513},"labels":[],"label_agreement":null},{"id":"W87985346","doi":"","title":"Some lower bounds on the spectral radius of graphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; RADIUS; Combinatorics; Physics; Computer science; Eigenvalues and eigenvectors; Quantum mechanics","score_opus":0.022064633671120406,"score_gpt":0.2778792810301615,"score_spread":0.25581464735904114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W87985346","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093122795,0.07102991,0.4485173,0.018363785,0.0031593714,0.00016228818,0.0034142304,0.0024383238,0.359792],"genre_scores_gemma":[0.75474066,0.03680942,0.14122401,0.006112603,0.008049321,0.00086633035,0.0037820956,0.0028016418,0.045613866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99628687,0.0011324674,0.00018488467,0.00074450456,0.0011083098,0.0005429489],"domain_scores_gemma":[0.9695686,0.023144735,0.0012754117,0.0024863156,0.0017329081,0.001791904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003906595,0.0029738264,0.0026706466,0.007344359,0.002731541,0.0053861383,0.0044625187,0.003469607,0.020144256],"category_scores_gemma":[0.03205678,0.0014237658,0.0020135178,0.004995158,0.004344046,0.009849973,0.0048151603,0.009028356,0.0074265837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002784428,0.00011193013,0.00093650224,0.00071600004,0.00012295581,0.00021204559,0.0004625031,0.010401265,0.004398089,0.8997169,0.03922125,0.043421987],"study_design_scores_gemma":[0.000023175555,0.000046654877,0.0010536369,0.00018509591,0.000094902854,0.00043147328,0.00016707419,0.02422979,0.0026326822,0.9526923,0.018395474,0.00004767994],"about_ca_topic_score_codex":0.0010921978,"about_ca_topic_score_gemma":0.0014069224,"teacher_disagreement_score":0.020144256,"about_ca_system_score_codex":0.0029678477,"about_ca_system_score_gemma":0.0006331731,"threshold_uncertainty_score":0.06738925},"labels":[],"label_agreement":null},{"id":"W88187898","doi":"","title":"New Quasi-Cyclic Codes over GF(8) with Improved Minimum Distance.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Minimum distance; Arithmetic","score_opus":0.006523910088930377,"score_gpt":0.21579717158636735,"score_spread":0.20927326149743697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W88187898","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41718885,0.008185054,0.4813384,0.0056682527,0.0027972413,0.00036947028,0.0016391259,0.002259787,0.080553874],"genre_scores_gemma":[0.678603,0.0023120383,0.28726628,0.0009645913,0.0007095889,0.00030234325,0.0013180809,0.00025502816,0.028269041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992654,0.00015252341,0.000050172945,0.00008083365,0.00033944007,0.00011160948],"domain_scores_gemma":[0.9979388,0.00066132646,0.00031908462,0.0004931157,0.0004005047,0.00018713169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006809465,0.00039430693,0.00047586721,0.00085452147,0.00062378857,0.0011580968,0.00083367864,0.00076643005,0.0048445407],"category_scores_gemma":[0.0028657222,0.00029299184,0.00031387518,0.0011174594,0.0007384584,0.0015753433,0.0011254824,0.0010491257,0.0013961071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001315887,0.00040116216,0.0018400301,0.00066419493,0.00009625477,0.00077104237,0.00049144996,0.02929025,0.11480594,0.5487378,0.023697147,0.27788886],"study_design_scores_gemma":[0.00085776014,0.0013553597,0.0038700148,0.0003677834,0.00024008243,0.0048973244,0.00029185935,0.2568097,0.1488657,0.39980564,0.18232597,0.0003128928],"about_ca_topic_score_codex":0.00048931694,"about_ca_topic_score_gemma":0.0017741026,"teacher_disagreement_score":0.0048445407,"about_ca_system_score_codex":0.0007626267,"about_ca_system_score_gemma":0.0013668434,"threshold_uncertainty_score":0.016206622},"labels":[],"label_agreement":null},{"id":"W88557129","doi":"","title":"n-Color Analogues of Gaussian Polynomials.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Gaussian; Pure mathematics; Orthogonal polynomials; Computational chemistry; Chemistry","score_opus":0.03778221852455074,"score_gpt":0.3139576168042434,"score_spread":0.2761753982796926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W88557129","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18759859,0.002637982,0.14180236,0.0025550663,0.0030080925,0.00005482149,0.00045869136,0.00048666727,0.6613978],"genre_scores_gemma":[0.8708616,0.0011987274,0.027018053,0.0010807427,0.00094267115,0.000048150163,0.00021702741,0.00019364309,0.09843945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995604,0.000102738464,0.000010811137,0.00008136697,0.0001386322,0.00010608094],"domain_scores_gemma":[0.9993949,0.000105359686,0.00010300908,0.000118585456,0.00014050752,0.00013757938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043722562,0.00041317666,0.00037662746,0.0010346707,0.0012779325,0.0016327882,0.0007176662,0.00075963687,0.010172332],"category_scores_gemma":[0.002085636,0.00019920326,0.00048863573,0.0008066238,0.0019301083,0.0022997316,0.0014472764,0.0018511482,0.0021560765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011950873,0.000009199301,0.000049960312,0.000009744664,0.0000013082257,0.000032560158,0.000040296094,0.00014515486,0.0003049957,0.994669,0.0016649739,0.0030607483],"study_design_scores_gemma":[0.000011564298,0.00001460642,0.0002483988,0.000013804336,0.0000036293613,0.00020720757,0.000044204888,0.0025693637,0.00045284888,0.9819171,0.014506989,0.000010273393],"about_ca_topic_score_codex":0.0014043868,"about_ca_topic_score_gemma":0.0023034578,"teacher_disagreement_score":0.010172332,"about_ca_system_score_codex":0.0011713097,"about_ca_system_score_gemma":0.00061435567,"threshold_uncertainty_score":0.03402984},"labels":[],"label_agreement":null},{"id":"W89427633","doi":"","title":"Color Switching Games.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.007968632647909842,"score_gpt":0.225765497107169,"score_spread":0.21779686445925917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W89427633","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03684707,0.002831552,0.13810113,0.005108855,0.0010911219,0.00013867648,0.0012004592,0.0005635337,0.81411755],"genre_scores_gemma":[0.6667541,0.0022359376,0.0368264,0.002248777,0.0005480645,0.0002472769,0.0010563675,0.00022223925,0.28986087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996106,0.00009806381,0.000013607391,0.00008202341,0.00010565231,0.00009001415],"domain_scores_gemma":[0.99950564,0.00017761801,0.000039369035,0.00008664348,0.00009532482,0.0000954825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032687737,0.000712753,0.0004923621,0.0006784507,0.0011435563,0.0022838167,0.0010217134,0.0011307547,0.030567799],"category_scores_gemma":[0.0012331823,0.0002301854,0.00051715586,0.00079413725,0.0013002661,0.002557548,0.0011305775,0.0020239449,0.0037057158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026909092,0.000027739725,0.00011230593,0.000029922137,0.000007751696,0.000038885766,0.00006464169,0.0009743018,0.000525661,0.96888787,0.015348133,0.013955875],"study_design_scores_gemma":[0.000018319033,0.0000136166145,0.00015576289,0.000015871912,0.000010534876,0.00010492989,0.00005712714,0.008198841,0.00050516316,0.9513191,0.03959281,0.000007974538],"about_ca_topic_score_codex":0.0025822378,"about_ca_topic_score_gemma":0.0043336865,"teacher_disagreement_score":0.030567799,"about_ca_system_score_codex":0.0018084602,"about_ca_system_score_gemma":0.00072571327,"threshold_uncertainty_score":0.10225946},"labels":[],"label_agreement":null},{"id":"W89466359","doi":"","title":"Cops, robber, and photo radar.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"3D Surveying and Cultural Heritage","field":"Earth and Planetary Sciences","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Physics; Stereochemistry; Combinatorics; Mathematics; Chemistry","score_opus":0.010431531213071448,"score_gpt":0.19741715737042334,"score_spread":0.1869856261573519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W89466359","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027878892,0.036179963,0.048878215,0.010244307,0.008345482,0.00010397833,0.0027842887,0.005107946,0.88556796],"genre_scores_gemma":[0.047157593,0.016722824,0.02426143,0.002756352,0.00406173,0.000081636936,0.0030548745,0.00083613285,0.90106744],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99882036,0.00015981116,0.000052328618,0.00035063556,0.00051340106,0.00010345931],"domain_scores_gemma":[0.9988538,0.0001769905,0.00012434371,0.0003190049,0.0002267135,0.00029917737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008239893,0.0013593731,0.0006156511,0.003939361,0.0015319437,0.004269566,0.00087702525,0.002146613,0.1656316],"category_scores_gemma":[0.003242975,0.0007325253,0.00061223155,0.0036318672,0.001449453,0.0048058443,0.0030811909,0.0015438403,0.06752992],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008903579,0.00003951806,0.0013652298,0.000244165,0.000026477031,0.00021315967,0.00024792997,0.0005725486,0.00089778064,0.09428323,0.5109972,0.39102373],"study_design_scores_gemma":[0.0000033074473,0.0000098136525,0.0009845878,0.00006194067,0.0000048143415,0.0003229885,0.00011672071,0.00046529374,0.00026671225,0.010665978,0.987086,0.000011880536],"about_ca_topic_score_codex":0.00573035,"about_ca_topic_score_gemma":0.018025318,"teacher_disagreement_score":0.1656316,"about_ca_system_score_codex":0.0012325962,"about_ca_system_score_gemma":0.0007758415,"threshold_uncertainty_score":0.5540929},"labels":[],"label_agreement":null},{"id":"W89704318","doi":"","title":"i?(1)-perfect graphs with girth at least six.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Girth (graph theory); Combinatorics","score_opus":0.006569376156257282,"score_gpt":0.16942580496164364,"score_spread":0.16285642880538637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W89704318","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4162985,0.0016745275,0.1427725,0.005918239,0.00080842915,0.00028889842,0.0069062468,0.0022917367,0.42304084],"genre_scores_gemma":[0.90386635,0.00093069754,0.046134096,0.0010030782,0.0002313295,0.00018699665,0.0035209479,0.0002059678,0.04392059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907434,0.0001670878,0.000047550813,0.00021271365,0.00015782559,0.00034047768],"domain_scores_gemma":[0.9972541,0.0007443541,0.0005645056,0.0007036577,0.0003046848,0.00042879026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006530387,0.00069042336,0.0007747008,0.0014208812,0.0021418524,0.0031509192,0.0013553688,0.001570093,0.015204207],"category_scores_gemma":[0.0038404088,0.0006666814,0.0006554452,0.0015112817,0.0016557233,0.0035024933,0.002726813,0.0017926064,0.0035237535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048616537,0.0001474788,0.003083971,0.00037068443,0.00007252825,0.00055045483,0.000549943,0.0054418948,0.009237026,0.90658957,0.031608887,0.041861363],"study_design_scores_gemma":[0.0000642732,0.00010253426,0.002198424,0.00013076578,0.00008013756,0.0013287072,0.00045523242,0.008224278,0.0062526744,0.941446,0.039667908,0.00004900449],"about_ca_topic_score_codex":0.0008807816,"about_ca_topic_score_gemma":0.0013676846,"teacher_disagreement_score":0.015204207,"about_ca_system_score_codex":0.001026812,"about_ca_system_score_gemma":0.0008692652,"threshold_uncertainty_score":0.050863206},"labels":[],"label_agreement":null},{"id":"W89854994","doi":"","title":"On the Cordiality of Corona Graphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Corona (planetary geology); Combinatorics; Physics; Astrobiology","score_opus":0.01135932491286377,"score_gpt":0.21319214483831533,"score_spread":0.20183281992545157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W89854994","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3960681,0.008504959,0.18923917,0.015346054,0.0009758276,0.0001118377,0.001659585,0.0008800844,0.3872144],"genre_scores_gemma":[0.9257646,0.0034267306,0.031853803,0.0019297375,0.0009107745,0.00009060966,0.0010632072,0.00031447053,0.03464601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925715,0.00020440984,0.000038850867,0.00020972898,0.00012416483,0.00016578512],"domain_scores_gemma":[0.9939976,0.0037627476,0.00048480488,0.000723796,0.0003722735,0.0006587677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001064954,0.00048979785,0.00071626884,0.0018571102,0.0026085568,0.0034498281,0.0011376576,0.0016407985,0.014004101],"category_scores_gemma":[0.008863602,0.0005341722,0.00056775595,0.0018197923,0.003933176,0.010098858,0.0029118308,0.0029051946,0.0015039322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050196213,0.000025105179,0.0006717716,0.00006748657,0.000006773562,0.00004435008,0.0001936899,0.0010520042,0.00046955442,0.9785241,0.0072525884,0.011642533],"study_design_scores_gemma":[0.000013764913,0.000011596959,0.00043060136,0.000028179897,0.000008301515,0.00011851774,0.00012640763,0.0034210721,0.0003136563,0.9874672,0.008052043,0.000008480665],"about_ca_topic_score_codex":0.0019718346,"about_ca_topic_score_gemma":0.0023432772,"teacher_disagreement_score":0.014004101,"about_ca_system_score_codex":0.0020046942,"about_ca_system_score_gemma":0.00056069985,"threshold_uncertainty_score":0.046848416},"labels":[],"label_agreement":null},{"id":"W89916023","doi":"","title":"A Decomposition for Simple Polygons.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Simple (philosophy); Decomposition; Epistemology; Biology","score_opus":0.012916939508668727,"score_gpt":0.2740918101099415,"score_spread":0.26117487060127276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W89916023","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022517085,0.0010666554,0.89948654,0.00026814497,0.00042625278,0.00014454317,0.0009830388,0.0011928697,0.07391482],"genre_scores_gemma":[0.19424926,0.0017051673,0.73766905,0.0002810476,0.00020180145,0.00021466087,0.0038843388,0.0013382903,0.06045634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996915,0.000038589344,0.000029450099,0.000054040298,0.00014344916,0.000042981344],"domain_scores_gemma":[0.9996315,0.00007710421,0.000029596764,0.000120576944,0.00008639438,0.00005480088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002573961,0.000684981,0.00051407015,0.0016006351,0.00062726066,0.0018610583,0.0007001638,0.0004955388,0.014964725],"category_scores_gemma":[0.0011984445,0.00046121815,0.001028277,0.0011771276,0.00081076426,0.0018691169,0.0021139625,0.0016065119,0.0068840906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013973731,0.0000861437,0.0006269951,0.00038479196,0.00003246368,0.00031820586,0.00046424972,0.011162771,0.014049839,0.61422807,0.037073117,0.32143363],"study_design_scores_gemma":[0.00004860014,0.000068647074,0.00056624546,0.00015571232,0.00004982397,0.000960324,0.00034031138,0.065837085,0.0067256466,0.7454741,0.17974772,0.000025980977],"about_ca_topic_score_codex":0.00070425763,"about_ca_topic_score_gemma":0.0014671771,"teacher_disagreement_score":0.014964725,"about_ca_system_score_codex":0.0004150512,"about_ca_system_score_gemma":0.00036139396,"threshold_uncertainty_score":0.050062},"labels":[],"label_agreement":null},{"id":"W90251077","doi":"","title":"A Krasnoselskii Theorem for Permissible Paths Whose Edges Are Parallel to Three Given Vectors in the Plane.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Plane (geometry); Combinatorics; Geometry","score_opus":0.0259025502453598,"score_gpt":0.2625284734240885,"score_spread":0.23662592317872871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W90251077","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05610665,0.0015406338,0.59067726,0.0024272155,0.0007348349,0.00010264199,0.0013011025,0.0005848393,0.34652478],"genre_scores_gemma":[0.73835075,0.0026989398,0.1694553,0.0012058325,0.0006525495,0.00039272205,0.0019480229,0.0007067184,0.08458918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939287,0.000112006004,0.00004847481,0.0001570491,0.00020584228,0.00008365215],"domain_scores_gemma":[0.99898154,0.00050735846,0.0000955788,0.00016900848,0.00016527077,0.00008116744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086934713,0.00052748516,0.00048522867,0.0013576051,0.0021430524,0.002412213,0.0011871147,0.001239568,0.018621277],"category_scores_gemma":[0.0034823997,0.00057035213,0.0010552941,0.001067169,0.0023451475,0.005902095,0.0021537184,0.0032898462,0.0045684725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016287293,0.000012873132,0.00009187444,0.00003524647,0.0000053177387,0.000039285424,0.000076979064,0.00091492385,0.0004198285,0.9873418,0.0027340685,0.008311586],"study_design_scores_gemma":[0.000008535272,0.000007687963,0.000091885246,0.000017480637,0.000005861895,0.00010283184,0.000031321768,0.0024245565,0.00036040889,0.9896527,0.007288998,0.0000076991155],"about_ca_topic_score_codex":0.0008826244,"about_ca_topic_score_gemma":0.0010571036,"teacher_disagreement_score":0.018621277,"about_ca_system_score_codex":0.0009703472,"about_ca_system_score_gemma":0.00085740787,"threshold_uncertainty_score":0.062294364},"labels":[],"label_agreement":null},{"id":"W91360576","doi":"","title":"Redundance of Trees.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.010498553171263064,"score_gpt":0.23781660960231296,"score_spread":0.2273180564310499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W91360576","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20035318,0.017293977,0.48935404,0.007264229,0.0011832273,0.00013795382,0.004859361,0.0025329369,0.27702108],"genre_scores_gemma":[0.86312824,0.00322053,0.07830131,0.0012606359,0.0012617473,0.000113523354,0.004429528,0.00047932475,0.047805063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978683,0.00042824514,0.00019196917,0.00047316623,0.00076923706,0.00026898077],"domain_scores_gemma":[0.9944729,0.0025511023,0.0005289935,0.0013229499,0.00078103447,0.0003429853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014596629,0.00051768654,0.0010971841,0.0044110348,0.0018906478,0.0029327634,0.0012865412,0.0009299531,0.0132189905],"category_scores_gemma":[0.009140352,0.00062288414,0.001117898,0.0035120572,0.0019894294,0.0066086715,0.0027075345,0.0022723295,0.0029786895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007955713,0.000030098669,0.001123901,0.00020286217,0.00003620945,0.00026710064,0.00042564597,0.0010591847,0.001102761,0.9400371,0.010755551,0.044879973],"study_design_scores_gemma":[0.000011794245,0.000022512491,0.0007633468,0.000047181074,0.000037053833,0.00073032005,0.00010937065,0.004775791,0.0009682535,0.9668032,0.025716722,0.000014531],"about_ca_topic_score_codex":0.0010130714,"about_ca_topic_score_gemma":0.0015763051,"teacher_disagreement_score":0.0132189905,"about_ca_system_score_codex":0.0014733158,"about_ca_system_score_gemma":0.00065773644,"threshold_uncertainty_score":0.044221938},"labels":[],"label_agreement":null},{"id":"W9137767","doi":"10.1002/(sici)1099-0801(199703)11:2<89::aid-bmc654>3.0.co;2-8","title":"Problems on Hall t-chromaticity.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chromaticity; Mathematics; Computer vision; Computer science","score_opus":0.014002170188243505,"score_gpt":0.23435728609779732,"score_spread":0.2203551159095538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W9137767","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18405086,0.0055670887,0.18856436,0.033201728,0.0031250878,0.00019667445,0.003521758,0.0011323631,0.5806401],"genre_scores_gemma":[0.8421106,0.0034525949,0.03211547,0.0031209209,0.0021939562,0.00016872729,0.002219568,0.00040891356,0.114209205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891317,0.00025057505,0.00005261974,0.0002985131,0.00018174209,0.00030341273],"domain_scores_gemma":[0.9955635,0.0027077217,0.00025231013,0.0006333045,0.00036361624,0.00047957787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014936129,0.0006563794,0.0007930483,0.0017222565,0.0038866135,0.0043372656,0.0017567505,0.0021512348,0.044953544],"category_scores_gemma":[0.0064157713,0.00056704483,0.001052139,0.0027495788,0.005312031,0.013758915,0.003667639,0.0056747408,0.004511088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005981547,0.00002241626,0.000274464,0.00007424658,0.000009129119,0.000048693764,0.00016211577,0.0006200509,0.00027432217,0.9808218,0.011572553,0.0060603614],"study_design_scores_gemma":[0.000017937798,0.0000116713145,0.00019569097,0.000018324521,0.000007828706,0.00007792323,0.00019740003,0.0011709041,0.00023583416,0.9901337,0.007922178,0.000010544756],"about_ca_topic_score_codex":0.0030302885,"about_ca_topic_score_gemma":0.0037415384,"teacher_disagreement_score":0.044953544,"about_ca_system_score_codex":0.0027822237,"about_ca_system_score_gemma":0.0013632028,"threshold_uncertainty_score":0.1503846},"labels":[],"label_agreement":null},{"id":"W91420253","doi":"","title":"Super-Arc-Connected and Super-Connected Total Digraphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arc (geometry); Combinatorics; Strongly connected component; Geometry","score_opus":0.015779937784937303,"score_gpt":0.2454578139895045,"score_spread":0.2296778762045672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W91420253","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34936708,0.0021302607,0.2964883,0.001985374,0.0003106705,0.00017853752,0.0047378396,0.0007833417,0.34401855],"genre_scores_gemma":[0.8667007,0.0018152986,0.066051446,0.0007828393,0.00015996542,0.0001471105,0.0033015045,0.0001725872,0.060868576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999589,0.00008394246,0.000028391507,0.000119257376,0.000109218294,0.000070203074],"domain_scores_gemma":[0.9982603,0.0006683387,0.00018850423,0.0002552791,0.0003092429,0.0003183417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040177084,0.00041672325,0.00037160466,0.0020713767,0.0011338174,0.0015886531,0.0009966808,0.00065398664,0.016985359],"category_scores_gemma":[0.0019326922,0.00043993874,0.00059186376,0.002300906,0.0009222311,0.0036599229,0.0014838539,0.001149191,0.001389024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057082463,0.000030400459,0.00074770936,0.00017997519,0.00003283705,0.00029853644,0.00027742155,0.0023432083,0.0015996948,0.9686868,0.005868746,0.01987762],"study_design_scores_gemma":[0.00001827862,0.00001985761,0.0009628938,0.000046580666,0.000055779274,0.00058353716,0.00022008887,0.009920827,0.001018101,0.96437997,0.02275988,0.000014102321],"about_ca_topic_score_codex":0.0013499974,"about_ca_topic_score_gemma":0.0033969416,"teacher_disagreement_score":0.016985359,"about_ca_system_score_codex":0.00086817617,"about_ca_system_score_gemma":0.00050091324,"threshold_uncertainty_score":0.056821704},"labels":[],"label_agreement":null},{"id":"W91855218","doi":"","title":"On Ramsey Numbers of Short Paths versus Large Wheels.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.031069213511176873,"score_gpt":0.2870773960984097,"score_spread":0.25600818258723285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W91855218","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3502273,0.017360859,0.19632295,0.011481714,0.001358717,0.00009730943,0.00095070305,0.00050341134,0.42169705],"genre_scores_gemma":[0.9490226,0.004173937,0.018088298,0.0010331239,0.0007795483,0.00014824064,0.00025913288,0.00016321485,0.02633185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897003,0.00035676107,0.00005261832,0.00017454156,0.0002463831,0.00019959924],"domain_scores_gemma":[0.9910746,0.0063835043,0.00064818317,0.0004999982,0.00055331044,0.00084046804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002048158,0.00055952504,0.0008786513,0.0029015958,0.0022683882,0.003259421,0.0014631143,0.0014505528,0.012078061],"category_scores_gemma":[0.013203207,0.00054282695,0.0005103192,0.0019729421,0.0043050074,0.015011786,0.0034208943,0.0030165683,0.001357104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025545109,0.00001239302,0.00017839986,0.00004081338,0.0000036293643,0.000023743947,0.00013015915,0.00066539017,0.00014457916,0.99272245,0.002333009,0.0037198127],"study_design_scores_gemma":[0.000005168797,0.0000064393803,0.00014451465,0.000025948526,0.0000049970963,0.00005858699,0.000096808304,0.0022477997,0.00009312423,0.9945543,0.0027550585,0.000007386977],"about_ca_topic_score_codex":0.0015685398,"about_ca_topic_score_gemma":0.0018320063,"teacher_disagreement_score":0.012078061,"about_ca_system_score_codex":0.0015938597,"about_ca_system_score_gemma":0.00066723017,"threshold_uncertainty_score":0.040405095},"labels":[],"label_agreement":null},{"id":"W9227663","doi":"10.1080/21548331.1997.11443530","title":"Trees With Path-Stable Center.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Center (category theory); Path (computing); Computer science; Crystallography; Computer network; Chemistry","score_opus":0.009179629047181998,"score_gpt":0.2414310311169721,"score_spread":0.23225140206979009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W9227663","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6793977,0.0013225059,0.25285736,0.0010280834,0.00023615909,0.0001493705,0.00069641,0.0006616696,0.06365071],"genre_scores_gemma":[0.9639963,0.00029367532,0.02938687,0.000105716455,0.00012715602,0.00005620168,0.00038518972,0.00008789321,0.0055609667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931264,0.00009798092,0.0000344269,0.00019078916,0.0001685408,0.00019562377],"domain_scores_gemma":[0.99704224,0.0012120216,0.0005109441,0.00022486008,0.0004845583,0.0005253429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006916358,0.00031967592,0.000553854,0.0007135209,0.0018039271,0.0023149918,0.0005920392,0.0007850406,0.0044566207],"category_scores_gemma":[0.0034238638,0.00030747446,0.00051619404,0.00084670004,0.001630756,0.0034148344,0.0018504409,0.0012709856,0.00083319575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024117353,0.000072227966,0.002509114,0.00013797791,0.000020852243,0.00079613196,0.001056644,0.00345137,0.019525357,0.9558037,0.002511367,0.013874153],"study_design_scores_gemma":[0.0001592162,0.00026292753,0.004394673,0.00007739933,0.00009410676,0.0021354535,0.0014456245,0.04502727,0.025328813,0.8864507,0.034564935,0.000058834594],"about_ca_topic_score_codex":0.0011349347,"about_ca_topic_score_gemma":0.0013091934,"teacher_disagreement_score":0.0044566207,"about_ca_system_score_codex":0.0010285955,"about_ca_system_score_gemma":0.00063521304,"threshold_uncertainty_score":0.01490885},"labels":[],"label_agreement":null},{"id":"W92339428","doi":"","title":"PI and Szeged Indices of some Benzenoid Graphs Related to Nanostructures.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Statistics","score_opus":0.011424523319233175,"score_gpt":0.27565088236143764,"score_spread":0.2642263590422045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W92339428","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7393948,0.0010769662,0.03959313,0.0014664629,0.00056795496,0.000102535705,0.00090740336,0.0003896975,0.2165011],"genre_scores_gemma":[0.96375936,0.0005653485,0.012152754,0.00035900832,0.00019852546,0.0001454646,0.00047443362,0.000114432536,0.022230601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997694,0.00004153778,0.00001173208,0.000044128188,0.00007763536,0.00005564373],"domain_scores_gemma":[0.9995598,0.000100539524,0.00011576576,0.000052661184,0.000076849385,0.00009422853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025260402,0.00046539266,0.00044956285,0.0029269697,0.001675916,0.0018423139,0.0006756062,0.0010493491,0.010317075],"category_scores_gemma":[0.00094991416,0.00027844904,0.0003670284,0.0010201383,0.0013089217,0.0020598157,0.00091417594,0.0012193327,0.0013235069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004038684,0.000019781655,0.00029034933,0.000035142544,0.000005961401,0.00010365637,0.00012221093,0.0006852699,0.002297306,0.9900456,0.0018053346,0.004548889],"study_design_scores_gemma":[0.00002061748,0.000024360375,0.0010305276,0.000018898221,0.000009809281,0.00026353754,0.00015597697,0.007262567,0.0016343931,0.9838397,0.005719486,0.00002006285],"about_ca_topic_score_codex":0.00060891366,"about_ca_topic_score_gemma":0.000778403,"teacher_disagreement_score":0.010317075,"about_ca_system_score_codex":0.0009225084,"about_ca_system_score_gemma":0.00046540287,"threshold_uncertainty_score":0.03451407},"labels":[],"label_agreement":null},{"id":"W92692331","doi":"","title":"On the number of elements dominated by a subgroup.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.028621066100668977,"score_gpt":0.3252978459969401,"score_spread":0.2966767798962711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W92692331","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61957675,0.0059281974,0.13616668,0.008629956,0.0009681176,0.00010478759,0.0022304961,0.00041858992,0.22597636],"genre_scores_gemma":[0.96217716,0.0015967527,0.017709883,0.00041848744,0.0007178568,0.00012271998,0.0005759633,0.000121722005,0.0165593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99619967,0.0011347822,0.00031086273,0.00091579277,0.00083865324,0.00060023024],"domain_scores_gemma":[0.96891505,0.021846315,0.0028740405,0.0023666627,0.0016233057,0.002374589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043036747,0.000688676,0.0014322536,0.005297908,0.0028404358,0.0055435807,0.0021250744,0.0021708752,0.011937374],"category_scores_gemma":[0.029970406,0.00054208416,0.0005939705,0.0026989756,0.0077069905,0.0138004385,0.0033835822,0.0029484062,0.0015144193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003388495,0.000029862536,0.0039277137,0.00014083863,0.00004002067,0.00011220543,0.00044725166,0.0013654891,0.0016045984,0.9733622,0.0028679837,0.015763007],"study_design_scores_gemma":[0.00003679062,0.00004989458,0.002016134,0.00008775348,0.00005507868,0.000648335,0.0003913437,0.0055798157,0.0019830537,0.980656,0.008465251,0.000030498899],"about_ca_topic_score_codex":0.00063859863,"about_ca_topic_score_gemma":0.0006046411,"teacher_disagreement_score":0.011937374,"about_ca_system_score_codex":0.0021553102,"about_ca_system_score_gemma":0.00071158184,"threshold_uncertainty_score":0.039934516},"labels":[],"label_agreement":null},{"id":"W92926827","doi":"","title":"A note on graphs with largest total k-domination number.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Domination analysis; Graph; Vertex (graph theory)","score_opus":0.009164763541006529,"score_gpt":0.27539502022611634,"score_spread":0.2662302566851098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W92926827","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08636216,0.058628436,0.21583317,0.07048465,0.029618362,0.0002582712,0.0045447606,0.0031168105,0.53115326],"genre_scores_gemma":[0.6861829,0.041309685,0.14629792,0.012312492,0.029375473,0.00029181727,0.0024096093,0.0014371593,0.08038298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999203,0.00017384427,0.000054301992,0.0002484447,0.00021605454,0.000104311985],"domain_scores_gemma":[0.992525,0.0051000984,0.00029058332,0.00084392936,0.00073905697,0.0005014114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013889134,0.0010814535,0.0011412787,0.0024075143,0.0020618897,0.0022943476,0.0020513134,0.0011927191,0.011396427],"category_scores_gemma":[0.008401513,0.00044939274,0.0008715355,0.0034082753,0.002282526,0.0067529045,0.0024652162,0.003734233,0.0028438182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054741086,0.00016374058,0.0039424715,0.0018880615,0.00016253887,0.0023140826,0.0004906349,0.008277507,0.011875412,0.504905,0.28432727,0.18110582],"study_design_scores_gemma":[0.000042837197,0.00009739288,0.004202278,0.0001965918,0.00013239558,0.0026720795,0.0003506261,0.005935486,0.0039384374,0.84204584,0.14028913,0.0000968976],"about_ca_topic_score_codex":0.0017238847,"about_ca_topic_score_gemma":0.0041298694,"teacher_disagreement_score":0.011396427,"about_ca_system_score_codex":0.0013695016,"about_ca_system_score_gemma":0.00076214207,"threshold_uncertainty_score":0.03812486},"labels":[],"label_agreement":null},{"id":"W932773","doi":"10.1016/0022-510x(76)90047-2","title":"Enumeration of the bases of the bicircular matroid on a complete bipartite graph.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Enumeration; Bipartite graph; Mathematics; Combinatorics; Matroid; Complete bipartite graph; Matroid partitioning; Graph; Oriented matroid; Graphic matroid","score_opus":0.035770730408861355,"score_gpt":0.2743205586529372,"score_spread":0.23854982824407583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W932773","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7063641,0.00069888425,0.24075368,0.0010165973,0.00007132251,0.0001918727,0.004628253,0.00037556642,0.04589982],"genre_scores_gemma":[0.89533454,0.00052081916,0.08121907,0.00022164009,0.00007343575,0.00030373034,0.0069339224,0.00012360893,0.015269228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943703,0.00019694789,0.00003227962,0.00009988651,0.000121384226,0.00011241923],"domain_scores_gemma":[0.9978751,0.0010963484,0.00032504153,0.00017475843,0.0002511094,0.00027767324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038566175,0.00048959407,0.00045765,0.0014873474,0.0007452161,0.0011811036,0.00080416637,0.0007003159,0.008313789],"category_scores_gemma":[0.0027717473,0.0003493162,0.00046729442,0.0012425435,0.000647981,0.0011439589,0.001024646,0.00062081654,0.0013267803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00092534244,0.00017918627,0.005461812,0.0008719447,0.00017615691,0.0007779175,0.0008158898,0.08143769,0.031262223,0.77005583,0.019780679,0.088255316],"study_design_scores_gemma":[0.00011366244,0.00017905091,0.0055164876,0.00010062254,0.000057332283,0.00088965514,0.00034691577,0.23608908,0.0054826667,0.73369765,0.017479088,0.00004775303],"about_ca_topic_score_codex":0.0022542311,"about_ca_topic_score_gemma":0.002839616,"teacher_disagreement_score":0.008313789,"about_ca_system_score_codex":0.00072523684,"about_ca_system_score_gemma":0.0004492546,"threshold_uncertainty_score":0.027812362},"labels":[],"label_agreement":null},{"id":"W93304162","doi":"","title":"On the Cordiality of the t-uniform Homeomorphs - I.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Mathematical economics; Combinatorics","score_opus":0.02966544548858906,"score_gpt":0.2564402947898972,"score_spread":0.22677484930130815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W93304162","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31786487,0.00680665,0.12667309,0.007706798,0.0015629368,0.00009482868,0.0005350547,0.0005046143,0.5382512],"genre_scores_gemma":[0.9364971,0.0019221177,0.016981818,0.001011409,0.00077704724,0.00006615593,0.00024636585,0.00015556099,0.042342473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930656,0.00019725128,0.000051618466,0.00018745824,0.000114319024,0.00014283898],"domain_scores_gemma":[0.99803275,0.0007572416,0.00023436807,0.0003546136,0.000274373,0.0003466016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014854847,0.00047025364,0.0006215865,0.0015165999,0.0024285885,0.0036107085,0.0007652945,0.0009972241,0.0112321945],"category_scores_gemma":[0.0048508067,0.0004224908,0.0006205406,0.0010023935,0.006642198,0.008701302,0.0038115906,0.002876731,0.0015890116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019835219,0.0000066004654,0.0001577641,0.000019119347,0.0000023497184,0.000034745757,0.0001324973,0.000089633526,0.00014556409,0.99554694,0.0011203641,0.0027244575],"study_design_scores_gemma":[0.000009370171,0.000015238284,0.00029085408,0.000016891467,0.0000062064014,0.00013942162,0.00012187122,0.0006218595,0.00025075773,0.99365824,0.004862088,0.0000071683176],"about_ca_topic_score_codex":0.00095926056,"about_ca_topic_score_gemma":0.0009537371,"teacher_disagreement_score":0.0112321945,"about_ca_system_score_codex":0.0011344992,"about_ca_system_score_gemma":0.0005229351,"threshold_uncertainty_score":0.037575424},"labels":[],"label_agreement":null},{"id":"W93307239","doi":"","title":"Induced Graph Theorem on Magic Valuations.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; MAGIC (telescope); Graph; Combinatorics; Discrete mathematics; Astronomy; Physics","score_opus":0.018995170942781896,"score_gpt":0.2438095929287078,"score_spread":0.2248144219859259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W93307239","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12778166,0.002849733,0.41448745,0.0073402524,0.0009792451,0.0001577491,0.003464259,0.0013700625,0.44156966],"genre_scores_gemma":[0.8316587,0.0023199976,0.096941054,0.0023035486,0.0007823189,0.000289296,0.003372359,0.0004562438,0.06187644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999041,0.0002247396,0.000053891126,0.00024823702,0.000263286,0.000168705],"domain_scores_gemma":[0.9971654,0.0016341823,0.00020378614,0.0004534318,0.0002622439,0.00028107045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000849312,0.0005844298,0.0006794785,0.0018007613,0.001575029,0.0034918482,0.0016403235,0.0009692065,0.017961591],"category_scores_gemma":[0.0036948868,0.0005488892,0.00086192094,0.0021500324,0.0023870831,0.008632908,0.0031202694,0.0032943964,0.0021835982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022903843,0.000021774862,0.00016845312,0.000057935096,0.000007812613,0.000031016454,0.00006590161,0.000434821,0.0003777342,0.98379654,0.0062829265,0.008732193],"study_design_scores_gemma":[0.000015520645,0.000009536328,0.00020168886,0.000021370439,0.0000114919885,0.00011359062,0.000055473483,0.0021683534,0.0005421382,0.98606,0.010792673,0.000008121343],"about_ca_topic_score_codex":0.0010189576,"about_ca_topic_score_gemma":0.0014988662,"teacher_disagreement_score":0.017961591,"about_ca_system_score_codex":0.0015715716,"about_ca_system_score_gemma":0.00074807217,"threshold_uncertainty_score":0.060087502},"labels":[],"label_agreement":null},{"id":"W93493993","doi":"","title":"Properties of closed meanders.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Soil erosion and sediment transport","field":"Agricultural and Biological Sciences","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.029062790988388713,"score_gpt":0.1976874680320829,"score_spread":0.1686246770436942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W93493993","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82447845,0.0010850433,0.12549908,0.00038189336,0.00014125615,0.00004510768,0.0014972604,0.00033436352,0.04653755],"genre_scores_gemma":[0.9824849,0.0004924324,0.0059929783,0.000045796307,0.00009298821,0.00004664686,0.00071005226,0.00008216235,0.010052055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971396,0.000044516633,0.000027894988,0.0000686251,0.00007942263,0.000065593165],"domain_scores_gemma":[0.9971933,0.0011133605,0.00078909856,0.00021123789,0.00032690278,0.0003661342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037806982,0.00035660618,0.0005675296,0.0015276661,0.000632111,0.0018679749,0.0006946255,0.0003681012,0.0084163835],"category_scores_gemma":[0.0036201647,0.00023754014,0.00044173712,0.00079888443,0.0008751441,0.0017463556,0.00091591565,0.00046734538,0.0014325135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002441718,0.00014498687,0.032563876,0.00035050855,0.00012401953,0.0006583729,0.0006549174,0.03663872,0.012244141,0.85422844,0.008800569,0.053347267],"study_design_scores_gemma":[0.00008569265,0.00021851981,0.025946293,0.00007931142,0.000092342074,0.0032819323,0.0006159803,0.1473875,0.002921509,0.7998717,0.019433456,0.000065678774],"about_ca_topic_score_codex":0.0009846513,"about_ca_topic_score_gemma":0.001125831,"teacher_disagreement_score":0.0084163835,"about_ca_system_score_codex":0.0004383186,"about_ca_system_score_gemma":0.00030883672,"threshold_uncertainty_score":0.028155625},"labels":[],"label_agreement":null},{"id":"W93756305","doi":"","title":"Extensions of Bondys Theorem on Cycles in 2-Connected Graphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.017264078822137433,"score_gpt":0.2915152480615969,"score_spread":0.27425116923945947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W93756305","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21589428,0.005400375,0.36259463,0.00476628,0.0018141586,0.00026204291,0.0017349382,0.0009110652,0.40662214],"genre_scores_gemma":[0.8530004,0.0050195563,0.062028408,0.0021137795,0.0018050586,0.00042749132,0.0016977653,0.00054847484,0.07335916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994711,0.00011378081,0.000029302844,0.00013826769,0.0001756803,0.000071915216],"domain_scores_gemma":[0.998485,0.0006737591,0.00016840105,0.00019549718,0.0002530578,0.00022421754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068325264,0.00068815966,0.0007476464,0.0024296737,0.0014718889,0.0018940793,0.0012432531,0.0011067331,0.017169287],"category_scores_gemma":[0.0036694955,0.0004205704,0.0010553906,0.0017935443,0.0016338737,0.005760809,0.0028727655,0.0024712158,0.002133915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027933664,0.00002089718,0.0002559076,0.00007053787,0.000009875657,0.0000983855,0.0001631982,0.0006294245,0.0004900155,0.98648304,0.004348225,0.007402475],"study_design_scores_gemma":[0.000013040677,0.000015783102,0.0003248187,0.000022040684,0.000012050503,0.00015368992,0.00008009635,0.0034269695,0.00029704202,0.98634166,0.009302561,0.000010267175],"about_ca_topic_score_codex":0.0016469291,"about_ca_topic_score_gemma":0.0015761018,"teacher_disagreement_score":0.017169287,"about_ca_system_score_codex":0.0009843394,"about_ca_system_score_gemma":0.0005405521,"threshold_uncertainty_score":0.057437003},"labels":[],"label_agreement":null},{"id":"W938917713","doi":"","title":"Super Spanning Connectivity of Augmented Cubes","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spanning tree; Combinatorics","score_opus":0.016216095517835625,"score_gpt":0.23160653681527307,"score_spread":0.21539044129743745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W938917713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28701988,0.0006483227,0.6735851,0.00052646146,0.00008454749,0.00006999008,0.0003859458,0.00030649692,0.037373316],"genre_scores_gemma":[0.87274486,0.00070162024,0.113928296,0.00015985334,0.00007618954,0.00013963708,0.00061653473,0.00009201394,0.011540959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996766,0.00011017308,0.000020549021,0.00006208251,0.000090575195,0.00004015951],"domain_scores_gemma":[0.9987552,0.0006133717,0.00019115247,0.00017884087,0.00013296385,0.00012838119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038163192,0.00040636887,0.00062105653,0.0009849581,0.0006324551,0.0011176288,0.0008700129,0.00055326836,0.004533622],"category_scores_gemma":[0.0024203206,0.00034788696,0.00043318383,0.001074537,0.0008773805,0.002031193,0.0019808742,0.00085932796,0.00037098044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013450092,0.000036380123,0.00072604563,0.00014943999,0.000035898993,0.00025342047,0.0002641076,0.14320089,0.004653,0.7999588,0.0032649164,0.04732264],"study_design_scores_gemma":[0.000023745783,0.00005538378,0.0005004923,0.000027653874,0.000017477229,0.0001682954,0.00010281532,0.41731128,0.0012058626,0.57452124,0.006053209,0.00001259086],"about_ca_topic_score_codex":0.0010577106,"about_ca_topic_score_gemma":0.001417888,"teacher_disagreement_score":0.004533622,"about_ca_system_score_codex":0.0004370081,"about_ca_system_score_gemma":0.00031583954,"threshold_uncertainty_score":0.0151664615},"labels":[],"label_agreement":null},{"id":"W9394027","doi":"","title":"Upper bounds on signed 2-independence number of graphs.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Independence number; Independence (probability theory); Combinatorics; Upper and lower bounds; Discrete mathematics; Graph; Statistics; Mathematical analysis","score_opus":0.01029402088109238,"score_gpt":0.240046454650999,"score_spread":0.22975243376990662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W9394027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20747058,0.0048325253,0.68058026,0.008743081,0.00097201974,0.00039995526,0.007586891,0.0017351574,0.08767957],"genre_scores_gemma":[0.84193057,0.0036076994,0.12867376,0.001495486,0.0011522074,0.0010723807,0.004673443,0.0005141832,0.016880231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99507034,0.0015119757,0.00025765938,0.0009756484,0.0014018433,0.000782593],"domain_scores_gemma":[0.939469,0.044393633,0.0050028698,0.0040654237,0.0036137702,0.0034553218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004150376,0.0017480662,0.0016279947,0.0045733997,0.0022802437,0.0043030577,0.002750077,0.0021016393,0.017801879],"category_scores_gemma":[0.03770152,0.0008702526,0.0016202503,0.0037564968,0.003700102,0.008593144,0.0033601823,0.0039898613,0.0024786182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009792055,0.00024143903,0.007274523,0.0009697384,0.00020848347,0.0004425772,0.0005127155,0.08584204,0.0037974236,0.8011308,0.021995194,0.076606],"study_design_scores_gemma":[0.000074354655,0.00015296125,0.002220539,0.00012942057,0.00006481692,0.00042900693,0.00010987218,0.1460076,0.0017578274,0.838173,0.010819447,0.00006112742],"about_ca_topic_score_codex":0.0012148735,"about_ca_topic_score_gemma":0.001794646,"teacher_disagreement_score":0.017801879,"about_ca_system_score_codex":0.0031062532,"about_ca_system_score_gemma":0.0013480341,"threshold_uncertainty_score":0.059553206},"labels":[],"label_agreement":null},{"id":"W94203535","doi":"","title":"The kth Lower Multiexponent of Tournament Matrices.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tournament; Mathematics; Combinatorics","score_opus":0.006452618473527845,"score_gpt":0.2196477663908502,"score_spread":0.21319514791732236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W94203535","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58189744,0.0023876976,0.2118587,0.0036304493,0.0013239881,0.00008547816,0.0011284564,0.00097460666,0.1967131],"genre_scores_gemma":[0.9531153,0.00063983846,0.013661777,0.0004177034,0.0005714248,0.000055053282,0.0003048328,0.00015608137,0.031077946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991829,0.00014885706,0.000041670566,0.00015957943,0.00022913786,0.00023785952],"domain_scores_gemma":[0.99753904,0.0010094063,0.00033837405,0.00035313854,0.00031506683,0.0004450975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007424258,0.0005631582,0.00050111697,0.0022144301,0.0017512401,0.003627277,0.0010314927,0.0010683286,0.015907945],"category_scores_gemma":[0.00695929,0.00031211253,0.00046467368,0.0010897882,0.00188439,0.0030147156,0.0015943409,0.0021551608,0.0037522162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026083252,0.000070038215,0.0013295166,0.00010794234,0.000023595792,0.00026721845,0.00035575413,0.004371376,0.005161584,0.9477112,0.008834822,0.031506184],"study_design_scores_gemma":[0.00003435669,0.00010511874,0.0018110301,0.00008538908,0.000025027774,0.0007535746,0.00015262165,0.031171583,0.0050952034,0.94863516,0.012083112,0.000047737405],"about_ca_topic_score_codex":0.00070101337,"about_ca_topic_score_gemma":0.00094322144,"teacher_disagreement_score":0.015907945,"about_ca_system_score_codex":0.0011347871,"about_ca_system_score_gemma":0.00053170475,"threshold_uncertainty_score":0.05321735},"labels":[],"label_agreement":null},{"id":"W94221996","doi":"","title":"Nilpotent-SQS-Skeins with Nilpotent Derived Sloops.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Nilpotent; Pure mathematics; Nilpotent group","score_opus":0.004353581427768965,"score_gpt":0.16702429106666974,"score_spread":0.1626707096389008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W94221996","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30261508,0.000650386,0.14662376,0.0011528186,0.0007827194,0.00015511113,0.00079973513,0.0009397274,0.5462807],"genre_scores_gemma":[0.909653,0.000254327,0.017875941,0.00044612287,0.0002539746,0.00006239385,0.000572903,0.00021344566,0.070667915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994429,0.00013582455,0.000033312546,0.00009953165,0.000161842,0.00012654711],"domain_scores_gemma":[0.9990606,0.0002428811,0.00013955976,0.0001383276,0.00024585825,0.00017278784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004401244,0.00042480888,0.00043868326,0.0016618083,0.0019453289,0.002375252,0.00056663476,0.0006495534,0.019191284],"category_scores_gemma":[0.0014986328,0.0003010038,0.00057796005,0.0008033407,0.0021945043,0.0027213139,0.0029174543,0.0015817296,0.0055229203],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006893117,0.000024721068,0.00035167873,0.000045424364,0.0000122245665,0.00031893977,0.00024257365,0.00040320263,0.0021455253,0.9866585,0.0026042429,0.0071239946],"study_design_scores_gemma":[0.000025187466,0.000034697994,0.0004071915,0.00002188133,0.000012491266,0.00046700006,0.00028042874,0.0018682193,0.0030244163,0.9747977,0.019042857,0.000017876673],"about_ca_topic_score_codex":0.00042532105,"about_ca_topic_score_gemma":0.00089062087,"teacher_disagreement_score":0.019191284,"about_ca_system_score_codex":0.0006237803,"about_ca_system_score_gemma":0.00052151247,"threshold_uncertainty_score":0.064201295},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Matching (statistics); Combinatorics; 3-dimensional matching; Graph; Statistics","score_opus":0.017702087213756906,"score_gpt":0.29802106200989636,"score_spread":0.28031897479613943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W94353364","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49823493,0.0025971134,0.42218184,0.0034554962,0.000559016,0.00027118297,0.0033958785,0.003722007,0.06558254],"genre_scores_gemma":[0.7958079,0.0008943502,0.18358406,0.0005127357,0.00039418731,0.00028524638,0.004880321,0.00067707617,0.012964143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998251,0.00051980506,0.00009181087,0.00043757932,0.0003740368,0.00032572728],"domain_scores_gemma":[0.9888877,0.0072477357,0.0009886216,0.0016672398,0.0004478098,0.00076086004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019966397,0.001289157,0.0016587322,0.0031149476,0.00167908,0.0028924332,0.003776922,0.0018078388,0.0128352465],"category_scores_gemma":[0.020687494,0.00069274666,0.0009159585,0.0033195743,0.0028794978,0.010272795,0.0031867612,0.002684803,0.003064831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026000172,0.0009467722,0.018395059,0.0008531244,0.00025070764,0.0003622459,0.0005443039,0.17410617,0.008549937,0.48770562,0.04471805,0.2609679],"study_design_scores_gemma":[0.00011229763,0.00009606021,0.0024960432,0.000048107468,0.000043808403,0.00022256318,0.00014660656,0.2512085,0.004062571,0.7366248,0.0048988913,0.00003972397],"about_ca_topic_score_codex":0.00159107,"about_ca_topic_score_gemma":0.0034173492,"teacher_disagreement_score":0.0128352465,"about_ca_system_score_codex":0.001975165,"about_ca_system_score_gemma":0.0013164913,"threshold_uncertainty_score":0.042938113},"labels":[],"label_agreement":null},{"id":"W94648563","doi":"","title":"Lower bounds on dominating functions in graphs.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dominating set; Combinatorics; Graph","score_opus":0.012760276739990906,"score_gpt":0.2704202048579882,"score_spread":0.25765992811799726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W94648563","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097727574,0.040586017,0.4939985,0.028722256,0.0034413252,0.00030651476,0.006362264,0.0026219974,0.3262336],"genre_scores_gemma":[0.71010226,0.03375318,0.1465204,0.006836812,0.006536978,0.0011757133,0.008478959,0.0028332118,0.083762415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951497,0.0011778901,0.00019317195,0.0007149016,0.001523039,0.0012414427],"domain_scores_gemma":[0.94736946,0.042848688,0.0012245573,0.0034130479,0.002724136,0.002420114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061136503,0.0040794066,0.002741037,0.008532866,0.0030552,0.008775048,0.005684667,0.0037158874,0.023188606],"category_scores_gemma":[0.042744156,0.001416071,0.0022437251,0.007979961,0.004099676,0.018376054,0.006492694,0.011372115,0.0067792158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070013956,0.0003205217,0.0026340017,0.0012535997,0.00017074833,0.00021148121,0.00072817615,0.022160629,0.0035260636,0.80302,0.06185235,0.10342237],"study_design_scores_gemma":[0.000058767568,0.000090805974,0.0012972322,0.00033734346,0.00015623645,0.00036899507,0.00019386671,0.037032362,0.002245113,0.93268067,0.025488416,0.00005014199],"about_ca_topic_score_codex":0.0019806563,"about_ca_topic_score_gemma":0.003546244,"teacher_disagreement_score":0.023188606,"about_ca_system_score_codex":0.0066724033,"about_ca_system_score_gemma":0.0018257049,"threshold_uncertainty_score":0.07757366},"labels":[],"label_agreement":null},{"id":"W94667062","doi":"","title":"(2 mod 4)-cycles.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mod; Mathematics; Combinatorics","score_opus":0.007451476060539044,"score_gpt":0.19618654542113895,"score_spread":0.18873506936059992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W94667062","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16568425,0.0018243322,0.09523487,0.002336505,0.0019759454,0.00036235378,0.0022967714,0.0011217209,0.7291633],"genre_scores_gemma":[0.61159766,0.0012566467,0.055784542,0.0017145416,0.00047559888,0.0003996935,0.0018564401,0.00037814587,0.32653677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934334,0.000117597425,0.00003397254,0.00015550123,0.0001179302,0.00023160447],"domain_scores_gemma":[0.99912363,0.0002161227,0.00014373717,0.00018376306,0.00019758906,0.00013513229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031350137,0.00069805107,0.00043809862,0.001997321,0.0019568764,0.0021851906,0.0009141045,0.0011246423,0.05233171],"category_scores_gemma":[0.0018148284,0.0003550011,0.00059204374,0.0012659084,0.0009811574,0.0021955674,0.0019568913,0.001264281,0.009831123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002217929,0.00010935978,0.0011940545,0.00021439108,0.00005024588,0.0007688935,0.0003340746,0.0014162218,0.007236925,0.886182,0.02793063,0.074341446],"study_design_scores_gemma":[0.000058285495,0.000078873585,0.0010465003,0.00012727408,0.00004542453,0.0012515137,0.0003702515,0.0036275396,0.0086506605,0.78639114,0.19830772,0.00004482627],"about_ca_topic_score_codex":0.0009849882,"about_ca_topic_score_gemma":0.0025558807,"teacher_disagreement_score":0.05233171,"about_ca_system_score_codex":0.0008666889,"about_ca_system_score_gemma":0.0007795908,"threshold_uncertainty_score":0.17506701},"labels":[],"label_agreement":null},{"id":"W94877583","doi":"","title":"On Connected Colourings of Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.013202555673874418,"score_gpt":0.21095254529869945,"score_spread":0.19774998962482504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W94877583","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26038855,0.010819174,0.43928203,0.012403738,0.0015165232,0.0002053737,0.0025500422,0.0010636587,0.27177098],"genre_scores_gemma":[0.81026524,0.0072364123,0.117252715,0.0024533533,0.0014828364,0.00033734832,0.0027600764,0.00060175156,0.057610206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825484,0.0006648843,0.00010433899,0.00036813135,0.00032343974,0.00028435266],"domain_scores_gemma":[0.99047756,0.006728922,0.0006527224,0.001104902,0.00041883852,0.0006170767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014403551,0.0008831057,0.0009902668,0.0027230782,0.0023299085,0.0040702904,0.0016219004,0.0021289517,0.012216795],"category_scores_gemma":[0.008720209,0.0008777999,0.0010206806,0.003752427,0.0041252747,0.010141703,0.0034777995,0.0037867092,0.0019468627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003766352,0.00002504227,0.00043688974,0.00010728685,0.0000138006035,0.000047419115,0.00021102604,0.0020908061,0.00049749785,0.97468793,0.0072668376,0.014577672],"study_design_scores_gemma":[0.000009053418,0.000006241621,0.0001830838,0.000030578813,0.000007581863,0.00006270883,0.00009621339,0.0030928927,0.00022996464,0.99055535,0.0057199015,0.000006447432],"about_ca_topic_score_codex":0.0017353261,"about_ca_topic_score_gemma":0.0026513366,"teacher_disagreement_score":0.012216795,"about_ca_system_score_codex":0.002362329,"about_ca_system_score_gemma":0.00067487644,"threshold_uncertainty_score":0.040869296},"labels":[],"label_agreement":null},{"id":"W95397107","doi":"","title":"On the smallest edge defining sets of graphs.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Discrete mathematics; Computer science; Telecommunications","score_opus":0.0224228657694322,"score_gpt":0.21605770964768156,"score_spread":0.19363484387824936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W95397107","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3925091,0.005229139,0.3705827,0.007955187,0.00068805314,0.000185914,0.0043644486,0.00088024186,0.2176052],"genre_scores_gemma":[0.82579106,0.0026657023,0.13754687,0.0013285661,0.0006903575,0.0003117712,0.0040418115,0.00048295484,0.027140837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981292,0.00065531605,0.00014307386,0.0004666344,0.00030435307,0.000301435],"domain_scores_gemma":[0.98943824,0.007632744,0.0006814318,0.0010801721,0.00045824423,0.00070914754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016779957,0.00076772174,0.0011349061,0.0024530804,0.003007857,0.0050096,0.0019374985,0.001718793,0.007993861],"category_scores_gemma":[0.008722888,0.00073282945,0.0010003018,0.0025468392,0.0036780457,0.011084938,0.0037477557,0.0036519438,0.0014736237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006114076,0.000040235063,0.0008282227,0.00011146156,0.00001151888,0.00003797518,0.00028478427,0.0013845322,0.000719723,0.9743878,0.0053000115,0.016832603],"study_design_scores_gemma":[0.00001328782,0.000011478975,0.0004766552,0.00004229902,0.000012887131,0.0001244134,0.00022641866,0.0031773834,0.00065957604,0.98711085,0.008133115,0.000011568729],"about_ca_topic_score_codex":0.0010682503,"about_ca_topic_score_gemma":0.0016844093,"teacher_disagreement_score":0.007993861,"about_ca_system_score_codex":0.0015290114,"about_ca_system_score_gemma":0.0007517848,"threshold_uncertainty_score":0.0267421},"labels":[],"label_agreement":null},{"id":"W95416672","doi":"","title":"Edge-Magic Labelings of Petersen Graphs P(n, 2).","year":2001,"lang":"es","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; MAGIC (telescope); Combinatorics; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Astrophysics; Telecommunications; Computer science; Physics","score_opus":0.013495628783331633,"score_gpt":0.237949691088514,"score_spread":0.22445406230518236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W95416672","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5944436,0.0011260709,0.16214323,0.0021352344,0.00030477115,0.00012428922,0.0026233795,0.00091845455,0.23618093],"genre_scores_gemma":[0.9076188,0.0005576292,0.06318225,0.00033416183,0.00010870234,0.00009165972,0.0017763567,0.0001817887,0.026148511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994962,0.00013019434,0.0000284717,0.00010977369,0.00011625868,0.00011900478],"domain_scores_gemma":[0.998326,0.000886428,0.00025248912,0.00024255767,0.000118801756,0.00017370195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042928153,0.0003691808,0.0003112315,0.0013252464,0.0016880931,0.0020620213,0.00069851853,0.00094173715,0.010598773],"category_scores_gemma":[0.0026590556,0.00048667646,0.00038408788,0.0013834555,0.0012149678,0.002917916,0.0014155639,0.0013740689,0.0010953952],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018019645,0.000058542915,0.00091929466,0.000099955934,0.000014247775,0.00014685819,0.00026359857,0.005237222,0.0025925646,0.9489261,0.011861218,0.029700175],"study_design_scores_gemma":[0.00002892684,0.000023964798,0.0009045122,0.000029631494,0.000013878004,0.00022161608,0.00020648833,0.012934238,0.0024672924,0.9686845,0.014467324,0.000017595283],"about_ca_topic_score_codex":0.0010627907,"about_ca_topic_score_gemma":0.00240812,"teacher_disagreement_score":0.010598773,"about_ca_system_score_codex":0.0008110633,"about_ca_system_score_gemma":0.000491133,"threshold_uncertainty_score":0.03545642},"labels":[],"label_agreement":null},{"id":"W96058812","doi":"","title":"A Partial Kite System Of Oder n Can Be Embedded In A Kite System Of Order 8n+9.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Kite; Mathematics; Order (exchange); Geometry; Business","score_opus":0.018528918992092372,"score_gpt":0.2794291616634854,"score_spread":0.26090024267139306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W96058812","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63475585,0.00039223186,0.08366997,0.00056818716,0.00055533834,0.00007025811,0.0004381803,0.00052767654,0.2790224],"genre_scores_gemma":[0.92976844,0.00016123125,0.019611208,0.00013924396,0.000061218954,0.000055646113,0.0002828299,0.00012013429,0.049800027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994723,0.00007939707,0.000029360866,0.00011609758,0.0001234288,0.0001794312],"domain_scores_gemma":[0.9996768,0.00006429093,0.00006133906,0.00007545616,0.00005603433,0.00006605519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027456906,0.0005241867,0.00038611458,0.0007178573,0.0015929298,0.0015508677,0.00047498083,0.00072448567,0.016770922],"category_scores_gemma":[0.0007584098,0.00044805155,0.0005370063,0.00048100145,0.0023067128,0.0020888466,0.0029658193,0.0009951252,0.0031422894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012523346,0.000027229991,0.0008714781,0.00008802901,0.000025278066,0.0004165402,0.0004777438,0.0013927735,0.009726711,0.9724282,0.0019613802,0.012459495],"study_design_scores_gemma":[0.00003357054,0.0001512076,0.0026212097,0.000054123633,0.00003543724,0.00073539274,0.00054030394,0.005185372,0.009831515,0.9309984,0.049737267,0.0000763278],"about_ca_topic_score_codex":0.00061877025,"about_ca_topic_score_gemma":0.0014595927,"teacher_disagreement_score":0.016770922,"about_ca_system_score_codex":0.0005330492,"about_ca_system_score_gemma":0.00042413716,"threshold_uncertainty_score":0.056104362},"labels":[],"label_agreement":null},{"id":"W96478607","doi":"","title":"On some characterization of strongly regular graphs","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Characterization (materials science); Combinatorics; Nanotechnology; Materials science","score_opus":0.03273799276744753,"score_gpt":0.2935556948133577,"score_spread":0.26081770204591015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W96478607","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5866371,0.0017202529,0.22358489,0.0069725183,0.00028369858,0.00017252089,0.0009476273,0.00058824144,0.17909311],"genre_scores_gemma":[0.9512625,0.0011399487,0.023661472,0.0007952108,0.0005891622,0.00012720679,0.00086639647,0.00018855483,0.021369591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876946,0.00035204558,0.00007851895,0.00036446739,0.00022670235,0.0002088454],"domain_scores_gemma":[0.99432474,0.0036034002,0.0005349881,0.000528415,0.00044547598,0.00056308793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001692172,0.0010346422,0.0013147766,0.0039793337,0.0027023698,0.004598006,0.0018031338,0.0017810658,0.007979814],"category_scores_gemma":[0.006125294,0.0008072208,0.0014664466,0.0044130664,0.00565807,0.011679065,0.0031821297,0.00442615,0.0007113826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003781443,0.00002812771,0.00044190563,0.00004585852,0.0000073320116,0.00006786731,0.000468987,0.00053139974,0.00062661705,0.99328655,0.00091898936,0.003538574],"study_design_scores_gemma":[0.000008747253,0.000017995913,0.00034659612,0.000015833068,0.000011661753,0.00009655618,0.00023999289,0.0030151545,0.00034895475,0.99341255,0.0024765325,0.000009466942],"about_ca_topic_score_codex":0.0009322548,"about_ca_topic_score_gemma":0.00089543685,"teacher_disagreement_score":0.007979814,"about_ca_system_score_codex":0.0021260353,"about_ca_system_score_gemma":0.00057559455,"threshold_uncertainty_score":0.026695132},"labels":[],"label_agreement":null},{"id":"W9648232","doi":"10.1271/bbb.62.993","title":"New Series of Dudeney Sets for p + 2 Vertices.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Series (stratigraphy); Combinatorics; Geology","score_opus":0.012263626041807859,"score_gpt":0.20388496235456388,"score_spread":0.19162133631275602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W9648232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12794626,0.0025480222,0.54645395,0.0017362111,0.0018836304,0.0004816925,0.0043118494,0.0016115125,0.31302696],"genre_scores_gemma":[0.59589916,0.001959816,0.25362122,0.0013639791,0.0005064074,0.0008154858,0.0038796754,0.00069441367,0.14125985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993968,0.00013216943,0.000060106442,0.00015758774,0.00015407718,0.00009925691],"domain_scores_gemma":[0.9989611,0.0004740717,0.0000831888,0.00020583243,0.00016101921,0.000114746814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005493873,0.00058977574,0.0005121263,0.0022952962,0.0018235694,0.0019322064,0.0013272719,0.0008769404,0.028167631],"category_scores_gemma":[0.0026259492,0.0005429335,0.00089263514,0.0014276596,0.00094237435,0.0024836939,0.0016615591,0.0016030387,0.004187854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108706976,0.000055610268,0.00031547755,0.00026975194,0.000030787298,0.00018079692,0.00022631254,0.0044944338,0.003612654,0.9122551,0.013527441,0.064922936],"study_design_scores_gemma":[0.000056195717,0.00008001888,0.00039625465,0.0000938861,0.000025498515,0.00043720275,0.00010167833,0.016937526,0.0046596574,0.8891629,0.088009514,0.000039632396],"about_ca_topic_score_codex":0.00070627936,"about_ca_topic_score_gemma":0.0019229935,"teacher_disagreement_score":0.028167631,"about_ca_system_score_codex":0.001229016,"about_ca_system_score_gemma":0.0005034954,"threshold_uncertainty_score":0.094230115},"labels":[],"label_agreement":null},{"id":"W96987332","doi":"","title":"A 4-isosceles 7-point Set with Both Circle and Linear Restrictions.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Optics and Image Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Isosceles triangle; Mathematics; Set (abstract data type); Point (geometry); Geometry; Computer science","score_opus":0.006844861534135754,"score_gpt":0.19798520825627458,"score_spread":0.19114034672213884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W96987332","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36995903,0.0012346428,0.21124375,0.0031014269,0.0005487955,0.00016172424,0.00416238,0.00093036814,0.40865782],"genre_scores_gemma":[0.8235821,0.0006751623,0.08671422,0.00054160506,0.00035520646,0.00018514856,0.005510278,0.0003065864,0.082129665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988256,0.00022883016,0.000083727864,0.00019529586,0.0004688104,0.00019781175],"domain_scores_gemma":[0.99850595,0.0006221607,0.0001571189,0.00020980548,0.00033029172,0.00017464542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006054545,0.00055690284,0.00090681936,0.002767783,0.002011434,0.0030966483,0.0011228935,0.0012945288,0.021364177],"category_scores_gemma":[0.0021605282,0.0005127037,0.0010176562,0.0019999165,0.0020763276,0.0022681884,0.0025769584,0.0020920597,0.0061507123],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017041939,0.000045474622,0.0004087914,0.00010193261,0.000035327022,0.00032058574,0.00024685546,0.003212664,0.0022181445,0.965878,0.007965552,0.01939623],"study_design_scores_gemma":[0.00006841928,0.00007261923,0.0013303683,0.000058332054,0.00003723395,0.0009967396,0.00037263735,0.014213424,0.00383333,0.9263657,0.052591395,0.00005976846],"about_ca_topic_score_codex":0.0020719022,"about_ca_topic_score_gemma":0.0018148801,"teacher_disagreement_score":0.021364177,"about_ca_system_score_codex":0.0011057431,"about_ca_system_score_gemma":0.0007525807,"threshold_uncertainty_score":0.07147032},"labels":[],"label_agreement":null},{"id":"W97074593","doi":"","title":"C-Perfect K-Uniform Hypergraphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hypergraph; Mathematics; Combinatorics; Chromatic scale; Clique; Integer (computer science); Clique number; Discrete mathematics; Computer science","score_opus":0.009822721899947998,"score_gpt":0.2507579705319085,"score_spread":0.24093524863196053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W97074593","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5754836,0.0013934508,0.36140925,0.00073092163,0.00011201871,0.00017303858,0.0015037461,0.0005723708,0.058621544],"genre_scores_gemma":[0.9420822,0.00035789504,0.051739316,0.00020064904,0.00004615531,0.000079894315,0.0006159185,0.00005762524,0.0048203696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932706,0.00016016906,0.00003586002,0.00025123768,0.00010320838,0.00012255387],"domain_scores_gemma":[0.9972065,0.0011713812,0.00048175963,0.0005311335,0.00032117846,0.0002879876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005473144,0.00031929003,0.00030604374,0.0008885818,0.0011871906,0.0010961661,0.0006898485,0.0005066881,0.0046424097],"category_scores_gemma":[0.0031794882,0.0002771745,0.00031214647,0.0013358479,0.0012862319,0.002802515,0.0009901886,0.0004948362,0.00039970948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002908476,0.00004551006,0.00551321,0.00033688705,0.000052084273,0.0003310324,0.00029588904,0.013995605,0.0135553125,0.9278902,0.0036898903,0.034003556],"study_design_scores_gemma":[0.00007229854,0.00020754525,0.010226087,0.00014231614,0.00011697724,0.002905738,0.00069418544,0.10903229,0.024058182,0.81052357,0.041921455,0.00009942737],"about_ca_topic_score_codex":0.0014933165,"about_ca_topic_score_gemma":0.0020305763,"teacher_disagreement_score":0.0046424097,"about_ca_system_score_codex":0.0010140834,"about_ca_system_score_gemma":0.0005214578,"threshold_uncertainty_score":0.015530348},"labels":[],"label_agreement":null},{"id":"W97347673","doi":"","title":"Covering the Powers of the Complete Graph with a Bounded Number of Snakes.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bounded function; Graph; Combinatorics; Discrete mathematics; Mathematical analysis","score_opus":0.012341338833975098,"score_gpt":0.2553891607128465,"score_spread":0.24304782187887142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W97347673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34599203,0.0009455621,0.5287576,0.0007808789,0.0003119739,0.00014480572,0.0005429368,0.00071188377,0.12181231],"genre_scores_gemma":[0.8232043,0.0009994193,0.12664415,0.0002543904,0.00018177014,0.0001707543,0.00071522,0.00052775454,0.047302313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994628,0.00016138179,0.000023589464,0.00012921653,0.00013123812,0.00009184696],"domain_scores_gemma":[0.9972692,0.0010087085,0.0002655187,0.0008301058,0.00016396322,0.00046257084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045782494,0.00058031536,0.00072471076,0.0008034154,0.001206646,0.0014813598,0.001478682,0.0008367718,0.012606904],"category_scores_gemma":[0.0048825364,0.00058399356,0.000851777,0.0006718084,0.0016622832,0.0038420018,0.0024462114,0.0013461963,0.002164015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031634106,0.000090912064,0.0011127159,0.00021996956,0.00005516105,0.0006431948,0.00044853424,0.024981594,0.016739678,0.9044235,0.008699857,0.04226863],"study_design_scores_gemma":[0.000048185862,0.000107960914,0.00081802654,0.00007383565,0.000047852252,0.00077799236,0.00027836623,0.079586126,0.005743448,0.88645726,0.026038129,0.00002287699],"about_ca_topic_score_codex":0.0005974159,"about_ca_topic_score_gemma":0.0009776759,"teacher_disagreement_score":0.012606904,"about_ca_system_score_codex":0.00042884424,"about_ca_system_score_gemma":0.00027905765,"threshold_uncertainty_score":0.04217422},"labels":[],"label_agreement":null},{"id":"W974543216","doi":"","title":"On the Gracefulness of the Digraphs n-C m .","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Arithmetic","score_opus":0.010049641538381227,"score_gpt":0.21014307808589336,"score_spread":0.20009343654751213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W974543216","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5153581,0.002299537,0.22084956,0.0077519864,0.00044280346,0.00012976378,0.0019842575,0.00094576506,0.2502382],"genre_scores_gemma":[0.9445113,0.0009885707,0.026949178,0.0010236464,0.00027818157,0.00010517186,0.0009646089,0.00029265656,0.024886709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992581,0.000233747,0.000042289455,0.00018780038,0.000108687105,0.00016940919],"domain_scores_gemma":[0.9944575,0.00343469,0.00045052168,0.0008149297,0.00026138866,0.0005810171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010384342,0.0004995312,0.0006509031,0.001490363,0.0026752264,0.0029549159,0.0011224957,0.0011386062,0.010913147],"category_scores_gemma":[0.006040472,0.0006184307,0.0008056586,0.0012928316,0.0035633403,0.0057087,0.0027371412,0.0024054572,0.001275178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008292717,0.000025194224,0.0005609935,0.000048705715,0.000008153432,0.000058157562,0.00026805367,0.0020462924,0.00068966375,0.9843106,0.004270547,0.007630599],"study_design_scores_gemma":[0.000014241692,0.000012958356,0.0003867561,0.000017159535,0.000008385252,0.00006977811,0.000103518614,0.004088858,0.0003345282,0.99097276,0.003980321,0.000010700462],"about_ca_topic_score_codex":0.0033795985,"about_ca_topic_score_gemma":0.0045429426,"teacher_disagreement_score":0.010913147,"about_ca_system_score_codex":0.0017761817,"about_ca_system_score_gemma":0.0008564338,"threshold_uncertainty_score":0.036508083},"labels":[],"label_agreement":null},{"id":"W97490400","doi":"","title":"Hamiltonian decompositions of the tensor product of a complete graph and a complete bipartite graph.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Quartic graph; Bipartite graph; Combinatorics; Complete bipartite graph; Tensor product; Graph; Voltage graph; Discrete mathematics; Line graph; Pure mathematics","score_opus":0.008344616813618661,"score_gpt":0.18789505573802162,"score_spread":0.17955043892440295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W97490400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37945297,0.001582745,0.46051425,0.0012873966,0.00050748716,0.00015461464,0.001805559,0.00039146407,0.15430361],"genre_scores_gemma":[0.8794759,0.00059249095,0.06848269,0.00028091657,0.00021188363,0.00012585371,0.00097422785,0.00021616157,0.04963989],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964035,0.00010766271,0.00001808464,0.000059706555,0.0000913461,0.00008280056],"domain_scores_gemma":[0.99901414,0.0002572301,0.00018379971,0.00015293989,0.00016076461,0.00023114982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004422362,0.0003763034,0.00032765642,0.0015990927,0.00073000405,0.0012334354,0.00056744355,0.00052418496,0.014149893],"category_scores_gemma":[0.0012632976,0.00032405503,0.00052715396,0.0006722122,0.000932783,0.0019693952,0.000887769,0.000881248,0.0010650976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037326943,0.000022780478,0.00017185729,0.000037698428,0.000011396154,0.00008292884,0.00014220862,0.0030641053,0.001660468,0.98444206,0.003365396,0.0069616647],"study_design_scores_gemma":[0.000013639769,0.000019318328,0.00040141772,0.000021812593,0.000011661486,0.00013837247,0.00013356253,0.0327334,0.00065072236,0.96042365,0.0054391455,0.000013269786],"about_ca_topic_score_codex":0.001163966,"about_ca_topic_score_gemma":0.0023910382,"teacher_disagreement_score":0.014149893,"about_ca_system_score_codex":0.0006897522,"about_ca_system_score_gemma":0.00041566,"threshold_uncertainty_score":0.04733616},"labels":[],"label_agreement":null},{"id":"W97847320","doi":"","title":"The Lucas Matrix of Order 2k Sequence {L(2k)n).","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Sequence (biology); Order (exchange); Lucas sequence; Combinatorics; Biology; Genetics; Economics","score_opus":0.013093795304856352,"score_gpt":0.30149853064866444,"score_spread":0.2884047353438081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W97847320","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39970714,0.002333602,0.14346144,0.003215867,0.0023878487,0.00022209373,0.0032222176,0.0014760935,0.44397366],"genre_scores_gemma":[0.80768824,0.0006688844,0.03107285,0.00057139096,0.00032701495,0.00013242161,0.0013614511,0.0003268008,0.15785097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997156,0.000050409362,0.000011447478,0.00006077208,0.00008286328,0.00007890876],"domain_scores_gemma":[0.9997204,0.00003899467,0.00007424969,0.000034414115,0.00006886865,0.00006308837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015970346,0.00048775526,0.00029085382,0.0012292911,0.0011115284,0.001932501,0.00054372486,0.00090696884,0.030130196],"category_scores_gemma":[0.00094028783,0.00023167735,0.00019562375,0.00064551114,0.0009264148,0.0013979145,0.0012617422,0.00088883843,0.0097412085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021744231,0.000041448096,0.0007536836,0.00017266137,0.0000131276,0.00083703105,0.00043274922,0.0013846819,0.014593981,0.9115388,0.025429439,0.044584986],"study_design_scores_gemma":[0.000047085017,0.00012150863,0.002614428,0.00010983779,0.000014370557,0.0015193383,0.000578127,0.012348835,0.01089837,0.81166077,0.15999295,0.00009431199],"about_ca_topic_score_codex":0.0013116885,"about_ca_topic_score_gemma":0.0029558574,"teacher_disagreement_score":0.030130196,"about_ca_system_score_codex":0.0009205535,"about_ca_system_score_gemma":0.0006001304,"threshold_uncertainty_score":0.10079557},"labels":[],"label_agreement":null},{"id":"W98170933","doi":"","title":"The Vertex Linear Arboricity of Claw-Free Graphs with Small Degree.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arboricity; Mathematics; Claw; Vertex (graph theory); Combinatorics; Degree (music); Graph; Planar graph; Biology; Physics","score_opus":0.03536603412151292,"score_gpt":0.25515231468816724,"score_spread":0.2197862805666543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W98170933","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9099801,0.00059137226,0.031037528,0.00078521256,0.000057660756,0.000032982727,0.00048629416,0.00021847631,0.056810316],"genre_scores_gemma":[0.9909038,0.00026603063,0.0029223925,0.00007494327,0.000042815813,0.000019127097,0.00031774177,0.00003048525,0.0054226713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99985254,0.000034984598,0.0000067258243,0.0000335349,0.00003520089,0.00003707397],"domain_scores_gemma":[0.9980952,0.0011078005,0.00029075917,0.00015129986,0.00013031474,0.00022464506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015165108,0.00019887021,0.00018675816,0.0008521013,0.0005152745,0.0011387874,0.00050929433,0.00046437615,0.004740572],"category_scores_gemma":[0.0024917522,0.0002417497,0.00019126527,0.00071566744,0.00081280374,0.001267184,0.0006886064,0.000718774,0.0005697618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004642363,0.00012080164,0.009097011,0.00035705528,0.000053657674,0.0013976672,0.0009958335,0.022004329,0.031070916,0.8659874,0.009752373,0.05869863],"study_design_scores_gemma":[0.00006474411,0.00010769841,0.005989631,0.000062571795,0.00004987464,0.0011508489,0.00048391384,0.058192722,0.008313448,0.91713846,0.00841833,0.000027787468],"about_ca_topic_score_codex":0.0011229556,"about_ca_topic_score_gemma":0.00197755,"teacher_disagreement_score":0.004740572,"about_ca_system_score_codex":0.00031997322,"about_ca_system_score_gemma":0.00023719478,"threshold_uncertainty_score":0.01585877},"labels":[],"label_agreement":null},{"id":"W98468139","doi":"","title":"On The Usual Fibonacci and Generalized Order-k Pell Numbers.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Mathematics; Recurrence relation; Combinatorics; Diagonal; Fibonacci polynomials; Order (exchange); Sequence (biology); Matrix (chemical analysis); Pisano period; Diagonal matrix; Lucas number; Discrete mathematics; Arithmetic; Orthogonal polynomials","score_opus":0.013891831157975617,"score_gpt":0.2533013531428744,"score_spread":0.23940952198489876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W98468139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11935435,0.022608703,0.50931877,0.00224613,0.0021240716,0.00016200909,0.00084528094,0.00049362576,0.34284705],"genre_scores_gemma":[0.7264596,0.01930629,0.1805911,0.0013240881,0.0032529524,0.00031087655,0.00090697483,0.00027833594,0.06756969],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993506,0.00012654193,0.000042777265,0.00015115955,0.00023701873,0.000091795504],"domain_scores_gemma":[0.9993338,0.000276971,0.00010149817,0.0001159861,0.00012570532,0.00004603671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000749689,0.0009873473,0.00044628343,0.0017211379,0.0011130223,0.001546136,0.00071152387,0.0009796106,0.008348977],"category_scores_gemma":[0.0033188912,0.00034704525,0.0006371985,0.0018972623,0.0036838378,0.0057129366,0.0016266481,0.0015426126,0.002050244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066564103,0.0000031339912,0.00008063776,0.000041383148,0.0000019161723,0.00007510691,0.00012238721,0.000874153,0.00054389576,0.98766685,0.001143775,0.0094401045],"study_design_scores_gemma":[0.0000035301025,0.000016333759,0.00024959043,0.00002701228,0.0000049697182,0.00029053487,0.000045700333,0.0039034898,0.000733965,0.9729297,0.021776441,0.00001869306],"about_ca_topic_score_codex":0.001088987,"about_ca_topic_score_gemma":0.001429205,"teacher_disagreement_score":0.008348977,"about_ca_system_score_codex":0.0011436287,"about_ca_system_score_gemma":0.0005738969,"threshold_uncertainty_score":0.02793008},"labels":[],"label_agreement":null},{"id":"W98525897","doi":"","title":"Non-isomorphic Minimal Bicovers of K8.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.008540832429105345,"score_gpt":0.17758552450257495,"score_spread":0.16904469207346962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W98525897","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84535885,0.00037549878,0.016922176,0.00055363815,0.00014874944,0.00004596876,0.0005722998,0.00028287564,0.13573997],"genre_scores_gemma":[0.96121424,0.00014378486,0.00539647,0.00018384542,0.00004405537,0.00002602422,0.0007106747,0.000098255325,0.032182675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995449,0.00006175942,0.000021485215,0.00009027137,0.00009986023,0.00018169043],"domain_scores_gemma":[0.99932504,0.00018590639,0.00013621192,0.00011109684,0.00008818035,0.00015361409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001572898,0.00038755813,0.00032362988,0.0009986855,0.0015605994,0.0014066931,0.0005904495,0.00052506535,0.017418712],"category_scores_gemma":[0.0007087418,0.00030173908,0.00036256932,0.0006380277,0.00090701715,0.0013661947,0.0016383795,0.0008160465,0.002169353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007076461,0.0001652298,0.0023305546,0.00019292723,0.000048571863,0.0013766497,0.0010107064,0.0018358412,0.022126226,0.9273522,0.008769098,0.034084264],"study_design_scores_gemma":[0.0001282807,0.00012818103,0.0049937386,0.00008883575,0.00008097633,0.0018585715,0.0013764946,0.0061496454,0.020262947,0.9142525,0.05062582,0.00005403939],"about_ca_topic_score_codex":0.0015833579,"about_ca_topic_score_gemma":0.0025095767,"teacher_disagreement_score":0.017418712,"about_ca_system_score_codex":0.00071116496,"about_ca_system_score_gemma":0.00036747725,"threshold_uncertainty_score":0.058271408},"labels":[],"label_agreement":null},{"id":"W98685556","doi":"","title":"Tree Domination in Graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Tree (set theory); Forestry; Combinatorics; Geography","score_opus":0.013355501293034559,"score_gpt":0.2749717552010086,"score_spread":0.26161625390797405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W98685556","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33439118,0.014535853,0.28129965,0.008092374,0.0007580717,0.0001453203,0.0013294034,0.0009476096,0.35850057],"genre_scores_gemma":[0.9314171,0.0044776667,0.020480985,0.0008386055,0.00054117566,0.00009274734,0.0006708882,0.00016539662,0.041315358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916506,0.00023747403,0.0000409757,0.00014578344,0.0002511651,0.00015949593],"domain_scores_gemma":[0.9960937,0.0025819754,0.00031048537,0.0003474742,0.00037913473,0.00028721066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007270943,0.0002611455,0.0005392981,0.0016090209,0.0012773606,0.0024011345,0.00072632276,0.0009093514,0.0073020207],"category_scores_gemma":[0.0046349135,0.00030913396,0.0005234887,0.0019822083,0.0018599135,0.004021372,0.0013709631,0.0015830254,0.0010803605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053412565,0.000028709905,0.0014789725,0.00018069375,0.00003121779,0.00023792734,0.00063841545,0.0023367314,0.0021462655,0.94541395,0.011048007,0.036405716],"study_design_scores_gemma":[0.000014930792,0.000013970299,0.0009664174,0.000047157813,0.000028704695,0.0005639612,0.0002156043,0.00851351,0.0011467019,0.9694316,0.019045187,0.000012164259],"about_ca_topic_score_codex":0.0017757405,"about_ca_topic_score_gemma":0.0025405793,"teacher_disagreement_score":0.0073020207,"about_ca_system_score_codex":0.0013815548,"about_ca_system_score_gemma":0.00058744976,"threshold_uncertainty_score":0.024427652},"labels":[],"label_agreement":null},{"id":"W98729622","doi":"","title":"INTERMEDIATE AND LIMITING BEHAVIOR OF POWERS OF SOME CIRCULANT MATRICES","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Circulant matrix; Aperiodic graph; Combinatorics; Matrix (chemical analysis); Tensor product; Sequence (biology); Markov chain; Binary number; Discrete mathematics; Pure mathematics; Arithmetic","score_opus":0.02841793501223058,"score_gpt":0.2771187826397894,"score_spread":0.2487008476275588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W98729622","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7693852,0.00046012457,0.18517269,0.0006167746,0.00012427651,0.00006314687,0.00024445224,0.0005718274,0.0433615],"genre_scores_gemma":[0.9775318,0.00022317824,0.014270957,0.000086396285,0.00010691964,0.000061093306,0.00014140824,0.00012676089,0.0074513354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994149,0.00015458908,0.000028799232,0.0000999388,0.00014617396,0.00015552304],"domain_scores_gemma":[0.99523205,0.002238296,0.00068394537,0.00041308315,0.00059347844,0.000839195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010557731,0.0006165848,0.00049242075,0.0019037048,0.0011692435,0.0018074207,0.0010067386,0.0006426763,0.005671282],"category_scores_gemma":[0.009641854,0.00041166085,0.00048343994,0.0005622175,0.0023804507,0.0020841875,0.0008939336,0.0011805828,0.0007575412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010971662,0.00007125446,0.0018244785,0.0000691908,0.000015863743,0.00067809486,0.0004914961,0.011335064,0.009289997,0.96865416,0.0015630972,0.005897585],"study_design_scores_gemma":[0.000028291253,0.000102029095,0.0019070535,0.00006976104,0.000022179645,0.0006499285,0.00028290227,0.30985746,0.008742001,0.675099,0.0031797765,0.000059577495],"about_ca_topic_score_codex":0.0015440367,"about_ca_topic_score_gemma":0.0014629456,"teacher_disagreement_score":0.005671282,"about_ca_system_score_codex":0.0009585306,"about_ca_system_score_gemma":0.00069942215,"threshold_uncertainty_score":0.018972337},"labels":[],"label_agreement":null},{"id":"W98850468","doi":"","title":"On normal quotients of transitive graphs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Transitive relation; Quotient; Combinatorics; Pure mathematics; Discrete mathematics","score_opus":0.013214129911310128,"score_gpt":0.2670815271796967,"score_spread":0.2538673972683866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W98850468","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47096017,0.00374461,0.2006317,0.0031623922,0.0013645415,0.00020702135,0.0011127804,0.0011667745,0.3176499],"genre_scores_gemma":[0.9319981,0.0014776735,0.022047276,0.00046115008,0.00067191635,0.00010081741,0.0010893006,0.0005201044,0.041633707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981615,0.0005490374,0.00014212732,0.00033854035,0.0005024875,0.00030632733],"domain_scores_gemma":[0.9967168,0.0013424855,0.00042047782,0.00048169095,0.00043469635,0.0006036897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001293989,0.0009919051,0.0010693235,0.0034978532,0.0021551638,0.0042239535,0.001093782,0.0011050317,0.012303203],"category_scores_gemma":[0.0060651605,0.00062735606,0.0012278295,0.0017473042,0.004239024,0.008913212,0.0035575868,0.0024547868,0.002225366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044257908,0.000028335407,0.00040709763,0.00003609966,0.000008334957,0.00014978771,0.0004036473,0.0003933481,0.00068451965,0.9905974,0.0020499788,0.0051971865],"study_design_scores_gemma":[0.000012918004,0.000012805208,0.00016112026,0.000015022206,0.000006679249,0.00017383946,0.0001455374,0.0019483166,0.00037038792,0.99328107,0.00386543,0.0000070138385],"about_ca_topic_score_codex":0.0020756994,"about_ca_topic_score_gemma":0.0023154754,"teacher_disagreement_score":0.012303203,"about_ca_system_score_codex":0.0019080389,"about_ca_system_score_gemma":0.0004729822,"threshold_uncertainty_score":0.04115832},"labels":[],"label_agreement":null},{"id":"W98905922","doi":"","title":"Even (m1, m2, ..., mr)-cycle systems of the complete graph.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.007542788810694694,"score_gpt":0.18441058062592242,"score_spread":0.17686779181522772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W98905922","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5867246,0.0017854845,0.19662848,0.0016195263,0.0003999124,0.00019398659,0.0018343169,0.0005989637,0.21021476],"genre_scores_gemma":[0.9386916,0.0004386033,0.026176956,0.00028342972,0.000105296014,0.00009969435,0.0008363745,0.000095723284,0.033272363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965847,0.000088077875,0.000014431112,0.00008254211,0.000050363622,0.0001061043],"domain_scores_gemma":[0.9992586,0.00022209702,0.00014846653,0.000121611534,0.00012414322,0.00012517179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022063033,0.0003841329,0.0003065162,0.0010714674,0.0012152345,0.0014375321,0.0005685182,0.0007615736,0.014082086],"category_scores_gemma":[0.0013303966,0.00026241766,0.0003095026,0.000569267,0.00089718844,0.0016959962,0.000990935,0.0006806137,0.0015009479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012433356,0.000026715208,0.0009086909,0.00011049896,0.000026662674,0.0003221666,0.00023583948,0.0027631999,0.006644601,0.96636814,0.0057429746,0.016726118],"study_design_scores_gemma":[0.00003387974,0.000039437626,0.0011907571,0.000040109368,0.000029318064,0.00042235514,0.00021927968,0.012790466,0.0044218497,0.9590683,0.021716116,0.000028066566],"about_ca_topic_score_codex":0.001858801,"about_ca_topic_score_gemma":0.0033205291,"teacher_disagreement_score":0.014082086,"about_ca_system_score_codex":0.00076562306,"about_ca_system_score_gemma":0.0005500892,"threshold_uncertainty_score":0.047109246},"labels":[],"label_agreement":null},{"id":"W99117189","doi":"","title":"An Extremal Problem on the Potentially Kr+1-e Graphic Sequences.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01580827587581085,"score_gpt":0.25106317054749977,"score_spread":0.23525489467168892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W99117189","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4701637,0.0035929875,0.26728067,0.008276111,0.0007924189,0.00015142659,0.001735439,0.0007574402,0.24724971],"genre_scores_gemma":[0.89569145,0.0013939512,0.055039093,0.0008339789,0.00044529504,0.00013023843,0.0015435851,0.00023327464,0.044689156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949384,0.00013603033,0.000029837474,0.00010434742,0.00010549902,0.00013052612],"domain_scores_gemma":[0.99864846,0.00080036063,0.00016190195,0.00013434078,0.000102283564,0.00015271253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004898125,0.0006882938,0.0008465004,0.0015051184,0.0016400184,0.0027194396,0.0009314429,0.0020018923,0.020650053],"category_scores_gemma":[0.0051136278,0.00044203617,0.0005282893,0.0012795664,0.001601523,0.003003983,0.0021222623,0.002730158,0.002302349],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003287028,0.00007389154,0.0007192626,0.00022499282,0.00003185321,0.000595085,0.00023789691,0.00966549,0.0020279502,0.9236234,0.019152014,0.04331952],"study_design_scores_gemma":[0.00005718683,0.000056246245,0.00058929174,0.00006434909,0.00001930248,0.00066735427,0.00023290221,0.024376655,0.0013155456,0.95862967,0.013965014,0.00002655861],"about_ca_topic_score_codex":0.000641432,"about_ca_topic_score_gemma":0.0008612481,"teacher_disagreement_score":0.020650053,"about_ca_system_score_codex":0.0007407438,"about_ca_system_score_gemma":0.00041490563,"threshold_uncertainty_score":0.06908131},"labels":[],"label_agreement":null},{"id":"W99194335","doi":"","title":"Covering designs with minimum overlap.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.012091090598232719,"score_gpt":0.226835706924934,"score_spread":0.21474461632670128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W99194335","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13575116,0.0016461215,0.74969536,0.0010329315,0.00046060243,0.00027950003,0.001652901,0.0017105297,0.107770875],"genre_scores_gemma":[0.6830484,0.0013230438,0.2704406,0.0006570575,0.00043000857,0.00068609347,0.0020932904,0.00061559177,0.040705852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980623,0.0006076698,0.00015378313,0.00029981826,0.0005379186,0.00033842312],"domain_scores_gemma":[0.9951439,0.0024387327,0.00048663424,0.0011350076,0.00044316554,0.00035251444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014571574,0.00089479465,0.0010376475,0.0010589149,0.0009599448,0.0017580095,0.0011390755,0.001012958,0.013310029],"category_scores_gemma":[0.008017157,0.0005608933,0.000770342,0.0015216534,0.0009980885,0.002406391,0.002290053,0.0009832152,0.003990286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089018635,0.00019364367,0.0008898447,0.000649754,0.00010037166,0.00026170033,0.00035284372,0.043021988,0.0128939655,0.6711289,0.020667935,0.248949],"study_design_scores_gemma":[0.00020000506,0.0005501648,0.00069794484,0.00020753033,0.000104143925,0.0007647743,0.00019759257,0.089553215,0.01388891,0.83881366,0.054961324,0.00006071933],"about_ca_topic_score_codex":0.00038526047,"about_ca_topic_score_gemma":0.00077094714,"teacher_disagreement_score":0.013310029,"about_ca_system_score_codex":0.00078986865,"about_ca_system_score_gemma":0.001031627,"threshold_uncertainty_score":0.044526458},"labels":[],"label_agreement":null},{"id":"W99291367","doi":"","title":"The Fractional Vertex Linear Arboricity of Graphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arboricity; Mathematics; Vertex (graph theory); Combinatorics; Graph; Planar graph","score_opus":0.010957304689175594,"score_gpt":0.2678376617227024,"score_spread":0.2568803570335268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W99291367","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58875483,0.00276878,0.093991704,0.0036270968,0.00041152202,0.000042910662,0.00084914797,0.00035402464,0.30920005],"genre_scores_gemma":[0.9798411,0.00084632507,0.0065667517,0.0002488172,0.00022513517,0.000022017624,0.00030458288,0.000042049614,0.011903286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997664,0.00006764085,0.000010612572,0.00005013619,0.000050427792,0.000054755037],"domain_scores_gemma":[0.9987325,0.0007389263,0.00017213401,0.00015267852,0.00009658358,0.00010720823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022210697,0.00020656287,0.00022645704,0.0010652407,0.0009106007,0.001556459,0.00040944605,0.00066433015,0.007264387],"category_scores_gemma":[0.0028086596,0.00018838873,0.00026824055,0.0010328926,0.0014154009,0.0021143176,0.0007502199,0.0010448378,0.00075549097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008656704,0.000020933647,0.0010954611,0.00007664238,0.000010039132,0.00022729837,0.0002202835,0.0037987526,0.0024802724,0.9645913,0.004424694,0.022967698],"study_design_scores_gemma":[0.00001027764,0.000018727089,0.00066637393,0.000021369107,0.000009786354,0.00026770076,0.000114222035,0.009523866,0.0009794333,0.9816844,0.00669757,0.0000062020035],"about_ca_topic_score_codex":0.0011170673,"about_ca_topic_score_gemma":0.0014903026,"teacher_disagreement_score":0.007264387,"about_ca_system_score_codex":0.0006697576,"about_ca_system_score_gemma":0.00024886092,"threshold_uncertainty_score":0.024301767},"labels":[],"label_agreement":null},{"id":"W9954860","doi":"10.1103/physrevc.38.712","title":"Competition Graphs of Semiorders and the Conditions C(p) and C ∗ (p)","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Competition (biology); Combinatorics; Biology","score_opus":0.013193792900904899,"score_gpt":0.25350586300433825,"score_spread":0.24031207010343336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W9954860","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68422455,0.0005880907,0.22128594,0.0015133963,0.00017463753,0.0003966615,0.0022667586,0.0005106714,0.089039296],"genre_scores_gemma":[0.943983,0.00042895463,0.04595238,0.0003059578,0.00010244736,0.00036595418,0.0013918424,0.000069465736,0.007400017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979482,0.0004627046,0.0001807409,0.0004727993,0.00044591664,0.0004897184],"domain_scores_gemma":[0.987531,0.0062775826,0.001641566,0.0008748692,0.0014194557,0.0022555257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016378602,0.0005936567,0.0006834226,0.0016239817,0.0025293014,0.0025030144,0.0008513064,0.0012790522,0.006517869],"category_scores_gemma":[0.006503998,0.00060500455,0.0007994244,0.0016837023,0.00330082,0.0048021697,0.0014436219,0.0016077037,0.00043986953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018808024,0.000093037685,0.001833357,0.00013590093,0.000025581,0.00035843867,0.00032648668,0.0073779165,0.003661111,0.9750993,0.0024105138,0.00849023],"study_design_scores_gemma":[0.00010958089,0.00015369461,0.0032357858,0.0000616312,0.000050535316,0.00080512476,0.0007040948,0.04748963,0.0038766398,0.92639136,0.017041342,0.00008056597],"about_ca_topic_score_codex":0.0071806675,"about_ca_topic_score_gemma":0.010750847,"teacher_disagreement_score":0.0071806675,"about_ca_system_score_codex":0.002749342,"about_ca_system_score_gemma":0.002639148,"threshold_uncertainty_score":0.021804392},"labels":[],"label_agreement":null},{"id":"W99733679","doi":"","title":"Resonance of Plane Bipartite Graphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Plane (geometry); Combinatorics; Geometry; Graph","score_opus":0.024013511285043643,"score_gpt":0.2903899174885468,"score_spread":0.26637640620350317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W99733679","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3896057,0.0021309054,0.24746276,0.0043676603,0.0007118517,0.000090601054,0.0008311127,0.0007494974,0.35404998],"genre_scores_gemma":[0.95391065,0.00058703154,0.014971452,0.0006367842,0.00024228843,0.00006990442,0.00042442195,0.00015102133,0.0290064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995435,0.00014403528,0.0000141752,0.00008644735,0.00009538791,0.00011638221],"domain_scores_gemma":[0.99895394,0.00051078456,0.00014584023,0.00013368306,0.00011246845,0.00014331502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030877962,0.00030400837,0.00039547659,0.0013378431,0.0010357038,0.0014049486,0.00059532817,0.001256262,0.012734381],"category_scores_gemma":[0.0023231392,0.00026145866,0.00038749294,0.00060912065,0.0011327923,0.0020207614,0.0011776519,0.0011589957,0.0021969706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048592217,0.00001640492,0.00021202845,0.00004831068,0.00000706376,0.00007710518,0.00017511768,0.001468646,0.0029053593,0.98259497,0.005807785,0.0066387043],"study_design_scores_gemma":[0.000017780098,0.000016831835,0.00031096506,0.000021879114,0.0000076060514,0.00024025895,0.0002255234,0.014203935,0.0011472154,0.97639966,0.0073965536,0.000011777114],"about_ca_topic_score_codex":0.00085775356,"about_ca_topic_score_gemma":0.0008553361,"teacher_disagreement_score":0.012734381,"about_ca_system_score_codex":0.00059782946,"about_ca_system_score_gemma":0.0002495721,"threshold_uncertainty_score":0.04260075},"labels":[],"label_agreement":null}]}